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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1402.3698
|
Iddo Bentov
|
Adam Back and Iddo Bentov
|
Note on fair coin toss via Bitcoin
|
See also https://bitcointalk.org/index.php?topic=277048.0
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this short note we show that the Bitcoin network can allow remote parties
to gamble with their bitcoins by tossing a fair or biased coin, with no need
for a trusted party, and without the possibility of extortion by dishonest
parties who try to abort. The superfluousness of having a trusted party implies
that there is no house edge, as is the case with centralized services that are
supposed to generate a profit.
|
[
{
"version": "v1",
"created": "Sat, 15 Feb 2014 15:10:32 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Back",
"Adam",
""
],
[
"Bentov",
"Iddo",
""
]
] |
new_dataset
| 0.996785 |
1402.3779
|
Nikolaos Mavridis
|
Nikolaos Mavridis, Nicola Bellotto, Konstantinos Iliopoulos, Nico Van
de Weghe
|
QTC3D: Extending the Qualitative Trajectory Calculus to Three Dimensions
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spatial interactions between agents (humans, animals, or machines) carry
information of high value to human or electronic observers. However, not all
the information contained in a pair of continuous trajectories is important and
thus the need for qualitative descriptions of interaction trajectories arises.
The Qualitative Trajectory Calculus (QTC) (Van de Weghe, 2004) is a promising
development towards this goal. Numerous variants of QTC have been proposed in
the past and QTC has been applied towards analyzing various interaction
domains. However, an inherent limitation of those QTC variations that deal with
lateral movements is that they are limited to two-dimensional motion;
therefore, complex three-dimensional interactions, such as those occurring
between flying planes or birds, cannot be captured. Towards that purpose, in
this paper QTC3Dis presented: a novel qualitative trajectory calculus that can
deal with full three-dimensional interactions. QTC3D is based on
transformations of the Frenet-Serret frames accompanying the trajectories of
the moving objects. Apart from the theoretical exposition, including definition
and properties, as well as computational aspects, we also present an
application of QTC3D towards modeling bird flight. Thus, the power of QTC is
now extended to the full dimensionality of physical space, enabling succinct
yet rich representations of spatial interactions between agents.
|
[
{
"version": "v1",
"created": "Sun, 16 Feb 2014 10:05:25 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Mavridis",
"Nikolaos",
""
],
[
"Bellotto",
"Nicola",
""
],
[
"Iliopoulos",
"Konstantinos",
""
],
[
"Van de Weghe",
"Nico",
""
]
] |
new_dataset
| 0.984242 |
1402.3892
|
Nasri Othman
|
Nasri Bin Othman, Erika Fille Legara, Vicknesh Selvam, Christopher
Monterola
|
Simulating Congestion Dynamics of Train Rapid Transit using Smart Card
Data
|
10 pages, 5 figures, submitted to International Conference on
Computational Science 2014
| null | null | null |
cs.MA physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Investigating congestion in train rapid transit systems (RTS) in today's
urban cities is a challenge compounded by limited data availability and
difficulties in model validation. Here, we integrate information from travel
smart card data, a mathematical model of route choice, and a full-scale
agent-based model of the Singapore RTS to provide a more comprehensive
understanding of the congestion dynamics than can be obtained through
analytical modelling alone. Our model is empirically validated, and allows for
close inspection of the dynamics including station crowdedness, average travel
duration, and frequency of missed trains---all highly pertinent factors in
service quality. Using current data, the crowdedness in all 121 stations
appears to be distributed log-normally. In our preliminary scenarios, we
investigate the effect of population growth on service quality. We find that
the current population (2 million) lies below a critical point; and increasing
it beyond a factor of $\sim10\%$ leads to an exponential deterioration in
service quality. We also predict that incentivizing commuters to avoid the most
congested hours can bring modest improvements to the service quality provided
the population remains under the critical point. Finally, our model can be used
to generate simulated data for analytical modelling when such data are not
empirically available, as is often the case.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 05:26:47 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Othman",
"Nasri Bin",
""
],
[
"Legara",
"Erika Fille",
""
],
[
"Selvam",
"Vicknesh",
""
],
[
"Monterola",
"Christopher",
""
]
] |
new_dataset
| 0.997632 |
1402.3982
|
Juhoon Kim
|
Juhoon Kim, Nadi Sarrar, Anja Feldmann
|
Watching the IPv6 Takeoff from an IXP's Viewpoint
|
Also appears as TU-Berlin technical report 2013-01, ISSN: 1436-9915
| null | null |
2014-01 (ISSN: 1436-9915)
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The different level of interest in deploying the new Internet address space
across network operators has kept IPv6 tardy in its deployment. However, since
the last block of IPv4 addresses has been assigned, Internet communities took
the concern of the address space scarcity seriously and started to move forward
actively. After the successful IPv6 test on 8 June, 2011 (World IPv6 Day [1]),
network operators and service/content providers were brought together for
preparing the next step of the IPv6 global deployment (World IPv6 Launch on 6
June, 2012 [2]). The main purpose of the event was to permanently enable their
IPv6 connectivity. In this paper, based on the Internet traffic collected from
a large European Internet Exchange Point (IXP), we present the status of IPv6
traffic mainly focusing on the periods of the two global IPv6 events. Our
results show that IPv6 traffic is responsible for a small fraction such as 0.5
% of the total traffic in the peak period. Nevertheless, we are positively
impressed by the facts that the increase of IPv6 traffic/prefixes shows a steep
increase and that the application mix of IPv6 traffic starts to imitate the one
of IPv4-dominated Internet.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 12:37:50 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Kim",
"Juhoon",
""
],
[
"Sarrar",
"Nadi",
""
],
[
"Feldmann",
"Anja",
""
]
] |
new_dataset
| 0.997515 |
1402.4007
|
Ella Gale
|
Ella Gale, Ben de Lacy Costello and Andrew Adamatzky
|
Does the D.C. Response of Memristors Allow Robotic Short-Term Memory and
a Possible Route to Artificial Time Perception?
|
3 page position paper
|
Workshop on Unconventional Approaches to Robotics, Automation and
Control (UARACIN), at International Conference on Robotics and Automation
(ICRA) 2013, Karlsruhe, Germany, Fr-Ws-09, pgs. 22-24
| null | null |
cs.RO cs.ET cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time perception is essential for task switching, and in the mammalian brain
appears alongside other processes. Memristors are electronic components used as
synapses and as models for neurons. The d.c. response of memristors can be
considered as a type of short-term memory. Interactions of the memristor d.c.
response within networks of memristors leads to the emergence of oscillatory
dynamics and intermittent spike trains, which are similar to neural dynamics.
Based on this data, the structure of a memristor network control for a robot as
it undergoes task switching is discussed and it is suggested that these
emergent network dynamics could improve the performance of role switching and
learning in an artificial intelligence and perhaps create artificial time
perception.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 14:08:57 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Gale",
"Ella",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.979766 |
1402.4013
|
Ella Gale
|
Ella Gale, Ben de Lacy Costello, Victor Erokhin and Andrew Adamatzky
|
The Short-term Memory (D.C. Response) of the Memristor Demonstrates the
Causes of the Memristor Frequency Effect
|
Conference paper, to appear in CASFEST 2014 June, Melbourne
| null | null | null |
cs.ET cond-mat.mtrl-sci cs.AR physics.chem-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A memristor is often identified by showing its distinctive pinched hysteresis
curve and testing for the effect of frequency. The hysteresis size should
relate to frequency and shrink to zero as the frequency approaches infinity.
Although mathematically understood, the material causes for this are not well
known. The d.c. response of the memristor is a decaying curve with its own
timescale. We show via mathematical reasoning that this decaying curve when
transformed to a.c. leads to the frequency effect by considering a descretized
curve. We then demonstrate the validity of this approach with experimental data
from two different types of memristors.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 14:23:34 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Gale",
"Ella",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Erokhin",
"Victor",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.988104 |
1402.4036
|
Ella Gale
|
Ella Gale, Ben de Lacy Costello and Andrew Adamatzky
|
Is Spiking Logic the Route to Memristor-Based Computers?
|
Conference paper. Work also reported in US patent: `Logic device and
method of performing a logical operation', patent application no. 14/089,191
(November 25, 2013)
|
Proceedings of the International Conference on Electronics,
Circuits and Systems (ICECS) 2013, Abu Dhabi, UAE, December 8th-11th,
297--300
| null | null |
cs.ET cond-mat.mtrl-sci cs.AR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memristors have been suggested as a novel route to neuromorphic computing
based on the similarity between neurons (synapses and ion pumps) and
memristors. The D.C. action of the memristor is a current spike, which we think
will be fruitful for building memristor computers. In this paper, we introduce
4 different logical assignations to implement sequential logic in the memristor
and introduce the physical rules, summation, `bounce-back', directionality and
`diminishing returns', elucidated from our investigations. We then demonstrate
how memristor sequential logic works by instantiating a NOT gate, an AND gate
and a Full Adder with a single memristor. The Full Adder makes use of the
memristor's memory to add three binary values together and outputs the value,
the carry digit and even the order they were input in.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 15:40:49 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Gale",
"Ella",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.988296 |
1402.4046
|
Ella Gale
|
Ella Gale, Ben de Lacy Costello and Andrew Adamatzky
|
Boolean Logic Gates From A Single Memristor Via Low-Level Sequential
Logic
|
Conference paper, published in Springer Lecture Notes in Computer
Science http://link.springer.com/chapter/10.1007%2F978-3-642-39074-6_9
|
Lecture Notes in Computer Science Volume 7956 2013 Unconventional
Computation and Natural Computation 12th International Conference, UCNC 2013,
Milan, Italy, July 1-5, 2013. Proceedings, 78-89
| null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By using the memristor's memory to both store a bit and perform an operation
with a second input bit, simple Boolean logic gates have been built with a
single memristor. The operation makes use of the interaction of current spikes
(occasionally called current transients) found in both memristors and other
devices. The sequential time-based logic methodology allows two logical input
bits to be used on a one-port by sending the bits separated in time. The
resulting logic gate is faster than one relying on memristor's state switching,
low power and requires only one memristor. We experimentally demonstrate
working OR and XOR gates made with a single flexible Titanium dioxide sol-gel
memristor.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 16:21:31 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Gale",
"Ella",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.988275 |
1402.3374
|
Thippeswamy B M
|
B M Thippeswamy, S Reshma, K Shaila, K R Venugopal, S S Iyengar, L M
Patnaik
|
EDOCR: Energy Density On-demand Cluster Routing in Wireless Sensor
Networks
|
18 pages,7 Figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, January 2014
|
10.5121/ijcnc.2014.6115
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy management is one of the critical parameters in Wireless Sensor
Networks. In this paper we attempt for a solution to balance the energy usage
for maximizing the network lifetime, increase the packet delivery ratio and
throughput. Our proposed algorithm is based on Energy Density of the clusters
in Wireless Sensor Networks. The cluster head is selected using two step method
and on-demand routing approach to calculate the balanced energy shortest path
from source to sink. This unique approach maintains the balanced energy
utilization among all nodes by selecting the different cluster heads
dynamically. Our simulation results have compared with one of the plain routing
scheme (EBRP) and cluster based routing (TSCHS), which shows the significant
improvements in minimizing the delay and energy utilization and maximizing the
network lifetime and throughput with respect to these works.
|
[
{
"version": "v1",
"created": "Fri, 14 Feb 2014 06:16:01 GMT"
}
] | 2014-02-17T00:00:00 |
[
[
"Thippeswamy",
"B M",
""
],
[
"Reshma",
"S",
""
],
[
"Shaila",
"K",
""
],
[
"Venugopal",
"K R",
""
],
[
"Iyengar",
"S S",
""
],
[
"Patnaik",
"L M",
""
]
] |
new_dataset
| 0.985586 |
1206.4860
|
Carlo Alberto Furia
|
Carlo A. Furia
|
Asynchronous Multi-Tape Automata Intersection: Undecidability and
Approximation
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When their reading heads are allowed to move completely asynchronously,
finite-state automata with multiple tapes achieve a significant expressive
power, but also lose useful closure properties---closure under intersection, in
particular. This paper investigates to what extent it is still feasible to use
multi-tape automata as recognizer of polyadic predicates on words. On the
negative side, determining whether the intersection of asynchronous multi-tape
automata is expressible is not even semidecidable. On the positive side, we
present an algorithm that computes under-approximations of the intersection;
and discuss simple conditions under which it can construct complete
intersections. A prototype implementation and a few non-trivial examples
demonstrate the algorithm in practice.
|
[
{
"version": "v1",
"created": "Thu, 21 Jun 2012 13:02:07 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Mar 2013 16:20:21 GMT"
},
{
"version": "v3",
"created": "Sun, 15 Sep 2013 17:13:54 GMT"
},
{
"version": "v4",
"created": "Mon, 2 Dec 2013 16:31:52 GMT"
},
{
"version": "v5",
"created": "Thu, 13 Feb 2014 13:45:17 GMT"
}
] | 2014-02-14T00:00:00 |
[
[
"Furia",
"Carlo A.",
""
]
] |
new_dataset
| 0.998305 |
1212.6104
|
Jason Teutsch
|
Jason Teutsch
|
Short lists for shortest descriptions in short time
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Is it possible to find a shortest description for a binary string? The
well-known answer is "no, Kolmogorov complexity is not computable." Faced with
this barrier, one might instead seek a short list of candidates which includes
a laconic description. Remarkably such approximations exist. This paper
presents an efficient algorithm which generates a polynomial-size list
containing an optimal description for a given input string. Along the way, we
employ expander graphs and randomness dispersers to obtain an Explicit Online
Matching Theorem for bipartite graphs and a refinement of Muchnik's Conditional
Complexity Theorem. Our main result extends recent work by Bauwens, Mahklin,
Vereschchagin, and Zimand.
|
[
{
"version": "v1",
"created": "Wed, 26 Dec 2012 00:15:53 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Dec 2012 08:30:22 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Jan 2013 01:27:30 GMT"
},
{
"version": "v4",
"created": "Fri, 19 Apr 2013 07:44:58 GMT"
},
{
"version": "v5",
"created": "Wed, 12 Feb 2014 21:38:28 GMT"
}
] | 2014-02-14T00:00:00 |
[
[
"Teutsch",
"Jason",
""
]
] |
new_dataset
| 0.971071 |
1305.4868
|
Dan Dobre Dan Dobre
|
Christian Cachin, Dan Dobre, Marko Vukolic
|
Asynchronous BFT Storage with 2t+1 Data Replicas
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cost of Byzantine Fault Tolerant (BFT) storage is the main concern
preventing its adoption in practice. This cost stems from the need to maintain
at least 3t+1 replicas in different storage servers in the asynchronous model,
so that t Byzantine replica faults can be tolerated. In this paper, we present
MDStore, the first fully asynchronous read/write BFT storage protocol that
reduces the number of data replicas to as few as 2t+1, maintaining 3t+1
replicas of metadata at (possibly) different servers. At the heart of MDStore
store is its metadata service that is built upon a new abstraction we call
timestamped storage. Timestamped storage both allows for conditional writes
(facilitating the implementation of a metadata service) and has consensus
number one (making it implementable wait-free in an asynchronous system despite
faults). In addition to its low data replication factor, MDStore offers very
strong guarantees implementing multi-writer multi-reader atomic wait-free
semantics and tolerating any number of Byzantine readers and crash-faulty
writers. We further show that MDStore data replication overhead is optimal;
namely, we prove a lower bound of 2t+1 on the number of data replicas that
applies even to crash-tolerant storage with a fault-free metadata service
oracle. Finally, we prove that separating data from metadata for reducing the
cost of BFT storage is not possible without cryptographic assumptions. However,
our MDStore protocol uses only lightweight cryptographic hash functions.
|
[
{
"version": "v1",
"created": "Tue, 21 May 2013 16:06:23 GMT"
},
{
"version": "v2",
"created": "Fri, 24 May 2013 10:13:27 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Feb 2014 12:05:02 GMT"
}
] | 2014-02-14T00:00:00 |
[
[
"Cachin",
"Christian",
""
],
[
"Dobre",
"Dan",
""
],
[
"Vukolic",
"Marko",
""
]
] |
new_dataset
| 0.990013 |
1402.3040
|
Jia-Fei Hong
|
Jia-Fei Hong, Kathleen Ahrens, Chu-Ren Huang
|
Event Structure of Transitive Verb: A MARVS perspective
|
Chinese Lexical Semantics Workshop 2011(CLSW 2011) published in
International Journal of Computer Processing of Languages (Vol. 24, No. 01,
March 2012)
|
International Journal of Computer Processing of Languages (Vol.
24, No. 01, March 2012)
|
10.1142/S179384061240003X
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Module-Attribute Representation of Verbal Semantics (MARVS) is a theory of
the representation of verbal semantics that is based on Mandarin Chinese data
(Huang et al. 2000). In the MARVS theory, there are two different types of
modules: Event Structure Modules and Role Modules. There are also two sets of
attributes: Event-Internal Attributes and Role-Internal Attributes, which are
linked to the Event Structure Module and the Role Module, respectively. In this
study, we focus on four transitive verbs as chi1(eat), wan2(play),
huan4(change) and shao1(burn) and explore their event structures by the MARVS
theory.
|
[
{
"version": "v1",
"created": "Thu, 13 Feb 2014 06:44:24 GMT"
}
] | 2014-02-14T00:00:00 |
[
[
"Hong",
"Jia-Fei",
""
],
[
"Ahrens",
"Kathleen",
""
],
[
"Huang",
"Chu-Ren",
""
]
] |
new_dataset
| 0.992155 |
1402.3150
|
Bei Yu
|
Jhih-Rong Gao and Bei Yu and David Z. Pan
|
Lithography Hotspot Detection and Mitigation in Nanometer VLSI
|
ASICON 2013
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With continued feature size scaling, even state of the art semiconductor
manufacturing processes will often run into layouts with poor printability and
yield. Identifying lithography hotspots is important at both physical
verification and early physical design stages. While detailed lithography
simulations can be very accurate, they may be too computationally expensive for
full-chip scale and physical design inner loops. Meanwhile, pattern matching
and machine learning based hotspot detection methods can provide acceptable
quality and yet fast turn-around-time for full-chip scale physical verification
and design. In this paper, we discuss some key issues and recent results on
lithography hotspot detection and mitigation in nanometer VLSI.
|
[
{
"version": "v1",
"created": "Thu, 13 Feb 2014 14:32:56 GMT"
}
] | 2014-02-14T00:00:00 |
[
[
"Gao",
"Jhih-Rong",
""
],
[
"Yu",
"Bei",
""
],
[
"Pan",
"David Z.",
""
]
] |
new_dataset
| 0.998007 |
1401.4799
|
Rami Cohen
|
Rami Cohen and Yuval Cassuto
|
LDPC Codes for Partial-Erasure Channels in Multi-Level Memories
|
7 pages, 3 figures. Partial version was submitted to ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we develop a new channel model, which we name the $q$-ary
partial erasure channel (QPEC). QPEC has a $q$-ary input, and its output is
either one symbol or a set of $M$ possible values. This channel mimics
situations when current/voltage levels in measurement channels are only
partially known, due to high read rates or imperfect current/voltage sensing.
Our investigation is concentrated on the performance of low-density
parity-pheck (LDPC) codes when used over this channel, due to their low
decoding complexity with iterative-decoding algorithms. We give the density
evolution equations of this channel, and develop its decoding-threshold
analysis. Part of the analysis shows that finding the exact decoding threshold
efficiently lies upon a solution to an open problem in additive combinatorics.
For this part we give bounds and approximations.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 06:26:35 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jan 2014 11:46:38 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Feb 2014 11:23:36 GMT"
},
{
"version": "v4",
"created": "Wed, 12 Feb 2014 11:08:51 GMT"
}
] | 2014-02-13T00:00:00 |
[
[
"Cohen",
"Rami",
""
],
[
"Cassuto",
"Yuval",
""
]
] |
new_dataset
| 0.999487 |
1402.2744
|
Bo Wei
|
Bo Wei, Ambuj Varshney, Wen Hu, Neal Patwari, Thiemo Voigt, Chun Tung
Chou
|
dRTI: Directional Radio Tomographic Imaging
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radio tomographic imaging (RTI) enables device free localisation of people
and objects in many challenging environments and situations. Its basic
principle is to detect the changes in the statistics of some radio quality
measurements in order to infer the presence of people and objects in the radio
path. However, the localisation accuracy of RTI suffers from complicated radio
propagation behaviours such as multipath fading and shadowing. In order to
improve RTI localisation accuracy, we propose to use inexpensive and energy
efficient electronically switched directional (ESD) antennas to improve the
quality of radio link behaviour observations, and therefore, the localisation
accuracy of RTI. We implement a directional RTI (dRTI) system to understand how
directional antennas can be used to improve RTI localisation accuracy. We also
study the impact of the choice of antenna directions on the localisation
accuracy of dRTI and propose methods to effectively choose informative antenna
directions to improve localisation accuracy while reducing overhead. We
evaluate the performance of dRTI in diverse indoor environments and show that
dRTI significantly outperforms the existing RTI localisation methods based on
omni-directional antennas.
|
[
{
"version": "v1",
"created": "Wed, 12 Feb 2014 06:26:19 GMT"
}
] | 2014-02-13T00:00:00 |
[
[
"Wei",
"Bo",
""
],
[
"Varshney",
"Ambuj",
""
],
[
"Hu",
"Wen",
""
],
[
"Patwari",
"Neal",
""
],
[
"Voigt",
"Thiemo",
""
],
[
"Chou",
"Chun Tung",
""
]
] |
new_dataset
| 0.998805 |
1402.2796
|
Fabio Celli PhD
|
Fabio Celli and Massimo Poesio
|
PR2: A Language Independent Unsupervised Tool for Personality
Recognition from Text
|
4 pages, peer reviewed
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PR2, a personality recognition system available online, that
performs instance-based classification of Big5 personality types from
unstructured text, using language-independent features. It has been tested on
English and Italian, achieving performances up to f=.68.
|
[
{
"version": "v1",
"created": "Wed, 12 Feb 2014 11:55:31 GMT"
}
] | 2014-02-13T00:00:00 |
[
[
"Celli",
"Fabio",
""
],
[
"Poesio",
"Massimo",
""
]
] |
new_dataset
| 0.997408 |
1402.2899
|
Bei Yu
|
Duo Ding and Bei Yu and David Z. Pan
|
GLOW: A global router for low-power thermal-reliable interconnect
synthesis using photonic wavelength multiplexing
| null | null |
10.1109/ASPDAC.2012.6165031
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we examine the integration potential and explore the design
space of low power thermal reliable on-chip interconnect synthesis featuring
nanophotonics Wavelength Division Multiplexing (WDM). With the recent
advancements, it is foreseen that nanophotonics holds the promise to be
employed for future on-chip data signalling due to its unique power efficiency,
signal delay and huge multiplexing potential. However, there are major
challenges to address before feasible on-chip integration could be reached. In
this paper, we present GLOW, a hybrid global router to provide low power
opto-electronic interconnect synthesis under the considerations of thermal
reliability and various physical design constraints such as optical power,
delay and signal quality. GLOW is evaluated with testing cases derived from
ISPD07-08 global routing benchmarks. Compared with a greedy approach, GLOW
demonstrates around 23%-50% of total optical power reduction, revealing great
potential of on-chip WDM interconnect synthesis.
|
[
{
"version": "v1",
"created": "Wed, 12 Feb 2014 17:03:22 GMT"
}
] | 2014-02-13T00:00:00 |
[
[
"Ding",
"Duo",
""
],
[
"Yu",
"Bei",
""
],
[
"Pan",
"David Z.",
""
]
] |
new_dataset
| 0.994314 |
1402.2941
|
Zohaib Khan
|
Zohaib Khan, Faisal Shafait, Yiqun Hu, Ajmal Mian
|
Multispectral Palmprint Encoding and Recognition
|
Preliminary version of this manuscript was published in ICCV 2011. Z.
Khan A. Mian and Y. Hu, "Contour Code: Robust and Efficient Multispectral
Palmprint Encoding for Human Recognition", International Conference on
Computer Vision, 2011. MATLAB Code available:
https://sites.google.com/site/zohaibnet/Home/codes
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Palmprints are emerging as a new entity in multi-modal biometrics for human
identification and verification. Multispectral palmprint images captured in the
visible and infrared spectrum not only contain the wrinkles and ridge structure
of a palm, but also the underlying pattern of veins; making them a highly
discriminating biometric identifier. In this paper, we propose a feature
encoding scheme for robust and highly accurate representation and matching of
multispectral palmprints. To facilitate compact storage of the feature, we
design a binary hash table structure that allows for efficient matching in
large databases. Comprehensive experiments for both identification and
verification scenarios are performed on two public datasets -- one captured
with a contact-based sensor (PolyU dataset), and the other with a contact-free
sensor (CASIA dataset). Recognition results in various experimental setups show
that the proposed method consistently outperforms existing state-of-the-art
methods. Error rates achieved by our method (0.003% on PolyU and 0.2% on CASIA)
are the lowest reported in literature on both dataset and clearly indicate the
viability of palmprint as a reliable and promising biometric. All source codes
are publicly available.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 06:35:51 GMT"
}
] | 2014-02-13T00:00:00 |
[
[
"Khan",
"Zohaib",
""
],
[
"Shafait",
"Faisal",
""
],
[
"Hu",
"Yiqun",
""
],
[
"Mian",
"Ajmal",
""
]
] |
new_dataset
| 0.992894 |
1310.4993
|
Hari Ram Balakrishnan
|
B Hari Ram, and K Giridhar
|
Fractional Interference Alignment: An Interference Alignment Scheme for
Finite Alphabet Signals
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interference Alignment (IA) is a transmission scheme which achieves 1/2
Degrees-of-Freedom (DoF) per transmit-antenna per user. The constraints imposed
on the scheme are based on the linear receiver since conventional IA assumes
Gaussian signaling. However, when the transmitters employ Finite Alphabet (FA)
signaling, neither the conventional IA precoders nor the linear receiver are
optimal structures. Therefore, a novel Fractional Interference Alignment (FIA)
scheme is introduced when FA signals are used, where the alignment constraints
are now based on the non-linear, minimum distance (MD) detector. Since DoF is
defined only as signal-to-noise ratio tends to infinity, we introduce a new
metric called SpAC (number of Symbols transmitted-per-transmit
Antenna-per-Channel use) for analyzing the FIA scheme. The maximum SpAC is one,
and the FIA achieves any value of SpAC in the range [0,1]. The key motivation
for this work is that numerical simulations with FA signals and MD detector for
fixed SpAC (=1/2, as in IA) over a set of optimization problems, like
minimizing bit error rate or maximizing the mutual information, achieves a
significantly better error rate performance when compared to the existing
algorithms that minimize mean square error or maximize signal-to-interference
plus noise ratio.
|
[
{
"version": "v1",
"created": "Fri, 18 Oct 2013 12:29:42 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Feb 2014 11:00:12 GMT"
}
] | 2014-02-12T00:00:00 |
[
[
"Ram",
"B Hari",
""
],
[
"Giridhar",
"K",
""
]
] |
new_dataset
| 0.992186 |
1402.1880
|
Ayad Ghany Ismaeel
|
Ayad Ghany Ismaeel, Dina Y. Mikhail
|
Design of Locally E-management System for Technical Education
Foundation- Erbil
|
11 pages, 11 figures, 1 tables
|
PolyTechnic, Vol. 1, No. 1, Oct. 2011, National Journal,
Erbil-IRAQ
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Until now, there is no e-management and automation necessary for the
operations or procedures of the departments in the Technical Education
Foundation Erbil, and the foundation like any other organization in Kurdistan
region is not connected to the network, because there is not infrastructure for
that purpose. To solve this problem, comes the proposal DLMS4TEF, which
requirements are divided into hardware and software, as hardware will need
Fast-Ethernet (LAN) technology to connect the departments of the Foundation via
Client-Server network later, when an infrastructure is established for
e-governments or e-management, it may be extended to the campus network. The
software is represented by installing windows server to implement the proposal
design of DLMS4TEF, PHP script is used as web programming that supports the
server, where as the HTML and JavaScript are used to support the client side.
The dynamic DLMS4TEF will be based on relational database, which is created by
using MySQL, to support processing hundreds of queries per second, and the
Kurdish Unicode to support Kurdish fonts of GUI's, Moreover, for security
DLMS4TEF allows each department in the Foundation to enter its own section and
prevent accessing other sections by using HTAccessible program which allows the
user to access by using his IP address and his computer only. The important
conclusions and advantages of applying DLMS4TEF are making backup to DLMS4TEF's
databases using the option (zipped) which allows them to reach the size of (3%)
of the original database size, sufficient security techniques, through
achieving levels of security, hidden access to the administrator section, and
finally DLMS4TEF, when compared with the traditional methods and project of
Oman, shows the same efficiency of some, if not better, features of Oman.
Keywords- E-management, Client-Server network, Fast-Ethernet, PHP, MySQL
|
[
{
"version": "v1",
"created": "Sat, 8 Feb 2014 19:29:33 GMT"
}
] | 2014-02-12T00:00:00 |
[
[
"Ismaeel",
"Ayad Ghany",
""
],
[
"Mikhail",
"Dina Y.",
""
]
] |
new_dataset
| 0.989923 |
1402.2297
|
Onur Varol
|
Onur Varol and Filippo Menczer
|
Connecting Dream Networks Across Cultures
|
6 pages, 3 figures
| null |
10.1145/2567948.2579697
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many species dream, yet there remain many open research questions in the
study of dreams. The symbolism of dreams and their interpretation is present in
cultures throughout history. Analysis of online data sources for dream
interpretation using network science leads to understanding symbolism in dreams
and their associated meaning. In this study, we introduce dream interpretation
networks for English, Chinese and Arabic that represent different cultures from
various parts of the world. We analyze communities in these networks, finding
that symbols within a community are semantically related. The central nodes in
communities give insight about cultures and symbols in dreams. The community
structure of different networks highlights cultural similarities and
differences. Interconnections between different networks are also identified by
translating symbols from different languages into English. Structural
correlations across networks point out relationships between cultures.
Similarities between network communities are also investigated by analysis of
sentiment in symbol interpretations. We find that interpretations within a
community tend to have similar sentiment. Furthermore, we cluster communities
based on their sentiment, yielding three main categories of positive, negative,
and neutral dream symbols.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 21:02:14 GMT"
}
] | 2014-02-12T00:00:00 |
[
[
"Varol",
"Onur",
""
],
[
"Menczer",
"Filippo",
""
]
] |
new_dataset
| 0.987701 |
1402.2641
|
Mart\'in Dar\'io Safe
|
Luciano N. Grippo and Mart\'in D. Safe
|
On circular-arc graphs having a model with no three arcs covering the
circle
|
15 pages, 3 figures. This paper originally appeared in proceedings of
the XVI Congreso Latino-Iberoamericano de Investigaci\'on Operativa and the
XLIV Simp\'osio Brasileiro de Pesquisa Operacional, September 24-28, 2012,
Rio de Janeiro, Brazil. Anais do XLIV Simposio Brasileiro de Pesquisa
Operacional, SOBRAPO, Rio de Janeiro, Brazil, 2012, pages 4093--4104.
http://www.din.uem.br/sbpo/sbpo2012/pdf/arq0518.pdf
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An interval graph is the intersection graph of a finite set of intervals on a
line and a circular-arc graph is the intersection graph of a finite set of arcs
on a circle. While a forbidden induced subgraph characterization of interval
graphs was found fifty years ago, finding an analogous characterization for
circular-arc graphs is a long-standing open problem. In this work, we study the
intersection graphs of finite sets of arcs on a circle no three of which cover
the circle, known as normal Helly circular-arc graphs. Those circular-arc
graphs which are minimal forbidden induced subgraphs for the class of normal
Helly circular-arc graphs were identified by Lin, Soulignac, and Szwarcfiter,
who also posed the problem of determining the remaining minimal forbidden
induced subgraphs. In this work, we solve their problem, obtaining the complete
list of minimal forbidden induced subgraphs for the class of normal Helly
circular-arc graphs.
|
[
{
"version": "v1",
"created": "Tue, 11 Feb 2014 20:46:22 GMT"
}
] | 2014-02-12T00:00:00 |
[
[
"Grippo",
"Luciano N.",
""
],
[
"Safe",
"Martín D.",
""
]
] |
new_dataset
| 0.999183 |
1304.5149
|
John Postl
|
Elliot Anshelevich, John Postl, Tom Wexler
|
Assignment Games with Conflicts: Price of Total Anarchy and Convergence
Results via Semi-Smoothness
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study assignment games in which jobs select machines, and in which certain
pairs of jobs may conflict, which is to say they may incur an additional cost
when they are both assigned to the same machine, beyond that associated with
the increase in load. Questions regarding such interactions apply beyond
allocating jobs to machines: when people in a social network choose to align
themselves with a group or party, they typically do so based upon not only the
inherent quality of that group, but also who amongst their friends (or enemies)
choose that group as well. We show how semi-smoothness, a recently introduced
generalization of smoothness, is necessary to find tight or near-tight bounds
on the price of total anarchy, and thus on the quality of correlated and Nash
equilibria, for several natural job-assignment games with interacting jobs. For
most cases, our bounds on the price of total anarchy are either exactly 2 or
approach 2. We also prove new convergence results implied by semi-smoothness
for our games. Finally we consider coalitional deviations, and prove results
about the existence and quality of Strong equilibrium.
|
[
{
"version": "v1",
"created": "Thu, 18 Apr 2013 14:32:12 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Feb 2014 15:47:26 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Anshelevich",
"Elliot",
""
],
[
"Postl",
"John",
""
],
[
"Wexler",
"Tom",
""
]
] |
new_dataset
| 0.995494 |
1307.1954
|
Matthew Blaschko
|
Wojciech Zaremba (INRIA Saclay - Ile de France, CVN), Arthur Gretton,
Matthew Blaschko (INRIA Saclay - Ile de France, CVN)
|
B-tests: Low Variance Kernel Two-Sample Tests
|
Neural Information Processing Systems (2013)
| null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A family of maximum mean discrepancy (MMD) kernel two-sample tests is
introduced. Members of the test family are called Block-tests or B-tests, since
the test statistic is an average over MMDs computed on subsets of the samples.
The choice of block size allows control over the tradeoff between test power
and computation time. In this respect, the $B$-test family combines favorable
properties of previously proposed MMD two-sample tests: B-tests are more
powerful than a linear time test where blocks are just pairs of samples, yet
they are more computationally efficient than a quadratic time test where a
single large block incorporating all the samples is used to compute a
U-statistic. A further important advantage of the B-tests is their
asymptotically Normal null distribution: this is by contrast with the
U-statistic, which is degenerate under the null hypothesis, and for which
estimates of the null distribution are computationally demanding. Recent
results on kernel selection for hypothesis testing transfer seamlessly to the
B-tests, yielding a means to optimize test power via kernel choice.
|
[
{
"version": "v1",
"created": "Mon, 8 Jul 2013 06:10:58 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Nov 2013 09:51:44 GMT"
},
{
"version": "v3",
"created": "Mon, 10 Feb 2014 20:39:40 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Zaremba",
"Wojciech",
"",
"INRIA Saclay - Ile de France, CVN"
],
[
"Gretton",
"Arthur",
"",
"INRIA Saclay - Ile de France, CVN"
],
[
"Blaschko",
"Matthew",
"",
"INRIA Saclay - Ile de France, CVN"
]
] |
new_dataset
| 0.998408 |
1401.3582
|
Xiaomin Bao
|
Xiaomin Bao
|
The equivalent identities of the MacWilliams identity for linear codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use derivatives to prove the equivalences between MacWilliams identity and
its four equivalent forms, and present new interpretations for the four
equivalent forms. Our results explicitly give out the relationships between
MacWilliams identity and its four equivalent forms.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 13:19:42 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Feb 2014 07:47:47 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Bao",
"Xiaomin",
""
]
] |
new_dataset
| 0.987897 |
1402.1819
|
Sahaya Rose Vigita
|
Sahaya Rose Vigita, Golden Julie
|
Reliable Link-Based Routing Protocol for Highly Dynamic Mobile Adhoc
Networks
|
7 pages, 8 figures, Published with International Journal of
Engineering Trends and Technology (IJETT)
|
International Journal of Engineering Trends and Technology
(IJETT)-Volume 4 Issue 5/ May 2013, Pages 1636 - 1642
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional topology-based MANET routing protocols use stateful routing which
increases the processing,communication and memory overheads. The high mobility
of nodes in MANETs makes it difficult to maintain a deterministic route. To
overcome this, stateless geographic routing protocols which ensure reliable
data delivery have been proposed. It is found that link instability can be a
major factor for unreliable data delivery. Driven by this issue, Link and
Position based Opportunistic Routing (L-POR) protocol which chooses a forwarder
based on the reception power of a node has been proposed. A back-up scheme is
also proposed to handle communication holes. Simulation results show that the
proposed protocol achieves excellent performance even under high node mobility.
|
[
{
"version": "v1",
"created": "Sat, 8 Feb 2014 04:31:18 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Vigita",
"Sahaya Rose",
""
],
[
"Julie",
"Golden",
""
]
] |
new_dataset
| 0.991611 |
1402.2019
|
Pedro Hipola
|
Amed Leiva-Mederos, Jose A. Senso, Sandor Dominguez-Velasco, Pedro
Hipola
|
Authoris: a tool for authority control in the semantic web
|
27 pages, 8 figures
|
Library Hi Tech, Vol. 31 Iss: 3, pp.536 - 553
|
10.1108/LHT-12-20112-0135
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose: The purpose of this paper is to propose a tool that generates
authority files to be integrated with linked data by means of learning rules.
AUTHORIS is software developed to enhance authority control and information
exchange among bibliographic and non-bibliographic entities.
Design / methodology / approach: The article analyzes different methods
previously developed for authority control as well as IFLA and ALA standards
for managing bibliographic records. Semantic Web technologies are also
evaluated. AUTHORIS relies on Drupal and incorporates the protocols of Dublin
Core, SIOC, SKOS and FOAF. The tool has also taken into account the
obsolescence of MARC and its substitution by FRBR and RDA. Its effectiveness
was evaluated applying a learning test proposed by RDA. Over 80 percent of the
actions were carried out correctly.
Findings: The use of learning rules and the facilities of linked data make it
easier for information organizations to reutilize products for authority
control and distribute them in a fair and efficient manner.
Research limitations / implications: The ISAD-G records were the ones
presenting most errors. EAD was found to be second in the number of errors
produced. The rest of the formats --MARC 21, Dublin Core, FRAD, RDF, OWL, XBRL
and FOAF-- showed fewer than 20 errors in total.
Practical implications: AUTHORIS offers institutions the means of sharing
data with a high level of stability, helping to detect records that are
duplicated and contributing to lexical disambiguation and data enrichment.
Originality / value: The software combines the facilities of linked data, the
potency of the algorithms for converting bibliographic data, and the precision
of learning rules.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 02:33:03 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Leiva-Mederos",
"Amed",
""
],
[
"Senso",
"Jose A.",
""
],
[
"Dominguez-Velasco",
"Sandor",
""
],
[
"Hipola",
"Pedro",
""
]
] |
new_dataset
| 0.97703 |
1402.2107
|
Mario Pastorelli
|
Mario Pastorelli, Matteo Dell'Amico, Pietro Michiardi
|
OS-Assisted Task Preemption for Hadoop
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work introduces a new task preemption primitive for Hadoop, that allows
tasks to be suspended and resumed exploiting existing memory management
mechanisms readily available in modern operating systems. Our technique fills
the gap that exists between the two extremes cases of killing tasks (which
waste work) or waiting for their completion (which introduces latency):
experimental results indicate superior performance and very small overheads
when compared to existing alternatives.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 11:14:19 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Pastorelli",
"Mario",
""
],
[
"Dell'Amico",
"Matteo",
""
],
[
"Michiardi",
"Pietro",
""
]
] |
new_dataset
| 0.993406 |
1402.2108
|
Uttam Ghosh
|
Waleed S. Alnumay and Uttam Ghosh
|
Secure Routing and Data Transmission in Mobile Ad Hoc Networks
| null |
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, January 2014
| null | null |
cs.NI cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we present an identity (ID) based protocol that secures AODV
and TCP so that it can be used in dynamic and attack prone environments of
mobile ad hoc networks. The proposed protocol protects AODV using Sequential
Aggregate Signatures (SAS) based on RSA. It also generates a session key for
each pair of source-destination nodes of a MANET for securing the end-to-end
transmitted data. Here each node has an ID which is evaluated from its public
key and the messages that are sent are authenticated with a signature/ MAC. The
proposed scheme does not allow a node to change its ID throughout the network
lifetime. Thus it makes the network secure against attacks that target AODV and
TCP in MANET. We present performance analysis to validate our claim.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 11:17:18 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Alnumay",
"Waleed S.",
""
],
[
"Ghosh",
"Uttam",
""
]
] |
new_dataset
| 0.995915 |
1402.2114
|
Shiu Kumar
|
Shiu Kumar
|
Ubiquitous Smart Home System Using Android Application
|
11 pages, 10 figures
|
International Journal of Computer Networks & Communications, vol.
6(1), pp. 33-43, 2014
|
10.5121/ijcnc.2014.6103
| null |
cs.CY cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a flexible standalone, low-cost smart home system, which
is based on the Android app communicating with the micro-web server providing
more than the switching functionalities. The Arduino Ethernet is used to
eliminate the use of a personal computer (PC) keeping the cost of the overall
system to a minimum while voice activation is incorporated for switching
functionalities. Devices such as light switches, power plugs, temperature
sensors, humidity sensors, current sensors, intrusion detection sensors,
smoke/gas sensors and sirens have been integrated in the system to demonstrate
the feasibility and effectiveness of the proposed smart home system. The smart
home app is tested and it is able to successfully perform the smart home
operations such as switching functionalities, automatic environmental control
and intrusion detection, in the later case where an email is generated and the
siren goes on.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 11:30:06 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Kumar",
"Shiu",
""
]
] |
new_dataset
| 0.992714 |
1402.2140
|
Aybars Ural
|
Vedat Kavalci, Aybars Ural and Orhan Dagdeviren
|
Distributed Vertex Cover Algorithms For Wireless Sensor Networks
| null |
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, January 2014
|
10.5121/ijcnc.2014.6107
| null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vertex covering has important applications for wireless sensor networks such
as monitoring link failures, facility location, clustering, and data
aggregation. In this study, we designed three algorithms for constructing
vertex cover in wireless sensor networks. The first algorithm, which is an
adaption of the Parnas & Ron's algorithm, is a greedy approach that finds a
vertex cover by using the degrees of the nodes. The second algorithm finds a
vertex cover from graph matching where Hoepman's weighted matching algorithm is
used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from
breadth-first tree. We show the operation of the designed algorithms, analyze
them, and provide the simulation results in the TOSSIM environment. Finally we
have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where
the third algorithm has turned out to be presenting the best results in vertex
cover approximation ratio.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 13:30:25 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Kavalci",
"Vedat",
""
],
[
"Ural",
"Aybars",
""
],
[
"Dagdeviren",
"Orhan",
""
]
] |
new_dataset
| 0.998226 |
1402.2188
|
Anitha Chacko Mary M.O.
|
Anitha Mary M.O. Chacko, P.M Dhanya
|
Handwritten Character Recognition In Malayalam Scripts- A Review
|
11 pages,4 figures,2 tables
|
International Journal of Artificial Intelligence & Applications
(IJAIA), Vol. 5, No. 1, January 2014
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handwritten character recognition is one of the most challenging and ongoing
areas of research in the field of pattern recognition. HCR research is matured
for foreign languages like Chinese and Japanese but the problem is much more
complex for Indian languages. The problem becomes even more complicated for
South Indian languages due to its large character set and the presence of
vowels modifiers and compound characters. This paper provides an overview of
important contributions and advances in offline as well as online handwritten
character recognition of Malayalam scripts.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 15:41:48 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Chacko",
"Anitha Mary M. O.",
""
],
[
"Dhanya",
"P. M",
""
]
] |
new_dataset
| 0.998409 |
1402.2204
|
Saibharath S
|
S. Saibharath and J. Aarthi
|
Virtual Backbone Trees for Most Minimal Energy Consumption and
Increasing Network Lifetime In WSNs
|
10 pages, 4 figures, International Journal of Computer Networks &
Communications (IJCNC) Vol.6, No.1, January 2014
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, January 2014
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Virtual backbone trees have been used for efficient communication between
sink node and any other node in the deployed area. But all the proposed virtual
backbone trees are not fully energy efficient and EVBTs have few flaws
associated with them. In this paper two such virtual backbones are proposed.
The motive behind the first algorithm, Most Minimal Energy Virtual Backbone
Tree (MMEVBT), is to minimise the energy consumption when packets are
transmitted between sink and a target sensor node. The energy consumption is
most minimal and optimal and it is shown why it always has minimal energy
consumption during any transfer of packet between every node with the sink
node. For every node, route path with most minimal energy consumption is
identified and a new tree node is elected only when a better minimal energy
consumption route is identified for a node to communicate with the sink and
vice versa. By moving sink periodically it is ensured the battery of the nodes
near sink is not completely drained out. Another backbone construction
algorithm is proposed which maximises the network lifetime by increasing the
lifetime of all tree nodes. Simulations are done in NS2 to practically test the
algorithms and the results are discussed in detail.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 16:43:00 GMT"
}
] | 2014-02-11T00:00:00 |
[
[
"Saibharath",
"S.",
""
],
[
"Aarthi",
"J.",
""
]
] |
new_dataset
| 0.992824 |
1105.2311
|
Ramji Venkataramanan
|
Ramji Venkataramanan, S. Sandeep Pradhan
|
An Achievable Rate Region for the Broadcast Channel with Feedback
|
To appear in IEEE Transactions on Information Theory. Contains
example of AWGN Broadcast Channel with noisy feedback
|
IEEE Transactions on Information Theory, vol. 59, no.10, pp. 6175
- 6191, Oct. 2013
|
10.1109/TIT.2013.2268532
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A single-letter achievable rate region is proposed for the two-receiver
discrete memoryless broadcast channel with generalized feedback. The coding
strategy involves block-Markov superposition coding, using Marton's coding
scheme for the broadcast channel without feedback as the starting point. If the
message rates in the Marton scheme are too high to be decoded at the end of a
block, each receiver is left with a list of messages compatible with its
output. Resolution information is sent in the following block to enable each
receiver to resolve its list. The key observation is that the resolution
information of the first receiver is correlated with that of the second. This
correlated information is efficiently transmitted via joint source-channel
coding, using ideas similar to the Han-Costa coding scheme. Using the result,
we obtain an achievable rate region for the stochastically degraded AWGN
broadcast channel with noisy feedback from only one receiver. It is shown that
this region is strictly larger than the no-feedback capacity region.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2011 20:36:06 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Jan 2012 01:33:22 GMT"
},
{
"version": "v3",
"created": "Fri, 12 Oct 2012 15:22:54 GMT"
},
{
"version": "v4",
"created": "Fri, 19 Jul 2013 15:19:46 GMT"
}
] | 2014-02-10T00:00:00 |
[
[
"Venkataramanan",
"Ramji",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.987193 |
1312.1858
|
Dominic Wilson
|
Dominic Wilson and Devinder Kaur
|
How Santa Fe Ants Evolve
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Santa Fe Ant model problem has been extensively used to investigate, test
and evaluate Evolutionary Computing systems and methods over the past two
decades. There is however no literature on its program structures that are
systematically used for fitness improvement, the geometries of those structures
and their dynamics during optimization. This paper analyzes the Santa Fe Ant
Problem using a new phenotypic schema and landscape analysis based on executed
instruction sequences. For the first time we detail systematic structural
features that give high fitness and the evolutionary dynamics of such
structures. The new schema avoids variances due to introns. We develop a
phenotypic variation method that tests the new understanding of the landscape.
We also develop a modified function set that tests newly identified
synchronization constraints. We obtain favorable computational efforts compared
to those in the literature, on testing the new variation and function set on
both the Santa Fe Trail, and the more computationally demanding Los Altos
Trail. Our findings suggest that for the Santa Fe Ant problem, a perspective of
program assembly from repetition of highly fit responses to trail conditions
leads to better analysis and performance.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 13:37:37 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Feb 2014 20:23:47 GMT"
}
] | 2014-02-10T00:00:00 |
[
[
"Wilson",
"Dominic",
""
],
[
"Kaur",
"Devinder",
""
]
] |
new_dataset
| 0.994944 |
1402.1545
|
Carol Niznik
|
Dr. Carol A. Niznik
|
The Tactical Optimal Strategy Game (TOSG) Protocol Cockpit Software
Control For Massive Ordnance Penetrator Release
|
e-ISSN: 2251-7545
|
The International Journal of Soft Computing and Software
Engineering [JSCSE], Vol. 3, No. 3, 2013, pp.474-480
|
10.7321/jscse.v3.n3.72
| null |
cs.CY cs.GT
|
http://creativecommons.org/licenses/publicdomain/
|
The Massive Ordnance Penetrator(MOP) has been developed to destroy deeply
buried nuclear components by controlled release from a B2 or B52 airplane. This
type of release must be cockpit software controlled by the Tactical Optimal
Strategy Game(TOSG) Protocol to optimally determine the war game aspects of the
dueling from other countries' MOP releases, and the depth at which the MOP
explosions can occur for maximal safety and risk concerns. The TOSG Protocol
characteristics of games of strategy, games of optimal strategy and tactical
games are defined initially by the game of strategy as a certain series of
events, each of which must have a finite number of distinct results. The
outcome of a game of strategy, in some cases, depends on chance. All other
events depend on the free decision of the players. A game has a solution if
there exist two strategies, which become optimal strategies when each
mathematically attains the value of the game. The TOSG Protocol war game
tactical problem for a class of games can be mathematically modeled as a combat
between two airplanes, each carrying a MOP as the specification of the accuracy
of the firing machinery and the total amount of ammunition that each plane
carries. This silent duel occurs, because each MOP bomber is unable to
determine the number of times its opponent has missed. The TOSG Protocol
realizes a game theory solution of the tactical optimal strategy game utilizing
the theory of games of timing, games of pursuit, games of time lag, games of
sequence, games of maneuvering, games of search, games of positioning and games
of aiming and evasion.
|
[
{
"version": "v1",
"created": "Fri, 7 Feb 2014 03:22:19 GMT"
}
] | 2014-02-10T00:00:00 |
[
[
"Niznik",
"Dr. Carol A.",
""
]
] |
new_dataset
| 0.998383 |
1402.1683
|
Carol Niznik
|
Dr. Carol A. Niznik
|
Homeland Defense and Security Universal Interface Software (HDUIS)
Protocol Communication Gateway UIS Protocol Enhancements, Alterations and
Attachments
| null |
The International Journal of Soft Computing and Software
Engineering [JSCSE], Vol. 3, No. 3, pp.517-523, 2013
|
10.7321/jscse.v3.n3.79
| null |
cs.CY cs.CR
|
http://creativecommons.org/licenses/publicdomain/
|
The Universal Interface Software(UIS) Protocol was a Theater Missile Defense
Gateway Protocol which linked the Strategic Defense Initiative(SDI)
Architecture Killer Satellite Software Protocol to the National Test Bed
Simulation Software Protocol to enable neural network shock loop operation when
ICBMS were approaching the SDI Shield. A Gateway Software is required for
Homeland Defense and Security Systems to communicate the sensor information
from hardware and software boxes at airports and government buildings and other
locations to the Global Information Grid(GIG). Therefore, a Homeland Defense
and Security UIS(HDSUIS) Protocol is achieved by UIS conversion to HDSUIS for
Thresholds Stabilization and GIG and terrorist sensor Enhancements, Homeland
Defense and Security Lagrangian equation and GIG simulation facility timing
chart Alterations, and two Catastrophe Theory Protocol Attachments to the UIS
Geometric software structure inner cube. This UIS Protocol conversion to the
HDSUIS Protocol will track and provide a Congestion Controlled, i.e.,prevention
of deadlock and livelock, communication of (1) Shoe bombers and copycat shoe
bombers, (2) deeply buried and imbedded boxes with explosives, (3) damage to
lase1 equipment, (4) shoulder missile fired armament, and (5) surface to air
missiles from their sensor equipment to the Global Information Grid with
Theater Missile Defense Characteristics. The Homeland Defense and Security
GNNO(Geometric Neural Network Overlay) Protocol will be derived as a conversion
of the UIS GNNO Protocol.
|
[
{
"version": "v1",
"created": "Fri, 7 Feb 2014 16:27:02 GMT"
}
] | 2014-02-10T00:00:00 |
[
[
"Niznik",
"Dr. Carol A.",
""
]
] |
new_dataset
| 0.998823 |
1401.6573
|
Christian Retore
|
Livy-Maria Real-Coelho (LaBRI, UFPR), Christian Retor\'e (LaBRI, IRIT)
|
Deverbal semantics and the Montagovian generative lexicon
|
A revised version will appear in the Journal of Logic, Language and
Information
|
Journal of Logic, Language and Information (2014) 21
|
10.1007/s10849-014-9187-y
| null |
cs.CL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a lexical account of action nominals, in particular of deverbal
nominalisations, whose meaning is related to the event expressed by their base
verb. The literature about nominalisations often assumes that the semantics of
the base verb completely defines the structure of action nominals. We argue
that the information in the base verb is not sufficient to completely determine
the semantics of action nominals. We exhibit some data from different
languages, especially from Romance language, which show that nominalisations
focus on some aspects of the verb semantics. The selected aspects, however,
seem to be idiosyncratic and do not automatically result from the internal
structure of the verb nor from its interaction with the morphological suffix.
We therefore propose a partially lexicalist approach view of deverbal nouns. It
is made precise and computable by using the Montagovian Generative Lexicon, a
type theoretical framework introduced by Bassac, Mery and Retor\'e in this
journal in 2010. This extension of Montague semantics with a richer type system
easily incorporates lexical phenomena like the semantics of action nominals in
particular deverbals, including their polysemy and (in)felicitous
copredications.
|
[
{
"version": "v1",
"created": "Sat, 25 Jan 2014 19:50:51 GMT"
}
] | 2014-02-07T00:00:00 |
[
[
"Real-Coelho",
"Livy-Maria",
"",
"LaBRI, UFPR"
],
[
"Retoré",
"Christian",
"",
"LaBRI, IRIT"
]
] |
new_dataset
| 0.998172 |
1402.1216
|
Jingchao Sun
|
Jingchao Sun, Rui Zhang, Jinxue Zhang, Yanchao Zhang
|
TouchIn: Sightless Two-factor Authentication on Multi-touch Mobile
Devices
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile authentication is indispensable for preventing unauthorized access to
multi-touch mobile devices. Existing mobile authentication techniques are often
cumbersome to use and also vulnerable to shoulder-surfing and smudge attacks.
This paper focuses on designing, implementing, and evaluating TouchIn, a
two-factor authentication system on multi-touch mobile devices. TouchIn works
by letting a user draw on the touchscreen with one or multiple fingers to
unlock his mobile device, and the user is authenticated based on the geometric
properties of his drawn curves as well as his behavioral and physiological
characteristics. TouchIn allows the user to draw on arbitrary regions on the
touchscreen without looking at it. This nice sightless feature makes TouchIn
very easy to use and also robust to shoulder-surfing and smudge attacks.
Comprehensive experiments on Android devices confirm the high security and
usability of TouchIn.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 00:35:37 GMT"
}
] | 2014-02-07T00:00:00 |
[
[
"Sun",
"Jingchao",
""
],
[
"Zhang",
"Rui",
""
],
[
"Zhang",
"Jinxue",
""
],
[
"Zhang",
"Yanchao",
""
]
] |
new_dataset
| 0.999854 |
1402.1243
|
Shafi'i Muhammad Abdulhamid Mr
|
Shafii Muhammad Abdulhamid, Gana Usman
|
Destination Information Management System for Tourist
|
8 pages. Computer Science and Telecommunications 2010
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of information and communication technology in our day to day
activities is now unavoidable. In tourism developments, destination information
and management systems are used to guide visitors and provide information to
both visitors and management of the tour sites. In this paper, information and
navigation system was designed for tourists, taking some Niger state of Nigeria
tourism destinations into account. The information management system was
designed using Java Applet (NetBeans IDE 6.1), Hypertext MarkUp Language
(HTML), Personal Home Page (PHP), Java script and MySQL as the back-end
integration database. Two different MySQL servers were used, the MySQL query
browser and the WAMP5 server to compare the effectiveness of the system
developed.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 04:30:39 GMT"
}
] | 2014-02-07T00:00:00 |
[
[
"Abdulhamid",
"Shafii Muhammad",
""
],
[
"Usman",
"Gana",
""
]
] |
new_dataset
| 0.97992 |
1402.1296
|
Tiago Guerreiro
|
Ricardo Jo\~ao Silveira Santos Gamboa
|
Mnemonical Body Shortcuts: Gestural Interface for Mobile Devices
|
124 pages, MSc Thesis, Technical University of Lisbon
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices' user interfaces are still quite similar to traditional
interfaces offered by desktop computers, but those can be highly problematic
when used in a mobile context. Human gesture recognition in mobile interaction
appears as an important area to provide suitable on-the-move usability. We
present a body space based approach to improve mobile device interaction and
mobile performance, which we named as Mnemonical Body Shortcuts. The human body
is presented as a rich repository of meaningful relations which are always
available to interact with. These body-based gestures allow the user to
naturally interact with mobile devices with no movement limitations.
Preliminary studies using Radio Frequency Identification (RFID) technology were
performed, validating Mnemonical Body Shortcuts as an appropriate new mobile
interaction mechanism. Following those studies, we developed inertial sensing
prototypes using an accelerometer, ending in the construction and user testing
of a gestural interface for mobile devices capable of properly recognizing
Mnemonical Body Shortcuts and also providing suitable user control mechanisms
and audio, visual and haptic feedback.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 09:54:25 GMT"
}
] | 2014-02-07T00:00:00 |
[
[
"Gamboa",
"Ricardo João Silveira Santos",
""
]
] |
new_dataset
| 0.999468 |
1402.1324
|
Tiago Guerreiro
|
Ivo Rafael
|
UCAT: Ubiquitous Context Awareness Tools for The Blind
|
93 pages, MSc Thesis, University of Lisbon
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visually impaired people are often confronted with new environments and they
find themselves face to face with an innumerous amount of difficulties when
facing these environments. Having to surpass and deal with these difficulties
that arise with their condition is something that we can help diminish. They
are one sense down when trying to understand their surrounding environments and
gather information about what is happening around them. Nowadays, mobile
devices present significant computing and technological capacity which has been
increasing to the point where it is very common for most people to have access
to a device with Bluetooth, GPS, Wi-Fi, and both high processing and storage
capacities. This allows us to think of applications that can do so much to help
people with difficulties. In the particular case of blind people, the lack of
visual information can be bypassed with other contextual information retrieved
by their own personal devices. Our goal is to provide information to blind
users, be able to give them information about the context that surrounds them.
We wanted to provide the blind users with the tools to create information and
be able to share this information between each other, information about people,
locations or objects. Our approach was to split the project into a data and
information gathering phase where we did our field search and interviewed and
elaborated on how is the situation of environment perception for blind users,
followed by a technical phase where we implement a system based on the first
stage. Our results gathered from both the collecting phase and our implementing
phase showed that there is potential to use these tools in the blind community
and that they welcome the possibilities and horizons that it opens them.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 11:35:07 GMT"
}
] | 2014-02-07T00:00:00 |
[
[
"Rafael",
"Ivo",
""
]
] |
new_dataset
| 0.999242 |
1304.1202
|
Alan Guo
|
Alan Guo
|
High rate locally correctable codes via lifting
|
Fixed some typos, replaced references, which were missing in previous
arXiv version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general framework for constructing high rate error correcting
codes that are locally correctable (and hence locally decodable if linear) with
a sublinear number of queries, based on lifting codes with respect to functions
on the coordinates. Our approach generalizes the lifting of affine-invariant
codes of Guo, Kopparty, and Sudan and its generalization automorphic lifting,
suggested by Ben-Sasson et al, which lifts algebraic geometry codes with
respect to a group of automorphisms of the code. Our notion of lifting is a
natural alternative to the degree-lifting of Ben-Sasson et al and it carries
two advantages. First, it overcomes the rate barrier inherent in
degree-lifting. Second, it is extremely flexible, requiring no special
properties (e.g. linearity, invariance) of the base code, and requiring very
little structure on the set of functions on the coordinates of the code.
As an application, we construct new explicit families of locally correctable
codes by lifting algebraic geometry codes. Like the multiplicity codes of
Kopparty, Saraf, Yekhanin and the affine-lifted codes of Guo, Kopparty, Sudan,
our codes of block-length $N$ can achieve $N^\epsilon$ query complexity and
$1-\alpha$ rate for any given $\epsilon, \alpha > 0$ while correcting a
constant fraction of errors, in contrast to the Reed-Muller codes and the
degree-lifted AG codes of Ben-Sasson et al which face a rate barrier of
$\epsilon^{O(1/\epsilon)}$. However, like the degree-lifted AG codes, our codes
are over an alphabet significantly smaller than that obtained by Reed-Muller
codes, affine-lifted codes, and multiplicity codes.
|
[
{
"version": "v1",
"created": "Wed, 3 Apr 2013 22:12:23 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Aug 2013 17:52:53 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Feb 2014 01:19:35 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Guo",
"Alan",
""
]
] |
new_dataset
| 0.986181 |
1402.0412
|
Thomas Steiner
|
Thomas Steiner
|
Bots vs. Wikipedians, Anons vs. Logged-Ins
|
Poster at the Web Science Track of the 23rd International World Wide
Web Conference (WWW2014), Seoul, Korea
| null |
10.1145/2567948.2576948
| null |
cs.DL cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wikipedia is a global crowdsourced encyclopedia that at time of writing is
available in 287 languages. Wikidata is a likewise global crowdsourced
knowledge base that provides shared facts to be used by Wikipedias. In the
context of this research, we have developed an application and an underlying
Application Programming Interface (API) capable of monitoring realtime edit
activity of all language versions of Wikipedia and Wikidata. This application
allows us to easily analyze edits in order to answer questions such as "Bots
vs. Wikipedians, who edits more?", "Which is the most anonymously edited
Wikipedia?", or "Who are the bots and what do they edit?". To the best of our
knowledge, this is the first time such an analysis could be done in realtime
for Wikidata and for really all Wikipedias--large and small. Our application is
available publicly online at the URL http://wikipedia-edits.herokuapp.com/, its
code has been open-sourced under the Apache 2.0 license.
|
[
{
"version": "v1",
"created": "Mon, 3 Feb 2014 16:08:25 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Feb 2014 08:42:32 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Steiner",
"Thomas",
""
]
] |
new_dataset
| 0.967899 |
1402.0886
|
Mohammad Mahmoodi Varnamkhasti
|
Maryam Mahmoodi, Mohammad Mahmoodi Varnamkhasti
|
A Secure Communication in Mobile Agent System
|
3 pages, Published with International Journal of Engineering Trends
and Technology (IJETT)
|
International Journal of Engineering Trends and Technology (IJETT)
V6(4):186-188, december 2013. Published by Seventh Sense Research Group
|
10.14445/22315381/IJETT-V6N4P133
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mobile agent is a software code with mobility which can be move from a
computer into another computers through network. The mobile agent paradigm
provides many benefits in developments of distributed application at the same
time introduce new requirements for security issues with these systems. In this
article we present a solution for protection agent from other agents attacks
with loging patterns of malicious agent and useing this log for communication.
We implemented our resolution by JADE.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 21:28:31 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Mahmoodi",
"Maryam",
""
],
[
"Varnamkhasti",
"Mohammad Mahmoodi",
""
]
] |
new_dataset
| 0.971175 |
1402.0916
|
Itzhak Tamo
|
Itzhak Tamo and Alexander Barg
|
Bounds on Locally Recoverable Codes with Multiple Recovering Sets
|
Submitted to ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A locally recoverable code (LRC code) is a code over a finite alphabet such
that every symbol in the encoding is a function of a small number of other
symbols that form a recovering set. Bounds on the rate and distance of such
codes have been extensively studied in the literature. In this paper we derive
upper bounds on the rate and distance of codes in which every symbol has $t\geq
1$ disjoint recovering sets.
|
[
{
"version": "v1",
"created": "Wed, 5 Feb 2014 00:46:04 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.982854 |
1402.0925
|
Nicolas Limal
|
Nicolas Limal
|
An Information Identity for State-dependent Channels with Feedback
|
7 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this technical note, we investigate information quantities of
state-dependent communication channels with corrupted information fed back from
the receiver. We derive an information identity which can be interpreted as a
law of conservation of information flows.
|
[
{
"version": "v1",
"created": "Wed, 5 Feb 2014 03:21:22 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Limal",
"Nicolas",
""
]
] |
new_dataset
| 0.954465 |
1402.1141
|
Carlos Pedro dos Santos Gon\c{c}alves
|
Carlos Pedro Gon\c{c}alves
|
Quantum Cybernetics and Complex Quantum Systems Science - A Quantum
Connectionist Exploration
| null | null | null | null |
cs.NE cond-mat.dis-nn quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum cybernetics and its connections to complex quantum systems science is
addressed from the perspective of complex quantum computing systems. In this
way, the notion of an autonomous quantum computing system is introduced in
regards to quantum artificial intelligence, and applied to quantum artificial
neural networks, considered as autonomous quantum computing systems, which
leads to a quantum connectionist framework within quantum cybernetics for
complex quantum computing systems. Several examples of quantum feedforward
neural networks are addressed in regards to Boolean functions' computation,
multilayer quantum computation dynamics, entanglement and quantum
complementarity. The examples provide a framework for a reflection on the role
of quantum artificial neural networks as a general framework for addressing
complex quantum systems that perform network-based quantum computation,
possible consequences are drawn regarding quantum technologies, as well as
fundamental research in complex quantum systems science and quantum biology.
|
[
{
"version": "v1",
"created": "Wed, 5 Feb 2014 19:48:24 GMT"
}
] | 2014-02-06T00:00:00 |
[
[
"Gonçalves",
"Carlos Pedro",
""
]
] |
new_dataset
| 0.997629 |
1310.1582
|
Varun Singh
|
Marcin Nagy, Varun Singh, Joerg Ott, Lars Eggert
|
Congestion Control using FEC for Conversational Multimedia Communication
| null | null |
10.1145/2557642.2557649
| null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new rate control algorithm for conversational
multimedia flows. In our approach, along with Real-time Transport Protocol
(RTP) media packets, we propose sending redundant packets to probe for
available bandwidth. These redundant packets are Forward Error Correction (FEC)
encoded RTP packets. A straightforward interpretation is that if no losses
occur, the sender can increase the sending rate to include the FEC bit rate,
and in the case of losses due to congestion the redundant packets help in
recovering the lost packets. We also show that by varying the FEC bit rate, the
sender is able to conservatively or aggressively probe for available bandwidth.
We evaluate our FEC-based Rate Adaptation (FBRA) algorithm in a network
simulator and in the real-world and compare it to other congestion control
algorithms.
|
[
{
"version": "v1",
"created": "Sun, 6 Oct 2013 13:04:16 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Nagy",
"Marcin",
""
],
[
"Singh",
"Varun",
""
],
[
"Ott",
"Joerg",
""
],
[
"Eggert",
"Lars",
""
]
] |
new_dataset
| 0.977581 |
1312.6650
|
Samaneh Kazemi Nafchi
|
Samaneh Kazemi Nafchi, Rohan Garg, Gene Cooperman
|
Transparent Checkpoint-Restart for Hardware-Accelerated 3D Graphics
|
20 pages, 6 figures, 4 tables
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Providing fault-tolerance for long-running GPU-intensive jobs requires
application-specific solutions, and often involves saving the state of complex
data structures spread among many graphics libraries. This work describes a
mechanism for transparent GPU-independent checkpoint-restart of 3D graphics.
The approach is based on a record-prune-replay paradigm: all OpenGL calls
relevant to the graphics driver state are recorded; calls not relevant to the
internal driver state as of the last graphics frame prior to checkpoint are
discarded; and the remaining calls are replayed on restart. A previous approach
for OpenGL 1.5, based on a shadow device driver, required more than 78,000
lines of OpenGL-specific code. In contrast, the new approach, based on
record-prune-replay, is used to implement the same case in just 4,500 lines of
code. The speed of this approach varies between 80 per cent and nearly 100 per
cent of the speed of the native hardware acceleration for OpenGL 1.5, as
measured when running the ioquake3 game under Linux. This approach has also
been extended to demonstrate checkpointing of OpenGL 3.0 for the first time,
with a demonstration for PyMol, for molecular visualization.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 19:19:40 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Feb 2014 23:01:55 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Nafchi",
"Samaneh Kazemi",
""
],
[
"Garg",
"Rohan",
""
],
[
"Cooperman",
"Gene",
""
]
] |
new_dataset
| 0.999588 |
1401.1100
|
Klaus Jaffe Dr
|
Klaus Jaffe, Astrid Florez, Cristina M Gomes, Daniel Rodriguez, Carla
Achury
|
On the biological and cultural evolution of shame: Using internet search
tools to weight values in many cultures
|
Submitted for publication
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shame has clear biological roots and its precise form of expression affects
social cohesion and cultural characteristics. Here we explore the relative
importance between shame and guilt by using Google Translate to produce
translation for the words shame, guilt, pain, embarrassment and fear to the 64
languages covered. We also explore the meanings of these concepts among the
Yanomami, a horticulturist hunter-gatherer tribe in the Orinoquia. Results show
that societies previously described as 'guilt societies' have more words for
guilt than for shame, but the large majority, including the societies
previously described as 'shame societies', have more words for shame than for
guilt. Results are consistent with evolutionary models of shame which predict a
wide scatter in the relative importance between guilt and shame, suggesting
that cultural evolution of shame has continued the work of biological
evolution, and that neither provides a strong adaptive advantage to either
shame or guilt. We propose that the study of shame will improve our
understanding of the interaction between biological and cultural evolution in
the evolution of cognition and emotions.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2014 15:34:28 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Feb 2014 21:57:06 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Jaffe",
"Klaus",
""
],
[
"Florez",
"Astrid",
""
],
[
"Gomes",
"Cristina M",
""
],
[
"Rodriguez",
"Daniel",
""
],
[
"Achury",
"Carla",
""
]
] |
new_dataset
| 0.994199 |
1402.0569
|
Babak Bagheri Hariri
|
Babak Bagheri Hariri, Diego Calvanese, Marco Montali, Giuseppe De
Giacomo, Riccardo De Masellis, Paolo Felli
|
Description Logic Knowledge and Action Bases
| null |
Journal Of Artificial Intelligence Research, Volume 46, pages
651-686, 2013
|
10.1613/jair.3826
| null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Description logic Knowledge and Action Bases (KAB) are a mechanism for
providing both a semantically rich representation of the information on the
domain of interest in terms of a description logic knowledge base and actions
to change such information over time, possibly introducing new objects. We
resort to a variant of DL-Lite where the unique name assumption is not enforced
and where equality between objects may be asserted and inferred. Actions are
specified as sets of conditional effects, where conditions are based on
epistemic queries over the knowledge base (TBox and ABox), and effects are
expressed in terms of new ABoxes. In this setting, we address verification of
temporal properties expressed in a variant of first-order mu-calculus with
quantification across states. Notably, we show decidability of verification,
under a suitable restriction inspired by the notion of weak acyclicity in data
exchange.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 01:36:58 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Hariri",
"Babak Bagheri",
""
],
[
"Calvanese",
"Diego",
""
],
[
"Montali",
"Marco",
""
],
[
"De Giacomo",
"Giuseppe",
""
],
[
"De Masellis",
"Riccardo",
""
],
[
"Felli",
"Paolo",
""
]
] |
new_dataset
| 0.998692 |
1402.0582
|
Maliheh Aramon Bajestani
|
Maliheh Aramon Bajestani, J. Christopher Beck
|
Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
| null |
Journal Of Artificial Intelligence Research, Volume 47, pages
35-70, 2013
|
10.1613/jair.3902
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address a dynamic repair shop scheduling problem in the context of
military aircraft fleet management where the goal is to maintain a full
complement of aircraft over the long-term. A number of flights, each with a
requirement for a specific number and type of aircraft, are already scheduled
over a long horizon. We need to assign aircraft to flights and schedule repair
activities while considering the flights requirements, repair capacity, and
aircraft failures. The number of aircraft awaiting repair dynamically changes
over time due to failures and it is therefore necessary to rebuild the repair
schedule online. To solve the problem, we view the dynamic repair shop as
successive static repair scheduling sub-problems over shorter time periods. We
propose a complete approach based on the logic-based Benders decomposition to
solve the static sub-problems, and design different rescheduling policies to
schedule the dynamic repair shop. Computational experiments demonstrate that
the Benders model is able to find and prove optimal solutions on average four
times faster than a mixed integer programming model. The rescheduling approach
having both aspects of scheduling over a longer horizon and quickly adjusting
the schedule increases aircraft available in the long term by 10% compared to
the approaches having either one of the aspects alone.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 01:42:10 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Bajestani",
"Maliheh Aramon",
""
],
[
"Beck",
"J. Christopher",
""
]
] |
new_dataset
| 0.998538 |
1402.0584
|
Shaowei Cai
|
Shaowei Cai, Kaile Su, Chuan Luo, Abdul Sattar
|
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
| null |
Journal Of Artificial Intelligence Research, Volume 46, pages
687-716, 2013
|
10.1613/jair.3907
| null |
cs.AI cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial
optimization problem of great importance in both theory and application. Local
search has proved successful for this problem. However, there are two main
drawbacks in state-of-the-art MVC local search algorithms. First, they select a
pair of vertices to exchange simultaneously, which is time-consuming. Secondly,
although using edge weighting techniques to diversify the search, these
algorithms lack mechanisms for decreasing the weights. To address these issues,
we propose two new strategies: two-stage exchange and edge weighting with
forgetting. The two-stage exchange strategy selects two vertices to exchange
separately and performs the exchange in two stages. The strategy of edge
weighting with forgetting not only increases weights of uncovered edges, but
also decreases some weights for each edge periodically. These two strategies
are used in designing a new MVC local search algorithm, which is referred to as
NuMVC. We conduct extensive experimental studies on the standard benchmarks,
namely DIMACS and BHOSLIB. The experiment comparing NuMVC with state-of-the-art
heuristic algorithms show that NuMVC is at least competitive with the nearest
competitor namely PLS on the DIMACS benchmark, and clearly dominates all
competitors on the BHOSLIB benchmark. Also, experimental results indicate that
NuMVC finds an optimal solution much faster than the current best exact
algorithm for Maximum Clique on random instances as well as some structured
ones. Moreover, we study the effectiveness of the two strategies and the
run-time behaviour through experimental analysis.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 01:42:48 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Cai",
"Shaowei",
""
],
[
"Su",
"Kaile",
""
],
[
"Luo",
"Chuan",
""
],
[
"Sattar",
"Abdul",
""
]
] |
new_dataset
| 0.983001 |
1402.0670
|
Roshan Ragel
|
B.A.N.M. Bambarasinghe, H.M.S. Huruggamuwa, R.G. Ragel and S.
Radhakrishnan
|
Axis2UNO: Web Services Enabled Openoffice.org
|
6 pages, 4th International Conference on Information and Automation
for Sustainability, 2008. ICIAFS 2008
|
ICIAFS 2008. 437-442, 12-14 Dec. 2008
|
10.1109/ICIAFS.2008.4783956
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Openoffice.org is a popular, free and open source office product. This
product is used by millions of people and developed, maintained and extended by
thousands of developers worldwide. Playing a dominant role in the web, web
services technology is serving millions of people every day. Axis2 is one of
the most popular, free and open source web service engines. The framework
presented in this paper, Axis2UNO, a combination of such two technologies is
capable of making a new era in office environment. Two other attempts to
enhance web services functionality in office products are Excel Web Services
and UNO Web Service Proxy. Excel Web Services is combined with Microsoft
SharePoint technology and exposes information sharing in a different
perspective within the proprietary Microsoft office products. UNO Web Service
Proxy is implemented with Java Web Services Developer Pack and enables basic
web services related functionality in Openoffice.org. However, the work
presented here is the first one to combine Openoffice.org and Axis2 and we
expect it to outperform the other efforts with the community involvement and
feature richness in those products.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 09:31:51 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Bambarasinghe",
"B. A. N. M.",
""
],
[
"Huruggamuwa",
"H. M. S.",
""
],
[
"Ragel",
"R. G.",
""
],
[
"Radhakrishnan",
"S.",
""
]
] |
new_dataset
| 0.999862 |
1402.0708
|
Sadik Ulker
|
Ezgi Deniz Ulker and Sadik Ulker
|
Microstrip Coupler Design Using Bat Algorithm
|
7 pages, 4 figures, 1 table
|
International Journal of Artificial Intelligence & Applications
(IJAIA), vol. 5, no. 1, January 2014, pp. 127-133
|
10.5121/ijaia.2014.5110
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Evolutionary and swarm algorithms have found many applications in design
problems since todays computing power enables these algorithms to find
solutions to complicated design problems very fast. Newly proposed hybrid
algorithm, bat algorithm, has been applied for the design of microwave
microstrip couplers for the first time. Simulation results indicate that the
bat algorithm is a very fast algorithm and it produces very reliable results.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 12:25:31 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Ulker",
"Ezgi Deniz",
""
],
[
"Ulker",
"Sadik",
""
]
] |
new_dataset
| 0.962686 |
1402.0729
|
Nikolaos Pappas
|
Nikolaos Pappas, Anthony Ephremides, Apostolos Traganitis
|
Stability and Performance Issues of a Relay Assisted Multiple Access
Scheme with MPR Capabilities
|
Accepted for publication in Elsevier Computer Communications. arXiv
admin note: substantial text overlap with arXiv:1105.0452
| null |
10.1016/j.comcom.2014.01.004
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study the impact of a relay node to a network with a finite
number of users-sources and a destination node. We assume that the users have
saturated queues and the relay node does not have packets of its own; we have
random access of the medium and the time is slotted. The relay node stores a
source packet that it receives successfully in its queue when the transmission
to the destination node has failed. The relay and the destination nodes have
multi-packet reception capabilities. We obtain analytical equations for the
characteristics of the relay's queue such as average queue length, stability
conditions etc. We also study the throughput per user and the aggregate
throughput for the network.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 13:31:44 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Pappas",
"Nikolaos",
""
],
[
"Ephremides",
"Anthony",
""
],
[
"Traganitis",
"Apostolos",
""
]
] |
new_dataset
| 0.98263 |
1402.0736
|
V Karthikeyan VKK
|
V.Karthikeyan, Geethanjali.S, Mekala.M, Deepika.T
|
Water Eminence Scrutinizing Scheme Based On Zigbee and Wireless Antenna
Expertise - A Study
|
8 FIGURES AND 5 PAGES
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Network is the essential structure of a water eminence
monitoring by means of wireless sensor network technology To scrutinize water
quality greater than different sites as a synchronized application an estimable
system structural design constituted by spread sensor nodes and a base station
is suggested The nodes and base stations are linked using WSN technology like
Zigbee Base stations are related via Ethernet. Design and execution of a
prototype using WSN technology are the exigent work. Data are identified by
means of dissimilar sensors at the node plane to compute the parameters like
turbidity and oxygen quantity is transmitted via WSN to the support station
Information unruffled from the distant location is capable of displayed in
diagram setup as well as it is able to be calculated using dissimilar
replication tools at the supporting station. The recent methods have benefits
such as null amount carbon emission low power utilization more stretchy to put
together at distant locations.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 13:58:38 GMT"
}
] | 2014-02-05T00:00:00 |
[
[
"Karthikeyan",
"V.",
""
],
[
"S",
"Geethanjali.",
""
],
[
"M",
"Mekala.",
""
],
[
"T",
"Deepika.",
""
]
] |
new_dataset
| 0.987617 |
1402.0024
|
Oliver Schaudt
|
Van Bang Le and Andrea Oversberg and Oliver Schaudt
|
Polynomial time recognition of squares of ptolemaic graphs and
3-sun-free split graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The square of a graph $G$, denoted $G^2$, is obtained from $G$ by putting an
edge between two distinct vertices whenever their distance is two. Then $G$ is
called a square root of $G^2$. Deciding whether a given graph has a square root
is known to be NP-complete, even if the root is required to be a chordal graph
or even a split graph.
We present a polynomial time algorithm that decides whether a given graph has
a ptolemaic square root. If such a root exists, our algorithm computes one with
a minimum number of edges.
In the second part of our paper, we give a characterization of the graphs
that admit a 3-sun-free split square root. This characterization yields a
polynomial time algorithm to decide whether a given graph has such a root, and
if so, to compute one.
|
[
{
"version": "v1",
"created": "Fri, 31 Jan 2014 22:40:31 GMT"
}
] | 2014-02-04T00:00:00 |
[
[
"Le",
"Van Bang",
""
],
[
"Oversberg",
"Andrea",
""
],
[
"Schaudt",
"Oliver",
""
]
] |
new_dataset
| 0.998191 |
1402.0068
|
V Karthikeyan VKK
|
V.Karthikeyan and V.J.Vijayalakshmi
|
Radiation Pattern of Patch Antenna with Slits
|
6 pages and 7 figures
| null |
10.5121/ijit.2014.3101
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Microstrip antenna has been commercially used in many applications, such
as direct broadcast satellite service, mobile satellite communications, global
positioning system, medical hyperthermia usage, etc. The patch antenna of the
size reduction at a given operating frequency is obtained. Mobile personal
communication systems and wireless computer networks are most commonly used
nowadays and they are in need of antennas in different frequency bands. In
regulate to without difficulty incorporate these antennas into individual
systems, a micro strip scrap transmitter have been preferred and intended for a
convinced divergence. There is also an analysis of radiation pattern, Gain of
the antenna, Directivity of the antenna, Electric Far Field. The simulations
results are obtained by using electromagnetic simulation software called feko
software are presented and discussed
|
[
{
"version": "v1",
"created": "Sat, 1 Feb 2014 10:01:39 GMT"
}
] | 2014-02-04T00:00:00 |
[
[
"Karthikeyan",
"V.",
""
],
[
"Vijayalakshmi",
"V. J.",
""
]
] |
new_dataset
| 0.998533 |
1402.0200
|
David Coyle Dr
|
Alison Burrows, Rachel Gooberman-Hill, Ian Craddock and David Coyle
|
SPHERE: Meaningful and Inclusive Sensor-Based Home Healthcare
|
Presented at the ACM CSCW 2014 workshop on Designing with Users for
Domestic environments: Methods, Challenges, Lessons Learned
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given current demographic and health trends, and their economic implications,
home healthcare technology has become a fertile area for research and
development. Motivated by the need for a radical reform of healthcare
provision, SPHERE is a large-scale Interdisciplinary Research Collaboration
that aims to develop home sensor systems to monitor people's health and
wellbeing in the home. This paper outlines the unique circumstances of
designing healthcare technology for the home environment, with a particular
focus on how to ensure future systems are meaningful to and desirable for the
intended users.
|
[
{
"version": "v1",
"created": "Sun, 2 Feb 2014 15:15:30 GMT"
}
] | 2014-02-04T00:00:00 |
[
[
"Burrows",
"Alison",
""
],
[
"Gooberman-Hill",
"Rachel",
""
],
[
"Craddock",
"Ian",
""
],
[
"Coyle",
"David",
""
]
] |
new_dataset
| 0.999525 |
1402.0247
|
Rumaisah Munir
|
Ms. Rumaisah Munir
|
Secure Debit Card Device Model
|
Royal Institute of Technology, KTH
| null | null | null |
cs.CE cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The project envisages the implementation of an e-payment system utilizing
FIPS-201 Smart Card. The system combines hardware and software modules. The
hardware module takes data insertions (e.g. currency notes), processes the data
and then creates connection with the smart card using serial/USB ports to
perform further mathematical manipulations. The hardware interacts with servers
at the back for authentication and identification of users and for data storage
pertaining to a particular user. The software module manages database, handles
identities, provide authentication and secure communication between the various
system components. It will also provide a component to the end users. This
component can be in the form of software for computer or executable binaries
for PoS devices. The idea is to receive data in the embedded system from data
reader and smart card. After manipulations, the updated data is imprinted on
smart card memory and also updated in the back end servers maintaining
database. The information to be sent to a server is sent through a PoS device
which has multiple transfer mediums involving wired and un-wired mediums. The
user device also acts as an updater; therefore, whenever the smart card is
inserted by user, it is automatically updated by synchronizing with back-end
database. The project required expertise in embedded systems, networks, java
and C++ (Optional).
|
[
{
"version": "v1",
"created": "Sun, 2 Feb 2014 21:08:07 GMT"
}
] | 2014-02-04T00:00:00 |
[
[
"Munir",
"Ms. Rumaisah",
""
]
] |
new_dataset
| 0.997203 |
1207.3316
|
Mirsad \v{C}irki\'c
|
Mirsad \v{C}irki\'c and Erik G. Larsson
|
SUMIS: Near-Optimal Soft-In Soft-Out MIMO Detection With Low and Fixed
Complexity
|
Accepted for publication in the IEEE Transactions on Signal
Processing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fundamental problem of our interest here is soft-input soft-output
multiple-input multiple-output (MIMO) detection. We propose a method, referred
to as subspace marginalization with interference suppression (SUMIS), that
yields unprecedented performance at low and fixed (deterministic) complexity.
Our method provides a well-defined tradeoff between computational complexity
and performance. Apart from an initial sorting step consisting of selecting
channel-matrix columns, the algorithm involves no searching nor algorithmic
branching; hence the algorithm has a completely predictable run-time and allows
for a highly parallel implementation. We numerically assess the performance of
SUMIS in different practical settings: full/partial channel state information,
sequential/iterative decoding, and low/high rate outer codes. We also comment
on how the SUMIS method performs in systems with a large number of transmit
antennas.
|
[
{
"version": "v1",
"created": "Fri, 13 Jul 2012 17:52:38 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Aug 2013 10:00:46 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Jan 2014 09:43:15 GMT"
}
] | 2014-02-03T00:00:00 |
[
[
"Čirkić",
"Mirsad",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.975968 |
1310.3040
|
Loet Leydesdorff
|
Loet Leydesdorff, Evgeniy Perevodchikov, and Alexander Uvarov
|
Measuring Triple-Helix Synergy in the Russian Innovation Systems at
Regional, Provincial, and National Levels
|
accepted for publication in the Journal of the Association for
Information Science and Technology JASIST
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We measure synergy for the Russian national, provincial, and regional
innovation systems as reduction of uncertainty using mutual information among
the three distributions of firm sizes, technological knowledge-bases of firms,
and geographical locations. Half a million data at firm level in 2011 were
obtained from the Orbis database of Bureau Van Dijk. The firm level data were
aggregated at the levels of eight Federal Districts, the regional level of 83
Federal Subjects, and the single level of the Russian Federation. Not
surprisingly, the knowledge base of the economy is concentrated in the Moscow
region (22.8%); St. Petersburg follows with 4.0%. Only 0.4% of the firms are
classified as high-tech, and 2.7% as medium-tech manufacturing (NACE, Rev. 2).
Except in Moscow itself, high-tech manufacturing does not add synergy to any
other unit at any of the various levels of geographical granularity; instead it
disturbs regional coordination even in the region surrounding Moscow ("Moscow
Region"). In the case of medium-tech manufacturing, there is also synergy in
St. Petersburg. Knowledge-intensive services (KIS; including laboratories)
contribute 12.8% to the economy in terms of establishments and contribute to
the synergy in all Federal Districts (except the North-Caucasian Federal
District), but only in 30 of the 83 Federal Subjects. The synergy in KIS is
concentrated in centers of administration. Unlike Western European countries,
the knowledge-intensive services (which are often state-affiliated) thus
provide backbone to an emerging knowledge-based economy at the level of Federal
Districts, but the economy is otherwise not knowledge-based (except for the
Moscow region).
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 07:52:48 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Jan 2014 10:13:04 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Jan 2014 07:03:27 GMT"
}
] | 2014-02-03T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Perevodchikov",
"Evgeniy",
""
],
[
"Uvarov",
"Alexander",
""
]
] |
new_dataset
| 0.990081 |
1312.3938
|
Jiajun Cao
|
Jiajun Cao, Gregory Kerr, Kapil Arya, Gene Cooperman
|
Transparent Checkpoint-Restart over InfiniBand
|
22 pages, 2 figures, 9 tables
| null | null | null |
cs.OS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
InfiniBand is widely used for low-latency, high-throughput cluster computing.
Saving the state of the InfiniBand network as part of distributed checkpointing
has been a long-standing challenge for researchers. Because of a lack of a
solution, typical MPI implementations have included custom checkpoint-restart
services that "tear down" the network, checkpoint each node as if the node were
a standalone computer, and then re-connect the network again. We present the
first example of transparent, system-initiated checkpoint-restart that directly
supports InfiniBand. The new approach is independent of any particular Linux
kernel, thus simplifying the current practice of using a kernel-based module,
such as BLCR. This direct approach results in checkpoints that are found to be
faster than with the use of a checkpoint-restart service. The generality of
this approach is shown not only by checkpointing an MPI computation, but also a
native UPC computation (Berkeley Unified Parallel C), which does not use MPI.
Scalability is shown by checkpointing 2,048 MPI processes across 128 nodes
(with 16 cores per node). In addition, a cost-effective debugging approach is
also enabled, in which a checkpoint image from an InfiniBand-based production
cluster is copied to a local Ethernet-based cluster, where it can be restarted
and an interactive debugger can be attached to it. This work is based on a
plugin that extends the DMTCP (Distributed MultiThreaded CheckPointing)
checkpoint-restart package.
|
[
{
"version": "v1",
"created": "Fri, 13 Dec 2013 20:53:39 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Dec 2013 07:41:11 GMT"
},
{
"version": "v3",
"created": "Thu, 30 Jan 2014 21:39:39 GMT"
}
] | 2014-02-03T00:00:00 |
[
[
"Cao",
"Jiajun",
""
],
[
"Kerr",
"Gregory",
""
],
[
"Arya",
"Kapil",
""
],
[
"Cooperman",
"Gene",
""
]
] |
new_dataset
| 0.996611 |
1401.8023
|
David Wood
|
Bradley Baetz and David R. Wood
|
Brooks' Vertex-Colouring Theorem in Linear Time
| null | null | null |
Technical Report CS-AAG-2001-05, Basser Department of Computer
Science, The University of Sydney, 2001
|
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brooks' Theorem [R. L. Brooks, On Colouring the Nodes of a Network, Proc.
Cambridge Philos. Soc.} 37:194-197, 1941] states that every graph $G$ with
maximum degree $\Delta$, has a vertex-colouring with $\Delta$ colours, unless
$G$ is a complete graph or an odd cycle, in which case $\Delta+1$ colours are
required. Lov\'asz [L. Lov\'asz, Three short proofs in graph theory, J. Combin.
Theory Ser. 19:269-271, 1975] gives an algorithmic proof of Brooks' Theorem.
Unfortunately this proof is missing important details and it is thus unclear
whether it leads to a linear time algorithm. In this paper we give a complete
description of the proof of Lov\'asz, and we derive a linear time algorithm for
determining the vertex-colouring guaranteed by Brooks' Theorem.
|
[
{
"version": "v1",
"created": "Thu, 30 Jan 2014 23:11:08 GMT"
}
] | 2014-02-03T00:00:00 |
[
[
"Baetz",
"Bradley",
""
],
[
"Wood",
"David R.",
""
]
] |
new_dataset
| 0.999143 |
1401.8226
|
Prasanth Karunakaran
|
Prasanth Karunakaran, Thomas Wagner, Ansgar Scherb and Wolfgang
Gerstacker
|
Sensing for Spectrum Sharing in Cognitive LTE-A Cellular Networks
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we present a case for dynamic spectrum sharing between different
operators in systems with carrier aggregation (CA) which is an important
feature in 3GPP LTE-A systems. Cross-carrier scheduling and sensing are
identified as key enablers for such spectrum sharing in LTE-A. Sensing is
classified as Type 1 sensing and Type 2 sensing and the role of each in the
system operation is discussed. The more challenging Type 2 sensing which
involves sensing the interfering signal in the presence of a desired signal is
studied for a single-input single-output system. Energy detection and the most
powerful test are formulated. The probability of false alarm and of detection
are analyzed for energy detectors. Performance evaluations show that reasonable
sensing performance can be achieved with the use of channel state information,
making such sensing practically viable.
|
[
{
"version": "v1",
"created": "Thu, 30 Jan 2014 14:45:06 GMT"
}
] | 2014-02-03T00:00:00 |
[
[
"Karunakaran",
"Prasanth",
""
],
[
"Wagner",
"Thomas",
""
],
[
"Scherb",
"Ansgar",
""
],
[
"Gerstacker",
"Wolfgang",
""
]
] |
new_dataset
| 0.99466 |
1401.7828
|
Cristina Flaut
|
Cristina Flaut
|
Codes over a subset of Octonion Integers
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we define codes over some Octonion integers. We prove that in
some conditions these codes can correct up to two errors for a transmitted
vector and the code rate of the codes is grater than the code rate of the codes
defined on some subset of Quaternion integers.
|
[
{
"version": "v1",
"created": "Thu, 30 Jan 2014 12:38:13 GMT"
}
] | 2014-01-31T00:00:00 |
[
[
"Flaut",
"Cristina",
""
]
] |
new_dataset
| 0.997252 |
1401.7444
|
Yossi Gilad
|
Yossi Gilad, Amir Herzberg, Ari Trachtenberg
|
Securing Smartphones: A Micro-TCB Approach
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As mobile phones have evolved into `smartphones', with complex operating
systems running third- party software, they have become increasingly vulnerable
to malicious applications (malware). We introduce a new design for mitigating
malware attacks against smartphone users, based on a small trusted computing
base module, denoted uTCB. The uTCB manages sensitive data and sensors, and
provides core services to applications, independently of the operating system.
The user invokes uTCB using a simple secure attention key, which is pressed in
order to validate physical possession of the device and authorize a sensitive
action; this protects private information even if the device is infected with
malware. We present a proof-of-concept implementation of uTCB based on ARM's
TrustZone, a secure execution environment increasingly found in smartphones,
and evaluate our implementation using simulations.
|
[
{
"version": "v1",
"created": "Wed, 29 Jan 2014 09:20:53 GMT"
}
] | 2014-01-30T00:00:00 |
[
[
"Gilad",
"Yossi",
""
],
[
"Herzberg",
"Amir",
""
],
[
"Trachtenberg",
"Ari",
""
]
] |
new_dataset
| 0.988078 |
1401.7483
|
Pawel Krawczyk
|
Pawel Krawczyk
|
Secure SAML validation to prevent XML signature wrapping attacks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SAML assertions are becoming popular method for passing authentication and
authorisation information between identity providers and consumers using
various single sign-on protocols. However their practical security strongly
depends on correct implementation, especially on the consumer side. Somorovsky
and others have demonstrated a number of XML signature related vulnerabilities
in SAML assertion validation frameworks. This article demonstrates how bad
library documentation and examples can lead to vulnerable consumer code and how
this can be avoided.
|
[
{
"version": "v1",
"created": "Wed, 29 Jan 2014 12:13:19 GMT"
}
] | 2014-01-30T00:00:00 |
[
[
"Krawczyk",
"Pawel",
""
]
] |
new_dataset
| 0.985134 |
1401.7492
|
Nikita Polianskii
|
A. Dyachkov
|
Lectures on DNA Codes
|
24 pages, 2 figures
|
A. Dyachkov, P. Vilenkin, I. Ismagilov, R. Sarbayev, A. Macula, D.
Torney, P. White, "On dna codes"// Problems of Information Transmission, vol.
41, no. 4, pp. 349-367, 2005
| null | null |
cs.IT math.IT q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For $q$-ary $n$-sequences, we develop the concept of similarity functions
that can be used (for $q=4$) to model a thermodynamic similarity on DNA
sequences. A similarity function is identified by the length of a longest
common subsequence between two $q$-ary $n$-sequences. Codes based on similarity
functions are called DNA codes. DNA codes are important components in
biomolecular computing and other biotechnical applications that employ DNA
hybridization assays. The main aim of the given lecture notes -- to discuss
lower bounds on the rate of optimal DNA codes for a biologically motivated
similarity function called a block similarity and for the conventional deletion
similarity function used in the theory of error-correcting codes. We also
present constructions of suboptimal DNA codes based on the parity-check code
detecting one error in the Hamming metric.
|
[
{
"version": "v1",
"created": "Wed, 29 Jan 2014 12:37:45 GMT"
}
] | 2014-01-30T00:00:00 |
[
[
"Dyachkov",
"A.",
""
]
] |
new_dataset
| 0.988308 |
1401.7631
|
Natalia Melnikova
|
N.B. Melnikova, D. Jordan, V.V. Krzhizhanovskaya, P.M.A. Sloot
|
Slope Instability of the Earthen Levee in Boston, UK: Numerical
Simulation and Sensor Data Analysis
| null | null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a slope stability analysis for a heterogeneous earthen
levee in Boston, UK, which is prone to occasional slope failures under tidal
loads. Dynamic behavior of the levee under tidal fluctuations was simulated
using a finite element model of variably saturated linear elastic perfectly
plastic soil. Hydraulic conductivities of the soil strata have been calibrated
according to piezometers readings, in order to obtain correct range of
hydraulic loads in tidal mode. Finite element simulation was complemented with
series of limit equilibrium analyses. Stability analyses have shown that slope
failure occurs with the development of a circular slip surface located in the
soft clay layer. Both models (FEM and LEM) confirm that the least stable
hydraulic condition is the combination of the minimum river levels at low tide
with the maximal saturation of soil layers. FEM results indicate that in winter
time the levee is almost at its limit state, at the margin of safety (strength
reduction factor values are 1.03 and 1.04 for the low-tide and high-tide
phases, respectively); these results agree with real-life observations. The
stability analyses have been implemented as real-time components integrated
into the UrbanFlood early warning system for flood protection.
|
[
{
"version": "v1",
"created": "Wed, 29 Jan 2014 19:27:24 GMT"
}
] | 2014-01-30T00:00:00 |
[
[
"Melnikova",
"N. B.",
""
],
[
"Jordan",
"D.",
""
],
[
"Krzhizhanovskaya",
"V. V.",
""
],
[
"Sloot",
"P. M. A.",
""
]
] |
new_dataset
| 0.972721 |
1401.7651
|
O\u{g}uz Sunay
|
Volkan Yazici, M. Oguz Sunay, Ali O. Ercan
|
Controlling a Software-Defined Network via Distributed Controllers
|
6 pages, 4 figures
|
Proceedings of the 2012 NEM Summit, pp. 16-20, Istanbul, Turkey,
October 16-18, 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a distributed OpenFlow controller and an associated
coordination framework that achieves scalability and reliability even under
heavy data center loads. The proposed framework, which is designed to work with
all existing OpenFlow controllers with minimal or no required changes, provides
support for dynamic addition and removal of controllers to the cluster without
any interruption to the network operation. We demonstrate performance results
of the proposed framework implemented over an experimental testbed that uses
controllers running Beacon.
|
[
{
"version": "v1",
"created": "Wed, 29 Jan 2014 20:35:00 GMT"
}
] | 2014-01-30T00:00:00 |
[
[
"Yazici",
"Volkan",
""
],
[
"Sunay",
"M. Oguz",
""
],
[
"Ercan",
"Ali O.",
""
]
] |
new_dataset
| 0.990308 |
1011.1201
|
Abuzer Yakaryilmaz
|
Abuzer Yakaryilmaz and Rusins Freivalds and A. C. Cem Say and Ruben
Agadzanyan
|
Quantum computation with devices whose contents are never read
|
32 pages, a preliminary version of this work was presented in the 9th
International Conference on Unconventional Computation (UC2010)
|
Natural Computing, March 2012, Volume 11, Issue 1, pp 81-94
|
10.1007/s11047-011-9270-0
| null |
cs.CC cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In classical computation, a "write-only memory" (WOM) is little more than an
oxymoron, and the addition of WOM to a (deterministic or probabilistic)
classical computer brings no advantage. We prove that quantum computers that
are augmented with WOM can solve problems that neither a classical computer
with WOM nor a quantum computer without WOM can solve, when all other resource
bounds are equal. We focus on realtime quantum finite automata, and examine the
increase in their power effected by the addition of WOMs with different access
modes and capacities. Some problems that are unsolvable by two-way
probabilistic Turing machines using sublogarithmic amounts of read/write memory
are shown to be solvable by these enhanced automata.
|
[
{
"version": "v1",
"created": "Thu, 4 Nov 2010 16:20:48 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Yakaryilmaz",
"Abuzer",
""
],
[
"Freivalds",
"Rusins",
""
],
[
"Say",
"A. C. Cem",
""
],
[
"Agadzanyan",
"Ruben",
""
]
] |
new_dataset
| 0.97694 |
1105.0165
|
Abuzer Yakaryilmaz
|
A. C. Cem Say and Abuzer Yakaryilmaz
|
Quantum counter automata
|
A revised version. 16 pages. A preliminary version of this paper
appeared as A. C. Cem Say, Abuzer Yakary{\i}lmaz, and \c{S}efika
Y\"{u}zsever. Quantum one-way one-counter automata. In R\={u}si\c{n}\v{s}
Freivalds, editor, Randomized and quantum computation, pages 25--34, 2010
(Satellite workshop of MFCS and CSL 2010)
|
Int. J. Found. Comput. Sci. 23, 1099 (2012)
|
10.1142/S012905411250013X
| null |
cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The question of whether quantum real-time one-counter automata (rtQ1CAs) can
outperform their probabilistic counterparts has been open for more than a
decade. We provide an affirmative answer to this question, by demonstrating a
non-context-free language that can be recognized with perfect soundness by a
rtQ1CA. This is the first demonstration of the superiority of a quantum model
to the corresponding classical one in the real-time case with an error bound
less than 1. We also introduce a generalization of the rtQ1CA, the quantum
one-way one-counter automaton (1Q1CA), and show that they too are superior to
the corresponding family of probabilistic machines. For this purpose, we
provide general definitions of these models that reflect the modern approach to
the definition of quantum finite automata, and point out some problems with
previous results. We identify several remaining open problems.
|
[
{
"version": "v1",
"created": "Sun, 1 May 2011 12:49:21 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Sep 2011 07:48:30 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Say",
"A. C. Cem",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.998607 |
1210.4352
|
George Mertzios
|
George B. Mertzios
|
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders
is Polynomial
|
27 pages, 4 figures, 5 algorithms
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intersection graphs of geometric objects have been extensively studied, both
due to their interesting structure and their numerous applications; prominent
examples include interval graphs and permutation graphs. In this paper we study
a natural graph class that generalizes both interval and permutation graphs,
namely \emph{simple-triangle} graphs. Simple-triangle graphs - also known as
\emph{PI} graphs (for Point-Interval) - are the intersection graphs of
triangles that are defined by a point on a line $L_{1}$ and an interval on a
parallel line $L_{2}$. They lie naturally between permutation and trapezoid
graphs, which are the intersection graphs of line segments between $L_{1}$ and
$L_{2}$ and of trapezoids between $L_{1}$ and $L_{2}$, respectively. Although
various efficient recognition algorithms for permutation and trapezoid graphs
are well known to exist, the recognition of simple-triangle graphs has remained
an open problem since their introduction by Corneil and Kamula three decades
ago. In this paper we resolve this problem by proving that simple-triangle
graphs can be recognized in polynomial time. As a consequence, our algorithm
also solves a longstanding open problem in the area of partial orders, namely
the recognition of \emph{linear-interval orders}, i.e. of partial orders
$P=P_{1}\cap P_{2}$, where $P_{1}$ is a linear order and $P_{2}$ is an interval
order. This is one of the first results on recognizing partial orders $P$ that
are the intersection of orders from two different classes $\mathcal{P}_{1}$ and
$\mathcal{P}_{2}$. In complete contrast to this, partial orders $P$ which are
the intersection of orders from the same class $\mathcal{P}$ have been
extensively investigated, and in most cases the complexity status of these
recognition problems has been already established.
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2012 10:53:54 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jan 2014 14:23:38 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Mertzios",
"George B.",
""
]
] |
new_dataset
| 0.998612 |
1305.5655
|
Dmitry Chebukov
|
Dmitry E. Chebukov, Alexander D. Izaak, Olga G. Misyurina, Yuri A.
Pupyrev, Alexey B. Zhizhchenko
|
Math-Net.Ru as a Digital Archive of the Russian Mathematical Knowledge
from the XIX Century to Today
| null |
Lecture Notes in Computer Science, 7961, ed. J. Carette et al.,
2013, 344-348
|
10.1007/978-3-642-39320-4_26
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main goal of the project Math-Net.Ru is to collect scientific
publications in Russian and Soviet mathematics journals since their foundation
to today and the authors of these publications into a single database and to
provide access to full-text articles for broad international mathematical
community. Leading Russian mathematics journals have been comprehensively
digitized dating back to the first volumes.
|
[
{
"version": "v1",
"created": "Fri, 24 May 2013 08:58:34 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Chebukov",
"Dmitry E.",
""
],
[
"Izaak",
"Alexander D.",
""
],
[
"Misyurina",
"Olga G.",
""
],
[
"Pupyrev",
"Yuri A.",
""
],
[
"Zhizhchenko",
"Alexey B.",
""
]
] |
new_dataset
| 0.995779 |
1306.2114
|
Daniel Meister
|
Daniel Meister and Udi Rotics
|
Minimal forbidden induced subgraphs of graphs of bounded clique-width
and bounded linear clique-width
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the study of full bubble model graphs of bounded clique-width and bounded
linear clique-width, we determined complete sets of forbidden induced
subgraphs, that are minimal in the class of full bubble model graphs. In this
note, we show that (almost all of) these graphs are minimal in the class of all
graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs
for graphs of bounded clique-width and for graphs of bounded linear
clique-width for arbitrary bounds.
|
[
{
"version": "v1",
"created": "Mon, 10 Jun 2013 07:14:53 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jan 2014 07:29:11 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Meister",
"Daniel",
""
],
[
"Rotics",
"Udi",
""
]
] |
new_dataset
| 0.997479 |
1401.7134
|
Kasper Fl{\o}e Trillingsgaard
|
Kasper Fl{\o}e Trillingsgaard and Petar Popovski
|
Block-Fading Channels with Delayed CSIT at Finite Blocklength
|
Extended version of a paper submitted to ISIT'14
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many wireless systems, the channel state information at the transmitter
(CSIT) can not be learned until after a transmission has taken place and is
thereby outdated. In this paper, we study the benefits of delayed CSIT on a
block-fading channel at finite blocklength. First, the achievable rates of a
family of codes that allows the number of codewords to expand during
transmission, based on delayed CSIT, are characterized. A fixed-length and a
variable-length characterization of the rates are provided using the dependency
testing bound and the variable-length setting introduced by Polyanskiy et al.
Next, a communication protocol based on codes with expandable message space is
put forth, and numerically, it is shown that higher rates are achievable
compared to coding strategies that do not benefit from delayed CSIT.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 10:59:35 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Trillingsgaard",
"Kasper Fløe",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.997025 |
1401.7146
|
Xiao Lu
|
Xiao Lu, Ke Zhang, Chuan Heng Foh, and Cheng Peng Fu
|
SSthreshless Start: A Sender-Side TCP Intelligence for Long Fat Network
|
25 pages, 10 figures, 7 tables
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Measurement shows that 85% of TCP flows in the internet are short-lived flows
that stay most of their operation in the TCP startup phase. However, many
previous studies indicate that the traditional TCP Slow Start algorithm does
not perform well, especially in long fat networks. Two obvious problems are
known to impact the Slow Start performance, which are the blind initial setting
of the Slow Start threshold and the aggressive increase of the probing rate
during the startup phase regardless of the buffer sizes along the path. Current
efforts focusing on tuning the Slow Start threshold and/or probing rate during
the startup phase have not been considered very effective, which has prompted
an investigation with a different approach. In this paper, we present a novel
TCP startup method, called threshold-less slow start or SSthreshless Start,
which does not need the Slow Start threshold to operate. Instead, SSthreshless
Start uses the backlog status at bottleneck buffer to adaptively adjust probing
rate which allows better seizing of the available bandwidth. Comparing to the
traditional and other major modified startup methods, our simulation results
show that SSthreshless Start achieves significant performance improvement
during the startup phase. Moreover, SSthreshless Start scales well with a wide
range of buffer size, propagation delay and network bandwidth. Besides, it
shows excellent friendliness when operating simultaneously with the currently
popular TCP NewReno connections.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 11:50:10 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Lu",
"Xiao",
""
],
[
"Zhang",
"Ke",
""
],
[
"Foh",
"Chuan Heng",
""
],
[
"Fu",
"Cheng Peng",
""
]
] |
new_dataset
| 0.976732 |
1401.7148
|
Cornelia Victoria Anghel Drugarin
|
Anghel Drugarin, Cornelia Victoria
|
A Software Design through Electrical System for a Building
|
Politehnica Timisoara Press, nov.2013
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer aided design of lighting systems made new installations of lighting
dimensioning and verification of existing lighting systems for both indoor and
outdoor lighting systems.The design of the building light system was in a
dedicated software, named DiaLux, version 4.11.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 11:55:00 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Drugarin",
"Anghel",
""
],
[
"Victoria",
"Cornelia",
""
]
] |
new_dataset
| 0.987852 |
1401.7249
|
Atif Khan
|
Atif Ali Khan, Oumair Naseer, Daciana Iliescu, Evor Hines
|
Fuzzy Controller Design for Assisted Omni-Directional Treadmill Therapy
|
Presented at: "The International Conference on Soft Computing and
Software Engineering (SCSE 2013)" at San Francisco State University at
Downtown Campus, in San Francisco, California, USA, March 1-2, 2013
|
The International Journal of Soft Computing and Software
Engineering [JSCSE], Vol. 3, No. 3, pp. 30-37, 2013
|
10.7321/jscse.v3.n3.8
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the defining characteristic of human being is their ability to walk
upright. Loss or restriction of such ability whether due to the accident, spine
problem, stroke or other neurological injuries can cause tremendous stress on
the patients and hence will contribute negatively to their quality of life.
Modern research shows that physical exercise is very important for maintaining
physical fitness and adopting a healthier life style. In modern days treadmill
is widely used for physical exercises and training which enables the user to
set up an exercise regime that can be adhered to irrespective of the weather
conditions. Among the users of treadmills today are medical facilities such as
hospitals, rehabilitation centres, medical and physiotherapy clinics etc. The
process of assisted training or doing rehabilitation exercise through treadmill
is referred to as treadmill therapy. A modern treadmill is an automated machine
having built in functions and predefined features. Most of the treadmills used
today are one dimensional and user can only walk in one direction. This paper
presents the idea of using omnidirectional treadmills which will be more
appealing to the patients as they can walk in any direction, hence encouraging
them to do exercises more frequently. This paper proposes a fuzzy control
design and possible implementation strategy to assist patients in treadmill
therapy. By intelligently controlling the safety belt attached to the treadmill
user, one can help them steering left, right or in any direction. The use of
intelligent treadmill therapy can help patients to improve their walking
ability without being continuously supervised by the specialists. The patients
can walk freely within a limited space and the support system will provide
continuous evaluation of their position and can adjust the control parameters
of treadmill accordingly to provide best possible assistance.
|
[
{
"version": "v1",
"created": "Fri, 24 Jan 2014 14:25:53 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Khan",
"Atif Ali",
""
],
[
"Naseer",
"Oumair",
""
],
[
"Iliescu",
"Daciana",
""
],
[
"Hines",
"Evor",
""
]
] |
new_dataset
| 0.991039 |
1401.7289
|
Kenta Kasai
|
Takuya Okazaki and Kenta Kasai
|
Spatially-Coupled MacKay-Neal Codes with No Bit Nodes of Degree Two
Achieve the Capacity of BEC
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Obata et al. proved that spatially-coupled (SC) MacKay-Neal (MN) codes
achieve the capacity of BEC. However, the SC-MN codes codes have many variable
nodes of degree two and have higher error floors. In this paper, we prove that
SC-MN codes with no variable nodes of degree two achieve the capacity of BEC.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 18:26:51 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Okazaki",
"Takuya",
""
],
[
"Kasai",
"Kenta",
""
]
] |
new_dataset
| 0.972347 |
1401.7293
|
Lele Wang
|
Lele Wang and Eren Sasoglu
|
Polar coding for interference networks
|
Shorter version submitted to ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A polar coding scheme for interference networks is introduced. The scheme
combines Arikan's monotone chain rules for multiple-access channels and a
method by Hassani and Urbanke to 'align' two incompatible polarization
processes. It achieves the Han--Kobayashi inner bound for two-user interference
channels and generalizes to interference networks.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 18:46:35 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Wang",
"Lele",
""
],
[
"Sasoglu",
"Eren",
""
]
] |
new_dataset
| 0.992344 |
1401.7313
|
Alexander Russell
|
Sixia Chen, Alexander Russell, Abhishek Samanta, Ravi Sundaram
|
Deterministic Blind Rendezvous in Cognitive Radio Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blind rendezvous is a fundamental problem in cognitive radio networks. The
problem involves a collection of agents (radios) that wish to discover each
other in the blind setting where there is no shared infrastructure and they
initially have no knowledge of each other. Time is divided into discrete slots;
spectrum is divided into discrete channels, $\{1,2,..., n\}$. Each agent may
access a single channel in a single time slot and we say that two agents
rendezvous when they access the same channel in the same time slot. The model
is asymmetric: each agent $A_i$ may only use a particular subset $S_i$ of the
channels and different agents may have access to different subsets of channels.
The goal is to design deterministic channel hopping schedules for each agent so
as to guarantee rendezvous between any pair of agents with overlapping channel
sets.
Two independent sets of authors, Shin et al. and Lin et al., gave the first
constructions guaranteeing asynchronous blind rendezvous in $O(n^2)$ and
$O(n^3)$ time, respectively. We present a substantially improved construction
guaranteeing that any two agents, $A_i$, $A_j$, will rendezvous in $O(|S_i|
|S_j| \log\log n)$ time. Our results are the first that achieve nontrivial
dependence on $|S_i|$, the size of the set of available channels. This allows
us, for example, to save roughly a quadratic factor over the best previous
results in the important case when channel subsets have constant size. We also
achieve the best possible bound of $O(1)$ time for the symmetric situation;
previous works could do no better than $O(n)$. Using the probabilistic method
and Ramsey theory we provide evidence in support of our suspicion that our
construction is asymptotically optimal for small size channel subsets: we show
both a $c |S_i||S_j|$ lower bound and a $c \log\log n$ lower bound when $|S_i|,
|S_j| \leq n/2$.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 20:13:03 GMT"
}
] | 2014-01-29T00:00:00 |
[
[
"Chen",
"Sixia",
""
],
[
"Russell",
"Alexander",
""
],
[
"Samanta",
"Abhishek",
""
],
[
"Sundaram",
"Ravi",
""
]
] |
new_dataset
| 0.999164 |
1101.0287
|
Edwin Hammerich
|
Edwin Hammerich
|
On the Capacity of the Heat Channel, Waterfilling in the Time-Frequency
Plane, and a C-NODE Relationship
|
37 pages, 11 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The heat channel is defined by a linear time-varying (LTV) filter with
additive white Gaussian noise (AWGN) at the filter output. The continuous-time
LTV filter is related to the heat kernel of the quantum mechanical harmonic
oscillator, so the name of the channel. The channel's capacity is given in
closed form by means of the Lambert W function. Also a waterfilling theorem in
the time-frequency plane for the capacity is derived. It relies on a specific
Szego theorem for which an essentially self-contained proof is provided.
Similarly, the rate distortion function for a related nonstationary source is
given in closed form and a (reverse) waterfilling theorem in the time-frequency
plane is derived. Finally, a second closed-form expression for the capacity of
the heat channel based on the detected perturbed filter output signals is
presented. In this context, a precise differential connection between channel
capacity and the normalized optimal detection error (NODE) is revealed. This
C-NODE relationship is compared with the well-known I-MMSE relationship
connecting mutual information with the minimum mean-square error (MMSE) of
estimation theory.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 18:52:27 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Sep 2011 15:19:13 GMT"
},
{
"version": "v3",
"created": "Sat, 10 Mar 2012 20:13:45 GMT"
},
{
"version": "v4",
"created": "Mon, 27 Jan 2014 19:50:00 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Hammerich",
"Edwin",
""
]
] |
new_dataset
| 0.979228 |
1401.2422
|
V Lalitha
|
N. Prakash, V. Lalitha and P. Vijay Kumar
|
Codes with Locality for Two Erasures
|
14 pages, 3 figures, Updated for improved readability
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study codes with locality that can recover from two
erasures via a sequence of two local, parity-check computations. By a local
parity-check computation, we mean recovery via a single parity-check equation
associated to small Hamming weight. Earlier approaches considered recovery in
parallel; the sequential approach allows us to potentially construct codes with
improved minimum distance. These codes, which we refer to as locally
2-reconstructible codes, are a natural generalization along one direction, of
codes with all-symbol locality introduced by Gopalan \textit{et al}, in which
recovery from a single erasure is considered. By studying the Generalized
Hamming Weights of the dual code, we derive upper bounds on the minimum
distance of locally 2-reconstructible codes and provide constructions for a
family of codes based on Tur\'an graphs, that are optimal with respect to this
bound. The minimum distance bound derived here is universal in the sense that
no code which permits all-symbol local recovery from $2$ erasures can have
larger minimum distance regardless of approach adopted. Our approach also leads
to a new bound on the minimum distance of codes with all-symbol locality for
the single-erasure case.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 18:39:37 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jan 2014 15:55:37 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Prakash",
"N.",
""
],
[
"Lalitha",
"V.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.996334 |
1401.6379
|
Nyagudi Musandu Nyagudi
|
Nyagudi Musandu Nyagudi
|
Post-Westgate SWAT : C4ISTAR Architectural Framework for Autonomous
Network Integrated Multifaceted Warfighting Solutions Version 1.0 : A
Peer-Reviewed Monograph
|
52 pages, 6 Figures, over 40 references, reviewed by a reader
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Police SWAT teams and Military Special Forces face mounting pressure and
challenges from adversaries that can only be resolved by way of ever more
sophisticated inputs into tactical operations. Lethal Autonomy provides
constrained military/security forces with a viable option, but only if
implementation has got proper empirically supported foundations. Autonomous
weapon systems can be designed and developed to conduct ground, air and naval
operations. This monograph offers some insights into the challenges of
developing legal, reliable and ethical forms of autonomous weapons, that
address the gap between Police or Law Enforcement and Military operations that
is growing exponentially small. National adversaries are today in many
instances hybrid threats, that manifest criminal and military traits, these
often require deployment of hybrid-capability autonomous weapons imbued with
the capability to taken on both Military and/or Security objectives. The
Westgate Terrorist Attack of 21st September 2013 in the Westlands suburb of
Nairobi, Kenya is a very clear manifestation of the hybrid combat scenario that
required military response and police investigations against a fighting cell of
the Somalia based globally networked Al Shabaab terrorist group.
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 16:04:48 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jan 2014 09:47:05 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Nyagudi",
"Nyagudi Musandu",
""
]
] |
new_dataset
| 0.999358 |
1401.6482
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Nested Polar Codes Achieve the Shannon Rate-Distortion Function and the
Shannon Capacity
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that nested polar codes achieve the Shannon rate-distortion
function for arbitrary (binary or non-binary) discrete memoryless sources and
the Shannon capacity of arbitrary discrete memoryless channels.
|
[
{
"version": "v1",
"created": "Sat, 25 Jan 2014 01:26:53 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.989279 |
1401.6543
|
Ananthanarayanan Chockalingam
|
T. Lakshmi Narasimhan, Yalagala Naresh, Tanumay Datta, and A.
Chockalingam
|
Pseudo-random Phase Precoded Spatial Modulation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spatial modulation (SM) is a transmission scheme that uses multiple transmit
antennas but only one transmit RF chain. At each time instant, only one among
the transmit antennas will be active and the others remain silent. The index of
the active transmit antenna will also convey information bits in addition to
the information bits conveyed through modulation symbols (e.g.,QAM).
Pseudo-random phase precoding (PRPP) is a technique that can achieve high
diversity orders even in single antenna systems without the need for channel
state information at the transmitter (CSIT) and transmit power control (TPC).
In this paper, we exploit the advantages of both SM and PRPP simultaneously. We
propose a pseudo-random phase precoded SM (PRPP-SM) scheme, where both the
modulation bits and the antenna index bits are precoded by pseudo-random
phases. The proposed PRPP-SM system gives significant performance gains over SM
system without PRPP and PRPP system without SM. Since maximum likelihood (ML)
detection becomes exponentially complex in large dimensions, we propose low
complexity local search based detection (LSD) algorithm suited for PRPP-SM
systems with large precoder sizes. Our simulation results show that with 4
transmit antennas, 1 receive antenna, $5\times 20$ pseudo-random phase precoder
matrix and BPSK modulation, the performance of PRPP-SM using ML detection is
better than SM without PRPP with ML detection by about 9 dB at $10^{-2}$ BER.
This performance advantage gets even better for large precoding sizes.
|
[
{
"version": "v1",
"created": "Sat, 25 Jan 2014 15:03:27 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Narasimhan",
"T. Lakshmi",
""
],
[
"Naresh",
"Yalagala",
""
],
[
"Datta",
"Tanumay",
""
],
[
"Chockalingam",
"A.",
""
]
] |
new_dataset
| 0.969262 |
1401.6598
|
Julio C\'esar Arreola Fr\'ias M.C.
|
Alberto Ochoa-Zezzatti, Luana Hatsukimi, Hitomi Karuda, Julio Arreola
and Sandra Bustillos
|
Never forget, whom was my ancestors: A cross-cultural analysis from
Yonsei (fourth-generation Nikkei) in four societies using Data Mining
|
7 pages, 2 figures, 1 table
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research explains the importance of transculturality in social
networking in a wide variety of activities of our daily life. We focus our
analysis to online activities that use social richness, analyzing societies in
Yakutia (A Russian Republic), Macau in China, Uberl\^andia in Brazil and Juarez
City in Mexico, all with people descending from Japanese people. To this end,
we performed surveys to gathering information about salient aspects of upgrade
and combined them using social data mining techniques to profile a number of
behavioural patterns and choices that describe social networking behaviours in
these societies.
|
[
{
"version": "v1",
"created": "Sun, 26 Jan 2014 00:02:31 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Ochoa-Zezzatti",
"Alberto",
""
],
[
"Hatsukimi",
"Luana",
""
],
[
"Karuda",
"Hitomi",
""
],
[
"Arreola",
"Julio",
""
],
[
"Bustillos",
"Sandra",
""
]
] |
new_dataset
| 0.996688 |
1401.6738
|
Hyeji Kim
|
Hyeji Kim, Abbas El Gamal
|
Capacity Region of the Broadcast Channel with Two Deterministic Channel
State Components
|
5 pages, 3 figures. Submitted to ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
This paper establishes the capacity region of a class of broadcast channels
with random state in which each channel component is selected from two possible
functions and each receiver knows its state sequence. This channel model does
not fit into any class of broadcast channels for which the capacity region was
previously known and is useful in studying wireless communication channels when
the fading state is known only at the receivers. The capacity region is shown
to coincide with the UV outer bound and is achieved via Marton coding.
|
[
{
"version": "v1",
"created": "Mon, 27 Jan 2014 04:36:58 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Kim",
"Hyeji",
""
],
[
"Gamal",
"Abbas El",
""
]
] |
new_dataset
| 0.998959 |
1401.6799
|
Dragana Bajovic
|
Dragana Bajovic, Dusan Jakovetic, Dejan Vukobratovic, and Vladimir
Crnojevic
|
Slotted Aloha for Networked Base Stations
|
conference; submitted on Dec 15, 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study multiple base station, multi-access systems in which the user-base
station adjacency is induced by geographical proximity. At each slot, each user
transmits (is active) with a certain probability, independently of other users,
and is heard by all base stations within the distance $r$. Both the users and
base stations are placed uniformly at random over the (unit) area. We first
consider a non-cooperative decoding where base stations work in isolation, but
a user is decoded as soon as one of its nearby base stations reads a clean
signal from it. We find the decoding probability and quantify the gains
introduced by multiple base stations. Specifically, the peak throughput
increases linearly with the number of base stations $m$ and is roughly $m/4$
larger than the throughput of a single-base station that uses standard slotted
Aloha. Next, we propose a cooperative decoding, where the mutually close base
stations inform each other whenever they decode a user inside their coverage
overlap. At each base station, the messages received from the nearby stations
help resolve collisions by the interference cancellation mechanism. Building
from our exact formulas for the non-cooperative case, we provide a heuristic
formula for the cooperative decoding probability that reflects well the actual
performance. Finally, we demonstrate by simulation significant gains of
cooperation with respect to the non-cooperative decoding.
|
[
{
"version": "v1",
"created": "Mon, 27 Jan 2014 10:51:34 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Bajovic",
"Dragana",
""
],
[
"Jakovetic",
"Dusan",
""
],
[
"Vukobratovic",
"Dejan",
""
],
[
"Crnojevic",
"Vladimir",
""
]
] |
new_dataset
| 0.987555 |
1401.6810
|
Dragana Bajovic
|
Dusan Jakovetic, Dragana Bajovic, Dejan Vukobratovic, and Vladimir
Crnojevic
|
Slotted Aloha for Networked Base Stations with Spatial and Temporal
Diversity
|
extended version of a conference paper submitted on Jan 24, 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider framed slotted Aloha where $m$ base stations cooperate to decode
messages from $n$ users. Users and base stations are placed uniformly at random
over an area. At each frame, each user sends multiple replicas of its packet
according to a prescribed distribution, and it is heard by all base stations
within the communication radius $r$. Base stations employ a decoding algorithm
that utilizes the successive interference cancellation mechanism, both in
space--across neighboring base stations, and in time--across different slots,
locally at each base station. We show that there exists a threshold on the
normalized load $G=n/(\tau m)$, where $\tau$ is the number of slots per frame,
below which decoding probability converges asymptotically (as
$n,m,\tau\rightarrow \infty$, $r\rightarrow 0$) to the maximal possible
value--the probability that a user is heard by at least one base station, and
we find a lower bound on the threshold. Further, we give a heuristic evaluation
of the decoding probability based on the and-or-tree analysis. Finally, we show
that the peak throughput increases linearly in the number of base stations.
|
[
{
"version": "v1",
"created": "Mon, 27 Jan 2014 11:33:03 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Jakovetic",
"Dusan",
""
],
[
"Bajovic",
"Dragana",
""
],
[
"Vukobratovic",
"Dejan",
""
],
[
"Crnojevic",
"Vladimir",
""
]
] |
new_dataset
| 0.965772 |
1401.6984
|
Yajie Miao
|
Yajie Miao
|
Kaldi+PDNN: Building DNN-based ASR Systems with Kaldi and PDNN
|
unpublished manuscript
| null | null | null |
cs.LG cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The Kaldi toolkit is becoming popular for constructing automated speech
recognition (ASR) systems. Meanwhile, in recent years, deep neural networks
(DNNs) have shown state-of-the-art performance on various ASR tasks. This
document describes our open-source recipes to implement fully-fledged DNN
acoustic modeling using Kaldi and PDNN. PDNN is a lightweight deep learning
toolkit developed under the Theano environment. Using these recipes, we can
build up multiple systems including DNN hybrid systems, convolutional neural
network (CNN) systems and bottleneck feature systems. These recipes are
directly based on the Kaldi Switchboard 110-hour setup. However, adapting them
to new datasets is easy to achieve.
|
[
{
"version": "v1",
"created": "Mon, 27 Jan 2014 19:55:34 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Miao",
"Yajie",
""
]
] |
new_dataset
| 0.966969 |
1401.6988
|
Marcos Portnoi
|
Marcos Portnoi
|
Criptografia com Curvas El\'ipticas
|
Portuguese, 14 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an overview of the use of elliptic curves in
cryptography. The security of this cryptosystem is based on the discrete
logarithm problem, which appears to be much harder compared to the discrete
logarithm problem in other cryptosystems. An overview of common cryptosystems
is given, such as Diffie-Hellman and RSA, and an elliptic curve cryptography
scheme is discussed.
--------
Este trabalho apresenta o uso das curvas el\'ipticas em criptografia. Sua
seguran\c{c}a est\'a baseada no problema do logaritmo discreto. Este problema
aparentemente \'e significativamente mais dif\'icil de resolver, comparado com
o problema do logaritmo discreto usado por outros sistemas de criptografia. \'E
dada uma vis\~ao geral de sistemas de criptografia comuns, como Diffie-Hellman
e RSA, e discute-se um esquema de criptografia usando curvas el\'ipticas.
|
[
{
"version": "v1",
"created": "Mon, 27 Jan 2014 20:15:17 GMT"
}
] | 2014-01-28T00:00:00 |
[
[
"Portnoi",
"Marcos",
""
]
] |
new_dataset
| 0.997519 |
1401.5676
|
Borzoo Rassouli
|
Borzoo Rassouli, Chenxi Hao and Bruno Clerckx
|
A Novel Proof for the DoF Region of the MIMO Broadcast Channel with No
CSIT
|
5 pages, submitted to the IEEE International Symposium on Information
Theory 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new proof for the degrees of freedom (DoF) region of the
K-user multiple-input multiple-output (MIMO) broadcast channel (BC) with no
channel state information at the transmitter (CSIT) and perfect channel state
information at the receivers (CSIR) is provided. Based on this proof, the
capacity region of a certain class of MIMO BC with channel distribution
information at the transmitter (CDIT) and perfect CSIR is derived. Finally, an
outer bound for the DoF region of the MIMO interference channel (IC) with no
CSIT is provided.
|
[
{
"version": "v1",
"created": "Wed, 22 Jan 2014 14:10:03 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Jan 2014 11:27:36 GMT"
}
] | 2014-01-27T00:00:00 |
[
[
"Rassouli",
"Borzoo",
""
],
[
"Hao",
"Chenxi",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.998365 |
1401.6070
|
Adrian Dumitrescu
|
Adrian Dumitrescu and Anirban Ghosh and Csaba D. T\'oth
|
On Fence Patrolling by Mobile Agents
|
13 pages, 6 figures
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that a fence needs to be protected (perpetually) by $k$ mobile agents
with maximum speeds $v_1,\ldots,v_k$ so that no point on the fence is left
unattended for more than a given amount of time. The problem is to determine if
this requirement can be met, and if so, to design a suitable patrolling
schedule for the agents. Alternatively, one would like to find a schedule that
minimizes the \emph{idle time}, that is, the longest time interval during which
some point is not visited by any agent. We revisit this problem, introduced by
Czyzowicz et al.(2011), and discuss several strategies for the cases where the
fence is an open and a closed curve, respectively.
In particular: (i) we disprove a conjecture by Czyzowicz et al. regarding the
optimality of their Algorithm ${\mathcal A_2}$ for unidirectional patrolling of
a closed fence; (ii) we present an algorithm with a lower idle time for
patrolling an open fence, improving an earlier result of Kawamura and
Kobayashi.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 17:56:52 GMT"
}
] | 2014-01-25T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Ghosh",
"Anirban",
""
],
[
"Tóth",
"Csaba D.",
""
]
] |
new_dataset
| 0.971256 |
1307.7252
|
Camilla Hollanti
|
Iv\'an Blanco-Chac\'on, Dion\'is Rem\'on, Camilla Hollanti, Montserrat
Alsina
|
Fuchsian codes for AWGN channels
|
This is an extended version of a work with the same title which has
been already published in the Proceedings of the Workshop on Cryptography and
Coding Theory (Bergen, 2013). I particular, it contains extra material on the
generation of the constellation. In the first version, there were some
simulation errors that have now been corrected
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a new transmission scheme for additive white Gaussian noisy (AWGN)
single-input single-output (SISO) channels without fading based on arithmetic
Fuchsian groups. The properly discontinuous character of the action of these
groups on the upper half-plane translates into logarithmic decoding complexity.
|
[
{
"version": "v1",
"created": "Sat, 27 Jul 2013 12:00:03 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jan 2014 11:15:44 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Blanco-Chacón",
"Iván",
""
],
[
"Remón",
"Dionís",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Alsina",
"Montserrat",
""
]
] |
new_dataset
| 0.978312 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.