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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1512.03251
|
Evgeny Nikulchev
|
V.N. Petrushin, E.V. Nikulchev, D.A. Korolev
|
Histogram Arithmetic under Uncertainty of Probability Density Function
|
10 pages
|
Applied Mathematical Sciences 9(2015) 7043-7052
|
10.12988/ams.2015.510644
| null |
cs.NA stat.CO
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In this article we propose a method of performing arithmetic operations on
varia-bles with unknown distribution. The approach to the evaluation results of
arithme-tic operations can select probability intervals of the algebraic
equations and their systems solutions, of differential equations and their
systems in case of histogram evaluation of the empirical density distributions
of random parameters.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 13:42:35 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Petrushin",
"V. N.",
""
],
[
"Nikulchev",
"E. V.",
""
],
[
"Korolev",
"D. A.",
""
]
] |
new_dataset
| 0.951571 |
1512.03324
|
Yunshu Liu
|
Yunshu Liu and John MacLaren Walsh
|
Mapping the Region of Entropic Vectors with Support Enumeration &
Information Geometry
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The region of entropic vectors is a convex cone that has been shown to be at
the core of many fundamental limits for problems in multiterminal data
compression, network coding, and multimedia transmission. This cone has been
shown to be non-polyhedral for four or more random variables, however its
boundary remains unknown for four or more discrete random variables. Methods
for specifying probability distributions that are in faces and on the boundary
of the convex cone are derived, then utilized to map optimized inner bounds to
the unknown part of the entropy region. The first method utilizes tools and
algorithms from abstract algebra to efficiently determine those supports for
the joint probability mass functions for four or more random variables that
can, for some appropriate set of non-zero probabilities, yield entropic vectors
in the gap between the best known inner and outer bounds. These supports are
utilized, together with numerical optimization over non-zero probabilities, to
provide inner bounds to the unknown part of the entropy region. Next,
information geometry is utilized to parameterize and study the structure of
probability distributions on these supports yielding entropic vectors in the
faces of entropy and in the unknown part of the entropy region.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 16:57:59 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Liu",
"Yunshu",
""
],
[
"Walsh",
"John MacLaren",
""
]
] |
new_dataset
| 0.973515 |
cs/0512073
|
Vladimir V Kisil
|
Vladimir V. Kisil
|
Schwerdtfeger-Fillmore-Springer-Cnops Construction Implemented in GiNaC
|
LaTeX, 82 p; 11 PS graphics in two figures, the full source files and
ISO image of Live DVD are included; v9: library update for the book on
Moebius transformations; v10: an ISO image of a Live DVD is attached to the
paper; v11: a bug is fixed; v12: Library is uupdated, the reference to a
larger project is added
|
Adv. Appl. Clifford Algebr. v.17 (2007), no.1, 59-70
|
10.1007/s00006-006-0017-4
|
LEEDS-MATH-PURE-2005-29
|
cs.MS cs.CG cs.SC
|
http://creativecommons.org/licenses/by/4.0/
|
This paper presents an implementation of the
Schwerdtfeger-Fillmore-Springer-Cnops construction (SFSCc) along with
illustrations of its usage. SFSCc linearises the linear-fraction action of the
Moebius group in R^n. This has clear advantages in several theoretical and
applied fields including engineering. Our implementation is based on the
Clifford algebra capacities of the GiNaC computer algebra system
(http://www.ginac.de/), which were described in cs.MS/0410044.
The core of this realisation of SFSCc is done for an arbitrary dimension of
R^n with a metric given by an arbitrary bilinear form. We also present a
subclass for two dimensional cycles (i.e. circles, parabolas and hyperbolas),
which add some 2D specific routines including a visualisation to PostScript
files through the MetaPost (http://www.tug.org/metapost.html) or Asymptote
(http://asymptote.sourceforge.net/) packages.
This software is the backbone of many results published in math.CV/0512416
and we use its applications their for demonstration. The library can be ported
(with various level of required changes) to other CAS with Clifford algebras
capabilities similar to GiNaC.
There is an ISO image of a Live Debian DVD attached to this paper as an
auxiliary file, a copy is stored on Google Drive as well.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2005 15:09:11 GMT"
},
{
"version": "v10",
"created": "Sun, 16 Oct 2011 17:03:58 GMT"
},
{
"version": "v11",
"created": "Wed, 10 Jul 2013 16:49:13 GMT"
},
{
"version": "v12",
"created": "Thu, 10 Dec 2015 20:53:25 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Dec 2005 10:12:50 GMT"
},
{
"version": "v3",
"created": "Thu, 18 May 2006 18:39:35 GMT"
},
{
"version": "v4",
"created": "Mon, 17 Jul 2006 12:32:29 GMT"
},
{
"version": "v5",
"created": "Sun, 23 Jul 2006 12:36:54 GMT"
},
{
"version": "v6",
"created": "Mon, 26 Feb 2007 09:05:10 GMT"
},
{
"version": "v7",
"created": "Fri, 27 Jul 2007 13:02:23 GMT"
},
{
"version": "v8",
"created": "Thu, 9 Sep 2010 17:53:33 GMT"
},
{
"version": "v9",
"created": "Sat, 8 Oct 2011 20:37:25 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Kisil",
"Vladimir V.",
""
]
] |
new_dataset
| 0.977991 |
1507.05282
|
Kumar Sankar Ray
|
Kingshuk Chatterjee, Kumar Sankar Ray
|
Watson-Crick Quantum Finite Automata
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
1-way quantum finite automata are deterministic and reversible in nature,
which greatly reduces its accepting property. In fact the set of languages
accepted by 1-way quantum finite automata is a proper subset of regular
languages. In this paper we replace the tape head of 1-way quantum finite
automata with DNA double strand and name the model Watson-Crick quantum finite
automata. The non-injective complementarity relation of Watson-Crick automata
introduces non-determinism in the quantum model. We show that this introduction
of non-determinism increases the computational power of 1-way Quantum finite
automata significantly. We establish that Watson-Crick quantum finite automata
can accept all regular languages and that it also accepts some languages not
accepted by any multihead deterministic finite automata. Exploiting the
superposition property of quantum finite automata we show that Watson-Crick
quantum finite automata accept the language L=ww where w belongs to {a,b}*.
|
[
{
"version": "v1",
"created": "Sun, 19 Jul 2015 12:57:44 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 08:07:19 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Chatterjee",
"Kingshuk",
""
],
[
"Ray",
"Kumar Sankar",
""
]
] |
new_dataset
| 0.999558 |
1507.05283
|
Kumar Sankar Ray
|
Kingshuk Chatterjee, Kumar Sankar Ray
|
Reversible Watson-Crick Automata
|
arXiv admin note: text overlap with arXiv:1507.05282
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Watson-Crick automata are finite automata working on double strands.
Extensive research work has already been done on non-deterministic Watson-Crick
automata and on deterministic Watson-Crick automata. In this paper, we
introduce a new model of Watson-Crick automata which is reversible in nature
named reversible Watson-Crick automata and explore its computational power. We
show even though the model is reversible and one way it accepts all regular
languages and also analyze the state complexity of the above stated model with
respect to non-deterministic block automata and non-deterministic finite
automata and establish its superiority. We further explore the relation of the
reversible model with twin-shuffle language and recursively enumerable
languages.
|
[
{
"version": "v1",
"created": "Sun, 19 Jul 2015 13:00:59 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 07:54:05 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Chatterjee",
"Kingshuk",
""
],
[
"Ray",
"Kumar Sankar",
""
]
] |
new_dataset
| 0.979631 |
1510.04016
|
Kumar Sankar Ray
|
Kingshuk Chatterjee, Kumar Sankar Ray
|
Multi-head Watson-Crick automata
|
arXiv admin note: text overlap with arXiv:1507.05284,
arXiv:1510.02070
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by multi-head finite automata and Watson-Crick automata in this
paper, we introduce new structure namely multi-head Watson-Crick automata where
we replace the single tape of multi-head finite automaton by a DNA double
strand. The content of the second tape is determined using a complementarity
relation similar to Watson-Crick complementarity relation. We establish the
superiority of our model over multi-head finite automata and also show that
both the deterministic and non-deterministic variant of the model can accept
non-regular unary languages. We also compare our model with parallel
communicating Watson-Crick automata systems and prove that both of them have
the same computational power.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 09:21:33 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 07:46:00 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Chatterjee",
"Kingshuk",
""
],
[
"Ray",
"Kumar Sankar",
""
]
] |
new_dataset
| 0.994383 |
1512.02730
|
Ahmad Biniaz
|
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, and Michiel Smid
|
Plane Bichromatic Trees of Low Degree
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $R$ and $B$ be two disjoint sets of points in the plane such that
$|B|\leqslant |R|$, and no three points of $R\cup B$ are collinear. We show
that the geometric complete bipartite graph $K(R,B)$ contains a non-crossing
spanning tree whose maximum degree is at most $\max\left\{3, \left\lceil
\frac{|R|-1}{|B|}\right\rceil + 1\right\}$; this is the best possible upper
bound on the maximum degree. This solves an open problem posed by Abellanas et
al. at the Graph Drawing Symposium, 1996.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2015 02:51:42 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Biniaz",
"Ahmad",
""
],
[
"Bose",
"Prosenjit",
""
],
[
"Maheshwari",
"Anil",
""
],
[
"Smid",
"Michiel",
""
]
] |
new_dataset
| 0.951367 |
1512.02881
|
Gaurav Srivastava
|
Shankarjee Krishnamoorthi, Gaurav Srivastava, Amar Mandhyan
|
Web application for size and topology optimization of trusses and gusset
plates
|
17 pages, 8 figures, submitted to Structural Engineering and
Mechanics
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With its ever growing popularity, providing Internet based applications tuned
towards practical applications is on the rise. Advantages such as no external
plugins and additional software, ease of use, updating and maintenance have
increased the popularity of web applications. In this work, a web-based
application has been developed which can perform size optimization of truss
structure as a whole as well as topology optimization of individual gusset
plate of each joint based on specified joint displacements and load conditions.
This application is developed using cutting-edge web technologies such as
Three.js and HTML5. The client side boasts of an intuitive interface which in
addition to its modeling capabilities also recommends configurations based on
user input, provides analysis options and finally displays the results. The
server side, using a combination of Scilab and DAKOTA, computes solution and
also provides the user with comparisons of the optimal design with that
conforming to Indian Standard (IS 800-2007). It is a freely available one-stop
web-based application to perform optimal and/or code based design of trusses.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 05:45:32 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Krishnamoorthi",
"Shankarjee",
""
],
[
"Srivastava",
"Gaurav",
""
],
[
"Mandhyan",
"Amar",
""
]
] |
new_dataset
| 0.978053 |
1512.02922
|
Misha Sra
|
Misha Sra, Chris Schmandt
|
MetaSpace II: Object and full-body tracking for interaction and
navigation in social VR
|
10 pages, 9 figures. Video:
http://living.media.mit.edu/projects/metaspace-ii/
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MetaSpace II (MS2) is a social Virtual Reality (VR) system where multiple
users can not only see and hear but also interact with each other, grasp and
manipulate objects, walk around in space, and get tactile feedback. MS2 allows
walking in physical space by tracking each user's skeleton in real-time and
allows users to feel by employing passive haptics i.e., when users touch or
manipulate an object in the virtual world, they simultaneously also touch or
manipulate a corresponding object in the physical world. To enable these
elements in VR, MS2 creates a correspondence in spatial layout and object
placement by building the virtual world on top of a 3D scan of the real world.
Through the association between the real and virtual world, users are able to
walk freely while wearing a head-mounted device, avoid obstacles like walls and
furniture, and interact with people and objects. Most current virtual reality
(VR) environments are designed for a single user experience where interactions
with virtual objects are mediated by hand-held input devices or hand gestures.
Additionally, users are only shown a representation of their hands in VR
floating in front of the camera as seen from a first person perspective. We
believe, representing each user as a full-body avatar that is controlled by
natural movements of the person in the real world (see Figure 1d), can greatly
enhance believability and a user's sense immersion in VR.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2015 16:13:34 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Sra",
"Misha",
""
],
[
"Schmandt",
"Chris",
""
]
] |
new_dataset
| 0.999045 |
1512.02968
|
Suhas Ranganath
|
Suhas Ranganath, Fred Morstatter, Xia Hu, Jiliang Tang, Huan Liu
|
Predicting Online Protest Participation of Social Media Users
| null | null | null | null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Social media has emerged to be a popular platform for people to express their
viewpoints on political protests like the Arab Spring. Millions of people use
social media to communicate and mobilize their viewpoints on protests. Hence,
it is a valuable tool for organizing social movements. However, the mechanisms
by which protest affects the population is not known, making it difficult to
estimate the number of protestors. In this paper, we are inspired by
sociological theories of protest participation and propose a framework to
predict from the user's past status messages and interactions whether the next
post of the user will be a declaration of protest. Drawing concepts from these
theories, we model the interplay between the user's status messages and
messages interacting with him over time and predict whether the next post of
the user will be a declaration of protest. We evaluate the framework using data
from the social media platform Twitter on protests during the recent Nigerian
elections and demonstrate that it can effectively predict whether the next post
of a user is a declaration of protest.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2015 17:49:18 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Ranganath",
"Suhas",
""
],
[
"Morstatter",
"Fred",
""
],
[
"Hu",
"Xia",
""
],
[
"Tang",
"Jiliang",
""
],
[
"Liu",
"Huan",
""
]
] |
new_dataset
| 0.987474 |
1512.03012
|
Manolis Savva
|
Angel X. Chang, Thomas Funkhouser, Leonidas Guibas, Pat Hanrahan,
Qixing Huang, Zimo Li, Silvio Savarese, Manolis Savva, Shuran Song, Hao Su,
Jianxiong Xiao, Li Yi, and Fisher Yu
|
ShapeNet: An Information-Rich 3D Model Repository
| null | null | null | null |
cs.GR cs.AI cs.CG cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present ShapeNet: a richly-annotated, large-scale repository of shapes
represented by 3D CAD models of objects. ShapeNet contains 3D models from a
multitude of semantic categories and organizes them under the WordNet taxonomy.
It is a collection of datasets providing many semantic annotations for each 3D
model such as consistent rigid alignments, parts and bilateral symmetry planes,
physical sizes, keywords, as well as other planned annotations. Annotations are
made available through a public web-based interface to enable data
visualization of object attributes, promote data-driven geometric analysis, and
provide a large-scale quantitative benchmark for research in computer graphics
and vision. At the time of this technical report, ShapeNet has indexed more
than 3,000,000 models, 220,000 models out of which are classified into 3,135
categories (WordNet synsets). In this report we describe the ShapeNet effort as
a whole, provide details for all currently available datasets, and summarize
future plans.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2015 19:42:48 GMT"
}
] | 2015-12-10T00:00:00 |
[
[
"Chang",
"Angel X.",
""
],
[
"Funkhouser",
"Thomas",
""
],
[
"Guibas",
"Leonidas",
""
],
[
"Hanrahan",
"Pat",
""
],
[
"Huang",
"Qixing",
""
],
[
"Li",
"Zimo",
""
],
[
"Savarese",
"Silvio",
""
],
[
"Savva",
"Manolis",
""
],
[
"Song",
"Shuran",
""
],
[
"Su",
"Hao",
""
],
[
"Xiao",
"Jianxiong",
""
],
[
"Yi",
"Li",
""
],
[
"Yu",
"Fisher",
""
]
] |
new_dataset
| 0.99941 |
1412.4365
|
Norihiro Nakashima
|
Norihiro Nakashima, Hajime Matsui
|
Decoding of Projective Reed-Muller Codes by Dividing a Projective Space
into Affine Spaces
|
17 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A projective Reed-Muller (PRM) code, obtained by modifying a (classical)
Reed-Muller code with respect to a projective space, is a doubly extended
Reed-Solomon code when the dimension of the related projective space is equal
to 1. The minimum distance and dual code of a PRM code are known, and some
decoding examples have been represented for low-dimensional projective space.
In this study, we construct a decoding algorithm for all PRM codes by dividing
a projective space into a union of affine spaces. In addition, we determine the
computational complexity and the number of errors correctable of our algorithm.
Finally, we compare the codeword error rate of our algorithm with that of
minimum distance decoding.
|
[
{
"version": "v1",
"created": "Sun, 14 Dec 2014 14:32:12 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Dec 2014 12:08:22 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Dec 2015 07:52:24 GMT"
}
] | 2015-12-09T00:00:00 |
[
[
"Nakashima",
"Norihiro",
""
],
[
"Matsui",
"Hajime",
""
]
] |
new_dataset
| 0.968562 |
1509.07761
|
Igor Mozeti\v{c}
|
Petra Kralj Novak, Jasmina Smailovi\'c, Borut Sluban, Igor Mozeti\v{c}
|
Sentiment of Emojis
| null |
PLoS ONE 10(12): e0144296, 2015
|
10.1371/journal.pone.0144296
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a new generation of emoticons, called emojis, that is increasingly
being used in mobile communications and social media. In the past two years,
over ten billion emojis were used on Twitter. Emojis are Unicode graphic
symbols, used as a shorthand to express concepts and ideas. In contrast to the
small number of well-known emoticons that carry clear emotional contents, there
are hundreds of emojis. But what are their emotional contents? We provide the
first emoji sentiment lexicon, called the Emoji Sentiment Ranking, and draw a
sentiment map of the 751 most frequently used emojis. The sentiment of the
emojis is computed from the sentiment of the tweets in which they occur. We
engaged 83 human annotators to label over 1.6 million tweets in 13 European
languages by the sentiment polarity (negative, neutral, or positive). About 4%
of the annotated tweets contain emojis. The sentiment analysis of the emojis
allows us to draw several interesting conclusions. It turns out that most of
the emojis are positive, especially the most popular ones. The sentiment
distribution of the tweets with and without emojis is significantly different.
The inter-annotator agreement on the tweets with emojis is higher. Emojis tend
to occur at the end of the tweets, and their sentiment polarity increases with
the distance. We observe no significant differences in the emoji rankings
between the 13 languages and the Emoji Sentiment Ranking. Consequently, we
propose our Emoji Sentiment Ranking as a European language-independent resource
for automated sentiment analysis. Finally, the paper provides a formalization
of sentiment and a novel visualization in the form of a sentiment bar.
|
[
{
"version": "v1",
"created": "Fri, 25 Sep 2015 15:41:13 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Dec 2015 10:02:47 GMT"
}
] | 2015-12-09T00:00:00 |
[
[
"Novak",
"Petra Kralj",
""
],
[
"Smailović",
"Jasmina",
""
],
[
"Sluban",
"Borut",
""
],
[
"Mozetič",
"Igor",
""
]
] |
new_dataset
| 0.99932 |
1512.02086
|
Joseph O'Rourke
|
Giovanna Diaz, Joseph O'Rourke
|
Hypercube Unfoldings that Tile R^3 and R^2
|
20 pages, 18 figures, 10 refs. Version 2: Corrected a typo, added a
reference
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the hypercube has a face-unfolding that tiles space, and that
unfolding has an edge-unfolding that tiles the plane. So the hypercube is a
"dimension-descending tiler." We also show that the hypercube cross unfolding
made famous by Dali tiles space, but we leave open the question of whether or
not it has an edge-unfolding that tiles the plane.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 15:20:45 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Dec 2015 13:22:25 GMT"
}
] | 2015-12-09T00:00:00 |
[
[
"Diaz",
"Giovanna",
""
],
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.998681 |
1512.02372
|
Nahla Khalil
|
Nahla Khalil
|
The 3D virtual environment online for real shopping
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development of information technology and Internet has led to rapidly
progressed in e-commerce and online shopping, due to the convenience that they
provide consumers. E-commerce and online shopping are still not able to fully
replace onsite shopping. In contrast, conventional online shopping websites
often cannot provide enough information about a product for the customer to
make an informed decision before checkout. 3D virtual shopping environment show
great potential for enhancing e-commerce systems and provide customers
information about a product and real shopping environment. This paper presents
a new type of e-commerce system, which obviously brings virtual environment
online with an active 3D model that allows consumers to access products into
real physical environments for user interaction. Such system with easy process
can helps customers make better purchasing decisions that allows users to
manipulate 3D virtual models online. The stores participate in the 3D virtual
mall by communicating with a mall management. The 3D virtual mall allows
shoppers to perform actions across multiple stores simultaneously such as
viewing product availability. The mall management can authenticate clients on
all stores participating in the 3D virtual mall while only requiring clients to
provide authentication information once. 3D virtual shopping online mall
convenient and easy process allow consumers directly buy goods or services from
a seller in real-time, without an intermediary service, over the Internet. The
virtual mall with an active 3D model is implemented by using 3D Language (VRML)
and asp.net as the script language for shopping online pages
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 09:10:41 GMT"
}
] | 2015-12-09T00:00:00 |
[
[
"Khalil",
"Nahla",
""
]
] |
new_dataset
| 0.999152 |
1512.02443
|
Mehrdad Ghadiri
|
Saieed Akbari, Khashayar Etemadi, Peyman Ezzati, Mehrdad Ghadiri
|
Even and Odd Cycles Passing a Given Edge or a Vertex
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we provide some sufficient conditions for the existence of an
odd or even cycle that passing a given vertex or an edge in $2$-connected or
$2$-edge connected graphs. We provide some similar conditions for the existence
of an odd or even circuit that passing a given vertex or an edge in 2-edge
connected graphs. We show that if $G$ is a $2$-connected $k$-regular graph, $k
\geq 3$, then every edge of $G$ is contained in an even cycle. We also prove
that in a $2$-edge connected graph, if a vertex has odd degree, then there is
an even cycle containing this vertex.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 12:59:12 GMT"
}
] | 2015-12-09T00:00:00 |
[
[
"Akbari",
"Saieed",
""
],
[
"Etemadi",
"Khashayar",
""
],
[
"Ezzati",
"Peyman",
""
],
[
"Ghadiri",
"Mehrdad",
""
]
] |
new_dataset
| 0.997887 |
1504.03880
|
Martin Zimmermann
|
Peter Faymonville and Martin Zimmermann
|
Parametric Linear Dynamic Logic (full version)
|
Accepted for publication at Information and Computation. A
preliminary version of this work appeared in GandALF 2014 (arXiv:1408.5957)
| null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear
Dynamic Logic (LDL) by temporal operators equipped with parameters that bound
their scope. LDL itself was proposed as an extension of Linear Temporal Logic
(LTL) that is able to express all omega-regular specifications while still
maintaining many of LTL's desirable properties like intuitive syntax and
semantics and a translation into non-deterministic B\"uchi automata of
exponential size. But LDL lacks capabilities to express timing constraints. By
adding parameterized operators to LDL, we obtain a logic that is able to
express all omega-regular properties and that subsumes parameterized extensions
of LTL like Parametric LTL and PROMPT-LTL.
Our main technical contribution is a translation of PLDL formulas into
non-deterministic B\"uchi automata of exponential size via alternating
automata. This yields polynomial space algorithms for model checking and
assume-guarantee model checking and a realizability algorithm with
doubly-exponential running time. All three problems are also shown to be
complete for these complexity classes. Moreover, we give tight upper and lower
bounds on optimal parameter values for model checking and realizability. Using
these bounds, we present a polynomial space procedure for model checking
optimization and an algorithm with triply-exponential running time for
realizability optimization. Our results show that PLDL model checking and
realizability are no harder than their respective (parametric) LTL
counterparts.
|
[
{
"version": "v1",
"created": "Wed, 15 Apr 2015 12:19:52 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Dec 2015 14:57:53 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Faymonville",
"Peter",
""
],
[
"Zimmermann",
"Martin",
""
]
] |
new_dataset
| 0.997563 |
1507.01546
|
Sukhpal Singh Gill
|
Sukhpal Singh Gill
|
Autonomic Cloud Computing: Research Perspective
|
Author's Viewpoint on Autonomic Cloud Computing and Uploaded on
Research Gate [https://www.researchgate.net/profile/Sukhpal_Gill]
| null |
10.13140/RG.2.1.4453.4881
| null |
cs.DC
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Cloud computing is an evolving utility computing mechanism in which cloud
consumer can detect, choose and utilize the resources (infrastructure, software
and platform) and provide service to user based on pay per use model as
computing utilities. Current computing mechanism is effective, particular for
medium and small cloud based companies, in which it permits easy and reliable
access to cloud services like infrastructure, software and platform. Present
cloud computing is almost similar to the existing models: cluster computing and
grid computing. The important key technical features of cloud computing which
includes autonomic service, rapid elasticity, end-to-end virtualization
support, on-demand resource pooling and transparency in cloud billing. Further,
non-technical features of cloud computing includes environment friendliness,
little maintenance overhead, lower upfront costs, faster time to deployments,
Service Level Agreement (SLA) and pay-as-you-go-model. In distributed computing
environment, unpredictability of service is a fact, so same possible in cloud
also. The success of next-generation Cloud Computing infrastructures will
depend on how capably these infrastructures will discover and dynamically
tolerate computing platforms, which meet randomly varying resource and service
requirements of Cloud costumer applications.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 17:27:04 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Dec 2015 13:40:07 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Gill",
"Sukhpal Singh",
""
]
] |
new_dataset
| 0.954091 |
1507.02519
|
Jianwen Li
|
Jianwen Li, Shufang Zhu, Geguang Pu, Moshe Vardi
|
SAT-based Explicit LTL Reasoning
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present here a new explicit reasoning framework for linear temporal logic
(LTL), which is built on top of propositional satisfiability (SAT) solving. As
a proof-of-concept of this framework, we describe a new LTL satisfiability
tool, Aalta\_v2.0, which is built on top of the MiniSAT SAT solver. We test the
effectiveness of this approach by demonnstrating that Aalta\_v2.0 significantly
outperforms all existing LTL satisfiability solvers. Furthermore, we show that
the framework can be extended from propositional LTL to assertional LTL (where
we allow theory atoms), by replacing MiniSAT with the Z3 SMT solver, and
demonstrating that this can yield an exponential improvement in performance.
|
[
{
"version": "v1",
"created": "Thu, 9 Jul 2015 14:14:35 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Sep 2015 22:30:11 GMT"
},
{
"version": "v3",
"created": "Fri, 4 Dec 2015 23:33:32 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Li",
"Jianwen",
""
],
[
"Zhu",
"Shufang",
""
],
[
"Pu",
"Geguang",
""
],
[
"Vardi",
"Moshe",
""
]
] |
new_dataset
| 0.997199 |
1509.05251
|
Mauricio Delbracio
|
Mauricio Delbracio, Guillermo Sapiro
|
Hand-held Video Deblurring via Efficient Fourier Aggregation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Videos captured with hand-held cameras often suffer from a significant amount
of blur, mainly caused by the inevitable natural tremor of the photographer's
hand. In this work, we present an algorithm that removes blur due to camera
shake by combining information in the Fourier domain from nearby frames in a
video. The dynamic nature of typical videos with the presence of multiple
moving objects and occlusions makes this problem of camera shake removal
extremely challenging, in particular when low complexity is needed. Given an
input video frame, we first create a consistent registered version of
temporally adjacent frames. Then, the set of consistently registered frames is
block-wise fused in the Fourier domain with weights depending on the Fourier
spectrum magnitude. The method is motivated from the physiological fact that
camera shake blur has a random nature and therefore, nearby video frames are
generally blurred differently. Experiments with numerous videos recorded in the
wild, along with extensive comparisons, show that the proposed algorithm
achieves state-of-the-art results while at the same time being much faster than
its competitors.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 13:37:39 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Oct 2015 18:37:40 GMT"
},
{
"version": "v3",
"created": "Fri, 4 Dec 2015 15:22:25 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Delbracio",
"Mauricio",
""
],
[
"Sapiro",
"Guillermo",
""
]
] |
new_dataset
| 0.990443 |
1512.01581
|
Swaroop Ghosh
|
Anirudh Iyengar and Swaroop Ghosh
|
Threshold Voltage-Defined Switches for Programmable Gates
| null | null | null | null |
cs.CR cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semiconductor supply chain is increasingly getting exposed to variety of
security attacks such as Trojan insertion, cloning, counterfeiting, reverse
engineering (RE), piracy of Intellectual Property (IP) or Integrated Circuit
(IC) and side-channel analysis due to involvement of untrusted parties. In this
paper, we propose transistor threshold voltage-defined switches to camouflage
the logic gate both logically and physically to resist against RE and IP
piracy. The proposed gate can function as NAND, AND, NOR, OR, XOR, XNOR, INV
and BUF robustly using threshold-defined switches. The camouflaged design
operates at nominal voltage and obeys conventional reliability limits. The
proposed gate can also be used to personalize the design during manufacturing.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2015 22:10:23 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Iyengar",
"Anirudh",
""
],
[
"Ghosh",
"Swaroop",
""
]
] |
new_dataset
| 0.991488 |
1512.01639
|
Krzysztof Wo{\l}k
|
Krzysztof Wo{\l}k, Krzysztof Marasek
|
PJAIT Systems for the IWSLT 2015 Evaluation Campaign Enhanced by
Comparable Corpora
| null |
Proceedings of the 12th International Workshop on Spoken Language
Translation, Da Nang, Vietnam, December 3-4, 2015, p.101-104
| null | null |
cs.CL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we attempt to improve Statistical Machine Translation (SMT)
systems on a very diverse set of language pairs (in both directions): Czech -
English, Vietnamese - English, French - English and German - English. To
accomplish this, we performed translation model training, created adaptations
of training settings for each language pair, and obtained comparable corpora
for our SMT systems. Innovative tools and data adaptation techniques were
employed. The TED parallel text corpora for the IWSLT 2015 evaluation campaign
were used to train language models, and to develop, tune, and test the system.
In addition, we prepared Wikipedia-based comparable corpora for use with our
SMT system. This data was specified as permissible for the IWSLT 2015
evaluation. We explored the use of domain adaptation techniques, symmetrized
word alignment models, the unsupervised transliteration models and the KenLM
language modeling tool. To evaluate the effects of different preparations on
translation results, we conducted experiments and used the BLEU, NIST and TER
metrics. Our results indicate that our approach produced a positive impact on
SMT quality.
|
[
{
"version": "v1",
"created": "Sat, 5 Dec 2015 08:55:31 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Wołk",
"Krzysztof",
""
],
[
"Marasek",
"Krzysztof",
""
]
] |
new_dataset
| 0.969368 |
1512.01681
|
Tomasz Gogacz
|
Tomasz Gogacz, Jerzy Marcinkowski
|
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is
Undecidable
| null | null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We solve a well known and long-standing open problem in database theory,
proving that Conjunctive Query Finite Determinacy Problem is undecidable. The
technique we use builds on the top of our Red Spider method which we developed
in our paper [GM15] to show undecidability of the same problem in the
"unrestricted case" -- when database instances are allowed to be infinite. We
also show a specific instance $Q_0$, ${\cal Q}= \{Q_1, Q_2, \ldots Q_k\}$ such
that the set $\cal Q$ of CQs does not determine CQ $Q_0$ but finitely
determines it. Finally, we claim that while $Q_0$ is finitely determined by
$\cal Q$, there is no FO-rewriting of $Q_0$, with respect to $\cal Q$, and we
outline a proof of this claim
|
[
{
"version": "v1",
"created": "Sat, 5 Dec 2015 15:54:19 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Gogacz",
"Tomasz",
""
],
[
"Marcinkowski",
"Jerzy",
""
]
] |
new_dataset
| 0.978498 |
1512.01701
|
Kamal Ahmat
|
Kamal Ahmat
|
Emerging Cloud Computing Security Threats
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing is one of the latest emerging innovations of the modern
internet and technological landscape. With everyone from the White house to
major online technological leaders like Amazon and Google using or offering
cloud computing services it is truly presents itself as an exciting and
innovative method to store and use data on the internet.
|
[
{
"version": "v1",
"created": "Sat, 5 Dec 2015 20:55:58 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Ahmat",
"Kamal",
""
]
] |
new_dataset
| 0.951252 |
1512.01871
|
Andrew Adamatzky
|
Andrew Adamatzky and Georgios Ch. Sirakoulis
|
Building exploration with leeches Hirudo verbana
| null |
Biosystems Volume 134, August 2015, Pages 48--55
|
10.1016/j.biosystems.2015.06.004
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Safe evacuation of people from building and outdoor environments, and search
and rescue operations, always will remain actual in course of all
socio-technological developments. Modern facilities offer a range of automated
systems to guide residents towards emergency exists. The systems are assumed to
be infallible. But what if they fail? How occupants not familiar with a
building layout will be looking for exits in case of very limited visibility
where tactile sensing is the only way to assess the environment? Analogous
models of human behaviour, and socio-dynamics in general, are provided to be
fruitful ways to explore alternative, or would-be scenarios. Crowd, or a single
person, dynamics could be imitated using particle systems, reaction-diffusion
chemical medium, electro-magnetic fields, or social insects. Each type of
analogous model offer unique insights on behavioural patterns of natural
systems in constrained geometries. In this particular paper we have chosen
leeches to analyse patterns of exploration. Reasons are two-fold. First, when
deprived from other stimuli leeches change their behavioural modes in an
automated regime in response to mechanical stimulation. Therefore leeches can
give us invaluable information on how human beings might behave under stress
and limited visibility. Second, leeches are ideal blueprints of future
soft-bodied rescue robots. Leeches have modular nervous circuitry with a rich
behavioral spectrum. Leeches are multi-functional, fault-tolerant with
autonomous inter-segment coordination and adaptive decision-making. We aim to
answer the question: how efficiently a real building can be explored and
whether there any dependencies on the pathways of exploration and geometrical
complexity of the building. In our case studies we use templates made on the
floor plan of real building.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 01:32:09 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
],
[
"Sirakoulis",
"Georgios Ch.",
""
]
] |
new_dataset
| 0.998926 |
1512.01878
|
Andrew Adamatzky
|
Andrew Adamatzky
|
On exploration of geometrically constrained space by medicinal leeches
Hirudo verbana
| null |
Biosystems. Volume 130, April 2015, Pages 28--36
|
10.1016/j.biosystems.2015.02.005
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Leeches are fascinating creatures: they have simple modular nervous circuitry
m yet exhibit a rich spectrum of behavioural modes. Leeches could be ideal
blue-prints for designing flexible soft robots which are modular,
multi-functional, fault-tolerant, easy to control, capable for navigating using
optical, mechanical and chemical sensorial inputs, have autonomous
inter-segmental coordination and adaptive decision-making. With future designs
of leech-robots in mind we study how leeches behave in geometrically
constrained spaces. Core results of the paper deal with leeches exploring a row
of rooms arranged along a narrow corridor. In laboratory experiments we find
that rooms closer to ends of the corridor are explored by leeches more often
than rooms in the middle of the corridor. Also, in series of scoping
experiments, we evaluate leeches capabilities to navigating in mazes towards
sources of vibration and chemo-attraction. We believe our results lay
foundation for future developments of robots mimicking behaviour of leeches.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 02:00:37 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.986234 |
1512.02100
|
Tim Taylor
|
Tim Taylor, Alan Dorin, Kevin Korb
|
Digital Genesis: Computers, Evolution and Artificial Life
|
Extended abstract of talk presented at the 7th Munich-Sydney-Tilburg
Philosophy of Science Conference: Evolutionary Thinking, University of
Sydney, 20-22 March 2014. Presentation slides from talk available at
http://www.tim-taylor.com/papers/digital-genesis-presentation.pdf
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The application of evolution in the digital realm, with the goal of creating
artificial intelligence and artificial life, has a history as long as that of
the digital computer itself. We illustrate the intertwined history of these
ideas, starting with the early theoretical work of John von Neumann and the
pioneering experimental work of Nils Aall Barricelli. We argue that
evolutionary thinking and artificial life will continue to play an integral
role in the future development of the digital world.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 15:53:48 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Taylor",
"Tim",
""
],
[
"Dorin",
"Alan",
""
],
[
"Korb",
"Kevin",
""
]
] |
new_dataset
| 0.988573 |
1512.02110
|
Vadim Holodovsky
|
Vadim Holodovsky, Yoav Y. Schechner, Anat Levin, Aviad Levis, Amit
Aides
|
In-situ multi-scattering tomography
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To recover the three dimensional (3D) volumetric distribution of matter in an
object, images of the object are captured from multiple directions and
locations. Using these images tomographic computations extract the
distribution. In highly scattering media and constrained, natural irradiance,
tomography must explicitly account for off-axis scattering. Furthermore, the
tomographic model and recovery must function when imaging is done in-situ, as
occurs in medical imaging and ground-based atmospheric sensing. We formulate
tomography that handles arbitrary orders of scattering, using a monte-carlo
model. Moreover, the model is highly parallelizable in our formulation. This
enables large scale rendering and recovery of volumetric scenes having a large
number of variables. We solve stability and conditioning problems that stem
from radiative transfer (RT) modeling in-situ.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 16:24:48 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Holodovsky",
"Vadim",
""
],
[
"Schechner",
"Yoav Y.",
""
],
[
"Levin",
"Anat",
""
],
[
"Levis",
"Aviad",
""
],
[
"Aides",
"Amit",
""
]
] |
new_dataset
| 0.996374 |
1512.02183
|
Shiyin Zhong
|
Shiyin Zhong, (Student Member IEEE), Robert Broadwater (Senior Member,
IEEE), Steve Steffel, (Senior Member)
|
Wavelet Based Load Models from AMI Data
| null | null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A major challenge of using AMI data in power system analysis is the large
size of the data sets. For rapid analysis that addresses historical behavior of
systems consisting of a few hundred feeders, all of the AMI load data can be
loaded into memory and used in a power flow analysis. However, if a system
contains thousands of feeders then the handling of the AMI data in the analysis
becomes more challenging. The work here seeks to demonstrate that the
information contained in large AMI data sets can be compressed into accurate
load models using wavelets. Two types of wavelet based load models are
considered, the multi-resolution wavelet load model for each individual
customer and the classified wavelet load model for customers that share similar
load patterns. The multi-resolution wavelet load model compresses the data, and
the classified wavelet load model further compresses the data. The method of
grouping customers into classes using the wavelet based classification
technique is illustrated.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 19:34:58 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Zhong",
"Shiyin",
"",
"Senior Member,\n IEEE"
],
[
"Broadwater",
"Robert",
"",
"Senior Member,\n IEEE"
],
[
"Steffel",
"Steve",
""
]
] |
new_dataset
| 0.954055 |
1512.02196
|
Marmik Pandya
|
Marmik Pandya
|
Securing Cloud - The Quantum Way
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Confidentiality, Integrity, and Availability are basic goals of security
architecture. To ensure CIA, many authentication scheme has been introduced in
several years. Currently deployment of Public Key Infrastructure (PKI) is a
most significant solution. PKI involving exchange key using certificates via a
public channel to a authenticate users in the cloud infrastructure. It is
exposed to widespread security threats such as eavesdropping, the man in the
middle attack, masquerade et al. Quantum cryptography is of the most prominent
fields in the modern world of information security. Quantum cryptography is
considered to be a future replica of classical cryptography along with a vital
stance to break existing classical cryptography. This paper aims to look into
basic security architecture in place currently and further it tries to
introduce a new proposed security architecture for cloud computing environment,
which makes use of the knowledge of Quantum Mechanics and current advances in
research in Quantum Computing, to provide a more secure architecture.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 20:33:17 GMT"
}
] | 2015-12-08T00:00:00 |
[
[
"Pandya",
"Marmik",
""
]
] |
new_dataset
| 0.982923 |
1407.4027
|
Peter Banda
|
Peter Banda, Drew Blount and Christof Teuscher
|
COEL: A Web-based Chemistry Simulation Framework
|
23 pages, 12 figures, 1 table
|
CoSMoS 2014: Proceedings of the 7th Workshop on Complex Systems
Modelling and Simulation, 35-60, 2014
| null | null |
cs.CE physics.chem-ph q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The chemical reaction network (CRN) is a widely used formalism to describe
macroscopic behavior of chemical systems. Available tools for CRN modelling and
simulation require local access, installation, and often involve local file
storage, which is susceptible to loss, lacks searchable structure, and does not
support concurrency. Furthermore, simulations are often single-threaded, and
user interfaces are non-trivial to use. Therefore there are significant hurdles
to conducting efficient and collaborative chemical research. In this paper, we
introduce a new enterprise chemistry simulation framework, COEL, which
addresses these issues. COEL is the first web-based framework of its kind. A
visually pleasing and intuitive user interface, simulations that run on a large
computational grid, reliable database storage, and transactional services make
COEL ideal for collaborative research and education. COEL's most prominent
features include ODE-based simulations of chemical reaction networks and
multicompartment reaction networks, with rich options for user interactions
with those networks. COEL provides DNA-strand displacement transformations and
visualization (and is to our knowledge the first CRN framework to do so), GA
optimization of rate constants, expression validation, an application-wide
plotting engine, and SBML/Octave/Matlab export. We also present an overview of
the underlying software and technologies employed and describe the main
architectural decisions driving our development. COEL is available at
http://coel-sim.org for selected research teams only. We plan to provide a part
of COEL's functionality to the general public in the near future.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2014 15:45:00 GMT"
}
] | 2015-12-07T00:00:00 |
[
[
"Banda",
"Peter",
""
],
[
"Blount",
"Drew",
""
],
[
"Teuscher",
"Christof",
""
]
] |
new_dataset
| 0.999715 |
1504.02205
|
Rui Han
|
Rui Han, Shulin Zhan, Chenrong Shao, Junwei Wang, Lizy K. John,
Jiangtao Xu, Gang Lu, Lei Wang
|
BigDataBench-MT: A Benchmark Tool for Generating Realistic Mixed Data
Center Workloads
|
12 pages, 5 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long-running service workloads (e.g. web search engine) and short-term data
analysis workloads (e.g. Hadoop MapReduce jobs) co-locate in today's data
centers. Developing realistic benchmarks to reflect such practical scenario of
mixed workload is a key problem to produce trustworthy results when evaluating
and comparing data center systems. This requires using actual workloads as well
as guaranteeing their submissions to follow patterns hidden in real-world
traces. However, existing benchmarks either generate actual workloads based on
probability models, or replay real-world workload traces using basic I/O
operations. To fill this gap, we propose a benchmark tool that is a first step
towards generating a mix of actual service and data analysis workloads on the
basis of real workload traces. Our tool includes a combiner that enables the
replaying of actual workloads according to the workload traces, and a
multi-tenant generator that flexibly scales the workloads up and down according
to users' requirements. Based on this, our demo illustrates the workload
customization and generation process using a visual interface. The proposed
tool, called BigDataBench-MT, is a multi-tenant version of our comprehensive
benchmark suite BigDataBench and it is publicly available from
http://prof.ict.ac.cn/BigDataBench/multi-tenancyversion/.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 07:15:24 GMT"
},
{
"version": "v2",
"created": "Sun, 19 Apr 2015 10:45:53 GMT"
},
{
"version": "v3",
"created": "Fri, 4 Dec 2015 09:41:03 GMT"
}
] | 2015-12-07T00:00:00 |
[
[
"Han",
"Rui",
""
],
[
"Zhan",
"Shulin",
""
],
[
"Shao",
"Chenrong",
""
],
[
"Wang",
"Junwei",
""
],
[
"John",
"Lizy K.",
""
],
[
"Xu",
"Jiangtao",
""
],
[
"Lu",
"Gang",
""
],
[
"Wang",
"Lei",
""
]
] |
new_dataset
| 0.959803 |
1512.01364
|
Amelia Carolina Sparavigna
|
A.C. Sparavigna and R. Marazzato
|
Using Google Ngram Viewer for Scientific Referencing and History of
Science
|
Keywords: Computers and Society, Literary works, Time-series,
Referencing
| null | null | null |
cs.DL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, several universal digital libraries exist such as Google Books,
Project Gutenberg, Internet Archive libraries, which possess texts from general
collections, and many other archives are available, concerning more specific
subjects. On the digitalized texts available from these libraries, we can
perform several analyses, from those typically used for time-series to those of
network theory. For what concerns time-series, an interesting tool provided by
Google Books exists, which can help us in bibliographical and reference
researches. This tool is the Ngram Viewer, based on yearly count of n-grams. As
we will show in this paper, although it seems suitable just for literary works,
it can be useful for scientific researches, not only for history of science,
but also for acquiring references often unknown to researchers.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2015 10:48:35 GMT"
}
] | 2015-12-07T00:00:00 |
[
[
"Sparavigna",
"A. C.",
""
],
[
"Marazzato",
"R.",
""
]
] |
new_dataset
| 0.987238 |
1512.01438
|
EPTCS
|
Oleg Kiselyov (Tohoku University, Japan), Jacques Garrigue (Nagoya
University, Japan)
|
Proceedings ML Family/OCaml Users and Developers workshops
| null |
EPTCS 198, 2015
|
10.4204/EPTCS.198
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume collects the extended versions of selected papers originally
presented at the two ACM SIGPLAN workshops: ML Family Workshop 2014 and OCaml
2014. Both were affiliated with ICFP 2014 and took place on two consecutive
days, on September 4 and 5, 2014 in Gothenburg, Sweden.
The ML Family workshop aims to recognize the entire extended family of ML and
ML-like languages: languages that are Higher-order, Typed, Inferred, and
Strict. It provides the forum to discuss common issues, both practical
(compilation techniques, implementations of concurrency and parallelism,
programming for the Web) and theoretical (fancy types, module systems,
metaprogramming). The scope of the workshop includes all aspects of the design,
semantics, theory, application, implementation, and teaching of the members of
the ML family.
The OCaml workshop is more specifically targeted at the OCaml community, with
an emphasis on new proposals and tools aiming to improve OCaml, its
environment, and the functioning of the community. As such, it is interested in
works on the type system, language extensions, compiler and optimizations,
applications, tools, and experience reports of exciting uses.
|
[
{
"version": "v1",
"created": "Thu, 3 Dec 2015 01:00:15 GMT"
}
] | 2015-12-07T00:00:00 |
[
[
"Kiselyov",
"Oleg",
"",
"Tohoku University, Japan"
],
[
"Garrigue",
"Jacques",
"",
"Nagoya\n University, Japan"
]
] |
new_dataset
| 0.993505 |
1512.01533
|
Camille Goudeseune
|
Camille Goudeseune
|
Motion trails from time-lapse video
|
7 pages, 6 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From an image sequence captured by a stationary camera, background
subtraction can detect moving foreground objects in the scene. Distinguishing
foreground from background is further improved by various heuristics. Then each
object's motion can be emphasized by duplicating its positions as a motion
trail. These trails clarify the objects' spatial relationships. Also, adding
motion trails to a video before previewing it at high speed reduces the risk of
overlooking transient events.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2015 20:28:27 GMT"
}
] | 2015-12-07T00:00:00 |
[
[
"Goudeseune",
"Camille",
""
]
] |
new_dataset
| 0.9865 |
1411.7277
|
Martin Derka
|
Therese Biedl, Martin Derka
|
$1$-String $B_2$-VPG Representation of Planar Graphs
|
arXiv admin note: text overlap with arXiv:1409.5816
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove that every planar graph has a 1-string $B_2$-VPG
representation---a string representation using paths in a rectangular grid that
contain at most two bends. Furthermore, two paths representing vertices $u,v$
intersect precisely once whenever there is an edge between $u$ and $v$.
|
[
{
"version": "v1",
"created": "Wed, 26 Nov 2014 15:59:43 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Dec 2015 14:25:28 GMT"
}
] | 2015-12-04T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Derka",
"Martin",
""
]
] |
new_dataset
| 0.98644 |
1511.05490
|
Carmelo Cascone
|
Carmelo Cascone, Luca Pollini, Davide Sanvito, Antonio Capone,
Brunilde Sans\`o
|
SPIDER: Fault Resilient SDN Pipeline with Recovery Delay Guarantees
|
8 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When dealing with node or link failures in Software Defined Networking (SDN),
the network capability to establish an alternative path depends on controller
reachability and on the round trip times (RTTs) between controller and involved
switches. Moreover, current SDN data plane abstractions for failure detection
(e.g. OpenFlow "Fast-failover") do not allow programmers to tweak switches'
detection mechanism, thus leaving SDN operators still relying on proprietary
management interfaces (when available) to achieve guaranteed detection and
recovery delays. We propose SPIDER, an OpenFlow-like pipeline design that
provides i) a detection mechanism based on switches' periodic link probing and
ii) fast reroute of traffic flows even in case of distant failures, regardless
of controller availability. SPIDER can be implemented using stateful data plane
abstractions such as OpenState or Open vSwitch, and it offers guaranteed short
(i.e. ms) failure detection and recovery delays, with a configurable trade off
between overhead and failover responsiveness. We present here the SPIDER
pipeline design, behavioral model, and analysis on flow tables' memory impact.
We also implemented and experimentally validated SPIDER using OpenState (an
OpenFlow 1.3 extension for stateful packet processing), showing numerical
results on its performance in terms of recovery latency and packet losses.
|
[
{
"version": "v1",
"created": "Tue, 17 Nov 2015 17:55:13 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Dec 2015 21:47:58 GMT"
}
] | 2015-12-04T00:00:00 |
[
[
"Cascone",
"Carmelo",
""
],
[
"Pollini",
"Luca",
""
],
[
"Sanvito",
"Davide",
""
],
[
"Capone",
"Antonio",
""
],
[
"Sansò",
"Brunilde",
""
]
] |
new_dataset
| 0.988562 |
1512.00727
|
Roy Friedman
|
Gil Einziger, Roy Friedman, Ben Manes
|
TinyLFU: A Highly Efficient Cache Admission Policy
|
A much earlier and shorter version of this work appeared in the
Euromicro PDP 2014 conference
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes to use a frequency based cache admission policy in order
to boost the effectiveness of caches subject to skewed access distributions.
Given a newly accessed item and an eviction candidate from the cache, our
scheme decides, based on the recent access history, whether it is worth
admitting the new item into the cache at the expense of the eviction candidate.
Realizing this concept is enabled through a novel approximate LFU structure
called TinyLFU, which maintains an approximate representation of the access
frequency of a large sample of recently accessed items. TinyLFU is very compact
and light-weight as it builds upon Bloom filter theory.
We study the properties of TinyLFU through simulations of both synthetic
workloads as well as multiple real traces from several sources. These
simulations demonstrate the performance boost obtained by enhancing various
replacement policies with the TinyLFU eviction policy. Also, a new combined
replacement and eviction policy scheme nicknamed W-TinyLFU is presented.
W-TinyLFU is demonstrated to obtain equal or better hit-ratios than other state
of the art replacement policies on these traces. It is the only scheme to
obtain such good results on all traces.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 15:05:46 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Dec 2015 10:38:11 GMT"
}
] | 2015-12-04T00:00:00 |
[
[
"Einziger",
"Gil",
""
],
[
"Friedman",
"Roy",
""
],
[
"Manes",
"Ben",
""
]
] |
new_dataset
| 0.974073 |
1512.01058
|
Anke Brock
|
Anke Brock (Potioc), Christophe Jouffrais (CNRS, IRIT)
|
Interactive audio-tactile maps for visually impaired people
|
\<http://dl.acm.org/citation.cfm?id=J956\&CFID=730680571\&CFTOKEN=17044974\>.
\<10.1145/2850440.2850441\>
|
ACM SIGACCESS Accessibility and Computing (ACM Digital Library),
Association for Computing Machinery (ACM), 2015, pp.3-12.
|
10.1145/2850440.2850441
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visually impaired people face important challenges related to orientation and
mobility. Indeed, 56% of visually impaired people in France declared having
problems concerning autonomous mobility. These problems often mean that
visually impaired people travel less, which influences their personal and
professional life and can lead to exclusion from society. Therefore this issue
presents a social challenge as well as an important research area. Accessible
geographic maps are helpful for acquiring knowledge about a city's or
neighborhood's configuration, as well as selecting a route to reach a
destination. Traditionally, raised-line paper maps with braille text have been
used. These maps have proved to be efficient for the acquisition of spatial
knowledge by visually impaired people. Yet, these maps possess significant
limitations. For instance, due to the specificities of the tactile sense only a
limited amount of information can be displayed on a single map, which
dramatically increases the number of maps that are needed. For the same reason,
it is difficult to represent specific information such as distances. Finally,
braille labels are used for textual descriptions but only a small percentage of
the visually impaired population reads braille. In France 15% of blind people
are braille readers and only 10% can read and write. In the United States,
fewer than 10% of the legally blind people are braille readers and only 10% of
blind children actually learn braille. Recent technological advances have
enabled the design of interactive maps with the aim to overcome these
limitations. Indeed, interactive maps have the potential to provide a broad
spectrum of the population with spatial knowledge, irrespective of age,
impairment, skill level, or other factors. To this regard, they might be an
efficient means for providing visually impaired people with access to
geospatial information. In this paper we give an overview of our research on
making geographic maps accessible to visually impaired people.
|
[
{
"version": "v1",
"created": "Thu, 3 Dec 2015 12:33:54 GMT"
}
] | 2015-12-04T00:00:00 |
[
[
"Brock",
"Anke",
"",
"Potioc"
],
[
"Jouffrais",
"Christophe",
"",
"CNRS, IRIT"
]
] |
new_dataset
| 0.982488 |
1504.08167
|
Orly Avner
|
Orly Avner and Shie Mannor
|
Multi-user lax communications: a multi-armed bandit approach
| null | null | null | null |
cs.LG cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by cognitive radio networks, we consider a setting where multiple
users share several channels modeled as a multi-user multi-armed bandit (MAB)
problem. The characteristics of each channel are unknown and are different for
each user. Each user can choose between the channels, but her success depends
on the particular channel chosen as well as on the selections of other users:
if two users select the same channel their messages collide and none of them
manages to send any data. Our setting is fully distributed, so there is no
central control. As in many communication systems, the users cannot set up a
direct communication protocol, so information exchange must be limited to a
minimum. We develop an algorithm for learning a stable configuration for the
multi-user MAB problem. We further offer both convergence guarantees and
experiments inspired by real communication networks, including comparison to
state-of-the-art algorithms.
|
[
{
"version": "v1",
"created": "Thu, 30 Apr 2015 11:11:54 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Dec 2015 08:50:37 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Avner",
"Orly",
""
],
[
"Mannor",
"Shie",
""
]
] |
new_dataset
| 0.999268 |
1512.00521
|
Cameron McGarry
|
Pedro M. Aguiar, Robert Hornby, Cameron McGarry, Simon O'Keefe,
Angelika Sebald
|
Discrete and Continuous Systems of Logic in Nuclear Magnetic Resonance
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We implement several non-binary logic systems using the spin dynamics of
nuclear spins in nuclear magnetic resonance (NMR). The NMR system is a suitable
test system because of its high degree of experimental control; findings from
NMR implementations are relevant for other computational platforms exploiting
particles with spin, such as electrons or photons. While we do not expect the
NMR system to become a practical computational device, it is uniquely useful to
explore strengths and weaknesses of unconventional computational approaches,
such as non-binary logic.
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2015 23:35:34 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Aguiar",
"Pedro M.",
""
],
[
"Hornby",
"Robert",
""
],
[
"McGarry",
"Cameron",
""
],
[
"O'Keefe",
"Simon",
""
],
[
"Sebald",
"Angelika",
""
]
] |
new_dataset
| 0.990897 |
1512.00596
|
Ira Kemelmacher-Shlizerman
|
Ira Kemelmacher-Shlizerman and Steve Seitz and Daniel Miller and Evan
Brossard
|
The MegaFace Benchmark: 1 Million Faces for Recognition at Scale
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent face recognition experiments on a major benchmark LFW show stunning
performance--a number of algorithms achieve near to perfect score, surpassing
human recognition rates. In this paper, we advocate evaluations at the million
scale (LFW includes only 13K photos of 5K people). To this end, we have
assembled the MegaFace dataset and created the first MegaFace challenge. Our
dataset includes One Million photos that capture more than 690K different
individuals. The challenge evaluates performance of algorithms with increasing
numbers of distractors (going from 10 to 1M) in the gallery set. We present
both identification and verification performance, evaluate performance with
respect to pose and a person's age, and compare as a function of training data
size (number of photos and people). We report results of state of the art and
baseline algorithms. Our key observations are that testing at the million scale
reveals big performance differences (of algorithms that perform similarly well
on smaller scale) and that age invariant recognition as well as pose are still
challenging for most. The MegaFace dataset, baseline code, and evaluation
scripts, are all publicly released for further experimentations at:
megaface.cs.washington.edu.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 07:17:54 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Kemelmacher-Shlizerman",
"Ira",
""
],
[
"Seitz",
"Steve",
""
],
[
"Miller",
"Daniel",
""
],
[
"Brossard",
"Evan",
""
]
] |
new_dataset
| 0.999811 |
1512.00665
|
Weidong Wang
|
Weidong Wang, Chunhua Liao, Liqiang Wang, Daniel J. Quinlan, Wei Lu
|
HBTM: A Heartbeat-based Behavior Detection Mechanism for POSIX Threads
and OpenMP Applications
|
7 pages, 7 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Extreme-scale computing involves hundreds of millions of threads with
multi-level parallelism running on large-scale hierarchical and heterogeneous
hardware. In POSIX threads and OpenMP applications, some key behaviors
occurring in runtime such as thread failure, busy waiting, and exit need to be
accurately and timely detected. However, for the most of these applications,
there are lack of unified and efficient detection mechanisms to do this. In
this paper, a heartbeat-based behavior detection mechanism for POSIX threads
(Pthreads) and OpenMP applications (HBTM) is proposed. In the design, two types
of implementations are conducted, centralized and decentralized respectively.
In both implementations, unified API has been designed to guarantee the
generality of the mechanism. Meanwhile, a ring-based detection algorithm is
designed to ease the burden of the centra thread at runtime. To evaluate the
mechanism, the NAS Parallel Benchmarks (NPB) are used to test the performance
of the HBTM. The experimental results show that the HBTM supports detection of
behaviors of POSIX threads and OpenMP applications while acquiring a short
latency and near 1% overhead.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 12:24:06 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Wang",
"Weidong",
""
],
[
"Liao",
"Chunhua",
""
],
[
"Wang",
"Liqiang",
""
],
[
"Quinlan",
"Daniel J.",
""
],
[
"Lu",
"Wei",
""
]
] |
new_dataset
| 0.999118 |
1512.00728
|
David Bamman
|
Philip Massey, Patrick Xia, David Bamman and Noah A. Smith
|
Annotating Character Relationships in Literary Texts
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We present a dataset of manually annotated relationships between characters
in literary texts, in order to support the training and evaluation of automatic
methods for relation type prediction in this domain (Makazhanov et al., 2014;
Kokkinakis, 2013) and the broader computational analysis of literary character
(Elson et al., 2010; Bamman et al., 2014; Vala et al., 2015; Flekova and
Gurevych, 2015). In this work, we solicit annotations from workers on Amazon
Mechanical Turk for 109 texts ranging from Homer's _Iliad_ to Joyce's _Ulysses_
on four dimensions of interest: for a given pair of characters, we collect
judgments as to the coarse-grained category (professional, social, familial),
fine-grained category (friend, lover, parent, rival, employer), and affinity
(positive, negative, neutral) that describes their primary relationship in a
text. We do not assume that this relationship is static; we also collect
judgments as to whether it changes at any point in the course of the text.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 15:09:31 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Massey",
"Philip",
""
],
[
"Xia",
"Patrick",
""
],
[
"Bamman",
"David",
""
],
[
"Smith",
"Noah A.",
""
]
] |
new_dataset
| 0.951808 |
1512.00779
|
Andrew Winslow
|
Dhananjay Ipparthi, Massimo Mastrangeli, Andrew Winslow
|
Dipole Codes Attractively Encode Glue Functions
|
To appear in Theoretical Computer Science
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dipole words are sequences of magnetic dipoles, in which alike elements repel
and opposite elements attract. Magnetic dipoles contrast with more general sets
of bonding types, called glues, in which pairwise bonding strength is specified
by a glue function. We prove that every glue function $g$ has a set of dipole
words, called a dipole code, that attractively encodes $g$: the pairwise
attractions (positive or non-positive bond strength) between the words are
identical to those of $g$. Moreover, we give such word sets of asymptotically
optimal length. Similar results are obtained for a commonly used subclass of
glue functions.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 17:23:50 GMT"
}
] | 2015-12-03T00:00:00 |
[
[
"Ipparthi",
"Dhananjay",
""
],
[
"Mastrangeli",
"Massimo",
""
],
[
"Winslow",
"Andrew",
""
]
] |
new_dataset
| 0.999454 |
1504.05679
|
Shih-Chun Lin
|
Shih-Chun Lin and I-Hsiang Wang
|
On Two-Pair Two-Way Relay Channel with an Intermittently Available Relay
|
extended version of ISIT 2015 paper
| null |
10.1109/ISIT.2015.7282786
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When multiple users share the same resource for physical layer cooperation
such as relay terminals in their vicinities, this shared resource may not be
always available for every user, and it is critical for transmitting terminals
to know whether other users have access to that common resource in order to
better utilize it. Failing to learn this critical piece of information may
cause severe issues in the design of such cooperative systems. In this paper,
we address this problem by investigating a two-pair two-way relay channel with
an intermittently available relay. In the model, each pair of users need to
exchange their messages within their own pair via the shared relay. The shared
relay, however, is only intermittently available for the users to access. The
accessing activities of different pairs of users are governed by independent
Bernoulli random processes. Our main contribution is the characterization of
the capacity region to within a bounded gap in a symmetric setting, for both
delayed and instantaneous state information at transmitters. An interesting
observation is that the bottleneck for information flow is the quality of state
information (delayed or instantaneous) available at the relay, not those at the
end users. To the best of our knowledge, our work is the first result regarding
how the shared intermittent relay should cooperate with multiple pairs of users
in such a two-way cooperative network.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 07:45:47 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Lin",
"Shih-Chun",
""
],
[
"Wang",
"I-Hsiang",
""
]
] |
new_dataset
| 0.997216 |
1510.03567
|
Georg Nawratil
|
Georg Nawratil
|
On the line-symmetry of self-motions of linear pentapods
|
16 pages, 7 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that all self-motions of pentapods with linear platform of Type 1 and
Type 2 can be generated by line-symmetric motions. Thus this paper closes a gap
between the more than 100 year old works of Duporcq and Borel and the extensive
study of line-symmetric motions done by Krames in the 1930's. As a consequence
we also get a new solution set for the Borel Bricard problem. Moreover we
discuss the reality of self-motions and give a sufficient condition for the
design of linear pentapods of Type 1 and Type 2, which have a self-motion free
workspace.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2015 08:11:15 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Dec 2015 10:36:32 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Nawratil",
"Georg",
""
]
] |
new_dataset
| 0.998 |
1510.08662
|
Robert J. Mokken
|
Steven Laan, Maarten Marx and Robert J. Mokken
|
Close Communities in Social Networks: Boroughs and 2-Clubs
|
Keywords: Social networks, close communication, close communities,
boroughs, 2-clubs, diameter 2, ego-networks
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The structure of close communication, contacts and association in social
networks is studied in the form of maximal subgraphs of diameter 2 (2-clubs),
corresponding to three types of close communities: hamlets, social circles and
coteries. The concept of borough of a graph is defined and introduced. Each
borough is a chained union of 2-clubs of the network and any 2-club of the
network belongs to one borough. Thus the set of boroughs of a network, together
with the 2-clubs held by them, are shown to contain the structure of close
communication in a network. Applications are given with examples from real
world network data.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2015 12:16:40 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Nov 2015 15:29:58 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Nov 2015 13:59:33 GMT"
},
{
"version": "v4",
"created": "Mon, 16 Nov 2015 16:58:23 GMT"
},
{
"version": "v5",
"created": "Tue, 1 Dec 2015 15:54:49 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Laan",
"Steven",
""
],
[
"Marx",
"Maarten",
""
],
[
"Mokken",
"Robert J.",
""
]
] |
new_dataset
| 0.999577 |
1511.08310
|
Mayank Singh
|
Mayank Singh, Rajdeep Sarkar, Pawan Goyal, Animesh Mukherjee, Soumen
Chakrabarti
|
Sic Transit Gloria Manuscriptum: Two Views of the Aggregate Fate of
Ancient Papers
| null | null | null | null |
cs.DL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When PageRank began to be used for ranking in Web search, a concern soon
arose that older pages have an inherent --- and potentially unfair ---
advantage over emerging pages of high quality, because they have had more time
to acquire hyperlink citations. Algorithms were then proposed to compensate for
this effect. Curiously, in bibliometry, the opposite concern has often been
raised: that a growing body of recent papers crowds out older papers, resulting
in a collective amnesia in research communities, which potentially leads to
reinventions, redundancies, and missed opportunities to connect ideas. A recent
paper by Verstak et al. reported experiments on Google Scholar data, which
seemed to refute the amnesia, or aging, hypothesis. They claimed that more
recently written papers have a larger fraction of outbound citations targeting
papers that are older by a fixed number of years, indicating that ancient
papers are alive and well-loved and increasingly easily found, thanks in part
to Google Scholar. In this paper we show that the full picture is considerably
more nuanced. Specifically, the fate of a fixed sample of papers, as they age,
is rather different from what Verstak et al.'s study suggests: there is clear
and steady abandonment in favor of citations to newer papers. The two
apparently contradictory views are reconciled by the realization that, as time
passes, the number of papers older than a fixed number of years grows rapidly.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 07:52:37 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Dec 2015 06:00:30 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Singh",
"Mayank",
""
],
[
"Sarkar",
"Rajdeep",
""
],
[
"Goyal",
"Pawan",
""
],
[
"Mukherjee",
"Animesh",
""
],
[
"Chakrabarti",
"Soumen",
""
]
] |
new_dataset
| 0.986424 |
1512.00047
|
Florentin Smarandache
|
Florentin Smarandache
|
Symbolic Neutrosophic Theory
|
195 pages, several graphs, Published as book in Bruxelles, 2015
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symbolic (or Literal) Neutrosophic Theory is referring to the use of abstract
symbols (i.e. the letters T, I, F, or their refined indexed letters Tj, Ik, Fl)
in neutrosophics. We extend the dialectical triad thesis-antithesis-synthesis
to the neutrosophic tetrad thesis-antithesis-neutrothesis-neutrosynthesis. The
we introduce the neutrosophic system that is a quasi or (t,i,f) classical
system, in the sense that the neutrosophic system deals with quasi-terms
(concepts, attributes, etc.). Then the notions of Neutrosophic Axiom,
Neutrosophic Deducibility, Degree of Contradiction (Dissimilarity) of Two
Neutrosophic Axioms, etc. Afterwards a new type of structures, called (t, i, f)
Neutrosophic Structures, and we show particular cases of such structures in
geometry and in algebra. Also, a short history of the neutrosophic set,
neutrosophic numerical components and neutrosophic literal components,
neutrosophic numbers, etc. We construct examples of splitting the literal
indeterminacy (I) into literal subindeterminacies (I1, I2, and so on, Ir), and
to define a multiplication law of these literal subindeterminacies in order to
be able to build refined I neutrosophic algebraic structures. We define three
neutrosophic actions and their properties. We then introduce the prevalence
order on T,I,F with respect to a given neutrosophic operator. And the
refinement of neutrosophic entities A, neutA, and antiA. Then we extend the
classical logical operators to neutrosophic literal (symbolic) logical
operators and to refined literal (symbolic) logical operators, and we define
the refinement neutrosophic literal (symbolic) space. We introduce the
neutrosophic quadruple numbers (a+bT+cI+dF) and the refined neutrosophic
quadruple numbers. Then we define an absorbance law, based on a prevalence
order, in order to multiply the neutrosophic quadruple numbers.
|
[
{
"version": "v1",
"created": "Sun, 18 Oct 2015 00:32:31 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Smarandache",
"Florentin",
""
]
] |
new_dataset
| 0.999474 |
1512.00067
|
Syed (Shawon) Rahman
|
Lee Rice and Shawon Rahman
|
Non-profit Organizations' Need to Address Security for Effective
Government Contacting
| null | null |
10.5121/ijnsa.2012.4404
| null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The need for information security within small to mid-size companies is
increasing. The risks of information security breach, data loss, and disaster
are growing. The impact of IT outages and issues on the company are
unacceptable to any size business and their clients. There are many ways to
address the security for IT departments. The need to address risks of attacks
as well as disasters is important to the IT security policies and procedures.
The IT departments of small to medium companies have to address these security
concerns within their budgets and other limited resources.Security planning,
design, and employee training that is needed requires input and agreement from
all levels of the company and management. This paper will discuss security
needs and methods to implement them into a corporate infrastructure.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 22:12:59 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Rice",
"Lee",
""
],
[
"Rahman",
"Shawon",
""
]
] |
new_dataset
| 0.992883 |
1512.00126
|
Alex Zhavoronkov
|
Yuri Nikolsky, Roman Gurinovich, Oleg Kuryan, Aleksandr Pashuk, Alexej
Scherbakov, Konstantin Romantsov, Leslie C. Jellen, Alex Zhavoronkov
|
GrantMed: a new, international system for tracking grants and funding
trends in the life sciences
| null | null | null | null |
cs.DL cs.DB cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the success of PubMed and other search engines in managing the
massive volume of biomedical literature and the retrieval of individual
publications, grant-related data remains scattered and relatively inaccessible.
This is problematic, as project and funding data has significant analytical
value and could be integral to publication retrieval. Here, we introduce
GrantMed, a searchable international database of biomedical grants that
integrates some 20 million publications with the nearly 1.4 million research
projects and 650 billion dollars of funding that made them possible. For any
given topic in the life sciences, Grantmed provides instantaneous visualization
of the past 30 years of dollars spent and projects awarded, along with detailed
individual project descriptions, funding amounts, and links to investigators,
research organizations, and resulting publications. It summarizes trends in
funding and publication rates for areas of interest and merges data from
various national grant databases to create one international grant tracking
system. This information will benefit the research community and funding
entities alike. Users can view trends over time or current projects underway
and use this information to navigate the decision-making process in moving
forward. They can view projects prior to publication and records of previous
projects. Convenient access to this data for analytical purposes will be
beneficial in many ways, helping to prevent project overlap, reduce funding
redundancy, identify areas of success, accelerate dissemination of ideas, and
expose knowledge gaps in moving forward. It is our hope that this will be a
central resource for international life sciences research communities and the
funding organizations that support them, ultimately streamlining progress.
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2015 03:06:47 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Nikolsky",
"Yuri",
""
],
[
"Gurinovich",
"Roman",
""
],
[
"Kuryan",
"Oleg",
""
],
[
"Pashuk",
"Aleksandr",
""
],
[
"Scherbakov",
"Alexej",
""
],
[
"Romantsov",
"Konstantin",
""
],
[
"Jellen",
"Leslie C.",
""
],
[
"Zhavoronkov",
"Alex",
""
]
] |
new_dataset
| 0.98967 |
1512.00360
|
Alexander Kott
|
Alexander Kott, David S. Alberts, Cliff Wang
|
War of 2050: a Battle for Information, Communications, and Computer
Security
|
A shorter version of this paper has been accepted for publication in
IEEE Computer, December 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As envisioned in a recent future-casting workshop, warfare will continue to
be transformed by advances in information technologies. In fact, information
itself will become the decisive domain of warfare. Four developments will
significantly change the nature of the battle. The first of these will be a
proliferation of intelligent systems; the second, augmented humans; the third,
the decisive battle for the information domain; and the fourth, the
introduction of new, networked approaches to command and control. Each of these
new capabilities possesses the same critical vulnerability - attacks on the
information, communications and computers that will enable human-robot teams to
make sense of the battlefield and act decisively. Hence, the largely unseen
battle for information, communications and computer security will determine the
extent to which adversaries will be able to function and succeed on the
battlefield of 2050.
|
[
{
"version": "v1",
"created": "Fri, 27 Nov 2015 18:54:58 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Kott",
"Alexander",
""
],
[
"Alberts",
"David S.",
""
],
[
"Wang",
"Cliff",
""
]
] |
new_dataset
| 0.998589 |
1512.00411
|
Christoph Studer
|
Nihat Engin Tunali, Michael Wu, Chris Dick, Christoph Studer
|
Linear Large-Scale MIMO Data Detection for 5G Multi-Carrier Waveform
Candidates
|
Presented at the Asilomar Conference on Signals, Systems, and
Computers
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fifth generation (5G) wireless systems are expected to combine emerging
transmission technologies, such as large-scale multiple-input multiple-output
(MIMO) and non-orthogonal multi-carrier waveforms, to improve the spectral
efficiency and to reduce out-of-band (OOB) emissions. This paper investigates
the efficacy of two promising multi-carrier waveforms that reduce OOB emissions
in combination with large-scale MIMO, namely filter bank multi-carrier (FBMC)
and generalized frequency division multiplexing (GFDM). We develop novel,
low-complexity data detection algorithms for both of these waveforms. We
investigate the associated performance/complexity trade-offs in the context of
large-scale MIMO, and we study the peak-to-average power ratio (PAPR). Our
results show that reducing the OOB emissions with FBMC and GFDM leads to higher
computational complexity and PAPR compared to that of orthogonal
frequency-division multiplexing (OFDM) and single-carrier frequency division
multiple access (SC-FDMA).
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2015 20:01:48 GMT"
}
] | 2015-12-02T00:00:00 |
[
[
"Tunali",
"Nihat Engin",
""
],
[
"Wu",
"Michael",
""
],
[
"Dick",
"Chris",
""
],
[
"Studer",
"Christoph",
""
]
] |
new_dataset
| 0.989218 |
1412.0779
|
Sariel Har-Peled
|
Sariel Har-Peled
|
Shortest Path in a Polygon using Sublinear Space
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}}
\newcommand{\SetX}{\mathsf{X}} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}}
\newcommand{\Polygon}{\mathsf{P}} \newcommand{\Space}{\overline{\mathsf{m}}}
\newcommand{\pth}[2][\!]{#1\left({#2}\right)}$ We resolve an open problem due
to Tetsuo Asano, showing how to compute the shortest path in a polygon, given
in a read only memory, using sublinear space and subquadratic time.
Specifically, given a simple polygon $\Polygon$ with $n$ vertices in a read
only memory, and additional working memory of size $\Space$, the new algorithm
computes the shortest path (in $\Polygon$) in $O( n^2 /\, \Space )$ expected
time. This requires several new tools, which we believe to be of independent
interest.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 04:12:05 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Nov 2015 22:14:23 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Har-Peled",
"Sariel",
""
]
] |
new_dataset
| 0.99808 |
1503.04444
|
Muhammad Masood Tahir Mr.
|
Muhammad Masood Tahir, Ayyaz Hussain
|
Pattern Recognition of Bearing Faults using Smoother Statistical
Features
|
This paper has been withdrawn by the author due to a crucial errors
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pattern recognition (PR) based diagnostic scheme is presented to identify
bearing faults, using time domain features. Vibration data is acquired from
faulty bearings using a test rig. The features are extracted from the data, and
processed prior to utilize in the PR process. The processing involves smoothing
of feature distributions. This reduces the undesired impact of vibration
randomness on the PR process, and thus enhances the diagnostic accuracy of the
model.
|
[
{
"version": "v1",
"created": "Sun, 15 Mar 2015 16:05:24 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Nov 2015 15:04:15 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Tahir",
"Muhammad Masood",
""
],
[
"Hussain",
"Ayyaz",
""
]
] |
new_dataset
| 0.990317 |
1508.02074
|
Jeffrey Shallit
|
Luke Schaeffer and Jeffrey Shallit
|
Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words
in Automatic Sequences
| null | null | null | null |
cs.FL cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the property of being closed (resp., palindromic, rich,
privileged trapezoidal, balanced) is expressible in first-order logic for
automatic (and some related) sequences. It therefore follows that the
characteristic function of those n for which an automatic sequence x has a
closed (resp., palindromic, privileged, rich, trape- zoidal, balanced) factor
of length n is automatic. For privileged words this requires a new
characterization of the privileged property. We compute the corresponding
characteristic functions for various famous sequences, such as the Thue-Morse
sequence, the Rudin-Shapiro sequence, the ordinary paperfolding sequence, the
period-doubling sequence, and the Fibonacci sequence. Finally, we also show
that the function counting the total number of palindromic factors in a prefix
of length n of a k-automatic sequence is not k-synchronized.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 19:28:45 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Nov 2015 12:25:24 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Schaeffer",
"Luke",
""
],
[
"Shallit",
"Jeffrey",
""
]
] |
new_dataset
| 0.99127 |
1511.07907
|
Wei Yuan
|
Wei Yuan, Jianwei Huang, Ying Jun Zhang
|
Competitive Charging Station Pricing for Plug-in Electric Vehicles
|
15 pages, 21 figures
| null | null | null |
cs.GT cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the problem of charging station pricing and plug-in
electric vehicles (PEVs) station selection. When a PEV needs to be charged, it
selects a charging station by considering the charging prices, waiting times,
and travel distances. Each charging station optimizes its charging price based
on the prediction of the PEVs' charging station selection decisions and the
other station's pricing decision, in order to maximize its profit. To obtain
insights of such a highly coupled system, we consider a one-dimensional system
with two competing charging stations and Poisson arriving PEVs. We propose a
multi-leader-multi-follower Stackelberg game model, in which the charging
stations (leaders) announce their charging prices in Stage I, and the PEVs
(followers) make their charging station selections in Stage II. We show that
there always exists a unique charging station selection equilibrium in Stage
II, and such equilibrium depends on the charging stations' service capacities
and the price difference between them. We then characterize the sufficient
conditions for the existence and uniqueness of the pricing equilibrium in Stage
I. We also develop a low complexity algorithm that efficiently computes the
pricing equilibrium and the subgame perfect equilibrium of the two-stage
Stackelberg game.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 22:45:32 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Nov 2015 01:15:07 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Yuan",
"Wei",
""
],
[
"Huang",
"Jianwei",
""
],
[
"Zhang",
"Ying Jun",
""
]
] |
new_dataset
| 0.961777 |
1511.08827
|
Luiz Capretz Dr.
|
Arif Raza, Luiz Fernando Capretz, Faheem Ahmed
|
Maintenance Support in Open Source Software Projects
| null | null |
10.1109/ICDIM.2013.6694005
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Easy and mostly free access to the internet has resulted in the growing use
of open source software (OSS). However, it is a common perception that closed
proprietary software is still superior in areas such as software maintenance
and management. The research model of this study establishes a relationship
between maintenance issues (such as user requests and error handling) and
support provided by open source software through project forums, mailing lists
and trackers. To conduct this research, we have used a dataset consisting of
120 open source software projects, covering a wide range of categories. The
results of the study show that project forums and mailing lists play a
significant role in addressing user requests in open source software. However
according to the empirical investigation, it has been explored that trackers
are used as an effective medium for error reporting as well as user requests.
|
[
{
"version": "v1",
"created": "Fri, 27 Nov 2015 21:43:39 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Raza",
"Arif",
""
],
[
"Capretz",
"Luiz Fernando",
""
],
[
"Ahmed",
"Faheem",
""
]
] |
new_dataset
| 0.999577 |
1511.08857
|
Rajkumar Buyya
|
Rajkumar Buyya and Diana Barreto
|
Multi-Cloud Resource Provisioning with Aneka: A Unified and Integrated
Utilisation of Microsoft Azure and Amazon EC2 Instances
|
14 pages, 12 figures. Conference paper, Proceedings of the 2015
International Conference on Computing and Network Communications (CoCoNet
2015, IEEE Press, USA), Trivandrum, India, December 16-19, 2015
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many vendors are offering computing services on subscription basis via
Infrastructure-as-a-Service (IaaS) model. Users can acquire resources from
different providers and get the best of each of them to run their applications.
However, deploying applications in multi-cloud environments is a complex task.
Therefore, application platforms are needed to help developers to succeed.
Aneka is one such platform that supports developers to program and deploy
distributed applications in multi-cloud environments. It can be used to
provision resources from different cloud providers and can be configured to
request resources dynamically according to the needs of specific applications.
This paper presents extensions incorporated in Aneka to support the deployment
of applications in multi-cloud environments. The first extension shows the
flexibility of Aneka architecture to add cloud providers. Specifically, we
describe the addition of Microsoft Azure IaaS cloud provider. We also discuss
the inclusion of public IPs to communicate resources located in different
networks and the functionality of using PowerShell to automatize installation
of Aneka on remote resources. We demonstrate how an application composed of
independent tasks improves its total execution time when it is deployed in the
multi-cloud environment created by Aneka using resources provisioned from Azure
and EC2.
|
[
{
"version": "v1",
"created": "Sat, 28 Nov 2015 01:06:11 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Buyya",
"Rajkumar",
""
],
[
"Barreto",
"Diana",
""
]
] |
new_dataset
| 0.994215 |
1511.08865
|
Khan Muhammad
|
Khan Muhammad
|
Steganography: A Secure way for Transmission in Wireless Sensor Networks
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Addressing the security concerns in wireless sensor networks (WSN) is a
challenging task, which has attracted the attention of many researchers from
the last few decades. Researchers have presented various schemes in WSN,
addressing the problems of processing, bandwidth, load balancing, and efficient
routing. However, little work has been done on security aspects of WSN. In a
typical WSN network, the tiny nodes installed on different locations sense the
surrounding environment, send the collected data to their neighbors, which in
turn is forwarded to a sink node. The sink node aggregate the data received
from different sensors and send it to the base station for further processing
and necessary actions. In highly critical sensor networks such as military and
law enforcement agencies networks, the transmission of such aggregated data via
the public network Internet is very sensitive and vulnerable to various attacks
and risks. Therefore, this paper provides a solution for addressing these
security issues based on steganography, where the aggregated data can be
embedded as a secret message inside an innocent-looking cover image. The stego
image containing the embedded data can be then sent to fusion center using
Internet. At the fusion center, the hidden data is extracted from the image,
the required processing is performed and decision is taken accordingly.
Experimentally, the proposed method is evaluated by objective analysis using
peak signal-to-noise ratio (PSNR), mean square error (MSE), normalized cross
correlation (NCC), and structural similarity index metric (SSIM), providing
promising results in terms of security and image quality, thus validating its
superiority.
|
[
{
"version": "v1",
"created": "Sat, 28 Nov 2015 04:00:05 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Muhammad",
"Khan",
""
]
] |
new_dataset
| 0.998242 |
1511.08986
|
Rajkumar Buyya
|
Sukhpal Singh, Inderveer Chana and Rajkumar Buyya
|
Agri-Info: Cloud Based Autonomic System for Delivering Agriculture as a
Service
|
31 pages, 28 figures
| null | null |
Technical Report CLOUDS-TR-2015-2, Cloud Computing and Distributed
Systems Laboratory, The University of Melbourne, Nov. 27, 2015
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing has emerged as an important paradigm for managing and
delivering services efficiently over the Internet. Convergence of cloud
computing with technologies such as wireless sensor networking and mobile
computing offers new applications of cloud services but this requires
management of Quality of Service (QoS) parameters to efficiently monitor and
measure the delivered services. This paper presents a QoS-aware Cloud Based
Autonomic Information System for delivering agriculture related information as
a service through the use of latest Cloud technologies which manage various
types of agriculture related data based on different domains. Proposed system
gathers information from various users through preconfigured devices and
manages and provides required information to users automatically. Further,
Cuckoo Optimization Algorithm has been used for efficient resource allocation
at infrastructure level for effective utilization of resources. We have
evaluated the performance of the proposed approach in Cloud environment and
experimental results show that the proposed system performs better in terms of
resource utilization, execution time, cost and computing capacity along with
other QoS parameters.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2015 09:51:36 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Singh",
"Sukhpal",
""
],
[
"Chana",
"Inderveer",
""
],
[
"Buyya",
"Rajkumar",
""
]
] |
new_dataset
| 0.996917 |
1511.09072
|
Mrigank Sharad
|
Tathagata Srimani, Bibhas Manna, Anand Kumar Mukhopadhyay, Kaushik
Roy, Mrigank Sharad
|
High Sensitivity Biosensor using Injection Locked Spin Torque
Nano-Oscillators
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With ever increasing research on magnetic nano systems it is shown to have
great potential in the areas of magnetic storage, biosensing, magnetoresistive
insulation etc. In the field of biosensing specifically Spin Valve sensors
coupled with Magnetic Nanolabels is showing great promise due to noise immunity
and energy efficiency [1]. In this paper we present the application of
injection locked based Spin Torque Nano Oscillator (STNO) suitable for high
resolution energy efficient labeled DNA Detection. The proposed STNO microarray
consists of 20 such devices oscillating at different frequencies making it
possible to multiplex all the signals using capacitive coupling. Frequency
Division Multiplexing can be aided with Time division multiplexing to increase
the device integration and decrease the readout time while maintaining the same
efficiency in presence of constant input referred noise.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2015 19:34:06 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Srimani",
"Tathagata",
""
],
[
"Manna",
"Bibhas",
""
],
[
"Mukhopadhyay",
"Anand Kumar",
""
],
[
"Roy",
"Kaushik",
""
],
[
"Sharad",
"Mrigank",
""
]
] |
new_dataset
| 0.994259 |
1511.09074
|
Mrigank Sharad
|
Sohail Ahasan, Saurav Maji, Kauhsik Roy, Mrigank Sharad
|
Digital LDO with Time-Interleaved Comparators for Fast Response and Low
Ripple
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On-chip voltage regulation using distributed Digital Low Drop Out (LDO)
voltage regulators has been identified as a promising technique for efficient
power-management for emerging multi-core processors. Digital LDOs (DLDO) can
offer low voltage operation, faster transient response, and higher current
efficiency. Response time as well as output voltage ripple can be reduced by
increasing the speed of the dynamic comparators. However, the comparator offset
steeply increases for high clock frequencies, thereby leading to enhanced
variations in output voltage. In this work we explore the design of digital
LDOs with multiple dynamic comparators that can overcome this bottleneck. In
the proposed topology, we apply time-interleaved comparators with the same
voltage threshold and uniform current step in order to accomplish the
aforementioned features. Simulation based analysis shows that the DLDO with
time-interleaved comparators can achieve better overall performance in terms of
current efficiency, ripple and settling time. For a load step of 50mA, a DLDO
with 8 time-interleaved comparators could achieve an output ripple of less than
5mV, while achieving a settling time of less than 0.5us. Load current dependant
dynamic adjustment of clock frequency is proposed to maintain high current
efficiency of ~97%.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2015 19:42:09 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Ahasan",
"Sohail",
""
],
[
"Maji",
"Saurav",
""
],
[
"Roy",
"Kauhsik",
""
],
[
"Sharad",
"Mrigank",
""
]
] |
new_dataset
| 0.968125 |
1511.09079
|
Vladimir Gusev
|
Vladimir V. Gusev and Elena V. Pribavkina
|
Synchronizing automata and principal eigenvectors of the underlying
digraphs
|
11 pages, preliminary version
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A coloring of a digraph with a fixed out-degree k is a distribution of k
labels over the edges resulting in a deterministic finite automaton. An
automaton is called synchronizing if there exists a word which sends all states
of the automaton to a single state. In the present paper we study connections
between spectral and synchronizing properties of digraphs. We show that if a
coloring of a digraph is not synchronizing, then the stationary distribution of
an associated Markov chain has a partition of coordinates into blocks of equal
sum. Moreover, if there exists such a partition, then there exists a
non-synchronizing automaton with such stationary distribution. We extend these
results to bound the number of non-synchronizing colorings for digraphs with
particular eigenvectors. We also demonstrate that the length of the shortest
synchronizing word of any coloring is at most $w^2 - 3w + 3$, where $w$ is the
sum of the coordinates of the integer principal eigenvector of the digraph.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2015 20:02:02 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Gusev",
"Vladimir V.",
""
],
[
"Pribavkina",
"Elena V.",
""
]
] |
new_dataset
| 0.99582 |
1511.09101
|
Pedro Saleiro
|
Pedro Saleiro, S\'ilvio Amir, M\'ario J. Silva, Carlos Soares
|
POPmine: Tracking Political Opinion on the Web
|
2015 IEEE International Conference on Computer and Information
Technology, Ubiquitous Computing and Communications
| null |
10.1109/CIT/IUCC/DASC/PICOM.2015.228
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The automatic content analysis of mass media in the social sciences has
become necessary and possible with the raise of social media and computational
power. One particularly promising avenue of research concerns the use of
opinion mining. We design and implement the POPmine system which is able to
collect texts from web-based conventional media (news items in mainstream media
sites) and social media (blogs and Twitter) and to process those texts,
recognizing topics and political actors, analyzing relevant linguistic units,
and generating indicators of both frequency of mention and polarity
(positivity/negativity) of mentions to political actors across sources, types
of sources, and across time.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2015 22:16:58 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Saleiro",
"Pedro",
""
],
[
"Amir",
"Sílvio",
""
],
[
"Silva",
"Mário J.",
""
],
[
"Soares",
"Carlos",
""
]
] |
new_dataset
| 0.996149 |
1511.09139
|
Jaime A. Moreno
|
Jaime A. Moreno
|
Discontinuous integral control for mechanical systems
|
8 pages, 4 figures.Previous version was submitted to CDC2015
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For mechanical systems we present a controller able to track an unknown
smooth signal, converging in finite time and by means of a continuous control
signal. The control scheme is insensitive against unknown perturbations with
bounded derivative. The controller consists of a non locally Lipschitz state
feedback control law, and a discontinuous integral controller, that is able to
estimate the unknown perturbation and to compensate for it. To complete an
output feedback control a continuous observer for the velocity is added. It is
shown that the closed loop consisting of state feedback, state observer and
discontinuous integral controller has an equilibrium point that is globally,
finite time stable, despite of perturbations with bounded derivative. The proof
is based on a new smooth Lyapunov function.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 02:55:42 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Moreno",
"Jaime A.",
""
]
] |
new_dataset
| 0.999656 |
1511.09368
|
Shihua Zhang
|
Shihua Zhang, Guanghua Hu, Wenwen Min
|
A neurodynamic framework for local community extraction in networks
|
4 figures
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To understand the structure and organization of a large-scale social,
biological or technological network, it can be helpful to describe and extract
local communities or modules of the network. In this article, we develop a
neurodynamic framework to describe the local communities which correspond to
the stable states of a neuro-system built based on the network. The
quantitative criteria to describe the neurodynamic system can cover a large
range of objective functions. The resolution limit of these functions enable us
to propose a generic criterion to explore multi-resolution local communities.
We explain the advantages of this framework and illustrate them by testing on a
number of model and real-world networks.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 16:17:42 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Zhang",
"Shihua",
""
],
[
"Hu",
"Guanghua",
""
],
[
"Min",
"Wenwen",
""
]
] |
new_dataset
| 0.996598 |
1511.09402
|
Elena Galbally
|
Elena Galbally, Frank Small, Ivan Zanco
|
Retractable Prosthesis for Transfemoral Amputees Using Series Elastic
Actuators and Force Control
|
7 pages, 10 figures. arXiv admin note: text overlap with
arXiv:0912.3956 by other authors
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a highly functional and cost-effective prosthesis for transfemoral
amputees that uses series elastic actuators. These actuators allow for accurate
force control, low impedance and large dynamic range. The design involves one
active joint at the knee and a passive joint at the ankle. Additionally, the
socket was designed using mirroring of compliances to ensure maximum comfort.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 17:39:49 GMT"
}
] | 2015-12-01T00:00:00 |
[
[
"Galbally",
"Elena",
""
],
[
"Small",
"Frank",
""
],
[
"Zanco",
"Ivan",
""
]
] |
new_dataset
| 0.988098 |
1505.06784
|
Xinhua Wang
|
Xinhua Wang, Lilong Cai
|
Mathematical modeling and control of a tilt-rotor aircraft
| null |
Aerospace Science and Technology, vol. 47, no. 12, 2015, 473-492
|
10.1016/j.ast.2015.10.012
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel model of large-size tilt-rotor aircraft, which
can operate as a helicopter as well as being capable of transition to
fixed-wing flight. Aerodynamics of the dynamic large-size tilt-rotors based on
blade element method is analyzed during mode transition. For the large-size
aircraft with turboshaft engines, the blade pitch angles of the rotors are
regulated to vary according to the desired level of thrust, and the following
expressions are formulated explicitly: rotor thrust and blade pitch angle, drag
torque and blade pitch angle. A finite-time convergent observer based on
Lyapunov function is developed to reconstruct the unknown variables and
uncertainties during mode transitions. The merits of this design include the
modeling of dynamic large-size tilt-rotor, ease of the uncertainties estimation
during the tilting and the widely applications. Moreover, a switched logic
controller based on the finite-time convergent observer is proposed to drive
the aircraft to implement the mode transition with invariant flying height.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2015 00:49:14 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Jun 2015 05:29:39 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Wang",
"Xinhua",
""
],
[
"Cai",
"Lilong",
""
]
] |
new_dataset
| 0.999497 |
1509.03542
|
Shervin Minaee
|
Shervin Minaee and Yao Wang
|
Fingerprint Recognition Using Translation Invariant Scattering Network
|
IEEE Signal Processing in Medicine and Biology Symposium, 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fingerprint recognition has drawn a lot of attention during last decades.
Different features and algorithms have been used for fingerprint recognition in
the past. In this paper, a powerful image representation called scattering
transform/network, is used for recognition. Scattering network is a
convolutional network where its architecture and filters are predefined wavelet
transforms. The first layer of scattering representation is similar to sift
descriptors and the higher layers capture higher frequency content of the
signal. After extraction of scattering features, their dimensionality is
reduced by applying principal component analysis (PCA). At the end, multi-class
SVM is used to perform template matching for the recognition task. The proposed
scheme is tested on a well-known fingerprint database and has shown promising
results with the best accuracy rate of 98\%.
|
[
{
"version": "v1",
"created": "Fri, 11 Sep 2015 15:04:35 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Sep 2015 14:51:06 GMT"
},
{
"version": "v3",
"created": "Thu, 26 Nov 2015 01:48:13 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Minaee",
"Shervin",
""
],
[
"Wang",
"Yao",
""
]
] |
new_dataset
| 0.963075 |
1511.07727
|
Atilim Gunes Baydin
|
Atilim Gunes Baydin, Barak A. Pearlmutter, Jeffrey Mark Siskind
|
DiffSharp: Automatic Differentiation Library
|
5 pages, 1 figure, minor fixes, added coauthor
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce DiffSharp, an automatic differentiation (AD)
library designed with machine learning in mind. AD is a family of techniques
that evaluate derivatives at machine precision with only a small constant
factor of overhead, by systematically applying the chain rule of calculus at
the elementary operator level. DiffSharp aims to make an extensive array of AD
techniques available, in convenient form, to the machine learning community.
These including arbitrary nesting of forward/reverse AD operations, AD with
linear algebra primitives, and a functional API that emphasizes the use of
higher-order functions and composition. The library exposes this functionality
through an API that provides gradients, Hessians, Jacobians, directional
derivatives, and matrix-free Hessian- and Jacobian-vector products. Bearing the
performance requirements of the latest machine learning techniques in mind, the
underlying computations are run through a high-performance BLAS/LAPACK backend,
using OpenBLAS by default. GPU support is currently being implemented.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 14:28:13 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Nov 2015 16:32:40 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Baydin",
"Atilim Gunes",
""
],
[
"Pearlmutter",
"Barak A.",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.951568 |
1511.08307
|
Kimio Kuramitsu
|
Kimio Kuramitsu
|
Nez: practical open grammar language
|
unpublished draft work (11 pages)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nez is a PEG(Parsing Expressing Grammar)-based open grammar language that
allows us to describe complex syntax constructs without action code. Since open
grammars are declarative and free from a host programming language of parsers,
software engineering tools and other parser applications can reuse once-defined
grammars across programming languages.
A key challenge to achieve practical open grammars is the expressiveness of
syntax constructs and the resulting parser performance, as the traditional
action code approach has provided very pragmatic solutions to these two issues.
In Nez, we extend the symbol-based state management to recognize
context-sensitive language syntax, which often appears in major programming
languages. In addition, the Abstract Syntax Tree constructor allows us to make
flexible tree structures, including the left-associative pair of trees. Due to
these extensions, we have demonstrated that Nez can parse not all but many
grammars.
Nez can generate various types of parsers since all Nez operations are
independent of a specific parser language. To highlight this feature, we have
implemented Nez with dynamic parsing, which allows users to integrate a Nez
parser as a parser library that loads a grammar at runtime. To achieve its
practical performance, Nez operators are assembled into low-level virtual
machine instructions, including automated state modifications when
backtracking, transactional controls of AST construction, and efficient
memoization in packrat parsing. We demonstrate that Nez dynamic parsers achieve
very competitive performance compared to existing efficient parser generators.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 07:37:10 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Kuramitsu",
"Kimio",
""
]
] |
new_dataset
| 0.998745 |
1511.08355
|
Jihong Yu
|
Jihong Yu and Lin Chen
|
From Static to Dynamic Tag Population Estimation: An Extended Kalman
Filter Perspective
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tag population estimation has recently attracted significant research
attention due to its paramount importance on a variety of radio frequency
identification (RFID) applications. However, most, if not all, of existing
estimation mechanisms are proposed for the static case where tag population
remains constant during the estimation process, thus leaving the more
challenging dynamic case unaddressed, despite the fundamental importance of the
latter case on both theoretical analysis and practical application. In order to
bridge this gap, %based on \textit{dynamic framed-slotted ALOHA} (DFSA)
protocol, we devote this paper to designing a generic framework of stable and
accurate tag population estimation schemes based on Kalman filter for both
static and dynamic RFID systems. %The objective is to devise estimation schemes
and analyze the boundedness of estimation error. Technically, we first model
the dynamics of RFID systems as discrete stochastic processes and leverage the
techniques in extended Kalman filter (EKF) and cumulative sum control chart
(CUSUM) to estimate tag population for both static and dynamic systems. By
employing Lyapunov drift analysis, we mathematically characterise the
performance of the proposed framework in terms of estimation accuracy and
convergence speed by deriving the closed-form conditions on the design
parameters under which our scheme can stabilise around the real population size
with bounded relative estimation error that tends to zero with exponential
convergence rate.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 11:03:21 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Yu",
"Jihong",
""
],
[
"Chen",
"Lin",
""
]
] |
new_dataset
| 0.972641 |
1511.08413
|
Sven Puchinger
|
Sven Puchinger, Sven M\"uelich, Karim Ishak, Martin Bossert
|
Code-Based Cryptosystems Using Generalized Concatenated Codes
|
Submitted to Springer Proceedings in Mathematics & Statistics,
special issue devoted to the conference Application of Computer Algebra (ACA)
2015
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The security of public-key cryptosystems is mostly based on number theoretic
problems like factorization and the discrete logarithm. There exists an
algorithm which solves these problems in polynomial time using a quantum
computer. Hence, these cryptosystems will be broken as soon as quantum
computers emerge. Code-based cryptography is an alternative which resists
quantum computers since its security is based on an NP-complete problem, namely
decoding of random linear codes. The McEliece cryptosystem is the most
prominent scheme to realize code-based cryptography. Many codeclasses were
proposed for the McEliece cryptosystem, but most of them are broken by now.
Sendrier suggested to use ordinary concatenated codes, however, he also
presented an attack on such codes. This work investigates generalized
concatenated codes to be used in the McEliece cryptosystem. We examine the
application of Sendrier's attack on generalized concatenated codes and present
alternative methods for both partly finding the code structure and recovering
the plaintext from a cryptogram. Further, we discuss modifications of the
cryptosystem making it resistant against these attacks.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 15:14:56 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Puchinger",
"Sven",
""
],
[
"Müelich",
"Sven",
""
],
[
"Ishak",
"Karim",
""
],
[
"Bossert",
"Martin",
""
]
] |
new_dataset
| 0.998076 |
1511.08522
|
Mohak Sukhwani
|
Mohak Sukhwani, C.V. Jawahar
|
TennisVid2Text: Fine-grained Descriptions for Domain Specific Videos
|
BMVC 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatically describing videos has ever been fascinating. In this work, we
attempt to describe videos from a specific domain - broadcast videos of lawn
tennis matches. Given a video shot from a tennis match, we intend to generate a
textual commentary similar to what a human expert would write on a sports
website. Unlike many recent works that focus on generating short captions, we
are interested in generating semantically richer descriptions. This demands a
detailed low-level analysis of the video content, specially the actions and
interactions among subjects. We address this by limiting our domain to the game
of lawn tennis. Rich descriptions are generated by leveraging a large corpus of
human created descriptions harvested from Internet. We evaluate our method on a
newly created tennis video data set. Extensive analysis demonstrate that our
approach addresses both semantic correctness as well as readability aspects
involved in the task.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 22:21:44 GMT"
}
] | 2015-11-30T00:00:00 |
[
[
"Sukhwani",
"Mohak",
""
],
[
"Jawahar",
"C. V.",
""
]
] |
new_dataset
| 0.999673 |
1511.07847
|
Ulrich Pferschy
|
Andreas Darmann and Ulrich Pferschy and Joachim Schauer
|
The Shortest Connection Game
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Shortest Connection Game, a two-player game played on a directed
graph with edge costs. Given two designated vertices in which they start, the
players take turns in choosing edges emanating from the vertex they are
currently located at. In this way, each of the players forms a path that
origins from its respective starting vertex. The game ends as soon as the two
paths meet, i.e., a connection between the players is established. Each player
has to carry the cost of its chosen edges and thus aims at minimizing its own
total cost.
In this work we analyze the computational complexity of Shortest Connection
Game. On the negative side, the game turns out to be computationally hard even
on restricted graph classes such as bipartite, acyclic and cactus graphs. On
the positive side, we can give a polynomial time algorithm for cactus graphs
when the game is restricted to simple paths.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 19:55:50 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Nov 2015 15:13:06 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Darmann",
"Andreas",
""
],
[
"Pferschy",
"Ulrich",
""
],
[
"Schauer",
"Joachim",
""
]
] |
new_dataset
| 0.999059 |
1511.07915
|
Richard Mayne Mr.
|
James G. H. Whiting, Richard Mayne, Nadine Moody, Ben de Lacy
Costello, Andrew Adamatzky
|
Practical circuits with Physarum Wires
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose: Protoplasmic tubes of Physarum polycephalum, also know as Physarum
Wires (PW), have been previously suggested as novel bio- electronic components.
Until recently, practical examples of electronic circuits using PWs have been
limited. These PWs have been shown to be self repairing, offering significant
advantage over traditional electronic components. This article documents work
performed to produce practical circuits using PWs. Method: We have demonstrated
through manufacture and testing of hybrid circuits that PWs can be used to
produce a variety of practical electronic circuits. A purality of different
applications of PWs have been tested to show the universality of PWs in
analogue and digital electronics. Results: Voltage dividers can be produced
using a pair of PWs in series with an output voltage accurate to within 12%.
PWs can also transmit analogue and digital data with a frequency of up to 19
kHz, which with the addition of a buffer, can drive high current circuits. We
have demonstrated that PWs can last approximately two months, a 4 fold increase
on previous literature. Protoplasmic tubes can be modified with the addition of
conductive or magnetic nano-particles to provide changes in functionality.
Conclusion This work has documented novel macro-scale data transmission through
biological material; it has advanced the field of bio-electronics by providing
a cheap and easy to grow conducting bio-material which may be used in future
hybrid electronic technology.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 23:19:18 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Whiting",
"James G. H.",
""
],
[
"Mayne",
"Richard",
""
],
[
"Moody",
"Nadine",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.99901 |
1511.07951
|
Vittal Premachandran
|
Vittal Premachandran, Boyan Bonev, Alan L. Yuille
|
PASCAL Boundaries: A Class-Agnostic Semantic Boundary Dataset
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the boundary detection task motivated by the
ambiguities in current definition of edge detection. To this end, we generate a
large database consisting of more than 10k images (which is 20x bigger than
existing edge detection databases) along with ground truth boundaries between
459 semantic classes including both foreground objects and different types of
background, and call it the PASCAL Boundaries dataset, which will be released
to the community. In addition, we propose a novel deep network-based
multi-scale semantic boundary detector and name it Multi-scale Deep Semantic
Boundary Detector (M-DSBD). We provide baselines using models that were trained
on edge detection and show that they transfer reasonably to the task of
boundary detection. Finally, we point to various important research problems
that this dataset can be used for.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 05:12:38 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Premachandran",
"Vittal",
""
],
[
"Bonev",
"Boyan",
""
],
[
"Yuille",
"Alan L.",
""
]
] |
new_dataset
| 0.999201 |
1511.07983
|
Teng Li
|
Teng Li, Vikram K. Narayana, Tarek El-Ghazawi
|
Reordering GPU Kernel Launches to Enable Efficient Concurrent Execution
|
2 Pages
| null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Contemporary GPUs allow concurrent execution of small computational kernels
in order to prevent idling of GPU resources. Despite the potential concurrency
between independent kernels, the order in which kernels are issued to the GPU
will significantly influence the application performance. A technique for
deriving suitable kernel launch orders is therefore presented, with the aim of
reducing the total execution time. Experimental results indicate that the
proposed method yields solutions that are well above the 90 percentile mark in
the design space of all possible permutations of the kernel launch sequences.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 08:01:18 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Li",
"Teng",
""
],
[
"Narayana",
"Vikram K.",
""
],
[
"El-Ghazawi",
"Tarek",
""
]
] |
new_dataset
| 0.950895 |
1511.07992
|
Lingfei Jin
|
Keqin Feng, Lingfei Jin, Chaoping Xing and Chen Yuan
|
Multipartite entangled states, symmetric matrices and error-correcting
codes
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit
are maximally mixed. We investigate the general constructions of $k$-uniform
pure quantum states of $n$ subsystems with $d$ levels. We provide one
construction via symmetric matrices and the second one through classical
error-correcting codes. There are three main results arising from our
constructions. Firstly, we show that for any given even $n\ge 2$, there always
exists an $n/2$-uniform $n$-qudit quantum state of level $p$ for sufficiently
large prime $p$. Secondly, both constructions show that their exist $k$-uniform
$n$-qudit pure quantum states such that $k$ is proportional to $n$, i.e.,
$k=\Omega(n)$ although the construction from symmetric matrices outperforms the
one by error-correcting codes. Thirdly, our symmetric matrix construction
provides a positive answer to the open question in \cite{DA} on whether there
exists $3$-uniform $n$-qudit pure quantum state for all $n\ge 8$. In fact, we
can further prove that, for every $k$, there exists a constant $M_k$ such that
there exists a $k$-uniform $n$-qudit quantum state for all $n\ge M_k$. In
addition, by using concatenation of algebraic geometry codes, we give an
explicit construction of $k$-uniform quantum state when $k$ tends to infinity.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 08:32:48 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Feng",
"Keqin",
""
],
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
],
[
"Yuan",
"Chen",
""
]
] |
new_dataset
| 0.999813 |
1511.08166
|
Chandrayee Basu
|
Chandrayee Basu, Anthony Rowe
|
Tracking Motion and Proxemics using Thermal-sensor Array
|
6 pages, 6 figures, Machine Learning for Signal Processing Class
project
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indoor tracking has all-pervasive applications beyond mere surveillance, for
example in education, health monitoring, marketing, energy management and so
on. Image and video based tracking systems are intrusive. Thermal array sensors
on the other hand can provide coarse-grained tracking while preserving privacy
of the subjects. The goal of the project is to facilitate motion detection and
group proxemics modeling using an 8 x 8 infrared sensor array. Each of the 8 x
8 pixels is a temperature reading in Fahrenheit. We refer to each 8 x 8 matrix
as a scene. We collected approximately 902 scenes with different configurations
of human groups and different walking directions. We infer direction of motion
of a subject across a set of scenes as left-to-right, right-to-left, up-to-down
and down-to-up using cross-correlation analysis. We used features from
connected component analysis of each background subtracted scene and performed
Support Vector Machine classification to estimate number of instances of human
subjects in the scene.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 19:14:49 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Basu",
"Chandrayee",
""
],
[
"Rowe",
"Anthony",
""
]
] |
new_dataset
| 0.995646 |
1511.08177
|
Saurabh Gupta
|
Saurabh Gupta, Bharath Hariharan, Jitendra Malik
|
Exploring Person Context and Local Scene Context for Object Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we explore two ways of using context for object detection. The
first model focusses on people and the objects they commonly interact with,
such as fashion and sports accessories. The second model considers more general
object detection and uses the spatial relationships between objects and between
objects and scenes. Our models are able to capture precise spatial
relationships between the context and the object of interest, and make
effective use of the appearance of the contextual region. On the newly released
COCO dataset, our models provide relative improvements of up to 5% over
CNN-based state-of-the-art detectors, with the gains concentrated on hard cases
such as small objects (10% relative improvement).
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 19:45:03 GMT"
}
] | 2015-11-26T00:00:00 |
[
[
"Gupta",
"Saurabh",
""
],
[
"Hariharan",
"Bharath",
""
],
[
"Malik",
"Jitendra",
""
]
] |
new_dataset
| 0.997995 |
1505.07814
|
Xinyu Wu
|
Xinyu Wu, Vishal Saxena, Kehan Zhu, Sakkarapani Balagopal
|
A CMOS Spiking Neuron for Brain-Inspired Neural Networks with Resistive
Synapses and In-Situ Learning
| null |
IEEE Transactions on Circuits and Systems II: Express Briefs,
62(11), 1088-1092, 2015
|
10.1109/TCSII.2015.2456372
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nanoscale resistive memories are expected to fuel dense integration of
electronic synapses for large-scale neuromorphic system. To realize such a
brain-inspired computing chip, a compact CMOS spiking neuron that performs
in-situ learning and computing while driving a large number of resistive
synapses is desired. This work presents a novel leaky integrate-and-fire neuron
design which implements the dual-mode operation of current integration and
synaptic drive, with a single opamp and enables in-situ learning with crossbar
resistive synapses. The proposed design was implemented in a 0.18 $\mu$m CMOS
technology. Measurements show neuron's ability to drive a thousand resistive
synapses, and demonstrate an in-situ associative learning. The neuron circuit
occupies a small area of 0.01 mm$^2$ and has an energy-efficiency of 9.3
pJ$/$spike$/$synapse.
|
[
{
"version": "v1",
"created": "Thu, 28 May 2015 19:30:32 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Nov 2015 18:50:33 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Wu",
"Xinyu",
""
],
[
"Saxena",
"Vishal",
""
],
[
"Zhu",
"Kehan",
""
],
[
"Balagopal",
"Sakkarapani",
""
]
] |
new_dataset
| 0.998424 |
1511.03371
|
Jack Hessel
|
Jack Hessel, Alexandra Schofield, Lillian Lee, David Mimno
|
What do Vegans do in their Spare Time? Latent Interest Detection in
Multi-Community Networks
|
NIPS 2015 Network Workshop
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most social network analysis works at the level of interactions between
users. But the vast growth in size and complexity of social networks enables us
to examine interactions at larger scale. In this work we use a dataset of 76M
submissions to the social network Reddit, which is organized into distinct
sub-communities called subreddits. We measure the similarity between entire
subreddits both in terms of user similarity and topical similarity. Our goal is
to find community pairs with similar userbases, but dissimilar content; we
refer to this type of relationship as a "latent interest." Detection of latent
interests not only provides a perspective on individual users as they shift
between roles (student, sports fan, political activist) but also gives insight
into the dynamics of Reddit as a whole. Latent interest detection also has
potential applications for recommendation systems and for researchers examining
community evolution.
|
[
{
"version": "v1",
"created": "Wed, 11 Nov 2015 03:07:00 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Nov 2015 05:11:11 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Hessel",
"Jack",
""
],
[
"Schofield",
"Alexandra",
""
],
[
"Lee",
"Lillian",
""
],
[
"Mimno",
"David",
""
]
] |
new_dataset
| 0.971293 |
1511.07536
|
Shayak Sen Shayak Sen
|
Anupam Datta, Joseph Y. Halpern, John C. Mitchell, Arnab Roy, Shayak
Sen
|
A Symbolic Logic with Concrete Bounds for Cryptographic Protocols
| null | null | null | null |
cs.LO cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a formal logic for quantitative reasoning about security
properties of network protocols. The system allows us to derive concrete
security bounds that can be used to choose key lengths and other security
parameters. We provide axioms for reasoning about digital signatures and random
nonces, with security properties based on the concrete security of signature
schemes and pseudorandom number generators (PRG). The formal logic supports
first-order reasoning and reasoning about protocol invariants, taking concrete
security bounds into account. Proofs constructed in our logic also provide
conventional asymptotic security guarantees because of the way that concrete
bounds accumulate in proofs. As an illustrative example, we use the formal
logic to prove an authentication property with concrete bounds of a
signature-based challenge-response protocol.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 01:52:04 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Datta",
"Anupam",
""
],
[
"Halpern",
"Joseph Y.",
""
],
[
"Mitchell",
"John C.",
""
],
[
"Roy",
"Arnab",
""
],
[
"Sen",
"Shayak",
""
]
] |
new_dataset
| 0.997969 |
1511.07542
|
Mingyue Ji
|
Mingyue Ji, Antonia Tulino, Jaime Llorca, Giuseppe Caire
|
Caching-Aided Coded Multicasting with Multiple Random Requests
|
5 pages, 1 figure, published in ITW 2015. arXiv admin note: text
overlap with arXiv:1402.4572
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of caching networks has received considerable attention in the
past few years. A particularly studied setting is the shared link caching
network, in which a single source with access to a file library communicates
with multiple users, each having the capability to store segments (packets) of
the library files, over a shared multicast link. Each user requests one file
from the library according to a common demand distribution and the server sends
a coded multicast message to satisfy all users at once. The problem consists of
finding the smallest possible average codeword length to satisfy such requests.
In this paper, we consider the generalization to the case where each user
places L >= 1 independent requests according to the same common demand
distribution. We propose an achievable scheme based on random vector
(packetized) caching placement and multiple groupcast index coding, shown to be
order-optimal in the asymptotic regime in which the number of packets per file
B goes to infinity. We then show that the scalar (B = 1) version of the
proposed scheme can still preserve order-optimality when the number of per-user
requests L is large enough. Our results provide the first order-optimal
characterization of the shared link caching network with multiple random
requests, revealing the key effects of L on the performance of caching-aided
coded multicast schemes.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 02:20:47 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Ji",
"Mingyue",
""
],
[
"Tulino",
"Antonia",
""
],
[
"Llorca",
"Jaime",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.997212 |
1511.07714
|
Mark Riedl
|
Mark O. Riedl
|
A Python Engine for Teaching Artificial Intelligence in Games
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer games play an important role in our society and motivate people to
learn computer science. Since artificial intelligence is integral to most
games, they can also be used to teach artificial intelligence. We introduce the
Game AI Game Engine (GAIGE), a Python game engine specifically designed to
teach about how AI is used in computer games. A progression of seven
assignments builds toward a complete, working Multi-User Battle Arena (MOBA)
game. We describe the engine, the assignments, and our experiences using it in
a class on Game Artificial Intelligence.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 14:13:33 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Riedl",
"Mark O.",
""
]
] |
new_dataset
| 0.953545 |
1511.07788
|
Krzysztof Wo{\l}k
|
Krzysztof Marasek, {\L}ukasz Brocki, Danijel Korzinek, Krzysztof
Wo{\l}k, Ryszard Gubrynowicz
|
Spoken Language Translation for Polish
|
Marasek K., Wo{\l}k K., Korzinek D., Brocki {\L}., Spoken Language
Translation for Polish, Proceedings of Forum Acuscticum 2014, Krak\'ow. arXiv
admin note: substantial text overlap with arXiv:1509.08909
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spoken language translation (SLT) is becoming more important in the
increasingly globalized world, both from a social and economic point of view.
It is one of the major challenges for automatic speech recognition (ASR) and
machine translation (MT), driving intense research activities in these areas.
While past research in SLT, due to technology limitations, dealt mostly with
speech recorded under controlled conditions, today's major challenge is the
translation of spoken language as it can be found in real life. Considered
application scenarios range from portable translators for tourists, lectures
and presentations translation, to broadcast news and shows with live
captioning. We would like to present PJIIT's experiences in the SLT gained from
the Eu-Bridge 7th framework project and the U-Star consortium activities for
the Polish/English language pair. Presented research concentrates on ASR
adaptation for Polish (state-of-the-art acoustic models: DBN-BLSTM training,
Kaldi: LDA+MLLT+SAT+MMI), language modeling for ASR & MT (text normalization,
RNN-based LMs, n-gram model domain interpolation) and statistical translation
techniques (hierarchical models, factored translation models, automatic casing
and punctuation, comparable and bilingual corpora preparation). While results
for the well-defined domains (phrases for travelers, parliament speeches,
medical documentation, movie subtitling) are very encouraging, less defined
domains (presentation, lectures) still form a challenge. Our progress in the
IWSLT TED task (MT only) will be presented, as well as current progress in the
Polish ASR.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 16:28:16 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Marasek",
"Krzysztof",
""
],
[
"Brocki",
"Łukasz",
""
],
[
"Korzinek",
"Danijel",
""
],
[
"Wołk",
"Krzysztof",
""
],
[
"Gubrynowicz",
"Ryszard",
""
]
] |
new_dataset
| 0.963142 |
1511.07792
|
Elena Dubrova
|
Elena Dubrova and Mats N\"aslund and Gunnar Carlsson and John Fornehed
and Ben Smeets
|
Two Countermeasures Against Hardware Trojans Exploiting Non-Zero
Aliasing Probability of BIST
|
16 pages, 5 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The threat of hardware Trojans has been widely recognized by academia,
industry, and government agencies. A Trojan can compromise security of a system
in spite of cryptographic protection. The damage caused by a Trojan may not be
limited to a business or reputation, but could have a severe impact on public
safety, national economy, or national security. An extremely stealthy way of
implementing hardware Trojans has been presented by Becker et al. at CHES'2012.
Their work have shown that it is possible to inject a Trojan in a random number
generator compliant with FIPS 140-2 and NIST SP800-90 standards by exploiting
non-zero aliasing probability of Logic Built-In-Self-Test (LBIST). In this
paper, we present two methods for modifying LBIST to prevent such an attack.
The first method makes test patterns dependent on a configurable key which is
programed into a chip after the manufacturing stage. The second method uses a
remote test management system which can execute LBIST using a different set of
test patterns at each test cycle.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 16:40:08 GMT"
}
] | 2015-11-25T00:00:00 |
[
[
"Dubrova",
"Elena",
""
],
[
"Näslund",
"Mats",
""
],
[
"Carlsson",
"Gunnar",
""
],
[
"Fornehed",
"John",
""
],
[
"Smeets",
"Ben",
""
]
] |
new_dataset
| 0.996071 |
1507.04110
|
Khalid Khan
|
Khalid Khan, D.K. Lobiyal and Adem Kilicman
|
A de Casteljau Algorithm for Bernstein type Polynomials based on
(p,q)-integers
|
16 pages, 7 figures, basis function revised. arXiv admin note:
substantial text overlap with arXiv:1505.01810
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier
curves based on (p,q)-integers is introduced. We study the nature of degree
elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new
curves have some properties similar to q-Bezier curves. Moreover, we construct
the corresponding tensor product surfaces over the rectangular domain (u, v)
\in [0, 1] \times [0, 1] depending on four parameters. We also study the de
Casteljau algorithm and degree evaluation properties of the surfaces for these
generalization over the rectangular domain. Furthermore, some fundamental
properties for (p,q)-Bernstein Bezier curves are discussed. We get q-Bezier
curves and surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the
parameter p1 = p2 = 1.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 07:57:26 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Aug 2015 12:31:22 GMT"
},
{
"version": "v3",
"created": "Thu, 22 Oct 2015 14:09:30 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Nov 2015 10:30:39 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Khan",
"Khalid",
""
],
[
"Lobiyal",
"D. K.",
""
],
[
"Kilicman",
"Adem",
""
]
] |
new_dataset
| 0.995183 |
1507.05138
|
Shaoshi Yang Dr.
|
Shaoshi Yang, Lajos Hanzo
|
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
|
51 pages, 36 figures, 10 tables, 659 references, accepted to appear
on IEEE Communications Surveys & Tutorials, June 2015
|
IEEE Communications Surveys & Tutorials, vol. 17, no. 4, pp.
1941-1988, Fourth Quarter 2015
|
10.1109/COMST.2015.2475242
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emerging massive/large-scale MIMO (LS-MIMO) systems relying on very large
antenna arrays have become a hot topic of wireless communications. Compared to
the LTE based 4G mobile communication system that allows for up to 8 antenna
elements at the base station (BS), the LS-MIMO system entails an unprecedented
number of antennas, say 100 or more, at the BS. The huge leap in the number of
BS antennas opens the door to a new research field in communication theory,
propagation and electronics, where random matrix theory begins to play a
dominant role.
In this paper, we provide a recital on the historic heritages and novel
challenges facing LS-MIMOs from a detection perspective. Firstly, we highlight
the fundamentals of MIMO detection, including the nature of co-channel
interference, the generality of the MIMO detection problem, the received signal
models of both linear memoryless MIMO channels and dispersive MIMO channels
exhibiting memory, as well as the complex-valued versus real-valued MIMO system
models. Then, an extensive review of the representative MIMO detection methods
conceived during the past 50 years (1965-2015) is presented, and relevant
insights as well as lessons are inferred for designing complexity-scalable MIMO
detection algorithms that are potentially applicable to LS-MIMO systems.
Furthermore, we divide the LS-MIMO systems into two types, and elaborate on the
distinct detection strategies suitable for each of them. The type-I LS-MIMO
corresponds to the case where the number of active users is much smaller than
the number of BS antennas, which is currently the mainstream definition of
LS-MIMO. The type-II LS-MIMO corresponds to the case where the number of active
users is comparable to the number of BS antennas. Finally, we discuss the
applicability of existing MIMO detection algorithms in LS-MIMO systems, and
review some of the recent advances in LS-MIMO detection.
|
[
{
"version": "v1",
"created": "Sat, 18 Jul 2015 02:05:08 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Yang",
"Shaoshi",
""
],
[
"Hanzo",
"Lajos",
""
]
] |
new_dataset
| 0.999384 |
1509.00552
|
Bing Shuai
|
Bing Shuai, Zhen Zuo, Gang Wang, Bing Wang
|
DAG-Recurrent Neural Networks For Scene Labeling
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In image labeling, local representations for image units are usually
generated from their surrounding image patches, thus long-range contextual
information is not effectively encoded. In this paper, we introduce recurrent
neural networks (RNNs) to address this issue. Specifically, directed acyclic
graph RNNs (DAG-RNNs) are proposed to process DAG-structured images, which
enables the network to model long-range semantic dependencies among image
units. Our DAG-RNNs are capable of tremendously enhancing the discriminative
power of local representations, which significantly benefits the local
classification. Meanwhile, we propose a novel class weighting function that
attends to rare classes, which phenomenally boosts the recognition accuracy for
non-frequent classes. Integrating with convolution and deconvolution layers,
our DAG-RNNs achieve new state-of-the-art results on the challenging SiftFlow,
CamVid and Barcelona benchmarks.
|
[
{
"version": "v1",
"created": "Wed, 2 Sep 2015 03:09:23 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Nov 2015 12:27:52 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Shuai",
"Bing",
""
],
[
"Zuo",
"Zhen",
""
],
[
"Wang",
"Gang",
""
],
[
"Wang",
"Bing",
""
]
] |
new_dataset
| 0.996208 |
1510.03081
|
Mathew Samimi
|
Mathew K. Samimi and Theodore S. Rappaport
|
Statistical Channel Model with Multi-Frequency and Arbitrary Antenna
Beamwidth for Millimeter-Wave Outdoor Communications
|
7 pages, 7 figures, accepted in 2015 IEEE Global Communications
Conference, Exhibition & Industry Forum (GLOBECOM) Workshop, Dec. 6-10, 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a 3-dimensional millimeter-wave statistical channel
impulse response model from 28 GHz and 73 GHz ultrawideband propagation
measurements. An accurate 3GPP-like channel model that supports arbitrary
carrier frequency, RF bandwidth, and antenna beamwidth (for both
omnidirectional and arbitrary directional antennas), is provided. Time cluster
and spatial lobe model parameters are extracted from empirical distributions
from field measurements. A step-by-step modeling procedure for generating
channel coefficients is shown to agree with statistics from the field
measurements, thus confirming that the statistical channel model faithfully
recreates spatial and temporal channel impulse responses for use in
millimeter-wave 5G air interface designs.
|
[
{
"version": "v1",
"created": "Sun, 11 Oct 2015 17:31:45 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 21:48:06 GMT"
},
{
"version": "v3",
"created": "Fri, 6 Nov 2015 02:28:08 GMT"
},
{
"version": "v4",
"created": "Sat, 21 Nov 2015 23:17:50 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Samimi",
"Mathew K.",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.966288 |
1511.06759
|
Safeeullah Soomro
|
Tanesh Kumar, Faizan Khan, Safeeullah Soomro, Areez Khalil Memon
|
WLAN Specific IoT Enable Power Efficient RAM Design on 40nm FPGA
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasing the speed of computer is one of the important aspects of the
Random Access Memory (RAM) and for better and fast processing it should be
efficient. In this work, the main focus is to design energy efficient RAM and
it also can be accessed through internet. A 128-bit IPv6 address is added to
the RAM in order to control it via internet. Four different types of Low
Voltage CMOS (LCVMOS) IO standards are used to make it low power under five
different WLAN frequencies is taken. At WLAN frequency 2.4GHz, there is maximum
power reduction of 85% is achieved when LVCMOS12 is taken in place of LVCMOS25.
This design is implemented using Virtex-6 FPGA, Device xc6vlx75t and Package
FF484
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2015 18:44:37 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Kumar",
"Tanesh",
""
],
[
"Khan",
"Faizan",
""
],
[
"Soomro",
"Safeeullah",
""
],
[
"Memon",
"Areez Khalil",
""
]
] |
new_dataset
| 0.997803 |
1511.06825
|
Nguyen Quang-Hung
|
Nguyen Quang-Hung, Nam Thoai
|
EMinRET: Heuristic for Energy-Aware VM Placement with Fixed Intervals
and Non-preemption
|
8 pages, 4 figures, The International Conference on Advanced
Computing and Applications (ACOMP)
| null | null | null |
cs.NI cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Infrastructure-as-a-Service (IaaS) clouds have become more popular enabling
users to run applications under virtual machines. This paper investigates the
energy-aware virtual machine (VM) allocation problems in IaaS clouds along
characteristics: multiple resources, and fixed interval times and
non-preemption of virtual machines. Many previous works proposed to use a
minimum number of physical machines, however, this is not necessarily a good
solution to minimize total energy consumption in the VM placement with multiple
resources, fixed interval times and non-preemption. We observed that minimizing
total energy consumption of physical machines is equivalent to minimize the sum
of total completion time of all physical machines. Based on the observation, we
propose EMinRET algorithm. The EMinRET algorithm swaps an allocating VM with a
suitable overlapped VM, which is of the same VM type and is allocated on the
same physical machine, to minimize total completion time of all physical
machines. The EMinRET uses resource utilization during executing time period of
a physical machine as the evaluation metric, and will then choose a host that
minimizes the metric to allocate a new VM. In addition, this work studies some
heuristics for sorting the list of virtual machines (e.g., sorting by the
earliest starting time, or the longest duration time first, etc.) to allocate
VM. Using the realistic log-trace in the Parallel Workloads Archive, our
simulation results show that the EMinRET algorithm could reduce from 25% to 45%
energy consumption compared with power-aware best-fit decreasing (PABFD)) and
vector bin-packing norm-based greedy algorithms. Moreover, the EMinRET
heuristic has also less total energy consumption than our previous heuristics
(e.g. MinDFT and EPOBF) in the simulations (using same virtual machines sorting
method).
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2015 03:40:56 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Quang-Hung",
"Nguyen",
""
],
[
"Thoai",
"Nam",
""
]
] |
new_dataset
| 0.993861 |
1511.06968
|
Raghu Prabhakar
|
Raghu Prabhakar, David Koeplinger, Kevin Brown, HyoukJoong Lee,
Christopher De Sa, Christos Kozyrakis, Kunle Olukotun
|
Generating Configurable Hardware from Parallel Patterns
| null | null | null | null |
cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years the computing landscape has seen an in- creasing shift
towards specialized accelerators. Field pro- grammable gate arrays (FPGAs) are
particularly promising as they offer significant performance and energy
improvements compared to CPUs for a wide class of applications and are far more
flexible than fixed-function ASICs. However, FPGAs are difficult to program.
Traditional programming models for reconfigurable logic use low-level hardware
description languages like Verilog and VHDL, which have none of the pro-
ductivity features of modern software development languages but produce very
efficient designs, and low-level software lan- guages like C and OpenCL coupled
with high-level synthesis (HLS) tools that typically produce designs that are
far less efficient. Functional languages with parallel patterns are a better
fit for hardware generation because they both provide high-level abstractions
to programmers with little experience in hard- ware design and avoid many of
the problems faced when gen- erating hardware from imperative languages. In
this paper, we identify two optimizations that are important when using par-
allel patterns to generate hardware: tiling and metapipelining. We present a
general representation of tiled parallel patterns, and provide rules for
automatically tiling patterns and gen- erating metapipelines. We demonstrate
experimentally that these optimizations result in speedups up to 40x on a set
of benchmarks from the data analytics domain.
|
[
{
"version": "v1",
"created": "Sun, 22 Nov 2015 05:57:27 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Prabhakar",
"Raghu",
""
],
[
"Koeplinger",
"David",
""
],
[
"Brown",
"Kevin",
""
],
[
"Lee",
"HyoukJoong",
""
],
[
"De Sa",
"Christopher",
""
],
[
"Kozyrakis",
"Christos",
""
],
[
"Olukotun",
"Kunle",
""
]
] |
new_dataset
| 0.99371 |
1511.07008
|
Mikhail Malt M.
|
Mikhail Malt, Marta Gentilucci
|
Real Time Vowel Tremolo Detection Using Low Level Audio Descriptors
|
6 pages, 6 figures, 2 tables, lab report
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper resumes the results of a research conducted in a music production
situation Therefore, it is more a final lab report, a prospective methodology
then a scientific experience. The methodology we are presenting was developed
as an answer to a musical problem raised by the Italian composer Marta
Gentilucci. The problem was "how to extract a temporal structure from a vowel
tremolo, on a tenuto (steady state) pitch." The musical goal was to apply, in a
compositional context the vowel tremolo time structure on a tenuto pitch chord,
as a transposition control.In this context we decide to follow, to explore the
potential of low-level MPEG7 audio descriptors to build event detection
functions. One of the main problems using low-level audio descriptors in audio
analysis is the redundancy of information among them. We describe an "ad hoc"
interactive methodology, based on side effect use of dimensionality reduction
by PCA, to choose a feature from a set of low-level audio descriptors, to be
used to detect a vowel tremolo rhythm. This methodology is supposed to be
interactive and easy enough to be used in a live creative context.
|
[
{
"version": "v1",
"created": "Sun, 22 Nov 2015 13:05:05 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Malt",
"Mikhail",
""
],
[
"Gentilucci",
"Marta",
""
]
] |
new_dataset
| 0.999055 |
1511.07093
|
Nalin Asanka Gamagedara Arachchilage
|
Nalin Asanka Gamagedara Arachchilage, Ali Tarhini, Steve Love
|
Designing a mobile game to thwarts malicious IT threats: A phishing
threat avoidance perspective
|
9, International Journal for Infonomics (IJI), Volume 8 Issues 3/4,
September/December 2015. arXiv admin note: text overlap with arXiv:1511.01622
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Phishing is an online identity theft, which aims to steal sensitive
information such as username, password and online banking details from victims.
To prevent this, phishing education needs to be considered. Game based
education is becoming more and more popular. This paper introduces a mobile
game prototype for the android platform based on a story, which simplifies and
exaggerates real life. The elements of a game design framework for avoiding
phishing attacks were used to address the game design issues and game design
principles were used as a set of guidelines for structuring and presenting
information. The overall mobile game design was aimed to enhance the user's
avoidance behaviour through motivation to protect themselves against phishing
threats. The prototype mobile game design was presented on MIT App Inventor
Emulator.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 01:32:59 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Arachchilage",
"Nalin Asanka Gamagedara",
""
],
[
"Tarhini",
"Ali",
""
],
[
"Love",
"Steve",
""
]
] |
new_dataset
| 0.963415 |
1511.07353
|
Ahmed Bin Shafaat Ahmed Bin Shafaat
|
Kamran Shaukat, Nayyer Masood, Ahmed Bin Shafaat, Kamran Jabbar,
Hassan Shabbir and Shakir Shabbir
|
Dengue Fever in Perspective of Clustering Algorithms
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
Dengue fever is a disease which is transmitted and caused by Aedes Aegypti
mosquitos. Dengue has become a serious health issue in all over the world
especially in those countries who are situated in tropical or subtropical
regions because rain is an important factor for growth and increase in the
population of dengue transmitting mosquitos. For a long time, data mining
algorithms have been used by the scientists for the diagnosis and prognosis of
different diseases which includes dengue as well. This was a study to analyses
the attack of dengue fever in different areas of district Jhelum, Pakistan in
2011. As per our knowledge, we are unaware of any kind of research study in the
area of district Jhelum for diagnosis or analysis of dengue fever. According to
our information, we are the first one researching and analyzing dengue fever in
this specific area. Dataset was obtained from the office of Executive District
Officer EDO (health) District Jhelum. We applied DBSCAN algorithm for the
clustering of dengue fever. First we showed overall behavior of dengue in the
district Jhelum. Then we explained dengue fever at tehsil level with the help
of geographical pictures. After that we have elaborated comparison of different
clustering algorithms with the help of graphs based on our dataset. Those
algorithms include k-means, K-mediods, DBSCAN and OPTICS.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 18:27:21 GMT"
}
] | 2015-11-24T00:00:00 |
[
[
"Shaukat",
"Kamran",
""
],
[
"Masood",
"Nayyer",
""
],
[
"Shafaat",
"Ahmed Bin",
""
],
[
"Jabbar",
"Kamran",
""
],
[
"Shabbir",
"Hassan",
""
],
[
"Shabbir",
"Shakir",
""
]
] |
new_dataset
| 0.993476 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.