25,043 research outputs found
Zero-Shot Learning for Semantic Utterance Classification
We propose a novel zero-shot learning method for semantic utterance
classification (SUC). It learns a classifier for problems where
none of the semantic categories are present in the training set. The
framework uncovers the link between categories and utterances using a semantic
space. We show that this semantic space can be learned by deep neural networks
trained on large amounts of search engine query log data. More precisely, we
propose a novel method that can learn discriminative semantic features without
supervision. It uses the zero-shot learning framework to guide the learning of
the semantic features. We demonstrate the effectiveness of the zero-shot
semantic learning algorithm on the SUC dataset collected by (Tur, 2012).
Furthermore, we achieve state-of-the-art results by combining the semantic
features with a supervised method
Implementation of CAVENET and its usage for performance evaluation of AODV, OLSR and DYMO protocols in vehicular networks
Vehicle Ad-hoc Network (VANET) is a kind of Mobile Ad-hoc Network (MANET) that establishes wireless connection between cars. In VANETs and MANETs, the topology of the network changes very often, therefore implementation of efficient routing protocols is very important problem. In MANETs, the Random Waypoint (RW) model is used as a simulation model for generating node mobility pattern. On the other hand, in VANETs, the mobility patterns of nodes is restricted along the roads, and is affected by the movement of neighbour nodes. In this paper, we present a simulation system for VANET called CAVENET (Cellular Automaton based VEhicular NETwork). In CAVENET, the mobility patterns of nodes are generated by an 1-dimensional cellular automata. We improved CAVENET and implemented some routing protocols. We investigated the performance of the implemented routing protocols by CAVENET. The simulation results have shown that DYMO protocol has better performance than AODV and OLSR protocols.Peer ReviewedPostprint (published version
Compositional coding capsule network with k-means routing for text classification
Text classification is a challenging problem which aims to identify the
category of texts. Recently, Capsule Networks (CapsNets) are proposed for image
classification. It has been shown that CapsNets have several advantages over
Convolutional Neural Networks (CNNs), while, their validity in the domain of
text has less been explored. An effective method named deep compositional code
learning has been proposed lately. This method can save many parameters about
word embeddings without any significant sacrifices in performance. In this
paper, we introduce the Compositional Coding (CC) mechanism between capsules,
and we propose a new routing algorithm, which is based on k-means clustering
theory. Experiments conducted on eight challenging text classification datasets
show the proposed method achieves competitive accuracy compared to the
state-of-the-art approach with significantly fewer parameters
An Efficient Monte Carlo-based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System
Incorporating speed probability distribution to the computation of the route
planning in car navigation systems guarantees more accurate and precise
responses. In this paper, we propose a novel approach for dynamically selecting
the number of samples used for the Monte Carlo simulation to solve the
Probabilistic Time-Dependent Routing (PTDR) problem, thus improving the
computation efficiency. The proposed method is used to determine in a proactive
manner the number of simulations to be done to extract the travel-time
estimation for each specific request while respecting an error threshold as
output quality level. The methodology requires a reduced effort on the
application development side. We adopted an aspect-oriented programming
language (LARA) together with a flexible dynamic autotuning library (mARGOt)
respectively to instrument the code and to take tuning decisions on the number
of samples improving the execution efficiency. Experimental results demonstrate
that the proposed adaptive approach saves a large fraction of simulations
(between 36% and 81%) with respect to a static approach while considering
different traffic situations, paths and error requirements. Given the
negligible runtime overhead of the proposed approach, it results in an
execution-time speedup between 1.5x and 5.1x. This speedup is reflected at
infrastructure-level in terms of a reduction of around 36% of the computing
resources needed to support the whole navigation pipeline
- …