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
1011.3718
Wei Dai
Wei Dai
Commutative-like Encryption: A New Characterization of ElGamal
null
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Commutative encryption is a useful but rather strict notion in cryptography. In this paper, we deny a loose variation of commutative encryption-commutative-like encryption and give an example: the generalization of ElGamal scheme. The application of the new variation is also discussed.
[ { "version": "v1", "created": "Tue, 16 Nov 2010 15:05:41 GMT" } ]
2010-11-17T00:00:00
[ [ "Dai", "Wei", "" ] ]
new_dataset
0.984373
0812.0038
Liang-Liang Xie
Liang-Liang Xie
Omnidirectional Relay in Wireless Networks
Revised
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can simultaneously relay different messages in different directions. This is accomplished by the decode-and-forward relay strategy, with each relay binning the multiple messages to be transmitted, in the same spirit of network coding. Specially for the all-source all-cast problem, where each node is an independent source to be transmitted to all the other nodes, this scheme completely eliminates interference in the whole network, and the signal transmitted by any node can be used by any other node. For networks with some kind of symmetry, assuming no beamforming is to be performed, this omnidirectional relay scheme is capable of achieving the maximum achievable rate.
[ { "version": "v1", "created": "Sat, 29 Nov 2008 01:04:30 GMT" }, { "version": "v2", "created": "Sun, 14 Nov 2010 21:53:09 GMT" } ]
2010-11-16T00:00:00
[ [ "Xie", "Liang-Liang", "" ] ]
new_dataset
0.99929
1011.3115
Feng Xia
Feng Xia, Xiangjie Kong, Zhenzhen Xu
Cyber-Physical Control over Wireless Sensor and Actuator Networks with Packet Loss
in Book: Wireless Networking Based Control, edited by Sudip K. Mazumder, Springer, Dec 2010
null
null
null
cs.NI cs.SY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
There is a growing interest in design and implementation of cyber-physical control systems over wireless sensor and actuator networks (WSANs). Thanks to the use of wireless communications and distributed architectures, these systems encompass many advantages as compared to traditional networked control systems using hard wirelines. While WSANs are enabling a new generation of control systems, they also introduce considerable challenges for quality-of-service (QoS) provisioning. In this chapter we examine some of the major QoS challenges raised by WSANs, including resource constraints, platform heterogeneity, dynamic network topology, and mixed traffic. These challenges make it difficult to fulfill the requirements of cyber-physical control in terms of reliability and real-time. The focus of this chapter is on addressing the problem of network reliability. Specifically, we analyze the behavior of wireless channels via simulations based on a realistic link-layer model. Packet loss rate (PLR) is taken as a major metric for the analysis. The results confirm the unreliability of wireless communications and the uncertainty of packet loss over WSANs. To tackle packet loss, we present a simple solution that can take advantage of existing prediction algorithms. Simulations are conducted to evaluate the performance of several classical prediction algorithms used for packet loss compensation. The results give some insights into how to deal with packet loss in cyber-physical control systems over unreliable WSANs.
[ { "version": "v1", "created": "Sat, 13 Nov 2010 07:38:32 GMT" } ]
2010-11-16T00:00:00
[ [ "Xia", "Feng", "" ], [ "Kong", "Xiangjie", "" ], [ "Xu", "Zhenzhen", "" ] ]
new_dataset
0.970726
1011.3382
Md Tanvir Amin
Md. Tanvir Al Amin
Multi-core: Adding a New Dimension to Computing
A short survey of trends in Multi-core Processors, 4 pages, 8 figures
null
null
null
cs.AR cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Invention of Transistors in 1948 started a new era in technology, called Solid State Electronics. Since then, sustaining development and advancement in electronics and fabrication techniques has caused the devices to shrink in size and become smaller, paving the quest for increasing density and clock speed. That quest has suddenly come to a halt due to fundamental bounds applied by physical laws. But, demand for more and more computational power is still prevalent in the computing world. As a result, the microprocessor industry has started exploring the technology along a different dimension. Speed of a single work unit (CPU) is no longer the concern, rather increasing the number of independent processor cores packed in a single package has become the new concern. Such processors are commonly known as multi-core processors. Scaling the performance by using multiple cores has gained so much attention from the academia and the industry, that not only desktops, but also laptops, PDAs, cell phones and even embedded devices today contain these processors. In this paper, we explore state of the art technologies for multi-core processors and existing software tools to support parallelism. We also discuss present and future trend of research in this field. From our survey, we conclude that next few decades are going to be marked by the success of this "Ubiquitous parallel processing".
[ { "version": "v1", "created": "Mon, 15 Nov 2010 13:48:33 GMT" } ]
2010-11-16T00:00:00
[ [ "Amin", "Md. Tanvir Al", "" ] ]
new_dataset
0.997558
0810.0870
Shih-Chun Lin
Pin-Hsun Lin, Shih-Chun Lin, Chung-Pi Lee, and Hsuan-Jung Su
Cognitive Radio with Partial Channel State Information at the Transmitter
resubmitted to IEEE Transaction on Wireless Communications, May 2009
IEEE Transactions on Wireless Communications, vol. 9, no. 11, pp. 3402-3413, Nov. 2010
10.1109/TWC.2010.092410.090725
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we present the cognitive radio system design with partial channel state information known at the transmitter (CSIT).We replace the dirty paper coding (DPC) used in the cognitive radio with full CSIT by the linear assignment Gel'fand-Pinsker coding (LA-GPC), which can utilize the limited knowledge of the channel more efficiently. Based on the achievable rate derived from the LA-GPC, two optimization problems under the fast and slow fading channels are formulated. We derive semianalytical solutions to find the relaying ratios and precoding coefficients. The critical observation is that the complex rate functions in these problems are closely related to ratios of quadratic form. Simulation results show that the proposed semi-analytical solutions perform close to the optimal solutions found by brute-force search, and outperform the systems based on naive DPC. Asymptotic analysis also shows that these solutions converge to the optimal ones solved with full CSIT when the K-factor of Rician channel approaches infinity. Moreover, a new coding scheme is proposed to implement the LA-GPC in practice. Simulation results show that the proposed practical coding scheme can efficiently reach the theoretical rate performance.
[ { "version": "v1", "created": "Mon, 6 Oct 2008 03:41:49 GMT" }, { "version": "v2", "created": "Tue, 19 May 2009 05:14:19 GMT" } ]
2010-11-15T00:00:00
[ [ "Lin", "Pin-Hsun", "" ], [ "Lin", "Shih-Chun", "" ], [ "Lee", "Chung-Pi", "" ], [ "Su", "Hsuan-Jung", "" ] ]
new_dataset
0.963027
1011.2922
Gillian Long
Carl Vogel and Jerom Janssen
Emoticonsciousness
COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers
null
10.1007/978-3-642-12397-9_2
TCD-CS-2010-09
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A temporal analysis of emoticon use in Swedish, Italian, German and English asynchronous electronic communication is reported. Emoticons are classified as positive, negative and neutral. Postings to newsgroups over a 66 week period are considered. The aggregate analysis of emoticon use in newsgroups for science and politics tend on the whole to be consistent over the entire time period. Where possible, events that coincide with divergences from trends in language-subject pairs are noted. Political discourse in Italian over the period shows marked use of negative emoticons, and in Swedish, positive emoticons.
[ { "version": "v1", "created": "Fri, 12 Nov 2010 14:43:04 GMT" } ]
2010-11-15T00:00:00
[ [ "Vogel", "Carl", "" ], [ "Janssen", "Jerom", "" ] ]
new_dataset
0.994732
1011.0640
M. Emre Celebi
M. Emre Celebi, Hitoshi Iyatomi, Gerald Schaefer, William V. Stoecker
Lesion Border Detection in Dermoscopy Images
10 pages, 1 figure, 3 tables
Computerized Medical Imaging and Graphics 33 (2009) 148--153
10.1016/j.compmedimag.2008.11.002
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Background: Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty and subjectivity of human interpretation, computerized analysis of dermoscopy images has become an important research area. One of the most important steps in dermoscopy image analysis is the automated detection of lesion borders. Methods: In this article, we present a systematic overview of the recent border detection methods in the literature paying particular attention to computational issues and evaluation aspects. Conclusion: Common problems with the existing approaches include the acquisition, size, and diagnostic distribution of the test image set, the evaluation of the results, and the inadequate description of the employed methods. Border determination by dermatologists appears to depend upon higher-level knowledge, therefore it is likely that the incorporation of domain knowledge in automated methods will enable them to perform better, especially in sets of images with a variety of diagnoses.
[ { "version": "v1", "created": "Sat, 30 Oct 2010 17:17:02 GMT" } ]
2010-11-13T00:00:00
[ [ "Celebi", "M. Emre", "" ], [ "Iyatomi", "Hitoshi", "" ], [ "Schaefer", "Gerald", "" ], [ "Stoecker", "William V.", "" ] ]
new_dataset
0.99899
1010.4858
Salah A. Aly
Salah A. Aly, Nirwan Ansari, Anwar I. Walid, H. Vincent Poor
S-MATE: Secure Coding-based Multipath Adaptive Traffic Engineering
null
null
null
null
cs.NI cs.CR cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
There have been several approaches to provisioning traffic between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase network capacity, and enhance network security services. MATE (Multipath Adaptive Traffic Engineering) protocol has been proposed for multipath adaptive traffic engineering between an ingress node (source) and an egress node (destination). Its novel idea is to avoid network congestion and attacks that might exist in edge and node disjoint paths between two core network nodes. This paper builds an adaptive, robust, and reliable traffic engineering scheme for better performance of communication network operations. This will also provision quality of service (QoS) and protection of traffic engineering to maximize network efficiency. Specifically, we present a new approach, S-MATE (secure MATE) is developed to protect the network traffic between two core nodes (routers or switches) in a cloud network. S-MATE secures against a single link attack/failure by adding redundancy in one of the operational paths between the sender and receiver. The proposed scheme can be built to secure core networks such as optical and IP networks.
[ { "version": "v1", "created": "Sat, 23 Oct 2010 08:24:01 GMT" } ]
2010-11-12T00:00:00
[ [ "Aly", "Salah A.", "" ], [ "Ansari", "Nirwan", "" ], [ "Walid", "Anwar I.", "" ], [ "Poor", "H. Vincent", "" ] ]
new_dataset
0.985192
1011.2538
Scott Carter
Scott Carter, Laurent Denoue, John Adcock
mVideoCast: Mobile, real time ROI detection and streaming
null
null
null
FXPAL-TR-10-003
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A variety of applications are emerging to support streaming video from mobile devices. However, many tasks can benefit from streaming specific content rather than the full video feed which may include irrelevant, private, or distracting content. We describe a system that allows users to capture and stream targeted video content captured with a mobile device. The application incorporates a variety of automatic and interactive techniques to identify and segment desired content in the camera view, allowing the user to publish a more focused video.
[ { "version": "v1", "created": "Thu, 11 Nov 2010 00:28:34 GMT" } ]
2010-11-12T00:00:00
[ [ "Carter", "Scott", "" ], [ "Denoue", "Laurent", "" ], [ "Adcock", "John", "" ] ]
new_dataset
0.999892
1011.2488
Luca Tesei
Ezio Bartocci, Diletta Romana Cacciagrano, Maria Rita Di Berardini, Emanuela Merelli and Luca Tesei
Shape Calculus: Timed Operational Semantics and Well-formedness
42 pages, 4 figures, extended version of Bartocci, E.; Cacciagrano, D. R.; Di Berardini, M. R.; Merelli, E. & Tesei, L. Timed Operational Semantics and Well-formedness of Shape Calculus. Scientific Annals of Computer Science, 20, 2010
null
null
null
cs.PL cs.CE cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. Behaviours are specified with a timed CCS-like process algebra using a notion of channel that models naturally binding sites on the surface of shapes. Processes can represent molecules or other mobile objects and can be part of networks of processes that move simultaneously and interact in a given geometrical space. The calculus embeds collision detection and response, binding of compatible 3D processes and splitting of previously established bonds. In this work the full formal timed operational semantics of the calculus is provided, together with examples that illustrate the use of the calculus in a well-known biological scenario. Moreover, a result of well-formedness about the evolution of a given network of well-formed 3D processes is proved.
[ { "version": "v1", "created": "Tue, 9 Nov 2010 11:33:59 GMT" } ]
2010-11-11T00:00:00
[ [ "Bartocci", "Ezio", "" ], [ "Cacciagrano", "Diletta Romana", "" ], [ "Di Berardini", "Maria Rita", "" ], [ "Merelli", "Emanuela", "" ], [ "Tesei", "Luca", "" ] ]
new_dataset
0.999392
0812.4710
Lahatra Rakotondrainibe
Lahatra Rakotondrainibe (IETR), Gheorghe Zaharia (IETR), Gha\"is El Zein (IETR), Yves Lostanlen (IETR)
Indoor Channel Measurements and Communications System Design at 60 GHz
2 pages
XXIX URSI General Assembly, Chicago : \'Etats-Unis (2008)
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents a brief overview of several studies concerning the indoor wireless communications at 60 GHz performed by the IETR. The characterization and the modeling of the radio propagation channel are based on several measurement campaigns realized with the channel sounder developed at IETR. Some typical residential environments were also simulated by ray tracing and Gaussian Beam Tracking. The obtained results show a good agreement with the similar experimental results. Currently, the IETR is developing a high data rate wireless communication system operating at 60 GHz. The single-carrier architecture of this system is also presented.
[ { "version": "v1", "created": "Fri, 26 Dec 2008 21:04:15 GMT" } ]
2010-11-10T00:00:00
[ [ "Rakotondrainibe", "Lahatra", "", "IETR" ], [ "Zaharia", "Gheorghe", "", "IETR" ], [ "Zein", "Ghaïs El", "", "IETR" ], [ "Lostanlen", "Yves", "", "IETR" ] ]
new_dataset
0.987558
0905.0315
Lahatra Rakotondrainibe
Lahatra Rakotondrainibe (IETR), Yvan Kokar (IETR), Gheorghe Zaharia (IETR), Gha\"is El Zein (IETR)
Millimeter-Wave System for High Data Rate Indoor Communications
5 pages
ISSCS 2009, Iasi : Roumanie (2009)
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents the realization of a wireless Gigabit Ethernet communication system operating in the 60 GHz band. The system architecture uses a single carrier modulation. A differential encoded binary phase shift keying modulation and a differential demodulation scheme are adopted for the intermediate frequency blocks. The baseband blocks use Reed- Solomon RS (255, 239) coding and decoding for channel forward error correction (FEC). First results of bit error rate (BER) measurements at 875 Mbps, without channel coding, are presented for different antennas.
[ { "version": "v1", "created": "Mon, 4 May 2009 07:20:31 GMT" } ]
2010-11-10T00:00:00
[ [ "Rakotondrainibe", "Lahatra", "", "IETR" ], [ "Kokar", "Yvan", "", "IETR" ], [ "Zaharia", "Gheorghe", "", "IETR" ], [ "Zein", "Ghaïs El", "", "IETR" ] ]
new_dataset
0.998576
1006.5762
Kenneth Shum
Kenneth W. Shum and Wing Shing Wong
Construction and Applications of CRT Sequences
16 pages, 5 figures. Some typos in Section V are corrected
IEEE Trans. on Information Theory, vol. 56, no. 11, p.5780-5795, Nov, 2010
10.1109/TIT.2010.2070550
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the protocol sequence. In order to minimize fluctuation of throughput due to delay offsets, we want to construct protocol sequences whose pairwise Hamming cross-correlation is as close to a constant as possible. In this paper, we present a construction of protocol sequences which is based on the bijective mapping between one-dimensional sequence and two-dimensional array by the Chinese Remainder Theorem (CRT). In the application to the collision channel without feedback, a worst-case lower bound on system throughput is derived.
[ { "version": "v1", "created": "Wed, 30 Jun 2010 03:57:24 GMT" }, { "version": "v2", "created": "Sat, 6 Nov 2010 09:28:38 GMT" }, { "version": "v3", "created": "Tue, 9 Nov 2010 02:20:42 GMT" } ]
2010-11-10T00:00:00
[ [ "Shum", "Kenneth W.", "" ], [ "Wong", "Wing Shing", "" ] ]
new_dataset
0.994089
0806.3480
Alena Aleksenko I
Oleg German, Evgeny Lakshtanov
"Minesweeper" and spectrum of discrete Laplacians
We add consideration of tables based on the triangle tiling of the plane. Its paper version encounters situations typical for the computer "Minesweeper" game
Applicable Analysis, Vol. 89, No. 12, December 2010, 1907-1916
10.1080/00036811.2010.505189
null
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The paper is devoted to a problem inspired by the "Minesweeper" computer game. It is shown that certain configurations of open cells guarantee the existence and the uniqueness of solution. Mathematically the problem is reduced to some spectral properties of discrete differential operators. It is shown how the uniqueness can be used to create a new game which preserves the spirit of "Minesweeper" but does not require a computer.
[ { "version": "v1", "created": "Fri, 20 Jun 2008 22:00:56 GMT" }, { "version": "v2", "created": "Mon, 23 Feb 2009 15:10:08 GMT" }, { "version": "v3", "created": "Mon, 14 Dec 2009 00:16:59 GMT" } ]
2010-11-09T00:00:00
[ [ "German", "Oleg", "" ], [ "Lakshtanov", "Evgeny", "" ] ]
new_dataset
0.978668
1011.1551
Patrizio Pelliccione
Patrizio Pelliccione, Henry Muccini, Nicolas Guelfi, and Alexander Romanovsky
An Introduction to Software Engineering and Fault Tolerance
null
Introduction chapter to the "SOFTWARE ENGINEERING OF FAULT TOLERANT SYSTEMS" book, Series on Software Engineering and Knowledge Eng., 2007
null
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This book consists of the chapters describing novel approaches to integrating fault tolerance into software development process. They cover a wide range of topics focusing on fault tolerance during the different phases of the software development, software engineering techniques for verification and validation of fault tolerance means, and languages for supporting fault tolerance specification and implementation. Accordingly, the book is structured into the following three parts: Part A: Fault tolerance engineering: from requirements to code; Part B: Verification and validation of fault tolerant systems; Part C: Languages and Tools for engineering fault tolerant systems.
[ { "version": "v1", "created": "Sat, 6 Nov 2010 10:27:01 GMT" } ]
2010-11-09T00:00:00
[ [ "Pelliccione", "Patrizio", "" ], [ "Muccini", "Henry", "" ], [ "Guelfi", "Nicolas", "" ], [ "Romanovsky", "Alexander", "" ] ]
new_dataset
0.990819
1011.1793
Jaydip Sen
Jaydip Sen, Kaustav Goswami
An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks
6 pages, 6 figures, 3 tables. Conference: International Symposium on Intelligent Information Systems and Applications (IISA'09)
null
null
ISBN 978-952-5726-04-6 (Print), 978-952-5726-05-3 (CD-ROM)
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN. It uses statistical theory of inference for reliable clustering of the nodes and is based on local observations by the nodes. Simulation results show that the algorithm has a high detection rate while having a low rate of false positives.
[ { "version": "v1", "created": "Mon, 8 Nov 2010 13:13:59 GMT" } ]
2010-11-09T00:00:00
[ [ "Sen", "Jaydip", "" ], [ "Goswami", "Kaustav", "" ] ]
new_dataset
0.98969
1011.1892
Arnaud Legout
Stevens Le Blond (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes), Arnaud Legout (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes), Walid Dabbous (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes)
Pushing BitTorrent Locality to the Limit
null
Computer Networks (2010)
10.1016/j.comnet.2010.09.014
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Peer-to-peer (P2P) locality has recently raised a lot of interest in the community. Indeed, whereas P2P content distribution enables financial savings for the content providers, it dramatically increases the traffic on inter-ISP links. To solve this issue, the idea to keep a fraction of the P2P traffic local to each ISP was introduced a few years ago. Since then, P2P solutions exploiting locality have been introduced. However, several fundamental issues on locality still need to be explored. In particular, how far can we push locality, and what is, at the scale of the Internet, the reduction of traffic that can be achieved with locality? In this paper, we perform extensive experiments on a controlled environment with up to 10,000 BitTorrent clients to evaluate the impact of high locality on inter-ISP links traffic and peers download completion time. We introduce two simple mechanisms that make high locality possible in challenging scenarios and we show that we save up to several orders of magnitude inter-ISP traffic compared to traditional locality without adversely impacting peers download completion time. In addition, we crawled 214,443 torrents representing 6,113,224 unique peers spread among 9,605 ASes. We show that whereas the torrents we crawled generated 11.6 petabytes of inter-ISP traffic, our locality policy implemented for all torrents could have reduced the global inter-ISP traffic by up to 40%.
[ { "version": "v1", "created": "Mon, 8 Nov 2010 20:29:17 GMT" } ]
2010-11-09T00:00:00
[ [ "Blond", "Stevens Le", "", "INRIA Sophia Antipolis / INRIA Rhône-Alpes" ], [ "Legout", "Arnaud", "", "INRIA Sophia Antipolis / INRIA Rhône-Alpes" ], [ "Dabbous", "Walid", "", "INRIA Sophia Antipolis / INRIA Rhône-Alpes" ] ]
new_dataset
0.994974
1002.4759
Diego Ruano
Olav Geil, Carlos Munuera, Diego Ruano, Fernando Torres
On the order bounds for one-point AG codes
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [H. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields and their Applications 14 (2008), pp. 92-123]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound $d^*$ for the minimum distance of these codes. We establish a connection between $d^*$ and the order bound and its generalizations. We also study the improved code constructions based on $d^*$. Finally we extend $d^*$ to all generalized Hamming weights.
[ { "version": "v1", "created": "Thu, 25 Feb 2010 11:22:50 GMT" }, { "version": "v2", "created": "Wed, 3 Nov 2010 11:01:10 GMT" } ]
2010-11-04T00:00:00
[ [ "Geil", "Olav", "" ], [ "Munuera", "Carlos", "" ], [ "Ruano", "Diego", "" ], [ "Torres", "Fernando", "" ] ]
new_dataset
0.993769
1009.3809
arXiv Admin
Ramesh C. Bagadi
One, Two, Three and N Dimensional String Search Algorithms
withdrawn by arXiv admin due to authorship dispute
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this research endeavor, some Sequence Alignment Algorithms are detailed that are useful for finding or comparing 1 dimensional (1-D), 2 dimensional (2-D), 3 dimensional (3-D) sequences in or against a parent or mother database which is 1 dimensional (1-D), 2 dimensional (2-D), 3 dimensional (3-D) sequence. Inner Product [1], [2] based schemes are used to lay down such algorithms. Also,in this research, a Sequence Alignment Algorithms is detailed that is useful for finding or comparing an N-Dimensional (N-D) sequence in or against a parent or mother database which N-Dimensional (N-D) sequence. Inner Product [1], [2] based schemes are used to lay down such an algorithm.
[ { "version": "v1", "created": "Mon, 20 Sep 2010 13:11:52 GMT" }, { "version": "v2", "created": "Tue, 2 Nov 2010 19:30:09 GMT" } ]
2010-11-03T00:00:00
[ [ "Bagadi", "Ramesh C.", "" ] ]
new_dataset
0.996308
1011.0474
Mireille Sarkiss
Mireille Sarkiss, Ghaya Rekaya-Ben Othman, Mohamed Oussama Damen and Jean-Claude Belfiore
Construction of New Delay-Tolerant Space-Time Codes
33 pages, 7 figures
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing Determinants (NVD) and hence achieve Diversity-Multiplexing Tradeoff (DMT). In addition, these codes have led to optimal distributed space-time codes when applied in cooperative networks under the assumption of perfect synchronization between relays. However, they loose their diversity when delays are introduced and thus are not delay-tolerant. In this paper, using the cyclic division algebras of perfect codes, we construct new codes that maintain the same properties as perfect codes in the synchronous case. Moreover, these codes preserve their full-diversity in asynchronous transmission.
[ { "version": "v1", "created": "Mon, 1 Nov 2010 23:56:27 GMT" } ]
2010-11-03T00:00:00
[ [ "Sarkiss", "Mireille", "" ], [ "Othman", "Ghaya Rekaya-Ben", "" ], [ "Damen", "Mohamed Oussama", "" ], [ "Belfiore", "Jean-Claude", "" ] ]
new_dataset
0.969947
1011.0487
EPTCS
Andrew Phillips (Microsoft Research), Matthew Lakin (Microsoft Research), Lo\"ic Paulev\'e (Ecole Centrale de Nantes)
Stochastic Simulation of Process Calculi for Biology
In Proceedings MeCBIC 2010, arXiv:1011.0051
EPTCS 40, 2010, pp. 1-5
10.4204/EPTCS.40.1
null
cs.PL cs.CE q-bio.QM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Biological systems typically involve large numbers of components with complex, highly parallel interactions and intrinsic stochasticity. To model this complexity, numerous programming languages based on process calculi have been developed, many of which are expressive enough to generate unbounded numbers of molecular species and reactions. As a result of this expressiveness, such calculi cannot rely on standard reaction-based simulation methods, which require fixed numbers of species and reactions. Rather than implementing custom stochastic simulation algorithms for each process calculus, we propose to use a generic abstract machine that can be instantiated to a range of process calculi and a range of reaction-based simulation algorithms. The abstract machine functions as a just-in-time compiler, which dynamically updates the set of possible reactions and chooses the next reaction in an iterative cycle. In this short paper we give a brief summary of the generic abstract machine, and show how it can be instantiated with the stochastic simulation algorithm known as Gillespie's Direct Method. We also discuss the wider implications of such an abstract machine, and outline how it can be used to simulate multiple calculi simultaneously within a common framework.
[ { "version": "v1", "created": "Tue, 2 Nov 2010 01:29:04 GMT" } ]
2010-11-03T00:00:00
[ [ "Phillips", "Andrew", "", "Microsoft Research" ], [ "Lakin", "Matthew", "", "Microsoft\n Research" ], [ "Paulevé", "Loïc", "", "Ecole Centrale de Nantes" ] ]
new_dataset
0.997078
1011.0492
EPTCS
Diletta Cacciagrano (School of Science and Technology - University of Camerino), Flavio Corradini (School of Science and Technology - University of Camerino), Emanuela Merelli (School of Science and Technology - University of Camerino), Luca Tesei (School of Science and Technology - University of Camerino)
Multiscale Bone Remodelling with Spatial P Systems
In Proceedings MeCBIC 2010, arXiv:1011.0051
EPTCS 40, 2010, pp. 70-84
10.4204/EPTCS.40.6
null
cs.CE q-bio.QM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Many biological phenomena are inherently multiscale, i.e. they are characterized by interactions involving different spatial and temporal scales simultaneously. Though several approaches have been proposed to provide "multilayer" models, only Complex Automata, derived from Cellular Automata, naturally embed spatial information and realize multiscaling with well-established inter-scale integration schemas. Spatial P systems, a variant of P systems in which a more geometric concept of space has been added, have several characteristics in common with Cellular Automata. We propose such a formalism as a basis to rephrase the Complex Automata multiscaling approach and, in this perspective, provide a 2-scale Spatial P system describing bone remodelling. The proposed model not only results to be highly faithful and expressive in a multiscale scenario, but also highlights the need of a deep and formal expressiveness study involving Complex Automata, Spatial P systems and other promising multiscale approaches, such as our shape-based one already resulted to be highly faithful.
[ { "version": "v1", "created": "Tue, 2 Nov 2010 01:29:39 GMT" } ]
2010-11-03T00:00:00
[ [ "Cacciagrano", "Diletta", "", "School of Science and Technology - University of\n Camerino" ], [ "Corradini", "Flavio", "", "School of Science and Technology - University of\n Camerino" ], [ "Merelli", "Emanuela", "", "School of Science and Technology - University of\n Camerino" ], [ "Tesei", "Luca", "", "School of Science and Technology - University of\n Camerino" ] ]
new_dataset
0.995041
1011.0507
Manoj Kumar Taleja
Manoj Kumar, Sandeep K. Arya, Sujata Pandey
Level Shifter Design for Low Power Applications
null
null
null
null
cs.OH
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With scaling of Vt sub-threshold leakage power is increasing and expected to become significant part of total power consumption In present work three new configurations of level shifters for low power application in 0.35{\mu}m technology have been presented. The proposed circuits utilize the merits of stacking technique with smaller leakage current and reduction in leakage power. Conventional level shifter has been improved by addition of three NMOS transistors, which shows total power consumption of 402.2264pW as compared to 0.49833nW with existing circuit. Single supply level shifter has been modified with addition of two NMOS transistors that gives total power consumption of 108.641pW as compared to 31.06nW. Another circuit, contention mitigated level shifter (CMLS) with three additional transistors shows total power consumption of 396.75pW as compared to 0.4937354nW. Three proposed circuit's shows better performance in terms of power consumption with a little conciliation in delay. Output level of 3.3V has been obtained with input pulse of 1.6V for all proposed circuits.
[ { "version": "v1", "created": "Tue, 2 Nov 2010 04:20:46 GMT" } ]
2010-11-03T00:00:00
[ [ "Kumar", "Manoj", "" ], [ "Arya", "Sandeep K.", "" ], [ "Pandey", "Sujata", "" ] ]
new_dataset
0.975549
1011.0527
Balu Achimuthu
A. Balu, and K. Kuppusamy
Ciphertext Policy Attribute based Encryption with anonymous access policy
null
International journal of Peer to Peer Networks, pp1-8,Vol 1, Number 1, October 2010
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix the policy, who can decrypt the encrypted message. The policy can be formed with the help of attributes. In CP-ABE, access policy is sent along with the ciphertext. We propose a method in which the access policy need not be sent along with the ciphertext, by which we are able to preserve the privacy of the encryptor. The proposed construction is provably secure under Decision Bilinear Diffe-Hellman assumption.
[ { "version": "v1", "created": "Tue, 2 Nov 2010 07:03:00 GMT" } ]
2010-11-03T00:00:00
[ [ "Balu", "A.", "" ], [ "Kuppusamy", "K.", "" ] ]
new_dataset
0.987627
1011.0531
Andrej Bogdanov
Andrej Bogdanov and Fan Li
A better tester for bipartiteness?
18 pages
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is {\epsilon}-far from bipartite, then the subgraph induced by a random subset of O(1/{\epsilon}) vertices is bipartite with high probability. We conjecture that the induced subgraph is {\Omega}~({\epsilon})-far from bipartite with high probability. Gonen and Ron (RANDOM 2007) proved this conjecture in the case when the degrees of all vertices are at most O({\epsilon}n). We give a more general proof that works for any d-regular (or almost d-regular) graph for arbitrary degree d. Assuming this conjecture, we prove that bipartiteness is testable with one-sided error in time O(1/{\epsilon}^c), where c is a constant strictly smaller than two, improving upon the tester of Alon and Krivelevich. As it is known that non-adaptive testers for bipartiteness require {\Omega}(1/{\epsilon}^2) queries (Bogdanov and Trevisan, CCC 2004), our result shows, assuming the conjecture, that adaptivity helps in testing bipartiteness.
[ { "version": "v1", "created": "Tue, 2 Nov 2010 07:48:15 GMT" } ]
2010-11-03T00:00:00
[ [ "Bogdanov", "Andrej", "" ], [ "Li", "Fan", "" ] ]
new_dataset
0.995103
1005.5553
Yevhen (Eugene) Vasiliu
Oleksandr Korchenko, Yevhen Vasiliu, Sergiy Gnatyuk
Modern Quantum Technologies of Information Security
11 pages, 3 figures, 80 references, text is corrected
Aviation. Vilnius: Technika, 2010, Vol. 14, No. 2 , p. 58-69
10.3846/aviation.2010.10
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, the systematisation and classification of modern quantum technologies of information security against cyber-terrorist attack are carried out. The characteristic of the basic directions of quantum cryptography from the viewpoint of the quantum technologies used is given. A qualitative analysis of the advantages and disadvantages of concrete quantum protocols is made. The current status of the problem of practical quantum cryptography use in telecommunication networks is considered. In particular, a short review of existing commercial systems of quantum key distribution is given.
[ { "version": "v1", "created": "Sun, 30 May 2010 18:01:51 GMT" }, { "version": "v2", "created": "Fri, 29 Oct 2010 21:02:51 GMT" } ]
2010-11-02T00:00:00
[ [ "Korchenko", "Oleksandr", "" ], [ "Vasiliu", "Yevhen", "" ], [ "Gnatyuk", "Sergiy", "" ] ]
new_dataset
0.984698
1011.0223
EPTCS
\'Etienne Andr\'e (LSV, CNRS, ENSC, France)
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
In Proceedings INFINITY 2010, arXiv:1010.6112
EPTCS 39, 2010, pp. 91-99
10.4204/EPTCS.39.7
null
cs.FL cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation satisfying this constraint, the system behaves the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. Imitator II also implements the "behavioral cartography algorithm", allowing us to solve the following good parameters problem: find a set of valuations within a given bounded parametric domain for which the system behaves well. We present new features and optimizations of the tool, and give results of applications to various examples of asynchronous circuits and communication protocols.
[ { "version": "v1", "created": "Mon, 1 Nov 2010 00:19:18 GMT" } ]
2010-11-02T00:00:00
[ [ "André", "Étienne", "", "LSV, CNRS, ENSC, France" ] ]
new_dataset
0.972382
1011.0279
Majid Taghiloo
Majid Taghiloo, Mohammad Ali Agheli, and Mohammad Reza Rezaeinezhad
Mobile Based Secure Digital Wallet for Peer to Peer Payment System
null
International Journal of UbiComp (IJU), Vol.1, No.4, October 2010
null
null
cs.CE
http://creativecommons.org/licenses/by/3.0/
E-commerce in today's conditions has the highest dependence on network infrastructure of banking. However, when the possibility of communicating with the Banking network is not provided, business activities will suffer. This paper proposes a new approach of digital wallet based on mobile devices without the need to exchange physical money or communicate with banking network. A digital wallet is a software component that allows a user to make an electronic payment in cash (such as a credit card or a digital coin), and hides the low-level details of executing the payment protocol that is used to make the payment. The main features of proposed architecture are secure awareness, fault tolerance, and infrastructure-less protocol.
[ { "version": "v1", "created": "Mon, 1 Nov 2010 09:55:23 GMT" } ]
2010-11-02T00:00:00
[ [ "Taghiloo", "Majid", "" ], [ "Agheli", "Mohammad Ali", "" ], [ "Rezaeinezhad", "Mohammad Reza", "" ] ]
new_dataset
0.999246
1011.0313
Vincent Nesme
Johannes G\"utschow, Vincent Nesme, Reinhard F. Werner
The fractal structure of cellular automata on Abelian groups
29 pages, 15 figures, preprint of a journal version
null
null
null
cs.DM quant-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular automata is a much explored topic, but virtually all of the results revolve around a special class of automata, whose typical features include irreversibility, an alphabet with a ring structure, a global evolution that is a ring homomorphism, and a property known as (weakly) p-Fermat. The class of automata that we study in this article has none of these properties. Their cell structure is weaker, as it does not come with a multiplication, and they are far from being p-Fermat, even weakly. However, they do produce fractal spacetime diagrams, and we explain why and how.
[ { "version": "v1", "created": "Mon, 1 Nov 2010 13:12:28 GMT" } ]
2010-11-02T00:00:00
[ [ "Gütschow", "Johannes", "" ], [ "Nesme", "Vincent", "" ], [ "Werner", "Reinhard F.", "" ] ]
new_dataset
0.998777
0809.1681
Rafael Laufer
Rafael Laufer and Leonard Kleinrock
Multirate Anypath Routing in Wireless Mesh Networks
13 pages, 8 figures
IEEE INFOCOM 2009
10.1109/INFCOM.2009.5061904
UCLA-CSD-TR080025
cs.NI cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We bridge this gap by introducing a polynomial-time algorithm to this problem and provide the proof of its optimality. The proposed algorithm runs in the same running time as regular shortest-path algorithms and is therefore suitable for deployment in link-state routing protocols. We conducted experiments in a 802.11b testbed network, and our results show that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, performance improves by up to one order of magnitude.
[ { "version": "v1", "created": "Tue, 9 Sep 2008 21:49:04 GMT" } ]
2010-11-01T00:00:00
[ [ "Laufer", "Rafael", "" ], [ "Kleinrock", "Leonard", "" ] ]
new_dataset
0.999519
1010.6166
Rafael Laufer
Rafael Laufer, Henri Dubois-Ferri\`ere, and Leonard Kleinrock
Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks
14 pages, 11 figures
null
null
UCLA-CSD-TR100034
cs.NI cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we present a new routing paradigm that generalizes opportunistic routing for wireless multihop networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there has been no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We solve this by introducing two polynomial-time routing algorithms and provide the proof of their optimality. The proposed algorithms run in roughly the same running time as regular shortest-path algorithms, and are therefore suitable for deployment in routing protocols. We conducted measurements in an 802.11b testbed network, and our trace-driven analysis shows that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, performance improves by up to one order of magnitude.
[ { "version": "v1", "created": "Fri, 29 Oct 2010 09:45:16 GMT" } ]
2010-11-01T00:00:00
[ [ "Laufer", "Rafael", "" ], [ "Dubois-Ferrière", "Henri", "" ], [ "Kleinrock", "Leonard", "" ] ]
new_dataset
0.976432
1010.6242
Bernard Jacquemin
Martine Hurault-Plantet (LIMSI), Elie Naulleau, Bernard Jacquemin (CREM-EA3476)
GraphDuplex: visualisation simultan\'ee de N r\'eseaux coupl\'es 2 par 2
null
Conf\'erence en Recherche d'Information et Applications (CORIA 2009), Prequ'\^ile de Giens : France (2009)
null
null
cs.IR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
While social network analysis often focuses on graph structure of social actors, an increasing number of communication networks now provide textual content within social activity (email, instant messaging, blogging, collaboration networks). We present an open source visualization software, GraphDuplex, which brings together social structure and textual content, adding a semantic dimension to social analysis. GraphDuplex eventually connects any number of social or semantic graphs together, and through dynamic queries enables user interaction and exploration across multiple graphs of different nature.
[ { "version": "v1", "created": "Fri, 29 Oct 2010 15:11:05 GMT" } ]
2010-11-01T00:00:00
[ [ "Hurault-Plantet", "Martine", "", "LIMSI" ], [ "Naulleau", "Elie", "", "CREM-EA3476" ], [ "Jacquemin", "Bernard", "", "CREM-EA3476" ] ]
new_dataset
0.99776
1010.5891
Damien Chablat
Liang Ma (IRCCyN, DIE), Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN), Wei Zhang (DIE), Fran\c{c}ois Guillaume
A new muscle fatigue and recovery model and its ergonomics application in human simulation
null
Virtual and Physical Prototyping 5, 3 (2010) 123 - 137
10.1080/17452759.2010.504056
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Although automatic techniques have been employed in manufacturing industries to increase productivity and efficiency, there are still lots of manual handling jobs, especially for assembly and maintenance jobs. In these jobs, musculoskeletal disorders (MSDs) are one of the major health problems due to overload and cumulative physical fatigue. With combination of conventional posture analysis techniques, digital human modelling and simulation (DHM) techniques have been developed and commercialized to evaluate the potential physical exposures. However, those ergonomics analysis tools are mainly based on posture analysis techniques, and until now there is still no fatigue index available in the commercial software to evaluate the physical fatigue easily and quickly. In this paper, a new muscle fatigue and recovery model is proposed and extended to evaluate joint fatigue level in manual handling jobs. A special application case is described and analyzed by digital human simulation technique.
[ { "version": "v1", "created": "Thu, 28 Oct 2010 08:54:12 GMT" } ]
2010-10-29T00:00:00
[ [ "Ma", "Liang", "", "IRCCyN, DIE" ], [ "Chablat", "Damien", "", "IRCCyN" ], [ "Bennis", "Fouad", "", "IRCCyN" ], [ "Zhang", "Wei", "", "DIE" ], [ "Guillaume", "François", "" ] ]
new_dataset
0.994743
1010.5562
Robin Scheibler
Robin Scheibler, Paul Hurley, Amina Chebira
Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts
10 pages, 10 figures
null
null
null
cs.CE cs.CG cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques envisioned to speed up VLSI design. To ensure correct printing of the constantly shrinking transistors and simultaneously handle their increasingly large number, ever more computationally intensive techniques are needed. Therefore, efficient algorithms for the Haar and Fourier transforms are vital. We derive the complexity of both algorithms and compare it to that of discrete transforms traditionally used in VLSI. We find a significant reduction in complexity when the number of vertices of the polygons is small, as is the case in VLSI layouts. This analysis is completed by an implementation and a benchmark of the continuous algorithms and their discrete counterpart. We show that on tested VLSI layouts the pruned continuous Haar transform is 5 to 25 times faster, while the fast continuous Fourier series is 1.5 to 3 times faster.
[ { "version": "v1", "created": "Wed, 27 Oct 2010 03:45:45 GMT" } ]
2010-10-28T00:00:00
[ [ "Scheibler", "Robin", "" ], [ "Hurley", "Paul", "" ], [ "Chebira", "Amina", "" ] ]
new_dataset
0.97589
1010.5571
EPTCS
Matthieu Lemerre (CEA LIST), Vincent David (CEA LIST), Christophe Aussagu\`es (CEA LIST), Guy Vidal-Naquet (SUPELEC)
An Introduction to Time-Constrained Automata
In Proceedings ICE 2010, arXiv:1010.5308
EPTCS 38, 2010, pp. 83-98
10.4204/EPTCS.38.9
null
cs.LO cs.FL cs.OS cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be aperiodic, and are selected dynamically following a graph, the time-constrained automaton. This allows expressing much more precise time constraints than classical periodic or sporadic model, while preserving the ease of scheduling and analysis. We provide some properties of this model as well as their scheduling semantics. We show that TCA can be automatically derived from source-code, and optimally scheduled on single processors using a variant of EDF. We explain how time constraints can be used to guarantee communication determinism by construction, and to study when possible agent interactions happen.
[ { "version": "v1", "created": "Wed, 27 Oct 2010 05:04:38 GMT" } ]
2010-10-28T00:00:00
[ [ "Lemerre", "Matthieu", "", "CEA LIST" ], [ "David", "Vincent", "", "CEA LIST" ], [ "Aussaguès", "Christophe", "", "CEA LIST" ], [ "Vidal-Naquet", "Guy", "", "SUPELEC" ] ]
new_dataset
0.999183
1010.5572
EPTCS
Harsh Beohar (TU/e), Pieter Cuijpers (TU/e)
A theory of desynchronisable closed loop system
In Proceedings ICE 2010, arXiv:1010.5308
EPTCS 38, 2010, pp. 99-114
10.4204/EPTCS.38.10
null
cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The task of implementing a supervisory controller is non-trivial, even though different theories exist that allow automatic synthesis of these controllers in the form of automata. One of the reasons for this discord is due to the asynchronous interaction between a plant and its controller in implementations, whereas the existing supervisory control theories assume synchronous interaction. As a consequence the implementation suffer from the so-called inexact synchronisation problem. In this paper we address the issue of inexact synchronisation in a process algebraic setting, by solving a more general problem of refinement. We construct an asynchronous closed loop system by introducing a communication medium in a given synchronous closed loop system. Our goal is to find sufficient conditions under which a synchronous closed loop system is branching bisimilar to its corresponding asynchronous closed loop system.
[ { "version": "v1", "created": "Wed, 27 Oct 2010 05:04:44 GMT" } ]
2010-10-28T00:00:00
[ [ "Beohar", "Harsh", "", "TU/e" ], [ "Cuijpers", "Pieter", "", "TU/e" ] ]
new_dataset
0.956265
1010.5623
Claudio Testa
Giovanna Carofiglio, Luca Muscariello, Dario Rossi, Claudio Testa and Silvio Valenti
Rethinking low extra delay background transport protocols
9 pages, 6 figures
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
BitTorrent has recently introduced LEDBAT, a novel application-layer congestion control protocol for data exchange. The protocol design starts from the assumption that network bottlenecks are at the access of the network, and that thus user traffic competes creating self-inducing congestion. To relieve from this phenomenon, LEDBAT is designed to quickly infer that self-induced congestion is approaching (by detecting relative changes of the one-way delay in the transmission path), and to react by reducing the sending rate prior that congestion occurs. Prior work has however shown LEDBAT to be affected by a latecomer advantage, where newly arriving connections can starve already existing flows. In this work, we propose modifications to the congestion window update mechanism of the LEDBAT protocol that aim at solving this issue, guaranteeing thus intra-protocol fairness and efficiency. Closed-form expressions for the stationary throughput and queue occupancy are provided via a fluid model, whose accuracy is confirmed by means of ns2 packet level simulations. Our results show that the proposed change can effective solve the latecomer issue, without affecting the other original LEDBAT goals at the same time.
[ { "version": "v1", "created": "Wed, 27 Oct 2010 09:34:43 GMT" } ]
2010-10-28T00:00:00
[ [ "Carofiglio", "Giovanna", "" ], [ "Muscariello", "Luca", "" ], [ "Rossi", "Dario", "" ], [ "Testa", "Claudio", "" ], [ "Valenti", "Silvio", "" ] ]
new_dataset
0.98094
1010.5694
Akim Demaille
Jean-Christophe Baillie, Akim Demaille, Quentin Hocquet, Matthieu Nottale
Events! (Reactivity in urbiscript)
DSLRob'10
null
null
null
cs.PL cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Urbi SDK is a software platform for the development of portable robotic applications. It features the Urbi UObject C++ middleware, to manage hardware drivers and/or possibly remote software components, and urbiscript, a domain specific programming language to orchestrate them. Reactivity is a key feature of Urbi SDK, embodied in events in urbiscript. This paper presents the support for events in urbiscript.
[ { "version": "v1", "created": "Wed, 27 Oct 2010 14:20:46 GMT" } ]
2010-10-28T00:00:00
[ [ "Baillie", "Jean-Christophe", "" ], [ "Demaille", "Akim", "" ], [ "Hocquet", "Quentin", "" ], [ "Nottale", "Matthieu", "" ] ]
new_dataset
0.999798
1004.2652
Laszlo Kish
Laszlo B. Kish, Sunil Khatri, Ferdinand Peper
Instantaneous noise-based logic
Accepted for publication in Fluctuation and Noise Letters (December 2010 issue)
Fluctuation and Noise Letters 9 (2010) pp. 323-330
10.1142/S0219477510000253
null
cs.OH physics.data-an
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show two universal, Boolean, deterministic logic schemes based on binary noise timefunctions that can be realized without time-averaging units. The first scheme is based on a new bipolar random telegraph wave scheme and the second one makes use of the recent noise-based logic which is conjectured to be the brain's method of logic operations [Physics Letters A 373 (2009) 2338-2342]. Error propagation and error removal issues are also addressed.
[ { "version": "v1", "created": "Tue, 13 Apr 2010 20:30:52 GMT" }, { "version": "v2", "created": "Mon, 21 Jun 2010 01:22:10 GMT" } ]
2010-10-27T00:00:00
[ [ "Kish", "Laszlo B.", "" ], [ "Khatri", "Sunil", "" ], [ "Peper", "Ferdinand", "" ] ]
new_dataset
0.999282
1009.5759
Arseny Shur
Arseny M. Shur
On ternary square-free circular words
11 pages, 1 figure, 1 table. Presented at NORCOM'2010, submitted to EJC
Electronic Journal of Combinatorics 2010 Vol. 17(1) #R140
null
null
cs.FL cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the $K_{3{,}3}$ graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length $l$ and allows one to list all lengths $l$ for which such a circular word is unique up to isomorphism.
[ { "version": "v1", "created": "Wed, 29 Sep 2010 03:18:26 GMT" } ]
2010-10-26T00:00:00
[ [ "Shur", "Arseny M.", "" ] ]
new_dataset
0.999816
1010.5036
Mueen Uddin
Mueen Uddin, Azizah Abdul Rahman
Dynamic Multi Layer Signature based Intrusion Detection system Using Mobile Agents
13 pages, IJNSA Journal Accepted Paper
International Journal of Network Security & Its Applications (IJNSA), Vol.2, No.4, October 2010
null
null
cs.CR
http://creativecommons.org/licenses/by/3.0/
Intrusion detection systems have become a key component in ensuring the safety of systems and networks. As networks grow in size and speed continues to increase, it is crucial that efficient scalable techniques should be developed for IDS systems. Signature based detection is the most extensively used threat detection technique for Intrusion Detection Systems (IDS). One of the foremost challenges for signaturebased IDS systems is how to keep up with large volume of incoming traffic when each packet needs to be compared with every signature in the database. When an IDS cannot keep up with the traffic flood, all it can do is to drop packets, therefore, may miss potential attacks. This paper proposes a new model called Dynamic Multi-Layer Signature based IDS using Mobile Agents, which can detect imminent threats with very high success rate by dynamically and automatically creating and using small and efficient multiple databases, and at the same time, provide mechanism to update these small signature databases at regular intervals using Mobile Agents
[ { "version": "v1", "created": "Mon, 25 Oct 2010 04:11:13 GMT" } ]
2010-10-26T00:00:00
[ [ "Uddin", "Mueen", "" ], [ "Rahman", "Azizah Abdul", "" ] ]
new_dataset
0.974376
1010.5128
Ahmed Ayadi
Ahmed Ayadi and Patrick Maill\'e and David Ros
TCP over low-power and lossy networks: tuning the segment size to minimize energy consumption
TELECOM Bretagne Research Report
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Low-power and Lossy Networks (LLNs), like wireless networks based upon the IEEE 802.15.4 standard, have strong energy constraints, and are moreover subject to frequent transmission errors, not only due to congestion but also to collisions and to radio channel conditions. This paper introduces an analytical model to compute the total energy consumption in an LLN due to the TCP protocol. The model allows us to highlight some tradeoffs as regards the choice of the TCP maximum segment size, of the Forward Error Correction (FEC) redundancy ratio, and of the number of link-layer retransmissions, in order to minimize the total energy consumption.
[ { "version": "v1", "created": "Mon, 25 Oct 2010 13:52:40 GMT" } ]
2010-10-26T00:00:00
[ [ "Ayadi", "Ahmed", "" ], [ "Maillé", "Patrick", "" ], [ "Ros", "David", "" ] ]
new_dataset
0.999325
1010.4385
Christian Blum
Hugo Hern\'andez and Tobias Baumgartner and Maria J. Blesa and Christian Blum and Alexander Kr\"oller and Sandor P. Fekete
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib
Accepted for the proceedings of MSN 2010 (The 6th International Conference on Mobile Ad-hoc and Sensor Networks)
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this work we present a protocol for self-synchronized duty-cycling in wireless sensor networks with energy harvesting capabilities. The protocol is implemented in Wiselib, a library of generic algorithms for sensor networks. Simulations are conducted with the sensor network simulator Shawn. They are based on the specifications of real hardware known as iSense sensor nodes. The experimental results show that the proposed mechanism is able to adapt to changing energy availabilities. Moreover, it is shown that the system is very robust against packet loss.
[ { "version": "v1", "created": "Thu, 21 Oct 2010 07:54:11 GMT" } ]
2010-10-22T00:00:00
[ [ "Hernández", "Hugo", "" ], [ "Baumgartner", "Tobias", "" ], [ "Blesa", "Maria J.", "" ], [ "Blum", "Christian", "" ], [ "Kröller", "Alexander", "" ], [ "Fekete", "Sandor P.", "" ] ]
new_dataset
0.985586
1006.3301
Han-Shin Jo
Han-Shin Jo, Cheol Mun, and Jong-Gwan Yook
Codebook-Based SDMA for Coexistence with Fixed Wireless Service
The paper has been withdrawn by the author due to some error in main analysis
null
null
null
cs.IT cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A portion of frequency band for International Mobile Telecommunications (IMT)-Advanced is currently allocated to Fixed Wireless Service (FWS) such as Fixed Service (FS), Fixed Satellite Service (FSS), or Fixed Wireless Access (FWA), which requires frequency sharing between both the systems. SDMA, due to its high throughput nature, is candidate for IMT-Advanced. This paper proposes a systematic design of a precoder codebook for SDMA sharing spectrum with existing FWS. Based on an estimated direction angle of a victim FWS system, an interfering transmitter adaptively constructs a codebook forming a transmit null in the direction angle while satisfying orthogonal beamforming constraint. We derive not only asymptotic throughput scaling laws, but also an upperbound on throughput loss to analyze performance loss of the proposed SDMA relative to the popular SDMA called per-user unitary rate control (PU2RC). Furthermore, we develop a method of evaluating protection distance in order to analyze the spectrum sharing performance of the proposed approach. The simulation results of protection distance confirm that the proposed SDMA efficiently shares spectrum with FWS systems by reducing protection distance to more than 66%. Although our proposed SDMA always has lower throughput compared to PU2RC in non-coexistence scenario, it offers an intriguing opportunity to reuse spectrum already allocated to FWS.
[ { "version": "v1", "created": "Wed, 16 Jun 2010 19:36:28 GMT" }, { "version": "v2", "created": "Wed, 20 Oct 2010 15:18:42 GMT" } ]
2010-10-21T00:00:00
[ [ "Jo", "Han-Shin", "" ], [ "Mun", "Cheol", "" ], [ "Yook", "Jong-Gwan", "" ] ]
new_dataset
0.999503
1010.2450
Joseph O'Rourke
Joseph O'Rourke
Flat Zipper-Unfolding Pairs for Platonic Solids
15 pages, 14 figures, 8 references. v2: Added one new figure. v3: Replaced Fig. 13 to remove a duplicate unfolding, reducing from 21 to 20 the distinct unfoldings. v4: Replaced Fig. 13 again, 18 distinct unfoldings
null
null
null
cs.CG cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show that four of the five Platonic solids' surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can "zipper-refold" to a flat doubly covered parallelogram, forming a rather compact representation of the surface. Thus these regular polyhedra have particular flat "zipper pairs." No such zipper pair exists for a dodecahedron, whose Hamiltonian unfoldings are "zip-rigid." This report is primarily an inventory of the possibilities, and raises more questions than it answers.
[ { "version": "v1", "created": "Tue, 12 Oct 2010 17:24:52 GMT" }, { "version": "v2", "created": "Wed, 13 Oct 2010 12:19:02 GMT" }, { "version": "v3", "created": "Sat, 16 Oct 2010 22:11:40 GMT" }, { "version": "v4", "created": "Wed, 20 Oct 2010 01:14:01 GMT" } ]
2010-10-21T00:00:00
[ [ "O'Rourke", "Joseph", "" ] ]
new_dataset
0.997404
1010.3601
Gianluigi Liva
Gianluigi Liva, Enrico Paolini, Marco Chiani
High-Throughput Random Access via Codes on Graphs
Presented at the Future Network and MobileSummit 2010 Conference, Florence (Italy), June 2010
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions and on interference cancellation to increase the normalized throughput of a classic slotted ALOHA access scheme. CRDSA allows achieving a larger throughput than slotted ALOHA, at the price of an increased average transmitted power. A way to trade-off the increment of the average transmitted power and the improvement of the throughput is presented in this paper. Specifically, it is proposed to divide each MAC burst in k sub-bursts, and to encode them via a (n,k) erasure correcting code. The n encoded sub-bursts are transmitted over the MAC channel, according to specific time/frequency-hopping patterns. Whenever n-e>=k sub-bursts (of the same burst) are received without collisions, erasure decoding allows recovering the remaining e sub-bursts (which were lost due to collisions). An interference cancellation process can then take place, removing in e slots the interference caused by the e recovered sub-bursts, possibly allowing the correct decoding of sub-bursts related to other bursts. The process is thus iterated as for the CRDSA case.
[ { "version": "v1", "created": "Mon, 18 Oct 2010 14:03:33 GMT" }, { "version": "v2", "created": "Tue, 19 Oct 2010 07:14:11 GMT" } ]
2010-10-20T00:00:00
[ [ "Liva", "Gianluigi", "" ], [ "Paolini", "Enrico", "" ], [ "Chiani", "Marco", "" ] ]
new_dataset
0.953188
1010.3163
Danilo Gligoroski
Danilo Gligoroski and Svein Johan Knapskog and Smile Markovski and Rune Steinsmo {\O}deg{\aa}rd and Rune Erlend Jensen and Ludovic Perret and Jean-Charles Faug\`ere
The Digital Signature Scheme MQQ-SIG
null
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG - a new public key digital signature scheme. The complete scientific publication covering the design rationale and the security analysis will be given in a separate publication. MQQ-SIG consists of $n - \frac{n}{4}$ quadratic polynomials with $n$ Boolean variables where n=160, 196, 224 or 256.
[ { "version": "v1", "created": "Fri, 15 Oct 2010 13:40:27 GMT" } ]
2010-10-18T00:00:00
[ [ "Gligoroski", "Danilo", "" ], [ "Knapskog", "Svein Johan", "" ], [ "Markovski", "Smile", "" ], [ "Ødegård", "Rune Steinsmo", "" ], [ "Jensen", "Rune Erlend", "" ], [ "Perret", "Ludovic", "" ], [ "Faugère", "Jean-Charles", "" ] ]
new_dataset
0.99775
1010.3177
Xin Rong
Xin Rong
Introduction to the iDian
4 pages
null
null
null
cs.AI
http://creativecommons.org/licenses/by-nc-sa/3.0/
The iDian (previously named as the Operation Agent System) is a framework designed to enable computer users to operate software in natural language. Distinct from current speech-recognition systems, our solution supports format-free combinations of orders, and is open to both developers and customers. We used a multi-layer structure to build the entire framework, approached rule-based natural language processing, and implemented demos narrowing down to Windows, text-editing and a few other applications. This essay will firstly give an overview of the entire system, and then scrutinize the functions and structure of the system, and finally discuss the prospective de-velopment, esp. on-line interaction functions.
[ { "version": "v1", "created": "Fri, 15 Oct 2010 14:18:25 GMT" } ]
2010-10-18T00:00:00
[ [ "Rong", "Xin", "" ] ]
new_dataset
0.988097
1006.0289
Carlos Lorenzetti
Carlos M. Lorenzetti and Roc\'io L. Cecchini and Ana G. Maguitman and Andr\'as A. Bencz\'ur
M\'{e}todos para la Selecci\'{o}n y el Ajuste de Caracter\'{i}sticas en el Problema de la Detecci\'{o}n de Spam
5 pages, 1 figure, Workshop de Investigadores en Ciencias de la Computaci\'{o}n, WICC 2010, pp 48-52
Workshop de Investigadores en Ciencias de la Computacion, WICC 2010, El Calafate, Santa Cruz, Argentina
null
null
cs.IR cs.AI
http://creativecommons.org/licenses/by-nc-sa/3.0/
The email is used daily by millions of people to communicate around the globe and it is a mission-critical application for many businesses. Over the last decade, unsolicited bulk email has become a major problem for email users. An overwhelming amount of spam is flowing into users' mailboxes daily. In 2004, an estimated 62% of all email was attributed to spam. Spam is not only frustrating for most email users, it strains the IT infrastructure of organizations and costs businesses billions of dollars in lost productivity. In recent years, spam has evolved from an annoyance into a serious security threat, and is now a prime medium for phishing of sensitive information, as well the spread of malicious software. This work presents a first approach to attack the spam problem. We propose an algorithm that will improve a classifier's results by adjusting its training set data. It improves the document's vocabulary representation by detecting good topic descriptors and discriminators.
[ { "version": "v1", "created": "Wed, 2 Jun 2010 03:48:49 GMT" }, { "version": "v2", "created": "Thu, 14 Oct 2010 15:43:13 GMT" } ]
2010-10-15T00:00:00
[ [ "Lorenzetti", "Carlos M.", "" ], [ "Cecchini", "Rocío L.", "" ], [ "Maguitman", "Ana G.", "" ], [ "Benczúr", "András A.", "" ] ]
new_dataset
0.978194
1010.1938
Sugata Sanyal
Sugata Sanyal, Ajit Shelat, Amit Gupta
New Frontiers of Network Security: The Threat Within
4 Pages, Invited Paper in VCON'10: 2nd Vaagdevi International Conference on Information Technology for Real World Problems Vaagdevi College of Engineering, Warangal, Andhra Pradesh, India, December 9-11, 2010
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Nearly 70% of information security threats originate from inside an organization. Opportunities for insider threats have been increasing at an alarming rate with the latest trends of mobility (portable devices like Laptop, smart phones etc.), ubiquitous connectivity (wireless or through 3G connectivity) and this trend increases as more and more web-based applications are made available over the Internet. Insider threats are generally caused by current or ex-employees, contractors or partners, who have authorized access to the organization's network and servers. Theft of confidential information is often for either material gain or for willful damage. Easy availability of hacking tools on the Internet, USB devices and wireless connectivity provide for easy break-ins. The net result is losses worth millions of dollars in terms of IP theft, leakage of customer / individual information, etc. This paper presents an understanding of Insider threats, attackers and their motives and suggests mitigation techniques at the organization level
[ { "version": "v1", "created": "Sun, 10 Oct 2010 16:51:22 GMT" }, { "version": "v2", "created": "Wed, 13 Oct 2010 10:47:58 GMT" } ]
2010-10-14T00:00:00
[ [ "Sanyal", "Sugata", "" ], [ "Shelat", "Ajit", "" ], [ "Gupta", "Amit", "" ] ]
new_dataset
0.957334
1010.2551
Salim El Rouayheb
Salim El Rouayheb and Kannan Ramchandran
Fractional Repetition Codes for Repair in Distributed Storage Systems
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce a new class of exact Minimum-Bandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process that can tolerate multiple node failures. These codes consist of the concatenation of two components: an outer MDS code followed by an inner repetition code. We refer to the inner code as a Fractional Repetition code since it consists of splitting the data of each node into several packets and storing multiple replicas of each on different nodes in the system. Our model for repair is table-based, and thus, differs from the random access model adopted in the literature. We present constructions of Fractional Repetition codes based on regular graphs and Steiner systems for a large set of system parameters. The resulting codes are guaranteed to achieve the storage capacity for random access repair. The considered model motivates a new definition of capacity for distributed storage systems, that we call Fractional Repetition capacity. We provide upper bounds on this capacity while a precise expression remains an open problem.
[ { "version": "v1", "created": "Wed, 13 Oct 2010 00:27:06 GMT" } ]
2010-10-14T00:00:00
[ [ "Rouayheb", "Salim El", "" ], [ "Ramchandran", "Kannan", "" ] ]
new_dataset
0.996717
1010.2621
Ana Charpentier
Ana Charpentier, Caroline Fontaine, Teddy Furon, Ingemar Cox
An Asymmetric Fingerprinting Scheme based on Tardos Codes
6 pages, 2 figures
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Tardos codes are currently the state-of-the-art in the design of practical collusion-resistant fingerprinting codes. Tardos codes rely on a secret vector drawn from a publicly known probability distribution in order to generate each Buyer's fingerprint. For security purposes, this secret vector must not be revealed to the Buyers. To prevent an untrustworthy Provider forging a copy of a Work with an innocent Buyer's fingerprint, previous asymmetric fingerprinting algorithms enforce the idea of the Buyers generating their own fingerprint. Applying this concept to Tardos codes is challenging since the fingerprint must be based on this vector secret. This paper provides the first solution for an asymmetric fingerprinting protocol dedicated to Tardos codes. The motivations come from a new attack, in which an untrustworthy Provider by modifying his secret vector frames an innocent Buyer.
[ { "version": "v1", "created": "Wed, 13 Oct 2010 10:22:30 GMT" } ]
2010-10-14T00:00:00
[ [ "Charpentier", "Ana", "" ], [ "Fontaine", "Caroline", "" ], [ "Furon", "Teddy", "" ], [ "Cox", "Ingemar", "" ] ]
new_dataset
0.998228
1010.2667
Dongning Guo
Dongning Guo and Lei Zhang
Virtual Full-Duplex Wireless Communication via Rapid On-Off-Division Duplex
8 pages; Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, 2010
null
null
null
cs.IT cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces a novel paradigm for design- ing the physical and medium access control (MAC) layers of mobile ad hoc or peer-to-peer networks formed by half-duplex radios. A node equipped with such a radio cannot simultaneously transmit and receive useful signals at the same frequency. Unlike in conventional designs, where a node's transmission frames are scheduled away from its reception, each node transmits its signal through a randomly generated on-off duplex mask (or signature) over every frame interval, and receive a signal through each of its own off-slots. This is called rapid on-off- division duplex (RODD). Over the period of a single frame, every node can transmit a message to some or all of its peers, and may simultaneously receive a message from each peer. Thus RODD achieves virtual full-duplex communication using half-duplex radios and can simplify the design of higher layers of a network protocol stack significantly. The throughput of RODD is evaluated under some general settings, which is significantly larger than that of ALOHA. RODD is especially efficient in case the dominant traffic is simultaneous broadcast from nodes to their one-hop peers, such as in spontaneous wireless social networks, emergency situations or on battlefield. Important design issues of peer discovery, distribution of on-off signatures, synchronization and error-control coding are also addressed.
[ { "version": "v1", "created": "Wed, 13 Oct 2010 14:18:52 GMT" } ]
2010-10-14T00:00:00
[ [ "Guo", "Dongning", "" ], [ "Zhang", "Lei", "" ] ]
new_dataset
0.999756
1010.2436
Chih-Chun Wang
Chih-Chun Wang
Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version)
29 pages, 10 figures. This manuscript was submitted to IEEE Trans IT in May 2010
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. The capacity region of the 1-to-K PEC with COF was previously known only for the case K=2. Such a setting directly models network coded packet transmission in the downlink direction with integrated feedback mechanisms (such as Automatic Repeat reQuest (ARQ)). The main results of this paper are: (i) The capacity region for general 1-to-3 broadcast PECs, and (ii) The capacity region for two types of 1-to-$K$ broadcast PECs: the symmetric PECs, and the spatially independent PECs with one-sided fairness constraints. This paper also develops (iii) A pair of outer and inner bounds of the capacity region for arbitrary 1-to-K broadcast PECs, which can be easily evaluated by any linear programming solver. The proposed inner bound is proven by a new class of intersession network coding schemes, termed the packet evolution schemes, which is based on the concept of code alignment in GF(q) that is in parallel with the interference alignment techniques for the Euclidean space. Extensive numerical experiments show that the outer and inner bounds meet for almost all broadcast PECs encountered in practical scenarios and thus effectively bracket the capacity of general 1-to-K broadcast PECs with COF.
[ { "version": "v1", "created": "Tue, 12 Oct 2010 16:38:55 GMT" } ]
2010-10-13T00:00:00
[ [ "Wang", "Chih-Chun", "" ] ]
new_dataset
0.996994
1010.2447
Seetharam Narasimhan
Tatini Mal-Sarkar and Swarup Bhunia
Collaborative Trust: A Novel Paradigm of Trusted Mobile Computing
3 pages, internal technical report
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With increasing complexity of modern-day mobile devices, security of these devices in presence of myriad attacks by an intelligent adversary is becoming a major issue. The vast majority of cell phones still remain unsecured from many existing and emerging security threats. To address the security threats in mobile devices we are exploring a technology, which we refer as "Collaborative Trust". It is a technology that uses a system of devices cooperating with each other (working in a fixed or ad-hoc network) to achieve the individual security of each device. The idea is that each device is insecure by itself, since in many cases it is incapable of checking its safety by itself (e.g. when it is compromised it may lose its ability to monitor its own trustworthiness), but together, they can ensure each other's security in a collaborative manner.
[ { "version": "v1", "created": "Tue, 12 Oct 2010 17:17:06 GMT" } ]
2010-10-13T00:00:00
[ [ "Mal-Sarkar", "Tatini", "" ], [ "Bhunia", "Swarup", "" ] ]
new_dataset
0.967077
1010.1911
Iryna Andriyanova
Iryna Andriyanova and Jean-Pierre Tillich
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
submitted to IEEE Trans. on Communications
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The asymptotic analysis of the ensemble shows that its iterative threshold is situated close to the Shannon limit. In addition to the linear minimum distance property, it has a simple structure and enjoys a low decoding complexity and a fast convergence.
[ { "version": "v1", "created": "Sun, 10 Oct 2010 11:35:45 GMT" } ]
2010-10-12T00:00:00
[ [ "Andriyanova", "Iryna", "" ], [ "Tillich", "Jean-Pierre", "" ] ]
new_dataset
0.990804
1010.1948
Mihai Patrascu
Timothy M. Chan and Mihai Patrascu
Transdichotomous Results in Computational Geometry, II: Offline Search
Journal version of the paper "Voronoi Diagrams in n 2^O(sqrt{lglg n}) Time" from STOC 2007
null
null
null
cs.DS cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm for offline point location, a two-dimensional analog of sorting where one needs to order points with respect to segments. This result implies, for example, that the convex hull of n points in three dimensions can be constructed in (randomized) time n 2^O(sqrt{lglg n}). Similar bounds hold for numerous other geometric problems, such as planar Voronoi diagrams, planar off-line nearest neighbor search, line segment intersection, and triangulation of non-simple polygons. In FOCS'06, we developed a data structure for online point location, which implied a bound of O(n lg n/lglg n) for three-dimensional convex hulls and the other problems. Our current bounds are dramatically better, and a convincing improvement over the classic O(nlg n) algorithms. As in the field of integer sorting, the main challenge is to find ways to manipulate information, while avoiding the online problem (in that case, predecessor search).
[ { "version": "v1", "created": "Sun, 10 Oct 2010 18:24:29 GMT" } ]
2010-10-12T00:00:00
[ [ "Chan", "Timothy M.", "" ], [ "Patrascu", "Mihai", "" ] ]
new_dataset
0.981825
1010.1955
Matthew Macauley
Matthew Macauley, Henning S. Mortveit
Coxeter Groups and Asynchronous Cellular Automata
10 pages, 4 figures
ACRI 2010, LNCS 6350, pp. 409-418, 2010
null
null
cs.DM math.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic results in the latter domain may lead to insight about the dynamics in the former, and vice-versa. In this article, we highlight some central themes and common structures, and discuss novel approaches to some open and open-ended problems. We introduce the state automaton of an ACA, and show how the root automaton of a Coxeter group is essentially part of the state automaton of a related ACA.
[ { "version": "v1", "created": "Sun, 10 Oct 2010 18:54:37 GMT" } ]
2010-10-12T00:00:00
[ [ "Macauley", "Matthew", "" ], [ "Mortveit", "Henning S.", "" ] ]
new_dataset
0.990363
1007.3609
Christian Wulff-Nilsen
Christian Wulff-Nilsen
Min st-Cut of a Planar Graph in O(n loglog n) Time
Added mainly details and corrections to the r-division section
null
null
null
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Given a planar undirected n-vertex graph G with non-negative edge weights, we show how to compute, for given vertices s and t in G, a min st-cut in G in O(n loglog n) time and O(n) space. The previous best time bound was O(n log n).
[ { "version": "v1", "created": "Wed, 21 Jul 2010 10:39:53 GMT" }, { "version": "v2", "created": "Thu, 7 Oct 2010 00:51:46 GMT" } ]
2010-10-08T00:00:00
[ [ "Wulff-Nilsen", "Christian", "" ] ]
new_dataset
0.978324
1008.3171
Tsz-Wo Sze
Tsz-Wo Sze
The Two Quadrillionth Bit of Pi is 0! Distributed Computation of Pi with Apache Hadoop
9 pages, 2 figures, 3 tables
null
null
null
cs.DC math.NT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a new record on computing specific bits of Pi, the mathematical constant, and discuss performing such computations on Apache Hadoop clusters. The specific bits represented in hexadecimal are 0E6C1294 AED40403 F56D2D76 4026265B CA98511D 0FCFFAA1 0F4D28B1 BB5392B8. These 256 bits end at the 2,000,000,000,000,252nd bit position, which doubles the position and quadruples the precision of the previous known record. The position of the first bit is 1,999,999,999,999,997 and the value of the two quadrillionth bit is 0. The computation is carried out by a MapReduce program called DistBbp. To effectively utilize available cluster resources without monopolizing the whole cluster, we develop an elastic computation framework that automatically schedules computation slices, each a DistBbp job, as either map-side or reduce-side computation based on changing cluster load condition. We have calculated Pi at varying bit positions and precisions, and one of the largest computations took 23 days of wall clock time and 503 years of CPU time on a 1000-node cluster.
[ { "version": "v1", "created": "Wed, 18 Aug 2010 20:17:09 GMT" }, { "version": "v2", "created": "Thu, 7 Oct 2010 03:30:14 GMT" } ]
2010-10-08T00:00:00
[ [ "Sze", "Tsz-Wo", "" ] ]
new_dataset
0.998439
1010.1438
Walid Saad
Walid Saad and Zhu Han and Are Hj{\o}rungnes and Dusit Niyato and Ekram Hossain
Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks
accepted and to appear in IEEE Journal on Selected Areas in Communications (JSAC), Special issue on Vehicular Communications and Networks
IEEE Journal on Selected Areas in Communications (JSAC), 2010
null
null
cs.IT cs.GT cs.SY math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work focused on non-cooperative techniques for V2R communications between vehicles and roadside units (RSUs), this paper investigates novel cooperative strategies among the RSUs in a vehicular network. We propose a scheme whereby, through cooperation, the RSUs in a vehicular network can coordinate the classes of data being transmitted through V2R communications links to the vehicles. This scheme improves the diversity of the information circulating in the network while exploiting the underlying content-sharing vehicle-to-vehicle communication network. We model the problem as a coalition formation game with transferable utility and we propose an algorithm for forming coalitions among the RSUs. For coalition formation, each RSU can take an individual decision to join or leave a coalition, depending on its utility which accounts for the generated revenues and the costs for coalition coordination. We show that the RSUs can self-organize into a Nash-stable partition and adapt this partition to environmental changes. Simulation results show that, depending on different scenarios, coalition formation presents a performance improvement, in terms of the average payoff per RSU, ranging between 20.5% and 33.2%, relative to the non-cooperative case.
[ { "version": "v1", "created": "Thu, 7 Oct 2010 14:18:26 GMT" } ]
2010-10-08T00:00:00
[ [ "Saad", "Walid", "" ], [ "Han", "Zhu", "" ], [ "Hjørungnes", "Are", "" ], [ "Niyato", "Dusit", "" ], [ "Hossain", "Ekram", "" ] ]
new_dataset
0.998266
cs/0702059
Michael Baer
Michael B. Baer
Redundancy-Related Bounds on Generalized Huffman Codes
15 pages, 4 figures, incorporates and extends arXiv:cs/0605099 and arXiv:0809.1264v1
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum average redundancy coding - Huffman coding - these are in terms of a form of entropy and/or the probability of an input symbol, often the most probable one. The bounds here, some of which are tight, improve on known bounds of the form L in [H,H+1), where H is some form of entropy in bits (or, in the case of redundancy objectives, 0) and L is the length objective, also in bits. The objectives explored here include exponential-average length, maximum pointwise redundancy, and exponential-average pointwise redundancy (also called dth exponential redundancy). The first of these relates to various problems involving queueing, uncertainty, and lossless communications; the second relates to problems involving Shannon coding and universal modeling. For these two objectives we also explore the related problem of the necessary and sufficient conditions for the shortest codeword of a code being a specific length.
[ { "version": "v1", "created": "Sat, 10 Feb 2007 03:31:42 GMT" }, { "version": "v2", "created": "Fri, 6 Mar 2009 07:21:52 GMT" }, { "version": "v3", "created": "Thu, 7 Oct 2010 05:45:10 GMT" } ]
2010-10-08T00:00:00
[ [ "Baer", "Michael B.", "" ] ]
new_dataset
0.997243
0905.4923
James Currie
James D. Currie
Lexicographically least words in the orbit closure of the Rudin-Shapiro word
9 pages
null
null
null
cs.FL math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We give an effective characterization of the lexicographically least word in the orbit closure of the Rudin-Shapiro word w having a specified prefix. In particular, the lexicographically least word in the orbit closure of the Rudin-Shapiro word is 0w. This answers a question Allouche et al.
[ { "version": "v1", "created": "Fri, 29 May 2009 17:14:46 GMT" }, { "version": "v2", "created": "Mon, 1 Jun 2009 15:13:42 GMT" }, { "version": "v3", "created": "Mon, 4 Oct 2010 20:12:31 GMT" } ]
2010-10-06T00:00:00
[ [ "Currie", "James D.", "" ] ]
new_dataset
0.981794
1004.1814
Prabhu Manyem
Prabhu Manyem
Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version)
Manuscript withdrawn, because results are incorrect. If phi = phi_1 AND phi_2, and phi is a Horn formula, it does NOT mean that both phi_1 and phi_2 are Horn formulae. Furthermore, the cardinality constraint CANNOT be expressed as a universal Horn sentence in ESO (NOT even when the structure is ordered). Graedel's theorem is valid at a lower (machine) level, but probably NOT at a higher level
null
null
null
cs.CC cs.LO math.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show that the maximum clique problem (decision version) can be expressed in existential second order (ESO) logic, where the first order part is a Horn formula in second-order quantified predicates. Without ordering, the first order part is $\Pi_2$ Horn; if ordering is used, then it is universal Horn (in which case, the second order variables can be determined in polynomial time). UPDATE: Manuscript withdrawn, because results are incorrect. If phi = phi_1 AND phi_2, and phi is a Horn formula, it does NOT mean that both phi_1 and phi_2 are Horn formulae. Furthermore, the cardinality constraint CANNOT be expressed as a universal Horn sentence in ESO (NOT even when the structure is ordered). Graedel's theorem is valid at a lower (machine) level, but probably NOT at a higher level.
[ { "version": "v1", "created": "Sun, 11 Apr 2010 14:29:17 GMT" }, { "version": "v2", "created": "Tue, 20 Apr 2010 12:28:23 GMT" }, { "version": "v3", "created": "Fri, 23 Apr 2010 13:36:32 GMT" }, { "version": "v4", "created": "Mon, 3 May 2010 08:35:46 GMT" }, { "version": "v5", "created": "Sat, 2 Oct 2010 22:37:33 GMT" } ]
2010-10-05T00:00:00
[ [ "Manyem", "Prabhu", "" ] ]
new_dataset
0.995615
1010.0298
Sugata Sanyal
Siby Abraham, Imre Kiss, Sugata Sanyal, Mukund Sanglikar
Steepest Ascent Hill Climbing For A Mathematical Problem
8 Pages, 3 Figures, 2 Tables, International Symposium on Advanced Engineering and Applied Management 40th Anniversary in Higher Education - Informatics & Computer Science, University Politehnica, Timisoara, 4-5 November, 2010, Hunedoara, ROMANIA
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer factorization, algebraic curves, projective curves and data dependency in super computers. Importantly, it has been proved that there is no general method to find solutions of such equations. This paper is an attempt to find numerical solutions of Diophantine equations using steepest ascent version of Hill Climbing. The method, which uses tree representation to depict possible solutions of Diophantine equations, adopts a novel methodology to generate successors. The heuristic function used help to make the process of finding solution as a minimization process. The work illustrates the effectiveness of the proposed methodology using a class of Diophantine equations given by a1. x1 p1 + a2. x2 p2 + ...... + an . xn pn = N where ai and N are integers. The experimental results validate that the procedure proposed is successful in finding solutions of Diophantine Equations with sufficiently large powers and large number of variables.
[ { "version": "v1", "created": "Sat, 2 Oct 2010 07:27:43 GMT" } ]
2010-10-05T00:00:00
[ [ "Abraham", "Siby", "" ], [ "Kiss", "Imre", "" ], [ "Sanyal", "Sugata", "" ], [ "Sanglikar", "Mukund", "" ] ]
new_dataset
0.994963
1010.0376
Charles Shen
Charles Shen and Henning Schulzrinne
On TCP-based Session Initiation Protocol (SIP) Server Overload Control
IPTComm 2010
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Session Initiation Protocol (SIP) server overload management has attracted interest since SIP is being widely deployed in the Next Generation Networks (NGN) as a core signaling protocol. Yet all existing SIP overload control work is focused on SIP-over-UDP, despite the fact that TCP is increasingly seen as the more viable choice of SIP transport. This paper answers the following questions: is the existing TCP flow control capable of handling the SIP overload problem? If not, why and how can we make it work? We provide a comprehensive explanation of the default SIP-over-TCP overload behavior through server instrumentation. We also propose and implement novel but simple overload control algorithms without any kernel or protocol level modification. Experimental evaluation shows that with our mechanism the overload performance improves from its original zero throughput to nearly full capacity. Our work leads to the important general insight that the traditional notion of TCP flow control alone is incapable of managing overload for time-critical session-based applications, which would be applicable not only to SIP, but also to a wide range of other common applications such as database servers.
[ { "version": "v1", "created": "Sun, 3 Oct 2010 03:31:19 GMT" } ]
2010-10-05T00:00:00
[ [ "Shen", "Charles", "" ], [ "Schulzrinne", "Henning", "" ] ]
new_dataset
0.988155
1008.0327
Somphong Jitman
Somphong Jitman, San Ling and Patanee Udomkavanich
Skew Constacyclic Codes over Finite Chain Rings
24 Pages, Submitted to Advances in Mathematics of Communications
null
null
null
cs.IT math.IT math.RA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of $x^n-\lambda$, where $\lambda$ is a unit element, are exhibited. When $\lambda^2=1$, the generators of Euclidean and Hermitian dual codes of such codes are determined together with necessary and sufficient conditions for them to be Euclidean and Hermitian self-dual. Of more interest are codes over the ring $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$. The structure of all skew constacyclic codes is completely determined. This allows us to express generators of Euclidean and Hermitian dual codes of skew cyclic and skew negacyclic codes in terms of the generators of the original codes. An illustration of all skew cyclic codes of length~2 over $\mathbb{F}_{3}+u\mathbb{F}_{3}$ and their Euclidean and Hermitian dual codes is also provided.
[ { "version": "v1", "created": "Mon, 2 Aug 2010 15:37:02 GMT" }, { "version": "v2", "created": "Fri, 1 Oct 2010 09:34:17 GMT" } ]
2010-10-04T00:00:00
[ [ "Jitman", "Somphong", "" ], [ "Ling", "San", "" ], [ "Udomkavanich", "Patanee", "" ] ]
new_dataset
0.991661
1009.6079
Jian Wang
Jian Wang, Jianshu Chen, Jian Yuan, Ning Ge and Shuangqing Wei
A Multi-Interference-Channel Matrix Pair Beamformer for CDMA Systems
25 pages, 12 figures
null
null
null
cs.CE cs.IT math.IT
http://creativecommons.org/licenses/by-nc-sa/3.0/
Matrix pair beamformer (MPB) is a promising blind beamformer which exploits the temporal signature of the signal of interest (SOI) to acquire its spatial statistical information. It does not need any knowledge of directional information or training sequences. However, the major problem of the existing MPBs is that they have serious threshold effects and the thresholds will grow as the interference power increases or even approach infinity. In particular, this issue prevails in scenarios with structured interference, such as, periodically repeated white noise, tones, or MAIs in multipath channels. In this paper, we will first present the principles for designing the projection space of the MPB which are closely correlated with the ability of suppressing structured interference and system finite sample performance. Then a multiple-interference-channel based matrix pair beamformer (MIC-MPB) for CDMA systems is developed according to the principles. In order to adapt to dynamic channels, an adaptive algorithm for the beamformer is also proposed. Theoretical analysis and simulation results show that the proposed beamformer has a small and bounded threshold when the interference power increases. Performance comparisons of the MIC-MPB and the existing MPBs in various scenarios via a number of numerical examples are also presented.
[ { "version": "v1", "created": "Thu, 30 Sep 2010 09:23:05 GMT" }, { "version": "v2", "created": "Fri, 1 Oct 2010 08:31:47 GMT" } ]
2010-10-04T00:00:00
[ [ "Wang", "Jian", "" ], [ "Chen", "Jianshu", "" ], [ "Yuan", "Jian", "" ], [ "Ge", "Ning", "" ], [ "Wei", "Shuangqing", "" ] ]
new_dataset
0.994471
1010.0034
Victor M. Preciado
Michael M. Zavlanos, Victor M. Preciado and Ali Jadbabaie
Spectral Control of Mobile Robot Networks
http://alum.mit.edu/www/vmp
null
null
null
cs.MA cs.SY math.OC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The eigenvalue spectrum of the adjacency matrix of a network is closely related to the behavior of many dynamical processes run over the network. In the field of robotics, this spectrum has important implications in many problems that require some form of distributed coordination within a team of robots. In this paper, we propose a continuous-time control scheme that modifies the structure of a position-dependent network of mobile robots so that it achieves a desired set of adjacency eigenvalues. For this, we employ a novel abstraction of the eigenvalue spectrum by means of the adjacency matrix spectral moments. Since the eigenvalue spectrum is uniquely determined by its spectral moments, this abstraction provides a way to indirectly control the eigenvalues of the network. Our construction is based on artificial potentials that capture the distance of the network's spectral moments to their desired values. Minimization of these potentials is via a gradient descent closed-loop system that, under certain convexity assumptions, ensures convergence of the network topology to one with the desired set of moments and, therefore, eigenvalues. We illustrate our approach in nontrivial computer simulations.
[ { "version": "v1", "created": "Thu, 30 Sep 2010 23:03:07 GMT" } ]
2010-10-04T00:00:00
[ [ "Zavlanos", "Michael M.", "" ], [ "Preciado", "Victor M.", "" ], [ "Jadbabaie", "Ali", "" ] ]
new_dataset
0.951306
1010.0150
Joergen Villadsen
Andreas Schmidt Jensen
Implementing Lego Agents Using Jason
24 pages
null
null
null
cs.MA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Since many of the currently available multi-agent frameworks are generally mostly intended for research, it can be difficult to built multi-agent systems using physical robots. In this report I describe a way to combine the multi-agent framework Jason, an extended version of the agent-oriented programming language AgentSpeak, with Lego robots to address this problem. By extending parts of the Jason reasoning cycle I show how Lego robots are able to complete tasks such as following lines on a floor and communicating to be able to avoid obstacles with minimal amount of coding. The final implementation is a functional extension that is able to built multi-agent systems using Lego agents, however there are some issues that have not been addressed. If the agents are highly dependent on percepts from their sensors, they are required to move quite slowly, because there currently is a high delay in the reasoning cycle, when it is combined with a robot. Overall the system is quite robust and can be used to make simple Lego robots perform tasks of an advanced agent in a multi-agent environment.
[ { "version": "v1", "created": "Fri, 1 Oct 2010 13:03:02 GMT" } ]
2010-10-04T00:00:00
[ [ "Jensen", "Andreas Schmidt", "" ] ]
new_dataset
0.998568
1010.0189
Nam Yul Yu
Nam Yul Yu
Reed-Muller Codes for Peak Power Control in Multicarrier CDMA
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Reed-Muller codes are studied for peak power control in multicarrier code-division multiple access (MC-CDMA) communication systems. In a coded MC-CDMA system, the information data multiplexed from users is encoded by a Reed-Muller subcode and the codeword is fully-loaded to Walsh-Hadamard spreading sequences. The polynomial representation of a coded MC-CDMA signal is established for theoretical analysis of the peak-to-average power ratio (PAPR). The Reed-Muller subcodes are defined in a recursive way by the Boolean functions providing the transmitted MC-CDMA signals with the bounded PAPR as well as the error correction capability. A connection between the code rates and the maximum PAPR is theoretically investigated in the coded MC-CDMA. Simulation results present the statistical evidence that the PAPR of the coded MC-CDMA signal is not only theoretically bounded, but also statistically reduced. In particular, the coded MC-CDMA solves the major PAPR problem of uncoded MC-CDMA by dramatically reducing its PAPR for the small number of users. Finally, the theoretical and statistical studies show that the Reed-Muller subcodes are effective coding schemes for peak power control in MC-CDMA with small and moderate numbers of users, subcarriers, and spreading factors.
[ { "version": "v1", "created": "Fri, 1 Oct 2010 15:59:54 GMT" } ]
2010-10-04T00:00:00
[ [ "Yu", "Nam Yul", "" ] ]
new_dataset
0.99943
0904.2540
David Wolpert
David H. Wolpert Gregory Benford
What does Newcomb's paradox teach us?
Revised version with analysis extended and clarified; 22 pages, 1 table
null
null
null
cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In Newcomb's paradox you choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose though, an antagonist uses a prediction algorithm to deduce your choice, and fills the two boxes based on that deduction. Newcomb's paradox is that game theory's expected utility and dominance principles appear to provide conflicting recommendations for what you should choose. A recent extension of game theory provides a powerful tool for resolving paradoxes concerning human choice, which formulates such paradoxes in terms of Bayes nets. Here we apply this to ol to Newcomb's scenario. We show that the conflicting recommendations in Newcomb's scenario use different Bayes nets to relate your choice and the algorithm's prediction. These two Bayes nets are incompatible. This resolves the paradox: the reason there appears to be two conflicting recommendations is that the specification of the underlying Bayes net is open to two, conflicting interpretations. We then show that the accuracy of the prediction algorithm in Newcomb's paradox, the focus of much previous work, is irrelevant. We similarly show that the utility functions of you and the antagonist are irrelevant. We end by showing that Newcomb's paradox is time-reversal invariant; both the paradox and its resolution are unchanged if the algorithm makes its `prediction' \emph{after} you make your choice rather than before.
[ { "version": "v1", "created": "Thu, 16 Apr 2009 16:50:22 GMT" }, { "version": "v2", "created": "Fri, 26 Feb 2010 18:53:17 GMT" }, { "version": "v3", "created": "Thu, 30 Sep 2010 16:29:44 GMT" } ]
2010-10-01T00:00:00
[ [ "Benford", "David H. Wolpert Gregory", "" ] ]
new_dataset
0.974701
1004.3770
Subhash Kak
Subhash Kak
Pythagorean Triples and Cryptographic Coding
11 pages
null
null
null
cs.CR math.HO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper summarizes basic properties of PPTs and shows that each PPT belongs to one of six different classes. Mapping an ordered sequence of PPTs into a corresponding sequence of these six classes makes it possible to use them in cryptography. We pose problems whose solution would facilitate such cryptographic application.
[ { "version": "v1", "created": "Wed, 21 Apr 2010 18:47:52 GMT" }, { "version": "v2", "created": "Thu, 30 Sep 2010 19:17:48 GMT" } ]
2010-10-01T00:00:00
[ [ "Kak", "Subhash", "" ] ]
new_dataset
0.964122
0902.2853
Laurent Poinsot
Laurent Poinsot (LIPN), G\'erard Duchamp (LIPN)
A formal calculus on the Riordan near algebra
29 p
Advances and Applications in Discrete Mathematics 6, 1 (2010) 11-44
null
null
cs.SC math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Riordan group is the semi-direct product of a multiplicative group of invertible series and a group, under substitution, of non units. The Riordan near algebra, as introduced in this paper, is the Cartesian product of the algebra of formal power series and its principal ideal of non units, equipped with a product that extends the multiplication of the Riordan group. The later is naturally embedded as a subgroup of units into the former. In this paper, we prove the existence of a formal calculus on the Riordan algebra. This formal calculus plays a role similar to those of holomorphic calculi in the Banach or Fr\'echet algebras setting, but without the constraint of a radius of convergence. Using this calculus, we define \emph{en passant} a notion of generalized powers in the Riordan group.
[ { "version": "v1", "created": "Tue, 17 Feb 2009 08:13:27 GMT" }, { "version": "v2", "created": "Thu, 5 Mar 2009 11:10:13 GMT" }, { "version": "v3", "created": "Sun, 28 Feb 2010 20:01:23 GMT" }, { "version": "v4", "created": "Thu, 4 Mar 2010 07:28:28 GMT" } ]
2010-09-30T00:00:00
[ [ "Poinsot", "Laurent", "", "LIPN" ], [ "Duchamp", "Gérard", "", "LIPN" ] ]
new_dataset
0.996368
1002.2166
Laurent Poinsot
Laurent Poinsot (LIPN), G\'erard Duchamp (LIPN), Christophe Tollu (LIPN)
Partial monoids: associativity and confluence
null
Journal of Pure and Applied Mathematics 3, 2 (2010) 265-285
null
null
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by a string rewriting system on $P^*$ that consists in evaluating the concatenation of two letters as a product in $P$, when it is defined, and a letter $1_P$ as the empty word $\epsilon$. In this paper we study the profound relations between confluence for such a system and associativity of the multiplication. Moreover we develop a reduction strategy to ensure confluence and which allows us to define a multiplication on normal forms associative up to a given congruence of $P^*$. Finally we show that this operation is associative if, and only if, the rewriting system under consideration is confluent.
[ { "version": "v1", "created": "Wed, 10 Feb 2010 18:30:38 GMT" } ]
2010-09-30T00:00:00
[ [ "Poinsot", "Laurent", "", "LIPN" ], [ "Duchamp", "Gérard", "", "LIPN" ], [ "Tollu", "Christophe", "", "LIPN" ] ]
new_dataset
0.97258
1009.5863
Johannes Fischer
J\'er\'emy Barbay and Johannes Fischer
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
13 pages, 1 figure
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a previous block. They were used to encode ordinal trees and to index integer arrays in order to support range minimum queries on them. We describe how they yield many other convenient results in a variety of areas, from data structures to algorithms: some compressed succinct indices for range minimum queries; a new adaptive sorting algorithm; and a compressed succinct data structure for permutations supporting direct and indirect application in time all the shortest as the permutation is compressible.
[ { "version": "v1", "created": "Wed, 29 Sep 2010 12:28:52 GMT" } ]
2010-09-30T00:00:00
[ [ "Barbay", "Jérémy", "" ], [ "Fischer", "Johannes", "" ] ]
new_dataset
0.997619
1009.5398
Ali Reza Manashty
Ali Reza Manashty, Amir Rajabzadeh and Zahra Forootan Jahromi
A Scenario-Based Mobile Application for Robot-Assisted Smart Digital Homes
8 pages, 8 figures, IEEE Publication format, Keywords- smart homes; mobile applications; remote home controls; automated digital homes; robot assisted at home; general packet radio service (GPRS); short message system (SMS); robot assisted at home; scenario based smart home
International Journal of Computer Science and Information Security (IJCSIS), Vol. 8, No. 5, August 2010, ISSN 1947-5500, Pages 89-96
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Smart homes are becoming more popular, as every day a new home appliance can be digitally controlled. Smart Digital Homes are using a server to make interaction with all the possible devices in one place, on a computer or webpage. In this paper we designed and implemented a mobile application using Windows Mobile platform that can connect to the controlling server of a Smart Home and grants the access to the Smart Home devices and robots everywhere possible. UML diagrams are presented to illustrate the application design process. Robots are also considered as devices that are able to interact to other object and devices. Scenarios are defined as a set of sequential actions to help manage different tasks all in one place. The mobile application can connect to the server using GPRS mobile internet and Short Message System (SMS). Interactive home map is also designed for easier status-checking and interacting with the devices using the mobile phones.
[ { "version": "v1", "created": "Mon, 27 Sep 2010 20:58:05 GMT" } ]
2010-09-29T00:00:00
[ [ "Manashty", "Ali Reza", "" ], [ "Rajabzadeh", "Amir", "" ], [ "Jahromi", "Zahra Forootan", "" ] ]
new_dataset
0.995855
1009.5473
Paul Merolla
Paul Merolla, Tristan Ursell, John Arthur
The thermodynamic temperature of a rhythmic spiking network
null
null
null
null
cs.NE cs.AI q-bio.NC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Artificial neural networks built from two-state neurons are powerful computational substrates, whose computational ability is well understood by analogy with statistical mechanics. In this work, we introduce similar analogies in the context of spiking neurons in a fixed time window, where excitatory and inhibitory inputs drawn from a Poisson distribution play the role of temperature. For single neurons with a "bandgap" between their inputs and the spike threshold, this temperature allows for stochastic spiking. By imposing a global inhibitory rhythm over the fixed time windows, we connect neurons into a network that exhibits synchronous, clock-like updating akin to neural networks. We implement a single-layer Boltzmann machine without learning to demonstrate our model.
[ { "version": "v1", "created": "Tue, 28 Sep 2010 07:22:08 GMT" } ]
2010-09-29T00:00:00
[ [ "Merolla", "Paul", "" ], [ "Ursell", "Tristan", "" ], [ "Arthur", "John", "" ] ]
new_dataset
0.999365
1009.3088
Byung-Gon Chun
Byung-Gon Chun, Sunghwan Ihm, Petros Maniatis, Mayur Naik
CloneCloud: Boosting Mobile Device Applications Through Cloud Clone Execution
null
null
null
null
cs.DC cs.OS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Mobile applications are becoming increasingly ubiquitous and provide ever richer functionality on mobile devices. At the same time, such devices often enjoy strong connectivity with more powerful machines ranging from laptops and desktops to commercial clouds. This paper presents the design and implementation of CloneCloud, a system that automatically transforms mobile applications to benefit from the cloud. The system is a flexible application partitioner and execution runtime that enables unmodified mobile applications running in an application-level virtual machine to seamlessly off-load part of their execution from mobile devices onto device clones operating in a computational cloud. CloneCloud uses a combination of static analysis and dynamic profiling to optimally and automatically partition an application so that it migrates, executes in the cloud, and re-integrates computation in a fine-grained manner that makes efficient use of resources. Our evaluation shows that CloneCloud can achieve up to 21.2x speedup of smartphone applications we tested and it allows different partitioning for different inputs and networks.
[ { "version": "v1", "created": "Thu, 16 Sep 2010 04:43:46 GMT" }, { "version": "v2", "created": "Sun, 26 Sep 2010 01:40:36 GMT" } ]
2010-09-28T00:00:00
[ [ "Chun", "Byung-Gon", "" ], [ "Ihm", "Sunghwan", "" ], [ "Maniatis", "Petros", "" ], [ "Naik", "Mayur", "" ] ]
new_dataset
0.991017
1009.4520
S. M. Kamruzzaman
S. M. Kamruzzaman
An Energy Efficient Multichannel MAC Protocol for Cognitive Radio Ad Hoc Networks
8 Pages, International Journal
International Journal of Communication Networks and Information Security (IJCNIS), Vol. 2, No. 2, pp. 112-119, Aug. 2010
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents a TDMA based energy efficient cognitive radio multichannel medium access control (MAC) protocol called ECR-MAC for wireless Ad Hoc Networks. ECR-MAC requires only a single half-duplex radio transceiver on each node that integrates the spectrum sensing at physical (PHY) layer and the packet scheduling at MAC layer. In addition to explicit frequency negotiation which is adopted by conventional multichannel MAC protocols, ECR-MAC introduces lightweight explicit time negotiation. This two-dimensional negotiation enables ECR-MAC to exploit the advantage of both multiple channels and TDMA, and achieve aggressive power savings by allowing nodes that are not involved in communication to go into doze mode. The IEEE 802.11 standard allows for the use of multiple channels available at the PHY layer, but its MAC protocol is designed only for a single channel. A single channel MAC protocol does not work well in a multichannel environment, because of the multichannel hidden terminal problem. The proposed energy efficient ECR-MAC protocol allows SUs to identify and use the unused frequency spectrum in a way that constrains the level of interference to the primary users (PUs). Extensive simulation results show that our proposed ECR-MAC protocol successfully exploits multiple channels and significantly improves network performance by using the licensed spectrum band opportunistically and protects QoS provisioning over cognitive radio ad hoc networks.
[ { "version": "v1", "created": "Thu, 23 Sep 2010 05:27:44 GMT" } ]
2010-09-28T00:00:00
[ [ "Kamruzzaman", "S. M.", "" ] ]
new_dataset
0.952098
1009.4521
S. M. Kamruzzaman
S. M. Kamruzzaman
CR-MAC: A multichannel MAC protocol for cognitive radio ad hoc networks
14 Pages, International Journal
International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.5, pp. 1-14, Sep. 2010
10.5121/ijcnc.2010.2501
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper proposes a cross-layer based cognitive radio multichannel medium access control (MAC) protocol with TDMA, which integrate the spectrum sensing at physical (PHY) layer and the packet scheduling at MAC layer, for the ad hoc wireless networks. The IEEE 802.11 standard allows for the use of multiple channels available at the PHY layer, but its MAC protocol is designed only for a single channel. A single channel MAC protocol does not work well in a multichannel environment, because of the multichannel hidden terminal problem. Our proposed protocol enables secondary users (SUs) to utilize multiple channels by switching channels dynamically, thus increasing network throughput. In our proposed protocol, each SU is equipped with only one spectrum agile transceiver, but solves the multichannel hidden terminal problem using temporal synchronization. The proposed cognitive radio MAC (CR-MAC) protocol allows SUs to identify and use the unused frequency spectrum in a way that constrains the level of interference to the primary users (PUs). Our scheme improves network throughput significantly, especially when the network is highly congested. The simulation results show that our proposed CR-MAC protocol successfully exploits multiple channels and significantly improves network performance by using the licensed spectrum band opportunistically and protects PUs from interference, even in hidden terminal situations.
[ { "version": "v1", "created": "Thu, 23 Sep 2010 05:38:52 GMT" } ]
2010-09-28T00:00:00
[ [ "Kamruzzaman", "S. M.", "" ] ]
new_dataset
0.999586
1009.4974
S. M. Kamruzzaman
S. M. Kamruzzaman, Firoz Ahmed Siddiqi, Md. Saiful Islam, Md. Emdadul Haque, and Mohammad Shamsul Alam
Rotation Invariant Face Detection Using Wavelet, PCA and Radial Basis Function Networks
5 Pages, International Conference
12th International Conference on Human Computer Interaction, Beijing, China, Vol. 18, Jul. 2007
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces a novel method for human face detection with its orientation by using wavelet, principle component analysis (PCA) and redial basis networks. The input image is analyzed by two-dimensional wavelet and a two-dimensional stationary wavelet. The common goals concern are the image clearance and simplification, which are parts of de-noising or compression. We applied an effective procedure to reduce the dimension of the input vectors using PCA. Radial Basis Function (RBF) neural network is then used as a function approximation network to detect where either the input image is contained a face or not and if there is a face exists then tell about its orientation. We will show how RBF can perform well then back-propagation algorithm and give some solution for better regularization of the RBF (GRNN) network. Compared with traditional RBF networks, the proposed network demonstrates better capability of approximation to underlying functions, faster learning speed, better size of network, and high robustness to outliers.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 05:46:31 GMT" } ]
2010-09-28T00:00:00
[ [ "Kamruzzaman", "S. M.", "" ], [ "Siddiqi", "Firoz Ahmed", "" ], [ "Islam", "Md. Saiful", "" ], [ "Haque", "Md. Emdadul", "" ], [ "Alam", "Mohammad Shamsul", "" ] ]
new_dataset
0.993656
1009.4977
S. M. Kamruzzaman
Md. Abul kalam Azad, Rezwana Sharmeen, and S. M. Kamruzzaman
Universal Numeric Segmented Display
6 Pages, International Conference
Proc. 7th International Conference on Computer and Information Technology (ICCIT-2004), Dhaka, Bangladesh, pp. 887-892, Dec. 2004
null
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Segmentation display plays a vital role to display numerals. But in today's world matrix display is also used in displaying numerals. Because numerals has lots of curve edges which is better supported by matrix display. But as matrix display is costly and complex to implement and also needs more memory, segment display is generally used to display numerals. But as there is yet no proposed compact display architecture to display multiple language numerals at a time, this paper proposes uniform display architecture to display multiple language digits and general mathematical expressions with higher accuracy and simplicity by using a 18-segment display, which is an improvement over the 16 segment display.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 06:17:02 GMT" } ]
2010-09-28T00:00:00
[ [ "Azad", "Md. Abul kalam", "" ], [ "Sharmeen", "Rezwana", "" ], [ "Kamruzzaman", "S. M.", "" ] ]
new_dataset
0.995908
1009.4979
S. M. Kamruzzaman
Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, and S. M. Kamruzzaman
Smart Bengali Cell Phone Keypad Layout
4 Pages, International Conference
Proc. 8th International Conference on Computer and Information Technology (ICCIT 2005), Dhaka, Bangladesh, pp. 1208-1211, Dec. 2005
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Nowadays cell phone is the most common communicating used by mass people. SMS based communication is a cheap and popular communication method. It is human tendency to have the opportunity to write SMS in their mother language. Text input in mother language is more flexible when the alphabets of that language are printed on the keypad. Bangla mobile keypad based on phonetics has been proposed earlier. But the keypad is not scientific from frequency and flexibility point of view. Since it is not a feasible solution in this paper we have proposed an efficient Bengali keypad for cell phone and other cellular device. The proposed keypad is based on the frequency of the alphabets in Bengali language and also with the view of structure of human finger movements. We took the two points in count to provide a flexible and fast cell phone keypad.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 06:27:49 GMT" } ]
2010-09-28T00:00:00
[ [ "Azad", "Md. Abul Kalam", "" ], [ "Sharmeen", "Rezwana", "" ], [ "Ahmad", "Shabbir", "" ], [ "Kamruzzaman", "S. M.", "" ] ]
new_dataset
0.999591
1009.4982
S. M. Kamruzzaman
S. M. Kamruzzaman, Md. Hijbul Alam, Abdul Kadar Muhammad Masum, and Md. Mahadi Hassan
Optimal Bangla Keyboard Layout using Data Mining Technique
9 Pages, International Conference
Proc. International Conference on Information and Communication Technology in Management (ICTM 2005), Multimedia University, Malaysia, May 2005
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents an optimal Bangla Keyboard Layout, which distributes the load equally on both hands so that maximizing the ease and minimizing the effort. Bangla alphabet has a large number of letters, for this it is difficult to type faster using Bangla keyboard. Our proposed keyboard will maximize the speed of operator as they can type with both hands parallel. Here we use the association rule of data mining to distribute the Bangla characters in the keyboard. First, we analyze the frequencies of data consisting of monograph, digraph and trigraph, which are derived from data wire-house, and then used association rule of data mining to distribute the Bangla characters in the layout. Experimental results on several data show the effectiveness of the proposed approach with better performance.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 06:55:27 GMT" } ]
2010-09-28T00:00:00
[ [ "Kamruzzaman", "S. M.", "" ], [ "Alam", "Md. Hijbul", "" ], [ "Masum", "Abdul Kadar Muhammad", "" ], [ "Hassan", "Md. Mahadi", "" ] ]
new_dataset
0.964329
1009.4992
S. M. Kamruzzaman
S. M. Anamul Haque, S. M. Kamruzzaman, and Md. Ashraful Islam
A System for Smart Home Control of Appliances based on Timer and Speech Interaction
4 Pages, International Conference
Proc. 4th International Conference on Electrical Engineering, The Institution of Engineers, Dhaka, Bangladesh pp. 128-131, Jan. 2006
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The main objective of this work is to design and construct a microcomputer based system: to control electric appliances such as light, fan, heater, washing machine, motor, TV, etc. The paper discusses two major approaches to control home appliances. The first involves controlling home appliances using timer option. The second approach is to control home appliances using voice command. Moreover, it is also possible to control appliances using Graphical User Interface. The parallel port is used to transfer data from computer to the particular device to be controlled. An interface box is designed to connect the high power loads to the parallel port. This system will play an important role for the elderly and physically disable people to control their home appliances in intuitive and flexible way. We have developed a system, which is able to control eight electric appliances properly in these three modes.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 07:45:34 GMT" } ]
2010-09-28T00:00:00
[ [ "Haque", "S. M. Anamul", "" ], [ "Kamruzzaman", "S. M.", "" ], [ "Islam", "Md. Ashraful", "" ] ]
new_dataset
0.983642
1009.5004
Henrik M\"uhe
Henrik M\"uhe, Andreas Angerer, Alwin Hoffmann, Wolfgang Reif
On reverse-engineering the KUKA Robot Language
1st International Workshop on Domain-Specific Languages and models for ROBotic systems
null
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Most commercial manufacturers of industrial robots require their robots to be programmed in a proprietary language tailored to the domain - a typical domain-specific language (DSL). However, these languages oftentimes suffer from shortcomings such as controller-specific design, limited expressiveness and a lack of extensibility. For that reason, we developed the extensible Robotics API for programming industrial robots on top of a general-purpose language. Although being a very flexible approach to programming industrial robots, a fully-fledged language can be too complex for simple tasks. Additionally, legacy support for code written in the original DSL has to be maintained. For these reasons, we present a lightweight implementation of a typical robotic DSL, the KUKA Robot Language (KRL), on top of our Robotics API. This work deals with the challenges in reverse-engineering the language and mapping its specifics to the Robotics API. We introduce two different approaches of interpreting and executing KRL programs: tree-based and bytecode-based interpretation.
[ { "version": "v1", "created": "Sat, 25 Sep 2010 11:07:12 GMT" } ]
2010-09-28T00:00:00
[ [ "Mühe", "Henrik", "" ], [ "Angerer", "Andreas", "" ], [ "Hoffmann", "Alwin", "" ], [ "Reif", "Wolfgang", "" ] ]
new_dataset
0.988963
1009.5338
Ali Reza Manashty
Somayeh Fatahi, Ali Reza Manashty and Zahra Forootan Jahromi
Vast Educational Mobile Content Broadcasting using ARMrayan Multimedia Mobile CMS
6 Pages, 3 figures, IEEE publication format, Keywords- mobile education; m-commerce; mobile CMS; multimedia cms; mobile; content broadcasting; mobile catalogue; education; J2ME
International Journal of Computer Science and Information Security (IJCSIS), Vol. 8, No. 5, August 2010, ISSN 1947-5500, Pages 101-106
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The huge information flow currently available to young generation makes it difficult for educational centers to train them as needed. Most of these information flows occur in transportation time or while on public areas. Competing with commercial information streams is far out of educational centers time and budget. For creating enough mobile applications for vast educational mobile content broadcasting that can match young spirits as well, we designed and developed the ARMrayan Multimedia Mobile CMS as the software that helps communities, educational, cultural or marketing centers in a way that ordinary operators be able to create a variety of fully functional multimedia mobile applications such as tutorials, catalogues, books, and guides in minutes without writing even a line of code. In this paper, we present the role of our developed software in our proposed vast educational content broadcasting system using kiosks and Bluetooth advertising, which will lead to a great leap in M-commerce marketing and public education solutions. Related experiences are described and diagrams are used to illustrate the solution. Upon release of the software, it achieved two titles and prizes in different festivals and various cultural and commercial centers became its customers.
[ { "version": "v1", "created": "Mon, 27 Sep 2010 17:36:02 GMT" } ]
2010-09-28T00:00:00
[ [ "Fatahi", "Somayeh", "" ], [ "Manashty", "Ali Reza", "" ], [ "Jahromi", "Zahra Forootan", "" ] ]
new_dataset
0.998489
1009.5347
Ali Reza Manashty
Ali Reza Manashty, Mohammad Reza Ahmadzadeh Raji, Zahra Forootan Jahromi and Amir Rajabzadeh
ARMrayan Multimedia Mobile CMS: a Simplified Approach towards Content-Oriented Mobile Application Designing
6 Pages, 4 figures, Keywords- Mobile CMS, MCMS, Mobile Content Builder, J2ME Application, Multimedia Mobile Application, Multimedia CMS, Multimedia Mobile CMS, Content Management System; ISSN. 2070-3724
International Conference on Wireless Communication and Mobile Computing (ICWCMC 2010), Proceedings of WASET, vol. 62, pp. 62-67, February 2010
null
null
cs.OH
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The ARMrayan Multimedia Mobile CMS (Content Management System) is the first mobile CMS that gives the opportunity to users for creating multimedia J2ME mobile applications with their desired content, design and logo; simply, without any need for writing even a line of code. The low-level programming and compatibility problems of the J2ME, along with UI designing difficulties, makes it hard for most people -even programmers- to broadcast their content to the widespread mobile phones used by nearly all people. This system provides user-friendly, PC-based tools for creating a tree index of pages and inserting multiple multimedia contents (e.g. sound, video and picture) in each page for creating a J2ME mobile application. The output is a stand-alone Java mobile application that has a user interface, shows texts and pictures and plays music and videos regardless of the type of devices used as long as the devices support the J2ME platform. Bitmap fonts have also been used thus Middle Eastern languages can be easily supported on all mobile phone devices. We omitted programming concepts for users in order to simplify multimedia content-oriented mobile application designing for use in educational, cultural or marketing centers. Ordinary operators can now create a variety of multimedia mobile applications such as tutorials, catalogues, books, and guides in minutes rather than months. Simplicity and power has been the goal of this CMS. In this paper, we present the software engineered-designed concepts of the ARMrayan MCMS along with the implementation challenges faces and solutions adapted.
[ { "version": "v1", "created": "Mon, 27 Sep 2010 18:22:50 GMT" } ]
2010-09-28T00:00:00
[ [ "Manashty", "Ali Reza", "" ], [ "Raji", "Mohammad Reza Ahmadzadeh", "" ], [ "Jahromi", "Zahra Forootan", "" ], [ "Rajabzadeh", "Amir", "" ] ]
new_dataset
0.999449
cs/0608061
Chengpu Wang
Chengpu Wang
Concurrent Processing Memory
35 pages, 16 figures
null
null
null
cs.DC cs.AR cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A theoretical memory with limited processing power and internal connectivity at each element is proposed. This memory carries out parallel processing within itself to solve generic array problems. The applicability of this in-memory finest-grain massive SIMD approach is studied in some details. For an array of N items, it reduces the total instruction cycle count of universal operations such as insertion/deletion and match finding to ~ 1, local operations such as filtering and template matching to ~ local operation size, and global operations such as sum, finding global limit and sorting to ~\sqroot{N} instruction cycles. It eliminates most streaming activities for data processing purpose on the system bus. Yet it remains general-purposed, easy to use, pin compatible with conventional memory, and practical for implementation.
[ { "version": "v1", "created": "Tue, 15 Aug 2006 01:42:49 GMT" }, { "version": "v2", "created": "Sun, 8 Apr 2007 02:21:08 GMT" }, { "version": "v3", "created": "Tue, 14 Sep 2010 21:11:55 GMT" }, { "version": "v4", "created": "Mon, 20 Sep 2010 14:16:36 GMT" }, { "version": "v5", "created": "Sat, 25 Sep 2010 02:49:23 GMT" } ]
2010-09-28T00:00:00
[ [ "Wang", "Chengpu", "" ] ]
new_dataset
0.99321
1006.3573
Mattias Andersson
Mattias Andersson, Vishwambhar Rathi, Ragnar Thobaben, Joerg Kliewer, and Mikael Skoglund
Nested Polar Codes for Wiretap and Relay Channels
3 pages, 1 figure, accepted for publication in IEEE Communications Letters
Communications Letters, IEEE , vol.14, no.8, pp.752-754, August 2010
10.1109/LCOMM.2010.08.100875
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding scheme also achieves the capacity of the physically degraded receiver-orthogonal relay channel. We show simulation results for moderate block length for the binary erasure wiretap channel, comparing polar codes and two edge type LDPC codes.
[ { "version": "v1", "created": "Thu, 17 Jun 2010 21:22:56 GMT" } ]
2010-09-27T00:00:00
[ [ "Andersson", "Mattias", "" ], [ "Rathi", "Vishwambhar", "" ], [ "Thobaben", "Ragnar", "" ], [ "Kliewer", "Joerg", "" ], [ "Skoglund", "Mikael", "" ] ]
new_dataset
0.999827
1009.4590
S. M. Kamruzzaman
Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, and S. M. Kamruzzaman
A Unique 10 Segment Display for Bengali Numerals
3 Pages, International Conference
Proc. 8th International Conference on Computer and Information Technology (ICCIT 2005), Dhaka, Bangladesh, pp. 97-99, Dec. 2005
null
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Segmented display is widely used for efficient display of alphanumeric characters. English numerals are displayed by 7 segment and 16 segment display. The segment size is uniform in this two display architecture. Display architecture using 8, 10, 11, 18 segments have been proposed for Bengali numerals 0...9 yet no display architecture is designed using segments of uniform size and uniform power consumption. In this paper we have proposed a uniform 10 segment architecture for Bengali numerals. This segment architecture uses segments of uniform size and no bent segment is used.
[ { "version": "v1", "created": "Thu, 23 Sep 2010 12:01:38 GMT" } ]
2010-09-27T00:00:00
[ [ "Azad", "Md. Abul Kalam", "" ], [ "Sharmeen", "Rezwana", "" ], [ "Ahmad", "Shabbir", "" ], [ "Kamruzzaman", "S. M.", "" ] ]
new_dataset
0.964905
1009.4773
Jerome Lacan
Huyen Chi Bui, Jerome Lacan, Marie-Laure Boucheret
NCSA: A New Protocol for Random Multiple Access Based on Physical Layer Network Coding
submitted to ICC 2011
null
null
null
cs.IT cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces a random multiple access method for satellite communications, named Network Coding-based Slotted Aloha (NCSA). The goal is to improve diversity of data bursts on a slotted-ALOHA-like channel thanks to error correcting codes and Physical-layer Network Coding (PNC). This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA) where the different replicas of this system are replaced by the different parts of a single word of an error correcting code. The performance of this scheme is first studied through a density evolution approach. Then, simulations confirm the CRDSA results by showing that, for a time frame of $400$ slots, the achievable total throughput is greater than $0.7\times C$, where $C$ is the maximal throughput achieved by a centralized scheme. This paper is a first analysis of the proposed scheme which open several perspectives. The most promising approach is to integrate collided bursts into the decoding process in order to improve the obtained performance.
[ { "version": "v1", "created": "Fri, 24 Sep 2010 06:51:41 GMT" } ]
2010-09-27T00:00:00
[ [ "Bui", "Huyen Chi", "" ], [ "Lacan", "Jerome", "" ], [ "Boucheret", "Marie-Laure", "" ] ]
new_dataset
0.998952
1009.4825
Pradeepa BK
Pradeepa BK and Joy Kuri
TCP-controlled Long File Transfer Throughput in Multirate WLANs with Nonzero Round Trip Propagation Delays
5 pages, 5 figures, 4 tables
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In a multirate WLAN with a single access point (AP) and several stations (STAs), we obtain analytical expressions for TCP-controlled long file transfer throughputs allowing nonzero propagation delays between the file server and STAs. We extend our earlier work in [3] to obtain AP and STA throughputs in a multirate WLAN, and use these in a closed BCMP queueing network model to obtain TCP throughputs. Simulation show that our approach is able to predict observed throughputs with a high degree of accuracy.
[ { "version": "v1", "created": "Fri, 24 Sep 2010 12:46:03 GMT" } ]
2010-09-27T00:00:00
[ [ "BK", "Pradeepa", "" ], [ "Kuri", "Joy", "" ] ]
new_dataset
0.97538
1009.4870
Sandor P. Fekete
Tobias Baumgartner and Sandor P. Fekete and Tom Kamphans and Alexander Kroeller and Max Pagel
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks
12 pages, 5 figures, to appear in REALWSN'10
null
null
null
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a sensor network testbed that monitors a hallway. It consists of 120 load sensors and 29 passive infrared sensors (PIRs), connected to 30 wireless sensor nodes. There are also 29 LEDs and speakers installed, operating as actuators, and enabling a direct interaction between the testbed and passers-by. Beyond that, the network is heterogeneous, consisting of three different circuit boards---each with its specific responsibility. The design of the load sensors is of extremely low cost compared to industrial solutions and easily transferred to other settings. The network is used for in-network data processing algorithms, offering possibilities to develop, for instance, distributed target-tracking algorithms. Special features of our installation are highly correlated sensor data and the availability of miscellaneous sensor types.
[ { "version": "v1", "created": "Fri, 24 Sep 2010 15:42:30 GMT" } ]
2010-09-27T00:00:00
[ [ "Baumgartner", "Tobias", "" ], [ "Fekete", "Sandor P.", "" ], [ "Kamphans", "Tom", "" ], [ "Kroeller", "Alexander", "" ], [ "Pagel", "Max", "" ] ]
new_dataset
0.993082
1004.2280
Robert Burger PhD
John Robert Burger
XOR at a Single Vertex -- Artificial Dendrites
Edited for clarity; added Kandel reference
null
null
null
cs.NE q-bio.NC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
New to neuroscience with implications for AI, the exclusive OR, or any other Boolean gate may be biologically accomplished within a single region where active dendrites merge. This is demonstrated below using dynamic circuit analysis. Medical knowledge aside, this observation points to the possibility of specially coated conductors to accomplish artificial dendrites.
[ { "version": "v1", "created": "Tue, 13 Apr 2010 22:12:22 GMT" }, { "version": "v2", "created": "Thu, 23 Sep 2010 16:27:39 GMT" } ]
2010-09-24T00:00:00
[ [ "Burger", "John Robert", "" ] ]
new_dataset
0.999617
1006.5877
Zohir Bouzid
Zohir Bouzid (LIP6), Shlomi Dolev, Maria Potop-Butucaru (LIP6, INRIA Rocquencourt), S\'ebastien Tixeuil (LIP6)
RoboCast: Asynchronous Communication in Robot Networks
null
null
null
null
cs.DC cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces the \emph{RoboCast} communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors and do not share a common coordinate system, to asynchronously exchange information. We propose a generic framework that covers a large class of asynchronous communication algorithms and show how our framework can be used to implement fundamental building blocks in robot networks such as gathering or stigmergy. In more details, we propose a RoboCast algorithm that allows robots to broadcast their local coordinate systems to each others. Our algorithm is further refined with a local collision avoidance scheme. Then, using the RoboCast primitive, we propose algorithms for deterministic asynchronous gathering and binary information exchange.
[ { "version": "v1", "created": "Wed, 30 Jun 2010 15:07:28 GMT" }, { "version": "v2", "created": "Thu, 23 Sep 2010 09:59:58 GMT" } ]
2010-09-24T00:00:00
[ [ "Bouzid", "Zohir", "", "LIP6" ], [ "Dolev", "Shlomi", "", "LIP6, INRIA\n Rocquencourt" ], [ "Potop-Butucaru", "Maria", "", "LIP6, INRIA\n Rocquencourt" ], [ "Tixeuil", "Sébastien", "", "LIP6" ] ]
new_dataset
0.99764
1009.4602
Amelia Carolina Sparavigna
Amelia Carolina Sparavigna
Geoglyphs of Titicaca as an ancient example of graphic design
Keywords: Geoglyphs, History of Graphics, Image processing, Satellite maps, Archaeology
null
null
null
cs.GR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The paper proposes an ancient landscape design as an example of graphic design for an age and place where no written documents existed. It is created by a network of earthworks, which constitute the remains of an extensive ancient agricultural system. It can be seen by means of the Google satellite imagery on the Peruvian region near the Titicaca Lake, as a texture superimposed to the background landform. In this texture, many drawings (geoglyphs) can be observed.
[ { "version": "v1", "created": "Thu, 23 Sep 2010 13:08:32 GMT" } ]
2010-09-24T00:00:00
[ [ "Sparavigna", "Amelia Carolina", "" ] ]
new_dataset
0.999731
1009.4638
Mohammad Noshad
Mohammad Noshad and Kambiz Jamshidi
Novel Codes Family for Modified Spectral-Amplitude-Coding OCDMA Systems and Performance Analysis
null
Journal of Optical Communications and Networking, Vol. 2, No. 6, June 2010
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper a novel family of codes for modified spectral-amplitude-coding optical code division multiple access (SAC-OCDMA) is introduced. The proposed codes exist for more number of processing gains comparing to the previously reported codes. In the network using these codes, the number of users can be extended without any essential changes in the previous transmitters. In this study, we propose a construction method for these codes and compare their performance with previously reported codes.
[ { "version": "v1", "created": "Mon, 16 Aug 2010 15:03:26 GMT" } ]
2010-09-24T00:00:00
[ [ "Noshad", "Mohammad", "" ], [ "Jamshidi", "Kambiz", "" ] ]
new_dataset
0.999075
1009.4260
EPTCS
Musab AlTurki (University of Illinois at Urbana-Champaign), Jos\'e Meseguer (University of Illinois at Urbana-Champaign)
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
In Proceedings RTRTS 2010, arXiv:1009.3982
EPTCS 36, 2010, pp. 26-45
10.4204/EPTCS.36.2
null
cs.LO cs.DC cs.PL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc, including a rewriting logic semantics developed by the authors. Orc also has a fully fledged implementation in Java with functional programming features. However, as with descriptions of most distributed languages, there exists a fairly substantial gap between Orc's formal semantics and its implementation, in that: (i) programs in Orc are not easily deployable in a distributed implementation just by using Orc's formal semantics, and (ii) they are not readily formally analyzable at the level of a distributed Orc implementation. In this work, we overcome problems (i) and (ii) for Orc. Specifically, we describe an implementation technique based on rewriting logic and Maude that narrows this gap considerably. The enabling feature of this technique is Maude's support for external objects through TCP sockets. We describe how sockets are used to implement Orc site calls and returns, and to provide real-time timing information to Orc expressions and sites. We then show how Orc programs in the resulting distributed implementation can be formally analyzed at a reasonable level of abstraction by defining an abstract model of time and the socket communication infrastructure, and discuss the assumptions under which the analysis can be deemed correct. Finally, the distributed implementation and the formal analysis methodology are illustrated with a case study.
[ { "version": "v1", "created": "Wed, 22 Sep 2010 04:02:11 GMT" } ]
2010-09-23T00:00:00
[ [ "AlTurki", "Musab", "", "University of Illinois at Urbana-Champaign" ], [ "Meseguer", "José", "", "University of Illinois at Urbana-Champaign" ] ]
new_dataset
0.996703