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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1507.06988
|
Luiz Capretz Dr.
|
Lihua Wang, Luz Fernando Capretz
|
A Binary Data Stream Scripting Language
| null |
Transactions on Information Science and Applications,
3(2):291-298, 2006
| null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Any file is fundamentally a binary data stream. A practical solution was
achieved to interpret binary data stream. A new scripting language named Data
Format Scripting Language (DFSL) was developed to describe the physical layout
of the data in a structural, more intelligible way. On the basis of the
solution, a generic software application was implemented; it parses various
binary data streams according to their respective DFSL scripts and generates
human-readable result and XML document for data sharing. Our solution helps
eliminate the error-prone low-level programming, especially in the hardware
devices or network protocol development/debugging processes.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 18:26:21 GMT"
}
] | 2015-07-28T00:00:00 |
[
[
"Wang",
"Lihua",
""
],
[
"Capretz",
"Luz Fernando",
""
]
] |
new_dataset
| 0.992925 |
1507.07200
|
Jaderick Pabico
|
Jaderick P. Pabico, Jose Rene L. Micor and Elmer Rico E. Mojica
|
A Neural Prototype for a Virtual Chemical Spectrophotometer
|
5 pages, 3 figures, appeared in Proceedings (CDROM) of the 6th
National Conference on IT in Education (NCITE 2008), University of the
Philippines Los Ba\~nos, 23-24 October 2008
|
Philippine Computing Journal, 4(2):39-42, 2009
| null | null |
cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
A virtual chemical spectrophotometer for the simultaneous analysis of nickel
(Ni) and cobalt (Co) was developed based on an artificial neural network (ANN).
The developed ANN correlates the respective concentrations of Co and Ni given
the absorbance profile of a Co-Ni mixture based on the Beer's Law. The virtual
chemical spectrometer was trained using a 3-layer jump connection neural
network model (NNM) with 126 input nodes corresponding to the 126 absorbance
readings from 350 nm to 600 nm, 70 nodes in the hidden layer using a logistic
activation function, and 2 nodes in the output layer with a logistic function.
Test result shows that the NNM has correlation coefficients of 0.9953 and
0.9922 when predicting [Co] and [Ni], respectively. We observed, however, that
the NNM has a duality property and that there exists a real-world practical
application in solving the dual problem: Predict the Co-Ni mixture's absorbance
profile given [Co] and [Ni]. It turns out that the dual problem is much harder
to solve because the intended output has a much bigger cardinality than that of
the input. Thus, we trained the dual ANN, a 3-layer jump connection nets with 2
input nodes corresponding to [Co] and [Ni], 70-logistic-activated nodes in the
hidden layer, and 126 output nodes corresponding to the 126 absorbance readings
from 250 nm to 600 nm. Test result shows that the dual NNM has correlation
coefficients that range from 0.9050 through 0.9980 at 356 nm through 578 nm
with the maximum coefficient observed at 480 nm. This means that the dual ANN
can be used to predict the absorbance profile given the respective Co-Ni
concentrations which can be of importance in creating academic models for a
virtual chemical spectrophotometer.
|
[
{
"version": "v1",
"created": "Sun, 26 Jul 2015 14:13:29 GMT"
}
] | 2015-07-28T00:00:00 |
[
[
"Pabico",
"Jaderick P.",
""
],
[
"Micor",
"Jose Rene L.",
""
],
[
"Mojica",
"Elmer Rico E.",
""
]
] |
new_dataset
| 0.99248 |
1507.07292
|
Huseyin Birkan Yilmaz
|
Weisi Guo and Taufiq Asyhari and Nariman Farsad and H. Birkan Yilmaz
and Bin Li and Andrew Eckford and Chan-Byoung Chae
|
Molecular Communications: Channel Model and Physical Layer Techniques
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article examines recent research in molecular communications from a
telecommunications system design perspective. In particular, it focuses on
channel models and state-of-the-art physical layer techniques. The goal is to
provide a foundation for higher layer research and motivation for research and
development of functional prototypes. In the first part of the article, we
focus on the channel and noise model, comparing molecular and radio-wave
pathloss formulae. In the second part, the article examines, equipped with the
appropriate channel knowledge, the design of appropriate modulation and error
correction coding schemes. The third reviews transmitter and receiver side
signal processing methods that suppress inter-symbol-interference. Taken
together, the three parts present a series of physical layer techniques that
are necessary to producing reliable and practical molecular communications.
|
[
{
"version": "v1",
"created": "Mon, 27 Jul 2015 03:42:59 GMT"
}
] | 2015-07-28T00:00:00 |
[
[
"Guo",
"Weisi",
""
],
[
"Asyhari",
"Taufiq",
""
],
[
"Farsad",
"Nariman",
""
],
[
"Yilmaz",
"H. Birkan",
""
],
[
"Li",
"Bin",
""
],
[
"Eckford",
"Andrew",
""
],
[
"Chae",
"Chan-Byoung",
""
]
] |
new_dataset
| 0.997855 |
1507.06946
|
Sandip Roy Mr.
|
Rajesh Bose, Sandip Roy and Debabrata Sarddar
|
Mobile-Based Video Caching Architecture Based on Billboard Manager
|
8 pages, 1 figure, GridCom-2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video streaming services are very popular today. Increasingly, users can now
access multimedia applications and video playback wirelessly on their mobile
devices. However, a significant challenge remains in ensuring smooth and
uninterrupted transmission of almost any size of video file over a 3G network,
and as quickly as possible in order to optimize bandwidth consumption. In this
paper, we propose to position our Billboard Manager to provide an optimal
transmission rate to enable smooth video playback to a mobile device user
connected to a 3G network. Our work focuses on serving user requests by mobile
operators from cached resource managed by Billboard Manager, and transmitting
the video files from this pool. The aim is to reduce the load placed on
bandwidth resources of a mobile operator by routing away as much user requests
away from the internet for having to search a video and, subsequently, if
located, have it transferred back to the user.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 18:27:59 GMT"
}
] | 2015-07-27T00:00:00 |
[
[
"Bose",
"Rajesh",
""
],
[
"Roy",
"Sandip",
""
],
[
"Sarddar",
"Debabrata",
""
]
] |
new_dataset
| 0.999103 |
1507.06952
|
Luiz Capretz Dr.
|
Faheem Ahmed, Luiz Fernando Capretz
|
Framework for Version Control & Dependency Link of Components & Products
in a Software Product Line
| null |
Transactions on Computers, 3(6):1782-1787, 2004
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software product line deals with the assembly of products from existing core
assets commonly known as components and continuous growth in the core assets as
we proceed with production. This idea has emerged as vital in terms of software
development from component-based architecture. Since in software product line
one has to deal with number of products and components simultaneous therefore
there is a need to develop a strategy, which will help to store components and
products information in such a way that they can be traced easily for further
development. This storage strategy should reflect a relationship between
products and components so that product history with reference to components
can be traced and vise versa. In this paper we have presented a tree structure
based storage strategy for components and products in software product line.
This strategy will enable us to store the vital information about components
and products with a relationship of their composition and utilization. We
implemented this concept and simulated the software product line environment.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 18:40:32 GMT"
}
] | 2015-07-27T00:00:00 |
[
[
"Ahmed",
"Faheem",
""
],
[
"Capretz",
"Luiz Fernando",
""
]
] |
new_dataset
| 0.953949 |
1507.06368
|
Jos Wetzels
|
Jos Wetzels, Wouter Bokslag
|
Simple SIMON: FPGA implementations of the SIMON 64/128 Block Cipher
|
20 pages
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In this paper we will present various hardware architecture designs for
implementing the SIMON 64/128 block cipher as a cryptographic component
offering encryption, decryption and self-contained key-scheduling capabilities
and discuss the issues and design options we encountered and the tradeoffs we
made in implementing them. Finally, we will present the results of our hardware
architectures' implementation performances on the Xilinx Spartan-6 FPGA series.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2015 01:26:27 GMT"
}
] | 2015-07-24T00:00:00 |
[
[
"Wetzels",
"Jos",
""
],
[
"Bokslag",
"Wouter",
""
]
] |
new_dataset
| 0.997507 |
1507.06469
|
Rakhi Gupta Mrs
|
Rakhi Misuriya Gupta
|
MOBISPA: A Reference Framework for Mobile as a Personal Assistant
|
12 pages, 4 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile is taking center stage and becoming the device of preference for all
aspects of communication because of our increasingly on the go lifestyles. With
this the demands on mobile capability to execute increasingly complex
operations are also on the rise. However, despite improvements in device
computing power in the last couple of years a mobile device continues to have
limitations. Mobile driven everyday use cases are increasingly raising
expectations that rest on mobile technologies that are still evolving. A number
of fragmented approaches and solutions have been created that address various
requirements unique to mobility, however there is a lack of a single framework
that serves as a unifying reference for industry and solution architectures.
The paper addresses this concern through the specification of a comprehensive
reference framework for mobility that is generic and vendor neutral.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2015 12:45:34 GMT"
}
] | 2015-07-24T00:00:00 |
[
[
"Gupta",
"Rakhi Misuriya",
""
]
] |
new_dataset
| 0.999364 |
1409.8104
|
Shixin Luo
|
Shixin Luo, Jie Xu, Teng Joon Lim, and Rui Zhang
|
Capacity Region of MISO Broadcast Channel for Simultaneous Wireless
Information and Power Transfer
|
32 pages, 5 figures, submitted for possible journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies a multiple-input single-output (MISO) broadcast channel
(BC) featuring simultaneous wireless information and power transfer (SWIPT),
where a multi-antenna access point (AP) delivers both information and energy
via radio signals to multiple single-antenna receivers simultaneously, and each
receiver implements either information decoding (ID) or energy harvesting (EH).
In particular, pseudo-random sequences that are {\it a priori} known and
therefore can be cancelled at each ID receiver is used as the energy signals,
and the information-theoretically optimal dirty paper coding (DPC) is employed
for the information transmission. We characterize the capacity region for ID
receivers under given energy requirements for EH receivers, by solving a
sequence of weighted sum-rate (WSR) maximization (WSRMax) problems subject to a
maximum sum-power constraint for the AP, and a set of minimum harvested power
constraints for individual EH receivers. The problem corresponds to a new form
of WSRMax problem in MISO-BC with combined maximum and minimum linear transmit
covariance constraints (MaxLTCCs and MinLTCCs), which differs from the
celebrated capacity region characterization problem for MISO-BC under a set of
MaxLTCCs only and is challenging to solve. By extending the general BC-multiple
access channel (MAC) duality, which is only applicable to WSRMax problems with
MaxLTCCs, and applying the ellipsoid method, we propose an efficient algorithm
to solve this problem globally optimally. Furthermore, we also propose two
suboptimal algorithms with lower complexity by assuming that the information
and energy signals are designed separately. Finally, numerical results are
provided to validate our proposed algorithms.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 12:49:47 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Oct 2014 02:24:22 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Jan 2015 08:44:56 GMT"
},
{
"version": "v4",
"created": "Tue, 26 May 2015 05:40:08 GMT"
},
{
"version": "v5",
"created": "Wed, 22 Jul 2015 09:18:03 GMT"
}
] | 2015-07-23T00:00:00 |
[
[
"Luo",
"Shixin",
""
],
[
"Xu",
"Jie",
""
],
[
"Lim",
"Teng Joon",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.971752 |
1507.05964
|
Pavel Naumov
|
Pavel G. Naumov and Jia Tao
|
The Budget-Constrained Functional Dependency
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Armstrong's axioms of functional dependency form a well-known logical system
that captures properties of functional dependencies between sets of database
attributes. This article assumes that there are costs associated with
attributes and proposes an extension of Armstrong's system for reasoning about
budget-constrained functional dependencies in such a setting.
The main technical result of this article is the completeness theorem for the
proposed logical system. Although the proposed axioms are obtained by just
adding cost subscript to the original Armstrong's axioms, the proof of the
completeness for the proposed system is significantly more complicated than
that for the Armstrong's system.
|
[
{
"version": "v1",
"created": "Tue, 21 Jul 2015 20:00:40 GMT"
}
] | 2015-07-23T00:00:00 |
[
[
"Naumov",
"Pavel G.",
""
],
[
"Tao",
"Jia",
""
]
] |
new_dataset
| 0.996859 |
1507.05717
|
Cong Yao
|
Baoguang Shi and Xiang Bai and Cong Yao
|
An End-to-End Trainable Neural Network for Image-based Sequence
Recognition and Its Application to Scene Text Recognition
|
5 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image-based sequence recognition has been a long-standing research topic in
computer vision. In this paper, we investigate the problem of scene text
recognition, which is among the most important and challenging tasks in
image-based sequence recognition. A novel neural network architecture, which
integrates feature extraction, sequence modeling and transcription into a
unified framework, is proposed. Compared with previous systems for scene text
recognition, the proposed architecture possesses four distinctive properties:
(1) It is end-to-end trainable, in contrast to most of the existing algorithms
whose components are separately trained and tuned. (2) It naturally handles
sequences in arbitrary lengths, involving no character segmentation or
horizontal scale normalization. (3) It is not confined to any predefined
lexicon and achieves remarkable performances in both lexicon-free and
lexicon-based scene text recognition tasks. (4) It generates an effective yet
much smaller model, which is more practical for real-world application
scenarios. The experiments on standard benchmarks, including the IIIT-5K,
Street View Text and ICDAR datasets, demonstrate the superiority of the
proposed algorithm over the prior arts. Moreover, the proposed algorithm
performs well in the task of image-based music score recognition, which
evidently verifies the generality of it.
|
[
{
"version": "v1",
"created": "Tue, 21 Jul 2015 06:26:32 GMT"
}
] | 2015-07-22T00:00:00 |
[
[
"Shi",
"Baoguang",
""
],
[
"Bai",
"Xiang",
""
],
[
"Yao",
"Cong",
""
]
] |
new_dataset
| 0.998568 |
1507.05732
|
Shudi Yang
|
Shudi Yang and Zhang-An Yao and Chang-An Zhao
|
Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes have been an interesting topic in both theory and practice for
many years. In this paper, for a prime $p$, we determine the explicit complete
weight enumerators of a family of linear codes over $\mathbb{F}_p$ with
defining set related to cyclotomy. These codes may have applications in
cryptography and secret sharing schemes.
|
[
{
"version": "v1",
"created": "Tue, 21 Jul 2015 07:54:58 GMT"
}
] | 2015-07-22T00:00:00 |
[
[
"Yang",
"Shudi",
""
],
[
"Yao",
"Zhang-An",
""
],
[
"Zhao",
"Chang-An",
""
]
] |
new_dataset
| 0.999631 |
1501.00102
|
Natalia Neverova
|
Natalia Neverova and Christian Wolf and Graham W. Taylor and Florian
Nebout
|
ModDrop: adaptive multi-modal gesture recognition
|
14 pages, 7 figures
| null | null | null |
cs.CV cs.HC cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method for gesture detection and localisation based on
multi-scale and multi-modal deep learning. Each visual modality captures
spatial information at a particular spatial scale (such as motion of the upper
body or a hand), and the whole system operates at three temporal scales. Key to
our technique is a training strategy which exploits: i) careful initialization
of individual modalities; and ii) gradual fusion involving random dropping of
separate channels (dubbed ModDrop) for learning cross-modality correlations
while preserving uniqueness of each modality-specific representation. We
present experiments on the ChaLearn 2014 Looking at People Challenge gesture
recognition track, in which we placed first out of 17 teams. Fusing multiple
modalities at several spatial and temporal scales leads to a significant
increase in recognition rates, allowing the model to compensate for errors of
the individual classifiers as well as noise in the separate channels.
Futhermore, the proposed ModDrop training technique ensures robustness of the
classifier to missing signals in one or several channels to produce meaningful
predictions from any number of available modalities. In addition, we
demonstrate the applicability of the proposed fusion scheme to modalities of
arbitrary nature by experiments on the same dataset augmented with audio.
|
[
{
"version": "v1",
"created": "Wed, 31 Dec 2014 09:55:43 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Jun 2015 14:46:33 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Neverova",
"Natalia",
""
],
[
"Wolf",
"Christian",
""
],
[
"Taylor",
"Graham W.",
""
],
[
"Nebout",
"Florian",
""
]
] |
new_dataset
| 0.995386 |
1504.03824
|
Yawei Hu
|
Yawei Hu, Mingjun Xiao, Liusheng Huang, Ruhong Cheng and Hualin Mao
|
Nearly Optimal Probabilistic Coverage for Roadside Advertisement
Dissemination in Urban VANETs
|
This paper has been withdrawn by the author due to a crucial error in
the proof of theorem 2
| null | null | null |
cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advertisement disseminations based on Roadside Access Points (RAPs) in
vehicular ad-hoc networks (VANETs) attract lots of attentions and have a
promising prospect. In this paper, we focus on a roadside advertisement
dissemination, including three basic elements: RAP Service Provider (RSP),
mobile vehicles and shops. The RSP has deployed many RAPs at different
locations in a city. A shop wants to rent some RAPs, which can disseminate
advertisements to vehicles with some probabilites. Then, it tries to select the
minimal number of RAPs to finish the advertisement dissemination, in order to
save the expenses. Meanwhile, the selected RAPs need to ensure that each
vehicle's probability of receiving advertisement successfully is not less than
a threshold. We prove that this RAP selection problem is NP-hard. In order to
solve this problem, we propose a greedy approximation algorithm, and give the
corresponding approximation ratio. Further, we conduct extensive simulations on
real world data sets to prove the good performance of this algorithm.
|
[
{
"version": "v1",
"created": "Wed, 15 Apr 2015 08:56:59 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jul 2015 03:11:13 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Hu",
"Yawei",
""
],
[
"Xiao",
"Mingjun",
""
],
[
"Huang",
"Liusheng",
""
],
[
"Cheng",
"Ruhong",
""
],
[
"Mao",
"Hualin",
""
]
] |
new_dataset
| 0.998573 |
1505.06326
|
Shudi Yang
|
Shudi Yang and Zheng-An Yao
|
Complete Weight Enumerators of Some Linear Codes
|
11 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes have been an interesting topic in both theory and practice for
many years. In this paper, for an odd prime $p$, we determine the explicit
complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$
and they may have applications in cryptography and secret sharing schemes.
Moreover, some examples are included to illustrate our results.
|
[
{
"version": "v1",
"created": "Sat, 23 May 2015 13:27:58 GMT"
},
{
"version": "v2",
"created": "Sat, 18 Jul 2015 01:55:33 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Yang",
"Shudi",
""
],
[
"Yao",
"Zheng-An",
""
]
] |
new_dataset
| 0.998808 |
1507.03274
|
Yeounoh Chung
|
Yeounoh Chung and Erfan Zamanian
|
Using RDMA for Lock Management
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we aim to evaluate different Distributed Lock Management
service designs with Remote Direct Memory Access (RDMA). In specific, we
implement and evaluate the centralized and the RDMA-enabled lock manager
designs for fast network settings. Experimental results confirms a couple of
hypotheses. First, in the traditional centralized lock manager design, CPU is
the bottleneck and bypassing CPU on client-to-server communication using RDMA
results in better lock service perofrmance. Second, different lock manager
designs with RDMA in consideration result in even better performance; we need
to re-design lock management system for RDMA and fast networks.
|
[
{
"version": "v1",
"created": "Sun, 12 Jul 2015 21:28:34 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jul 2015 19:02:31 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Chung",
"Yeounoh",
""
],
[
"Zamanian",
"Erfan",
""
]
] |
new_dataset
| 0.992424 |
1507.04614
|
Olaf Hartig
|
Olaf Hartig and Jorge P\'erez
|
LDQL: A Query Language for the Web of Linked Data (Extended Version)
|
39 pages, Extended version of a paper published in ISWC 2015
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Web of Linked Data is composed of tons of RDF documents interlinked to
each other forming a huge repository of distributed semantic data. Effectively
querying this distributed data source is an important open problem in the
Semantic Web area. In this paper, we propose LDQL, a declarative language to
query Linked Data on the Web. One of the novelties of LDQL is that it expresses
separately (i) patterns that describe the expected query result, and (ii) Web
navigation paths that select the data sources to be used for computing the
result. We present a formal syntax and semantics, prove equivalence rules, and
study the expressiveness of the language. In particular, we show that LDQL is
strictly more expressive than the query formalisms that have been proposed
previously for Linked Data on the Web. The high expressiveness allows LDQL to
define queries for which a complete execution is not computationally feasible
over the Web. We formally study this issue and provide a syntactic sufficient
condition to avoid this problem; queries satisfying this condition are ensured
to have a procedure to be effectively evaluated over the Web of Linked Data.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2015 15:19:03 GMT"
},
{
"version": "v2",
"created": "Sun, 19 Jul 2015 09:14:16 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Hartig",
"Olaf",
""
],
[
"Pérez",
"Jorge",
""
]
] |
new_dataset
| 0.998313 |
1507.05215
|
Fan Du
|
Fan Du, Joshua Brul\'e, Peter Enns, Varun Manjunatha, Yoav Segev
|
MetroViz: Visual Analysis of Public Transportation Data
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Understanding the quality and usage of public transportation resources is
important for schedule optimization and resource allocation. Ridership and
adherence are the two main dimensions for evaluating the quality of service.
Using Automatic Vehicle Location (AVL), Automatic Passenger Count (APC), and
Global Positioning System (GPS) data, ridership data and adherence data of
public transportation can be collected. In this paper, we discuss the
development of a visualization tool for exploring public transportation data.
We introduce "map view" and "route view" to help users locate stops in the
context of geography and route information. To visualize ridership and
adherence information over several years, we introduce "calendar view" - a
miniaturized calendar that provides an overview of data where users can
interactively select specific days to explore individual trips and stops ("trip
subview" and "stop subview"). MetroViz was evaluated via a series of usability
tests that included researchers from the Center for Advanced Transportation
Technology (CATT) and students from the University of Maryland - College Park
in which test participants used the tool to explore three years of bus transit
data from Blacksburg, Virginia.
|
[
{
"version": "v1",
"created": "Sat, 18 Jul 2015 18:38:42 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Du",
"Fan",
""
],
[
"Brulé",
"Joshua",
""
],
[
"Enns",
"Peter",
""
],
[
"Manjunatha",
"Varun",
""
],
[
"Segev",
"Yoav",
""
]
] |
new_dataset
| 0.986738 |
1507.05243
|
Jayati Ghosh Dastidar
|
Jonathan Fidelis Paul, Dibyabiva Seth, Cijo Paul, Jayati Ghosh
Dastidar
|
Hand Gesture Recognition Library
| null |
International Journal of Science and Applied Information
Technology, Volume 3, No.2, March - April 2014
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have presented a hand gesture recognition library. Various
functions include detecting cluster count, cluster orientation, finger pointing
direction, etc. To use these functions first the input image needs to be
processed into a logical array for which a function has been developed. The
library has been developed keeping flexibility in mind and thus provides
application developers a wide range of options to develop custom gestures.
|
[
{
"version": "v1",
"created": "Sun, 19 Jul 2015 03:10:28 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Paul",
"Jonathan Fidelis",
""
],
[
"Seth",
"Dibyabiva",
""
],
[
"Paul",
"Cijo",
""
],
[
"Dastidar",
"Jayati Ghosh",
""
]
] |
new_dataset
| 0.999232 |
1507.05245
|
Gautam Thakur
|
Gautam S. Thakur, Budhendra L. Bhaduri, Jesse O. Piburn, Kelly M.
Sims, Robert N. Stewart, Marie L. Urban
|
PlanetSense: A Real-time Streaming and Spatio-temporal Analytics
Platform for Gathering Geo-spatial Intelligence from Open Source Data
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geospatial intelligence has traditionally relied on the use of archived and
unvarying data for planning and exploration purposes. In consequence, the tools
and methods that are architected to provide insight and generate projections
only rely on such datasets. Albeit, if this approach has proven effective in
several cases, such as land use identification and route mapping, it has
severely restricted the ability of researchers to inculcate current information
in their work. This approach is inadequate in scenarios requiring real-time
information to act and to adjust in ever changing dynamic environments, such as
evacuation and rescue missions. In this work, we propose PlanetSense, a
platform for geospatial intelligence that is built to harness the existing
power of archived data and add to that, the dynamics of real-time streams,
seamlessly integrated with sophisticated data mining algorithms and analytics
tools for generating operational intelligence on the fly. The platform has four
main components - i. GeoData Cloud - a data architecture for storing and
managing disparate datasets; ii. Mechanism to harvest real-time streaming data;
iii. Data analytics framework; iv. Presentation and visualization through web
interface and RESTful services. Using two case studies, we underpin the
necessity of our platform in modeling ambient population and building occupancy
at scale.
|
[
{
"version": "v1",
"created": "Sun, 19 Jul 2015 03:19:03 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Thakur",
"Gautam S.",
""
],
[
"Bhaduri",
"Budhendra L.",
""
],
[
"Piburn",
"Jesse O.",
""
],
[
"Sims",
"Kelly M.",
""
],
[
"Stewart",
"Robert N.",
""
],
[
"Urban",
"Marie L.",
""
]
] |
new_dataset
| 0.976393 |
1507.05408
|
Tobias Kuhn
|
Juan M. Banda and Tobias Kuhn and Nigam H. Shah and Michel Dumontier
|
Provenance-Centered Dataset of Drug-Drug Interactions
|
In Proceedings of the 14th International Semantic Web Conference
(ISWC) 2015
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the years several studies have demonstrated the ability to identify
potential drug-drug interactions via data mining from the literature (MEDLINE),
electronic health records, public databases (Drugbank), etc. While each one of
these approaches is properly statistically validated, they do not take into
consideration the overlap between them as one of their decision making
variables. In this paper we present LInked Drug-Drug Interactions (LIDDI), a
public nanopublication-based RDF dataset with trusty URIs that encompasses some
of the most cited prediction methods and sources to provide researchers a
resource for leveraging the work of others into their prediction methods. As
one of the main issues to overcome the usage of external resources is their
mappings between drug names and identifiers used, we also provide the set of
mappings we curated to be able to compare the multiple sources we aggregate in
our dataset.
|
[
{
"version": "v1",
"created": "Mon, 20 Jul 2015 07:53:56 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Banda",
"Juan M.",
""
],
[
"Kuhn",
"Tobias",
""
],
[
"Shah",
"Nigam H.",
""
],
[
"Dumontier",
"Michel",
""
]
] |
new_dataset
| 0.996227 |
1507.05472
|
Marco Netto
|
Kiran Mantripragada, Leonardo P. Tizzei, Alecio P. D. Binotto, Marco
A. S. Netto
|
An SLA-based Advisor for Placement of HPC Jobs on Hybrid Clouds
|
16 pages, 7 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several scientific and industry applications require High Performance
Computing (HPC) resources to process and/or simulate complex models. Not long
ago, companies, research institutes, and universities used to acquire and
maintain on-premise computer clusters; but, recently, cloud computing has
emerged as an alternative for a subset of HPC applications. This poses a
challenge to end-users, who have to decide where to run their jobs: on local
clusters or burst to a remote cloud service provider. While current research on
HPC cloud has focused on comparing performance of on-premise clusters against
cloud resources, we build on top of existing efforts and introduce an advisory
service to help users make this decision considering the trade-offs of resource
costs, performance, and availability on hybrid clouds. We evaluated our service
using a real test-bed with a seismic processing application based on Full
Waveform Inversion; a technique used by geophysicists in the oil & gas industry
and earthquake prediction. We also discuss how the advisor can be used for
other applications and highlight the main lessons learned constructing this
service to reduce costs and turnaround times.
|
[
{
"version": "v1",
"created": "Mon, 20 Jul 2015 12:41:32 GMT"
}
] | 2015-07-21T00:00:00 |
[
[
"Mantripragada",
"Kiran",
""
],
[
"Tizzei",
"Leonardo P.",
""
],
[
"Binotto",
"Alecio P. D.",
""
],
[
"Netto",
"Marco A. S.",
""
]
] |
new_dataset
| 0.989015 |
1406.5581
|
Anh Nguyen
|
Anh Nguyen, Amy Banic
|
3DTouch: A wearable 3D input device with an optical sensor and a 9-DOF
inertial measurement unit
|
8 pages, 7 figures
| null | null | null |
cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present 3DTouch, a novel 3D wearable input device worn on the fingertip
for 3D manipulation tasks. 3DTouch is designed to fill the missing gap of a 3D
input device that is self-contained, mobile, and universally working across
various 3D platforms. This paper presents a low-cost solution to designing and
implementing such a device. Our approach relies on relative positioning
technique using an optical laser sensor and a 9-DOF inertial measurement unit.
3DTouch is self-contained, and designed to universally work on various 3D
platforms. The device employs touch input for the benefits of passive haptic
feedback, and movement stability. On the other hand, with touch interaction,
3DTouch is conceptually less fatiguing to use over many hours than 3D spatial
input devices. We propose a set of 3D interaction techniques including
selection, translation, and rotation using 3DTouch. An evaluation also
demonstrates the device's tracking accuracy of 1.10 mm and 2.33 degrees for
subtle touch interaction in 3D space. Modular solutions like 3DTouch opens up a
whole new design space for interaction techniques to further develop on.
|
[
{
"version": "v1",
"created": "Sat, 21 Jun 2014 06:32:35 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jul 2015 07:17:44 GMT"
}
] | 2015-07-20T00:00:00 |
[
[
"Nguyen",
"Anh",
""
],
[
"Banic",
"Amy",
""
]
] |
new_dataset
| 0.999381 |
1507.03664
|
Jos\'e Mart\'in Castro-Manzano
|
Jos\'e Mart\'in Castro-Manzano, Ver\'onica Reyes-Meza, Jorge
Medina-Delgadillo
|
{dasasap}, an App for Syllogisms
|
Proceedings of the Fourth International Conference on Tools for
Teaching Logic (TTL2015), Rennes, France, June 9-12, 2015. Editors: M.
Antonia Huertas, Jo\~ao Marcos, Mar\'ia Manzano, Sophie Pinchinat,
Fran\c{c}ois Schwarzentruber
| null | null | null |
cs.CY cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
The main goal of this contribution is to introduce a cross-platform
application to learn-teach syllogistic. We call this application
\textit{dasasap} for \textit{develop all syllogisms as soon as possible}. To
introduce this application we show the logical foundations for the game with a
system we call $\mathcal{L}_\square$, and its interface developed with
LiveCode.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2015 00:47:59 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jul 2015 01:22:52 GMT"
}
] | 2015-07-20T00:00:00 |
[
[
"Castro-Manzano",
"José Martín",
""
],
[
"Reyes-Meza",
"Verónica",
""
],
[
"Medina-Delgadillo",
"Jorge",
""
]
] |
new_dataset
| 0.999277 |
1507.04314
|
Imrul Kayes
|
Imrul Kayes, Nicolas Kourtellis, Daniele Quercia, Adriana Iamnitchi,
Francesco Bonchi
|
The Social World of Content Abusers in Community Question Answering
|
Published in the proceedings of the 24th International World Wide Web
Conference (WWW 2015)
| null |
10.1145/2736277.2741674
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Community-based question answering platforms can be rich sources of
information on a variety of specialized topics, from finance to cooking. The
usefulness of such platforms depends heavily on user contributions (questions
and answers), but also on respecting the community rules. As a crowd-sourced
service, such platforms rely on their users for monitoring and flagging content
that violates community rules.
Common wisdom is to eliminate the users who receive many flags. Our analysis
of a year of traces from a mature Q&A site shows that the number of flags does
not tell the full story: on one hand, users with many flags may still
contribute positively to the community. On the other hand, users who never get
flagged are found to violate community rules and get their accounts suspended.
This analysis, however, also shows that abusive users are betrayed by their
network properties: we find strong evidence of homophilous behavior and use
this finding to detect abusive users who go under the community radar. Based on
our empirical observations, we build a classifier that is able to detect
abusive users with an accuracy as high as 83%.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 18:20:23 GMT"
}
] | 2015-07-19T00:00:00 |
[
[
"Kayes",
"Imrul",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Iamnitchi",
"Adriana",
""
],
[
"Bonchi",
"Francesco",
""
]
] |
new_dataset
| 0.989244 |
1406.0650
|
Fernando Hernando
|
Carlos Galindo, Fernando Hernando and Diego Ruano
|
New Quantum Codes from Evaluation and Matrix-Product Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stabilizer codes obtained via CSS code construction and Steane's enlargement
of subfield-subcodes and matrix-product codes coming from generalized
Reed-Muller, hyperbolic and affine variety codes are studied. Stabilizer codes
with good quantum parameters are supplied, in particular, some binary codes of
lengths 127 and 128 improve the parameters of the codes in
http://www.codetables.de. Moreover, non-binary codes are presented either with
parameters better than or equal to the quantum codes obtained from BCH codes by
La Guardia or with lengths that can not be reached by them.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2014 10:05:48 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Jun 2014 10:59:19 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jul 2015 15:15:51 GMT"
}
] | 2015-07-17T00:00:00 |
[
[
"Galindo",
"Carlos",
""
],
[
"Hernando",
"Fernando",
""
],
[
"Ruano",
"Diego",
""
]
] |
new_dataset
| 0.988167 |
1503.08847
|
William Gasarch
|
Richard Beigel and William Gasarch
|
On the Sizes of DPDAs, PDAs, LBAs
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are languages A such that there is a Pushdown Automata (PDA) that
recognizes A which is much smaller than any Deterministic Pushdown Automata
(DPDA) that recognizes A. There are languages A such that there is a Linear
Bounded Automata (Linear Space Turing Machine, henceforth LBA) that recognizes
A which is much smaller than ny PDA that recognizes A. There are languages A
such that both A and compliment(A) are recognizable by a PDA, but the PDA for A
is much smaller than the PDA for compliment(A). There are languages A1, A2 such
that A1,A2,A1 INTERSECT A_2 are recognizable by a PDA, but the PDA for A1 and
A2 are much smaller than the PDA for A1 INTERSECT A2. We investigate these
phenomenon and show that, in all these cases, the size difference is captured
by a function whose Turing degree is on the second level of the arithmetic
hierarchy.
Our theorems lead to infinitely-often results. For example: for infinitely
many $n$ there exists a language An recognized by a DPDA such that there is a
small PDA for An, but any DPDA for An is large. We look at cases where we can
get almost-all results, though with much smaller size differences.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 20:38:23 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Apr 2015 19:54:43 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jul 2015 00:29:56 GMT"
}
] | 2015-07-17T00:00:00 |
[
[
"Beigel",
"Richard",
""
],
[
"Gasarch",
"William",
""
]
] |
new_dataset
| 0.999791 |
1507.04417
|
Bishnu Lamichhane
|
Bishnu P. Lamichhane
|
A quadrilateral 'mini' finite element for the Stokes problem using a
single bubble function
|
11 pages, 2 figures
| null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a quadrilateral 'mini' finite element for approximating the
solution of Stokes equations using a quadrilateral mesh. We use the standard
bilinear finite element space enriched with element-wise defined bubble
functions for the velocity and the standard bilinear finite element space for
the pressure space. With a simple modification of the standard bubble function
we show that a single bubble function is sufficient to ensure the inf-sup
condition. We have thus improved an earlier result on the quadrilateral 'mini'
element, where more than one bubble function are used to get the stability.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2015 00:16:02 GMT"
}
] | 2015-07-17T00:00:00 |
[
[
"Lamichhane",
"Bishnu P.",
""
]
] |
new_dataset
| 0.993869 |
1507.04578
|
David Aspinall
|
Bela Gor and David Aspinall
|
Accessible Banking: Experiences and Future Directions
|
3 pages, presented at Workshop on Inclusive Privacy and Security
(WIPS): Privacy and Security for Everyone, Anytime, Anywhere, held as part of
Symposium on Usable Privacy and Security (SOUPS) 2015, July 22-24, 2015,
Ottawa, Canada
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is a short position paper drawing on experience working with the UK
banking industry and their disabled and ageing customers in the Business
Disability Forum, a UK non-profit member organisation funded by a large body of
UK private and public sector businesses. We describe some commonly reported
problems of disabled customers who use modern banking technologies, relating
them to UK law and best practice. We describe some of the recent banking
industry innovations and the hope they may offer for improved inclusive and
accessible multi-channel banking.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2015 13:55:14 GMT"
}
] | 2015-07-17T00:00:00 |
[
[
"Gor",
"Bela",
""
],
[
"Aspinall",
"David",
""
]
] |
new_dataset
| 0.999141 |
0904.3741
|
David Eppstein
|
David Eppstein and Emma S. Spiro
|
The h-Index of a Graph and its Application to Dynamic Subgraph
Statistics
|
To appear at Algorithms and Data Structures Symposium, Banff, Canada,
August 2009. 18 pages, 4 figures. Includes six pages of appendices that will
not be included in the conference proceedings version
|
J. Graph Algorithms & Applications 16(2): 543-567, 2012
|
10.7155/jgaa.00273
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a data structure that maintains the number of triangles in a
dynamic undirected graph, subject to insertions and deletions of edges and of
degree-zero vertices. More generally it can be used to maintain the number of
copies of each possible three-vertex subgraph in time O(h) per update, where h
is the h-index of the graph, the maximum number such that the graph contains
$h$ vertices of degree at least h. We also show how to maintain the h-index
itself, and a collection of h high-degree vertices in the graph, in constant
time per update. Our data structure has applications in social network analysis
using the exponential random graph model (ERGM); its bound of O(h) time per
edge is never worse than the Theta(sqrt m) time per edge necessary to list all
triangles in a static graph, and is strictly better for graphs obeying a power
law degree distribution. In order to better understand the behavior of the
h-index statistic and its implications for the performance of our algorithms,
we also study the behavior of the h-index on a set of 136 real-world networks.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2009 18:37:36 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Spiro",
"Emma S.",
""
]
] |
new_dataset
| 0.992281 |
1009.0045
|
David Eppstein
|
David Eppstein, Maarten L\"offler, Elena Mumford, Martin N\"ollenburg
|
Optimal 3D Angular Resolution for Low-Degree Graphs
|
18 pages, 10 figures. Extended version of paper to appear in Proc.
18th Int. Symp. Graph Drawing, Konstanz, Germany, 2010
|
J. Graph Algorithms & Applications 17(3): 173-200, 2013
|
10.7155/jgaa.00290
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that every graph of maximum degree three can be drawn in three
dimensions with at most two bends per edge, and with 120-degree angles between
any two edge segments meeting at a vertex or a bend. We show that every graph
of maximum degree four can be drawn in three dimensions with at most three
bends per edge, and with 109.5-degree angles, i.e., the angular resolution of
the diamond lattice, between any two edge segments meeting at a vertex or bend.
|
[
{
"version": "v1",
"created": "Tue, 31 Aug 2010 22:50:32 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Löffler",
"Maarten",
""
],
[
"Mumford",
"Elena",
""
],
[
"Nöllenburg",
"Martin",
""
]
] |
new_dataset
| 0.997051 |
1308.0403
|
Zhanpeng Cheng
|
Michael J. Bannister and Zhanpeng Cheng and William E. Devanny and
David Eppstein
|
Superpatterns and Universal Point Sets
|
GD 2013 special issue of JGAA
|
J. Graph Algorithms & Applications 18(2): 177-209, 2014
|
10.7155/jgaa.00318
| null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An old open problem in graph drawing asks for the size of a universal point
set, a set of points that can be used as vertices for straight-line drawings of
all n-vertex planar graphs. We connect this problem to the theory of
permutation patterns, where another open problem concerns the size of
superpatterns, permutations that contain all patterns of a given size. We
generalize superpatterns to classes of permutations determined by forbidden
patterns, and we construct superpatterns of size n^2/4 + Theta(n) for the
213-avoiding permutations, half the size of known superpatterns for
unconstrained permutations. We use our superpatterns to construct universal
point sets of size n^2/4 - Theta(n), smaller than the previous bound by a 9/16
factor. We prove that every proper subclass of the 213-avoiding permutations
has superpatterns of size O(n log^O(1) n), which we use to prove that the
planar graphs of bounded pathwidth have near-linear universal point sets.
|
[
{
"version": "v1",
"created": "Fri, 2 Aug 2013 04:37:23 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Apr 2014 00:12:29 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Bannister",
"Michael J.",
""
],
[
"Cheng",
"Zhanpeng",
""
],
[
"Devanny",
"William E.",
""
],
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.9996 |
1410.5326
|
Linglong Dai
|
Shuangfeng Han, Chih-Lin I, Linglong Dai, Qi Sun, and Zhikun Xu
|
Full Duplex Networking: Mission Impossible?
|
This paper has been withdrawn by the author due to there are some
errors in this paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile traffic is projected to increase 1000 times from 2010 to 2020. This
poses significant challenges on the 5th generation (5G) wireless communication
system design, including network structure, air interface, key transmission
schemes, multiple access, and duplexing schemes. In this paper, full duplex
networking issues are discussed, aiming to provide some insights on the design
and possible future deployment for 5G. Particularly, the interference scenarios
in full duplex are analyzed, followed by discussions on several candidate
interference mitigation approaches, interference proof frame structures,
transceiver structures for channel reciprocity recovery, and super full duplex
base station where each sector operates in time division duplex (TDD) mode. The
extension of TDD and frequency division duplex (FDD) to full duplex is also
examined. It is anticipated that with future standardization and deployment of
full duplex systems, TDD and FDD will be harmoniously integrated, supporting
all the existing half duplex mobile phones efficiently, and leading to a
substantially enhanced 5G system performance.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2014 15:49:58 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jul 2015 10:01:04 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Han",
"Shuangfeng",
""
],
[
"I",
"Chih-Lin",
""
],
[
"Dai",
"Linglong",
""
],
[
"Sun",
"Qi",
""
],
[
"Xu",
"Zhikun",
""
]
] |
new_dataset
| 0.99538 |
1507.04086
|
Vinit Kumar
|
Vinit Kumar and Ajay Agarwal
|
HT-Ring Paxos: Theory of High Throughput State-Machine Replication for
Clustered Data Centers
|
18 pages. arXiv admin note: substantial text overlap with
arXiv:1407.1237
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implementations of state-machine replication (SMR) prevalently use the
variants of Paxos. Some of the recent variants of Paxos like, Ring Paxos,
Multi-Ring Paxos, S-Paxos and HT-Paxos achieve significantly high throughput.
However, to meet the growing demand of high throughput, we are proposing
HT-Ring Paxos, a variant of Paxos that is basically derived from the classical
Paxos. Moreover, it also adopts some fundamental concepts of Ring Paxos,
S-Paxos and HT-Paxos for increasing throughput. Furthermore, HT-Ring Paxos is
best suitable for clustered data centers and achieves comparatively high
throughput among all variants of Paxos. However, similar to Ring Paxos, latency
of the HT-Ring Paxos is quite high as compared with other variants of Paxos.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 05:17:50 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Kumar",
"Vinit",
""
],
[
"Agarwal",
"Ajay",
""
]
] |
new_dataset
| 0.998621 |
1507.04180
|
S\"oren Auer
|
Ali Ismayilov and Dimitris Kontokostas and S\"oren Auer and Jens
Lehmann and Sebastian Hellmann
|
Wikidata through the Eyes of DBpedia
|
8 pages
| null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
DBpedia is one of the first and most prominent nodes of the Linked Open Data
cloud. It provides structured data for more than 100 Wikipedia language
editions as well as Wikimedia Commons, has a mature ontology and a stable and
thorough Linked Data publishing lifecycle. Wikidata, on the other hand, has
recently emerged as a user curated source for structured information which is
included in Wikipedia. In this paper, we present how Wikidata is incorporated
in the DBpedia ecosystem. Enriching DBpedia with structured information from
Wikidata provides added value for a number of usage scenarios. We outline those
scenarios and describe the structure and conversion process of the
DBpediaWikidata dataset.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 11:59:07 GMT"
}
] | 2015-07-16T00:00:00 |
[
[
"Ismayilov",
"Ali",
""
],
[
"Kontokostas",
"Dimitris",
""
],
[
"Auer",
"Sören",
""
],
[
"Lehmann",
"Jens",
""
],
[
"Hellmann",
"Sebastian",
""
]
] |
new_dataset
| 0.999286 |
1408.4002
|
Benjamin Eltzner
|
Benjamin Eltzner, Carina Wollnik, Carsten Gottschlich, Stephan
Huckemann, Florian Rehfeldt
|
The Filament Sensor for Near Real-Time Detection of Cytoskeletal Fiber
Structures
|
32 pages, 21 figures
|
PLoS ONE 10(5): e0126346, May 2015
|
10.1371/journal.pone.0126346
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A reliable extraction of filament data from microscopic images is of high
interest in the analysis of acto-myosin structures as early morphological
markers in mechanically guided differentiation of human mesenchymal stem cells
and the understanding of the underlying fiber arrangement processes. In this
paper, we propose the filament sensor (FS), a fast and robust processing
sequence which detects and records location, orientation, length and width for
each single filament of an image, and thus allows for the above described
analysis. The extraction of these features has previously not been possible
with existing methods. We evaluate the performance of the proposed FS in terms
of accuracy and speed in comparison to three existing methods with respect to
their limited output. Further, we provide a benchmark dataset of real cell
images along with filaments manually marked by a human expert as well as
simulated benchmark images. The FS clearly outperforms existing methods in
terms of computational runtime and filament extraction accuracy. The
implementation of the FS and the benchmark database are available as open
source.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 13:06:03 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Jul 2015 13:19:42 GMT"
},
{
"version": "v3",
"created": "Tue, 14 Jul 2015 08:40:32 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Eltzner",
"Benjamin",
""
],
[
"Wollnik",
"Carina",
""
],
[
"Gottschlich",
"Carsten",
""
],
[
"Huckemann",
"Stephan",
""
],
[
"Rehfeldt",
"Florian",
""
]
] |
new_dataset
| 0.998523 |
1507.03577
|
Jinseong Jeon
|
Jinseong Jeon and Xiaokang Qiu and Jeffrey S. Foster and Armando
Solar-Lezama
|
JSKETCH: Sketching for Java
|
This research was supported in part by NSF CCF-1139021, CCF- 1139056,
CCF-1161775, and the partnership between UMIACS and the Laboratory for
Telecommunication Sciences
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sketch-based synthesis, epitomized by the SKETCH tool, lets developers
synthesize software starting from a partial program, also called a sketch or
template. This paper presents JSKETCH, a tool that brings sketch-based
synthesis to Java. JSKETCH's input is a partial Java program that may include
holes, which are unknown constants, expression generators, which range over
sets of expressions, and class generators, which are partial classes. JSKETCH
then translates the synthesis problem into a SKETCH problem; this translation
is complex because SKETCH is not object-oriented. Finally, JSKETCH synthesizes
an executable Java program by interpreting the output of SKETCH.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 05:02:53 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Jeon",
"Jinseong",
""
],
[
"Qiu",
"Xiaokang",
""
],
[
"Foster",
"Jeffrey S.",
""
],
[
"Solar-Lezama",
"Armando",
""
]
] |
new_dataset
| 0.999243 |
1507.03675
|
Marek Materzok
|
Marek Materzok
|
Easyprove: a tool for teaching precise reasoning
|
Proceedings of the Fourth International Conference on Tools for
Teaching Logic (TTL2015), Rennes, France, June 9-12, 2015. Editors: M.
Antonia Huertas, Jo\~ao Marcos, Mar\'ia Manzano, Sophie Pinchinat,
Fran\c{c}ois Schwarzentruber
| null | null | null |
cs.CY cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Teaching precise mathematical reasoning can be very hard. It is very easy for
a student to make a subtle mistake in a proof which invalidates it, but it is
often hard for the teacher to pinpoint and explain the problem in the (often
chaotically written) student's proof. We present Easyprove, an interactive
proof assistant aimed at first year computer science students and high school
students, intended as a supplementary tool for teaching logical reasoning. The
system is a Web application with a natural, mouse-oriented user interface.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2015 00:51:45 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Materzok",
"Marek",
""
]
] |
new_dataset
| 0.950617 |
1507.03691
|
Fang Chen
|
Fang Chen, Bo Yang, Qiaoni Han, Cailian Chen and Xinping Guan
|
Dynamic Sleep Control in Green Relay-Assisted Networks for Energy Saving
and QoS Improving
|
7 papers, 4 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the relay station (RS) sleep control mechanism targeting on reducing
energy consumption while improving users' quality of service (QoS) in green
relay-assisted cellular networks, where the base station (BS) is powered by
grid power and the RSs are powered by renewable energy. By adopting green RSs,
the grid power consumption of the BS is greatly reduced. But due to the
uncertainty and stochastic characteristics of the renewable energy, power
supply for RSs is not always sufficient. Thus the harvested energy needs to be
scheduled appropriately to cater to the dynamic traffic so as to minimize the
energy saving in the long term. An optimization problem is formulated to find
the optimal sleep ratio of RSs to match the time variation of energy harvesting
and traffic arrival. To fully use the renewable energy, green-RS-first
principle is adopted in the user association process. The optimal RS sleeping
policy is obtained through dynamic programming (DP) approach, which divides the
original optimization problem into per-stage subproblems. A reduced DP
algorithm and a greedy algorithm are further proposed to greatly reduce the
computation complexity. By simulations, the reduced DP algorithm outperforms
the greedy algorithm in achieving satisfactory energy saving and QoS
performance.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2015 01:19:00 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Chen",
"Fang",
""
],
[
"Yang",
"Bo",
""
],
[
"Han",
"Qiaoni",
""
],
[
"Chen",
"Cailian",
""
],
[
"Guan",
"Xinping",
""
]
] |
new_dataset
| 0.99917 |
1507.03751
|
Manfred Harringer
|
Manfred Harringer
|
Closed Curves and Elementary Visual Object Identification
|
13 pages, 10 figures
| null | null | null |
cs.CV cs.LG q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For two closed curves on a plane (discrete version) and local criteria for
similarity of points on the curves one gets a potential, which describes the
similarity between curve points. This is the base for a global similarity
measure of closed curves (Fr\'echet distance). I use borderlines of handwritten
digits to demonstrate an area of application. I imagine, measuring the
similarity of closed curves is an essential and elementary task performed by a
visual system. This approach to similarity measures may be used by visual
systems.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2015 07:57:39 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Harringer",
"Manfred",
""
]
] |
new_dataset
| 0.995756 |
1507.03969
|
Zhouyue Pi
|
Zhouyue Pi, Junil Choi, and Robert Heath Jr
|
Millimeter-wave Gbps Broadband Evolution towards 5G: Fixed Access and
Backhaul
|
6 pages, 4 figures, 2 tables, submitted to IEEE Communications
Magazine
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As wireless communication evolves towards 5G, both fixed broadband and mobile
broadband will play a crucial part in providing the Gbps infrastructure for a
connected society. This paper proposes a Millimeter-wave Gbps Broadband (MGB)
system as the solution to two critical problems in this evolution: last-mile
access for fixed broadband and small cell backhaul for mobile broadband. The
key idea is to use spectrum that is already available in the millimeter wave
bands for fixed wireless access with optimized dynamic beamforming and massive
MIMO infrastructure to achieve high capacity with wide area coverage. This
paper explains the MGB concept and describes potential array architectures for
realizing the system. Simulations demonstrate that with 500 MHz of bandwidth
(at 39 GHz band) and 28 dBm transmission power (55 dBm EIRP), it is possible to
provide more than 11 Gbps backhaul capacity for 96 small cells within 1-km
radius.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2015 19:08:28 GMT"
}
] | 2015-07-15T00:00:00 |
[
[
"Pi",
"Zhouyue",
""
],
[
"Choi",
"Junil",
""
],
[
"Heath",
"Robert",
"Jr"
]
] |
new_dataset
| 0.972588 |
1410.6648
|
Henning Schnoor
|
Juha Kontinen, Julian-Steffen M\"uller, Henning Schnoor, Heribert
Vollmer
|
A Van Benthem Theorem for Modal Team Semantics
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The famous van Benthem theorem states that modal logic corresponds exactly to
the fragment of first-order logic that is invariant under bisimulation. In this
article we prove an exact analogue of this theorem in the framework of modal
dependence logic MDL and team semantics. We show that modal team logic MTL,
extending MDL by classical negation, captures exactly the FO-definable
bisimulation invariant properties of Kripke structures and teams. We also
compare the expressive power of MTL to most of the variants and extensions of
MDL recently studied in the area.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 11:12:52 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jul 2015 18:39:11 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Kontinen",
"Juha",
""
],
[
"Müller",
"Julian-Steffen",
""
],
[
"Schnoor",
"Henning",
""
],
[
"Vollmer",
"Heribert",
""
]
] |
new_dataset
| 0.986352 |
1503.00697
|
Hossein Shokri Ghadikolaei
|
Hossein Shokri-Ghadikolaei, Carlo Fischione, Gabor Fodor, Petar
Popovski, Michele Zorzi
|
Millimeter Wave Cellular Networks: A MAC Layer Perspective
|
21 pages, 9 figures, 2 tables, to appear in IEEE Transactions on
Communications
| null |
10.1109/TCOMM.2015.2456093
| null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter wave (mmWave) frequency band is seen as a key enabler of
multi-gigabit wireless access in future cellular networks. In order to overcome
the propagation challenges, mmWave systems use a large number of antenna
elements both at the base station and at the user equipment, which lead to high
directivity gains, fully-directional communications, and possible noise-limited
operations. The fundamental differences between mmWave networks and traditional
ones challenge the classical design constraints, objectives, and available
degrees of freedom. This paper addresses the implications that highly
directional communication has on the design of an efficient medium access
control (MAC) layer. The paper discusses key MAC layer issues, such as
synchronization, random access, handover, channelization, interference
management, scheduling, and association. The paper provides an integrated view
on MAC layer issues for cellular networks, identifies new challenges and
tradeoffs, and provides novel insights and solution approaches.
|
[
{
"version": "v1",
"created": "Mon, 2 Mar 2015 20:28:59 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Mar 2015 02:16:41 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Jun 2015 06:31:59 GMT"
},
{
"version": "v4",
"created": "Sun, 12 Jul 2015 08:26:25 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Shokri-Ghadikolaei",
"Hossein",
""
],
[
"Fischione",
"Carlo",
""
],
[
"Fodor",
"Gabor",
""
],
[
"Popovski",
"Petar",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.999694 |
1507.03037
|
Santanu Sarma
|
S.Sarma
|
SenseDroid: A Context-Aware Information Exchange Framework for Mobile
Sensor Networks Using Android Phones
|
7 pages, 5 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile phones and smartphones have evolved to be very powerful devices that
have the potential to be utilized in many application areas apart from generic
communication. With each passing year, we see increasingly powerful smartphones
being manufactured, which have a plethora of powerful embedded sensors like
microphone, camera, digital compass, GPS, accelerometer, temperature sensors
and many more. Moreover, the ability to easily program today's smartphones,
enables us to exploit these sensors, in a wide variety of application such as
personal safety, emergency and calamity response, situation awareness, remote
activity monitoring, transportation and environment monitoring. In this paper,
we survey the existing mobile phone sensing methodologies and application
areas. We also formulate the architectural framework of our project,
SenseDroid, its utility, limitations and possible future applications.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 22:09:54 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Sarma",
"S.",
""
]
] |
new_dataset
| 0.99945 |
1507.03195
|
Clement Charpentier
|
Cl\'ement Charpentier (IF)
|
The Coloring Game on Planar Graphs with Large Girth, by a result on
Sparse Cactuses
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We denote by $\chi$ g (G) the game chromatic number of a graph G, which is
the smallest number of colors Alice needs to win the coloring game on G. We
know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and
X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52,
2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang.
Decomposing a planar graph with girth at least 8 into a forest and a matching,
Discrete Maths, 311:844-849, 2011] that planar graphs with girth at least 8
have game chromatic number at most 5. One can ask if this bound of 5 can be
improved for a sufficiently large girth. In this paper, we prove that it
cannot. More than that, we prove that there are cactuses CT (i.e. graphs whose
edges only belong to at most one cycle each) having $\chi$ g (CT) = 5 despite
having arbitrary large girth, and even arbitrary large distance between its
cycles.
|
[
{
"version": "v1",
"created": "Sun, 12 Jul 2015 07:14:19 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Charpentier",
"Clément",
"",
"IF"
]
] |
new_dataset
| 0.997876 |
1507.03196
|
Zhangyang Wang
|
Zhangyang Wang, Jianchao Yang, Hailin Jin, Eli Shechtman, Aseem
Agarwala, Jonathan Brandt, Thomas S. Huang
|
DeepFont: Identify Your Font from An Image
|
To Appear in ACM Multimedia as a full paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As font is one of the core design concepts, automatic font identification and
similar font suggestion from an image or photo has been on the wish list of
many designers. We study the Visual Font Recognition (VFR) problem, and advance
the state-of-the-art remarkably by developing the DeepFont system. First of
all, we build up the first available large-scale VFR dataset, named AdobeVFR,
consisting of both labeled synthetic data and partially labeled real-world
data. Next, to combat the domain mismatch between available training and
testing data, we introduce a Convolutional Neural Network (CNN) decomposition
approach, using a domain adaptation technique based on a Stacked Convolutional
Auto-Encoder (SCAE) that exploits a large corpus of unlabeled real-world text
images combined with synthetic data preprocessed in a specific way. Moreover,
we study a novel learning-based model compression approach, in order to reduce
the DeepFont model size without sacrificing its performance. The DeepFont
system achieves an accuracy of higher than 80% (top-5) on our collected
dataset, and also produces a good font similarity measure for font selection
and suggestion. We also achieve around 6 times compression of the model without
any visible loss of recognition accuracy.
|
[
{
"version": "v1",
"created": "Sun, 12 Jul 2015 07:25:14 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Wang",
"Zhangyang",
""
],
[
"Yang",
"Jianchao",
""
],
[
"Jin",
"Hailin",
""
],
[
"Shechtman",
"Eli",
""
],
[
"Agarwala",
"Aseem",
""
],
[
"Brandt",
"Jonathan",
""
],
[
"Huang",
"Thomas S.",
""
]
] |
new_dataset
| 0.986532 |
1507.03215
|
Volker Diekert
|
Volker Diekert
|
More Than 1700 Years of Word Equations
|
The paper will appear as an invited address in the LNCS proceedings
of CAI 2015, Stuttgart, Germany, September 1 - 4, 2015
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geometry and Diophantine equations have been ever-present in mathematics.
Diophantus of Alexandria was born in the 3rd century (as far as we know), but a
systematic mathematical study of word equations began only in the 20th century.
So, the title of the present article does not seem to be justified at all.
However, a linear Diophantine equation can be viewed as a special case of a
system of word equations over a unary alphabet, and, more importantly, a word
equation can be viewed as a special case of a Diophantine equation. Hence, the
problem WordEquations: "Is a given word equation solvable?" is intimately
related to Hilbert's 10th problem on the solvability of Diophantine equations.
This became clear to the Russian school of mathematics at the latest in the mid
1960s, after which a systematic study of that relation began.
Here, we review some recent developments which led to an amazingly simple
decision procedure for WordEquations, and to the description of the set of all
solutions as an EDT0L language.
|
[
{
"version": "v1",
"created": "Sun, 12 Jul 2015 10:23:09 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Diekert",
"Volker",
""
]
] |
new_dataset
| 0.995935 |
1507.03376
|
Akka Zemmari
|
Y. M\'etivier, J.M. Robson, and A. Zemmari
|
A Distributed Enumeration Algorithm and Applications to All Pairs
Shortest Paths, Diameter
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the standard message passing model; we assume the system is fully
synchronous: all processes start at the same time and time proceeds in
synchronised rounds. In each round each vertex can transmit a different message
of size $O(1)$ to each of its neighbours. This paper proposes and analyses a
distributed enumeration algorithm of vertices of a graph having a distinguished
vertex which satisfies that two vertices with consecutive numbers are at
distance at most $3$. We prove that its time complexity is $O(n)$ where $n$ is
the number of vertices of the graph. Furthermore, the size of each message is
$O(1)$ thus its bit complexity is also $O(n).$ We provide some links between
this enumeration and Hamiltonian graphs from which we deduce that this
enumeration is optimal in the sense that there does not exist an enumeration
which satisfies that two vertices with consecutive numbers are at distance at
most $2$.
We deduce from this enumeration algorithms which compute all pairs shortest
paths and the diameter with a time complexity and a bit complexity equal to
$O(n)$. This improves the best known distributed algorithms (under the same
hypotheses) for computing all pairs shortest paths or the diameter presented in
\cite{PRT12,HW12} having a time complexity equal to $O(n)$ and which use
messages of size $O(\log n)$ bits.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 09:58:11 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Métivier",
"Y.",
""
],
[
"Robson",
"J. M.",
""
],
[
"Zemmari",
"A.",
""
]
] |
new_dataset
| 0.991409 |
1507.03388
|
Saul Rodriguez
|
Saul Rodriguez, Stig Ollmar, Muhammad Waqar, Ana Rusu
|
A Batteryless Sensor ASIC for Implantable Bio-impedance Applications
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The measurement of the biological tissue's electrical impedance is an active
research field that has attracted a lot of attention during the last decades.
Bio-impedances are closely related to a large variety of physiological
conditions; therefore, they are useful for diagnosis and monitoring in many
medical applications. Measuring living tissues, however, is a challenging task
that poses countless technical and practical problems, in particular if the
tissues need to be measured under the skin. This paper presents a bio-impedance
sensor ASIC targeting a battery-free, miniature size, implantable device, which
performs accurate 4-point complex impedance extraction in the frequency range
from 2 kHz to 2 MHz. The ASIC is fabricated in 150 nm CMOS, has a size of 1.22
mm x 1.22 mm and consumes 165 uA from a 1.8 V power supply. The ASIC is
embedded in a prototype which communicates with, and is powered by an external
reader device through inductive coupling. The prototype is validated by
measuring the impedances of different combinations of discrete components,
measuring the electrochemical impedance of physiological solution, and
performing ex vivo measurements on animal organs. The proposed ASIC is able to
extract complex impedances with around 1 Ohm resolution; therefore enabling
accurate wireless tissue measurements.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 10:35:42 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Rodriguez",
"Saul",
""
],
[
"Ollmar",
"Stig",
""
],
[
"Waqar",
"Muhammad",
""
],
[
"Rusu",
"Ana",
""
]
] |
new_dataset
| 0.999083 |
1507.03418
|
Chuangqiang Hu
|
Chuangqiang Hu
|
Explicit Construction of AG Codes from Generalized Hermitian Curves
|
13 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present multi-point algebraic geometric codes overstepping the
Gilbert-Varshamov bound. The construction is based on the generalized Hermitian
curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These
codes are described in detail by constrcting a generator matrix. It turns out
that these codes have nice properties similar to those of Hermitian codes. It
is shown that the duals are also such codes and an explicit formula is given.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 12:24:02 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Hu",
"Chuangqiang",
""
]
] |
new_dataset
| 0.986284 |
1507.03466
|
Bart Besselink
|
B. Besselink, V. Turri, S.H. van de Hoef, K.-Y. Liang, A. Alam, J.
M{\aa}rtensson, K.H. Johansson
|
Cyber-physical Control of Road Freight Transport
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Freight transportation is of outmost importance for our society and is
continuously increasing. At the same time, transporting goods on roads accounts
for about 26% of all energy consumption and 18% of all greenhouse gas emissions
in the European Union. Despite the influence the transportation system has on
our energy consumption and the environment, road transportation is mainly done
by individual long-haulage trucks with no real-time coordination or global
optimization. In this paper, we review how modern information and communication
technology supports a cyber-physical transportation system architecture with an
integrated logistic system coordinating fleets of trucks traveling together in
vehicle platoons. From the reduced air drag, platooning trucks traveling close
together can save about 10% of their fuel consumption. Utilizing road grade
information and vehicle-to-vehicle communication, a safe and fuel-optimized
cooperative look-ahead control strategy is implemented on top of the existing
cruise controller. By optimizing the interaction between vehicles and platoons
of vehicles, it is shown that significant improvements can be achieved. An
integrated transport planning and vehicle routing in the fleet management
system allows both small and large fleet owners to benefit from the
collaboration. A realistic case study with 200 heavy-duty vehicles performing
transportation tasks in Sweden is described. Simulations show overall fuel
savings at more than 5% thanks to coordinated platoon planning. It is also
illustrated how well the proposed cooperative look-ahead controller for
heavy-duty vehicle platoons manages to optimize the velocity profiles of the
vehicles over a hilly segment of the considered road network.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 14:16:22 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Besselink",
"B.",
""
],
[
"Turri",
"V.",
""
],
[
"van de Hoef",
"S. H.",
""
],
[
"Liang",
"K. -Y.",
""
],
[
"Alam",
"A.",
""
],
[
"Mårtensson",
"J.",
""
],
[
"Johansson",
"K. H.",
""
]
] |
new_dataset
| 0.999481 |
1507.03467
|
Umberto Ferraro Petrillo
|
Alfredo De Santis, Giancarlo De Maio, Umberto Ferraro Petrillo
|
Using HTML5 to Prevent Detection of Drive-by-Download Web Malware
|
This is the pre-peer reviewed version of the article: \emph{Using
HTML5 to Prevent Detection of Drive-by-Download Web Malware}, which has been
published in final form at \url{http://dx.doi.org/10.1002/sec.1077}. This
article may be used for non-commercial purposes in accordance with Wiley
Terms and Conditions for Self-Archiving
|
Security and Communication Networks, Volume 8, Issue 7, pages
1237-1255, 10 May 2015
|
10.1002/sec.1077
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The web is experiencing an explosive growth in the last years. New
technologies are introduced at a very fast-pace with the aim of narrowing the
gap between web-based applications and traditional desktop applications. The
results are web applications that look and feel almost like desktop
applications while retaining the advantages of being originated from the web.
However, these advancements come at a price. The same technologies used to
build responsive, pleasant and fully-featured web applications, can also be
used to write web malware able to escape detection systems. In this article we
present new obfuscation techniques, based on some of the features of the
upcoming HTML5 standard, which can be used to deceive malware detection
systems. The proposed techniques have been experimented on a reference set of
obfuscated malware. Our results show that the malware rewritten using our
obfuscation techniques go undetected while being analyzed by a large number of
detection systems. The same detection systems were able to correctly identify
the same malware in its original unobfuscated form. We also provide some hints
about how the existing malware detection systems can be modified in order to
cope with these new techniques.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 14:19:52 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"De Santis",
"Alfredo",
""
],
[
"De Maio",
"Giancarlo",
""
],
[
"Petrillo",
"Umberto Ferraro",
""
]
] |
new_dataset
| 0.971808 |
1507.03474
|
Dominik Peters
|
Dominik Peters and Edith Elkind
|
Simple Causes of Complexity in Hedonic Games
|
7+9 pages, long version of a paper in IJCAI 2015
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hedonic games provide a natural model of coalition formation among
self-interested agents. The associated problem of finding stable outcomes in
such games has been extensively studied. In this paper, we identify simple
conditions on expressivity of hedonic games that are sufficient for the problem
of checking whether a given game admits a stable outcome to be computationally
hard. Somewhat surprisingly, these conditions are very mild and intuitive. Our
results apply to a wide range of stability concepts (core stability, individual
stability, Nash stability, etc.) and to many known formalisms for hedonic games
(additively separable games, games with W-preferences, fractional hedonic
games, etc.), and unify and extend known results for these formalisms. They
also have broader applicability: for several classes of hedonic games whose
computational complexity has not been explored in prior work, we show that our
framework immediately implies a number of hardness results for them.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2015 14:36:17 GMT"
}
] | 2015-07-14T00:00:00 |
[
[
"Peters",
"Dominik",
""
],
[
"Elkind",
"Edith",
""
]
] |
new_dataset
| 0.994363 |
1506.07452
|
Wonmin Byeon
|
Marijn F. Stollenga, Wonmin Byeon, Marcus Liwicki, Juergen Schmidhuber
|
Parallel Multi-Dimensional LSTM, With Application to Fast Biomedical
Volumetric Image Segmentation
|
Marijn F. Stollenga and Wonmin Byeon are the shared first authors,
both authors contributed equally to this work
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convolutional Neural Networks (CNNs) can be shifted across 2D images or 3D
videos to segment them. They have a fixed input size and typically perceive
only small local contexts of the pixels to be classified as foreground or
background. In contrast, Multi-Dimensional Recurrent NNs (MD-RNNs) can perceive
the entire spatio-temporal context of each pixel in a few sweeps through all
pixels, especially when the RNN is a Long Short-Term Memory (LSTM). Despite
these theoretical advantages, however, unlike CNNs, previous MD-LSTM variants
were hard to parallelize on GPUs. Here we re-arrange the traditional cuboid
order of computations in MD-LSTM in pyramidal fashion. The resulting
PyraMiD-LSTM is easy to parallelize, especially for 3D data such as stacks of
brain slice images. PyraMiD-LSTM achieved best known pixel-wise brain image
segmentation results on MRBrainS13 (and competitive results on EM-ISBI12).
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 16:26:51 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Stollenga",
"Marijn F.",
""
],
[
"Byeon",
"Wonmin",
""
],
[
"Liwicki",
"Marcus",
""
],
[
"Schmidhuber",
"Juergen",
""
]
] |
new_dataset
| 0.991357 |
1507.01147
|
Yan Wang
|
Yan Wang, Sunghyun Cho, Jue Wang and Shih-Fu Chang
|
PanoSwarm: Collaborative and Synchronized Multi-Device Panoramic
Photography
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Taking a picture has been traditionally a one-persons task. In this paper we
present a novel system that allows multiple mobile devices to work
collaboratively in a synchronized fashion to capture a panorama of a highly
dynamic scene, creating an entirely new photography experience that encourages
social interactions and teamwork. Our system contains two components: a client
app that runs on all participating devices, and a server program that monitors
and communicates with each device. In a capturing session, the server collects
in realtime the viewfinder images of all devices and stitches them on-the-fly
to create a panorama preview, which is then streamed to all devices as visual
guidance. The system also allows one camera to be the host and to send direct
visual instructions to others to guide camera adjustment. When ready, all
devices take pictures at the same time for panorama stitching. Our preliminary
study suggests that the proposed system can help users capture high quality
panoramas with an enjoyable teamwork experience.
A demo video of the system in action is provided at
http://youtu.be/PwQ6k_ZEQSs.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 21:31:54 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2015 03:08:24 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Jul 2015 13:28:08 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Wang",
"Yan",
""
],
[
"Cho",
"Sunghyun",
""
],
[
"Wang",
"Jue",
""
],
[
"Chang",
"Shih-Fu",
""
]
] |
new_dataset
| 0.999773 |
1507.02770
|
Jaderick Pabico
|
Jaderick P. Pabico and Jose Rene L. Micor
|
Ang Social Network sa Facebook ng mga Taga-Batangas at ng mga
Taga-Laguna: Isang Paghahambing
|
16 pages, 8 figures; The text is written in Filipino language with
Abstract translated to English. The title in English is "The Social Network
of Batangas and Laguna Facebook Users: A Comparison." Presented in First
Sotero H. Laurel Social Science Conference, Lyceum of the Philippines
University-Batangas, Batangas City, Philippines, 24 September 2013
|
Asia Pacific Journal of Multidisciplinary Research 1(1):138-150
| null | null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Online social networking (OSN) has become of great influence to Filipinos,
where Facebook, Twitter, LinkedIn, Google+, and Instagram are among the popular
ones. Their popularity, coupled with their intuitive and interactive use, allow
one's personal information such as gender, age, address, relationship status,
and list of friends to become publicly available. The accessibility of
information from these sites allow, with the aid of computers, for the study of
a wide population's characteristics even in a provincial scale. Aside from
being neighbouring locales, the respective residents of Laguna and Batangas
both derive their livelihoods from two lakes, Laguna de Bay and Taal Lake. Both
residents experience similar problems, such as that, among many others, of fish
kill. The goal of this research is to find out similarities in their respective
online populations, particularly that of Facebook's. With the use of
computational dynamic social network analysis (CDSNA), we found out that the
two communities are similar, among others, as follows:
o Both populations are dominated by single young female
o Homophily was observed when choosing a friend in terms of age (i.e.,
friendships were created more often between people whose ages do not differ by
at most five years); and
o Heterophily was observed when choosing friends in terms of gender (i.e.,
more friendships were created between a male and a female than between both
people of the same gender).
This paper also presents the differences in the structure of the two social
networks, such as degrees of separation and preferential attachment.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 02:58:04 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Pabico",
"Jaderick P.",
""
],
[
"Micor",
"Jose Rene L.",
""
]
] |
new_dataset
| 0.998888 |
1507.02800
|
Shuo Jin
|
Chuhua Xian, Shuo Jin, Charlie C.L. Wang
|
Meshfree C^2-Weighting for Shape Deformation
|
10 pages, 14 figures
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handle-driven deformation based on linear blending is widely used in many
applications because of its merits in intuitiveness, efficiency and easiness of
implementation. We provide a meshfree method to compute the smooth weights of
linear blending for shape deformation. The C2-continuity of weighting is
guaranteed by the carefully formulated basis functions, with which the
computation of weights is in a closed-form. Criteria to ensure the quality of
deformation are preserved by the basis functions after decomposing the shape
domain according to the Voronoi diagram of handles. The cost of inserting a new
handle is only the time to evaluate the distances from the new handle to all
sample points in the space of deformation. Moreover, a virtual handle insertion
algorithm has been developed to allow users freely placing handles while
preserving the criteria on weights. Experimental examples for real-time 2D/3D
deformations are shown to demonstrate the effectiveness of this method.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 08:12:22 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Xian",
"Chuhua",
""
],
[
"Jin",
"Shuo",
""
],
[
"Wang",
"Charlie C. L.",
""
]
] |
new_dataset
| 0.993031 |
1507.02835
|
Chetan Singh Thakur
|
Chetan Singh Thakur, Runchun Wang, Tara Julia Hamilton, Jonathan
Tapson and Andre van Schaik
|
A Trainable Neuromorphic Integrated Circuit that Exploits Device
Mismatch
|
Submitted to TCAS-I
| null | null | null |
cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Random device mismatch that arises as a result of scaling of the CMOS
(complementary metal-oxide semi-conductor) technology into the deep submicron
regime degrades the accuracy of analogue circuits. Methods to combat this
increase the complexity of design. We have developed a novel neuromorphic
system called a Trainable Analogue Block (TAB), which exploits device mismatch
as a means for random projections of the input to a higher dimensional space.
The TAB framework is inspired by the principles of neural population coding
operating in the biological nervous system. Three neuronal layers, namely
input, hidden, and output, constitute the TAB framework, with the number of
hidden layer neurons far exceeding the input layer neurons. Here, we present
measurement results of the first prototype TAB chip built using a 65nm process
technology and show its learning capability for various regression tasks. Our
TAB chip exploits inherent randomness and variability arising due to the
fabrication process to perform various learning tasks. Additionally, we
characterise each neuron and discuss the statistical variability of its tuning
curve that arises due to random device mismatch, a desirable property for the
learning capability of the TAB. We also discuss the effect of the number of
hidden neurons and the resolution of output weights on the accuracy of the
learning capability of the TAB.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 10:29:01 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Thakur",
"Chetan Singh",
""
],
[
"Wang",
"Runchun",
""
],
[
"Hamilton",
"Tara Julia",
""
],
[
"Tapson",
"Jonathan",
""
],
[
"van Schaik",
"Andre",
""
]
] |
new_dataset
| 0.996862 |
1507.02992
|
Hans-Joachim Hof
|
Christoph Pohl, Hans-Joachim Hof
|
Secure Scrum: Development of Secure Software with Scrum
|
The Ninth International Conference on Emerging Security Information,
Systems and Technologies - SECURWARE 2015, Venice, Italy, 2015
| null | null | null |
cs.CR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, the use of agile software development methods like Scrum is common
in industry and academia. Considering the current attacking landscape, it is
clear that developing secure software should be a main concern in all software
development projects. In traditional software projects, security issues require
detailed planning in an initial planning phase, typically resulting in a
detailed security analysis (e.g., threat and risk analysis), a security
architecture, and instructions for security implementation (e.g., specification
of key sizes and cryptographic algorithms to use). Agile software development
methods like Scrum are known for reducing the initial planning phases (e.g.,
sprint 0 in Scrum) and for focusing more on producing running code. Scrum is
also known for allowing fast adaption of the emerging software to changes of
customer wishes. For security, this means that it is likely that there are no
detailed security architecture or security implementation instructions from the
start of the project. It also means that a lot of design decisions will be made
during the runtime of the project. Hence, to address security in Scrum, it is
necessary to consider security issues throughout the whole software development
process. Secure Scrum is a variation of the Scrum framework with special focus
on the development of secure software throughout the whole software development
process. It puts emphasis on implementation of security related issues without
the need of changing the underlying Scrum process or influencing team dynamics.
Secure Scrum allows even non- security experts to spot security issues, to
implement security features, and to verify implementations. A field test of
Secure Scrum shows that the security level of software developed using Secure
Scrum is higher then the security level of software developed using standard
Scrum.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 19:16:27 GMT"
}
] | 2015-07-13T00:00:00 |
[
[
"Pohl",
"Christoph",
""
],
[
"Hof",
"Hans-Joachim",
""
]
] |
new_dataset
| 0.959643 |
1506.00394
|
Marcus Paradies
|
Marcus Paradies and Michael Rudolf and Wolfgang Lehner
|
GraphVista: Interactive Exploration Of Large Graphs
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The potential to gain business insights from graph-structured data through
graph analytics is increasingly attracting companies from a variety of
industries, ranging from web companies to traditional enterprise businesses. To
analyze a graph, a user often executes isolated graph queries using a dedicated
interface---a procedural graph programming interface or a declarative graph
query language. The results are then returned and displayed using a specific
visualization technique. This follows the classical ad-hoc
Query$\rightarrow$Result interaction paradigm and often requires multiple query
iterations until an interesting aspect in the graph data is identified. This is
caused on the one hand by the schema flexibility of graph data and on the other
hand by the intricacies of declarative graph query languages. To lower the
burden for the user to explore an unknown graph without prior knowledge of a
graph query language, visual graph exploration provides an effective and
intuitive query interface to navigate through the graph interactively.
We demonstrate GRAPHVISTA, a graph visualization and exploration tool that
can seamlessly combine ad-hoc querying and interactive graph exploration within
the same query session. In our demonstration, conference attendees will see
GRAPHVISTA running against a large real-world graph data set. They will start
by identifying entry points of interest with the help of ad-hoc queries and
will then discover the graph interactively through visual graph exploration.
|
[
{
"version": "v1",
"created": "Mon, 1 Jun 2015 08:55:26 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2015 07:27:53 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Paradies",
"Marcus",
""
],
[
"Rudolf",
"Michael",
""
],
[
"Lehner",
"Wolfgang",
""
]
] |
new_dataset
| 0.995942 |
1506.05079
|
Przemys{\l}aw Uzna\'nski
|
Przemys{\l}aw Uzna\'nski
|
All Permutations Supersequence is coNP-complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that deciding whether a given input word contains as subsequence
every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The
coNP-completeness holds even when given the guarantee that the input word
contains as subsequences all of length $n-1$ sequences over the same set of
integers. We also show NP-completeness of a related problem of Partially
Non-crossing Perfect Matching in Bipartite Graphs, i.e. to find a perfect
matching in an ordered bipartite graph where edges of the matching incident to
selected vertices (even only from one side) are non-crossing.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2015 19:12:08 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2015 02:49:35 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Uznański",
"Przemysław",
""
]
] |
new_dataset
| 0.992522 |
1506.08409
|
Erik Demaine
|
Erik D. Demaine and Stefan Langerman
|
Bust-a-Move/Puzzle Bobble is NP-Complete
|
9 pages, 9 figures. Corrected mistakes in gadgets
| null | null | null |
cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or
Bust-a-Move, is NP-complete. Our proof applies to the perfect-information
version where the bubble sequence is known in advance, and it uses just three
bubble colors.
|
[
{
"version": "v1",
"created": "Sun, 28 Jun 2015 14:51:37 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2015 19:23:16 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Langerman",
"Stefan",
""
]
] |
new_dataset
| 0.99682 |
1507.01148
|
Yan Wang
|
Yan Wang, Jue Wang and Shih-Fu Chang
|
CamSwarm: Instantaneous Smartphone Camera Arrays for Collaborative
Photography
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Camera arrays (CamArrays) are widely used in commercial filming projects for
achieving special visual effects such as bullet time effect, but are very
expensive to set up. We propose CamSwarm, a low-cost and lightweight
alternative to professional CamArrays for consumer applications. It allows the
construction of a collaborative photography platform from multiple mobile
devices anywhere and anytime, enabling new capturing and editing experiences
that a single camera cannot provide. Our system allows easy team formation;
uses real-time visualization and feedback to guide camera positioning; provides
a mechanism for synchronized capturing; and finally allows the user to
efficiently browse and edit the captured imagery. Our user study suggests that
CamSwarm is easy to use; the provided real-time guidance is helpful; and the
full system achieves high quality results promising for non-professional use.
A demo video is provided at https://www.youtube.com/watch?v=LgkHcvcyTTM.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 21:46:37 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2015 01:13:21 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Wang",
"Yan",
""
],
[
"Wang",
"Jue",
""
],
[
"Chang",
"Shih-Fu",
""
]
] |
new_dataset
| 0.999311 |
1507.02373
|
Travis Deyle
|
Jennifer Wang, Erik Schluntz, Brian Otis, and Travis Deyle
|
A New Vision for Smart Objects and the Internet of Things: Mobile Robots
and Long-Range UHF RFID Sensor Tags
|
8 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new vision for smart objects and the Internet of Things wherein
mobile robots interact with wirelessly-powered, long-range, ultra-high
frequency radio frequency identification (UHF RFID) tags outfitted with sensing
capabilities. We explore the technology innovations driving this vision by
examining recently-commercialized sensor tags that could be affixed-to or
embedded-in objects or the environment to yield true embodied intelligence.
Using a pair of autonomous mobile robots outfitted with UHF RFID readers, we
explore several potential applications where mobile robots interact with sensor
tags to perform tasks such as: soil moisture sensing, remote crop monitoring,
infrastructure monitoring, water quality monitoring, and remote sensor
deployment.
|
[
{
"version": "v1",
"created": "Thu, 9 Jul 2015 04:48:10 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Wang",
"Jennifer",
""
],
[
"Schluntz",
"Erik",
""
],
[
"Otis",
"Brian",
""
],
[
"Deyle",
"Travis",
""
]
] |
new_dataset
| 0.999343 |
1507.02438
|
Tae Hyun Kim
|
Tae Hyun Kim and Kyoung Mu Lee
|
Generalized Video Deblurring for Dynamic Scenes
|
CVPR 2015 oral
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several state-of-the-art video deblurring methods are based on a strong
assumption that the captured scenes are static. These methods fail to deblur
blurry videos in dynamic scenes. We propose a video deblurring method to deal
with general blurs inherent in dynamic scenes, contrary to other methods. To
handle locally varying and general blurs caused by various sources, such as
camera shake, moving objects, and depth variation in a scene, we approximate
pixel-wise kernel with bidirectional optical flows. Therefore, we propose a
single energy model that simultaneously estimates optical flows and latent
frames to solve our deblurring problem. We also provide a framework and
efficient solvers to optimize the energy model. By minimizing the proposed
energy function, we achieve significant improvements in removing blurs and
estimating accurate optical flows in blurry frames. Extensive experimental
results demonstrate the superiority of the proposed method in real and
challenging videos that state-of-the-art methods fail in either deblurring or
optical flow estimation.
|
[
{
"version": "v1",
"created": "Thu, 9 Jul 2015 09:59:40 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Kim",
"Tae Hyun",
""
],
[
"Lee",
"Kyoung Mu",
""
]
] |
new_dataset
| 0.971903 |
1507.02463
|
Tapas Kumar Mishra
|
Tapas Kumar Mishra and Sudebkumar Prasant Pal
|
An extremal problem in proper $(r,p)$-coloring of hypergraphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $G(V,E)$ be a $k$-uniform hypergraph. A hyperedge $e \in E$ is said to be
properly $(r,p)$ colored by an $r$-coloring of vertices in $V$ if $e$ contains
vertices of at least $p$ distinct colors in the $r$-coloring. An $r$-coloring
of vertices in $V$ is called a {\it strong $(r,p)$ coloring} if every hyperedge
$e \in E$ is properly $(r,p)$ colored by the $r$-coloring. We study the maximum
number of hyperedges that can be properly $(r,p)$ colored by a single
$r$-coloring and the structures that maximizes number of properly $(r,p)$
colored hyperedges.
|
[
{
"version": "v1",
"created": "Thu, 9 Jul 2015 11:25:23 GMT"
}
] | 2015-07-10T00:00:00 |
[
[
"Mishra",
"Tapas Kumar",
""
],
[
"Pal",
"Sudebkumar Prasant",
""
]
] |
new_dataset
| 0.991011 |
1507.01894
|
Katherine Leonard
|
Oleg Iliev, Zahra Lakdawala, Katherine Leonard, Yavor Vutov
|
On pore-scale modeling and simulation of reactive transport in 3D
geometries
|
15 pages, 6 figures
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pore-scale modeling and simulation of reactive flow in porous media has a
range of diverse applications, and poses a number of research challenges. It is
known that the morphology of a porous medium has significant influence on the
local flow rate, which can have a substantial impact on the rate of chemical
reactions. While there are a large number of papers and software tools
dedicated to simulating either fluid flow in 3D computerized tomography (CT)
images or reactive flow using pore-network models, little attention to date has
been focused on the pore-scale simulation of sorptive transport in 3D CT
images, which is the specific focus of this paper. Here we first present an
algorithm for the simulation of such reactive flows directly on images, which
is implemented in a sophisticated software package. We then use this software
to present numerical results in two resolved geometries, illustrating the
importance of pore-scale simulation and the flexibility of our software
package.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 17:38:44 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Jul 2015 12:17:16 GMT"
}
] | 2015-07-09T00:00:00 |
[
[
"Iliev",
"Oleg",
""
],
[
"Lakdawala",
"Zahra",
""
],
[
"Leonard",
"Katherine",
""
],
[
"Vutov",
"Yavor",
""
]
] |
new_dataset
| 0.989538 |
1507.02020
|
Thierry Poibeau
|
Thierry Poibeau (LaTTICe), Pablo Ruiz (LaTTICe)
|
Generating Navigable Semantic Maps from Social Sciences Corpora
|
in Digital Humanities 2015, Jun 2015, Sydney, Australia. Actes de la
Conf{\'e}rence Digital Humanities 2015. arXiv admin note: text overlap with
arXiv:1406.4211
| null | null | null |
cs.CL cs.AI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is now commonplace to observe that we are facing a deluge of online
information. Researchers have of course long acknowledged the potential value
of this information since digital traces make it possible to directly observe,
describe and analyze social facts, and above all the co-evolution of ideas and
communities over time. However, most online information is expressed through
text, which means it is not directly usable by machines, since computers
require structured, organized and typed information in order to be able to
manipulate it. Our goal is thus twofold: 1. Provide new natural language
processing techniques aiming at automatically extracting relevant information
from texts, especially in the context of social sciences, and connect these
pieces of information so as to obtain relevant socio-semantic networks; 2.
Provide new ways of exploring these socio-semantic networks, thanks to tools
allowing one to dynamically navigate these networks, de-construct and
re-construct them interactively, from different points of view following the
needs expressed by domain experts.
|
[
{
"version": "v1",
"created": "Wed, 8 Jul 2015 04:27:48 GMT"
}
] | 2015-07-09T00:00:00 |
[
[
"Poibeau",
"Thierry",
"",
"LaTTICe"
],
[
"Ruiz",
"Pablo",
"",
"LaTTICe"
]
] |
new_dataset
| 0.968984 |
1507.02043
|
Patrick Zwickl
|
Patrick Zwickl, Ivan Gojmerac, Paul Fuxjaeger, Peter Reichl and Oliver
Holland
|
The Society Spectrum: Self-Regulation of Cellular Network Markets
|
6 pages, 3 figures, conference format
| null | null | null |
cs.NI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's cellular telecommunications markets require continuous monitoring and
intervention by regulators in order to balance the interests of various
stakeholders. In order to reduce the extent of regulatory involvements in the
day-to-day business of cellular operators, the present paper proposes a
"self-regulating" spectrum market regime named "society spectrum". This regime
provides a market-inherent and automatic self-balancing of stakeholder powers,
which at the same time provides a series of coordination and fairness assurance
functions that clearly distinguish it from "spectrum as a commons" solutions.
The present paper will introduce the fundamental regulatory design and will
elaborate on mechanisms to assure fairness among stakeholders and individuals.
This work further puts the society spectrum into the context of contemporary
radio access technologies and cognitive radio approaches.
|
[
{
"version": "v1",
"created": "Wed, 8 Jul 2015 06:47:11 GMT"
}
] | 2015-07-09T00:00:00 |
[
[
"Zwickl",
"Patrick",
""
],
[
"Gojmerac",
"Ivan",
""
],
[
"Fuxjaeger",
"Paul",
""
],
[
"Reichl",
"Peter",
""
],
[
"Holland",
"Oliver",
""
]
] |
new_dataset
| 0.998654 |
1507.01613
|
Boris Brimkov
|
Boris Brimkov
|
A note on the clique number of complete $k$-partite graphs
|
6 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note, we show that a complete $k$-partite graph is the only graph
with clique number $k$ among all degree-equivalent simple graphs. This result
gives a lower bound on the clique number, which is sharper than existing bounds
on a large family of graphs.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 20:13:00 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Brimkov",
"Boris",
""
]
] |
new_dataset
| 0.991696 |
1507.01656
|
Steve Versteeg
|
Steve Versteeg
|
Languages for Mobile Agents
|
Honours Thesis. Department of Computer Science and Sofware
Engineering, University of Melbourne. 1997
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile agents represent a new model for network computing. Many different
languages have been used to implement mobile agents. The characteristics that
make a language useful for writing mobile agents are: (1) their support of
agent migration, (2) their support for agent-to-agent communication, (3) how
they allow agents to interact with local resources, (4) security mechanisms,
(5) execution efficiency, (6) language implementation across multiple
platforms, and (7) the language's ease of programming of the tasks mobile
agents perform.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 01:47:31 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Versteeg",
"Steve",
""
]
] |
new_dataset
| 0.998858 |
1507.01699
|
Yong Zeng
|
Yong Zeng and Rui Zhang
|
Millimeter Wave MIMO with Lens Antenna Array: A New Path Division
Multiplexing Paradigm
|
submitted for possible journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave (mmWave) communication is a promising technology for 5G
cellular systems. To compensate for the severe path loss in mmWave systems,
large antenna arrays are generally used to achieve significant beamforming
gains. However, due to the high hardware and power consumption cost associated
with radio frequency (RF) chains, it is desirable to achieve the large-antenna
gains, but with only limited number of RF chains for mmWave communications. To
this end, we study in this paper a new lens antenna array enabled mmWave MIMO
communication system. We first show that the array response of the proposed
lens antenna array at the receiver/transmitter follows a "sinc" function, where
the antenna with the peak response is determined by the angle of arrival
(AoA)/departure (AoD) of the received/transmitted signal. By exploiting this
unique property of lens antenna arrays along with the multi-path sparsity of
mmWave channels, we propose a novel low-cost and capacity-achieving MIMO
transmission scheme, termed \emph{orthogonal path division multiplexing
(OPDM)}. For channels with insufficiently separated AoAs and/or AoDs, we also
propose a simple \emph{path grouping} technique with group-based small-scale
MIMO processing to mitigate the inter-path interference. Numerical results are
provided to compare the performance of the proposed lens antenna arrays for
mmWave MIMO system against that of conventional arrays, under different
practical setups. It is shown that the proposed system achieves significant
throughput gain as well as complexity and hardware cost reduction, both making
it an appealing new paradigm for mmWave MIMO communications.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 08:12:42 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.99959 |
1507.01708
|
Carlo Sartiani
|
Dario Colazzo, Carlo Sartiani
|
Typing Regular Path Query Languages for Data Graphs
| null | null | null | null |
cs.DB cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regular path query languages for data graphs are essentially \emph{untyped}.
The lack of type information greatly limits the optimization opportunities for
query engines and makes application development more complex. In this paper we
discuss a simple, yet expressive, schema language for edge-labelled data
graphs. This schema language is, then, used to define a query type inference
approach with good precision properties.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 08:43:59 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Colazzo",
"Dario",
""
],
[
"Sartiani",
"Carlo",
""
]
] |
new_dataset
| 0.993819 |
1507.01777
|
Suman Sau
|
Swagata Mandal, Suman Sau, Amlan Chakrabarti, Jogendra Saini, Sushanta
Kumar Pal and Subhasish Chattopadhyay
|
FPGA based Novel High Speed DAQ System Design with Error Correction
|
ISVLSI 2015. arXiv admin note: substantial text overlap with
arXiv:1505.04569, arXiv:1503.08819
| null | null |
01A
|
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Present state of the art applications in the area of high energy physics
experiments (HEP), radar communication, satellite communication and bio medical
instrumentation require fault resilient data acquisition (DAQ) system with the
data rate in the order of Gbps. In order to keep the high speed DAQ system
functional in such radiation environment where direct intervention of human is
not possible, a robust and error free communication system is necessary. In
this work we present an efficient DAQ design and its implementation on field
programmable gate array (FPGA). The proposed DAQ system supports high speed
data communication (~4.8 Gbps) and achieves multi-bit error correction
capabilities. BCH code (named after Raj Bose and D. K. RayChaudhuri) has been
used for multi-bit error correction. The design has been implemented on Xilinx
Kintex-7 board and is tested for board to board communication as well as for
board to PC using PCIe (Peripheral Component Interconnect express) interface.
To the best of our knowledge, the proposed FPGA based high speed DAQ system
utilizing optical link and multi-bit error resiliency can be considered first
of its kind. Performance estimation of the implemented DAQ system is done based
on resource utilization, critical path delay, efficiency and bit error rate
(BER).
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 12:24:25 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Mandal",
"Swagata",
""
],
[
"Sau",
"Suman",
""
],
[
"Chakrabarti",
"Amlan",
""
],
[
"Saini",
"Jogendra",
""
],
[
"Pal",
"Sushanta Kumar",
""
],
[
"Chattopadhyay",
"Subhasish",
""
]
] |
new_dataset
| 0.998554 |
1507.01934
|
Hisao Tamaki
|
Kenta Kitsunai, Yasuaki Kobayashi, and Hisao Tamaki
|
On the pathwidth of almost semicomplete digraphs
|
33pages, a shorter version to appear in ESA 2015
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at
most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u
\neq v$ such that there is no edge between $u$ and $v$ in either direction.
This notion generalizes that of semicomplete digraphs which are
$0$-semicomplete and tournaments which are semicomplete and have no
anti-parallel pairs of edges. Our results in this paper are as follows. (1) We
give an algorithm which, given an $h$-semicomplete digraph $G$ on $n$ vertices
and a positive integer $k$, in $(h + 2k + 1)^{2k} n^{O(1)}$ time either
constructs a path-decomposition of $G$ of width at most $k$ or concludes
correctly that the pathwidth of $G$ is larger than $k$. (2) We show that there
is a function $f(k, h)$ such that every $h$-semicomplete digraph of pathwidth
at least $f(k, h)$ has a semicomplete subgraph of pathwidth at least $k$.
One consequence of these results is that the problem of deciding if a fixed
digraph $H$ is topologically contained in a given $h$-semicomplete digraph $G$
admits a polynomial-time algorithm for fixed $h$.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 19:55:36 GMT"
}
] | 2015-07-08T00:00:00 |
[
[
"Kitsunai",
"Kenta",
""
],
[
"Kobayashi",
"Yasuaki",
""
],
[
"Tamaki",
"Hisao",
""
]
] |
new_dataset
| 0.997522 |
1409.0980
|
Vilem Vychodil
|
Vilem Vychodil
|
Monoidal functional dependencies
| null |
Journal of Computer and System Sciences 81(7) (2015) 1357-1372
|
10.1016/j.jcss.2015.03.006
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a complete logic for reasoning with functional dependencies (FDs)
with semantics defined over classes of commutative integral partially ordered
monoids and complete residuated lattices. The dependencies allow us to express
stronger relationships between attribute values than the ordinary FDs. In our
setting, the dependencies not only express that certain values are determined
by others but also express that similar values of attributes imply similar
values of other attributes. We show complete axiomatization using a system of
Armstrong-like rules, comment on related computational issues, and the
relational vs. propositional semantics of the dependencies.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 08:06:22 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Jul 2015 20:17:42 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Vychodil",
"Vilem",
""
]
] |
new_dataset
| 0.995769 |
1411.0336
|
Hussain Elkotby
|
Hussain Elkotby and Mai Vu
|
Uplink User-Assisted Relaying in Cellular Networks
|
32 pages, 13 figures, revised version submitted to IEEE Transactions
on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use stochastic geometry to analyze the performance of a partial
decode-and-forward (PDF) relaying scheme applied in a user-assisted relaying
setting, where an active user relays data through another idle user in uplink
cellular communication. We present the geometric model of a network deploying
user-assisted relaying and propose two geometric cooperation policies for fast
and slow fading channels. We analytically derive the cooperation probability
for both policies. This cooperation probability is further used in the
analytical derivation of the moments of inter-cell interference power caused by
system-wide deployment of this user-assisted PDF relaying. We then model the
inter-cell interference power statistics using the Gamma distribution by
matching the first two moments analytically derived. This cooperation and
interference analysis provides the theoretical basis for quantitatively
evaluating the performance impact of user-assisted relaying in cellular
networks. We then numerically evaluate the average transmission rate
performance and show that user-assisted relaying can significantly improve
per-user transmission rate despite of increased inter-cell interference. This
transmission rate gain is significant for active users near the cell edge and
further increases with higher idle user density, supporting user-assisted
relaying as a viable solution to crowded population areas.
|
[
{
"version": "v1",
"created": "Sun, 2 Nov 2014 23:30:52 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Apr 2015 20:44:26 GMT"
},
{
"version": "v3",
"created": "Sat, 4 Jul 2015 20:32:24 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Elkotby",
"Hussain",
""
],
[
"Vu",
"Mai",
""
]
] |
new_dataset
| 0.980504 |
1411.2858
|
Loet Leydesdorff
|
Loet Leydesdorff
|
Can Technology Life-Cycles Be Indicated by Diversity in Patent
Classifications? The crucial role of variety
|
accepted for publication in Scientometrics (July 2015)
| null | null | null |
cs.DL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a previous study of patent classifications in nine material technologies
for photovoltaic cells, Leydesdorff et al. (2015) reported cyclical patterns in
the longitudinal development of Rao-Stirling diversity. We suggested that these
cyclical patterns can be used to indicate technological life-cycles. Upon
decomposition, however, the cycles are exclusively due to increases and
decreases in the variety of the classifications, and not to disparity or
technological distance, measured as (1 - cosine). A single frequency component
can accordingly be shown in the periodogram. Furthermore, the cyclical patterns
are associated with the numbers of inventors in the respective technologies.
Sometimes increased variety leads to a boost in the number of inventors, but in
early phases--when the technology is still under constructio--it can also be
the other way round. Since the development of the cycles thus seems independent
of technological distances among the patents, the visualization in terms of
patent maps can be considered as addressing an analytically different set of
research questions.
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2014 15:45:59 GMT"
},
{
"version": "v2",
"created": "Fri, 22 May 2015 09:37:39 GMT"
},
{
"version": "v3",
"created": "Sun, 5 Jul 2015 11:11:24 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.956919 |
1506.06098
|
Jose Rodrigues Jr
|
J. Rodrigues, M. Gazziro, N. Goncalves, O. Neto, Y. Fernandes, A.
Gimenes, C. Alegre, R. Assis
|
The 12 prophets dataset
|
Full dataset online at http://aleijadinho3d.icmc.usp.br/data.html
| null | null |
University of Sao Paulo, Technical Report ICMC-USP 400, 2014
|
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The "Ajeijadinho 3D" project is an initiative supported by the University of
S\~ao Paulo (Museum of Science and Dean of Culture and Extension), which
involves the 3D digitization of art works of Brazilian sculptor Antonio
Francisco Lisboa, better known as Aleijadinho. The project made use of advanced
acquisition and processing of 3D meshes for preservation and dissemination of
the cultural heritage. The dissemination occurs through a Web portal, so that
the population has the opportunity to meet the art works in detail using 3D
visualization and interaction. The portal address is
http://www.aleijadinho3d.icmc.usp.br. The 3D acquisitions were conducted over a
week at the end of July 2013 in the cities of Ouro Preto, MG, Brazil and
Congonhas do Campo, MG, Brazil. The scanning was done with a special equipment
supplied by company Leica Geosystems, which allowed the work to take place at
distances between 10 and 30 meters, defining a non-invasive procedure,
simplified logistics, and without the need for preparation or isolation of the
sites. In Ouro Preto, we digitized the churches of Francisco of Assis, Our Lady
of Carmo, and Our Lady of Mercy; in Congonhas do Campo we scanned the entire
Sanctuary of Bom Jesus de Matosinhos and his 12 prophets. Once scanned, the art
works went through a long process of preparation, which required careful
handling of meshes done by experts from the University of S\~ao Paulo in
partnership with company Imprimate.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 17:57:38 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Rodrigues",
"J.",
""
],
[
"Gazziro",
"M.",
""
],
[
"Goncalves",
"N.",
""
],
[
"Neto",
"O.",
""
],
[
"Fernandes",
"Y.",
""
],
[
"Gimenes",
"A.",
""
],
[
"Alegre",
"C.",
""
],
[
"Assis",
"R.",
""
]
] |
new_dataset
| 0.999855 |
1507.01057
|
Wang Hao
|
Daqing Zhang, Hao Wang, Yasha Wang, Junyi Ma
|
Anti-Fall: A Non-intrusive and Real-time Fall Detector Leveraging CSI
from Commodity WiFi Devices
|
13 pages,8 figures,corrected version, ICOST conference
| null |
10.1007/978-3-319-19312-0_15
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fall is one of the major health threats and obstacles to independent living
for elders, timely and reliable fall detection is crucial for mitigating the
effects of falls. In this paper, leveraging the fine-grained Channel State
Information (CSI) and multi-antenna setting in commodity WiFi devices, we
design and implement a real-time, non-intrusive, and low-cost indoor fall
detector, called Anti-Fall. For the first time, the CSI phase difference over
two antennas is identified as the salient feature to reliably segment the fall
and fall-like activities, both phase and amplitude information of CSI is then
exploited to accurately separate the fall from other fall-like activities.
Experimental results in two indoor scenarios demonstrate that Anti-Fall
consistently outperforms the state-of-the-art approach WiFall, with 10% higher
detection rate and 10% less false alarm rate on average.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 01:57:58 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Zhang",
"Daqing",
""
],
[
"Wang",
"Hao",
""
],
[
"Wang",
"Yasha",
""
],
[
"Ma",
"Junyi",
""
]
] |
new_dataset
| 0.968067 |
1507.01095
|
V Lalitha
|
V. Lalitha and Satyanarayana V. Lokam
|
Weight Enumerators and Higher Support Weights of Maximally Recoverable
Codes
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we establish the matroid structures corresponding to
data-local and local maximally recoverable codes (MRC). The matroid structures
of these codes can be used to determine the associated Tutte polynomial. Greene
proved that the weight enumerators of any code can be determined from its
associated Tutte polynomial. We will use this result to derive explicit
expressions for the weight enumerators of data-local and local MRC. Also, Britz
proved that the higher support weights of any code can be determined from its
associated Tutte polynomial. We will use this result to derive expressions for
the higher support weights of data-local and local MRC with two local codes.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 10:48:03 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Lalitha",
"V.",
""
],
[
"Lokam",
"Satyanarayana V.",
""
]
] |
new_dataset
| 0.998565 |
1507.01109
|
Simon Worthington
|
Simon Worthington
|
Book to the Future - a manifesto for book liberation
|
178 x 111mm, 44 page, spine 2.769mm, 50.801 gm, cover color matt,
interior color, paper 70 gsm, illustrations 12
| null |
10.5281/zenodo.18166
| null |
cs.DL cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
The Book Liberation Manifesto is an exploration of publishing outside of
current corporate constraints and beyond the confines of book piracy. We
believe that knowledge should be in free circulation to benefit humankind,
which means an equitable and vibrant economy to support publishing, instead of
the prevailing capitalist hand-me-down system of Sisyphean economic
sustainability. Readers and books have been forced into pirate libraries, while
sales channels have been monopolised by the big Internet giants which exact
extortionate fees from publishers. We have three proposals. First, publications
should be free-at-the-point-of-reading under a variety of open intellectual
property regimes. Second, they should become fully digital -- in order to
facilitate ready reuse, distribution, algorithmic and computational use.
Finally, Open Source software for publishing should be treated as public
infrastructure, with sustained research and investment. The result of such
robust infrastructures will mean lower costs for manufacturing and faster
publishing lifecycles, so that publishers and publics will be more readily able
to afford to invent new futures. For more information on the Hybrid Publishing
Consortium.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 14:16:04 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Worthington",
"Simon",
""
]
] |
new_dataset
| 0.980462 |
1507.01162
|
Haibo Hong
|
Haibo Hong, Licheng Wang, Haseeb Ahmad, Jing Li, Yixian Yang
|
Minimal Logarithmic Signatures for Sporadic Groups
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a special type of factorization of finite groups, logarithmic signature
(LS) is used as the main component of cryptographic keys for secret key
cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and
MST3. An LS with the shortest length is called a minimal logarithmic signature
(MLS) and is even desirable for cryptographic constructions. The MLS conjecture
states that every finite simple group has an MLS. Until now, the MLS conjecture
has been proved true for some families of simple groups. In this paper, we will
prove the existence of minimal logarithmic signatures for some sporadic groups.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 02:32:14 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Hong",
"Haibo",
""
],
[
"Wang",
"Licheng",
""
],
[
"Ahmad",
"Haseeb",
""
],
[
"Li",
"Jing",
""
],
[
"Yang",
"Yixian",
""
]
] |
new_dataset
| 0.999266 |
1507.01163
|
Haibo Hong
|
Haibo Hong, Licheng Wang, Haseeb Ahmad, Yixian Yang
|
Minimal Logarithmic Signatures for one type of Classical Groups
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a special type of factorization of finite groups, logarithmic signature
(LS) is used as the main component of cryptographic keys for secret key
cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and
MST3. An LS with the shortest length, called a minimal logarithmic signature
(MLS), is even desirable for cryptographic applications. The MLS conjecture
states that every finite simple group has an MLS. Recently, the conjecture has
been shown to be true for general linear groups GLn(q), special linear groups
SLn(q), and symplectic groups Spn(q) with q a power of primes and for
orthogonal groups On(q) with q as a power of 2. In this paper, we present new
constructions of minimal logarithmic signatures for the orthogonal group On(q)
and SOn(q) with q as a power of odd primes. Furthermore, we give constructions
of MLSs for a type of classical groups projective commutator subgroup.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 02:47:28 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Hong",
"Haibo",
""
],
[
"Wang",
"Licheng",
""
],
[
"Ahmad",
"Haseeb",
""
],
[
"Yang",
"Yixian",
""
]
] |
new_dataset
| 0.999172 |
1507.01272
|
Srijan Kumar
|
Srijan Kumar, Francesca Spezzano, V.S. Subrahmanian
|
VEWS: A Wikipedia Vandal Early Warning System
|
To appear in Proceedings of the 21st ACM SIGKDD Conference of
Knowledge Discovery and Data Mining (KDD 2015)
| null |
10.1145/2783258.2783367
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of detecting vandals on Wikipedia before any human or
known vandalism detection system reports flagging potential vandals so that
such users can be presented early to Wikipedia administrators. We leverage
multiple classical ML approaches, but develop 3 novel sets of features. Our
Wikipedia Vandal Behavior (WVB) approach uses a novel set of user editing
patterns as features to classify some users as vandals. Our Wikipedia
Transition Probability Matrix (WTPM) approach uses a set of features derived
from a transition probability matrix and then reduces it via a neural net
auto-encoder to classify some users as vandals. The VEWS approach merges the
previous two approaches. Without using any information (e.g. reverts) provided
by other users, these algorithms each have over 85% classification accuracy.
Moreover, when temporal recency is considered, accuracy goes to almost 90%. We
carry out detailed experiments on a new data set we have created consisting of
about 33K Wikipedia users (including both a black list and a white list of
editors) and containing 770K edits. We describe specific behaviors that
distinguish between vandals and non-vandals. We show that VEWS beats ClueBot NG
and STiki, the best known algorithms today for vandalism detection. Moreover,
VEWS detects far more vandals than ClueBot NG and on average, detects them 2.39
edits before ClueBot NG when both detect the vandal. However, we show that the
combination of VEWS and ClueBot NG can give a fully automated vandal early
warning system with even higher accuracy.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 20:53:26 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Kumar",
"Srijan",
""
],
[
"Spezzano",
"Francesca",
""
],
[
"Subrahmanian",
"V. S.",
""
]
] |
new_dataset
| 0.997028 |
1507.01287
|
Andres Monroy-Hernandez
|
Munmun De Choudhury, Andr\'es Monroy-Hern\'andez, and Gloria Mark
|
"Narco" Emotions: Affect and Desensitization in Social Media during the
Mexican Drug War
|
Best paper award at the 32nd annual ACM conference on Human factors
in computing systems (CHI '14). ACM, New York, NY, USA, pages 3563-3572
|
In Proceedings of the 32nd annual ACM conference on Human factors
in computing systems (CHI 2014). ACM, New York, NY, USA, pages 3563-3572
|
10.1145/2556288.2557197
| null |
cs.CY cs.HC cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media platforms have emerged as prominent information sharing
ecosystems in the context of a variety of recent crises, ranging from mass
emergencies, to wars and political conflicts. We study affective responses in
social media and how they might indicate desensitization to violence
experienced in communities embroiled in an armed conflict. Specifically, we
examine three established affect measures: negative affect, activation, and
dominance as observed on Twitter in relation to a number of statistics on
protracted violence in four major cities afflicted by the Mexican Drug War.
During a two year period (Aug 2010-Dec 2012), while violence was on the rise in
these regions, our findings show a decline in negative emotional expression as
well as a rise in emotional arousal and dominance in Twitter posts: aspects
known to be psychological markers of desensitization. We discuss the
implications of our work for behavioral health, facilitating rehabilitation
efforts in communities enmeshed in an acute and persistent urban warfare, and
the impact on civic engagement.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 22:32:40 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"De Choudhury",
"Munmun",
""
],
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Mark",
"Gloria",
""
]
] |
new_dataset
| 0.989755 |
1507.01290
|
Andres Monroy-Hernandez
|
Andr\'es Monroy-Hern\'andez, Emre Kiciman, Danah Boyd, Scott Counts
|
Narcotweets: Social Media in Wartime
|
In Proceedings of the 2012 International AAAI Conference on Weblogs
and Social Media
| null | null | null |
cs.CY cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
This paper describes how people living in armed conflict environments use
social media as a participatory news platform, in lieu of damaged state and
media apparatuses. We investigate this by analyzing the microblogging practices
of Mexican citizens whose everyday life is affected by the Drug War. We provide
a descriptive analysis of the phenomenon, combining content and quantitative
Twitter data analyses. We focus on three interrelated phenomena: general
participation patterns of ordinary citizens, the emergence and role of
information curators, and the tension between governmental regulation and drug
cartel intimidation. This study reveals the complex tensions among citizens,
media actors, and the government in light of large scale organized crime.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 22:42:42 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Kiciman",
"Emre",
""
],
[
"Boyd",
"Danah",
""
],
[
"Counts",
"Scott",
""
]
] |
new_dataset
| 0.999025 |
1507.01291
|
Andres Monroy-Hernandez
|
Andr\'es Monroy-Hern\'andez, danah boyd, Emre Kiciman, Munmun De
Choudhury, and Scott Counts
|
The New War Correspondents: the Rise of Civic Media Curation in Urban
Warfare
|
In Proceedings of the 2013 conference on Computer supported
cooperative work (CSCW 2013). ACM, New York, NY, USA, 1443-1452
| null |
10.1145/2441776.2441938
| null |
cs.CY cs.HC cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper we examine the information sharing practices of people living
in cities amid armed conflict. We describe the volume and frequency of
microblogging activity on Twitter from four cities afflicted by the Mexican
Drug War, showing how citizens use social media to alert one another and to
comment on the violence that plagues their communities. We then investigate the
emergence of civic media "curators," individuals who act as "war
correspondents" by aggregating and disseminating information to large numbers
of people on social media. We conclude by outlining the implications of our
observations for the design of civic media systems in wartime.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 22:49:09 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Monroy-Hernández",
"Andrés",
""
],
[
"boyd",
"danah",
""
],
[
"Kiciman",
"Emre",
""
],
[
"De Choudhury",
"Munmun",
""
],
[
"Counts",
"Scott",
""
]
] |
new_dataset
| 0.978761 |
1507.01292
|
Andres Monroy-Hernandez
|
Andr\'es Monroy-Hern\'andez
|
ScratchR: Sharing User-generated Programmable Media
|
In Proceedings of the 6th international conference on Interaction
Design and Children (IDC 2007). ACM, New York, NY, USA, 167-168
| null |
10.1145/1297277.1297315
| null |
cs.HC cs.CY cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, I describe a platform for sharing programmable media on the
web called ScratchR. As the backbone of an on-line community of creative
learners, ScratchR will give members access to an audience and inspirational
ideas from each other. ScratchR seeks to support different states of
participation: from passive consumption to active creation. This platform is
being evaluated with a group of middle-school students and a larger community
of beta testers.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 22:56:01 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Monroy-Hernández",
"Andrés",
""
]
] |
new_dataset
| 0.995364 |
1507.01300
|
Andres Monroy-Hernandez
|
Elena Agapie and Andr\'es Monroy-Hern\'andez
|
Eventful: Crowdsourcing Local News Reporting
|
Collective Intelligence Conference 2014, Boston, MA
| null | null | null |
cs.HC cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
We present Eventful, a system for producing news reports of local events
using remote and locative crowd workers. The system recruits and guides novice
crowd workers as they perform the roles of field reporter, curator, or writer.
Field reporters attend the events in person, and use Eventful's mobile web app
to get a personalized mission, submit content, and receive feedback. Missions
include tasks such as taking a photo, and asking a question to an attendee. In
parallel, remote curators approve, reject, and give real-time feedback on the
content collected by field reporters. Finally, writers put together a report by
mashing up and tweaking the content approved by the curators. We used Eventful
to produce a news report for each of the six local events we decided to cover
as we piloted the system. The process was typically completed under an hour and
costing under $150 USD.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2015 23:42:19 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Agapie",
"Elena",
""
],
[
"Monroy-Hernández",
"Andrés",
""
]
] |
new_dataset
| 0.998454 |
1507.01314
|
Andres Monroy-Hernandez
|
Elena L. Glassman, Juho Kim, Andr\'es Monroy-Hern\'andez, Meredith
Ringel Morris
|
Mudslide: A Spatially Anchored Census of Student Confusion for Online
Lecture Videos
|
Best paper honorable mention
|
In Proceedings of the 33rd Annual ACM Conference on Human Factors
in Computing Systems (CHI 2015). ACM, New York, NY, USA, 1555-1564
|
10.1145/2702123.2702304
| null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Educators have developed an effective technique to get feedback after
in-person lectures, called "muddy card." Students are given time to reflect and
write the "muddiest" (least clear) point on an index card, to hand in as they
leave class. This practice of assigning end-of-lecture reflection tasks to
generate explicit student feedback is well suited for adaptation to the
challenge of supporting feedback in online video lectures. We describe the
design and evaluation of Mudslide, a prototype system that translates the
practice of muddy cards into the realm of online lecture videos. Based on an
in-lab study of students and teachers, we find that spatially contextualizing
students' muddy point feedback with respect to particular lecture slides is
advantageous to both students and teachers. We also reflect on further
opportunities for enhancing this feedback method based on teachers' and
students' experiences with our prototype.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 01:04:39 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Glassman",
"Elena L.",
""
],
[
"Kim",
"Juho",
""
],
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Morris",
"Meredith Ringel",
""
]
] |
new_dataset
| 0.985305 |
1507.01318
|
Andres Monroy-Hernandez
|
Juho Kim, Elena L. Glassman, Andr\'es Monroy-Hern\'andez, Meredith
Ringel Morris
|
RIMES: Embedding Interactive Multimedia Exercises in Lecture Videos
| null |
In Proceedings of the 33rd Annual ACM Conference on Human Factors
in Computing Systems (CHI 2015). ACM, New York, NY, USA, 1535-1544
|
10.1145/2702123.2702186
| null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Teachers in conventional classrooms often ask learners to express themselves
and show their thought processes by speaking out loud, drawing on a whiteboard,
or even using physical objects. Despite the pedagogical value of such
activities, interactive exercises available in most online learning platforms
are constrained to multiple-choice and short answer questions. We introduce
RIMES, a system for easily authoring, recording, and reviewing interactive
multimedia exercises embedded in lecture videos. With RIMES, teachers can
prompt learners to record their responses to an activity using video, audio,
and inking while watching lecture videos. Teachers can then review and interact
with all the learners' responses in an aggregated gallery. We evaluated RIMES
with 19 teachers and 25 students. Teachers created a diverse set of activities
across multiple subjects that tested deep conceptual and procedural knowledge.
Teachers found the exercises useful for capturing students' thought processes,
identifying misconceptions, and engaging students with content.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 01:12:47 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Kim",
"Juho",
""
],
[
"Glassman",
"Elena L.",
""
],
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Morris",
"Meredith Ringel",
""
]
] |
new_dataset
| 0.995612 |
1507.01423
|
Francesco Ranzato
|
Francesco Ranzato
|
Abstract Interpretation of Supermodular Games
| null | null | null | null |
cs.GT cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Supermodular games find significant applications in a variety of models,
especially in operations research and economic applications of noncooperative
game theory, and feature pure strategy Nash equilibria characterized as fixed
points of multivalued functions on complete lattices. Pure strategy Nash
equilibria of supermodular games are here approximated by resorting to the
theory of abstract interpretation, a well established and known framework used
for designing static analyses of programming languages. This is obtained by
extending the theory of abstract interpretation in order to handle
approximations of multivalued functions and by providing some methods for
abstracting supermodular games, in order to obtain approximate Nash equilibria
which are shown to be correct within the abstract interpretation framework.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 12:47:52 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Ranzato",
"Francesco",
""
]
] |
new_dataset
| 0.980525 |
1507.01450
|
Torsten Ueckerdt
|
Muhammad Jawaherul Alam, Thomas Bl\"asius, Ignaz Rutter, Torsten
Ueckerdt, Alexander Wolff
|
Pixel and Voxel Representations of Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study contact representations for graphs, which we call pixel
representations in 2D and voxel representations in 3D. Our representations are
based on the unit square grid whose cells we call pixels in 2D and voxels in
3D. Two pixels are adjacent if they share an edge, two voxels if they share a
face. We call a connected set of pixels or voxels a blob. Given a graph, we
represent its vertices by disjoint blobs such that two blobs contain adjacent
pixels or voxels if and only if the corresponding vertices are adjacent. We are
interested in the size of a representation, which is the number of pixels or
voxels it consists of.
We first show that finding minimum-size representations is NP-complete. Then,
we bound representation sizes needed for certain graph classes. In 2D, we show
that, for $k$-outerplanar graphs with $n$ vertices, $\Theta(kn)$ pixels are
always sufficient and sometimes necessary. In particular, outerplanar graphs
can be represented with a linear number of pixels, whereas general planar
graphs sometimes need a quadratic number. In 3D, $\Theta(n^2)$ voxels are
always sufficient and sometimes necessary for any $n$-vertex graph. We improve
this bound to $\Theta(n\cdot \tau)$ for graphs of treewidth $\tau$ and to
$O((g+1)^2n\log^2n)$ for graphs of genus $g$. In particular, planar graphs
admit representations with $O(n\log^2n)$ voxels.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 18:03:48 GMT"
}
] | 2015-07-07T00:00:00 |
[
[
"Alam",
"Muhammad Jawaherul",
""
],
[
"Bläsius",
"Thomas",
""
],
[
"Rutter",
"Ignaz",
""
],
[
"Ueckerdt",
"Torsten",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.998746 |
1111.4949
|
Nabarun Mondal Mr
|
Nabarun Mondal, Partha P. Ghosh
|
Universal Computation Is 'Almost Surely' Chaotic
|
24 pages, 0 figures, paper accepted at "Scientific Online" :
http://www.scipublish.com/journals/AM/papers/1506
| null | null | null |
cs.CC math.DS math.NT nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fixed point iterations are known to generate chaos, for some values in their
parameter range. It is an established fact that Turing Machines are fixed point
iterations. However, as these Machines operate in integer space, the standard
notions of a chaotic system is not readily applicable for them. Changing the
state space of Turing Machines from integer to rational space, the condition
for chaotic dynamics can be suitably established, as presented in the current
paper. Further it is deduced that, given random input, computation performed by
a Universal Turing Machine would be 'almost surely' chaotic.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2011 17:44:09 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Jun 2012 19:14:24 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Jun 2012 16:13:13 GMT"
},
{
"version": "v4",
"created": "Wed, 4 Jul 2012 15:27:50 GMT"
},
{
"version": "v5",
"created": "Fri, 6 Jul 2012 15:57:16 GMT"
},
{
"version": "v6",
"created": "Tue, 17 Jul 2012 17:49:25 GMT"
},
{
"version": "v7",
"created": "Thu, 19 Jul 2012 06:09:17 GMT"
},
{
"version": "v8",
"created": "Fri, 11 Jul 2014 12:32:14 GMT"
},
{
"version": "v9",
"created": "Fri, 3 Jul 2015 19:41:12 GMT"
}
] | 2015-07-06T00:00:00 |
[
[
"Mondal",
"Nabarun",
""
],
[
"Ghosh",
"Partha P.",
""
]
] |
new_dataset
| 0.975055 |
1507.00913
|
Erik Rodner
|
Erik Rodner and Marcel Simon and Gunnar Brehm and Stephanie Pietsch
and J. Wolfgang W\"agele and Joachim Denzler
|
Fine-grained Recognition Datasets for Biodiversity Analysis
|
CVPR FGVC Workshop 2015; dataset available
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the following paper, we present and discuss challenging applications for
fine-grained visual classification (FGVC): biodiversity and species analysis.
We not only give details about two challenging new datasets suitable for
computer vision research with up to 675 highly similar classes, but also
present first results with localized features using convolutional neural
networks (CNN). We conclude with a list of challenging new research directions
in the area of visual classification for biodiversity research.
|
[
{
"version": "v1",
"created": "Fri, 3 Jul 2015 13:53:26 GMT"
}
] | 2015-07-06T00:00:00 |
[
[
"Rodner",
"Erik",
""
],
[
"Simon",
"Marcel",
""
],
[
"Brehm",
"Gunnar",
""
],
[
"Pietsch",
"Stephanie",
""
],
[
"Wägele",
"J. Wolfgang",
""
],
[
"Denzler",
"Joachim",
""
]
] |
new_dataset
| 0.999772 |
1507.00942
|
Alexandra Meliou
|
Matteo Brucato, Rahul Ramakrishna, Azza Abouzied, Alexandra Meliou
|
PackageBuilder: From Tuples to Packages
| null |
PVLDB, vol. 7, no. 13, 2014, pp. 1593-1596
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this demo, we present PackageBuilder, a system that extends database
systems to support package queries. A package is a collection of tuples that
individually satisfy base constraints and collectively satisfy global
constraints. The need for package support arises in a variety of scenarios: For
example, in the creation of meal plans, users are not only interested in the
nutritional content of individual meals (base constraints), but also care to
specify daily consumption limits and control the balance of the entire plan
(global constraints). We introduce PaQL, a declarative SQL-based package query
language, and the interface abstractions which allow users to interactively
specify package queries and easily navigate through their results. To
efficiently evaluate queries, the system employs pruning and heuristics, as
well as state-of-the-art constraint optimization solvers. We demonstrate
PackageBuilder by allowing attendees to interact with the system's interface,
to define PaQL queries and to observe how query evaluation is performed.
|
[
{
"version": "v1",
"created": "Fri, 3 Jul 2015 15:22:57 GMT"
}
] | 2015-07-06T00:00:00 |
[
[
"Brucato",
"Matteo",
""
],
[
"Ramakrishna",
"Rahul",
""
],
[
"Abouzied",
"Azza",
""
],
[
"Meliou",
"Alexandra",
""
]
] |
new_dataset
| 0.999536 |
1507.00956
|
Vadim Bulitko
|
Vadim Bulitko and Jessica Hong and Kumar Kumaran and Ivan Swedberg and
William Thoang and Patrick von Hauff and Georg Schmolzer
|
RETAIN: a Neonatal Resuscitation Trainer Built in an Undergraduate
Video-Game Class
|
10 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Approximately ten percent of newborns require some help with their breathing
at birth. About one percent require extensive assistance at birth which needs
to be administered by trained personnel. Neonatal resuscitation is taught
through a simulation based training program in North America. Such a training
methodology is cost and resource intensive which reduces its availability
thereby adversely impacting skill acquisition and retention. We implement and
present RETAIN (REsuscitation TrAIning for Neonatal residents) -- a video game
to complement the existing neonatal training. Being a video game, RETAIN runs
on ubiquitous off-the-shelf hardware and can be easily accessed by trainees
almost anywhere at their convenience. Thus we expect RETAIN to help trainees
retain and retrain their resuscitation skills. We also report on how RETAIN was
developed by an interdisciplinary team of six undergraduate students as a
three-month term project for a second year university course.
|
[
{
"version": "v1",
"created": "Fri, 3 Jul 2015 15:48:03 GMT"
}
] | 2015-07-06T00:00:00 |
[
[
"Bulitko",
"Vadim",
""
],
[
"Hong",
"Jessica",
""
],
[
"Kumaran",
"Kumar",
""
],
[
"Swedberg",
"Ivan",
""
],
[
"Thoang",
"William",
""
],
[
"von Hauff",
"Patrick",
""
],
[
"Schmolzer",
"Georg",
""
]
] |
new_dataset
| 0.973331 |
1402.0017
|
Christos Kourtellaris
|
Christos K. Kourtellaris, Charalambos D. Charalambous
|
Capacity of Binary State Symmetric Channel with and without Feedback and
Transmission Cost
| null | null |
10.1109/ITW.2015.7133133
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a unit memory channel, called Binary State Symmetric Channel
(BSSC), in which the channel state is the modulo2 addition of the current
channel input and the previous channel output. We derive closed form
expressions for the capacity and corresponding channel input distribution, of
this BSSC with and without feedback and transmission cost. We also show that
the capacity of the BSSC is not increased by feedback, and it is achieved by a
first order symmetric Markov process.
|
[
{
"version": "v1",
"created": "Fri, 31 Jan 2014 22:03:28 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Feb 2015 19:32:48 GMT"
}
] | 2015-07-03T00:00:00 |
[
[
"Kourtellaris",
"Christos K.",
""
],
[
"Charalambous",
"Charalambos D.",
""
]
] |
new_dataset
| 0.959373 |
1507.00557
|
Van Bang Le
|
Van Bang Le and Thomas Podelleck
|
Characterization and recognition of some opposition and coalition graph
classes
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is an opposition graph, respectively, a coalition graph, if it admits
an acyclic orientation which puts the two end-edges of every chordless 4-vertex
path in opposition, respectively, in the same direction. Opposition and
coalition graphs have been introduced and investigated in connection to perfect
graphs. Recognizing and characterizing opposition and coalition graphs are
long-standing open problems. This paper gives characterizations for opposition
graphs and coalition graphs on some restricted graph classes. Implicit in our
arguments are polynomial time recognition algorithms for these graphs. We also
give a good characterization for the so-called generalized opposition graphs.
|
[
{
"version": "v1",
"created": "Thu, 2 Jul 2015 12:50:44 GMT"
}
] | 2015-07-03T00:00:00 |
[
[
"Le",
"Van Bang",
""
],
[
"Podelleck",
"Thomas",
""
]
] |
new_dataset
| 0.99054 |
1507.00646
|
Zhensong Qian
|
Oliver Schulte and Zhensong Qian
|
SQL for SRL: Structure Learning Inside a Database System
|
3 pages, 1 figure, Position Paper of the Fifth International Workshop
on Statistical Relational AI at UAI 2015
| null | null | null |
cs.LG cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The position we advocate in this paper is that relational algebra can provide
a unified language for both representing and computing with
statistical-relational objects, much as linear algebra does for traditional
single-table machine learning. Relational algebra is implemented in the
Structured Query Language (SQL), which is the basis of relational database
management systems. To support our position, we have developed the FACTORBASE
system, which uses SQL as a high-level scripting language for
statistical-relational learning of a graphical model structure. The design
philosophy of FACTORBASE is to manage statistical models as first-class
citizens inside a database. Our implementation shows how our SQL constructs in
FACTORBASE facilitate fast, modular, and reliable program development.
Empirical evidence from six benchmark databases indicates that leveraging
database system capabilities achieves scalable model structure learning.
|
[
{
"version": "v1",
"created": "Thu, 2 Jul 2015 16:07:48 GMT"
}
] | 2015-07-03T00:00:00 |
[
[
"Schulte",
"Oliver",
""
],
[
"Qian",
"Zhensong",
""
]
] |
new_dataset
| 0.997953 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.