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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1003.3564
|
Secretary Aircc Journal
|
S. Sumathy (1) and B.Upendra Kumar (1) ((1) VIT University, India)
|
Secure Key Exchange and Encryption Mechanism for Group Communication in
Wireless Ad Hoc Networks
|
8 Pages, JGraph-Hoc Journal
|
International journal on applications of graph theory in wireless
ad hoc networks and sensor networks 2.1 (2010) 9-16
|
10.5121/jgraphhoc.2010.2102
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Secured communication in ad hoc wireless networks is primarily important,
because the communication signals are openly available as they propagate
through air and are more susceptible to attacks ranging from passive
eavesdropping to active interfering. The lack of any central coordination and
shared wireless medium makes them more vulnerable to attacks than wired
networks. Nodes act both as hosts and routers and are interconnected by Multi-
hop communication path for forwarding and receiving packets to/from other
nodes. The objective of this paper is to propose a key exchange and encryption
mechanism that aims to use the MAC address as an additional parameter as the
message specific key[to encrypt]and forward data among the nodes. The nodes are
organized in spanning tree fashion, as they avoid forming cycles and exchange
of key occurs only with authenticated neighbors in ad hoc networks, where nodes
join or leave the network dynamically.
|
[
{
"version": "v1",
"created": "Thu, 18 Mar 2010 11:55:01 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Sumathy",
"S.",
"",
"VIT University, India"
],
[
"Kumar",
"B. Upendra",
"",
"VIT University, India"
]
] |
new_dataset
| 0.965441 |
1003.3568
|
Secretary Aircc Journal
|
Aditya Goel (The Technological Institute of Textile & Sciences,
Haryana, India)
|
Key distribution in PKC through Quantas
|
11 Pages, JGraph-Hoc Journal 2010
|
International journal on applications of graph theory in wireless
ad hoc networks and sensor networks 2.1 (2010) 121-131
|
10.5121/jgraphhoc.2010.2109
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Cryptography literally means "The art & science of secret writing & sending a
message between two parties in such a way that its contents cannot be
understood by someone other than the intended recipient". and Quantum word is
related with "Light". Thus, Quantum Cryptography is a way of descripting any
information in the form of quantum particles. There are no classical
cryptographic systems which are perfectly secure. In contrast to Classical
cryptography which depends upon Mathematics, Quantum Cryptography utilizes the
concepts of Quantum Physics which provides us the security against the
cleverest marauders of the present age. In the view of increasing need of
Network and Information Security, we do require methods to overcome the
Molecular Computing technologies (A future technology) and other techniques of
the various codebrakers. Both the parts i.e. Quantum Key distribution and
Information transference from Sender to Receiver are much efficient and secure.
It is based upon BB84 protocol. It can be of great use for Govt. agencies such
as Banks, Insurance, Brokerages firms, financial institutions, e-commerce and
most important is the Defense & security of any country. It is a Cryptographic
communication system in which the original users can detect unauthorized
eavesdropper and in addition it gives a guarantee of no eavesdropping. It
proves to be the ultra secure mode of communication b/w two intended parties.
|
[
{
"version": "v1",
"created": "Thu, 18 Mar 2010 12:07:52 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Goel",
"Aditya",
"",
"The Technological Institute of Textile & Sciences,\n Haryana, India"
]
] |
new_dataset
| 0.99956 |
1003.5439
|
Secretary Aircc Journal
|
Ratul Kr. Baruah (Tezpur University, India)
|
Design of A Low Power Low Voltage CMOS Opamp
|
8 Pages, VLSICS Journal
|
International Journal Of VLSI Design & Communication Systems 1.1
(2010) 1-8
|
10.5121/vlsic.2010.1101
| null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper a CMOS operational amplifier is presented which operates at 2V
power supply and 1microA input bias current at 0.8 micron technology using non
conventional mode of operation of MOS transistors and whose input is depended
on bias current. The unique behaviour of the MOS transistors in subthreshold
region not only allows a designer to work at low input bias current but also at
low voltage. While operating the device at weak inversion results low power
dissipation but dynamic range is degraded. Optimum balance between power
dissipation and dynamic range results when the MOS transistors are operated at
moderate inversion. Power is again minimised by the application of input
dependant bias current using feedback loops in the input transistors of the
differential pair with two current substractors. In comparison with the
reported low power low voltage opamps at 0.8 micron technology, this opamp has
very low standby power consumption with a high driving capability and operates
at low voltage. The opamp is fairly small (0.0084 mm 2) and slew rate is more
than other low power low voltage opamps reported at 0.8 um technology [1,2].
Vittoz at al [3] reported that slew rate can be improved by adaptive biasing
technique and power dissipation can be reduced by operating the device in weak
inversion. Though lower power dissipation is achieved the area required by the
circuit is very large and speed is too small. So, operating the device in
moderate inversion is a good solution. Also operating the device in
subthreshold region not only allows lower power dissipation but also a lower
voltage operation is achieved.
|
[
{
"version": "v1",
"created": "Mon, 29 Mar 2010 07:03:46 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Baruah",
"Ratul Kr.",
"",
"Tezpur University, India"
]
] |
new_dataset
| 0.972501 |
1003.6030
|
Secretary Aircc Journal
|
K. Ragini (1), M. Satyam (2) and B.C. Jinaga (3) ((1) G.Narayanamma
Institute of Technology & Science India, (2) International Institute of
Information Technology, India, (3) Jawaharlal Nehru Technology University,
India)
|
Variable Threshold MOSFET Approach (Through Dynamic Threshold MOSFET)
For Universal Logic Gates
|
11 Pages, VLSICS Journal
|
International Journal Of VLSI Design & Communication Systems 1.1
(2010) 33-43
|
10.5121/vlsic.2010.1104
| null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this article, we proposed a Variable threshold MOSFET(VTMOS)approach which
is realized from Dynamic Threshold MOSFET(DTMOS), suitable for sub-threshold
digital circuit operation. Basically the principle of sub- threshold logics is
operating MOSFET in sub-threshold region and using the leakage current in that
region for switching action, there by drastically decreasing power. To reduce
the power consumption of sub-threshold circuits further, a novel body biasing
technique termed VTMOS is introduced .VTMOS approach is realized from DTMOS
approach. Dynamic threshold MOS (DTMOS) circuits provide low leakage and high
current drive, compared to CMOS circuits, operated at lower voltages. The VTMOS
is based on operating the MOS devices with an appropriate substrate bias which
varies with gate voltage, by connecting a positive bias voltage between gate
and substrate for NMOS and negative bias voltage between gate and substrate for
PMOS. With VTMOS, there is a considerable reduction in operating current and
power dissipation, while the remaining characteristics are almost the same as
those of DTMOS. Results of our investigations show that VTMOS circuits improves
the power up to 50% when compared to CMOS and DTMOS circuits, in sub- threshold
region.. The performance analysis and comparison of VTMOS, DTMOS and CMOS is
made and test results of Power dissipation, Propagation delay and Power delay
product are presented to justify the superiority of VTMOS logic over
conventional sub-threshold logics using Hspice Tool. The dependency of these
parameters on frequency of operation has also been investigated.
|
[
{
"version": "v1",
"created": "Wed, 31 Mar 2010 12:12:45 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Ragini",
"K.",
""
],
[
"Satyam",
"M.",
""
],
[
"Jinaga",
"B. C.",
""
]
] |
new_dataset
| 0.996073 |
1004.0421
|
Secretary Aircc Journal
|
Jasmine Norman (1), J.Paulraj Joseph (2) and P.Prapoorna Roja
(3)((1)Measi Institute of Information Technology, India, (2)Manonmaniam
Sundaranar University, India and (3)Jerusalem College of Engineering, India)
|
A Faster Routing Scheme for Stationary Wireless Sensor Networks - A
Hybrid Approach
|
10 pages
|
International Journal of Ad hoc, Sensor & Ubiquitous Computing 1.1
(2010) 1-10
|
10.5121/ijasuc.2010.1101
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A wireless sensor network consists of light-weight, low power, small size
sensor nodes. Routing in wireless sensor networks is a demanding task. This
demand has led to a number of routing protocols which efficiently utilize the
limited resources available at the sensor nodes. Most of these protocols are
either based on single hop routing or multi hop routing and typically find the
minimum energy path without addressing other issues such as time delay in
delivering a packet, load balancing, and redundancy of data. Response time is
very critical in environment monitoring sensor networks where typically the
sensors are stationary and transmit data to a base station or a sink node. In
this paper a faster load balancing routing protocol based on location with a
hybrid approach is proposed.
|
[
{
"version": "v1",
"created": "Sat, 3 Apr 2010 06:09:29 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Norman",
"Jasmine",
""
],
[
"Joseph",
"J. Paulraj",
""
],
[
"Roja",
"P. Prapoorna",
""
]
] |
new_dataset
| 0.998849 |
1004.0587
|
Secretary Aircc Journal
|
Debdutta Barman Roy(1), Rituparna Chaki(2), Nabendu Chaki(3),
((1)Calcutta Institute of Engineering and Management, India, (2) West Bengal
University of Technology, India, (3)University of Calcutta, A.P.C. Road,
India)
|
A New Cluster-based Wormhole Intrusion detection algorithm for Mobile
Ad-Hoc Networks
|
9Pages
|
International Journal of Network Security & Its Applications 1.1
(2009) 44-52
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In multi-hop wireless systems, the need for cooperation among nodes to relay
each other's packets exposes them to a wide range of security attacks. A
particularly devastating attack is the wormhole attack, where a malicious node
records control traffic at one location and tunnels it to another compromised
node, possibly far away, which replays it locally. Routing security in ad hoc
networks is often equated with strong and feasible node authentication and
lightweight cryptography. Unfortunately, the wormhole attack can hardly be
defeated by crypto graphical measures, as wormhole attackers do not create
separate packets. They simply replay packets already existing on the network,
which pass the cryptographic checks. Existing works on wormhole detection have
often focused on detection using specialized hardware, such as directional
antennas, etc. In this paper, we present a cluster based counter-measure for
the wormhole attack, that alleviates these drawbacks and efficiently mitigates
the wormhole attack in MANET. Simulation results on MATLab exhibit the
effectiveness of the proposed algorithm in detecting wormhole attacks.
|
[
{
"version": "v1",
"created": "Mon, 5 Apr 2010 08:18:31 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Roy",
"Debdutta Barman",
""
],
[
"Chaki",
"Rituparna",
""
],
[
"Chaki",
"Nabendu",
""
]
] |
new_dataset
| 0.99248 |
1004.0591
|
Secretary Aircc Journal
|
Eric Ke Wang, Lucas C.K.Hui and S.M.Yiu, (The University of Hong Kong,
Hong Kong)
|
A new key establishment scheme for wireless sensor networks
|
11Pages
|
International Journal of Network Security & Its Applications 1.2
(2009) 17-27
| null | null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Traditional key management techniques, such as public key cryptography or key
distribution center (e.g., Kerberos), are often not effective for wireless
sensor networks for the serious limitations in terms of computational power,
energy supply, network bandwidth. In order to balance the security and
efficiency, we propose a new scheme by employing LU Composition techniques for
mutual authenticated pairwise key establishment and integrating LU Matrix with
Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the
meantime, it is able to achieve efficient group key agreement and management.
Analysis shows that the new scheme has better performance and provides
authenticity and anonymity for sensor to establish multiple kinds of keys,
compared with previous related works.
|
[
{
"version": "v1",
"created": "Mon, 5 Apr 2010 08:38:27 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Wang",
"Eric Ke",
""
],
[
"Hui",
"Lucas C. K.",
""
],
[
"Yiu",
"S. M.",
""
]
] |
new_dataset
| 0.973487 |
1004.0604
|
Secretary Aircc Journal
|
Sugam Sharma(1), Hari Cohly(2), Tzusheng Pei(2),((1)Iowa State
University, USA, (2) Jackson State University, USA)
|
On Generation of Firewall Log Status Reporter (SRr) Using Perl
|
10Pages
|
International Journal of Network Security & Its Applications 1.2
(2009) 90-99
| null | null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Computer System Administration and Network Administration are few such areas
where Practical Extraction Reporting Language (Perl) has robust utilization
these days apart from Bioinformatics. The key role of a System/Network
Administrator is to monitor log files. Log file are updated every day. To scan
the summary of large log files and to quickly determine if there is anything
wrong with the server or network we develop a Firewall Log Status Reporter
(SRr). SRr helps to generate the reports based on the parameters of interest.
SRr provides the facility to admin to generate the individual firewall report
or all reports in one go. By scrutinizing the results of the reports admin can
trace how many times a particular request has been made from which source to
which destination and can track the errors easily. Perl scripts can be seen as
the UNIX script replacement in future arena and SRr is one development with the
same hope that we can believe in. SRr is a generalized and customizable utility
completely written in Perl and may be used for text mining and data mining
application in Bioinformatics research and development too.
|
[
{
"version": "v1",
"created": "Mon, 5 Apr 2010 09:52:05 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Sharma",
"Sugam",
""
],
[
"Cohly",
"Hari",
""
],
[
"Pei",
"Tzusheng",
""
]
] |
new_dataset
| 0.968987 |
1004.0605
|
Secretary Aircc Journal
|
Alan Mink, Sheila Frankel and Ray Perlner,((NIST), USA)
|
Quantum Key Distribution (QKD) and Commodity Security Protocols:
Introduction and Integration
|
12Pages
|
International Journal of Network Security & Its Applications 1.2
(2009) 101-112
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We present an overview of quantum key distribution (QKD), a secure key
exchange method based on the quantum laws of physics rather than computational
complexity. We also provide an overview of the two most widely used commodity
security protocols, IPsec and TLS. Pursuing a key exchange model, we propose
how QKD could be integrated into these security applications. For such a QKD
integration we propose a support layer that provides a set of common QKD
services between the QKD protocol and the security applications
|
[
{
"version": "v1",
"created": "Mon, 5 Apr 2010 09:57:55 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Mink",
"Alan",
""
],
[
"Frankel",
"Sheila",
""
],
[
"Perlner",
"Ray",
""
]
] |
new_dataset
| 0.999139 |
1004.0774
|
Secretary Aircc Journal
|
Johnneth Fonseca, Zair Abdelouahab, Denivaldo Lopes and Sofiane Labidi
|
A security framework for SOA applications in mobile environment
|
18Pages
|
International Journal of Network Security & Its Applications 1.3
(2009) 90-107
| null | null |
cs.SE cs.CR cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A Rapid evolution of mobile technologies has led to the development of more
sophisticated mobile devices with better storage, processing and transmission
power. These factors enable support to many types of application but also give
rise to a necessity to find a model of service development. Actually, SOA
(Service Oriented Architecture) is a good option to support application
development. This paper presents a framework that allows the development of SOA
based application in mobile environment. The objective of the framework is to
give developers with tools for provision of services in this environment with
the necessary security characteristics.
|
[
{
"version": "v1",
"created": "Tue, 6 Apr 2010 05:32:22 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Fonseca",
"Johnneth",
""
],
[
"Abdelouahab",
"Zair",
""
],
[
"Lopes",
"Denivaldo",
""
],
[
"Labidi",
"Sofiane",
""
]
] |
new_dataset
| 0.972694 |
1005.1736
|
Secretary Aircc Journal
|
M.Rajesh Babu (1) and S.Selvan (2), ((1) PSG College of Technology,
India, (2)Francis Xavier Engineering College, India)
|
A Lightweight and Attack Resistant Authenticated Routing Protocol for
Mobile Adhoc Networks
|
14 Pages, IJWMN
|
International Journal of Wireless & Mobile Networks 2.2 (2010)
16-29
|
10.5121/ijwmn.2010.2202
| null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In mobile ad hoc networks, by attacking the corresponding routing protocol,
an attacker can easily disturb the operations of the network. For ad hoc
networks, till now many secured routing protocols have been proposed which
contains some disadvantages. Therefore security in ad hoc networks is a
controversial area till now. In this paper, we proposed a Lightweight and
Attack Resistant Authenticated Routing Protocol (LARARP) for mobile ad hoc
networks. For the route discovery attacks in MANET routing protocols, our
protocol gives an effective security. It supports the node to drop the invalid
packets earlier by detecting the malicious nodes quickly by verifying the
digital signatures of all the intermediate nodes. It punishes the misbehaving
nodes by decrementing a credit counter and rewards the well behaving nodes by
incrementing the credit counter. Thus it prevents uncompromised nodes from
attacking the routes with malicious or compromised nodes. It is also used to
prevent the denial-of-service (DoS) attacks. The efficiency and effectiveness
of LARARP are verified through the detailed simulation studies.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 07:43:13 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Babu",
"M. Rajesh",
""
],
[
"Selvan",
"S.",
""
]
] |
new_dataset
| 0.999004 |
1005.1737
|
Secretary Aircc Journal
|
Kavi K. Khedo, Rajiv Perseedoss and Avinash Mungur, University of
Mauritius, Mauritius
|
A Wireless Sensor Network Air Pollution Monitoring System
|
15 Pages, IJWMN
|
International Journal of Wireless & Mobile Networks 2.2 (2010)
31-45
|
10.5121/ijwmn.2010.2203
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Sensor networks are currently an active research area mainly due to the
potential of their applications. In this paper we investigate the use of
Wireless Sensor Networks (WSN) for air pollution monitoring in Mauritius. With
the fast growing industrial activities on the island, the problem of air
pollution is becoming a major concern for the health of the population. We
proposed an innovative system named Wireless Sensor Network Air Pollution
Monitoring System (WAPMS) to monitor air pollution in Mauritius through the use
of wireless sensors deployed in huge numbers around the island. The proposed
system makes use of an Air Quality Index (AQI) which is presently not available
in Mauritius. In order to improve the efficiency of WAPMS, we have designed and
implemented a new data aggregation algorithm named Recursive Converging
Quartiles (RCQ). The algorithm is used to merge data to eliminate duplicates,
filter out invalid readings and summarise them into a simpler form which
significantly reduce the amount of data to be transmitted to the sink and thus
saving energy. For better power management we used a hierarchical routing
protocol in WAPMS and caused the motes to sleep during idle time.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 07:44:21 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Khedo",
"Kavi K.",
""
],
[
"Perseedoss",
"Rajiv",
""
],
[
"Mungur",
"Avinash",
""
],
[
"Mauritius",
"University of",
""
],
[
"Mauritius",
"",
""
]
] |
new_dataset
| 0.999086 |
1005.1740
|
Secretary Aircc Journal
|
Emmanouil A. Panaousis, Tipu A. Ramrekha, Grant P. Millar and Christos
Politis, (Kingston University London, United Kingdom)
|
Adaptive and Secure Routing Protocol for Emergency Mobile Ad Hoc
Networks
|
17 Pages, IJWMN
|
International Journal of Wireless & Mobile Networks 2.2 (2010)
62-78
|
10.5121/ijwmn.2010.2205
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The nature of Mobile Ad hoc NETworks (MANETs) makes them suitable to be
utilized in the context of an extreme emergency for all involved rescue teams.
We use the term emergency MANETs (eMANETs) in order to describe next generation
IP-based networks, which are deployed in emergency cases such as forest fires
and terrorist attacks. The main goal within the realm of eMANETs is to provide
emergency workers with intelligent devices such as smart phones and PDAs. This
technology allows communication "islets" to be established between the members
of the same or different emergency teams (policemen, firemen, paramedics). In
this article, we discuss an adaptive and secure routing protocol developed for
the purposes of eMANETs. We evaluate the performance of the protocol by
comparing it with other widely used routing protocols for MANETs. We finally
show that the overhead introduced due to security considerations is affordable
to support secure ad-hoc communications among lightweight devices.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 07:59:01 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Panaousis",
"Emmanouil A.",
""
],
[
"Ramrekha",
"Tipu A.",
""
],
[
"Millar",
"Grant P.",
""
],
[
"Politis",
"Christos",
""
]
] |
new_dataset
| 0.997818 |
1005.1787
|
Secretary Aircc Journal
|
Nitiket N. Mhala(1) and N. K. Choudhari(2), ((1) BDCOE, India, (2)
Bhagwati Chadurvedi COE, India)
|
An Envision of Low Cost Mobile Adhoc Network Test Bed in a Laboratory
Environment Emulating an Actual MANET
|
12 Pages, IJCNC
|
International Journal of Computer Networks & Communications 2.3
(2010) 52-63
|
10.5121/ijcnc.2010.2305
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Orchestrating a live field trial of wireless mobile networking involves
significant cost and logistical issues relating to mobile platforms, support
personnel, network and experiment automation and support equipment. The
significant cost and logistics required to execute such a field trial can also
be limiting in terms of achieving meaningful test results that exercise a
practical number of mobile nodes over a significant set of test conditions
within a given time. There is no argument that field trials are an important
component of dynamic network testing. A field test of prototype will show
whether simulations were on right track or not, but that's a big leap to take;
going from the simulator directly to the real thing. In conceiving our work, we
envisioned a mobile network emulation system that is low cost, flexible and
controllable. This paper describes our wireless MANET test bed under
development which emulates an actual MANET. Here, we focuses that, this test
bed allows the users to automatically generate arbitrary logically network
topologies in order to perform real time operations on adhoc network at a
relatively low cost in a laboratory environment without having to physically
move the nodes in the adhoc network. Thus, we try to "compress" wireless
network so that it fits on a single table.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 10:10:54 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Mhala",
"Nitiket N.",
""
],
[
"Choudhari",
"N. K.",
""
]
] |
new_dataset
| 0.998846 |
1005.5028
|
Secretary Aircc Journal
|
Rajesh P Singh, Anupam Saikia, B. K. Sarma (Indian Institute of
Technology, Guwahati, India)
|
Little Dragon Two: An efficient Multivariate Public Key Cryptosystem
|
10 Pages, IJNSA
|
International Journal of Network Security & Its Applications 2.2
(2010) 1-10
|
10.5121/ijnsa.2010.2201
| null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon
which was a variant a variant of Matsumoto Imai cryptosystem C*. However
Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In
this paper we propose a cryptosystem Little Dragon Two which is as efficient as
Little Dragon cryptosystem but secure against all the known attacks. Like
Little Dragon cryptosystem the public key of Little Dragon Two is mixed type
that is quadratic in plaintext and cipher text variables. So the public key
size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public
key algorithm is bijective and can be used for both encryption and signatures.
|
[
{
"version": "v1",
"created": "Thu, 27 May 2010 10:58:49 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Singh",
"Rajesh P",
"",
"Indian Institute of\n Technology, Guwahati, India"
],
[
"Saikia",
"Anupam",
"",
"Indian Institute of\n Technology, Guwahati, India"
],
[
"Sarma",
"B. K.",
"",
"Indian Institute of\n Technology, Guwahati, India"
]
] |
new_dataset
| 0.998415 |
1005.5433
|
Secretary Aircc Journal
|
Nouha Arfaoui and Jalel Akaichi
|
A Data Warehouse Assistant Design System Based on Clover Model
|
15 Pages, IJDMS
|
International Journal of Database Management Systems 2.2 (2010)
57-71
|
10.5121/ijdms.2010.2204
| null |
cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Nowadays, Data Warehouse (DW) plays a crucial role in the process of decision
making. However, their design remains a very delicate and difficult task either
for expert or users. The goal of this paper is to propose a new approach based
on the clover model, destined to assist users to design a DW. The proposed
approach is based on two main steps. The first one aims to guide users in their
choice of DW schema model. The second one aims to finalize the chosen model by
offering to the designer views related to former successful DW design
experiences.
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 07:35:23 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Arfaoui",
"Nouha",
""
],
[
"Akaichi",
"Jalel",
""
]
] |
new_dataset
| 0.959023 |
1005.5439
|
Secretary Aircc Journal
|
Amer A. Al-Rahayfeh, Abdelshakour A. Abuzneid
|
Detection of Bleeding in Wireless Capsule Endoscopy Images Using Range
Ratio Color
|
10 Pages, IJMA
|
International journal of Multimedia & Its Applications 2.2 (2010)
1-10
|
10.5121/ijma.2010.2201
| null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Wireless Capsule Endoscopy (WCE) is device to detect abnormalities in
colon,esophagus,small intestinal and stomach, to distinguish bleeding in WCE
images from non bleeding is a hard job by human reviewing and very time
consuming. Consequently, automation for classifying bleeding frames not only
will expedite the process but will reduce the burden on the doctors. Using the
purity of the red color we can detect the Bleeding areas in WCE images. But, we
could find various intensity of red color values in different parts of the
small intestinal,so it is not enough to depend on the red color feature alone.
We select RGB(Red,Green,Blue) because it takes raw level values and it is easy
to use. In this paper we will put range ratio color for each of R,G,and B.
Therefore, we divide each image into multiple pixels and apply the range ratio
color condition for each pixel. Then we count the number of the pixels that
achieved our condition. If the number of pixels grater than zero, then the
frame is classified as a bleeding type. Otherwise, it is a non-bleeding. Our
experimental results show that this method could achieve a very high accuracy
in detecting bleeding images for the different parts of the small intestinal
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 08:25:50 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Al-Rahayfeh",
"Amer A.",
""
],
[
"Abuzneid",
"Abdelshakour A.",
""
]
] |
new_dataset
| 0.998187 |
1005.5440
|
Secretary Aircc Journal
|
Surender Kumar(1), R.K.Chauhan(2), Parveen Kumar(3), ((1)Haryana
College of Tech. & Mgmt. India, (2)Kurukshetra University, India, (3)MIET -
Meerut, India)
|
A Low Overhead Minimum Process Global Snapshop Collection Algorithm for
Mobile Distributed System
|
19 Pages, IJMA
|
International journal of Multimedia & Its Applications 2.2 (2010)
12-30
|
10.5121/ijma.2010.2202
| null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Coordinated checkpointing is an effective fault tolerant technique in
distributed system as it avoids the domino effect and require minimum storage
requirement. Most of the earlier coordinated checkpoint algorithms block their
computation during checkpointing and forces minimum-process or non-blocking but
forces all nodes to takes checkpoint even though many of them may not be
necessary or non-blocking minimum-process but takes useless checkpoints or
reduced useless checkpoint but has higher synchronization message overhead or
has high checkpoint request propagation time. Hence in mobile distributed
systems there is a great need of minimizing the number of communication message
and checkpointing overhead as it raise new issues such as mobility, low
bandwidth of wireless channels, frequently disconnections, limited battery
power and lack of reliable stable storage on mobile nodes. In this paper, we
propose a minimum-process coordinated checkpointing algorithm for mobile
distributed system where no useless checkpoints are taken, no blocking of
processes takes place and enforces a minimum-number of processes to take
checkpoints. Our algorithm imposes low memory and computation overheads on MH's
and low communication overheads on wireless channels. It avoids awakening of an
MH if it is not required to take its checkpoint and has reduced latency time as
each process involved in a global checkpoint can forward its own decision
directly to the checkpoint initiator.
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 08:29:45 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Kumar",
"Surender",
""
],
[
"Chauhan",
"R. K.",
""
],
[
"Kumar",
"Parveen",
""
]
] |
new_dataset
| 0.995667 |
1006.0878
|
Secretary Aircc Journal
|
Hao Shi
|
Developing E-Learning Materials for Software Development Course
|
7 pages
|
International Journal of Managing Information Technology 2.2
(2010) 15-21
|
10.5121/ijmit.2010.2202
| null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Software Development is a core second-year course currently offered to
undergraduate students at Victoria University at its five local and
international campuses. The project aims to redesign the existing course
curriculum to support student-centred teaching and learning. It is intended to
provide a learning context in which learners can reflect on new material,
discuss their tentative understandings with others, actively search for new
information, develop skills in communication and collaboration, and build
conceptual connections to their existing knowledge base. The key feature of the
cross-campus curriculum innovation is the use of Blackboard, short for
Blackboard Learning System, to assist in course content organization and online
delivery. A well-defined and integrated case study is used throughout the
course to provide realistic practical experience of software development. It
allows students to take control of their own learning while at the same time
providing support to those students who have particular learning difficulties.
In this paper, the developed curriculum and the learning outcome are described.
The e-Learning material and various Blackboard tools used for teaching and
learning activities are presented. Finally, conclusion is drawn from classroom
experience.
|
[
{
"version": "v1",
"created": "Fri, 4 Jun 2010 12:32:57 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Shi",
"Hao",
""
]
] |
new_dataset
| 0.993692 |
1006.1179
|
Secretary Aircc Journal
|
C. N.Marimuthu (1), P. Thangaraj (2), Aswathy Ramesan (1) ((1)
Maharaja Engineering College, India, (2) Kongu Engineering College, India)
|
Low Power Shift and Add Multiplier Design
|
11 pages
|
International Journal of Computer Science and Information
Technology 2.3 (2010) 12-22
|
10.5121/ijcsit.2010.2302
| null |
cs.AR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Today every circuit has to face the power consumption issue for both portable
device aiming at large battery life and high end circuits avoiding cooling
packages and reliability issues that are too complex. It is generally accepted
that during logic synthesis power tracks well with area. This means that a
larger design will generally consume more power. The multiplier is an important
kernel of digital signal processors. Because of the circuit complexity, the
power consumption and area are the two important design considerations of the
multiplier. In this paper a low power low area architecture for the shift and
add multiplier is proposed. For getting the low power low area architecture,
the modifications made to the conventional architecture consist of the
reduction in switching activities of the major blocks of the multiplier, which
includes the reduction in switching activity of the adder and counter. This
architecture avoids the shifting of the multiplier register. The simulation
result for 8 bit multipliers shows that the proposed low power architecture
lowers the total power consumption by 35.25% and area by 52.72 % when compared
to the conventional architecture. Also the reduction in power consumption
increases with the increase in bit width.
|
[
{
"version": "v1",
"created": "Mon, 7 Jun 2010 06:32:39 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Marimuthu",
"C. N.",
""
],
[
"Thangaraj",
"P.",
""
],
[
"Ramesan",
"Aswathy",
""
]
] |
new_dataset
| 0.996524 |
1006.1193
|
Secretary Aircc Journal
|
P.Raja Rajeswari (1) Allam Apparo (2) and V.K. Kumar (3) ((1) Acharya
Nagarjuna University, India, (2) Jawaharlal Nehru Technological University,
India and (3) S.V.H. College Of Engineering, India)
|
Genbit Compress Tool(GBC): A Java-Based Tool to Compress DNA Sequences
and Compute Compression Ratio(bits/base) of Genomes
|
11 pages
|
International Journal of Computer Science and Information
Technology 2.3 (2010) 181-191
|
10.5121/ijcsit.2010.2313
| null |
cs.MS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We present a Compression Tool, "GenBit Compress", for genetic sequences based
on our new proposed "GenBit Compress Algorithm". Our Tool achieves the best
compression ratios for Entire Genome (DNA sequences) . Significantly better
compression results show that GenBit compress algorithm is the best among the
remaining Genome compression algorithms for non-repetitive DNA sequences in
Genomes. The standard Compression algorithms such as gzip or compress cannot
compress DNA sequences but only expand them in size. In this paper we consider
the problem of DNA compression. It is well known that one of the main features
of DNA Sequences is that they contain substrings which are duplicated except
for a few random Mutations. For this reason most DNA compressors work by
searching and encoding approximate repeats. We depart from this strategy by
searching and encoding only exact repeats. our proposed algorithm achieves the
best compression ratio for DNA sequences for larger genome. As long as 8 lakh
characters can be given as input While achieving the best compression ratios
for DNA sequences, our new GenBit Compress program significantly improves the
running time of all previous DNA compressors. Assigning binary bits for
fragments of DNA sequence is also a unique concept introduced in this program
for the first time in DNA compression.
|
[
{
"version": "v1",
"created": "Mon, 7 Jun 2010 07:37:49 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Rajeswari",
"P. Raja",
""
],
[
"Apparo",
"Allam",
""
],
[
"Kumar",
"V. K.",
""
]
] |
new_dataset
| 0.955023 |
1006.3369
|
Secretary Aircc Journal
|
Abhishek Samanta and Dripto Bakshi (Jadavpur University, India)
|
Fault Tolerant Wireless Sensor MAC Protocol for Efficient Collision
Avoidance
|
14 pages
|
International journal on applications of graph theory in wireless
ad hoc networks and sensor networks 2.2 (2010) 46-59
|
10.5121/jgraphoc.2010.2205
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In sensor networks communication by broadcast methods involves many hazards,
especially collision. Several MAC layer protocols have been proposed to resolve
the problem of collision namely ARBP, where the best achieved success rate is
90%. We hereby propose a MAC protocol which achieves a greater success rate
(Success rate is defined as the percentage of delivered packets at the source
reaching the destination successfully) by reducing the number of collisions,
but by trading off the average propagation delay of transmission. Our proposed
protocols are also shown to be more energy efficient in terms of energy
dissipation per message delivery, compared to the currently existing protocol.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 04:55:55 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Samanta",
"Abhishek",
"",
"Jadavpur University, India"
],
[
"Bakshi",
"Dripto",
"",
"Jadavpur University, India"
]
] |
new_dataset
| 0.99385 |
1006.3375
|
Secretary Aircc Journal
|
Santosh Kumar Singh(1), Krishna Chandra Roy(2) and Vibhakar
Pathak(1),((1)Suresh Gyan Vihar University, India and (2)SBCET, India)
|
Channels Reallocation In Cognitive Radio Networks Based On DNA Sequence
Alignment
|
12 pages
|
International Journal of Next-Generation Networks 2.2 (2010) 23-34
|
10.5121/ijngn.2010.2203
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Nowadays, It has been shown that spectrum scarcity increased due to
tremendous growth of new players in wireless base system by the evolution of
the radio communication. Resent survey found that there are many areas of the
radio spectrum that are occupied by authorized user/primary user (PU), which
are not fully utilized. Cognitive radios (CR) prove to next generation wireless
communication system that proposed as a way to reuse this under-utilised
spectrum in an opportunistic and non-interfering basis. A CR is a self-directed
entity in a wireless communications environment that senses its environment,
tracks changes, and reacts upon its findings and frequently exchanges
information with the networks for secondary user (SU). However, CR facing
collision problem with tracks changes i.e. reallocating of other empty channels
for SU while PU arrives. In this paper, channels reallocation technique based
on DNA sequence alignment algorithm for CR networks has been proposed.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 05:39:17 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Singh",
"Santosh Kumar",
"",
"Suresh Gyan Vihar University, India and"
],
[
"Roy",
"Krishna Chandra",
"",
"SBCET, India"
],
[
"Pathak",
"Vibhakar",
"",
"Suresh Gyan Vihar University, India and"
]
] |
new_dataset
| 0.99166 |
1007.2282
|
Manu Basavaraju
|
Manu Basavaraju and L. Sunil Chandran
|
Acyclic Edge Coloring of Triangle Free Planar Graphs
|
16 pages, 0 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $acyclic$ edge coloring of a graph is a proper edge coloring such that
there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph
is the minimum number k such that there is an acyclic edge coloring using k
colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks
(and much earlier by Fiamcik) that $a'(G)\le \Delta+2$, where $\Delta
=\Delta(G)$ denotes the maximum degree of the graph.
If every induced subgraph $H$ of $G$ satisfies the condition $\vert E(H)
\vert \le 2\vert V(H) \vert -1$, we say that the graph $G$ satisfies $Property\
A$. In this paper, we prove that if $G$ satisfies $Property\ A$, then $a'(G)\le
\Delta + 3$. Triangle free planar graphs satisfy $Property\ A$. We infer that
$a'(G)\le \Delta + 3$, if $G$ is a triangle free planar graph. Another class of
graph which satisfies $Property\ A$ is 2-fold graphs (union of two forests).
|
[
{
"version": "v1",
"created": "Wed, 14 Jul 2010 09:24:13 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Basavaraju",
"Manu",
""
],
[
"Chandran",
"L. Sunil",
""
]
] |
new_dataset
| 0.99852 |
1007.1756
|
Randall Berry
|
Randall A. Berry and David N. C. Tse
|
Shannon Meets Nash on the Interference Channel
|
41 pages, 10 figures, submitted to IEEE Transactions on Information
Theory, May 2010. Added Figure 6
| null | null | null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The interference channel is the simplest communication scenario where
multiple autonomous users compete for shared resources. We combine game theory
and information theory to define a notion of a Nash equilibrium region of the
interference channel. The notion is game theoretic: it captures the selfish
behavior of each user as they compete. The notion is also information
theoretic: it allows each user to use arbitrary communication strategies as it
optimizes its own performance. We give an exact characterization of the Nash
equilibrium region of the two-user linear deterministic interference channel
and an approximate characterization of the Nash equilibrium region of the
two-user Gaussian interference channel to within 1 bit/s/Hz..
|
[
{
"version": "v1",
"created": "Sun, 11 Jul 2010 03:48:29 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jul 2010 14:38:56 GMT"
}
] | 2010-07-14T00:00:00 |
[
[
"Berry",
"Randall A.",
""
],
[
"Tse",
"David N. C.",
""
]
] |
new_dataset
| 0.998568 |
0911.5067
|
Ralf Mueller
|
Laura Cottatellucci, Ralf R. Mueller, and Merouane Debbah
|
Asynchronous CDMA Systems with Random Spreading-Part II: Design Criteria
| null |
IEEE Transactions on Information Theory, vol. 56, no. 4, pp.
1498-1520, Apr. 2010
|
10.1109/TIT.2010.2040898
| null |
cs.IT math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Totally asynchronous code-division multiple-access (CDMA) systems are
addressed. In Part I, the fundamental limits of asynchronous CDMA systems are
analyzed in terms of spectral efficiency and SINR at the output of the optimum
linear detector. The focus of Part II is the design of low-complexity
implementations of linear multiuser detectors in systems with many users that
admit a multistage representation, e.g. reduced rank multistage Wiener filters,
polynomial expansion detectors, weighted linear parallel interference
cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay
distribution on CDMA with suboptimum linear receiver structures are
investigated. Recursive expressions for universal weight design are given. The
performance in terms of SINR is derived in the large-system limit and the
performance improvement over synchronous systems is quantified. The
considerations distinguish between two ways of forming discrete-time
statistics: chip-matched filtering and oversampling.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2009 12:01:57 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Cottatellucci",
"Laura",
""
],
[
"Mueller",
"Ralf R.",
""
],
[
"Debbah",
"Merouane",
""
]
] |
new_dataset
| 0.978417 |
0911.5385
|
Ralf Mueller
|
Laura Cottatellucci, Ralf R. Mueller, and Merouane Debbah
|
Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental
Limits
| null |
IEEE Transactions on Information Theory, vol. 56, no. 4, pp.
1477-1497, Apr. 2010
|
10.1109/TIT.2010.2040890
| null |
cs.IT math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectral efficiency for asynchronous code division multiple access (CDMA)
with random spreading is calculated in the large system limit allowing for
arbitrary chip waveforms and frequency-flat fading. Signal to interference and
noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean
square error (MMSE) detectors, are derived. The approach is general and
optionally allows even for statistics obtained by under-sampling the received
signal.
All performance measures are given as a function of the chip waveform and the
delay distribution of the users in the large system limit. It turns out that
synchronizing users on a chip level impairs performance for all chip waveforms
with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off
factors. For example, with the pulse shaping demanded in the UMTS standard,
user synchronization reduces spectral efficiency up to 12% at 10 dB normalized
signal-to-noise ratio. The benefits of asynchronism stem from the finding that
the excess bandwidth of chip waveforms actually spans additional dimensions in
signal space, if the users are de-synchronized on the chip-level. The analysis
of linear MMSE detectors shows that the limiting interference effects can be
decoupled both in the user domain and in the frequency domain such that the
concept of the effective interference spectral density arises. This generalizes
and refines Tse and Hanly's concept of effective interference.
In Part II, the analysis is extended to any linear detector that admits a
representation as multistage detector and guidelines for the design of low
complexity multistage detectors with universal weights are provided.
|
[
{
"version": "v1",
"created": "Sat, 28 Nov 2009 09:11:25 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Cottatellucci",
"Laura",
""
],
[
"Mueller",
"Ralf R.",
""
],
[
"Debbah",
"Merouane",
""
]
] |
new_dataset
| 0.989446 |
1007.0507
|
Sundeep Rangan
|
Sundeep Rangan
|
Femto-Macro Cellular Interference Control with Subband Scheduling and
Interference Cancelation
|
8 pages, 3 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A significant technical challenge in deploying femtocells is controlling the
interference from the underlay of femtos onto the overlay of macros. This paper
presents a novel interference control method where the macrocell bandwidth is
partitioned into subbands, and the short-range femtocell links adaptively
allocate their power across the subbands based on a load-spillage power control
method. The scheme can improve rate distribution in the macro network while
also providing opportunities for short-range communication as well. Moreover,
the proposed scheme requires minimal interference coordination communication
between the femtos and macros, which is one of the main challenges in femtocell
systems. Also, simulations show certain advantages over simpler
orthogonalization schemes or power control schemes without subband
partitioning. Further modest gains may also be possible with interference
cancelation.
|
[
{
"version": "v1",
"created": "Sat, 3 Jul 2010 18:27:51 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Jul 2010 23:31:37 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Rangan",
"Sundeep",
""
]
] |
new_dataset
| 0.997648 |
1007.0799
|
Kenta Kasai
|
Kenta Kasai and Kohichi Sakaniwa
|
Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes
|
To appear in Proc. 6th International Symposium on Turbo Codes and
Iterative Information Processing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study fountain codes transmitted over the binary-input symmetric-output
channel. For channels with small capacity, receivers needs to collects many
channel outputs to recover information bits. Since a collected channel output
yields a check node in the decoding Tanner graph, the channel with small
capacity leads to large decoding complexity. In this paper, we introduce a
novel fountain coding scheme with non-binary LDPC codes. The decoding
complexity of the proposed fountain code does not depend on the channel.
Numerical experiments show that the proposed codes exhibit better performance
than conventional fountain codes, especially for small number of information
bits.
|
[
{
"version": "v1",
"created": "Tue, 6 Jul 2010 02:50:05 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Jul 2010 15:56:46 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Kasai",
"Kenta",
""
],
[
"Sakaniwa",
"Kohichi",
""
]
] |
new_dataset
| 0.999409 |
1007.1697
|
Sagarmoy Dutta
|
Sagarmoy Dutta and Piyush P Kurur
|
Quantum Cyclic Code
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we define and study \emph{quantum cyclic codes}, a
generalisation of cyclic codes to the quantum setting. Previously studied
examples of quantum cyclic codes were all quantum codes obtained from classical
cyclic codes via the CSS construction. However, the codes that we study are
much more general. In particular, we construct cyclic stabiliser codes with
parameters $[[5,1,3]]$, $[[17,1,7]]$ and $[[17,9,3]]$, all of which are
\emph{not} CSS. The $[[5,1,3]]$ code is the well known Laflamme code and to the
best of our knowledge the other two are new examples. Our definition of
cyclicity applies to non-stabiliser codes as well; in fact we show that the
$((5,6,2))$ nonstabiliser first constructed by Rains\etal~
cite{rains97nonadditive} and latter by Arvind
\etal~\cite{arvind:2004:nonstabilizer} is cyclic. We also study stabiliser
codes of length $4^m +1$ over $\mathbb{F}_2$ for which we define a notation of
BCH distance. Much like the Berlekamp decoding algorithm for classical BCH
codes, we give efficient quantum algorithms to correct up to
$\floor{\frac{d-1}{2}}$ errors when the BCH distance is $d$.
|
[
{
"version": "v1",
"created": "Sat, 10 Jul 2010 05:01:41 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Dutta",
"Sagarmoy",
""
],
[
"Kurur",
"Piyush P",
""
]
] |
new_dataset
| 0.999413 |
1007.1735
|
Ahmed Badr
|
Ahmed Badr, Ashish Khisti and Emin Martinian
|
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and
Optimality
|
Globecom 2010
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Streaming erasure codes encode a source stream to guarantee that each source
packet is recovered within a fixed delay at the receiver over a burst-erasure
channel. This paper introduces diversity embedded streaming erasure codes
(DE-SCo), that provide a flexible tradeoff between the channel quality and
receiver delay. When the channel conditions are good, the source stream is
recovered with a low delay, whereas when the channel conditions are poor the
source stream is still recovered, albeit with a larger delay. Information
theoretic analysis of the underlying burst-erasure broadcast channel reveals
that DE-SCo achieve the minimum possible delay for the weaker user, without
sacrificing the performance of the stronger user. A larger class of multicast
streaming erasure codes (MU-SCo) that achieve optimal tradeoff between rate,
delay and erasure-burst length is also constructed.
|
[
{
"version": "v1",
"created": "Sat, 10 Jul 2010 18:02:49 GMT"
}
] | 2010-07-13T00:00:00 |
[
[
"Badr",
"Ahmed",
""
],
[
"Khisti",
"Ashish",
""
],
[
"Martinian",
"Emin",
""
]
] |
new_dataset
| 0.998397 |
0901.1655
|
Roberto N\'obrega
|
Roberto W. Nobrega and Bartolomeu F. Uchoa-Filho
|
Multishot Codes for Network Coding: Bounds and a Multilevel Construction
|
5 pages, 2 figures, submitted to ISIT 2009
| null |
10.1109/ISIT.2009.5205750
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The subspace channel was introduced by Koetter and Kschischang as an adequate
model for the communication channel from the source node to a sink node of a
multicast network that performs random linear network coding. So far, attention
has been given to one-shot subspace codes, that is, codes that use the subspace
channel only once. In contrast, this paper explores the idea of using the
subspace channel more than once and investigates the so called multishot
subspace codes. We present definitions for the problem, a motivating example,
lower and upper bounds for the size of codes, and a multilevel construction of
codes based on block-coded modulation.
|
[
{
"version": "v1",
"created": "Mon, 12 Jan 2009 20:23:55 GMT"
}
] | 2010-07-12T00:00:00 |
[
[
"Nobrega",
"Roberto W.",
""
],
[
"Uchoa-Filho",
"Bartolomeu F.",
""
]
] |
new_dataset
| 0.997052 |
1006.3426
|
John Whitbeck
|
John Whitbeck, Vania Conan
|
HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless
Networks
|
Accepted for publication in the Computer Communications Journal
|
Computer Communications Vol. 33 Issue 13 (2010) pages 1483-1492
|
10.1016/j.comcom.2010.03.005
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delay/Disruption-Tolerant Network (DTN) protocols typically address sparse
intermittently connected networks whereas Mobile Ad-hoc Network (MANET)
protocols address the fairly stable and fully connected ones. But many
intermediate situations may occur on mobility dynamics or radio link
instability. In such cases, where the network frequently splits into evolving
connected groups, none of the conventional routing paradigms (DTN or MANET) are
fully satisfactory. In this paper we propose HYMAD, a Hybrid DTN-MANET routing
protocol which uses DTN between disjoint groups of nodes while using MANET
routing within these groups. HYMAD is fully decentralized and only makes use of
topological information exchanges between the nodes. The strength of HYMAD lies
in its ability to adapt to the changing connectivity patterns of the network.
We evaluate the scheme in simulation by replaying synthetic and real life
mobility traces which exhibit a broad range of connectivity dynamics. The
results show that HYMAD introduces limited overhead and outperforms the
multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of
delivery ratio and delay. This hybrid DTN-MANET approach offers a promising
venue for the delivery of elastic data in mobile ad-hoc networks as it retains
the resilience of a \textit{pure} DTN protocol while significantly improving
performance.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 10:52:51 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Jun 2010 16:28:26 GMT"
}
] | 2010-07-12T00:00:00 |
[
[
"Whitbeck",
"John",
""
],
[
"Conan",
"Vania",
""
]
] |
new_dataset
| 0.991658 |
1007.1189
|
Stefan Schmid
|
Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang
|
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a simple local medium access control protocol, called
\textsc{Jade}, for multi-hop wireless networks with a single channel that is
provably robust against adaptive adversarial jamming. The wireless network is
modeled as a unit disk graph on a set of nodes distributed arbitrarily in the
plane. In addition to these nodes, there are adversarial jammers that know the
protocol and its entire history and that are allowed to jam the wireless
channel at any node for an arbitrary $(1-\epsilon)$-fraction of the time steps,
where $0<\epsilon<1$ is an arbitrary constant. We assume that the nodes cannot
distinguish between jammed transmissions and collisions of regular messages.
Nevertheless, we show that \textsc{Jade} achieves an asymptotically optimal
throughput if there is a sufficiently dense distribution of nodes.
|
[
{
"version": "v1",
"created": "Wed, 7 Jul 2010 17:25:53 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Jul 2010 12:58:58 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Jul 2010 19:24:08 GMT"
}
] | 2010-07-12T00:00:00 |
[
[
"Richa",
"Andrea",
""
],
[
"Scheideler",
"Christian",
""
],
[
"Schmid",
"Stefan",
""
],
[
"Zhang",
"Jin",
""
]
] |
new_dataset
| 0.996018 |
1007.1069
|
Patrik Wahlberg
|
Patrik Wahlberg and Peter J. Schreier
|
On the instantaneous frequency of Gaussian stochastic processes
|
22 pages
| null | null | null |
cs.IT math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper concerns the instantaneous frequency (IF) of continuous-time,
zero-mean, complex-valued, proper, mean-square differentiable nonstationary
Gaussian stochastic processes. We compute the probability density function for
the IF for fixed time, which extends a result known for wide-sense stationary
processes to nonstationary processes. For a fixed time the IF has either zero
or infinite variance. For harmonizable processes we obtain as a byproduct that
the mean of the IF, for fixed time, is the normalized first order frequency
moment of the Wigner spectrum.
|
[
{
"version": "v1",
"created": "Wed, 7 Jul 2010 08:16:36 GMT"
}
] | 2010-07-08T00:00:00 |
[
[
"Wahlberg",
"Patrik",
""
],
[
"Schreier",
"Peter J.",
""
]
] |
new_dataset
| 0.986141 |
1007.1100
|
Jalaluddin Qureshi
|
Chuan Heng Foh, Jianfei Cai, and Jalaluddin Qureshi
|
Collision Codes: Decoding Superimposed BPSK Modulated Wireless
Transmissions
| null | null |
10.1109/CCNC.2010.5421745
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of physical layer network coding gives rise to the concept
of turning a collision of transmissions on a wireless channel useful. In the
idea of physical layer network coding, two synchronized simultaneous packet
transmissions are carefully encoded such that the superimposed transmission can
be decoded to produce a packet which is identical to the bitwise binary sum of
the two transmitted packets. This paper explores the decoding of superimposed
transmission resulted by multiple synchronized simultaneous transmissions. We
devise a coding scheme that achieves the identification of individual
transmission from the synchronized superimposed transmission. A mathematical
proof for the existence of such a coding scheme is given.
|
[
{
"version": "v1",
"created": "Wed, 7 Jul 2010 10:34:34 GMT"
}
] | 2010-07-08T00:00:00 |
[
[
"Foh",
"Chuan Heng",
""
],
[
"Cai",
"Jianfei",
""
],
[
"Qureshi",
"Jalaluddin",
""
]
] |
new_dataset
| 0.995305 |
1007.1209
|
Xuebin Wu
|
Xuebin Wu, Zhiyuan Yan, Ning Chen, and Meghanad Wagh
|
Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over
Finite Fields
|
submitted to SiPS 2010, accepted
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Discrete Fourier transforms~(DFTs) over finite fields have widespread
applications in error correction coding. Hence, reducing the computational
complexities of DFTs is of great significance, especially for long DFTs as
increasingly longer error control codes are chosen for digital communication
and storage systems. Since DFTs involve both multiplications and additions over
finite fields and multiplications are much more complex than additions,
recently proposed cyclotomic fast Fourier transforms (CFFTs) are promising due
to their low multiplicative complexity. Unfortunately, they have very high
additive complexity. Techniques such as common subexpression elimination (CSE)
can be used to reduce the additive complexity of CFFTs, but their effectiveness
for long DFTs is limited by their complexity. In this paper, we propose prime
factor cyclotomic Fourier transforms (PFCFTs), which use CFFTs as sub-DFTs via
the prime factor algorithm. When the length of DFTs is prime, our PFCFTs reduce
to CFFTs. When the length has co-prime factors, since the sub-DFTs have much
shorter lengths, this allows us to use CSE to significantly reduce their
additive complexity. In comparison to previously proposed fast Fourier
transforms, our PFCFTs achieve reduced overall complexity when the length of
DFTs is at least 255, and the improvement significantly increases as the length
grows. This approach also enables us to propose efficient DFTs with very long
length (e.g., 4095-point), first efficient DFTs of such lengths in the
literature. Finally, our PFCFTs are also advantageous for hardware
implementation due to their regular structure.
|
[
{
"version": "v1",
"created": "Wed, 7 Jul 2010 18:02:55 GMT"
}
] | 2010-07-08T00:00:00 |
[
[
"Wu",
"Xuebin",
""
],
[
"Yan",
"Zhiyuan",
""
],
[
"Chen",
"Ning",
""
],
[
"Wagh",
"Meghanad",
""
]
] |
new_dataset
| 0.996031 |
1007.0936
|
Jaroslaw Kwapien
|
Jaroslaw Kwapien, Stanislaw Drozdz, Adam Orczyk
|
Linguistic complexity: English vs. Polish, text vs. corpus
| null |
Acta Phys. Pol. A 117, 716-720 (2010)
| null | null |
cs.CL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze the rank-frequency distributions of words in selected English and
Polish texts. We show that for the lemmatized (basic) word forms the
scale-invariant regime breaks after about two decades, while it might be
consistent for the whole range of ranks for the inflected word forms. We also
find that for a corpus consisting of texts written by different authors the
basic scale-invariant regime is broken more strongly than in the case of
comparable corpus consisting of texts written by the same author. Similarly,
for a corpus consisting of texts translated into Polish from other languages
the scale-invariant regime is broken more strongly than for a comparable corpus
of native Polish texts. Moreover, we find that if the words are tagged with
their proper part of speech, only verbs show rank-frequency distribution that
is almost scale-invariant.
|
[
{
"version": "v1",
"created": "Tue, 6 Jul 2010 16:09:43 GMT"
}
] | 2010-07-07T00:00:00 |
[
[
"Kwapien",
"Jaroslaw",
""
],
[
"Drozdz",
"Stanislaw",
""
],
[
"Orczyk",
"Adam",
""
]
] |
new_dataset
| 0.968884 |
0912.5494
|
Serguei Mokhov
|
Miao Song, Serguei A. Mokhov and Peter Grogono
|
Teaching Physical Based Animation via OpenGL Slides
|
12 pages; 7 figures; the poster is presented at C32SE'09 and the
paper at CISSE'09 at http://conference.cisse2009.org/proceedings.aspx ; there
are an executable demo and its source code
| null |
10.1007/978-90-481-9112-3_82 10.1145/1557626.1557647
| null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work expands further our earlier poster presentation and integration of
the OpenGL Slides Framework (OGLSF) - to make presentations with real-time
animated graphics where each slide is a scene with tidgets - and physical based
animation of elastic two-, three-layer softbody objects. The whole project is
very interactive, and serves dual purpose - delivering the teaching material in
a classroom setting with real running animated examples as well as releasing
the source code to the students to show how the actual working things are made.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2009 17:53:18 GMT"
}
] | 2010-07-06T00:00:00 |
[
[
"Song",
"Miao",
""
],
[
"Mokhov",
"Serguei A.",
""
],
[
"Grogono",
"Peter",
""
]
] |
new_dataset
| 0.999178 |
1002.0026
|
Lorena Ronquillo
|
H. Rif\`a-Pous, J. Rif\`a and L. Ronquillo
|
Perfect Z2Z4-linear codes in Steganography
|
5 pages, revised version
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Steganography is an information hiding application which aims to hide secret
data imperceptibly into a commonly used media. Unfortunately, the theoretical
hiding asymptotical capacity of steganographic systems is not attained by
algorithms developed so far. In this paper, we describe a novel coding method
based on Z2Z4-linear codes that conforms to +/-1-steganography, that is secret
data is embedded into a cover message by distorting each symbol by one unit at
most. This method solves some problems encountered by the most efficient
methods known today, based on ternary Hamming codes. Finally, the performance
of this new technique is compared with that of the mentioned methods and with
the well-known theoretical upper bound.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2010 15:40:51 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jul 2010 12:52:54 GMT"
}
] | 2010-07-06T00:00:00 |
[
[
"Rifà-Pous",
"H.",
""
],
[
"Rifà",
"J.",
""
],
[
"Ronquillo",
"L.",
""
]
] |
new_dataset
| 0.993861 |
1007.0496
|
Matthew Mckay Dr.
|
Yang Chen and Matthew R. McKay
|
Perturbed Hankel Determinants: Applications to the Information Theory of
MIMO Wireless Communications
|
77 pages; 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we compute two important information-theoretic quantities which
arise in the application of multiple-input multiple-output (MIMO) antenna
wireless communication systems: the distribution of the mutual information of
multi-antenna Gaussian channels, and the Gallager random coding upper bound on
the error probability achievable by finite-length channel codes. It turns out
that the mathematical problem underpinning both quantities is the computation
of certain Hankel determinants generated by deformed versions of classical
weight functions. For single-user MIMO systems, it is a deformed Laguerre
weight, whereas for multi-user MIMO systems it is a deformed Jacobi weight. We
apply two different methods to characterize each of these Hankel determinants.
First, we employ the ladder operators of the corresponding monic orthogonal
polynomials to give an exact characterization of the Hankel determinants in
terms of Painlev\'{e} differential equations. This turns out to be a
Painlev\'{e} V for the single-user MIMO scenario and a Painlev\'{e} VI for the
multi user scenario. We then employ Coulomb fluid methods to derive new
closed-form approximations for the Hankel determinants which, although formally
valid for large matrix dimensions, are shown to give accurate results for both
the MIMO mutual information distribution and the error exponent even when the
matrix dimensions are small. Focusing on the single-user mutual information
distribution, we then employ both the exact Painlev\'{e} representation and the
Coulomb fluid approximation to yield deeper insights into the scaling behavior
in terms of the number of antennas and signal-to-noise ratio. Among other
things, these results allow us to study the asymptotic Gaussianity of the
distribution as the number of antennas increase, and to explicitly compute the
correction terms to the mean, variance, and higher order cumulants.
|
[
{
"version": "v1",
"created": "Sat, 3 Jul 2010 13:52:53 GMT"
}
] | 2010-07-06T00:00:00 |
[
[
"Chen",
"Yang",
""
],
[
"McKay",
"Matthew R.",
""
]
] |
new_dataset
| 0.985273 |
0802.4002
|
Uwe Aickelin
|
Uwe Aickelin and Julie Greensmith
|
Sensing Danger: Innate Immunology for Intrusion Detection
| null |
Information Security Technical Report, 12(4), pp 218-227, 2007
|
10.1016/j.istr.2007.10.003
| null |
cs.NE cs.CR
| null |
The immune system provides an ideal metaphor for anomaly detection in general
and computer security in particular. Based on this idea, artificial immune
systems have been used for a number of years for intrusion detection,
unfortunately so far with little success. However, these previous systems were
largely based on immunological theory from the 1970s and 1980s and over the
last decade our understanding of immunological processes has vastly improved.
In this paper we present two new immune inspired algorithms based on the latest
immunological discoveries, such as the behaviour of Dendritic Cells. The
resultant algorithms are applied to real world intrusion problems and show
encouraging results. Overall, we believe there is a bright future for these
next generation artificial immune algorithms.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2008 12:15:08 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Mar 2008 16:59:24 GMT"
},
{
"version": "v3",
"created": "Fri, 16 May 2008 10:45:07 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Aickelin",
"Uwe",
""
],
[
"Greensmith",
"Julie",
""
]
] |
new_dataset
| 0.957145 |
0907.3867
|
Uwe Aickelin
|
Julie Greensmith and Uwe Aickelin
|
Artificial Dendritic Cells: Multi-faceted Perspectives
|
24 pages, 6 figures,
|
Human-Centric Information Processing Through Granular Modelling,
182, 375-395, 2009
| null | null |
cs.AI cs.CR cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dendritic cells are the crime scene investigators of the human immune system.
Their function is to correlate potentially anomalous invading entities with
observed damage to the body. The detection of such invaders by dendritic cells
results in the activation of the adaptive immune system, eventually leading to
the removal of the invader from the host body. This mechanism has provided
inspiration for the development of a novel bio-inspired algorithm, the
Dendritic Cell Algorithm. This algorithm processes information at multiple
levels of resolution, resulting in the creation of information granules of
variable structure. In this chapter we examine the multi-faceted nature of
immunology and how research in this field has shaped the function of the
resulting Dendritic Cell Algorithm. A brief overview of the algorithm is given
in combination with the details of the processes used for its development. The
chapter is concluded with a discussion of the parallels between our
understanding of the human immune system and how such knowledge influences the
design of artificial immune systems.
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2009 15:46:18 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jul 2009 15:21:39 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.99957 |
0910.3124
|
Uwe Aickelin
|
Gianni Tedesco, Uwe Aickelin
|
An Immune Inspired Network Intrusion Detection System Utilising
Correlation Context
|
2 pages, Workshop on Artificial Immune Systems and Immune System
Modelling
| null | null | null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network Intrusion Detection Systems (NIDS) are computer systems which monitor
a network with the aim of discerning malicious from benign activity on that
network. While a wide range of approaches have met varying levels of success,
most IDSs rely on having access to a database of known attack signatures which
are written by security experts. Nowadays, in order to solve problems with
false positive alerts, correlation algorithms are used to add additional
structure to sequences of IDS alerts. However, such techniques are of no help
in discovering novel attacks or variations of known attacks, something the
human immune system (HIS) is capable of doing in its own specialised domain.
This paper presents a novel immune algorithm for application to the IDS
problem. The goal is to discover packets containing novel variations of attacks
covered by an existing signature base.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2009 13:55:41 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Tedesco",
"Gianni",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.979246 |
1001.2405
|
Uwe Aickelin
|
Julie Greensmith and Uwe Aickelin
|
Dendritic Cells for Real-Time Anomaly Detection
|
2 pages, 1 figure, Workshop on Artificial Immune Systems and Immune
System Modelling (AISB06), Bristol, UK
| null | null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dendritic Cells (DCs) are innate immune system cells which have the power to
activate or suppress the immune system. The behaviour of human of human DCs is
abstracted to form an algorithm suitable for anomaly detection. We test this
algorithm on the real-time problem of port scan detection. Our results show a
significant difference in artificial DC behaviour for an outgoing portscan when
compared to behaviour for normal processes.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2010 10:41:00 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.999126 |
1002.0276
|
Uwe Aickelin
|
Julie Greensmith and Uwe Aickelin
|
Dendritic Cells for SYN Scan Detection
|
8 Pages, 9 Figures, Genetic and Evolutionary Computation Conference
(GECCO 2007)
|
Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO 2007)
| null | null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Artificial immune systems have previously been applied to the problem of
intrusion detection. The aim of this research is to develop an intrusion
detection system based on the function of Dendritic Cells (DCs). DCs are
antigen presenting cells and key to activation of the human immune system,
behaviour which has been abstracted to form the Dendritic Cell Algorithm (DCA).
In algorithmic terms, individual DCs perform multi-sensor data fusion,
asynchronously correlating the the fused data signals with a secondary data
stream. Aggregate output of a population of cells, is analysed and forms the
basis of an anomaly detection system. In this paper the DCA is applied to the
detection of outgoing port scans using TCP SYN packets. Results show that
detection can be achieved with the DCA, yet some false positives can be
encountered when simultaneously scanning and using other network services.
Suggestions are made for using adaptive signals to alleviate this uncovered
problem.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2010 15:53:04 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.999351 |
1003.0789
|
Uwe Aickelin
|
Julie Greensmith, Uwe Aickelin, Gianni Tedesco
|
Information Fusion for Anomaly Detection with the Dendritic Cell
Algorithm
|
21 pages, 17 figures, Information Fusion
|
Information Fusion, 11 (1), 21-34, 2010
| null | null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dendritic cells are antigen presenting cells that provide a vital link
between the innate and adaptive immune system, providing the initial detection
of pathogenic invaders. Research into this family of cells has revealed that
they perform information fusion which directs immune responses. We have derived
a Dendritic Cell Algorithm based on the functionality of these cells, by
modelling the biological signals and differentiation pathways to build a
control mechanism for an artificial immune system. We present algorithmic
details in addition to experimental results, when the algorithm was applied to
anomaly detection for the detection of port scans. The results show the
Dendritic Cell Algorithm is sucessful at detecting port scans.
|
[
{
"version": "v1",
"created": "Wed, 3 Mar 2010 12:04:01 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
],
[
"Tedesco",
"Gianni",
""
]
] |
new_dataset
| 0.992816 |
1003.4142
|
Uwe Aickelin
|
Jungwon Kim, Julie Greensmith, Jamie Twycross, Uwe Aickelin
|
Malicious Code Execution Detection and Response Immune System inspired
by the Danger Theory
|
4 pages, 1 table, Adaptive and Resilient Computing Security Workshop
(ARCS-05), Santa Fe, USA
|
Proceedings of Adaptive and Resilient Computing Security Workshop
(ARCS-05), Santa Fe, USA, 2005,
| null | null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The analysis of system calls is one method employed by anomaly detection
systems to recognise malicious code execution. Similarities can be drawn
between this process and the behaviour of certain cells belonging to the human
immune system, and can be applied to construct an artificial immune system. A
recently developed hypothesis in immunology, the Danger Theory, states that our
immune system responds to the presence of intruders through sensing molecules
belonging to those invaders, plus signals generated by the host indicating
danger and damage. We propose the incorporation of this concept into a
responsive intrusion detection system, where behavioural information of the
system and running processes is combined with information regarding individual
system calls.
|
[
{
"version": "v1",
"created": "Mon, 22 Mar 2010 12:24:02 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Kim",
"Jungwon",
""
],
[
"Greensmith",
"Julie",
""
],
[
"Twycross",
"Jamie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.981416 |
1004.3196
|
Uwe Aickelin
|
Julie Greensmith, Uwe Aickelin, Steve Cayzer
|
Introducing Dendritic Cells as a Novel Immune-Inspired Algorithm for
Anomoly Detection
|
14 pages, 4 figures, 4 tables, 4th International Conference on
Artificial Immune Systems (ICARIS2005)
|
Proceedings of the 4th International Conference on Artificial
Immune Systems (ICARIS2005), Lecture Notes in Computer Science 3627, Banff,
Canada, 2005
| null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dendritic cells are antigen presenting cells that provide a vital link
between the innate and adaptive immune system. Research into this family of
cells has revealed that they perform the role of coordinating T-cell based
immune responses, both reactive and for generating tolerance. We have derived
an algorithm based on the functionality of these cells, and have used the
signals and differentiation pathways to build a control mechanism for an
artificial immune system. We present our algorithmic details in addition to
some preliminary results, where the algorithm was applied for the purpose of
anomaly detection. We hope that this algorithm will eventually become the key
component within a large, distributed immune system, based on sound
immunological concepts.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 13:52:32 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
],
[
"Cayzer",
"Steve",
""
]
] |
new_dataset
| 0.99963 |
1006.1512
|
Uwe Aickelin
|
Julie Greensmith, Uwe Aickelin
|
The Deterministic Dendritic Cell Algorithm
|
12 pages, 1 algorithm, 1 figure, 2 tables, 7th International
Conference on Artificial Immune Systems (ICARIS 2008)
|
Proceedings of the 7th International Conference on Artificial
Immune Systems (ICARIS 2008), Phuket, Thailand, p 291-303
| null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inally
based on the function of natural dendritic cells. The original instantiation of
the algorithm is a highly stochastic algorithm. While the performance of the
algorithm is good when applied to large real-time datasets, it is difficult to
anal- yse due to the number of random-based elements. In this paper a
deterministic version of the algorithm is proposed, implemented and tested
using a port scan dataset to provide a controllable system. This version
consists of a controllable amount of parameters, which are experimented with in
this paper. In addition the effects are examined of the use of time windows and
variation on the number of cells, both which are shown to influence the
algorithm. Finally a novel metric for the assessment of the algorithms output
is introduced and proves to be a more sensitive metric than the metric used
with the original Dendritic Cell Algorithm.
|
[
{
"version": "v1",
"created": "Tue, 8 Jun 2010 10:07:34 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.998915 |
1006.5008
|
Uwe Aickelin
|
Julie Greensmith, Uwe Aickelin, Steve Cayzer
|
Detecting Danger: The Dendritic Cell Algorithm
|
27 pages, 8 figures, Robust Intelligent Systems
|
Robust Intelligent Systems, 12, p 89-112, 2008
| null | null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Dendritic Cell Algorithm (DCA) is inspired by the function of the
dendritic cells of the human immune system. In nature, dendritic cells are the
intrusion detection agents of the human body, policing the tissue and organs
for potential invaders in the form of pathogens. In this research, and abstract
model of DC behaviour is developed and subsequently used to form an algorithm,
the DCA. The abstraction process was facilitated through close collaboration
with laboratory- based immunologists, who performed bespoke experiments, the
results of which are used as an integral part of this algorithm. The DCA is a
population based algorithm, with each agent in the system represented as an
'artificial DC'. Each DC has the ability to combine multiple data streams and
can add context to data suspected as anomalous. In this chapter the abstraction
process and details of the resultant algorithm are given. The algorithm is
applied to numerous intrusion detection problems in computer security including
the detection of port scans and botnets, where it has produced impressive
results with relatively low rates of false positives.
|
[
{
"version": "v1",
"created": "Fri, 25 Jun 2010 15:30:45 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
],
[
"Cayzer",
"Steve",
""
]
] |
new_dataset
| 0.999098 |
1007.0267
|
Onur Sahin
|
Onur Sahin, Osvaldo Simeone, Elza Erkip
|
Interference Channel with an Out-of-Band Relay
|
52 pages, 12 figures, revised version for IT Transactions
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Gaussian interference channel (IC) with a relay is considered. The relay is
assumed to operate over an orthogonal band with respect to the underlying IC,
and the overall system is referred to as IC with an out-of-band relay (IC-OBR).
The system can be seen as operating over two parallel interference-limited
channels: The first is a standard Gaussian IC and the second is a Gaussian
relay channel characterized by two sources and destinations communicating
through the relay without direct links. We refer to the second parallel channel
as OBR Channel (OBRC). The main aim of this work is to identify conditions
under which optimal operation, in terms of the capacity region of the IC-OBR,
entails either signal relaying and/or interference forwarding by the relay,
with either a separable or non-separable use of the two parallel channels, IC
and OBRC. Here "separable" refers to transmission of independent information
over the two constituent channels. For a basic model in which the OBRC consists
of four orthogonal channels from sources to relay and from relay to
destinations (IC-OBR Type-I), a condition is identified under which signal
relaying and separable operation is optimal. When this condition is not
satisfied, various scenarios are identified in which interference forwarding
and non-separable operation are necessary to achieve optimal performance. In
these scenarios, the system exploits the "excess capacity" on the OBRC via
interference forwarding to drive the IC-OBR system in specific interference
regimes (strong or mixed). The analysis is then turned to a more complex
IC-OBR, in which the OBRC consists of only two orthogonal channels, one from
sources to relay and one from relay to destinations (IC-OBR Type-II). For this
channel, some capacity resuls are derived that parallel the conclusions for
IC-OBR Type-I.
|
[
{
"version": "v1",
"created": "Thu, 1 Jul 2010 20:56:46 GMT"
}
] | 2010-07-05T00:00:00 |
[
[
"Sahin",
"Onur",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.996474 |
1007.0050
|
R. J. Sobie
|
P. Armstrong, A. Agarwal, A. Bishop, A. Charbonneau, R. Desmarais, K.
Fransham, N. Hill, I. Gable, S. Gaudet, S. Goliath, R. Impey, C.
Leavett-Brown, J. Ouellete, M. Paterson, C. Pritchet, D. Penfold-Brown, W.
Podaima, D. Schade, R.J. Sobie
|
Cloud Scheduler: a resource manager for distributed compute clouds
|
10 pages, 1 figure
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The availability of Infrastructure-as-a-Service (IaaS) computing clouds gives
researchers access to a large set of new resources for running complex
scientific applications. However, exploiting cloud resources for large numbers
of jobs requires significant effort and expertise. In order to make it simple
and transparent for researchers to deploy their applications, we have developed
a virtual machine resource manager (Cloud Scheduler) for distributed compute
clouds. Cloud Scheduler boots and manages the user-customized virtual machines
in response to a user's job submission. We describe the motivation and design
of the Cloud Scheduler and present results on its use on both science and
commercial clouds.
|
[
{
"version": "v1",
"created": "Wed, 30 Jun 2010 23:54:01 GMT"
}
] | 2010-07-02T00:00:00 |
[
[
"Armstrong",
"P.",
""
],
[
"Agarwal",
"A.",
""
],
[
"Bishop",
"A.",
""
],
[
"Charbonneau",
"A.",
""
],
[
"Desmarais",
"R.",
""
],
[
"Fransham",
"K.",
""
],
[
"Hill",
"N.",
""
],
[
"Gable",
"I.",
""
],
[
"Gaudet",
"S.",
""
],
[
"Goliath",
"S.",
""
],
[
"Impey",
"R.",
""
],
[
"Leavett-Brown",
"C.",
""
],
[
"Ouellete",
"J.",
""
],
[
"Paterson",
"M.",
""
],
[
"Pritchet",
"C.",
""
],
[
"Penfold-Brown",
"D.",
""
],
[
"Podaima",
"W.",
""
],
[
"Schade",
"D.",
""
],
[
"Sobie",
"R. J.",
""
]
] |
new_dataset
| 0.998601 |
1007.0126
|
Mubashir Husain Rehmani
|
Mubashir Husain Rehmani, Aline Carneiro Viana, Hicham Khalife, and
Serge Fdida
|
A Cognitive Radio Based Internet Access Framework for Disaster Response
Network Deployment
| null | null | null |
INRIA Research Report RR-7285, May 2010
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a cognitive radio based Internet access framework
for disaster response network deployment in challenged environments. The
proposed architectural framework is designed to help the existent but partially
damaged networks to restore their connectivity and to connect them to the
global Internet. This architectural framework provides the basis to develop
algorithms and protocols for the future cognitive radio network deployments in
challenged environments.
|
[
{
"version": "v1",
"created": "Thu, 1 Jul 2010 10:42:11 GMT"
}
] | 2010-07-02T00:00:00 |
[
[
"Rehmani",
"Mubashir Husain",
""
],
[
"Viana",
"Aline Carneiro",
""
],
[
"Khalife",
"Hicham",
""
],
[
"Fdida",
"Serge",
""
]
] |
new_dataset
| 0.988262 |
0707.0556
|
Roberto Amadio
|
Roberto Amadio (PPS), Mehdi Dogguy (PPS)
|
Determinacy in a synchronous pi-calculus
|
To appear in the book `From semantics to computer science: essays in
honor of Gilles Kahn', Cambridge University Press
|
From semantics to computer science: essays in honor of Gilles
Kahn, Y. Bertot et al. (Ed.) (2009) 1-27
| null | null |
cs.LO
| null |
The S-pi-calculus is a synchronous pi-calculus which is based on the SL
model. The latter is a relaxation of the Esterel model where the reaction to
the absence of a signal within an instant can only happen at the next instant.
In the present work, we present and characterise a compositional semantics of
the S-pi-calculus based on suitable notions of labelled transition system and
bisimulation. Based on this semantic framework, we explore the notion of
determinacy and the related one of (local) confluence.
|
[
{
"version": "v1",
"created": "Wed, 4 Jul 2007 08:12:17 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Feb 2008 18:58:19 GMT"
}
] | 2010-07-01T00:00:00 |
[
[
"Amadio",
"Roberto",
"",
"PPS"
],
[
"Dogguy",
"Mehdi",
"",
"PPS"
]
] |
new_dataset
| 0.991498 |
1004.4431
|
Georg Hager
|
Jan Treibig, Georg Hager, Gerhard Wellein
|
LIKWID: A lightweight performance-oriented tool suite for x86 multicore
environments
|
10 pages, 11 figures. Some clarifications and corrections
| null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exploiting the performance of today's processors requires intimate knowledge
of the microarchitecture as well as an awareness of the ever-growing complexity
in thread and cache topology. LIKWID is a set of command-line utilities that
addresses four key problems: Probing the thread and cache topology of a
shared-memory node, enforcing thread-core affinity on a program, measuring
performance counter metrics, and toggling hardware prefetchers. An API for
using the performance counting features from user code is also included. We
clearly state the differences to the widely used PAPI interface. To demonstrate
the capabilities of the tool set we show the influence of thread pinning on
performance using the well-known OpenMP STREAM triad benchmark, and use the
affinity and hardware counter tools to study the performance of a stencil code
specifically optimized to utilize shared caches on multicore chips.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 08:33:25 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Apr 2010 10:39:17 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Jun 2010 13:08:39 GMT"
}
] | 2010-07-01T00:00:00 |
[
[
"Treibig",
"Jan",
""
],
[
"Hager",
"Georg",
""
],
[
"Wellein",
"Gerhard",
""
]
] |
new_dataset
| 0.999291 |
1005.4034
|
Debotosh Bhattacharjee
|
Santanu Halder, Debotosh Bhattacharjee, Mita Nasipuri, Dipak Kumar
Basu and Mahantapas Kundu
|
Face Synthesis (FASY) System for Generation of a Face Image from Human
Description
| null |
ICIIS 2008
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims at generating a new face based on the human like description
using a new concept. The FASY (FAce SYnthesis) System is a Face Database
Retrieval and new Face generation System that is under development. One of its
main features is the generation of the requested face when it is not found in
the existing database, which allows a continuous growing of the database also.
|
[
{
"version": "v1",
"created": "Fri, 21 May 2010 18:03:44 GMT"
}
] | 2010-07-01T00:00:00 |
[
[
"Halder",
"Santanu",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"Dipak Kumar",
""
],
[
"Kundu",
"Mahantapas",
""
]
] |
new_dataset
| 0.96565 |
1006.5901
|
Ashish Khisti
|
Ashish Khisti
|
Secret key agreement on wiretap channels with transmitter side
information
|
Presented at European Wireless 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secret-key agreement protocols over wiretap channels controlled by a state
parameter are studied. The entire state sequence is known (non-causally) to the
sender but not to the receiver and the eavesdropper. Upper and lower bounds on
the secret-key capacity are established both with and without public
discussion. The proposed coding scheme involves constructing a codebook to
create common reconstruction of the state sequence at the sender and the
receiver and another secret-key codebook constructed by random binning. For the
special case of Gaussian channels, with no public discussion, - the secret-key
generation with dirty paper problem, the gap between our bounds is at-most 1/2
bit and the bounds coincide in the high signal-to-noise ratio and high
interference-to-noise ratio regimes. In the presence of public discussion our
bounds coincide, yielding the capacity, when then the channels of the receiver
and the eavesdropper satisfy an in- dependent noise condition.
|
[
{
"version": "v1",
"created": "Wed, 30 Jun 2010 16:07:52 GMT"
}
] | 2010-07-01T00:00:00 |
[
[
"Khisti",
"Ashish",
""
]
] |
new_dataset
| 0.998887 |
1006.5908
|
Debotosh Bhattacharjee
|
Sandhya Arora, Debotosh Bhattacharjee, Mita Nasipuri, D. K. Basu, and
M. Kundu
|
Recognition of Non-Compound Handwritten Devnagari Characters using a
Combination of MLP and Minimum Edit Distance
| null |
IJCSS 4(1): 107-120 (2010)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with a new method for recognition of offline Handwritten
non-compound Devnagari Characters in two stages. It uses two well known and
established pattern recognition techniques: one using neural networks and the
other one using minimum edit distance. Each of these techniques is applied on
different sets of characters for recognition. In the first stage, two sets of
features are computed and two classifiers are applied to get higher recognition
accuracy. Two MLP's are used separately to recognize the characters. For one of
the MLP's the characters are represented with their shadow features and for the
other chain code histogram feature is used. The decision of both MLP's is
combined using weighted majority scheme. Top three results produced by combined
MLP's in the first stage are used to calculate the relative difference values.
In the second stage, based on these relative differences character set is
divided into two. First set consists of the characters with distinct shapes and
second set consists of confused characters, which appear very similar in
shapes. Characters of distinct shapes of first set are classified using MLP.
Confused characters in second set are classified using minimum edit distance
method. Method of minimum edit distance makes use of corner detected in a
character image using modified Harris corner detection technique. Experiment on
this method is carried out on a database of 7154 samples. The overall
recognition is found to be 90.74%.
|
[
{
"version": "v1",
"created": "Wed, 30 Jun 2010 16:25:21 GMT"
}
] | 2010-07-01T00:00:00 |
[
[
"Arora",
"Sandhya",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"D. K.",
""
],
[
"Kundu",
"M.",
""
]
] |
new_dataset
| 0.988998 |
1001.2101
|
Jouni Sir\'en
|
Jouni Sir\'en
|
Sampled Longest Common Prefix Array
|
This is a slightly extended version of the paper that was presented
at CPM 2010. The implementation is available at
http://www.cs.helsinki.fi/group/suds/rlcsa/
| null |
10.1007/978-3-642-13509-5_21
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When augmented with the longest common prefix (LCP) array and some other
structures, the suffix array can solve many string processing problems in
optimal time and space. A compressed representation of the LCP array is also
one of the main building blocks in many compressed suffix tree proposals. In
this paper, we describe a new compressed LCP representation: the sampled LCP
array. We show that when used with a compressed suffix array (CSA), the sampled
LCP array often offers better time/space trade-offs than the existing
alternatives. We also show how to construct the compressed representations of
the LCP array directly from a CSA.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 09:18:24 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Mar 2010 16:18:11 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Jun 2010 11:07:23 GMT"
}
] | 2010-06-30T00:00:00 |
[
[
"Sirén",
"Jouni",
""
]
] |
new_dataset
| 0.998711 |
1006.5047
|
Santosh Singh
|
Santosh Kumar Singh
|
Cognitive radio ad hoc networks (CRAHNs): Cognitive radio ad hoc
networks (CRAHNs): Resource allocation techniques based on Bio-inspired
computing
|
This paper has been withdrawn by the author due to a crucial sign
error in equation 1
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum is a scarce commodity, and considering the spectrum scarcity faced
by the wireless-based service providers led to high congestion levels.
Technical inefficiencies from pooled spectrum (this is nothing but the "common
carrier principle" adopted in oil/gas/electricity pipelines/networks.), since
all ad hoc networks share a common pool of channels, exhausting the available
channels will force ad hoc networks to block the services. Researchers found
that cognitive radio (CR) technology may resolve the spectrum scarcity. CR
network proved to next generation wireless communication system that proposed
as a way to reuse under-utilised spectrum of licensee user (primary network) in
an opportunistic and non-interfering basis. A CR is a self-configuring entity
in a wireless networking that senses its environment, tracks changes, and
frequently exchanges information with their networks. Adding this layer of such
intelligence to the ad hoc network by looking at the overall geography of the
network known as cognitive radio ad hoc networks (CRAHNs). However, CRAHN
facing challenges and condition become worst while tracks changes i.e.
reallocation of another under-utilised channels while primary network user
arrives. In this paper, channels or resource reallocation technique based on
bio-inspired computing algorithm for CRAHN has been proposed.
|
[
{
"version": "v1",
"created": "Fri, 25 Jun 2010 19:26:02 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Jun 2010 15:24:20 GMT"
}
] | 2010-06-30T00:00:00 |
[
[
"Singh",
"Santosh Kumar",
""
]
] |
new_dataset
| 0.981722 |
1006.5572
|
Hiroaki Inoue
|
Hiroaki Inoue
|
A Multi-Core Processor Platform for Open Embedded Systems
|
A dissertation presented to the graduate school of science and
technology of Keio University in candidacy for the degree of Doctor of
Philosophy in Engineering, September 2009
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent proliferation of embedded systems has generated a bold new paradigm,
known as open embedded systems. While traditional embedded systems provide only
closed base applications (natively-installed software) to users, open embedded
systems allow the users to freely execute open applications
(additionally-installed software) in order to meet various user requirements,
such as user personalization and device coordination. Key to the success of
platforms required for open embedded systems is the achievement of both the
scalable extension of base applications and the secure execution of open
applications. Most existing platforms, however, have focused on either scalable
or secure execution, limiting their applicability. This dissertation presents a
new secure platform using multi-core processors, which achieves both
scalability and security. Four techniques feature the new platform: (1)
seamless communication, by which legacy applications designed for a single
processor make it possible to be executed on multiple processors without any
software modifications; (2) secure processor partitioning with hardware
support, by which Operating Systems (OSs) required for base and open
applications are securely executed on separate processors; (3) asymmetric
virtualization, by which many OSs over the number of processors are securely
executed under secure processor partitioning; and (4) secure dynamic
partitioning, by which the number of processors allocated to individual OSs
makes it possible to be dynamically changed under secure processor
partitioning.
|
[
{
"version": "v1",
"created": "Tue, 29 Jun 2010 11:35:55 GMT"
}
] | 2010-06-30T00:00:00 |
[
[
"Inoue",
"Hiroaki",
""
]
] |
new_dataset
| 0.979169 |
1006.5381
|
Catalin Anghel Mr
|
Catalin Anghel
|
Cresterea securitatii sistemelor informatice si de comunicatii prin
criptografia cuantica
|
24 pag
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Catch 22 of cryptography - "Before two parties can communicate in secret,
they must first communicate in secret". The weakness of classical cryptographic
communication systems is that secret communication can only take place after a
key is communicated in secret over a totally secure communication channel. Here
comes quantum key distribution which takes advantage of certain phenomena that
occur at the subatomic level, so that any attempt by an enemy to obtain the
bits in a key not only fails, but gets detected as well.
|
[
{
"version": "v1",
"created": "Mon, 28 Jun 2010 15:45:25 GMT"
}
] | 2010-06-29T00:00:00 |
[
[
"Anghel",
"Catalin",
""
]
] |
new_dataset
| 0.999178 |
1006.4104
|
Michael Domaratzki
|
Michael Domaratzki, Narad Rampersad
|
Abelian Primitive Words
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate Abelian primitive words, which are words that are not Abelian
powers. We show that unlike classical primitive words, the set of Abelian
primitive words is not context-free. We can determine whether a word is Abelian
primitive in linear time. Also different from classical primitive words, we
find that a word may have more than one Abelian root. We also consider
enumeration problems and the relation to the theory of codes.
|
[
{
"version": "v1",
"created": "Mon, 21 Jun 2010 16:01:24 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Jun 2010 16:53:29 GMT"
}
] | 2010-06-25T00:00:00 |
[
[
"Domaratzki",
"Michael",
""
],
[
"Rampersad",
"Narad",
""
]
] |
new_dataset
| 0.994001 |
1006.4832
|
Kristiaan Pelckmans
|
Kristiaan Pelckmans
|
MINLIP for the Identification of Monotone Wiener Systems
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the MINLIP estimator for the identification of Wiener
systems consisting of a sequence of a linear FIR dynamical model, and a
monotonically increasing (or decreasing) static function. Given $T$
observations, this algorithm boils down to solving a convex quadratic program
with $O(T)$ variables and inequality constraints, implementing an inference
technique which is based entirely on model complexity control. The resulting
estimates of the linear submodel are found to be almost consistent when no
noise is present in the data, under a condition of smoothness of the true
nonlinearity and local Persistency of Excitation (local PE) of the data. This
result is novel as it does not rely on classical tools as a 'linearization'
using a Taylor decomposition, nor exploits stochastic properties of the data.
It is indicated how to extend the method to cope with noisy data, and empirical
evidence contrasts performance of the estimator against other recently proposed
techniques.
|
[
{
"version": "v1",
"created": "Thu, 24 Jun 2010 16:42:38 GMT"
}
] | 2010-06-25T00:00:00 |
[
[
"Pelckmans",
"Kristiaan",
""
]
] |
new_dataset
| 0.985482 |
1006.4833
|
Graham Kirby
|
Graham Kirby, Evangelos Zirintsis, Alan Dearle, Ron Morrison
|
A Generic Storage API
|
Submitted to ACSC 2004
| null | null |
University of St Andrews CS/03/2
|
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a generic API suitable for provision of highly generic storage
facilities that can be tailored to produce various individually customised
storage infrastructures. The paper identifies a candidate set of minimal
storage system building blocks, which are sufficiently simple to avoid
encapsulating policy where it cannot be customised by applications, and
composable to build highly flexible storage architectures. Four main generic
components are defined: the store, the namer, the caster and the interpreter.
It is hypothesised that these are sufficiently general that they could act as
building blocks for any information storage and retrieval system. The essential
characteristics of each are defined by an interface, which may be implemented
by multiple implementing classes.
|
[
{
"version": "v1",
"created": "Thu, 24 Jun 2010 16:47:28 GMT"
}
] | 2010-06-25T00:00:00 |
[
[
"Kirby",
"Graham",
""
],
[
"Zirintsis",
"Evangelos",
""
],
[
"Dearle",
"Alan",
""
],
[
"Morrison",
"Ron",
""
]
] |
new_dataset
| 0.995129 |
1006.4408
|
Ying Jun Zhang Ph.D.
|
Ying Jun (Angela) Zhang, Pengxuan Zheng, Soung Chang Liew
|
How Does Multiple-Packet Reception Capability Scale the Performance of
Wireless Local Area Networks?
| null |
IEEE Transactions on Mobile Computing, July 2009
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thanks to its simplicity and cost efficiency, wireless local area network
(WLAN) enjoys unique advantages in providing high-speed and low-cost wireless
services in hot spots and indoor environments. Traditional WLAN
medium-access-control (MAC) protocols assume that only one station can transmit
at a time: simultaneous transmissions of more than one station cause the
destruction of all packets involved. By exploiting recent advances in PHY-layer
multiuser detection (MUD) techniques, it is possible for a receiver to receive
multiple packets simultaneously. This paper argues that such multipacket
reception (MPR) capability can greatly enhance the capacity of future WLANs. In
addition, the paper provides the MAC-layer and PHY-layer designs needed to
achieve the improved capacity. First, to demonstrate MPR as a powerful
capacity-enhancement technique, we prove a "super-linearity" result, which
states that the system throughput per unit cost increases as the MPR capability
increases. Second, we show that the commonly deployed binary exponential
backoff (BEB) algorithm in today's WLAN MAC may not be optimal in an MPR
system, and that the optimal backoff factor increases with the MPR capability,
the number of packets that can be received simultaneously. Third, based on the
above insights, we design a joint MAC-PHY layer protocol for an IEEE
802.11-like WLAN that incorporates advanced PHY-layer signal processing
techniques to implement MPR.
|
[
{
"version": "v1",
"created": "Wed, 23 Jun 2010 02:39:44 GMT"
}
] | 2010-06-24T00:00:00 |
[
[
"Jun",
"Ying",
"",
"Angela"
],
[
"Zhang",
"",
""
],
[
"Zheng",
"Pengxuan",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.99574 |
1006.4545
|
William Jackson
|
Jeherul Islam and P. K. Singh
|
CORMEN: Coding-Aware Opportunistic Routing in Wireless Mess Network
|
IEEE Publication Format,
https://sites.google.com/site/journalofcomputing/
|
Journal of Computing, Vol. 2, No. 6, June 2010, NY, USA, ISSN
2151-9617
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These Network Coding improves the network operation beyond the traditional
routing or store-and-forward, by mixing of data stream within a network.
Network coding techniques explicitly minimizes the total no of transmission in
wireless network. The Coding-aware routing maximizes the coding opportunity by
finding the coding possible path for every packet in the network. Here we
propose CORMEN: a new coding-aware routing mechanism based on opportunistic
routing. In CORMEN, every node independently can take the decision whether to
code packets or not and forwarding of packets is based on the coding
opportunity available.
|
[
{
"version": "v1",
"created": "Wed, 23 Jun 2010 15:03:44 GMT"
}
] | 2010-06-24T00:00:00 |
[
[
"Islam",
"Jeherul",
""
],
[
"Singh",
"P. K.",
""
]
] |
new_dataset
| 0.998102 |
1006.4326
|
Hasan Guclu
|
Evsen Yanmaz and Hasan Guclu
|
Stationary and Mobile Target Detection using Mobile Wireless Sensor
Networks
|
7 pages, 12 figures, appeared in INFOCOM 2010
|
Proc. INFOCOM IEEE Conference on Computer Communications 2010, p.
1
|
10.1109/INFCOMW.2010.5466620
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study the target detection and tracking problem in mobile
sensor networks, where the performance metrics of interest are probability of
detection and tracking coverage, when the target can be stationary or mobile
and its duration is finite. We propose a physical coverage-based mobility
model, where the mobile sensor nodes move such that the overlap between the
covered areas by different mobile nodes is small. It is shown that for
stationary target scenario the proposed mobility model can achieve a desired
detection probability with a significantly lower number of mobile nodes
especially when the detection requirements are highly stringent. Similarly,
when the target is mobile the coverage-based mobility model produces a
consistently higher detection probability compared to other models under
investigation.
|
[
{
"version": "v1",
"created": "Tue, 22 Jun 2010 16:37:01 GMT"
}
] | 2010-06-23T00:00:00 |
[
[
"Yanmaz",
"Evsen",
""
],
[
"Guclu",
"Hasan",
""
]
] |
new_dataset
| 0.953494 |
1006.4357
|
Nitish Korula
|
Chandra Chekuri and Alina Ene and Nitish Korula
|
Prize-Collecting Steiner Tree and Forest in Planar Graphs
|
24 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We obtain polynomial-time approximation-preserving reductions (up to a factor
of 1 + \epsilon) from the prize-collecting Steiner tree and prize-collecting
Steiner forest problems in planar graphs to the corresponding problems in
graphs of bounded treewidth. We also give an exact algorithm for the
prize-collecting Steiner tree problem that runs in polynomial time for graphs
of bounded treewidth. This, combined with our reductions, yields a PTAS for the
prize-collecting Steiner tree problem in planar graphs and generalizes the PTAS
of Borradaile, Klein and Mathieu for the Steiner tree problem in planar graphs.
Our results build upon the ideas of Borradaile, Klein and Mathieu and the work
of Bateni, Hajiaghayi and Marx on a PTAS for the Steiner forest problem in
planar graphs. Our main technical result is on the properties of primal-dual
algorithms for Steiner tree and forest problems in general graphs when they are
run with scaled up penalties.
|
[
{
"version": "v1",
"created": "Tue, 22 Jun 2010 19:53:58 GMT"
}
] | 2010-06-23T00:00:00 |
[
[
"Chekuri",
"Chandra",
""
],
[
"Ene",
"Alina",
""
],
[
"Korula",
"Nitish",
""
]
] |
new_dataset
| 0.992319 |
cs/0509035
|
Shujun Li Dr.
|
Shujun Li, Guanrong Chen, Albert Cheung and Kwok-Tung Lo
|
Cryptanalysis of an MPEG-Video Encryption Scheme Based on Secret Huffman
Tables
|
8 pages, 4 figures
|
Advances in Image and Video Technology - Third Pacific Rim
Symposium, PSIVT 2009, Tokyo, Japan, January 13-16, 2009. Proceedings,
Lecture Notes in Computer Science, vol. 5414, pp. 898-909, 2009
|
10.1007/978-3-540-92957-4_78
| null |
cs.MM cs.CR
| null |
This paper studies the security of a recently-proposed MPEG-video encryption
scheme based on secret Huffman tables. Our cryptanalysis shows that: 1) the key
space of the encryption scheme is not sufficiently large against
divide-and-conquer (DAC) attack and known-plaintext attack; 2) it is possible
to decrypt a cipher-video with a partially-known key, thus dramatically
reducing the complexity of the DAC brute-force attack in some cases; 3) its
security against the chosen-plaintext attack is very weak. Some experimental
results are included to support the cryptanalytic results with a brief discuss
on how to improve this MPEG-video encryption scheme.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2005 10:44:31 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Oct 2007 15:45:10 GMT"
}
] | 2010-06-23T00:00:00 |
[
[
"Li",
"Shujun",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Cheung",
"Albert",
""
],
[
"Lo",
"Kwok-Tung",
""
]
] |
new_dataset
| 0.988255 |
0904.1923
|
Vincent Limouzy
|
Vincent Limouzy
|
Seidel Minor, Permutation Graphs and Combinatorial Properties
|
submitted
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A permutation graph is an intersection graph of segments lying between two
parallel lines. A Seidel complementation of a finite graph at one of it vertex
$v$ consists to complement the edges between the neighborhood and the
non-neighborhood of $v$. Two graphs are Seidel complement equivalent if one can
be obtained from the other by a successive application of Seidel
complementation.
In this paper we introduce the new concept of Seidel complementation and
Seidel minor, we then show that this operation preserves cographs and the
structure of modular decomposition. The main contribution of this paper is to
provide a new and succinct characterization of permutation graphs i.e. A graph
is a permutation graph \Iff it does not contain the following graphs: $C_5$,
$C_7$, $XF_{6}^{2}$, $XF_{5}^{2n+3}$, $C_{2n}, n\geqslant6$ and their
complement as Seidel minor. In addition we provide a $O(n+m)$-time algorithm to
output one of the forbidden Seidel minor if the graph is not a permutation
graph.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2009 07:23:18 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Jun 2010 15:18:06 GMT"
}
] | 2010-06-22T00:00:00 |
[
[
"Limouzy",
"Vincent",
""
]
] |
new_dataset
| 0.999707 |
0906.4618
|
Pedro Peris-Lopez
|
Pedro Peris-Lopez, Julio C. Hernandez-Castro, Christos Dimitrakakis,
Aikaterini Mitrokotsa, Juan M. E. Tapiador
|
Shedding Light on RFID Distance Bounding Protocols and Terrorist Fraud
Attacks
|
31 pages, 10 figures, 1 table
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vast majority of RFID authentication protocols assume the proximity
between readers and tags due to the limited range of the radio channel.
However, in real scenarios an intruder can be located between the prover (tag)
and the verifier (reader) and trick this last one into thinking that the prover
is in close proximity. This attack is generally known as a relay attack in
which scope distance fraud, mafia fraud and terrorist attacks are included.
Distance bounding protocols represent a promising countermeasure to hinder
relay attacks. Several protocols have been proposed during the last years but
vulnerabilities of major or minor relevance have been identified in most of
them. In 2008, Kim et al. [1] proposed a new distance bounding protocol with
the objective of being the best in terms of security, privacy, tag
computational overhead and fault tolerance. In this paper, we analyze this
protocol and we present a passive full disclosure attack, which allows an
adversary to discover the long-term secret key of the tag. The presented attack
is very relevant, since no security objectives are met in Kim et al.'s
protocol. Then, design guidelines are introduced with the aim of facilitating
protocol designers the stimulating task of designing secure and efficient
schemes against relay attacks. Finally a new protocol, named Hitomi and
inspired by [1], is designed conforming the guidelines proposed previously.
|
[
{
"version": "v1",
"created": "Thu, 25 Jun 2009 07:12:26 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Jun 2010 19:35:19 GMT"
}
] | 2010-06-22T00:00:00 |
[
[
"Peris-Lopez",
"Pedro",
""
],
[
"Hernandez-Castro",
"Julio C.",
""
],
[
"Dimitrakakis",
"Christos",
""
],
[
"Mitrokotsa",
"Aikaterini",
""
],
[
"Tapiador",
"Juan M. E.",
""
]
] |
new_dataset
| 0.952649 |
1006.3039
|
Martin Sulzmann
|
Edmund S. L. Lam and Martin Sulzmann
|
Concurrent Goal-Based Execution of Constraint Handling Rules
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(To appear in Theory and Practice of Logic Programming (TPLP)) We introduce a
systematic, concurrent execution scheme for Constraint Handling Rules (CHR)
based on a previously proposed sequential goal-based CHR semantics. We
establish strong correspondence results to the abstract CHR semantics, thus
guaranteeing that any answer in the concurrent, goal-based CHR semantics is
reproducible in the abstract CHR semantics. Our work provides the foundation to
obtain efficient, parallel CHR execution schemes.
|
[
{
"version": "v1",
"created": "Tue, 15 Jun 2010 17:44:15 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Jun 2010 19:23:06 GMT"
}
] | 2010-06-22T00:00:00 |
[
[
"Lam",
"Edmund S. L.",
""
],
[
"Sulzmann",
"Martin",
""
]
] |
new_dataset
| 0.969036 |
1006.4030
|
Bin Wu
|
Bin Wu, Guido Masera
|
A Novel VLSI Architecture of Fixed-complexity Sphere Decoder
|
8 pages, this paper has been accepted by the conference DSD 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fixed-complexity Sphere Decoder (FSD) is a recently proposed technique for
Multiple-Input Multiple-Output (MIMO) detection. It has several outstanding
features such as constant throughput and large potential parallelism, which
makes it suitable for efficient VLSI implementation. However, to our best
knowledge, no VLSI implementation of FSD has been reported in the literature,
although some FPGA prototypes of FSD with pipeline architecture have been
developed. These solutions achieve very high throughput but at very high cost
of hardware resources, making them impractical in real applications. In this
paper, we present a novel four-nodes-per-cycle parallel architecture of FSD,
with a breadth-first processing that allows for short critical path. The
implementation achieves a throughput of 213.3 Mbps at 400 MHz clock frequency,
at a cost of 0.18 mm2 Silicon area on 0.13{\mu}m CMOS technology. The proposed
solution is much more economical compared with the existing FPGA
implementations, and very suitable for practicl applications because of its
balanced performance and hardware-complexity; moreover it has the flexibility
to be expanded into an eight-nodes-per-cycle version in order to double the
throughput.
|
[
{
"version": "v1",
"created": "Mon, 21 Jun 2010 10:55:56 GMT"
}
] | 2010-06-22T00:00:00 |
[
[
"Wu",
"Bin",
""
],
[
"Masera",
"Guido",
""
]
] |
new_dataset
| 0.998554 |
1006.3688
|
Stefan Frenzel
|
Stefan Frenzel and Elke Neubert
|
Is the P300 Speller Independent?
|
7 pages, 5 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The P300 speller is being considered as an independent brain-computer
interface. That means it measures the user's intent, and does not require the
user to move any muscles. In particular it should not require eye fixation of
the desired character. However, it has been shown that posterior electrodes
provide significant discriminative information, which is likely related to
visual processing. These findings imply the need for studies controlling the
effect of eye movements. In experiments with a 3x3 character matrix, attention
and eye fixation was directed to different characters. In the event-related
potentials, a P300 occurred for the attended character, and N200 was seen for
the trials showing the focussed character. It occurred at posterior sites,
reaching its peak at 200ms after stimulus onset. The results suggest that gaze
direction plays an important role in P300 speller paradigm. By controlling gaze
direction it is possible to separate voluntary and involuntary EEG responses to
the highlighting of characters.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 18:06:10 GMT"
}
] | 2010-06-21T00:00:00 |
[
[
"Frenzel",
"Stefan",
""
],
[
"Neubert",
"Elke",
""
]
] |
new_dataset
| 0.993854 |
1006.3465
|
Graham Kirby
|
Alan Dearle, Graham Kirby, Stuart Norcross
|
Hosting Byzantine Fault Tolerant Services on a Chord Ring
|
Submitted to DSN 2007 Workshop on Architecting Dependable Systems
| null | null |
University of St Andrews CS/07/1
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we demonstrate how stateful Byzantine Fault Tolerant services
may be hosted on a Chord ring. The strategy presented is fourfold: firstly a
replication scheme that dissociates the maintenance of replicated service state
from ring recovery is developed. Secondly, clients of the ring based services
are made replication aware. Thirdly, a consensus protocol is introduced that
supports the serialization of updates. Finally Byzantine fault tolerant
replication protocols are developed that ensure the integrity of service data
hosted on the ring.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 13:40:59 GMT"
}
] | 2010-06-18T00:00:00 |
[
[
"Dearle",
"Alan",
""
],
[
"Kirby",
"Graham",
""
],
[
"Norcross",
"Stuart",
""
]
] |
new_dataset
| 0.998264 |
1006.3481
|
Graham Kirby
|
Graham Kirby
|
Reflection and Hyper-Programming in Persistent Programming Systems
|
PhD Thesis, University of St Andrews. Supervisor: R. Morrison. (1992)
| null | null | null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work presented in this thesis seeks to improve programmer productivity in
the following ways:
- by reducing the amount of code that has to be written to construct an
application;
- by increasing the reliability of the code written; and
- by improving the programmer's understanding of the persistent environment
in which applications are constructed. Two programming techniques that may be
used to pursue these goals in a persistent environment are type-safe linguistic
reflection and hyper-programming. The first provides a mechanism by which the
programmer can write generators that, when executed, produce new program
representations. This allows the specification of programs that are highly
generic yet depend in non-trivial ways on the types of the data on which they
operate. Genericity promotes software reuse which in turn reduces the amount of
new code that has to be written. Hyper-programming allows a source program to
contain links to data items in the persistent store. This improves program
reliability by allowing certain program checking to be performed earlier than
is otherwise possible. It also reduces the amount of code written by permitting
direct links to data in the place of textual descriptions. Both techniques
contribute to the understanding of the persistent environment through
supporting the implementation of store browsing tools and allowing source
representations to be associated with all executable programs in the persistent
store. This thesis describes in detail the structure of type-safe linguistic
reflection and hyper-programming, their benefits in the persistent context, and
a suite of programming tools that support reflective programming and
hyper-programming. These tools may be used in conjunction to allow reflection
over hyper-program representations. The implementation of the tools is
described.
|
[
{
"version": "v1",
"created": "Thu, 17 Jun 2010 14:37:51 GMT"
}
] | 2010-06-18T00:00:00 |
[
[
"Kirby",
"Graham",
""
]
] |
new_dataset
| 0.999076 |
1001.0716
|
Kamyar Moshksar
|
Kamyar Moshksar, Amir K. Khandani
|
Totally Asynchronous Interference Channels
|
This paper is withdrawn due to some technicality regarding
ergodicity. The corrected version will be submitted under the title
"Randomized On-Off signaling in Asynchronous Wireless Networks"
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses an interference channel consisting of $\mathbf{n}$
active users sharing $u$ frequency sub-bands. Users are asynchronous meaning
there exists a mutual delay between their transmitted codes. A stationary model
for interference is considered by assuming the starting point of an
interferer's data is uniformly distributed along the codeword of any user. The
spectrum is divided to private and common bands each containing
$v_{\mathrm{p}}$ and $v_{\mathrm{c}}$ frequency sub-bands respectively. We
consider a scenario where all transmitters are unaware of the number of active
users and the channel gains. The optimum $v_{\mathrm{p}}$ and $v_{\mathrm{c}}$
are obtained such that the so-called outage capacity per user is maximized. If
$\Pr\{\mathbf{n}\leq 2\}=1$, upper and lower bounds on the mutual information
between the input and output of the channel for each user are derived using a
genie-aided technique. The proposed bounds meet each other as the code length
grows to infinity yielding a closed expression for the achievable rates. If
$\Pr\{\mathbf{n}>2\}>0$, all users follow a locally Randomized On-Off signaling
scheme on the common band where each transmitter quits transmitting its
Gaussian signals independently from transmission to transmission. Using a
conditional version of Entropy Power Inequality (EPI) and an upper bound on the
differential entropy of a mixed Gaussian random variable, lower bounds on the
achievable rates of users are developed. Thereafter, the activation probability
on each transmission slot is designed resulting in the largest outage capacity.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2010 14:56:00 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Jun 2010 02:09:17 GMT"
}
] | 2010-06-17T00:00:00 |
[
[
"Moshksar",
"Kamyar",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.996002 |
1006.3112
|
Alexander Kholosha
|
Tor Helleseth and Alexander Kholosha
|
Sequences, Bent Functions and Jacobsthal sums
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The $p$-ary function $f(x)$ mapping $\mathrm{GF}(p^{4k})$ to $\mathrm{GF}(p)$
and given by $f(x)={\rm Tr}_{4k}\big(ax^d+bx^2\big)$ with
$a,b\in\mathrm{GF}(p^{4k})$ and $d=p^{3k}+p^{2k}-p^k+1$ is studied with the
respect to its exponential sum. In the case when either $a^{p^k(p^k+1)}\neq
b^{p^k+1}$ or $a^2=b^d$ with $b\neq 0$, this sum is shown to be three-valued
and the values are determined. For the remaining cases, the value of the
exponential sum is expressed using Jacobsthal sums of order $p^k+1$. Finding
the values and the distribution of those sums is a long-lasting open problem.
|
[
{
"version": "v1",
"created": "Wed, 16 Jun 2010 00:14:22 GMT"
}
] | 2010-06-17T00:00:00 |
[
[
"Helleseth",
"Tor",
""
],
[
"Kholosha",
"Alexander",
""
]
] |
new_dataset
| 0.973403 |
1006.3180
|
Graham Kirby
|
Angus Macdonald, Alan Dearle, Graham Kirby
|
H2O: An Autonomic, Resource-Aware Distributed Database System
|
Presented at SICSA PhD Conference 2010 (http://www.sicsaconf.org/)
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the design of an autonomic, resource-aware distributed
database which enables data to be backed up and shared without complex manual
administration. The database, H2O, is designed to make use of unused resources
on workstation machines. Creating and maintaining highly-available, replicated
database systems can be difficult for untrained users, and costly for IT
departments. H2O reduces the need for manual administration by autonomically
replicating data and load-balancing across machines in an enterprise.
Provisioning hardware to run a database system can be unnecessarily costly as
most organizations already possess large quantities of idle resources in
workstation machines. H2O is designed to utilize this unused capacity by using
resource availability information to place data and plan queries over
workstation machines that are already being used for other tasks. This paper
discusses the requirements for such a system and presents the design and
implementation of H2O.
|
[
{
"version": "v1",
"created": "Wed, 16 Jun 2010 10:46:04 GMT"
}
] | 2010-06-17T00:00:00 |
[
[
"Macdonald",
"Angus",
""
],
[
"Dearle",
"Alan",
""
],
[
"Kirby",
"Graham",
""
]
] |
new_dataset
| 0.973495 |
1006.3259
|
Serguei Mokhov
|
Serguei A. Mokhov
|
Contents of COMP5541 Winter 2010 Final UUIS SRS and SDD Reports
|
an index
| null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
This index covers the final course project reports for COMP5541 Winter 2010
at Concordia University, Montreal, Canada, Tools and Techniques for Software
Engineering by 4 teams trying to capture the requirements, provide the design
specification, configuration management, testing and quality assurance of their
partial implementation of the Unified University Inventory System (UUIS) of an
Imaginary University of Arctica (IUfA). Their results are posted here for
comparative studies and analysis.
|
[
{
"version": "v1",
"created": "Wed, 16 Jun 2010 16:12:30 GMT"
}
] | 2010-06-17T00:00:00 |
[
[
"Mokhov",
"Serguei A.",
""
]
] |
new_dataset
| 0.9814 |
1006.2977
|
Christine Kelley
|
Christine A. Kelley and Joerg Kliewer
|
Algebraic Constructions of Graph-Based Nested Codes from Protographs
|
5 pages, 2 figures, To appear in 2010 IEEE International Symposium on
Information Theory, Austin, TX, USA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nested codes have been employed in a large number of communication
applications as a specific case of superposition codes, for example to
implement binning schemes in the presence of noise, in joint network-channel
coding, or in physical-layer secrecy. Whereas nested lattice codes have been
proposed recently for continuous-input channels, in this paper we focus on the
construction of nested linear codes for joint channel-network coding problems
based on algebraic protograph LDPC codes. In particular, over the past few
years several constructions of codes have been proposed that are based on
random lifts of suitably chosen base graphs. More recently, an algebraic analog
of this approach was introduced using the theory of voltage graphs. In this
paper we illustrate how these methods can be used in the construction of nested
codes from algebraic lifts of graphs.
|
[
{
"version": "v1",
"created": "Tue, 15 Jun 2010 13:03:31 GMT"
}
] | 2010-06-16T00:00:00 |
[
[
"Kelley",
"Christine A.",
""
],
[
"Kliewer",
"Joerg",
""
]
] |
new_dataset
| 0.994066 |
1006.2691
|
Eswar Karthikeyan
|
S. Ganesh, R. Amutha
|
Real Time and Energy Efficient Transport Protocol for Wireless Sensor
Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reliable transport protocols such as TCP are tuned to perform well in
traditional networks where packet losses occur mostly because of congestion.
Many applications of wireless sensor networks are useful only when connected to
an external network. Previous research on transport layer protocols for sensor
networks has focused on designing protocols specifically targeted for sensor
networks. The deployment of TCP/IP in sensor networks would, however, enable
direct connection between the sensor network and external TCP/IP networks. In
this paper we focus on the performance of TCP in the context of wireless sensor
networks. TCP is known to exhibit poor performance in wireless environments,
both in terms of throughput and energy efficiency. To overcome these problems
we introduce a mechanism called TCP Segment Caching .We show by simulation that
TCP Segment Caching significantly improves TCP Performance so that TCP can be
useful e en in wireless sensor
|
[
{
"version": "v1",
"created": "Mon, 14 Jun 2010 12:26:02 GMT"
}
] | 2010-06-15T00:00:00 |
[
[
"Ganesh",
"S.",
""
],
[
"Amutha",
"R.",
""
]
] |
new_dataset
| 0.998245 |
1006.2702
|
Eswar Karthikeyan
|
R. Sridaran, G. Padmavathi, K. Iyakutti, M.N.S. Mani
|
SPIM Architecture for MVC based Web Applications
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Model / View / Controller design pattern divides an application
environment into three components to handle the user-interactions, computations
and output respectively. This separation greatly favors architectural
reusability. The pattern works well in the case of single-address space and not
proven to be efficient for web applications involving multiple address spaces.
Web applications force the designers to decide which of the components of the
pattern are to be partitioned between the server and client(s) before the
design phase commences. For any rapidly growing web application, it is very
difficult to incorporate future changes in policies related to partitioning.
One solution to this problem is to duplicate the Model and controller
components at both server and client(s). However, this may add further problems
like delayed data fetch, security and scalability issues. In order to overcome
this, a new architecture SPIM has been proposed that deals with the
partitioning problem in an alternative way. SPIM shows tremendous improvements
in performance when compared with a similar architecture.
|
[
{
"version": "v1",
"created": "Mon, 14 Jun 2010 12:53:19 GMT"
}
] | 2010-06-15T00:00:00 |
[
[
"Sridaran",
"R.",
""
],
[
"Padmavathi",
"G.",
""
],
[
"Iyakutti",
"K.",
""
],
[
"Mani",
"M. N. S.",
""
]
] |
new_dataset
| 0.996785 |
1006.2798
|
Jenny Blight
|
Mohd Norzali Haji Mohd, Mohd Helmy Bin Abd Wahab, Siti Khairulnisa
Ariffin
|
Motion Detection Notification System by Short Messaging Service Using
Network Camera and Global System for Mobile Modem
|
Submitted to Journal of Computer Science and Engineering, see
http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010
|
Journal of Computer Science and Engineering, Volume 1, Issue 1,
p18-26, May 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the technology rapidly grows, the trend is clear that the use of mobile
devices is gain an attention nowadays, thus designing a system by integrating
it with notification feature is becoming an important aspect especially in
tracking and monitoring system. Conventional security surveillance systems
require the constant attention from the user, to monitor the location
concurrently. In order to reduce the cost of computing power and advance
technology of mobile phone in widespread acceptance of the Internet as a viable
communication medium, this paper is aimed to design a low cost web-based system
as a platform to view the image captured. When the network camera detects any
movement from the intruders, it automatically captures the image and sends it
to the database of the web-based directly by the network through File Transfer
Protocol (FTP). The camera is attached through an Ethernet connection and power
source. Therefore, the camera can be viewed from either standard Web browser or
cell phone. Nowadays, when a security camera is installed, user is notified as
long as the camera is switched on since any slight movement requires the
attention of the supervisor. The utility of the system has proven
theoretically. This system will also notify the user by sending a notification
through Short Messages Services (SMS).
|
[
{
"version": "v1",
"created": "Mon, 14 Jun 2010 18:47:45 GMT"
}
] | 2010-06-15T00:00:00 |
[
[
"Mohd",
"Mohd Norzali Haji",
""
],
[
"Wahab",
"Mohd Helmy Bin Abd",
""
],
[
"Ariffin",
"Siti Khairulnisa",
""
]
] |
new_dataset
| 0.997525 |
1006.2809
|
Jenny Blight
|
A.A Zaidan, B.B Zaidan, Hamid.A.Jalab, Hamdan.O.Alanazi and Rami
Alnaqeib
|
Offline Arabic Handwriting Recognition Using Artificial Neural Network
|
Submitted to Journal of Computer Science and Engineering, see
http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010
|
Journal of Computer Science and Engineering, Volume 1, Issue 1,
p55-58, May 2010
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ambition of a character recognition system is to transform a text
document typed on paper into a digital format that can be manipulated by word
processor software Unlike other languages, Arabic has unique features, while
other language doesn't have, from this language these are seven or eight
language such as ordo, jewie and Persian writing, Arabic has twenty eight
letters, each of which can be linked in three different ways or separated
depending on the case. The difficulty of the Arabic handwriting recognition is
that, the accuracy of the character recognition which affects on the accuracy
of the word recognition, in additional there is also two or three from for each
character, the suggested solution by using artificial neural network can solve
the problem and overcome the difficulty of Arabic handwriting recognition.
|
[
{
"version": "v1",
"created": "Mon, 14 Jun 2010 19:20:31 GMT"
}
] | 2010-06-15T00:00:00 |
[
[
"Zaidan",
"A. A",
""
],
[
"Zaidan",
"B. B",
""
],
[
"Jalab",
"Hamid. A.",
""
],
[
"Alanazi",
"Hamdan. O.",
""
],
[
"Alnaqeib",
"Rami",
""
]
] |
new_dataset
| 0.987956 |
1006.2811
|
Jenny Blight
|
Ashish Raman, Anvesh Kumar and R.K.Sarin
|
High Speed Reconfigurable FFT Design by Vedic Mathematics
|
Submitted to Journal of Computer Science and Engineering, see
http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010
|
Journal of Computer Science and Engineering, Volume 1, Issue 1,
p59-63, May 2010
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Fast Fourier Transform (FFT) is a computationally intensive digital
signal processing (DSP) function widely used in applications such as imaging,
software-defined radio, wireless communication, instrumentation. In this paper,
a reconfigurable FFT design using Vedic multiplier with high speed and small
area is presented. Urdhava Triyakbhyam algorithm of ancient Indian Vedic
Mathematics is utilized to improve its efficiency. In the proposed
architecture, the 4x4 bit multiplication operation is fragmented reconfigurable
FFT modules. The 4x4 multiplication modules are implemented using small 2x2bit
multipliers. Reconfigurability at run time is provided for attaining power
saving. The reconfigurable FFT has been designed, optimized and implemented on
an FPGA based system. This reconfigurable FFT is having the high speed and
small area as compared to the conventional FFT.
|
[
{
"version": "v1",
"created": "Mon, 14 Jun 2010 19:28:47 GMT"
}
] | 2010-06-15T00:00:00 |
[
[
"Raman",
"Ashish",
""
],
[
"Kumar",
"Anvesh",
""
],
[
"Sarin",
"R. K.",
""
]
] |
new_dataset
| 0.999324 |
1006.1956
|
Rajan Arora
|
Animesh Kr Trivedi, Rajan Arora, Rishi Kapoor, Sudip Sanyal and Sugata
Sanyal
|
A Semi-distributed Reputation Based Intrusion Detection System for
Mobile Adhoc Networks
|
Adhoc Networking, Security, Promiscuous Mode, Reputation Based
Intrusion Detection System
|
Trivedi et al., "A Semi-distributed Reputation Based Intrusion
Detection System for Mobile Adhoc Networks". Journal of Information Assurance
and Security (JIAS), Volume 1, Issue 4, December 2006, pp. 265-274
| null | null |
cs.NI cs.MA
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A Mobile Adhoc Network (MANET) is a cooperative engagement of a collection of
mobile nodes without any centralized access point or infrastructure to
coordinate among the peers. The underlying concept of coordination among nodes
in a cooperative MANET has induced in them a vulnerability to attacks due to
issues like lack of fixed infrastructure, dynamically changing network
topology, cooperative algorithms, lack of centralized monitoring and management
point, and lack of a clear line of defense. We propose a semi-distributed
approach towards Reputation Based Intrusion Detection System (IDS) that
combines with the DSR routing protocol for strengthening the defense of a
MANET. Our system inherits the features of reputation from human behavior,
hence making the IDS socially inspired. It has a semi-distributed architecture
as the critical observation results of the system are neither spread globally
nor restricted locally. The system assigns maximum weightage to self
observation by nodes for updating any reputation values, thus avoiding the need
of a trust relationship between nodes. Our system is also unique in the sense
that it features the concepts of Redemption and Fading with a robust Path
Manager and Monitor system. Simulation studies show that DSR fortified with our
system outperforms normal DSR in terms of the packet delivery ratio and routing
overhead even when up to half of nodes in the network behave as malicious.
Various parameters introduced such as timing window size, reputation update
values, congestion parameter and other thresholds have been optimized over
several simulation test runs of the system. By combining the semi-distributed
architecture and other design essentials like path manager, monitor module,
redemption and fading concepts; Our system proves to be robust enough to
counter most common attacks in MANETs.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 06:03:44 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Jun 2010 08:37:54 GMT"
}
] | 2010-06-14T00:00:00 |
[
[
"Trivedi",
"Animesh Kr",
""
],
[
"Arora",
"Rajan",
""
],
[
"Kapoor",
"Rishi",
""
],
[
"Sanyal",
"Sudip",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.998027 |
1006.2356
|
Carlos Sarraute
|
Diego Bendersky (1 and 2), Ariel Futoransky (1), Luciano
Notarfrancesco (1), Carlos Sarraute (1 and 3), Ariel Waissbein (1 and 3) ((1)
Corelabs, Core Security Technologies, (2) Departamento de Computacion, FCEyN,
Universidad de Buenos Aires, (3) Departamento de Matematica, FCEyN,
Universidad de Buenos Aires)
|
Advanced Software Protection Now
|
20 pages. CoreLabs Technical Report
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Software digital rights management is a pressing need for the software
development industry which remains, as no practical solutions have been
acclamaimed succesful by the industry. We introduce a novel software-protection
method, fully implemented with today's technologies, that provides traitor
tracing and license enforcement and requires no additional hardware nor
inter-connectivity.
Our work benefits from the use of secure triggers, a cryptographic primitive
that is secure assuming the existence of an ind-cpa secure block cipher. Using
our framework, developers may insert license checks and fingerprints, and
obfuscate the code using secure triggers. As a result, this rises the cost that
software analysis tools have detect and modify protection mechanisms. Thus
rising the complexity of cracking this system.
|
[
{
"version": "v1",
"created": "Fri, 11 Jun 2010 17:57:20 GMT"
}
] | 2010-06-14T00:00:00 |
[
[
"Bendersky",
"Diego",
"",
"1 and 2"
],
[
"Futoransky",
"Ariel",
"",
"1 and 3"
],
[
"Notarfrancesco",
"Luciano",
"",
"1 and 3"
],
[
"Sarraute",
"Carlos",
"",
"1 and 3"
],
[
"Waissbein",
"Ariel",
"",
"1 and 3"
]
] |
new_dataset
| 0.954593 |
1006.1704
|
Harco Leslie Hendric Spits Warnars
|
H.L.H Spits Warnars
|
Sistem Pengambilan Keputusan Penanganan Bencana Alam Gempa Bumi Di
Indonesia
|
14 pages
|
Olympic Innovative Paper International Conference (Proceeding
Olimpiade Karya Tulis Inovatif ,OKTI), L'association des Etudiants
Indonesiens en France, Paris, France, 10-11 Oct 2009
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After Aceh's quake many earthquakes have struck Indonesia alternately and
even other disasters have been a threat for every citizen in this country.
Actually an everyday occurrence on earth and more than 3 million earthquakes
occur every year, about 8,000 a day, or one every 11 seconds in Indonesia there
are 5 to 30 quakes prediction everyday. Government's responsibility to protect
the citizen has been done by making National body of disaster management.
Preparing, saving and distribution logistic become National body of disaster
management's responsibility to build information management. Many law's
products have been produced as a government's responsibility to give secure
life for the citizen. We can not prevent them totally, we have to learn to live
with them and need to be prepared all the time, need to learn how to mitigate
risk of losses in such events by managing crisis and emergencies correctly.
After disaster happens respond must be rapidly and at an optimal level to save
lives and help to victims. DSS is information technology environment which can
be used to help human in order to learn from past earthquake, record it, learn
and plan for future mitigation and hope will reduce the disaster risk in the
future. Using web technology for DSS will give value added where not only make
a strategic decision for the decision maker, but for others who need national
earthquake information like citizen, scholars, researches and people around the
world.
|
[
{
"version": "v1",
"created": "Wed, 9 Jun 2010 04:46:25 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jun 2010 02:41:05 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"Warnars",
"H. L. H Spits",
""
]
] |
new_dataset
| 0.99962 |
1006.1993
|
Krzysztof Moskwa
|
Krzysztof Moskwa, Piotr Rossa
|
Rozw\'oj bibliotek cyfrowych i repozytori\'ow elektronicznych na Dolnym
Slasku w latach 2004-2008 / Development of Digital Libraries and Electronic
Repositories in Lower Silesia in Years 2004-2008
|
12 pages in Polish, 4 tables; Komputerowe wspomaganie bada\'n
naukowych XVI / The Computer-Aided Scientific Research XVI
|
Komputerowe wspomaganie badan naukowych XVI = The Computer-Aided
Scientific Research XVI / red. Jan Zarzycki. Wroclaw, 2009. pp. 15-26, 4
tab., Summ. (Prace Wroclawskiego Towarzystwa Naukowego., ISSN 0084-3024; nr
215)
| null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In following elaboration were presented digital libraries and electronic
repositories operating in Lower Silesia region (of Poland) in years 2004-2008.
General description of character and size of their collections was presented,
as well as standards and methods of digital collections management and
juridical aspects of this management. Potential of usage of digital collections
in regional scientific researches was described.
-----
W referacie przedstawiono biblioteki cyfrowe i repozytoria elektroniczne
funkcjonujace na Dolnym Slasku w latach 2004-2008. Scharakteryzowano og\'olnie
ich zawarto\'s\'c i wielko\'s\'c, zaprezentowano standardy i systemy
zarzadzania kolekcjami cyfrowymi oraz om\'owiono uwarunkowania prawne
towarzyszace zarzadzaniu zasobami cyfrowymi. Wskazano mo\.zliwo\'sci
wykorzystania kolekcji cyfrowych w badaniach naukowych realizowanych w
regionie.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 10:25:52 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"Moskwa",
"Krzysztof",
""
],
[
"Rossa",
"Piotr",
""
]
] |
new_dataset
| 0.993101 |
1006.2022
|
Haim Permuter Henry
|
Haim Permuter, Shlomo (Shitz) Shamai, and Anelia Somekh-Baruch
|
Message and state cooperation in multiple access channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the capacity of a multiple access channel with cooperating
encoders where partial state information is known to each encoder and full
state information is known to the decoder. The cooperation between the encoders
has a two-fold purpose: to generate empirical state coordination between the
encoders, and to share information about the private messages that each encoder
has. For two-way cooperation, this two-fold purpose is achieved by
double-binning, where the first layer of binning is used to generate the state
coordination similarly to the two-way source coding, and the second layer of
binning is used to transmit information about the private messages. The
complete result provides the framework and perspective for addressing a complex
level of cooperation that mixes states and messages in an optimal way.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 13:15:44 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"Permuter",
"Haim",
"",
"Shitz"
],
[
"Shlomo",
"",
"",
"Shitz"
],
[
"Shamai",
"",
""
],
[
"Somekh-Baruch",
"Anelia",
""
]
] |
new_dataset
| 0.990169 |
1006.2085
|
Harco Leslie Hendric Spits Warnars
|
Fedro Antonius Pardede, H.L.H Spits Warnars
|
Pemanfaatan Teknologi Sistem Informasi Geografis Untuk Menunjang
Pembangunan Daerah
|
6 pages
|
National seminar University of Budi Luhur 2009, University of Budi
Luhur, Jakarta, 14-15 August 2009
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The territory development will depend on that territory itself, where the
word of autonomy for each province or territory will give contribution how
Indonesian will responsible for development their territory. In order to
develop territory, the information technology can be used as a boost or tools
to give and deliver the best information and Geographic Information System is
one of the information technology tools which can be used to push every each
territory to speed the territory development. As a tool Geographic Information
System has an ability to save, process, analysis and deliver information right
in time and help the decision maker to make better decision.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 17:08:36 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"Pardede",
"Fedro Antonius",
""
],
[
"Warnars",
"H. L. H Spits",
""
]
] |
new_dataset
| 0.999252 |
1006.2104
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars H.L.H
|
Perbandingan Shell Unix
|
21 Pages
|
Widya, Vol 21,No. 230, pp. 9-15, November 2004
| null | null |
cs.OS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Is it possible for an Information Technology [IT] product to be both mature
and state-of-theart at the same time? In the case of the UNIX system, the
answer is an unqualified "Yes." The UNIX system has continued to develop over
the past twenty-five years. In millions of installations running on nearly
every hardware platform made, the UNIX system has earned its reputation for
stability and scalability. Over the years, UNIX system suppliers have steadily
assimilated new technologies so that UNIX systems today provide more
functionality as any other operating system.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 18:13:36 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"H",
"Spits Warnars H. L.",
""
]
] |
new_dataset
| 0.985139 |
1006.2107
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars H.L.H
|
Pembobolan website KPU (Komisi Pemilihan Umum) Apakah melanggar UU RI
no.36 tahun 1999 tentang telekomunikasi ?
|
7 pages
|
Journal Budi Luhur Information Technology (BIT), Vol.2, No.1 April
2005
| null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Information Technology KPU (Indonesia Electoral Commision) is a project in
supporting democratization process in Indonesia. It is a part of General
Election program of KPU-Indonesian Government. The aim of IT KPU is to build
the transparency of the ballot result to the public (citizen and international
world) and as the embrio of e government in Indonesia. It also has the aim for
influence the citizen with Information Technology and the use of computer.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 18:20:45 GMT"
}
] | 2010-06-11T00:00:00 |
[
[
"H",
"Spits Warnars H. L.",
""
]
] |
new_dataset
| 0.998711 |
1003.2554
|
Maurizio Naldi
|
Loretta Mastroeni and Maurizio Naldi
|
Spectrum Trading: An Abstracted Bibliography
| null | null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document contains a bibliographic list of major papers on spectrum
trading and their abstracts. The aim of the list is to offer researchers
entering this field a fast panorama of the current literature. The list is
continually updated on the webpage
\url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers
suggested for inclusion may be pointed out to the authors through e-mail
(\textit{[email protected]}).
|
[
{
"version": "v1",
"created": "Fri, 12 Mar 2010 14:50:25 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Jun 2010 14:10:54 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Mastroeni",
"Loretta",
""
],
[
"Naldi",
"Maurizio",
""
]
] |
new_dataset
| 0.992054 |
1006.1663
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars
|
Tata Kelola Database Perguruan Tinggi Yang Optimal Dengan Data Warehouse
|
10 pages, 12 figures and 4 tables
|
TELKOMNIKA Vol. 8, No. 1, April 2010, pp. 25 - 34
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of new higher education institutions has created the
competition in higher education market, and data warehouse can be used as an
effective technology tools for increasing competitiveness in the higher
education market. Data warehouse produce reliable reports for the institution's
high-level management in short time for faster and better decision making, not
only on increasing the admission number of students, but also on the
possibility to find extraordinary, unconventional funds for the institution.
Efficiency comparison was based on length and amount of processed records,
total processed byte, amount of processed tables, time to run query and
produced record on OLTP database and data warehouse. Efficiency percentages was
measured by the formula for percentage increasing and the average efficiency
percentage of 461.801,04% shows that using data warehouse is more powerful and
efficient rather than using OLTP database. Data warehouse was modeled based on
hypercube which is created by limited high demand reports which usually used by
high level management. In every table of fact and dimension fields will be
inserted which represent the loading constructive merge where the ETL
(Extraction, Transformation and Loading) process is run based on the old and
new files.
|
[
{
"version": "v1",
"created": "Tue, 8 Jun 2010 20:57:02 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Warnars",
"Spits",
""
]
] |
new_dataset
| 0.994469 |
1006.1679
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars
|
Rancangan Infrastruktur E-Bisnis Business Intelligence Pada Perguruan
Tinggi
|
12 pages, 11 figures
|
Telkomnika Vol. 6, No. 2, Agustus 2008 : pp. 115 - 124
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to compete with others, high education need complete their
infrastructure with Information technology support. High level management as a
decision maker need something that can boost the system to compete with other
high education, they need IT knowledge that can support them to view the future
and can help the whole system to improve their services. Business Intelligence
is one of term of Decision Support System which can help the management by
something that they can forecast and decide. High Education need infrastructure
design to make good foundation for business intelligent implementation which
will be implemented on internet or e-business.
|
[
{
"version": "v1",
"created": "Wed, 9 Jun 2010 00:43:41 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Warnars",
"Spits",
""
]
] |
new_dataset
| 0.995639 |
1006.1690
|
Jong-Ho Lee
|
Jong-Ho Lee, Oh-Soon Shin
|
Full-Duplex Relay based on Zero-Forcing Beamforming
|
7 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a full-duplex relay (FDR) based on a zero-forcing
beamforming (ZFBF) for a multiuser MIMO relay system. The ZFBF is employed at
the base station to suppress both the self-interference of the relay and the
multiuser interference at the same time. Numerical results show that the
proposed FDR can enhance the sum rate performance as compared to the
half-duplex relay (HDR), if sufficient isolation between the transmit and
receive antennas is ensured at the relay.
|
[
{
"version": "v1",
"created": "Wed, 9 Jun 2010 02:40:27 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Lee",
"Jong-Ho",
""
],
[
"Shin",
"Oh-Soon",
""
]
] |
new_dataset
| 0.99423 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.