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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1201.0219
|
Feng Xia
|
Feng Xia, Wei Zhang, Fangwei Ding, Ruonan Hao
|
A-GPS Assisted Wi-Fi Access Point Discovery on Mobile Devices for Energy
Saving
|
IEEE Global Information Infrastructure Symposium (GIIS 2011), August
2011, Da Nang, Vietnam
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices have been shipped with multiple wireless network interfaces in
order to meet their diverse communication and networking demands. In this
paper, we propose an A-GPS assisted scheme that discovers the nearest Wi-Fi
network access points (APs) by using user's location information. This allows
the user to switch to the Wi-Fi interface in an intelligent manner when she/he
arrives at the nearest Wi-Fi network AP. Therefore, it avoids the long periods
in idle state and greatly reduces the number of unnecessary Wi-Fi scans on the
mobile device. The experimental results demonstrate that our scheme effectively
saves energy for mobile devices integrated with Wi-Fi and cellular interfaces.
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2011 03:53:04 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Xia",
"Feng",
""
],
[
"Zhang",
"Wei",
""
],
[
"Ding",
"Fangwei",
""
],
[
"Hao",
"Ruonan",
""
]
] |
new_dataset
| 0.994715 |
1201.0394
|
Catalin Boja
|
Elena Purcaru, Cristian Toma
|
2D Barcode for DNA Encoding
|
12 pages, 3 figures, 15 tables
|
Purcaru, E. and Toma, C. (2011). 2D Barcode for DNA Encoding.
Journal Of Mobile, Embedded And Distributed Systems, 3(3), 142-153. Retrieved
from
http://www.jmeds.eu/index.php/jmeds/article/view/2D-Barcode-for-DNA-Encoding
| null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The paper presents a solution for endcoding/decoding DNA information in 2D
barcodes. First part focuses on the existing techniques and symbologies in 2D
barcodes field. The 2D barcode PDF417 is presented as starting point. The
adaptations and optimizations on PDF417 and on DataMatrix lead to the solution
- DNA2DBC - DeoxyriboNucleic Acid Two Dimensional Barcode. The second part
shows the DNA2DBC encoding/decoding process step by step. In conclusions are
enumerated the most important features of 2D barcode implementation for DNA.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2012 22:30:34 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Purcaru",
"Elena",
""
],
[
"Toma",
"Cristian",
""
]
] |
new_dataset
| 0.986827 |
1201.0398
|
Catalin Boja
|
Adrian Marius Chiuta
|
AES Encryption and Decryption Using Direct3D 10 API
|
7 pages, 4 figures
|
Chiuta, A. (2011). AES Encryption and Decryption Using Direct3D 10
API. Journal Of Mobile, Embedded And Distributed Systems, 3(2), 54-60.
Retrieved from http://www.jmeds.eu
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Current video cards (GPUs - Graphics Processing Units) are very programmable,
have become much more powerful than the CPUs and they are very affordable. In
this paper, we present an implementation for the AES algorithm using Direct3D
10 certified GPUs. The graphics API Direct3D 10 is the first version that
allows the use of integer operations, making from the traditional GPUs (that
works only with floating point numbers), General Purpose GPUs that can be used
for a large number of algorithms, including encryption. We present the
performance of the symmetric key encryption algorithm - AES, on a middle range
GPU and on a middle range quad core CPU. On the testing system, the developed
solution is almost 3 times faster on the GPU than on one single core CPU,
showing that the GPU can perform as an efficient cryptographic accelerator.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2012 23:03:10 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Chiuta",
"Adrian Marius",
""
]
] |
new_dataset
| 0.994007 |
1201.0428
|
Praveen Likhar
|
Praveen Likhar, Ravi Shankar Yadav and Keshava Rao M
|
Securing IEEE 802.11G WLAN Using OpenVPN and Its Impact Analysis
| null |
International Journal of Network Security & Its Applications
(IJNSA), Vol.3, No.6, November 2011, 97-113
|
10.5121/ijnsa.2011.3607
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Like most advances, wireless LAN poses both opportunities and risks. The
evolution of wireless networking in recent years has raised many serious
security issues. These security issues are of great concern for this technology
as it is being subjected to numerous attacks. Because of the free-space radio
transmission in wireless networks, eavesdropping becomes easy and consequently
a security breach may result in unauthorized access, information theft,
interference and service degradation. Virtual Private Networks (VPNs) have
emerged as an important solution to security threats surrounding the use of
public networks for private communications. While VPNs for wired line networks
have matured in both research and commercial environments, the design and
deployment of VPNs for WLAN is still an evolving field. This paper presents an
approach to secure IEEE 802.11g WLAN using OpenVPN, a transport layer VPN
solution and its impact on performance of IEEE 802.11g WLAN.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2012 05:56:03 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Likhar",
"Praveen",
""
],
[
"Yadav",
"Ravi Shankar",
""
],
[
"M",
"Keshava Rao",
""
]
] |
new_dataset
| 0.998053 |
1201.0540
|
Steven Obua
|
Steven Obua
|
ProofPeer - A Cloud-based Interactive Theorem Proving System
| null | null | null | null |
cs.MS cs.DL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ProofPeer strives to be a system for cloud-based interactive theorem proving.
After illustrating why such a system is needed, the paper presents some of the
design challenges that ProofPeer needs to meet to succeed. Contexts are
presented as a solution to the problem of sharing proof state among the users
of ProofPeer. Chronicles are introduced as a way to organize and version
contexts.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2012 21:48:33 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Obua",
"Steven",
""
]
] |
new_dataset
| 0.983757 |
1201.0598
|
Thomas Maugey
|
Thomas Maugey and Pascal Frossard
|
Interactive multiview video system with non-complex navigation at the
decoder
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiview video with interactive and smooth view switching at the receiver is
a challenging application with several issues in terms of effective use of
storage and bandwidth resources, reactivity of the system, quality of the
viewing experience and system complexity. The classical decoding system for
generating virtual views first projects a reference or encoded frame to a given
viewpoint and then fills in the holes due to potential occlusions. This last
step still constitutes a complex operation with specific software or hardware
at the receiver and requires a certain quantity of information from the
neighboring frames for insuring consistency between the virtual images. In this
work we propose a new approach that shifts most of the burden due to
interactivity from the decoder to the encoder, by anticipating the navigation
of the decoder and sending auxiliary information that guarantees temporal and
interview consistency. This leads to an additional cost in terms of
transmission rate and storage, which we minimize by using optimization
techniques based on the user behavior modeling. We show by experiments that the
proposed system represents a valid solution for interactive multiview systems
with classical decoders.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2012 09:19:58 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Maugey",
"Thomas",
""
],
[
"Frossard",
"Pascal",
""
]
] |
new_dataset
| 0.956878 |
1201.0662
|
Steven Weber
|
Steven Weber and Jeffrey G. Andrews
|
Transmission capacity of wireless networks
|
173 pages; Foundations and Trends in Networking, vol. 5, no. 2-3,
2012
| null | null | null |
cs.IT cs.NI cs.PF math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transmission capacity (TC) is a performance metric for wireless networks that
measures the spatial intensity of successful transmissions per unit area,
subject to a constraint on the permissible outage probability (where outage
occurs when the SINR at a receiver is below a threshold). This volume gives a
unified treatment of the TC framework that has been developed by the authors
and their collaborators over the past decade. The mathematical framework
underlying the analysis (reviewed in Ch. 2) is stochastic geometry: Poisson
point processes model the locations of interferers, and (stable) shot noise
processes represent the aggregate interference seen at a receiver. Ch. 3
presents TC results (exact, asymptotic, and bounds) on a simple model in order
to illustrate a key strength of the framework: analytical tractability yields
explicit performance dependence upon key model parameters. Ch. 4 presents
enhancements to this basic model --- channel fading, variable link distances,
and multi-hop. Ch. 5 presents four network design case studies well-suited to
TC: i) spectrum management, ii) interference cancellation, iii) signal
threshold transmission scheduling, and iv) power control. Ch. 6 studies the TC
when nodes have multiple antennas, which provides a contrast vs. classical
results that ignore interference.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2012 15:21:48 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Weber",
"Steven",
""
],
[
"Andrews",
"Jeffrey G.",
""
]
] |
new_dataset
| 0.966385 |
0909.3185
|
Lorena Ronquillo
|
J. Pujol, J. Rif\`a, L. Ronquillo
|
Construction of Additive Reed-Muller Codes
|
7 pages, Part of the material in this paper was presented without
proofs at the 18-th Symposium on Applied algebra, Algebraic algorithms, and
Error Correcting Codes (AAECC 2009), Tarragona, Spain, June 8-12, 2009
|
J. Pujol, J. Rifa and L. Ronquillo. Construction of Additive
Reed-Muller Codes. Applied Algebra, Algebraic Algorithms and Error-Correcting
Codes, LNCS 5527 (June 2009), pages 223-226
|
10.1007/978-3-642-02181-7
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The well known Plotkin construction is, in the current paper, generalized and
used to yield new families of Z2Z4-additive codes, whose length, dimension as
well as minimum distance are studied. These new constructions enable us to
obtain families of Z2Z4-additive codes such that, under the Gray map, the
corresponding binary codes have the same parameters and properties as the usual
binary linear Reed-Muller codes. Moreover, the first family is the usual binary
linear Reed-Muller family.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2009 11:13:02 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Dec 2011 11:52:08 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Pujol",
"J.",
""
],
[
"Rifà",
"J.",
""
],
[
"Ronquillo",
"L.",
""
]
] |
new_dataset
| 0.998602 |
1112.5728
|
M. Tariq Banday
|
Jameel A. Qadri and M. Tariq Banday
|
Web Accessibility - A timely recognized challenge
|
6 Pages
|
Qadri, J.A., Banday, M.T. (2009). "Web Accessibility - A timely
recognized challenge," The Business Review, ISSN: 0972-8384, 14(1&2), pp.
99-102
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web Accessibility for disabled people has posed a challenge to the civilized
societies that claim to uphold the principles of equal opportunity and
nondiscrimination. Certain concrete measures have been taken to narrow down the
digital divide between normal and disabled users of Internet technology. The
efforts have resulted in enactment of legislations and laws and mass awareness
about the discriminatory nature of the accessibility issue, besides the efforts
have resulted in the development of commensurate technological tools to develop
and test the Web accessibility. World Wide Web consortium's (W3C) Web
Accessibility Initiative (WAI) has framed a comprehensive document comprising
of set of guidelines to make the Web sites accessible to the users with
disabilities. This paper is about the issues and aspects surrounding Web
Accessibility. The details and scope are kept limited to comply with the aim of
the paper which is to create awareness and to provide basis for in-depth
investigation.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2011 14:31:36 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Qadri",
"Jameel A.",
""
],
[
"Banday",
"M. Tariq",
""
]
] |
new_dataset
| 0.998344 |
1112.5732
|
M. Tariq Banday
|
M. Tariq Banday and Jameel A. Qadri
|
Phishing - A Growing Threat to E-Commerce
|
8 Pages
|
Banday, M.T., Qadri, J.A. (2007). "Phishing - A Growing Threat to
E-Commerce," The Business Review, ISSN: 0972-8384, 12(2), pp. 76-83
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In today's business environment, it is difficult to imagine a workplace
without access to the web, yet a variety of email born viruses, spyware,
adware, Trojan horses, phishing attacks, directory harvest attacks, DoS
attacks, and other threats combine to attack businesses and customers. This
paper is an attempt to review phishing - a constantly growing and evolving
threat to Internet based commercial transactions. Various phishing approaches
that include vishing, spear phishng, pharming, keyloggers, malware, web
Trojans, and others will be discussed. This paper also highlights the latest
phishing analysis made by Anti-Phishing Working Group (APWG) and Korean
Internet Security Center.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2011 15:12:23 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Banday",
"M. Tariq",
""
],
[
"Qadri",
"Jameel A.",
""
]
] |
new_dataset
| 0.998237 |
1112.5947
|
Sergey Verlan
|
Sergiu Ivanov, Sergey Verlan
|
Random Context and Semi-Conditional Insertion-Deletion Systems
| null | null | null | null |
cs.FL cs.CC cs.CL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we introduce the operations of insertion and deletion working
in a random-context and semi-conditional manner. We show that the conditional
use of rules strictly increase the computational power. In the case of
semi-conditional insertion-deletion systems context-free insertion and deletion
rules of one symbol are sufficient to get the computational completeness. In
the random context case our results expose an asymmetry between the
computational power of insertion and deletion rules: systems of size $(2,0,0;
1,1,0)$ are computationally complete, while systems of size $(1,1,0;2,0,0)$
(and more generally of size $(1,1,0;p,1,1)$) are not. This is particularly
interesting because other control mechanisms like graph-control or matrix
control used together with insertion-deletion systems do not present such
asymmetry.
|
[
{
"version": "v1",
"created": "Tue, 27 Dec 2011 10:16:35 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Ivanov",
"Sergiu",
""
],
[
"Verlan",
"Sergey",
""
]
] |
new_dataset
| 0.97025 |
1112.5959
|
Pere J Ferrer Mr
|
M. A. Jaume, J. Paradells
|
Disseny d'un prototipus de xarxa MESH sense fils multir\'adio i
multicanal sobre OLSR modificat amb canal de senyalitzaci\'o dedicat
|
pages 243
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh cubes are used to improve the channel signaling.
|
[
{
"version": "v1",
"created": "Tue, 27 Dec 2011 13:35:38 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Jaume",
"M. A.",
""
],
[
"Paradells",
"J.",
""
]
] |
new_dataset
| 0.984593 |
1112.6096
|
Jacopo Mauro
|
Massimo Morara, Jacopo Mauro and Maurizio Gabbrielli
|
Solving XCSP problems by using Gecode
|
5 pages, http://ceur-ws.org/Vol-810 CILC 2011
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gecode is one of the most efficient libraries that can be used for constraint
solving. However, using it requires dealing with C++ programming details. On
the other hand several formats for representing constraint networks have been
proposed. Among them, XCSP has been proposed as a format based on XML which
allows us to represent constraints defined either extensionally or
intensionally, permits global constraints and has been the standard format of
the international competition of constraint satisfaction problems solvers. In
this paper we present a plug-in for solving problems specified in XCSP by
exploiting the Gecode solver. This is done by dynamically translating
constraints into Gecode library calls, thus avoiding the need to interact with
C++.
|
[
{
"version": "v1",
"created": "Wed, 28 Dec 2011 10:49:18 GMT"
}
] | 2011-12-30T00:00:00 |
[
[
"Morara",
"Massimo",
""
],
[
"Mauro",
"Jacopo",
""
],
[
"Gabbrielli",
"Maurizio",
""
]
] |
new_dataset
| 0.966346 |
1112.5424
|
Ofer Shir
|
Ofer M. Shir, Jonathan Roslund, Zaki Leghtas and Herschel Rabitz
|
Quantum Control Experiments as a Testbed for Evolutionary
Multi-Objective Algorithms
| null | null | null | null |
cs.NE math-ph math.MP quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Experimental multi-objective Quantum Control is an emerging topic within the
broad physics and chemistry applications domain of controlling quantum
phenomena. This realm offers cutting edge ultrafast laser laboratory
applications, which pose multiple objectives, noise, and possibly constraints
on the high-dimensional search. In this study we introduce the topic of
Multi-Observable Quantum Control (MOQC), and consider specific systems to be
Pareto optimized subject to uncertainty, either experimentally or by means of
simulated systems. The latter include a family of mathematical test-functions
with a practical link to MOQC experiments, which are introduced here for the
first time. We investigate the behavior of the multi-objective version of the
Covariance Matrix Adaptation Evolution Strategy (MO-CMA-ES) and assess its
performance on computer simulations as well as on laboratory closed-loop
experiments. Overall, we propose a comprehensive study on experimental
evolutionary Pareto optimization in high-dimensional continuous domains, draw
some practical conclusions concerning the impact of fitness disturbance on
algorithmic behavior, and raise several theoretical issues in the broad
evolutionary multi-objective context.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2011 19:32:21 GMT"
}
] | 2011-12-23T00:00:00 |
[
[
"Shir",
"Ofer M.",
""
],
[
"Roslund",
"Jonathan",
""
],
[
"Leghtas",
"Zaki",
""
],
[
"Rabitz",
"Herschel",
""
]
] |
new_dataset
| 0.9798 |
1112.4604
|
Jose Gracia
|
Steffen Brinkmann, Jos\'e Gracia, Christoph Niethammer, Rainer Keller
|
TEMANEJO - a debugger for task based parallel programming models
|
8 pages, presented at ParCO 2011, Ghent, Belgium
| null | null | null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the program Temanejo, a debugger for task based parallelisation
models such as StarSs. The challenge in debugging StarSs applications lies in
the fact that tasks are scheduled at runtime, i.e dynamically in accordance to
the data dependencies between them. Our tool assists the programmer in the
debugging process by visualising the task dependency graph and allowing to
control the scheduling of tasks. The toolset consists of the library Ayudame
which communicates with the StarSs runtime on one side and of the debugger
Temanejo on the other side which communicates with Ayudame. Temanejo provides a
graphical user interface with which the application can be analysed and
controlled.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2011 08:41:56 GMT"
}
] | 2011-12-22T00:00:00 |
[
[
"Brinkmann",
"Steffen",
""
],
[
"Gracia",
"José",
""
],
[
"Niethammer",
"Christoph",
""
],
[
"Keller",
"Rainer",
""
]
] |
new_dataset
| 0.999406 |
1112.4915
|
Jeremy Blackburn
|
Jeremy Blackburn and Ramanuja Simha and Nicolas Kourtellis and Xiang
Zuo and Clayton Long and Matei Ripeanu and John Skvoretz and Adriana
Iamnitchi
|
Cheaters in the Steam Community Gaming Social Network
| null | null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online gaming is a multi-billion dollar industry that entertains a large,
global population. One unfortunate phenomenon, however, poisons the competition
and the fun: cheating. The costs of cheating span from industry-supported
expenditures to detect and limit cheating, to victims' monetary losses due to
cyber crime.
This paper studies cheaters in the Steam Community, an online social network
built on top of the world's dominant digital game delivery platform. We
collected information about more than 12 million gamers connected in a global
social network, of which more than 700 thousand have their profiles flagged as
cheaters. We also collected in-game interaction data of over 10 thousand
players from a popular multiplayer gaming server. We show that cheaters are
well embedded in the social and interaction networks: their network position is
largely undistinguishable from that of fair players. We observe that the
cheating behavior appears to spread through a social mechanism: the presence
and the number of cheater friends of a fair player is correlated with the
likelihood of her becoming a cheater in the future. Also, we observe that there
is a social penalty involved with being labeled as a cheater: cheaters are
likely to switch to more restrictive privacy settings once they are tagged and
they lose more friends than fair players. Finally, we observe that the number
of cheaters is not correlated with the geographical, real-world population
density, or with the local popularity of the Steam Community.
This analysis can ultimately inform the design of mechanisms to deal with
anti-social behavior (e.g., spamming, automated collection of data) in generic
online social networks.
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2011 03:12:35 GMT"
}
] | 2011-12-22T00:00:00 |
[
[
"Blackburn",
"Jeremy",
""
],
[
"Simha",
"Ramanuja",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Zuo",
"Xiang",
""
],
[
"Long",
"Clayton",
""
],
[
"Ripeanu",
"Matei",
""
],
[
"Skvoretz",
"John",
""
],
[
"Iamnitchi",
"Adriana",
""
]
] |
new_dataset
| 0.997977 |
1112.5136
|
Richard West
|
Ye Li, Matthew Danish and Richard West
|
Quest-V: A Virtualized Multikernel for High-Confidence Systems
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper outlines the design of `Quest-V', which is implemented as a
collection of separate kernels operating together as a distributed system on a
chip. Quest-V uses virtualization techniques to isolate kernels and prevent
local faults from affecting remote kernels. This leads to a high-confidence
multikernel approach, where failures of system subcomponents do not render the
entire system inoperable. A virtual machine monitor for each kernel keeps track
of shadow page table mappings that control immutable memory access
capabilities. This ensures a level of security and fault tolerance in
situations where a service in one kernel fails, or is corrupted by a malicious
attack. Communication is supported between kernels using shared memory regions
for message passing. Similarly, device driver data structures are shareable
between kernels to avoid the need for complex I/O virtualization, or
communication with a dedicated kernel responsible for I/O. In Quest-V, device
interrupts are delivered directly to a kernel, rather than via a monitor that
determines the destination. Apart from bootstrapping each kernel, handling
faults and managing shadow page tables, the monitors are not needed. This
differs from conventional virtual machine systems in which a central monitor,
or hypervisor, is responsible for scheduling and management of host resources
amongst a set of guest kernels. In this paper we show how Quest-V can implement
novel fault isolation and recovery techniques that are not possible with
conventional systems. We also show how the costs of using virtualization for
isolation of system services does not add undue overheads to the overall system
performance.
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2011 19:02:12 GMT"
}
] | 2011-12-22T00:00:00 |
[
[
"Li",
"Ye",
""
],
[
"Danish",
"Matthew",
""
],
[
"West",
"Richard",
""
]
] |
new_dataset
| 0.991106 |
1112.4775
|
Yasir Malik
|
Usman Tariq, Yasir Malik, Man-Pyo Hong
|
NACS: non-overlapping AP's caching scheme to reduce handoff in 802.11
wireless LAN
|
6 Pages, 6 Figures, Conference Pager
| null |
10.1109/ICON.2005.1635434
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the escalation of the IEEE 802.11 based wireless networks, voice over IP
and analogous applications are also used over wireless networks. Recently, the
wireless LAN systems are spaciously deployed for public Internet services. In
public wireless LAN systems, reliable user authentication and mobility support
are indispensable issues. When a mobile device budges out the range of one
access point (AP) and endeavor to connect to new AP, it performs handoff.
Contemporarily, PNC and SNC were proposed to propagate the MN context to the
entire neighboring AP's on the wireless network with the help of neighbor
graph. In this paper, we proposed a non-overlapping AP's caching scheme (NACS),
which propagates the mobile node context to those AP's which do not overlap
with the current AP. To capture the topology of non-overlapping AP's in the
wireless network, non-overlapping graph (NOG) is generated at each AP.
Simulation results shows that NACS reduces the signaling cost of propagating
the MN context to the neighbor AP's in the wireless network.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2011 17:18:50 GMT"
}
] | 2011-12-21T00:00:00 |
[
[
"Tariq",
"Usman",
""
],
[
"Malik",
"Yasir",
""
],
[
"Hong",
"Man-Pyo",
""
]
] |
new_dataset
| 0.978162 |
1112.4791
|
Mirela Damian
|
Mirela Damian, Erik Demaine and Robin Flatland
|
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The
Delta-Unfolding Algorithm
|
15 pages, 10 figures
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that every orthogonal polyhedron homeomorphic to a sphere can be
unfolded without overlap while using only polynomially many (orthogonal) cuts.
By contrast, the best previous such result used exponentially many cuts. More
precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts
the polyhedron only where it is met by the grid of coordinate planes passing
through the vertices, together with Theta(n^2) additional coordinate planes
between every two such grid planes.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2011 18:26:24 GMT"
}
] | 2011-12-21T00:00:00 |
[
[
"Damian",
"Mirela",
""
],
[
"Demaine",
"Erik",
""
],
[
"Flatland",
"Robin",
""
]
] |
new_dataset
| 0.995449 |
1009.0579
|
Christian Duncan
|
Christian A. Duncan and David Eppstein and Michael T. Goodrich and
Stephen G. Kobourov and Martin N\"ollenburg
|
Lombardi Drawings of Graphs
|
Expanded version of paper appearing in the 18th International
Symposium on Graph Drawing (GD 2010). 13 pages, 7 figures
|
J. Graph Algorithms and Applications 16(1):85-108, 2012 (special
issue for GD 2010)
| null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of Lombardi graph drawings, named after the American
abstract artist Mark Lombardi. In these drawings, edges are represented as
circular arcs rather than as line segments or polylines, and the vertices have
perfect angular resolution: the edges are equally spaced around each vertex. We
describe algorithms for finding Lombardi drawings of regular graphs, graphs of
bounded degeneracy, and certain families of planar graphs.
|
[
{
"version": "v1",
"created": "Fri, 3 Sep 2010 03:36:03 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Duncan",
"Christian A.",
""
],
[
"Eppstein",
"David",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Kobourov",
"Stephen G.",
""
],
[
"Nöllenburg",
"Martin",
""
]
] |
new_dataset
| 0.999388 |
1105.1071
|
Yunlei Zhao
|
Andrew C. Yao, Yunlei Zhao
|
A New Family of Practical Non-Malleable Diffie-Hellman Protocols
| null | null | null | null |
cs.CR cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptography algorithm standards play a key role both to the practice of
information security and to cryptography theory research. Among them, the MQV
and HMQV protocols ((H)MQV, in short) are a family of (implicitly
authenticated) Diffie-Hellman key-exchange (DHKE) protocols that are widely
standardized and deployed. In this work, from some new perspectives and
approaches and under some new design rationales and insights, we develop a new
family of practical implicitly authenticated DHKE protocols, which enjoy
notable performance among security, privacy, efficiency and easy deployment. We
make detailed comparisons between our new DHKE protocols and (H)MQV, showing
that the newly developed protocols outperform HMQV in most aspects. Along the
way, guided by our new design rationales, we also identify a new vulnerability
(H)MQV, which brings some new perspectives (e.g., computational fairness) to
the literature.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2011 13:39:18 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jul 2011 06:46:35 GMT"
},
{
"version": "v3",
"created": "Sat, 16 Jul 2011 14:38:10 GMT"
},
{
"version": "v4",
"created": "Wed, 9 Nov 2011 03:33:45 GMT"
},
{
"version": "v5",
"created": "Mon, 19 Dec 2011 02:14:48 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Yao",
"Andrew C.",
""
],
[
"Zhao",
"Yunlei",
""
]
] |
new_dataset
| 0.995262 |
1111.3602
|
Davide Schipani
|
Michele Elia, Davide Schipani
|
On the Rabin signature
|
General revision; new section on blind signatures
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some Rabin signature schemes may be exposed to forgery; several variants are
here described to counter this vulnerability. Blind Rabin signatures are also
discussed.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2011 23:50:06 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Nov 2011 17:04:16 GMT"
},
{
"version": "v3",
"created": "Sat, 17 Dec 2011 18:11:00 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Elia",
"Michele",
""
],
[
"Schipani",
"Davide",
""
]
] |
new_dataset
| 0.999276 |
1112.4018
|
Phuc V. Nguyen Mr.
|
Phuc V. Nguyen
|
Mobile IP and protocol authentication extension
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile IP is an open standard, defined by the Internet Engineering Task Force
(IETF) RFC 3220. By using Mobile IP, you can keep the same IP address, stay
connected, and maintain ongoing applications while roaming between IP networks.
Mobile IP is scalable for the Internet because it is based on IP - any media
that can support IP can support Mobile IP.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2011 03:40:35 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Nguyen",
"Phuc V.",
""
]
] |
new_dataset
| 0.999226 |
1112.4019
|
Phuc V. Nguyen Mr.
|
Phuc V. Nguyen
|
Legal Resources Information System for Information Agencies of
Specialized Libraries
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, the rapid development of information technology and
communication has a strong impact to industry information - the library. The
mission of the industry when in fact the great social place to see the library
as knowledge management. Vietnam is in the process of building the rule of law
socialist orientation and improves the legal system. So in the current
development process, the law library plays an important role in the retention,
dissemination and provision of legal information service of legislative,
executive and judiciary, particularly especially research, teaching and
learning of law school. But the response of the legal information library
information agencies remains limited compared to the increasing demand of
users.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2011 03:48:36 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Nguyen",
"Phuc V.",
""
]
] |
new_dataset
| 0.962506 |
1112.4060
|
Bartlomiej Placzek
|
Bart{\l}omiej P{\l}aczek
|
A real time vehicles detection algorithm for vision based sensors
|
The final publication is available at http://www.springerlink.com
|
P{\l}aczek B., A real time vehicles detection algorithm for vision
based sensors, Lecture Notes in Computer Science 6375, Springer-Verlag,
Berlin Heidelberg, 2010, pp. 211-218
|
10.1007/978-3-642-15907-7_26
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A vehicle detection plays an important role in the traffic control at
signalised intersections. This paper introduces a vision-based algorithm for
vehicles presence recognition in detection zones. The algorithm uses linguistic
variables to evaluate local attributes of an input image. The image attributes
are categorised as vehicle, background or unknown features. Experimental
results on complex traffic scenes show that the proposed algorithm is effective
for a real-time vehicles detection.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2011 14:50:50 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Płaczek",
"Bartłomiej",
""
]
] |
new_dataset
| 0.997143 |
1112.4238
|
Praveen Chandrashekar
|
Praveen Chandrashekar and Ashish Garg
|
Vertex-centroid finite volume scheme on tetrahedral grids for
conservation laws
| null | null | null | null |
cs.NA cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vertex-centroid schemes are cell-centered finite volume schemes for
conservation laws which make use of vertex values to construct high resolution
schemes. The vertex values must be obtained through a consistent averaging
(interpolation) procedure. A modified interpolation scheme is proposed which is
better than existing schemes in giving positive weights in the interpolation
formula. A simplified reconstruction scheme is also proposed which is also more
accurate and efficient. For scalar conservation laws, we develop limited
versions of the schemes which are stable in maximum norm by constructing
suitable limiters. The schemes are applied to compressible flows governed by
the Euler equations of inviscid gas dynamics.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2011 04:54:47 GMT"
}
] | 2011-12-20T00:00:00 |
[
[
"Chandrashekar",
"Praveen",
""
],
[
"Garg",
"Ashish",
""
]
] |
new_dataset
| 0.999308 |
0912.1746
|
Pierre Lescanne
|
Pierre Lescanne (LIP), Perrinel Matthieu (LIP)
|
On the Rationality of Escalation
|
19 p. This paper is a duplicate of arXiv:1004.5257
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Escalation is a typical feature of infinite games. Therefore tools conceived
for studying infinite mathematical structures, namely those deriving from
coinduction are essential. Here we use coinduction, or backward coinduction (to
show its connection with the same concept for finite games) to study carefully
and formally the infinite games especially those called dollar auctions, which
are considered as the paradigm of escalation. Unlike what is commonly admitted,
we show that, provided one assumes that the other agent will always stop,
bidding is rational, because it results in a subgame perfect equilibrium. We
show that this is not the only rational strategy profile (the only subgame
perfect equilibrium). Indeed if an agent stops and will stop at every step, we
claim that he is rational as well, if one admits that his opponent will never
stop, because this corresponds to a subgame perfect equilibrium. Amazingly, in
the infinite dollar auction game, the behavior in which both agents stop at
each step is not a Nash equilibrium, hence is not a subgame perfect
equilibrium, hence is not rational.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2009 13:52:49 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Dec 2011 10:03:53 GMT"
}
] | 2011-12-16T00:00:00 |
[
[
"Lescanne",
"Pierre",
"",
"LIP"
],
[
"Matthieu",
"Perrinel",
"",
"LIP"
]
] |
new_dataset
| 0.985187 |
1112.2187
|
Chih-Yu Wang
|
Chih-Yu Wang and Yan Chen and K. J. Ray Liu
|
Chinese Restaurant Game - Part II: Applications to Wireless Networking,
Cloud Computing, and Online Social Networking
| null | null | null | null |
cs.SI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Part I of this two-part paper [1], we proposed a new game, called Chinese
restaurant game, to analyze the social learning problem with negative network
externality. The best responses of agents in the Chinese restaurant game with
imperfect signals are constructed through a recursive method, and the influence
of both learning and network externality on the utilities of agents is studied.
In Part II of this two-part paper, we illustrate three applications of Chinese
restaurant game in wireless networking, cloud computing, and online social
networking. For each application, we formulate the corresponding problem as a
Chinese restaurant game and analyze how agents learn and make strategic
decisions in the problem. The proposed method is compared with four
common-sense methods in terms of agents' utilities and the overall system
performance through simulations. We find that the proposed Chinese restaurant
game theoretic approach indeed helps agents make better decisions and improves
the overall system performance. Furthermore, agents with different decision
orders have different advantages in terms of their utilities, which also
verifies the conclusions drawn in Part I of this two-part paper.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 19:31:28 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Dec 2011 00:22:51 GMT"
}
] | 2011-12-16T00:00:00 |
[
[
"Wang",
"Chih-Yu",
""
],
[
"Chen",
"Yan",
""
],
[
"Liu",
"K. J. Ray",
""
]
] |
new_dataset
| 0.998963 |
1112.3307
|
Oliver Kosut
|
Oliver Kosut, Lang Tong, David Tse
|
Polytope Codes Against Adversaries in Networks
|
63 pages. Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network coding is studied when an adversary controls a subset of nodes in the
network of limited quantity but unknown location. This problem is shown to be
more difficult than when the adversary controls a given number of edges in the
network, in that linear codes are insufficient. To solve the node problem, the
class of Polytope Codes is introduced. Polytope Codes are constant composition
codes operating over bounded polytopes in integer vector fields. The polytope
structure creates additional complexity, but it induces properties on marginal
distributions of code vectors so that validities of codewords can be checked by
internal nodes of the network. It is shown that Polytope Codes achieve a
cut-set bound for a class of planar networks. It is also shown that this
cut-set bound is not always tight, and a tighter bound is given for an example
network.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2011 19:10:39 GMT"
}
] | 2011-12-15T00:00:00 |
[
[
"Kosut",
"Oliver",
""
],
[
"Tong",
"Lang",
""
],
[
"Tse",
"David",
""
]
] |
new_dataset
| 0.998775 |
1112.0057
|
Yi Hong Dr
|
Nirmal Fernando, Yi Hong and Emanuele Viterbo
|
Flip-OFDM for Unipolar Communication Systems
|
19 pages, 8 pages (re-uploaded with corrected Fig 2a)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unipolar communications systems can transmit information using only real and
positive signals. This includes a variety of physical channels ranging from
optical (fiber or free-space), to RF wireless using amplitude modulation with
non-coherent reception, to baseband single wire communications. Unipolar OFDM
techniques enable to efficiently compensate frequency selective distortion in
the unipolar communication systems. One of the leading examples of unipolar
OFDM is asymmetric clipped optical OFDM (ACO-OFDM) originally proposed for
optical communications. Flip-OFDM is an alternative approach that was proposed
in a patent, but its performance and full potentials have never been
investigated in the literature. In this paper, we first compare Flip-OFDM and
ACO-OFDM, and show that both techniques have the same performance but different
complexities (Flip-OFDM offers 50% saving). We then propose a new detection
scheme, which enables to reduce the noise at the Flip-OFDM receiver by almost
3dB. The analytical performance of the noise filtering schemes is supported by
the simulation results.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2011 00:36:34 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Dec 2011 12:25:25 GMT"
}
] | 2011-12-14T00:00:00 |
[
[
"Fernando",
"Nirmal",
""
],
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.991477 |
1104.4081
|
Shayan Oveis Gharan
|
Shayan Oveis Gharan, Jan Vondr\'ak
|
On Variants of the Matroid Secretary Problem
| null | null | null | null |
cs.DS cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a number of positive and negative results for variants of the
matroid secretary problem. Most notably, we design a constant-factor
competitive algorithm for the "random assignment" model where the weights are
assigned randomly to the elements of a matroid, and then the elements arrive
on-line in an adversarial order (extending a result of Soto \cite{Soto11}).
This is under the assumption that the matroid is known in advance. If the
matroid is unknown in advance, we present an $O(\log r \log n)$-approximation,
and prove that a better than $O(\log n / \log \log n)$ approximation is
impossible. This resolves an open question posed by Babaioff et al.
\cite{BIK07}.
As a natural special case, we also consider the classical secretary problem
where the number of candidates $n$ is unknown in advance. If $n$ is chosen by
an adversary from $\{1,...,N\}$, we provide a nearly tight answer, by providing
an algorithm that chooses the best candidate with probability at least
$1/(H_{N-1}+1)$ and prove that a probability better than $1/H_N$ cannot be
achieved (where $H_N$ is the $N$-th harmonic number).
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2011 17:38:01 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Dec 2011 20:16:51 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Gharan",
"Shayan Oveis",
""
],
[
"Vondrák",
"Jan",
""
]
] |
new_dataset
| 0.979844 |
1106.0342
|
Giordano Pola
|
Giordano Pola, Maria D. Di Benedetto and Elena De Santis
|
Arenas of Finite State Machines
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Finite state machines are widely used as a sound mathematical formalism that
appropriately describes large scale, distributed and complex systems. Multiple
interactions of finite state machines in complex systems are well captured by
the notion of non-flat systems. Non--flat systems are "finite state machines"
where each "state" can be either a basic state or an aggregate of finite state
machines. By expanding a non-flat system, a flat system is obtained which is an
ordinary finite state machine. In this paper we introduce a novel class of
non--flat systems called Arena of Finite State Machines (AFSM). AFSMs are
collections of finite state machines that interact concurrently through a
communication network. We propose a notion of compositional bisimulation that
allows checking bisimulation equivalence of AFSMs by directly exploiting their
communication networks and hence, without the need of expanding the AFSMs to
finite state machines. Compositional bisimulation allows a computational
complexity reduction when checking bisimulation equivalence of AFSMs, as
formally quantified in the paper. An application of the proposed framework to
the regulation of gene expression in the bacterium Escherichia coli is also
presented.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2011 23:57:42 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Dec 2011 16:01:49 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Pola",
"Giordano",
""
],
[
"Di Benedetto",
"Maria D.",
""
],
[
"De Santis",
"Elena",
""
]
] |
new_dataset
| 0.988988 |
1112.0896
|
Tuvi Etzion
|
Sarit Buzaglo and Tuvi Etzion
|
On the Existence of Perfect Codes for Asymmetric Limited-Magnitude
Errors
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Block codes, which correct asymmetric errors with limited-magnitude, are
studied. These codes have been applied recently for error correction in flash
memories. The codes will be represented by lattices and the constructions will
be based on a generalization of Sidon sequences. In particular we will consider
perfect codes for these type of errors.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2011 11:55:08 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Dec 2011 08:49:53 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Buzaglo",
"Sarit",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.995576 |
1112.2230
|
Travis Denny
|
Travis Denny
|
Faked states attack and quantum cryptography protocols
|
9 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Leveraging quantum mechanics, cryptographers have devised provably secure key
sharing protocols. Despite proving the security in theory, real-world
application falls short of the ideal. Last year, cryptanalysts completed an
experiment demonstrating a successful eavesdropping attack on commercial
quantum key distribution (QKD) systems. This attack exploits a weakness in the
typical real-world implementation of quantum cryptosystems. Cryptanalysts have
successfully attacked several protocols. In this paper, we examine the Kak
quantum cryptography protocol and how it may perform under such attacks.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 22:52:43 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Denny",
"Travis",
""
]
] |
new_dataset
| 0.997239 |
1112.2254
|
Abedelaziz Mohaisen
|
Abedelaziz Mohaisen and Huy Tran and Abhishek Chandra and Yongdae Kim
|
SocialCloud: Using Social Networks for Building Distributed Computing
Services
|
15 pages, 8 figures, 2 tables
| null | null | null |
cs.DC cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate a new computing paradigm, called SocialCloud, in
which computing nodes are governed by social ties driven from a bootstrapping
trust-possessing social graph. We investigate how this paradigm differs from
existing computing paradigms, such as grid computing and the conventional cloud
computing paradigms. We show that incentives to adopt this paradigm are
intuitive and natural, and security and trust guarantees provided by it are
solid. We propose metrics for measuring the utility and advantage of this
computing paradigm, and using real-world social graphs and structures of social
traces; we investigate the potential of this paradigm for ordinary users. We
study several design options and trade-offs, such as scheduling algorithms,
centralization, and straggler handling, and show how they affect the utility of
the paradigm. Interestingly, we conclude that whereas graphs known in the
literature for high trust properties do not serve distributed trusted computing
algorithms, such as Sybil defenses---for their weak algorithmic properties,
such graphs are good candidates for our paradigm for their self-load-balancing
features.
|
[
{
"version": "v1",
"created": "Sat, 10 Dec 2011 05:52:58 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Mohaisen",
"Abedelaziz",
""
],
[
"Tran",
"Huy",
""
],
[
"Chandra",
"Abhishek",
""
],
[
"Kim",
"Yongdae",
""
]
] |
new_dataset
| 0.994398 |
1112.2610
|
Asterios Katsifodimos
|
Konstantinos Karanasos (INRIA Saclay - Ile de France, LRI), Asterios
Katsifodimos (INRIA Saclay - Ile de France, LRI), Ioana Manolescu (INRIA
Saclay - Ile de France, LRI), Spyros Zoupanos (INRIA Saclay - Ile de France,
LRI, MPII)
|
The ViP2P Platform: XML Views in P2P
|
RR-7812 (2011)
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing volumes of XML data sources on the Web or produced by
enterprises, organizations etc. raise many performance challenges for data
management applications. In this work, we are concerned with the distributed,
peer-to-peer management of large corpora of XML documents, based on distributed
hash table (or DHT, in short) overlay networks. We present ViP2P (standing for
Views in Peer-to-Peer), a distributed platform for sharing XML documents based
on a structured P2P network infrastructure (DHT). At the core of ViP2P stand
distributed materialized XML views, defined by arbitrary XML queries, filled in
with data published anywhere in the network, and exploited to efficiently
answer queries issued by any network peer. ViP2P allows user queries to be
evaluated over XML documents published by peers in two modes. First, a
long-running subscription mode, when a query can be registered in the system
and receive answers incrementally when and if published data matches the query.
Second, queries can also be asked in an ad-hoc, snapshot mode, where results
are required immediately and must be computed based on the results of other
long-running, subscription queries. ViP2P innovates over other similar
DHT-based XML sharing platforms by using a very expressive structured XML query
language. This expressivity leads to a very flexible distribution of XML
content in the ViP2P network, and to efficient snapshot query execution. ViP2P
has been tested in real deployments of hundreds of computers. We present the
platform architecture, its internal algorithms, and demonstrate its efficiency
and scalability through a set of experiments. Our experimental results outgrow
by orders of magnitude similar competitor systems in terms of data volumes,
network size and data dissemination throughput.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2011 16:29:25 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Karanasos",
"Konstantinos",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Katsifodimos",
"Asterios",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Manolescu",
"Ioana",
"",
"INRIA\n Saclay - Ile de France, LRI"
],
[
"Zoupanos",
"Spyros",
"",
"INRIA Saclay - Ile de France,\n LRI, MPII"
]
] |
new_dataset
| 0.998437 |
1112.2649
|
Sebastian Gerling
|
Julian Backes, Michael Backes, Markus D\"urmuth, Sebastian Gerling,
Stefan Lorenz
|
X-pire! - A digital expiration date for images in social networks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet and its current information culture of preserving all kinds of
data cause severe problems with privacy. Most of today's Internet users,
especially teenagers, publish various kinds of sensitive information, yet
without recognizing that revealing this information might be detrimental to
their future life and career. Unflattering images that can be openly accessed
now and in the future, e.g., by potential employers, constitute a particularly
important such privacy concern. We have developed a novel, fast, and scalable
system called X-pire! that allows users to set an expiration date for images in
social networks (e.g., Facebook and Flickr) and on static websites, without
requiring any form of additional interaction with these web pages. Once the
expiration date is reached, the images become unavailable. Moreover, the
publishing user can dynamically prolong or shorten the expiration dates of his
images later, and even enforce instantaneous expiration. Rendering the approach
possible for social networks crucially required us to develop a novel technique
for embedding encrypted information within JPEG files in a way that survives
JPEG compression, even for highly optimized implementations of JPEG
post-processing with their various idiosyncrasies as commonly used in such
networks. We have implemented our system and conducted performance measurements
to demonstrate its robustness and efficiency.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2011 18:24:21 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Backes",
"Julian",
""
],
[
"Backes",
"Michael",
""
],
[
"Dürmuth",
"Markus",
""
],
[
"Gerling",
"Sebastian",
""
],
[
"Lorenz",
"Stefan",
""
]
] |
new_dataset
| 0.994981 |
1112.2661
|
Jong Yoon
|
Jong P. Yoon
|
Location- and Time-Dependent VPD for Privacy-Preserving Wireless
Accesses to Cloud Services
|
16 pages, 8 figures, International Journal on Cloud Computing:
Services and Architecture (IJCCSA)
| null | null | null |
cs.CR cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advent of smartphones in recent years has changed the wireless landscape.
Smartphones have become a platform for online user interface to cloud
databases. Cloud databases may provide a large set of user-private and
sensitive data (i.e., objects), while smartphone users (i.e., subjects) provide
location-sensitive information. Secure and private services in wireless
accessing to cloud databases have been discussed actively for the past recent
years. However, the previous techniques are unsatisfactory for dynamism of
moving subjects' wireless accesses. In this paper, we propose a novel technique
to dynamically generate virtual private databases (VPD) for each access by
taking subjects' location and time information into account. The contribution
of this paper includes a privacy-preserving access control mechanism for
dynamism of wireless access.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2011 19:22:24 GMT"
}
] | 2011-12-13T00:00:00 |
[
[
"Yoon",
"Jong P.",
""
]
] |
new_dataset
| 0.963994 |
1009.4517
|
Krishnam Raju Jampani
|
Bernhard Haeupler and Krishnam Raju Jampani and Anna Lubiw
|
Testing Simultaneous Planarity when the Common Graph is 2-Connected
|
Appeared in ISAAC 2010, 15 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two planar graphs G1 and G2 sharing some vertices and edges are
`simultaneously planar' if they have planar drawings such that a shared vertex
[edge] is represented by the same point [curve] in both drawings. It is an open
problem whether simultaneous planarity can be tested efficiently. We give a
linear-time algorithm to test simultaneous planarity when the two graphs share
a 2-connected subgraph. Our algorithm extends to the case of k planar graphs
where each vertex [edge] is either common to all graphs or belongs to exactly
one of them.
|
[
{
"version": "v1",
"created": "Thu, 23 Sep 2010 04:24:51 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Dec 2011 05:21:49 GMT"
}
] | 2011-12-12T00:00:00 |
[
[
"Haeupler",
"Bernhard",
""
],
[
"Jampani",
"Krishnam Raju",
""
],
[
"Lubiw",
"Anna",
""
]
] |
new_dataset
| 0.995242 |
1112.2021
|
Debasis Das
|
Debasis Das and Rajiv Misra
|
Programmable Cellular Automata Based Efficient Parallel AES Encryption
Algorithm
| null | null | null | null |
cs.DC cs.NI nlin.CG
|
http://creativecommons.org/licenses/by/3.0/
|
Cellular Automata(CA) is a discrete computing model which provides simple,
flexible and efficient platform for simulating complicated systems and
performing complex computation based on the neighborhoods information. CA
consists of two components 1) a set of cells and 2) a set of rules .
Programmable Cellular Automata(PCA) employs some control signals on a Cellular
Automata(CA) structure. Programmable Cellular Automata were successfully
applied for simulation of biological systems, physical systems and recently to
design parallel and distributed algorithms for solving task density and
synchronization problems. In this paper PCA is applied to develop cryptography
algorithms. This paper deals with the cryptography for a parallel AES
encryption algorithm based on programmable cellular automata. This proposed
algorithm based on symmetric key systems.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 05:47:31 GMT"
}
] | 2011-12-12T00:00:00 |
[
[
"Das",
"Debasis",
""
],
[
"Misra",
"Rajiv",
""
]
] |
new_dataset
| 0.993312 |
1112.2039
|
Mahmoud Elkhouly Prof
|
Mahmoud Mohamed El-Khouly
|
ECAKP: Encrypt Collect Authenticate Kill Play
|
8 pages, 1 figure, 2 tables
|
The International Journal of Multimedia & Its Applications (IJMA)
ISSN: 0975-5578 (online), 0975-5934 (print). 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are taught from a young age that plagiarism (copying other's work) is
wrong. However, the problem of Illegal copies of multimedia data is exacerbated
by the widespread availability of circumvention devices, which enable people to
make infringing copies of multimedia data. Recently, Joint Video Compression
and Encryption (JVCE) has gained increased attention to reduce the
computational complexity of video compression, as well as provide encryption of
multimedia data. In this paper, a novel protection method for multimedia data
(ECAKP) is proposed. It combines encryption process and compression with
authenticating process. The method had been implemented and the results are
discussed in detail.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 08:14:50 GMT"
}
] | 2011-12-12T00:00:00 |
[
[
"El-Khouly",
"Mahmoud Mohamed",
""
]
] |
new_dataset
| 0.996611 |
1112.2046
|
Purvang Dalal
|
Purvang Dalal, Nikhil Kothari and K. S. Dasgupta
|
Improving TCP Performance over Wireless Network with Frequent
Disconnections
|
16 Pages, 11 Figures; International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.6, November 2011
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Presented in this paper is the solution to the problem that arises when the
TCP/IP protocol suite is used to provide Internet connectivity through mobile
terminals over emerging 802.11 wireless links. Taking into consideration the
strong drive towards wireless Internet access through mobile terminals, the
problem of frequent disconnections causing serial timeouts is examined and
analyzed, with the help of extensive simulations. After a detailed review of
wireless link loss recovery mechanism and identification of related problems, a
new scheme with modifications at link layer and transport layer is proposed.
The proposed modifications which depend on interaction between two layers (i)
reduce the idle time before transmission at TCP by preventing timeout
occurrences and (ii) decouple the congestion control from recovery of the
losses due to link failure. Results of simulation based experiments demonstrate
considerable performance improvement with the proposed modifications over the
conventional TCP, when a wireless sender is experiencing frequent link
failures.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 08:36:34 GMT"
}
] | 2011-12-12T00:00:00 |
[
[
"Dalal",
"Purvang",
""
],
[
"Kothari",
"Nikhil",
""
],
[
"Dasgupta",
"K. S.",
""
]
] |
new_dataset
| 0.997492 |
1112.1742
|
Weidong Huang
|
Weidong Huang and Leila Alem and Jalal Albasri
|
HandsInAir: A Wearable System for Remote Collaboration
| null | null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by/3.0/
|
We present HandsInAir, a real-time collaborative wearable system for remote
collaboration. The system is developed to support real world scenarios in which
a remote mobile helper guides a local mobile worker performing a physical task.
HandsInAir implements a novel approach to support mobility of remote
collaborators. This approach allows the helper to perform gestures without
having to touch tangible objects, requiring little environment support. The
system consists of two parts: the helper part and the worker part. The two
parts are connected via a wireless network and the collaboration partners
communicate with each other via audio and visual links. In this paper, we
review related work, describe technical implementation of the system and
envision future work for further improvements.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2011 00:45:06 GMT"
}
] | 2011-12-09T00:00:00 |
[
[
"Huang",
"Weidong",
""
],
[
"Alem",
"Leila",
""
],
[
"Albasri",
"Jalal",
""
]
] |
new_dataset
| 0.999779 |
1112.1770
|
Rajai Nasser
|
Rajai Nasser
|
Polar codes for the m-user multiple access channels
|
21 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are constructed for m-user multiple access channels (MAC) whose
input alphabet size is a prime number. The block error probability under
successive cancelation decoding decays exponentially with the square root of
the block length. Although the sum capacity is achieved by this coding scheme,
some points in the symmetric capacity region may not be achieved. In the case
where the channel is a combination of linear channels, we provide a necessary
and sufficient condition characterizing the channels whose symmetric capacity
region is preserved upon the polarization process. We also provide a sufficient
condition for having a total loss in the dominant face.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2011 07:01:08 GMT"
}
] | 2011-12-09T00:00:00 |
[
[
"Nasser",
"Rajai",
""
]
] |
new_dataset
| 0.999844 |
1112.1848
|
Tristan Crolard
|
Tristan Crolard
|
A Formally Specified Program Logic for Higher-Order Procedural Variables
and non-local Jumps
| null | null | null |
TR-LACL-2011-5
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We formally specified a program logic for higher-order procedural variables
and non-local jumps with Ott and Twelf. Moreover, the dependent type systems
and the translation are both executable specifications thanks to Twelf's logic
programming engine. In particular, relying on Filinski's encoding of
shift/reset using callcc/throw and a global meta-continuation (simulated in
state passing style), we have mechanically checked the correctness of a few
examples (all source files are available on request).
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2011 14:36:59 GMT"
}
] | 2011-12-09T00:00:00 |
[
[
"Crolard",
"Tristan",
""
]
] |
new_dataset
| 0.954868 |
1112.1932
|
Bachir Chihani
|
Bachir Chihani, Collange Denis
|
A Multipath TCP model for ns-3 simulator
|
Accepted Paper; Workshop on ns-3 held in conjunction with SIMUTools
2011, Barcelona : Spain (2011)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an implementation of Multipath TCP (MPTCP) under the NS-3 open
source network simulator. MPTCP is a promising extension of TCP currently
considered by the recent eponymous IETF working group, with the objective of
improving the performance of TCP, especially its robustness to variable network
conditions. We describe this new protocol, its main functions and our
implementation in NS-3. Besides this implementation compliant to the current
versions of the IETF drafts, we have also added and compared various packet
reordering mechanisms. We indeed notice that such mechanisms highly improve the
performance of MPTCP. We believe that our implementation could be useful for
future works in MPTCP performance evaluation, especially to compare packet
reordering algorithms or coupling congestion control mechanisms between
subfows.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2011 20:13:43 GMT"
}
] | 2011-12-09T00:00:00 |
[
[
"Chihani",
"Bachir",
""
],
[
"Denis",
"Collange",
""
]
] |
new_dataset
| 0.997722 |
1112.1484
|
Sudam Sekhar panda
|
S.S. Panda, M.S.R.S Prasad, G. Jena
|
POCS Based Super-Resolution Image Reconstruction Using an Adaptive
Regularization Parameter
|
4 pages,2 fig,2 tables,Published in IJCSI International Journal of
Computer Science Issues, Vol. 8, Issue 5, No 2, September 2011 ISSN (Online):
1694-0814
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 5, No 2, September 2011 ISSN (Online): 1694-0814
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crucial information barely visible to the human eye is often embedded in a
series of low-resolution images taken of the same scene. Super-resolution
enables the extraction of this information by reconstructing a single image, at
a high resolution than is present in any of the individual images. This is
particularly useful in forensic imaging, where the extraction of minute details
in an image can help to solve a crime. Super-resolution image restoration has
been one of the most important research areas in recent years which goals to
obtain a high resolution (HR) image from several low resolutions (LR) blurred,
noisy, under sampled and displaced images. Relation of the HR image and LR
images can be modeled by a linear system using a transformation matrix and
additive noise. However, a unique solution may not be available because of the
singularity of transformation matrix. To overcome this problem, POCS method has
been used. However, their performance is not good because the effect of noise
energy has been ignored. In this paper, we propose an adaptive regularization
approach based on the fact that the regularization parameter should be a linear
function of noise variance. The performance of the proposed approach has been
tested on several images and the obtained results demonstrate the superiority
of our approach compared with existing methods.
|
[
{
"version": "v1",
"created": "Wed, 7 Dec 2011 06:29:07 GMT"
}
] | 2011-12-08T00:00:00 |
[
[
"Panda",
"S. S.",
""
],
[
"Prasad",
"M. S. R. S",
""
],
[
"Jena",
"G.",
""
]
] |
new_dataset
| 0.960425 |
1112.1316
|
Emmanuel Polonowski
|
Emmanuel Polonowski
|
Generic Environments in Coq
|
6 pages; The Third Coq Workshop (Coq'3), 2011
| null | null |
TR--LACL--2011--3
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a library which provides an abstract data type of environments,
as a functor parameterized by a module defining variables, and a function which
builds environments for such variables with any Type of type. Usual operations
over environments are defined, along with an extensive set of basic and more
advanced properties. Moreover, we give an implementation using lists satisfying
all the required properties.
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 15:39:48 GMT"
}
] | 2011-12-07T00:00:00 |
[
[
"Polonowski",
"Emmanuel",
""
]
] |
new_dataset
| 0.998738 |
1012.3531
|
Laszlo Kish
|
Ferdinand Peper, Laszlo B. Kish
|
Instantaneous, non-squeezed, noise-based logic
|
6 pages
|
Fluctuation and Noise Letters 10 (2011) 231-237
|
10.1142/S0219477511000521
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Noise-based logic, by utilizing its multidimensional logic hyperspace, has
significant potential for low-power parallel operations in beyond-Moore-chips.
However universal gates for Boolean logic thus far had to rely on either time
averaging to distinguish signals from each other or, alternatively, on squeezed
logic signals, where the logic-high was represented by a random process and the
logic-low was a zero signal. A major setback is that squeezed logic variables
are unable to work in the hyperspace, because the logic-low zero value sets the
hyperspace product vector to zero. This paper proposes Boolean universal logic
gates that alleviate such shortcomings. They are able to work with non-squeezed
logic values where both the high and low values are encoded into nonzero,
bipolar, independent random telegraph waves. Non-squeezed universal Boolean
logic gates for spike-based brain logic are also shown. The advantages vs.
disadvantages of the two logic types are compared.
|
[
{
"version": "v1",
"created": "Thu, 16 Dec 2010 08:42:35 GMT"
}
] | 2011-12-06T00:00:00 |
[
[
"Peper",
"Ferdinand",
""
],
[
"Kish",
"Laszlo B.",
""
]
] |
new_dataset
| 0.962406 |
1105.1824
|
Haris Aziz
|
Haris Aziz and Paul Harrenstein and Evangelia Pyrga
|
Individual-based stability in hedonic games depending on the best or
worst players
|
16 pages
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider coalition formation games in which each player has preferences
over the other players and his preferences over coalitions are based on the
best player ($\mathcal{B}$-/B-hedonic games) or the worst player
($\mathcal{W}$/W-hedonic games) in the coalition. We show that for
$\mathcal{B}$-hedonic games, an individually stable partition is guaranteed to
exist and can be computed efficiently. Similarly, there exists a
polynomial-time algorithm which returns a Nash stable partition (if one exists)
for $\mathcal{B}$-hedonic games with strict preferences. Both $\mathcal{W}$-
and W-hedonic games are equivalent if individual rationality is assumed. It is
also shown that for B- or $\mathcal{W}$-hedonic games, checking whether a Nash
stable partition or an individually stable partition exists is NP-complete even
in some cases for strict preferences. We identify a key source of
intractability in compact coalition formation games in which preferences over
players are extended to preferences over coalitions.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2011 23:51:47 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Dec 2011 08:20:21 GMT"
}
] | 2011-12-06T00:00:00 |
[
[
"Aziz",
"Haris",
""
],
[
"Harrenstein",
"Paul",
""
],
[
"Pyrga",
"Evangelia",
""
]
] |
new_dataset
| 0.97672 |
1112.0992
|
Michalis Vafopoulos n
|
Michalis Vafopoulos
|
The Web economy: goods, users, models and policies
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web emerged as an antidote to the rapidly increasing quantity of accumulated
knowledge and become successful because it facilitates massive participation
and communication with minimum costs. Today, its enormous impact, scale and
dynamism in time and space make very difficult (and sometimes impossible) to
measure and anticipate the effects in human society. In addition to that, we
demand from the Web to be fast, secure, reliable, all-inclusive and trustworthy
in any transaction. The scope of the present article is to review a part of the
Web economy literature that will help us to identify its major participants and
their functions. The goal is to understand how the Web economy differs from the
traditional setting and what implications have these differences. Secondarily,
we attempt to establish a minimal common understanding about the incentives and
properties of the Web economy. In this direction the concept of Web Goods and a
new classification of Web Users are introduced and analyzed This article, is
not, by any means, a thorough review of the economic literature related to the
Web. We focus only on its relevant part that models the Web as a standalone
economic artifact with native functionality and processes.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2011 16:53:51 GMT"
}
] | 2011-12-06T00:00:00 |
[
[
"Vafopoulos",
"Michalis",
""
]
] |
new_dataset
| 0.982704 |
1112.1038
|
James Fowler
|
Jason J. Jones, Robert M. Bond, Christopher J. Fariss, Jaime E.
Settle, Adam Kramer, Cameron Marlow, James H. Fowler
|
Yahtzee: An Anonymized Group Level Matching Procedure
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Researchers often face the problem of needing to protect the privacy of
subjects while also needing to integrate data that contains personal
information from diverse data sources in order to conduct their research. The
advent of computational social science and the enormous amount of data about
people that is being collected makes protecting the privacy of research
subjects evermore important. However, strict privacy procedures can make
joining diverse sources of data that contain information about specific
individual behaviors difficult. In this paper we present a procedure to keep
information about specific individuals from being "leaked" or shared in either
direction between two sources of data. To achieve this goal, we randomly assign
individuals to anonymous groups before combining the anonymized information
between the two sources of data. We refer to this method as the Yahtzee
procedure, and show that it performs as expected theoretically when we apply it
to data from Facebook and public voter records.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2011 19:49:00 GMT"
}
] | 2011-12-06T00:00:00 |
[
[
"Jones",
"Jason J.",
""
],
[
"Bond",
"Robert M.",
""
],
[
"Fariss",
"Christopher J.",
""
],
[
"Settle",
"Jaime E.",
""
],
[
"Kramer",
"Adam",
""
],
[
"Marlow",
"Cameron",
""
],
[
"Fowler",
"James H.",
""
]
] |
new_dataset
| 0.985394 |
1112.0393
|
Shahram Babaie
|
Saeid Bahanfar, Ladan Darougaran, Helia Kousha and Shahram Babaie
|
Reliable Communication in Wireless Body Area Sensor Network for Health
Monitoring
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Now days, interests in the application of Wireless Body Area Network (WBAN)
have grown considerably. A number of tiny wireless sensors, strategically
placed on the human body, create a wireless body area network that can monitor
various vital signs, providing real-time feedback to the user and medical
personnel. This communication needs to be energy efficient and highly reliable
while keeping delays low. In this paper we present hardware and software
architecture for BAN and also we offer reliable communication and data
aggregation.
|
[
{
"version": "v1",
"created": "Fri, 2 Dec 2011 06:13:01 GMT"
}
] | 2011-12-05T00:00:00 |
[
[
"Bahanfar",
"Saeid",
""
],
[
"Darougaran",
"Ladan",
""
],
[
"Kousha",
"Helia",
""
],
[
"Babaie",
"Shahram",
""
]
] |
new_dataset
| 0.991003 |
1006.3167
|
Frederic Mazoit
|
Fr\'ed\'eric Mazoit (LaBRI)
|
Tree-width of hypergraphs and surface duality
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Graph Minors III, Robertson and Seymour write: "It seems that the
tree-width of a planar graph and the tree-width of its geometric dual are
approximately equal - indeed, we have convinced ourselves that they differ by
at most one". They never gave a proof of this. In this paper, we prove a
generalisation of this statement to embedding of hypergraphs on general
surfaces, and we prove that our bound is tight.
|
[
{
"version": "v1",
"created": "Wed, 16 Jun 2010 09:00:16 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Dec 2011 14:15:58 GMT"
}
] | 2011-12-02T00:00:00 |
[
[
"Mazoit",
"Frédéric",
"",
"LaBRI"
]
] |
new_dataset
| 0.994783 |
1012.2835
|
Anil Hirani
|
Anil N. Hirani, Kaushik Kalyanaraman, Han Wang, and Seth Watts
|
Cohomologous Harmonic Cochains
|
Language improvements to version 7. Content is otherwise the same as
version 7
| null | null | null |
cs.CG math.GT math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe algorithms for finding harmonic cochains, an essential ingredient
for solving elliptic partial differential equations in exterior calculus.
Harmonic cochains are also useful in computational topology and computer
graphics. We focus on finding harmonic cochains cohomologous to a given
cocycle. Amongst other things, this allows localization near topological
features of interest. We derive a weighted least squares method by proving a
discrete Hodge-deRham theorem on the isomorphism between the space of harmonic
cochains and cohomology. The solution obtained either satisfies the Whitney
form finite element exterior calculus equations or the discrete exterior
calculus equations for harmonic cochains, depending on the discrete Hodge star
used.
|
[
{
"version": "v1",
"created": "Mon, 13 Dec 2010 19:22:41 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Jun 2011 19:58:18 GMT"
},
{
"version": "v3",
"created": "Sat, 11 Jun 2011 13:55:56 GMT"
},
{
"version": "v4",
"created": "Thu, 7 Jul 2011 19:47:22 GMT"
},
{
"version": "v5",
"created": "Thu, 14 Jul 2011 19:44:02 GMT"
},
{
"version": "v6",
"created": "Mon, 15 Aug 2011 12:42:25 GMT"
},
{
"version": "v7",
"created": "Tue, 22 Nov 2011 20:26:36 GMT"
},
{
"version": "v8",
"created": "Thu, 1 Dec 2011 20:01:46 GMT"
}
] | 2011-12-02T00:00:00 |
[
[
"Hirani",
"Anil N.",
""
],
[
"Kalyanaraman",
"Kaushik",
""
],
[
"Wang",
"Han",
""
],
[
"Watts",
"Seth",
""
]
] |
new_dataset
| 0.971408 |
1112.0168
|
Achraf Othman
|
Achraf Othman, and Mohamed Jemni
|
Statistical Sign Language Machine Translation: from English written text
to American Sign Language Gloss
|
9 pages
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 5, No 3, 2011, 65-73
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This works aims to design a statistical machine translation from English text
to American Sign Language (ASL). The system is based on Moses tool with some
modifications and the results are synthesized through a 3D avatar for
interpretation. First, we translate the input text to gloss, a written form of
ASL. Second, we pass the output to the WebSign Plug-in to play the sign.
Contributions of this work are the use of a new couple of language English/ASL
and an improvement of statistical machine translation based on string matching
thanks to Jaro-distance.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2011 12:52:22 GMT"
}
] | 2011-12-02T00:00:00 |
[
[
"Othman",
"Achraf",
""
],
[
"Jemni",
"Mohamed",
""
]
] |
new_dataset
| 0.980252 |
1111.7051
|
Arup Pal
|
Arup Kumar Pal, G.P. Biswas and S. Mukhopadhyay
|
Design of Image Cryptosystem by Simultaneous VQ-Compression and
Shuffling of Codebook and Index Matrix
| null |
The International journal of Multimedia & Its Applications (IJMA),
Vol.1, No.1, November 2009
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The popularity of Internet usage although increases exponentially, it is
incapable of providing the security for exchange of confidential data between
the users. As a result, several cryptosystems for encryption of data and images
have been developed for secured transmission over Internet. In this work, a
scheme for Image encryption/decryption based on Vector Quantization (VQ) has
been proposed that concurrently encodes the images for compression and shuffles
the codebook and the index matrix using pseudorandom sequences for encryption.
The processing time of the proposed scheme is much less than the other
cryptosystems, because it does not use any traditional cryptographic
operations, and instead it performs swapping between the contents of the
codebook with respect to a random sequence, which resulted an indirect
shuffling of the contents of the index matrix. It may be noted that the
security of the proposed cryptosystem depends on the generation and the
exchange of the random sequences used. Since the generation of truly random
sequences are not practically feasible, we simulate the proposed scheme using
MATLAB, where its operators like rand(method, seed), randperm(n) has been used
to generate pseudorandom sequences and it has been seen that the proposed
cryptosystem shows the expected performance.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2011 05:36:51 GMT"
}
] | 2011-12-01T00:00:00 |
[
[
"Pal",
"Arup Kumar",
""
],
[
"Biswas",
"G. P.",
""
],
[
"Mukhopadhyay",
"S.",
""
]
] |
new_dataset
| 0.9919 |
1111.7166
|
Michael Armbrust
|
Michael Armbrust, Kristal Curtis, Tim Kraska, Armando Fox, Michael J.
Franklin, David A. Patterson
|
PIQL: Success-Tolerant Query Processing in the Cloud
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp.
181-192 (2011)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Newly-released web applications often succumb to a "Success Disaster," where
overloaded database machines and resulting high response times destroy a
previously good user experience. Unfortunately, the data independence provided
by a traditional relational database system, while useful for agile
development, only exacerbates the problem by hiding potentially expensive
queries under simple declarative expressions. As a result, developers of these
applications are increasingly abandoning relational databases in favor of
imperative code written against distributed key/value stores, losing the many
benefits of data independence in the process. Instead, we propose PIQL, a
declarative language that also provides scale independence by calculating an
upper bound on the number of key/value store operations that will be performed
for any query. Coupled with a service level objective (SLO) compliance
prediction model and PIQL's scalable database architecture, these bounds make
it easy for developers to write success-tolerant applications that support an
arbitrarily large number of users while still providing acceptable performance.
In this paper, we present the PIQL query processing system and evaluate its
scale independence on hundreds of machines using two benchmarks, TPC-W and
SCADr.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2011 14:09:39 GMT"
}
] | 2011-12-01T00:00:00 |
[
[
"Armbrust",
"Michael",
""
],
[
"Curtis",
"Kristal",
""
],
[
"Kraska",
"Tim",
""
],
[
"Fox",
"Armando",
""
],
[
"Franklin",
"Michael J.",
""
],
[
"Patterson",
"David A.",
""
]
] |
new_dataset
| 0.996101 |
1111.7167
|
Peixiang Zhao
|
Peixiang Zhao, Charu C. Aggarwal, Min Wang
|
gSketch: On Query Estimation in Graph Streams
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp.
193-204 (2011)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many dynamic applications are built upon large network infrastructures, such
as social networks, communication networks, biological networks and the Web.
Such applications create data that can be naturally modeled as graph streams,
in which edges of the underlying graph are received and updated sequentially in
a form of a stream. It is often necessary and important to summarize the
behavior of graph streams in order to enable effective query processing.
However, the sheer size and dynamic nature of graph streams present an enormous
challenge to existing graph management techniques. In this paper, we propose a
new graph sketch method, gSketch, which combines well studied synopses for
traditional data streams with a sketch partitioning technique, to estimate and
optimize the responses to basic queries on graph streams. We consider two
different scenarios for query estimation: (1) A graph stream sample is
available; (2) Both a graph stream sample and a query workload sample are
available. Algorithms for different scenarios are designed respectively by
partitioning a global sketch to a group of localized sketches in order to
optimize the query estimation accuracy. We perform extensive experimental
studies on both real and synthetic data sets and demonstrate the power and
robustness of gSketch in comparison with the state-of-the-art global sketch
method.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2011 14:10:01 GMT"
}
] | 2011-12-01T00:00:00 |
[
[
"Zhao",
"Peixiang",
""
],
[
"Aggarwal",
"Charu C.",
""
],
[
"Wang",
"Min",
""
]
] |
new_dataset
| 0.994428 |
1111.6866
|
Grenville Croll
|
Kevin McDaid, Ronan MacRuairi, Neil Clynch, Kevin Logue, Cian Clancy,
Shane Hayes
|
Spreadsheets in Financial Departments: An Automated Analysis of 65,000
Spreadsheets using the Luminous Technology
|
14 Pages, 6 Tables, 4 Colour Figures; Proc. European Spreadsheet
Risks Int. Grp. (EuSpRIG) 2011 ISBN 978-0-9566256-9-4
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spreadsheet technology is a cornerstone of IT systems in most organisations.
It is often the glue that binds more structured transaction-based systems
together. Financial operations are a case in point where spreadsheets fill the
gaps left by dedicated accounting systems, particularly covering reporting and
business process operations. However, little is understood as to the nature of
spreadsheet usage in organisations and the contents and structure of these
spreadsheets as they relate to key business functions with few, if any,
comprehensive analyses of spreadsheet repositories in real organisations. As
such this paper represents an important attempt at profiling real and
substantial spreadsheet repositories.
Using the Luminous technology an analysis of 65,000 spreadsheets for the
financial departments of both a government and a private commercial
organisation was conducted. This provides an important insight into the nature
and structure of these spreadsheets, the links between them, the existence and
nature of macros and the level of repetitive processes performed through the
spreadsheets. Furthermore it highlights the organisational dependence on
spreadsheets and the range and number of spreadsheets dealt with by individuals
on a daily basis. In so doing, this paper prompts important questions that can
frame future research in the domain.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 15:59:44 GMT"
}
] | 2011-11-30T00:00:00 |
[
[
"McDaid",
"Kevin",
""
],
[
"MacRuairi",
"Ronan",
""
],
[
"Clynch",
"Neil",
""
],
[
"Logue",
"Kevin",
""
],
[
"Clancy",
"Cian",
""
],
[
"Hayes",
"Shane",
""
]
] |
new_dataset
| 0.994619 |
1111.6870
|
Grenville Croll
|
Gordon Guthrie, Stephen McCrory
|
Beyond The Desktop Spreadsheet
|
11 Pages; Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2011
ISBN 978-0-9566256-9-4
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hypernumbers is a new commercial web-based spreadsheet. It addresses several
risk factors in deploying spreadsheets.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 16:06:26 GMT"
}
] | 2011-11-30T00:00:00 |
[
[
"Guthrie",
"Gordon",
""
],
[
"McCrory",
"Stephen",
""
]
] |
new_dataset
| 0.968002 |
1111.6900
|
Martin Albrecht
|
Martin R. Albrecht
|
The M4RIE library for dense linear algebra over small fields with even
characteristic
| null | null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present the M4RIE library which implements efficient
algorithms for linear algebra with dense matrices over GF(2^e) for 2 <= 2 <=
10. As the name of the library indicates, it makes heavy use of the M4RI
library both directly (i.e., by calling it) and indirectly (i.e., by using its
concepts). We provide an open-source GPLv2+ C library for efficient linear
algebra over GF(2^e) for e small. In this library we implemented an idea due to
Bradshaw and Boothby which reduces matrix multiplication over GF(p^k) to a
series of matrix multiplications over GF(p). Furthermore, we propose a caching
technique - Newton-John tables - to avoid finite field multiplications which is
inspired by Kronrod's method ("M4RM") for matrix multiplication over GF(2).
Using these two techniques we provide asymptotically fast triangular solving
with matrices (TRSM) and PLE-based Gaussian elimination. As a result, we are
able to significantly improve upon the state of the art in dense linear algebra
over GF(2^e) with 2 <= e <= 10.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 17:05:00 GMT"
}
] | 2011-11-30T00:00:00 |
[
[
"Albrecht",
"Martin R.",
""
]
] |
new_dataset
| 0.982483 |
1111.6911
|
Zacchaeus Omogbadegun
|
Zacchaeus Omogbadegun, Charles Uwadia, Charles Ayo, Victor Mbarika,
Nicholas Omoregbe, Efe Otofia, and Frank Chieze
|
Multimedia-based Medicinal Plants Sustainability Management System
|
12 pages, 9 figures, 6 tables, 37 references
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 5, No 3, September 2011; ISSN (Online): 1694-0814
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Medicinal plants are increasingly recognized worldwide as an alternative
source of efficacious and inexpensive medications to synthetic
chemo-therapeutic compound. Rapid declining wild stocks of medicinal plants
accompanied by adulteration and species substitutions reduce their efficacy,
quality and safety. Consequently, the low accessibility to and
non-affordability of orthodox medicine costs by rural dwellers to be healthy
and economically productive further threaten their life expectancy. Finding
comprehensive information on medicinal plants of conservation concern at a
global level has been difficult. This has created a gap between computing
technologies' promises and expectations in the healing process under
complementary and alternative medicine. This paper presents the design and
implementation of a Multimedia-based Medicinal Plants Sustainability Management
System addressing these concerns. Medicinal plants' details for designing the
system were collected through semi-structured interviews and databases. Unified
Modelling Language, Microsoft-Visual-Studio.Net, C#3.0,
Microsoft-Jet-Engine4.0, MySQL, Loquendo Multilingual Text-to-Speech Software,
YouTube, and VLC Media Player were used. Keywords: Complementary and
Alternative Medicine, conservation, extinction, medicinal plant, multimedia,
phytoconstituents, rural dwellers
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 17:33:20 GMT"
}
] | 2011-11-30T00:00:00 |
[
[
"Omogbadegun",
"Zacchaeus",
""
],
[
"Uwadia",
"Charles",
""
],
[
"Ayo",
"Charles",
""
],
[
"Mbarika",
"Victor",
""
],
[
"Omoregbe",
"Nicholas",
""
],
[
"Otofia",
"Efe",
""
],
[
"Chieze",
"Frank",
""
]
] |
new_dataset
| 0.996637 |
1111.5038
|
Takashi Yokomori
|
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
|
Reaction Automata
|
19 pages, 6 figures
| null | null |
EMTR-11-02
|
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reaction systems are a formal model that has been introduced to investigate
the interactive behaviors of biochemical reactions. Based on the formal
framework of reaction systems, we propose new computing models called reaction
automata that feature (string) language acceptors with multiset manipulation as
a computing mechanism, and show that reaction automata are computationally
Turing universal. Further, some subclasses of reaction automata with space
complexity are investigated and their language classes are compared to the ones
in the Chomsky hierarchy.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 21:40:07 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Nov 2011 07:22:22 GMT"
}
] | 2011-11-29T00:00:00 |
[
[
"Okubo",
"Fumiya",
""
],
[
"Kobayashi",
"Satoshi",
""
],
[
"Yokomori",
"Takashi",
""
]
] |
new_dataset
| 0.999428 |
1111.6321
|
Kamen Lozev
|
Kamen Lozev
|
Shape and Trajectory Tracking of Moving Obstacles
|
22 pages, 2 figures, 2 tables
| null | null | null |
cs.GR cs.DS math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents new methods and algorithms for tracking the shape and
trajectory of moving reflecting obstacles with broken rays, or rays reflecting
at an obstacle. While in tomography the focus of the reconstruction method is
to recover the velocity structure of the domain, the shape and trajectory
reconstruction procedure directly finds the shape and trajectory of the
obstacle. The physical signal carrier for this innovative method are ultrasonic
beams. When the speed of sound is constant, the rays are straight line segments
and the shape and trajectory of moving objects will be reconstructed with
methods based on the travel time equation and ellipsoid geometry. For variable
speed of sound, we start with the eikonal equation and a system of differential
equations that has its origins in acoustics and seismology. In this case, the
rays are curves that are not necessarily straight line segments and we develop
algorithms for shape and trajectory tracking based on the numerical solution of
these equations. We present methods and algorithms for shape and trajectory
tracking of moving obstacles with reflected rays when the location of the
receiver of the reflected ray is not known in advance. The shape and trajectory
tracking method is very efficient because it is not necessary for the reflected
signal to traverse the whole domain or the same path back to the transmitter.
It could be received close to the point of reflection or far away from the
transmitter. This optimizes the energy spent by transmitters for tracking the
object, reduces signal attenuation and improves image resolution. It is a safe
and secure method. We also present algorithms for tracking the shape and
trajectory of absorbing obstacles. The new methods and algorithms for shape and
trajectory tracking enable new applications and an application to one-hop
Internet routing is presented.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2011 00:10:06 GMT"
}
] | 2011-11-29T00:00:00 |
[
[
"Lozev",
"Kamen",
""
]
] |
new_dataset
| 0.980471 |
1111.6539
|
Mehdi Sookhak Mehdi Sookhak
|
Mehdi sookhak, Ramin Karimi, Mahboobeh Haghparast, Ismail Fauzi ISnin
|
Secure Geographic Routing Protocols: Issues and Approaches
|
8 pages
|
International Journal of Computer Science Issues 8(4): 382-389
(2011)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the years, routing protocols in wireless sensor networks (WSN) have been
substantially investigated by researches. Most state-of-the-art surveys have
focused on reviewing of wireless sensor network .In this paper we review the
existing secure geographic routing protocols for wireless sensor network (WSN)
and also provide a qualitative comparison of them.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2011 18:37:19 GMT"
}
] | 2011-11-29T00:00:00 |
[
[
"sookhak",
"Mehdi",
""
],
[
"Karimi",
"Ramin",
""
],
[
"Haghparast",
"Mahboobeh",
""
],
[
"ISnin",
"Ismail Fauzi",
""
]
] |
new_dataset
| 0.984063 |
1102.3503
|
Takashi Yokomori
|
Fumiya Okubo, Takashi Yokomori
|
On the Hairpin Incompletion
|
17 pages, 2 figures
|
Fundamenta Informaticae 110 (2011) 255--269
|
10.3233/FI-2011-542
|
EMTR-11-01
|
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hairpin completion and its variant called bounded hairpin completion are
operations on formal languages, inspired by a hairpin formation in molecular
biology. Another variant called hairpin lengthening has been recently
introduced and studied on the closure properties and algorithmic problems
concerning several families of languages. In this paper, we introduce a new
operation of this kind, called hairpin incompletion which is not only an
extension of bounded hairpin completion, but also a restricted (bounded)
variant of hairpin lengthening. Further, the hairpin incompletion operation
provides a formal language theoretic framework that models a bio-molecular
technique nowadays known as Whiplash PCR. We study the closure properties of
language families under both the operation and its iterated version. We show
that a family of languages closed under intersection with regular sets,
concatenation with regular sets, and finite union is closed under one-sided
iterated hairpin incompletion, and that a family of languages containing all
linear languages and closed under circular permutation, left derivative and
substitution is also closed under iterated hairpin incompletion.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 06:13:41 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Feb 2011 04:56:00 GMT"
}
] | 2011-11-28T00:00:00 |
[
[
"Okubo",
"Fumiya",
""
],
[
"Yokomori",
"Takashi",
""
]
] |
new_dataset
| 0.993582 |
1111.5687
|
Mehdi Kaytoue
|
Baptiste Ducatel (INRIA Lorraine - LORIA), Mehdi Kaytoue (INRIA
Lorraine - LORIA), Florent Marcuola (INRIA Lorraine - LORIA), Amedeo Napoli
(INRIA Lorraine - LORIA), Laszlo Szathmary (INRIA Lorraine - LORIA)
|
Coron : Plate-forme d'extraction de connaissances dans les bases de
donn\'ees
| null |
17\`eme conf\'erence en Reconnaissance des Formes et Intelligence
Artificielle (2010) 883-884
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coron is a domain and platform independent, multi-purposed data mining
toolkit, which incorporates not only a rich collection of data mining
algorithms, but also allows a number of auxiliary operations. To the best of
our knowledge, a data mining toolkit designed specifically for itemset
extraction and association rule generation like Coron does not exist elsewhere.
Coron also provides support for preparing and filtering data, and for
interpreting the extracted units of knowledge.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2011 07:52:59 GMT"
}
] | 2011-11-28T00:00:00 |
[
[
"Ducatel",
"Baptiste",
"",
"INRIA Lorraine - LORIA"
],
[
"Kaytoue",
"Mehdi",
"",
"INRIA\n Lorraine - LORIA"
],
[
"Marcuola",
"Florent",
"",
"INRIA Lorraine - LORIA"
],
[
"Napoli",
"Amedeo",
"",
"INRIA Lorraine - LORIA"
],
[
"Szathmary",
"Laszlo",
"",
"INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.995191 |
1111.5690
|
Mehdi Kaytoue
|
Mehdi Kaytoue (INRIA Lorraine - LORIA), Florent Marcuola (INRIA
Lorraine - LORIA), Amedeo Napoli (INRIA Lorraine - LORIA), Laszlo Szathmary
(INRIA Lorraine - LORIA), Jean Villerd (INRIA Lorraine - LORIA)
|
The Coron System
| null |
8th International Conference on Formal Concept Analsis (ICFCA)
(2010) 55--58
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coron is a domain and platform independent, multi-purposed data mining
toolkit, which incorporates not only a rich collection of data mining
algorithms, but also allows a number of auxiliary operations. To the best of
our knowledge, a data mining toolkit designed specifically for itemset
extraction and association rule generation like Coron does not exist elsewhere.
Coron also provides support for preparing and filtering data, and for
interpreting the extracted units of knowledge.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2011 07:56:18 GMT"
}
] | 2011-11-28T00:00:00 |
[
[
"Kaytoue",
"Mehdi",
"",
"INRIA Lorraine - LORIA"
],
[
"Marcuola",
"Florent",
"",
"INRIA\n Lorraine - LORIA"
],
[
"Napoli",
"Amedeo",
"",
"INRIA Lorraine - LORIA"
],
[
"Szathmary",
"Laszlo",
"",
"INRIA Lorraine - LORIA"
],
[
"Villerd",
"Jean",
"",
"INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.962505 |
1111.5767
|
Charles Morisset
|
Jason Crampton, Charles Morisset
|
PTaCL: A Language for Attribute-Based Access Control in Open Systems
|
26 pages, submitted to Principles of Security and Trust (POST)
| null | null | null |
cs.CR cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many languages and algebras have been proposed in recent years for the
specification of authorization policies. For some proposals, such as XACML, the
main motivation is to address real-world requirements, typically by providing a
complex policy language with somewhat informal evaluation methods; others try
to provide a greater degree of formality (particularly with respect to policy
evaluation) but support far fewer features. In short, there are very few
proposals that combine a rich set of language features with a well-defined
semantics, and even fewer that do this for authorization policies for
attribute-based access control in open environments. In this paper, we
decompose the problem of policy specification into two distinct sub-languages:
the policy target language (PTL) for target specification, which determines
when a policy should be evaluated; and the policy composition language (PCL)
for building more complex policies from existing ones. We define syntax and
semantics for two such languages and demonstrate that they can be both simple
and expressive. PTaCL, the language obtained by combining the features of these
two sub-languages, supports the specification of a wide range of policies.
However, the power of PTaCL means that it is possible to define policies that
could produce unexpected results. We provide an analysis of how PTL should be
restricted and how policies written in PCL should be evaluated to minimize the
likelihood of undesirable results.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2011 14:01:47 GMT"
}
] | 2011-11-28T00:00:00 |
[
[
"Crampton",
"Jason",
""
],
[
"Morisset",
"Charles",
""
]
] |
new_dataset
| 0.998859 |
1111.5986
|
Jean Cardinal
|
Sergio Cabello, Jean Cardinal, Stefan Langerman
|
The Clique Problem in Ray Intersection Graphs
|
12 pages, 7 figures
| null | null | null |
cs.CG cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ray intersection graphs are intersection graphs of rays, or halflines, in the
plane. We show that any planar graph has an even subdivision whose complement
is a ray intersection graph. The construction can be done in polynomial time
and implies that finding a maximum clique in a segment intersection graph is
NP-hard. This solves a 21-year old open problem posed by Kratochv\'il and
Ne\v{s}et\v{r}il.
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2011 13:48:12 GMT"
}
] | 2011-11-28T00:00:00 |
[
[
"Cabello",
"Sergio",
""
],
[
"Cardinal",
"Jean",
""
],
[
"Langerman",
"Stefan",
""
]
] |
new_dataset
| 0.999803 |
1111.4937
|
Xin He
|
Bryan Dawei He
|
A Simple Optimal Binary Representation of Mosaic Floorplans and Baxter
Permutations
|
11 pages, 7 figures
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A "floorplan" is a rectangle subdivided into smaller rectangular sections by
horizontal and vertical line segments. Each section in the floorplan is called
a "block". Two floorplans are considered equivalent if and only if there is a
one-to-one correspondence between the blocks in the two floorplans such that
the relative position relationship of the blocks in one floorplan is the same
as the relative position relationship of the corresponding blocks in another
floorplan. The objects of "Mosaic floorplans" are the same as floorplans, but
an alternative definition of equivalence is used. Two mosaic floorplans are
considered equivalent if and only if they can be converted to each other by
sliding the line segments that divide the blocks.
Mosaic floorplans are widely used in VLSI circuit design. An important
problem in this area is to find short binary string representations of the set
of n-block mosaic floorplans. The best known representation is the
"Quarter-State Sequence" which uses 4n bits. This paper introduces a simple
binary representation of n-block mosaic floorplan using 3n-3 bits. It has been
shown that any binary representation of n-block mosaic floorplans must use at
least (3n-o(n)) bits. Therefore, the representation presented in this paper is
optimal (up to an additive lower order term).
"Baxter permutations" are a set of permutations defined by prohibited
subsequences. Baxter permutations have been shown to have one-to-one
correspondences to many interesting objects in the so-called "Baxter
combinatorial family". In particular, there exists a simple one-to-one
correspondence between mosaic floorplans and Baxter permutations. As a result,
the methods introduced in this paper also lead to an optimal binary
representation of Baxter permutations and all objects in the Baxter
combinatorial family.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 17:11:39 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2011 20:14:16 GMT"
}
] | 2011-11-23T00:00:00 |
[
[
"He",
"Bryan Dawei",
""
]
] |
new_dataset
| 0.951853 |
1111.5207
|
Serge Kernbach
|
Serge Kernbach
|
Robot Companions: Technology for Humans
|
Jeremy Pitt (Edt.) This Pervasive Day: The Potential and Perils of
Pervasive Computing, Imperial College Press, 2012
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creation of devices and mechanisms which help people has a long history.
Their inventors always targeted practical goals such as irrigation, harvesting,
devices for construction sites, measurement, and, last but not least, military
tasks for different mechanical and later mechatronic systems. Development of
such assisting mechanisms counts back to Greek engineering, came through Middle
Ages and led finally in XIX and XX centuries to autonomous devices, which we
call today "Robots". This chapter provides overview of several robotic
technologies, introduces bio-/chemo- hybrid and collective systems and discuss
their applications in service areas.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2011 14:57:10 GMT"
}
] | 2011-11-23T00:00:00 |
[
[
"Kernbach",
"Serge",
""
]
] |
new_dataset
| 0.999628 |
1110.0200
|
Koji Kobayashi
|
Koji Kobayashi
|
NP is not AL and P is not NC is not NL is not L
|
7 pages, in English and Japanese
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and
NL is not L. The point about this paper is the depend relation of the problem
that need other problem's result to compute it. I show the structure of depend
relation that could divide each complexity classes.
|
[
{
"version": "v1",
"created": "Sun, 2 Oct 2011 16:28:44 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Oct 2011 14:08:23 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Oct 2011 14:36:16 GMT"
},
{
"version": "v4",
"created": "Mon, 24 Oct 2011 18:02:30 GMT"
},
{
"version": "v5",
"created": "Mon, 21 Nov 2011 17:55:48 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Kobayashi",
"Koji",
""
]
] |
new_dataset
| 0.979775 |
1111.4499
|
Somayeh Kafaie
|
Somayeh Kafaie, Omid Kashefi and Mohsen Sharifi
|
A Low-Energy Fast Cyber Foraging Mechanism for Mobile Devices
|
12 pages, 7 figures, International Journal of Wireless & Mobile
Networks (IJWMN)
|
International Journal of Wireless & Mobile Networks (IJWMN) Vol.
3, No. 5, October 2011
|
10.5121/ijwmn.2011.3516
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ever increasing demands for using resource-constrained mobile devices for
running more resource intensive applications nowadays has initiated the
development of cyber foraging solutions that offload parts or whole
computational intensive tasks to more powerful surrogate stationary computers
and run them on behalf of mobile devices as required. The choice of proper mix
of mobile devices and surrogates has remained an unresolved challenge though.
In this paper, we propose a new decision-making mechanism for cyber foraging
systems to select the best locations to run an application, based on context
metrics such as the specifications of surrogates, the specifications of mobile
devices, application specification, and communication network specification.
Experimental results show faster response time and lower energy consumption of
benched applications compared to when applications run wholly on mobile devices
and when applications are offloaded to surrogates blindly for execution.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2011 21:37:36 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Kafaie",
"Somayeh",
""
],
[
"Kashefi",
"Omid",
""
],
[
"Sharifi",
"Mohsen",
""
]
] |
new_dataset
| 0.981043 |
1111.4654
|
Amelia Carolina Sparavigna
|
Amelia Carolina Sparavigna
|
A self-portrait of young Leonardo
|
Image processing, digital restoration, Leonardo da Vinci
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most famous drawings by Leonardo da Vinci is a self-portrait in
red chalk, where he looks quite old. In fact, there is a sketch in one of his
notebooks, partially covered by written notes, that can be a self-portrait of
the artist when he was young. The use of image processing, to remove the
handwritten text and improve the image, allows a comparison of the two
portraits.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2011 17:41:01 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Sparavigna",
"Amelia Carolina",
""
]
] |
new_dataset
| 0.999729 |
1111.4744
|
EPTCS
|
Markus Lepper, Baltasar Tranc\'on y Widemann
|
Solving the TTC 2011 Compiler Optimization Task with metatools
|
In Proceedings TTC 2011, arXiv:1111.4407
|
EPTCS 74, 2011, pp. 70-115
|
10.4204/EPTCS.74.9
| null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The authors' "metatools" are a collection of tools for generic programming.
This includes generating Java sources from mathematically well-founded
specifications, as well as the creation of strictly typed document object
models for XML encoded texts. In this context, almost every computer-internal
structure is treated as a "model", and every computation is a kind of model
transformation.
This concept differs significantly from "classical model transformation"
executed by specialized tools and languages. Therefore it seemed promising to
the organizers of the TTC 2011, as well as to the authors, to apply metatools
to one of the challenges, namely to the "compiler optimization task". This is a
report on the resulting experiences.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 05:25:16 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Lepper",
"Markus",
""
],
[
"Widemann",
"Baltasar Trancón y",
""
]
] |
new_dataset
| 0.983736 |
1111.4746
|
EPTCS
|
Arend Rensink (University of Twente, NL), Eduardo Zambon (University
of Twente, NL)
|
Solving the TTC 2011 Compiler Optimization Case with GROOVE
|
In Proceedings TTC 2011, arXiv:1111.4407
|
EPTCS 74, 2011, pp. 126-130
|
10.4204/EPTCS.74.11
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents a partial solution to the Compiler Optimization case
study using GROOVE. We explain how the input graphs provided with the case
study were adapted into a GROOVE representation and we describe an initial
solution for Task 1. This solution allows us to automatically reproduce the
steps of the constant folding example given in the case description. We did not
solve Task 2.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 05:25:30 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Rensink",
"Arend",
"",
"University of Twente, NL"
],
[
"Zambon",
"Eduardo",
"",
"University\n of Twente, NL"
]
] |
new_dataset
| 0.960221 |
1111.4750
|
EPTCS
|
Agris Sostaks, Elina Kalnina, Audris Kalnins, Edgars Celms, Janis
Iraids
|
Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order
Transformations
|
In Proceedings TTC 2011, arXiv:1111.4407
|
EPTCS 74, 2011, pp. 159-167
|
10.4204/EPTCS.74.15
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Reengineering Case of the Transformation Tool Contest 2011 deals with
automatic extraction of state machine from Java source code. The transformation
task involves complex, non-local matching of model elements. This paper
contains the solution of the task using model transformation language MOLA. The
MOLA solution uses higher-order transformations (HOT-s) to generate a part of
the required MOLA program. The described HOT approach allows creating reusable,
complex model transformation libraries for generic tasks without modifying an
implementation of a model transformation language. Thus model transformation
users who are not the developers of the language can achieve the desired
functionality more easily.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 05:26:06 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Sostaks",
"Agris",
""
],
[
"Kalnina",
"Elina",
""
],
[
"Kalnins",
"Audris",
""
],
[
"Celms",
"Edgars",
""
],
[
"Iraids",
"Janis",
""
]
] |
new_dataset
| 0.978541 |
1111.4755
|
EPTCS
|
Elina Kalnina (Institute of Mathematics and Computer Science,
University of Latvia), Audris Kalnins (Institute of Mathematics and Computer
Science, University of Latvia), Agris Sostaks (Institute of Mathematics and
Computer Science, University of Latvia), Janis Iraids (Institute of
Mathematics and Computer Science, University of Latvia), Edgars Celms
(Institute of Mathematics and Computer Science, University of Latvia)
|
Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive
Case
|
In Proceedings TTC 2011, arXiv:1111.4407
|
EPTCS 74, 2011, pp. 237-252
|
10.4204/EPTCS.74.21
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the solution of Hello World transformations in MOLA
transformation language. Transformations implementing the task are relatively
straightforward and easily inferable from the task specification. The required
additional steps related to model import and export are also described.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 05:26:57 GMT"
}
] | 2011-11-22T00:00:00 |
[
[
"Kalnina",
"Elina",
"",
"Institute of Mathematics and Computer Science,\n University of Latvia"
],
[
"Kalnins",
"Audris",
"",
"Institute of Mathematics and Computer\n Science, University of Latvia"
],
[
"Sostaks",
"Agris",
"",
"Institute of Mathematics and\n Computer Science, University of Latvia"
],
[
"Iraids",
"Janis",
"",
"Institute of\n Mathematics and Computer Science, University of Latvia"
],
[
"Celms",
"Edgars",
"",
"Institute of Mathematics and Computer Science, University of Latvia"
]
] |
new_dataset
| 0.996024 |
1111.4301
|
Andrej Bogdanov
|
Andrej Bogdanov and Chin Ho Lee
|
Homomorphic encryption from codes
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new homomorphic encryption scheme based on the hardness of
decoding under independent random noise from certain affine families of codes.
Unlike in previous lattice-based homomorphic encryption schemes, where the
message is hidden in the noisy part of the ciphertext, our scheme carries the
message in the affine part of the transformation and applies noise only to
achieve security. Our scheme can tolerate noise of arbitrary magnitude, as long
as the noise vector has sufficiently small hamming weight (and its entries are
independent).
Our design achieves "proto-homomorphic" properties in an elementary manner:
message addition and multiplication are emulated by pointwise addition and
multiplication of the ciphertext vectors. Moreover, the extremely simple nature
of our decryption makes the scheme easily amenable to bootstrapping. However,
some complications are caused by the inherent presence of noticeable encryption
error. Our main technical contribution is the development of two new techniques
for handling this error in the homomorphic evaluation process.
We also provide a definitional framework for homomorphic encryption that may
be useful elsewhere.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2011 08:41:15 GMT"
}
] | 2011-11-21T00:00:00 |
[
[
"Bogdanov",
"Andrej",
""
],
[
"Lee",
"Chin Ho",
""
]
] |
new_dataset
| 0.967509 |
1111.3673
|
Zolt\'an K\'asa
|
N. Pataki
|
C++ Standard Template Library by template specialized containers
| null |
Acta Univ. Sapientiae, Inform. 3,2 (2011) 141--157
| null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The C++ Standard Template Library is the flagship example for libraries based
on the generic programming paradigm. The usage of this library is intended to
minimize the number of classical C/C++ errors, but does not warrant bug-free
programs. Furthermore, many new kinds of errors may arise from the inaccurate
use of the generic programming paradigm, like dereferencing invalid iterators
or misunderstanding remove-like algorithms. In this paper we present some
typical scenarios that may cause runtime or portability problems. We emit
warnings and errors while these risky constructs are used. We also present a
general approach to emit "customized" warnings. We support the so-called
"believe-me marks" to disable warnings. We present another typical usage of our
technique, when classes become deprecated during the software lifecycle.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2011 22:00:48 GMT"
}
] | 2011-11-17T00:00:00 |
[
[
"Pataki",
"N.",
""
]
] |
new_dataset
| 0.991837 |
1111.3715
|
Tao Ye
|
Wenqi Huang, Tao Ye, Duanbing Chen
|
Corner Occupying Theorem for the Two-dimensional Integral Rectangle
Packing Problem
|
11 pages, 10 figures. arXiv admin note: substantial text overlap with
arXiv:1107.4463
| null | null | null |
cs.DM math.CO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proves a corner occupying theorem for the two-dimensional integral
rectangle packing problem, stating that if it is possible to orthogonally place
n arbitrarily given integral rectangles into an integral rectangular container
without overlapping, then we can achieve a feasible packing by successively
placing an integral rectangle onto a bottom-left corner in the container. Based
on this theorem, we might develop efficient heuristic algorithms for solving
the integral rectangle packing problem. In fact, as a vague conjecture, this
theorem has been implicitly mentioned with different appearances by many people
for a long time.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2011 04:13:52 GMT"
}
] | 2011-11-17T00:00:00 |
[
[
"Huang",
"Wenqi",
""
],
[
"Ye",
"Tao",
""
],
[
"Chen",
"Duanbing",
""
]
] |
new_dataset
| 0.998218 |
1111.3753
|
Sugata Sanyal
|
Vipul Goyal, Virendra Kumar, Mayank Singh, Ajith Abraham, Sugata
Sanyal
|
CompChall: Addressing Password Guessing Attacks
|
6 Pages, 1 Figure; International Conference on Information
Technology: Coding and Computing, 2005. ITCC 2005
| null |
10.1109/ITCC.2005.107
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Even though passwords are the most convenient means of authentication, they
bring along themselves the threat of dictionary attacks. Dictionary attacks may
be of two kinds: online and offline. While offline dictionary attacks are
possible only if the adversary is able to collect data for a successful
protocol execution by eavesdropping on the communication channel and can be
successfully countered using public key cryptography, online dictionary attacks
can be performed by anyone and there is no satisfactory solution to counter
them. This paper presents a new authentication protocol which is called
CompChall (computational challenge). The proposed protocol uses only one way
hash functions as the building blocks and attempts to eliminate online
dictionary attacks by implementing a challenge-response system. This
challenge-response system is designed in a fashion that it does not pose any
difficulty to a genuine user but is time consuming and computationally
intensive for an adversary trying to launch a large number of login requests
per unit time as in the case of an online dictionary attack. The protocol is
stateless and thus less vulnerable to DoS (Denial of Service) attacks.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2011 10:20:46 GMT"
}
] | 2011-11-17T00:00:00 |
[
[
"Goyal",
"Vipul",
""
],
[
"Kumar",
"Virendra",
""
],
[
"Singh",
"Mayank",
""
],
[
"Abraham",
"Ajith",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.998077 |
1111.3933
|
Smorodinsky Rann
|
Sergey Kuniavsky, Rann Smorodinsky
|
Equilibrium and Potential in Coalitional Congestion Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The model of congestion games is widely used to analyze games related to
traffic and communication. A central property of these games is that they are
potential games and hence posses a pure Nash equilibrium. In reality it is
often the case that some players cooperatively decide on their joint action in
order to maximize the coalition's total utility. This is by modeled by
Coalitional Congestion Games. Typical settings include truck drivers who work
for the same shipping company, or routers that belong to the same ISP. The
formation of coalitions will typically imply that the resulting coalitional
congestion game will no longer posses a pure Nash equilibrium. In this paper we
provide conditions under which such games are potential games and posses a pure
Nash equilibrium.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2011 20:09:13 GMT"
}
] | 2011-11-17T00:00:00 |
[
[
"Kuniavsky",
"Sergey",
""
],
[
"Smorodinsky",
"Rann",
""
]
] |
new_dataset
| 0.998948 |
1005.0824
|
Francois Clement
|
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 Grenoble 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
|
replaces arXiv:1001.4898
|
Interactive Theorem Proving 6172 (2010) 147-162
|
10.1007/978-3-642-14052-5_12
|
arXiv:1005.0824
|
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, 5 May 2010 19:38:02 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Nov 2011 16:19:46 GMT"
}
] | 2011-11-15T00: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 Grenoble 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 |
1007.3108
|
Shengtian Yang
|
Shengtian Yang
|
Second-Order Weight Distributions
|
10 pages, accepted for publication in IEEE Transactions on
Information Theory, May 2011
|
IEEE Trans. Inf. Theory 57 (2011) 6068-6077
|
10.1109/TIT.2011.2162272
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental property of codes, the second-order weight distribution, is
proposed to solve the problems such as computing second moments of weight
distributions of linear code ensembles. A series of results, parallel to those
for weight distributions, is established for second-order weight distributions.
In particular, an analogue of MacWilliams identities is proved. The
second-order weight distributions of regular LDPC code ensembles are then
computed. As easy consequences, the second moments of weight distributions of
regular LDPC code ensembles are obtained. Furthermore, the application of
second-order weight distributions in random coding approach is discussed. The
second-order weight distributions of the ensembles generated by a so-called
2-good random generator or parity-check matrix are computed, where a 2-good
random matrix is a kind of generalization of the uniformly distributed random
matrix over a finite filed and is very useful for solving problems that involve
pairwise or triple-wise properties of sequences. It is shown that the 2-good
property is reflected in the second-order weight distribution, which thus plays
a fundamental role in some well-known problems in coding theory and
combinatorics. An example of linear intersecting codes is finally provided to
illustrate this fact.
|
[
{
"version": "v1",
"created": "Mon, 19 Jul 2010 10:14:17 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Feb 2011 01:07:41 GMT"
},
{
"version": "v3",
"created": "Wed, 11 May 2011 10:34:21 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Yang",
"Shengtian",
""
]
] |
new_dataset
| 0.997223 |
1009.3448
|
Kapil Vhatkar kapil vhatkar
|
Kapil N. Vhatkar, G. P. Bhole
|
Internal Location Based System for Mobile Devices Using Passive RFID
|
7 pages IEEE format. The original authors of this paper Lect. kapil
N. Vhatkar & Prof. G. P. Bhole claim for the ownership of the said paper so
IJCSIS modified authors of the said paper.
http://sites.google.com/site/ijcsis/vol-6-no-3-december-2009. arXiv admin
note: this article was plagiarized by arXiv:1001.2258
|
International Journal of Computer Science and Information
Security, IJCSIS December 2009, ISSN 1947 5500
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have explored our own innovative work about the design & development of
internal location-identification system for mobile devices based on integration
of RFID and wireless technology. The function of our system is based on
strategically located passive RFID tags placed on objects around building which
are identified using an RFID reader attached to a mobile device. The mobile
device reads the RFID tag and through the wireless network, sends the request
to the server. The server resolves the request and sends the desired
location-based information back to the mobile device. We had addressed that we
can go through the RFID technology for internal location identification
(indoor), which provides us better location accuracy because of no contact
between the tag and the reader, and the system requires no line of sight. In
this paper we had also focused on the issues of RFID technologies i.e.
Non-line-of-sight & High inventory speeds.
|
[
{
"version": "v1",
"created": "Thu, 16 Sep 2010 06:50:56 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Vhatkar",
"Kapil N.",
""
],
[
"Bhole",
"G. P.",
""
]
] |
new_dataset
| 0.971506 |
1110.3147
|
Xueliang Li
|
Xiaolong Huang, Xueliang Li, Yongtang Shi
|
Rainbow connections for planar graphs and line graphs
|
13 pages
| null | null | null |
cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An edge-colored graph $G$ is rainbow connected if any two vertices are
connected by a path whose edges have distinct colors. The rainbow connection
number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of
colors that are needed in order to make $G$ rainbow connected. It was proved
that computing $rc(G)$ is an NP-Hard problem, as well as that even deciding
whether a graph has $rc(G)=2$ is NP-Complete. It is known that deciding whether
a given edge-colored graph is rainbow connected is NP-Complete. We will prove
that it is still NP-Complete even when the edge-colored graph is a planar
bipartite graph. We also give upper bounds of the rainbow connection number of
outerplanar graphs with small diameters. A vertex-colored graph is rainbow
vertex-connected if any two vertices are connected by a path whose internal
vertices have distinct colors. The rainbow vertex-connection number of a
connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that
are needed in order to make $G$ rainbow vertex-connected. It is known that
deciding whether a given vertex-colored graph is rainbow vertex-connected is
NP-Complete. We will prove that it is still NP-Complete even when the
vertex-colored graph is a line graph.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2011 08:53:50 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Nov 2011 09:18:47 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Huang",
"Xiaolong",
""
],
[
"Li",
"Xueliang",
""
],
[
"Shi",
"Yongtang",
""
]
] |
new_dataset
| 0.99749 |
1111.2991
|
Cunsheng Ding
|
Cunsheng Ding
|
Cyclotomic Constructions of Cyclic Codes with Length Being the Product
of Two Primes
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are an interesting type of linear codes and have applications in
communication and storage systems due to their efficient encoding and decoding
algorithms. They have been studied for decades and a lot of progress has been
made. In this paper, three types of generalized cyclotomy of order two and
three classes of cyclic codes of length $n_1n_2$ and dimension $(n_1n_2+1)/2$
are presented and analysed, where $n_1$ and $n_2$ are two distinct primes.
Bounds on their minimum odd-like weight are also proved. The three
constructions produce the best cyclic codes in certain cases.
|
[
{
"version": "v1",
"created": "Sun, 13 Nov 2011 06:35:49 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
]
] |
new_dataset
| 0.999542 |
1111.3010
|
Sugata Sanyal
|
Ayu Tiwari, Sudip Sanyal, Ajith Abraham, Svein Johan Knapskog, Sugata
Sanyal
|
A Multi-Factor Security Protocol for Wireless Payment - Secure Web
Authentication using Mobile Devices
|
8 Pages, 3 Figures; IADIS International Conference on Applied
Computing Proceedings of the IADIS International Conference on Applied
Computing, Salamanca, Spain, 18-20 February 2007
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous Web access authentication systems often use either the Web or the
Mobile channel individually to confirm the claimed identity of the remote user.
This paper proposes a new protocol using multifactor authentication system that
is both secure and highly usable. It uses a novel approach based on Transaction
Identification Code and SMS to enforce extra security level with the
traditional Login/password system. The system provides a highly secure
environment that is simple to use and deploy, that does not require any change
in infrastructure or protocol of wireless networks. This Protocol for Wireless
Payment is extended to provide two way authentications.
|
[
{
"version": "v1",
"created": "Sun, 13 Nov 2011 13:29:00 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Tiwari",
"Ayu",
""
],
[
"Sanyal",
"Sudip",
""
],
[
"Abraham",
"Ajith",
""
],
[
"Knapskog",
"Svein Johan",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.999214 |
1111.3096
|
Kamal Ahmat
|
Hassan Gobjuka and Kamal Ahmat
|
vFlow: A GUI-Based Tool for Building Batch Applications for Cloud
Computing
|
IEEE INFOCOM 2011 Demo Session, 2 Pages, 2 Figures
| null | null | null |
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce vFlow - A framework for rapid designing of batch
processing applications for Cloud Computing environment. vFlow batch processing
system extracts tasks from the vPlans diagrams, systematically captures the
dynamics in batch application management tasks, and translates them to Cloud
environment API, named vDocuments, that can be used to execute batch processing
applications. vDocuments do not only enable the complete execution of low-level
configuration management tasks, but also allow the construction of more
sophisticated tasks, while imposing additional reasoning logic to realize batch
application management objectives in Cloud environments. We present the design
of the vFlow framework and illustrate its utility by presenting the
implementation of several sophisticated operational tasks.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 05:05:11 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Gobjuka",
"Hassan",
""
],
[
"Ahmat",
"Kamal",
""
]
] |
new_dataset
| 0.999742 |
1111.3106
|
EPTCS
|
Doron Peled (Bar Ilan University), Sven Schewe (University of
Liverpool)
|
Practical Distributed Control Synthesis
|
In Proceedings INFINITY 2011, arXiv:1111.2678
|
EPTCS 73, 2011, pp. 2-17
|
10.4204/EPTCS.73.2
| null |
cs.LO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Classic distributed control problems have an interesting dichotomy: they are
either trivial or undecidable. If we allow the controllers to fully
synchronize, then synthesis is trivial. In this case, controllers can
effectively act as a single controller with complete information, resulting in
a trivial control problem. But when we eliminate communication and restrict the
supervisors to locally available information, the problem becomes undecidable.
In this paper we argue in favor of a middle way. Communication is, in most
applications, expensive, and should hence be minimized. We therefore study a
solution that tries to communicate only scarcely and, while allowing
communication in order to make joint decision, favors local decisions over
joint decisions that require communication.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 06:35:08 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Peled",
"Doron",
"",
"Bar Ilan University"
],
[
"Schewe",
"Sven",
"",
"University of\n Liverpool"
]
] |
new_dataset
| 0.9918 |
1111.3122
|
Iris Eshkol
|
Iris Eshkol (LLL), D. Maurel (LI), Nathalie Friburger (LI)
|
ESLO: from transcription to speakers' personal information annotation
|
LREC2010, Malta (2010)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the preliminary works to put online a French oral corpus
and its transcription. This corpus is the Socio-Linguistic Survey in Orleans,
realized in 1968. First, we numerized the corpus, then we handwritten
transcribed it with the Transcriber software adding different tags about
speakers, time, noise, etc. Each document (audio file and XML file of the
transcription) was described by a set of metadata stored in an XML format to
allow an easy consultation. Second, we added different levels of annotations,
recognition of named entities and annotation of personal information about
speakers. This two annotation tasks used the CasSys system of transducer
cascades. We used and modified a first cascade to recognize named entities.
Then we built a second cascade to annote the designating entities, i.e.
information about the speaker. These second cascade parsed the named entity
annotated corpus. The objective is to locate information about the speaker and,
also, what kind of information can designate him/her. These two cascades was
evaluated with precision and recall measures.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 07:41:42 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Eshkol",
"Iris",
"",
"LLL"
],
[
"Maurel",
"D.",
"",
"LI"
],
[
"Friburger",
"Nathalie",
"",
"LI"
]
] |
new_dataset
| 0.999481 |
1111.3166
|
Francisco Lazaro Blasco
|
Francisco Lazaro Blasco, Gianluigi Liva
|
On the Concatenation of Non-Binary Random Linear Fountain Codes with
Maximum Distance Separable Codes
|
IEEE International Conference on Communications 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel fountain coding scheme has been introduced. The scheme consists of a
parallel concatenation of a MDS block code with a LRFC code, both constructed
over the same field, $F_q$. The performance of the concatenated fountain coding
scheme has been analyzed through derivation of tight bounds on the probability
of decoding failure as a function of the overhead. It has been shown how the
concatenated scheme performs as well as LRFC codes in channels characterized by
high erasure probabilities, whereas they provide failure probabilities lower by
several orders of magnitude at moderate/low erasure probabilities.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 10:35:34 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Blasco",
"Francisco Lazaro",
""
],
[
"Liva",
"Gianluigi",
""
]
] |
new_dataset
| 0.967969 |
1111.3282
|
Zolt\'an K\'asa
|
A. Iv\'anyi, L. Lucz, T. F. M\'ori, P. S\'ot\'er
|
On Erd\H{o}s-Gallai and Havel-Hakimi algorithms
| null |
Acta Univ. Sapientiae, Inform. 3, 2 (2011) 230--268
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Havel in 1955, Erd\H{o}s and Gallai in 1960, Hakimi in 1962, Ruskey, Cohen,
Eades and Scott in 1994, Barnes and Savage in 1997, Kohnert in 2004, Tripathi,
Venugopalan and West in 2010 proposed a method to decide, whether a sequence of
nonnegative integers can be the degree sequence of a simple graph. The running
time of their algorithms is $\Omega(n^2)$ in worst case. In this paper we
propose a new algorithm called EGL (Erd\H{o}s-Gallai Linear algorithm), whose
worst running time is $\Theta(n).$ As an application of this quick algorithm we
computed the number of the different degree sequences of simple graphs for $24,
...,29$ vertices.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 17:04:39 GMT"
}
] | 2011-11-15T00:00:00 |
[
[
"Iványi",
"A.",
""
],
[
"Lucz",
"L.",
""
],
[
"Móri",
"T. F.",
""
],
[
"Sótér",
"P.",
""
]
] |
new_dataset
| 0.983534 |
1107.4939
|
Can Ba\c{s}kent
|
Can Baskent
|
Paraconsistency and Topological Semantics
|
arXiv admin note: substantial text overlap with arXiv:1107.4932
| null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The well-studied notion of deductive explosion describes the situation where
any formula can be deduced from an inconsistent set of formulas. Paraconsistent
logic, on the other hand, is the umbrella term for logical systems where the
logical consequence relation is not explosive. In this work, we investigate the
relationship between some different topological spaces and paraconsistency.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2011 13:15:07 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2011 22:17:02 GMT"
}
] | 2011-11-14T00:00:00 |
[
[
"Baskent",
"Can",
""
]
] |
new_dataset
| 0.99858 |
0706.3546
|
Samer Al Kiswany
|
Samer Al Kiswany, Matei Ripeanu, Sudharshan S. Vazhkudai, Abdullah
Gharaibeh
|
stdchk: A Checkpoint Storage System for Desktop Grid Computing
|
13 pages, 8 figures
| null | null | null |
cs.DC
| null |
Checkpointing is an indispensable technique to provide fault tolerance for
long-running high-throughput applications like those running on desktop grids.
This paper argues that a dedicated checkpoint storage system, optimized to
operate in these environments, can offer multiple benefits: reduce the load on
a traditional file system, offer high-performance through specialization, and,
finally, optimize data management by taking into account checkpoint application
semantics. Such a storage system can present a unifying abstraction to
checkpoint operations, while hiding the fact that there are no dedicated
resources to store the checkpoint data. We prototype stdchk, a checkpoint
storage system that uses scavenged disk space from participating desktops to
build a low-cost storage system, offering a traditional file system interface
for easy integration with applications. This paper presents the stdchk
architecture, key performance optimizations, support for incremental
checkpointing, and increased data availability. Our evaluation confirms that
the stdchk approach is viable in a desktop grid setting and offers a low cost
storage system with desirable performance characteristics: high write
throughput and reduced storage space and network effort to save checkpoint
images.
|
[
{
"version": "v1",
"created": "Mon, 25 Jun 2007 01:24:46 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Nov 2007 20:51:06 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Kiswany",
"Samer Al",
""
],
[
"Ripeanu",
"Matei",
""
],
[
"Vazhkudai",
"Sudharshan S.",
""
],
[
"Gharaibeh",
"Abdullah",
""
]
] |
new_dataset
| 0.999433 |
0707.3236
|
Vladimir Tskhvaradze
|
Vladimir Tskhvaradze
|
RS-232 Led Board
| null | null | null | null |
cs.OH
| null |
This article demonstrates how to develop a Microchip PIC16F84 based device
that supports RS-232 interface with PC. Circuit (LED Board) design and software
development will be discussed. PicBasic Pro Compiler from microEngineering
Labs, Inc. is used for PIC programming. Development of LED Board Control
Console using C/C++ is also briefly discussed. The project requires basic work
experience with Microchip PICs, serial communication and programming.
|
[
{
"version": "v1",
"created": "Sun, 22 Jul 2007 02:31:09 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Tskhvaradze",
"Vladimir",
""
]
] |
new_dataset
| 0.997954 |
0708.4407
|
G.Susinder Rajan
|
G. Susinder Rajan and B. Sundar Rajan
|
Algebraic Distributed Differential Space-Time Codes with Low Decoding
Complexity
|
To appear in IEEE Transactions on Wireless Communications. 10 pages,
5 figures
| null | null | null |
cs.IT cs.DM math.IT math.RA
| null |
The differential encoding/decoding setup introduced by Kiran et al,
Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use
codebooks consisting of unitary matrices is extended to allow codebooks
consisting of scaled unitary matrices. For such codebooks to be usable in the
Jing-Hassibi protocol for cooperative diversity, the conditions involving the
relay matrices and the codebook that need to be satisfied are identified. Using
the algebraic framework of extended Clifford algebras, a new class of
Distributed Differential Space-Time Codes satisfying these conditions for power
of two number of relays and also achieving full cooperative diversity with a
low complexity sub-optimal receiver is proposed. Simulation results indicate
that the proposed codes outperform both the cyclic codes as well as the
circulant codes. Furthermore, these codes can also be applied as Differential
Space-Time codes for non-coherent communication in classical point to point
multiple antenna systems.
|
[
{
"version": "v1",
"created": "Fri, 31 Aug 2007 18:49:54 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Nov 2007 21:49:58 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Rajan",
"G. Susinder",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.953995 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.