OpenRaiser/Intern-Atlas huggingface dataset:
The category of networks of ontologies
Venue: arXiv cs.AI 2014
Year: 2014

The semantic web has led to the deployment of ontologies on the web connected through various relations and, in particular, alignments of their vocabularies. There exists several semantics for alignments which make difficult interoperation between different interpretation of networks of ontologies. Here we present an abstraction of these semantics which allows for defining the notions of closure and consistency for networks of ontologies independently from the precise semantics. We also show that networks of ontologies with specific notions of morphisms define categories of networks of ontologies.
Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics
Venue: arXiv cs.IT 2014
Year: 2014

In this work we consider the problem of recovering an ensemble of Diracs on the sphere from its projection onto spaces of spherical harmonics. We show that under an appropriate separation condition on the unknown locations of the Diracs, the ensemble can be recovered through Total Variation norm minimization. The proof of the uniqueness of the solution uses the method of `dual' interpolating polynomials and is based on [8], where the theory was developed for trigonometric polynomials. We also show that in the special case of non-negative ensembles, a sparsity condition is sufficient for exact recovery.
Optimization of Software Quality Using Management and Technical Review Techniques
Venue: arXiv cs.SE 2014
Year: 2014

Optimizing the quality of software is a function of the degree of reviews made during the early life of a software development process. Reviews detect errors and potential errors early in the software development process. The errors detected during the early life cycle of software are least expensive to correct. Efficient involvement in software inspections and technical reviews, help developers improve their own skills, thereby mitigating the occurrence of errors in the later stage of software development process. The ideas gathered on this paper point that a properly implemented program of technical and management reviews drastically reduces the time as well as the cost required for testing, debugging, and reworking, and dramatically improves the quality of the resulting product. This paper, Optimization of Software Quality using management and technical Review Techniques, provides its readers with the opportunity to learn about and experience using this indispensable software quality tools.
Personal Multi-threading
Venue: arXiv cs.OH 2014
Year: 2014

Multi-threading allows agents to pursue a heterogeneous collection of tasks in an orderly manner. The view of multi-threading that emerges from thread algebra is applied to the case where a single agent, who may be human, maintains a hierarchical multithread as an architecture of its own activities.
A necessary and sufficient condition for a graph $G$, which satisfies the equality $μ_{21}(G)=|V(G)|$
Venue: arXiv cs.DM 2014
Year: 2014

A necessary and sufficient condition is found for a graph $G$, which satisfies the equality $μ_{21}(G)=|V(G)|$.
Handover Management in Highly Dense Femtocellular Networks
Venue: arXiv cs.NI 2014
Year: 2014

For dense femtocells, intelligent integrated femtocell/macrocell network architecture, a neighbor cell list with a minimum number of femtocells, effective call admission control (CAC), and handover processes with proper signaling are the open research issues. An appropriate traffic model for the integrated femtocell/macrocell network is also not yet developed. In this paper, we present the major issue of mobility management for the integrated femtocell/macrocell network. We propose a novel algorithm to create a neighbor cell list with a minimum, but appropriate, number of cells for handover. We also propose detailed handover procedures and a novel traffic model for the integrated femtocell/macrocell network. The proposed CAC effectively handles various calls. The numerical and simulation results show the importance of the integrated femtocell/macrocell network and the performance improvement of the proposed schemes. Our proposed schemes for dense femtocells will be very effective for those in research and industry to implement.
Bounded-Rate Multi-Mode Systems Based Motion Planning
Venue: arXiv cs.LO 2014
Year: 2014

Bounded-rate multi-mode systems are hybrid systems that can switch among a finite set of modes. Its dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. Given an arbitrary piecewise linear trajectory, we study the problem of following the trajectory with arbitrary precision, using motion primitives given as bounded-rate multi-mode systems. We give an algorithm to solve the problem and show that the problem is co-NP complete. We further prove that the problem can be solved in polynomial time for multi-mode systems with fixed dimension. We study the problem with dwell-time requirement and show the decidability of the problem under certain positivity restriction on the rate vectors. Finally, we show that introducing structure to the multi-mode systems leads to undecidability, even when using only a single clock variable.
Object Recognition Using Deep Neural Networks: A Survey
Venue: arXiv cs.CV 2014
Year: 2014

Recognition of objects using Deep Neural Networks is an active area of research and many breakthroughs have been made in the last few years. The paper attempts to indicate how far this field has progressed. The paper briefly describes the history of research in Neural Networks and describe several of the recent advances in this field. The performances of recently developed Neural Network Algorithm over benchmark datasets have been tabulated. Finally, some the applications of this field have been provided.
ILCR: Item-based Latent Factors for Sparse Collaborative Retrieval
Venue: arXiv cs.IR 2014
Year: 2014

Interactions between search and recommendation have recently attracted significant attention, and several studies have shown that many potential applications involve with a joint problem of producing recommendations to users with respect to a given query, termed $Collaborative$ $Retrieval$ (CR). Successful algorithms designed for CR should be potentially flexible at dealing with the sparsity challenges since the setup of collaborative retrieval associates with a given $query$ $\times$ $user$ $\times$ $item$ tensor instead of traditional $user$ $\times$ $item$ matrix. Recently, several works are proposed to study CR task from users' perspective. In this paper, we aim to sufficiently explore the sophisticated relationship of each $query$ $\times$ $user$ $\times$ $item$ triple from items' perspective. By integrating item-based collaborative information for this joint task, we present an alternative factorized model that could better evaluate the ranks of those items with sparse information for the given query-user pair. In addition, we suggest to employ a recently proposed scalable ranking learning algorithm, namely BPR, to optimize the state-of-the-art approach, $Latent$ $Collaborative$ $Retrieval$ model, instead of the original learning algorithm. The experimental results on two real-world datasets, (i.e. \emph{Last.fm}, \emph{Yelp}), demonstrate the efficiency and effectiveness of our proposed approach.
CITlab ARGUS for historical handwritten documents
Venue: arXiv cs.CV 2014
Year: 2014

We describe CITlab's recognition system for the HTRtS competition attached to the 14. International Conference on Frontiers in Handwriting Recognition, ICFHR 2014. The task comprises the recognition of historical handwritten documents. The core algorithms of our system are based on multi-dimensional recurrent neural networks (MDRNN) and connectionist temporal classification (CTC). The software modules behind that as well as the basic utility technologies are essentially powered by PLANET's ARGUS framework for intelligent text recognition and image processing.
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Venue: arXiv cs.SC 2014
Year: 2014

Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is competitive with previously known sparse interpolation algorithms that work over an arbitrary finite field, and provides an improvement when there are a large number of variables.
Exponential Approximation of Multivariate Bandlimited Functions from Average Oversampling
Venue: arXiv cs.IT 2014
Year: 2014

Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an exponentially-decaying approximation error to reconstruct a multivariate bandlimited function from its finite average oversampling data. The key problem in our analysis is how to extend a function so that its Fourier transform decays at an optimal rate to zero at infinity.
On Order-independent Semantics of the Similarity Group-By Relational Database Operator
Venue: arXiv cs.DB 2014
Year: 2014

Similarity group-by (SGB, for short) has been proposed as a relational database operator to match the needs of emerging database applications. Many SGB operators that extend SQL have been proposed in the literature, e.g., similarity operators in the one-dimensional space. These operators have various semantics. Depending on how these operators are implemented, some of the implementations may lead to different groupings of the data. Hence, if SQL code is ported from one database system to another, it is not guaranteed that the code will produce the same results. In this paper, we investigate the various semantics for the relational similarity group-by operators in the multi-dimensional space. We define the class of order-independent SGB operators that produce the same results regardless of the order in which the input data is presented to them. Using the notion of interval graphs borrowed from graph theory, we prove that, for certain SGB operators, there exist order-independent implementations. For each of these operators, we provide a sample algorithm that is order-independent. Also, we prove that for other SGB operators, there does not exist an order-independent implementation for them, and hence these SGB operators are ill-defined and should not be adopted in extensions to SQL to realize similarity group-by. In this paper, we introduce an SGB operator, namely SGB-All, for grouping multi-dimensional data using similarity. SGB-All forms groups such that a data item, say O, belongs to a group, say G, if and only if O is within a user-defined threshold from all other data items in G. In other words, each group in SGB-All forms a clique of nearby data items in the multi-dimensional space. We prove that SGB-All are order-independent, i.e., there is at least one algorithm for each option that is independent of the presentation order of the input data.
Handover Call Admission Control for Mobile Femtocells with Free-Space Optical and Macrocellular Backbone Networks
Venue: arXiv cs.NI 2014
Year: 2014

The deployment of mobile femtocellular networks can enhance the service quality for the users inside the vehicles. The deployment of mobile femtocells generates a lot of handover calls. Also, numbers of group handover scenarios are found in mobile femtocellular network deployment. The ability to seamlessly switch between the femtocells and the macrocell networks is a key concern for femtocell network deployment. However, until now there is no effective and complete handover scheme for the mobile femtocell network deployment. Also handover between the backhaul networks is a major concern for the mobile femtocellular network deployment. In this paper, we propose handover control between the access networks for the individual handover cases. Call flows for the handover between the backhaul networks of the macrocell-to-macrocell case are proposed in this paper. We also propose the link switching for the FSO based backhaul networks. The proposed resource allocation scheme ensures the negligible handover call dropping probability as well as higher bandwidth utilization.
Priority based Bandwidth Adaptation for Multi-class Traffic in Wireless Networks
Venue: arXiv cs.NI 2014
Year: 2014

The bandwidth adaptation is the technique that allows the flexibility in bandwidth allocation for a call. Using the bandwidth adaptation technique, the number of call admission in the system can be increased significantly. In this paper we propose a priority based bandwidth adaptation scheme that can release multi-level of bandwidth from the existing calls to accept call requests. The amount of released bandwidth is based on the number of existing bandwidth adaptive calls and the priority of requesting traffic call. This priority scheme does not reduce the bandwidth utilization. Moreover, the proposed bandwidth adaptation strategy provides significantly reduced call blocking probability for the higher priority traffic calls. The performance analyses show the improvement of the proposed scheme.
Dafny: Statically Verifying Functional Correctness
Venue: arXiv cs.PL 2014
Year: 2014

This report presents the Dafny language and verifier, with a focus on describing the main features of the language, including pre- and postconditions, assertions, loop invariants, termination metrics, quantifiers, predicates and frames. Examples of Dafny code are provided to illustrate the use of each feature, and an overview of how Dafny translates programming code into a mathematical proof of functional verification is presented. The report also includes references to useful resources on Dafny, with mentions of related works in the domain of specification languages.
Tools for Terminology Processing
Venue: arXiv cs.CY 2014
Year: 2014

Automatic terminology processing appeared 10 years ago when electronic corpora became widely available. Such processing may be statistically or linguistically based and produces terminology resources that can be used in a number of applications : indexing, information retrieval, technology watch, etc. We present the tools that have been developed in the IRIN Institute. They all take as input texts (or collection of texts) and reflect different states of terminology processing: term acquisition, term recognition and term structuring.
Domotic Embedded System
Venue: arXiv cs.OH 2014
Year: 2014

This paper presents an original domotic embedded system for room temperature monitoring. The OpenRemote is the main software interface between the user and the system, but other software components and communication protocols are used, such as 1-Wire protocol for temperature monitoring devices, RS-232 for the central PC unit and OWFS software for remote control using Android mobile devices. The system architecture consists in hardware and software components to remote control a room temperature parameter for energy efficiency increasing.
Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses
Venue: arXiv cs.AI 2014
Year: 2014

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. More specifically, we establish complexities of the conjunctive query entailment problem for classes of existential rules (also called tuple-generating dependencies, Datalog+/- rules, or forall-exists-rules. Our contribution is twofold. First, we introduce the class of greedy bounded-treewidth sets (gbts) of rules, which covers guarded rules, and their most well-known generalizations. We provide a generic algorithm for query entailment under gbts, which is worst-case optimal for combined complexity with or without bounded predicate arity, as well as for data complexity and query complexity. Secondly, we classify several gbts classes, whose complexity was unknown, with respect to combined complexity (with both unbounded and bounded predicate arity) and data complexity to obtain a comprehensive picture of the complexity of existential rule fragments that are based on diverse guardedness notions. Upper bounds are provided by showing that the proposed algorithm is optimal for all of them.
Are Clouds Ready to Accelerate Ad hoc Financial Simulations?
Venue: arXiv cs.DC 2014
Year: 2014

Applications employed in the financial services industry to capture and estimate a variety of risk metrics are underpinned by stochastic simulations which are data, memory and computationally intensive. Many of these simulations are routinely performed on production-based computing systems. Ad hoc simulations in addition to routine simulations are required to obtain up-to-date views of risk metrics. Such simulations are currently not performed as they cannot be accommodated on production clusters, which are typically over committed resources. Scalable, on-demand and pay-as-you go Virtual Machines (VMs) offered by the cloud are a potential platform to satisfy the data, memory and computational constraints of the simulation. However, "Are clouds ready to accelerate ad hoc financial simulations?" The research reported in this paper aims to experimentally verify this question by developing and deploying an important financial simulation, referred to as 'Aggregate Risk Analysis' on the cloud. Parallel techniques to improve efficiency and performance of the simulations are explored. Challenges such as accommodating large input data on limited memory VMs and rapidly processing data for real-time use are surmounted. The key result of this investigation is that Aggregate Risk Analysis can be accommodated on cloud VMs. Acceleration of up to 24x using multiple hardware accelerators over the implementation on a single accelerator, 6x over a multiple core implementation and approximately 60x over a baseline implementation was achieved on the cloud. However, computational time is wasted for every dollar spent on the cloud due to poor acceleration over multiple virtual cores. Interestingly, private VMs can offer better performance than public VMs on comparable underlying hardware.
Experimental Report on Setting up a Cloud Computing Environment at the University of Bradford
Venue: arXiv cs.DC 2014
Year: 2014

Cloud computing is increasingly attracting large attention in computing both in academic research and in industrial initiatives. Emerging as a popular paradigm and an attractive model of providing computing, information technology (IT) infrastructure, network and storage to large and small enterprises both in private and public sectors. This project was initiated and aimed at designing and Setting up a basic Cloud lab Testbed running on Open stack under Virtual box for experiments and Hosting Cloud Platforms in the networking laboratory at the University of Bradford. This report presents the methodology of setting up a cloud lab testbed for experiment running on open stack. Current resources, in the Networking lab at the university were used and turned into virtual platforms for cloud computing testing. This report serves as a practical guideline, concentrating on the practical infrastructure related questions and issues, on setting up a cloud lab for testing and proof of concept. Finally the report proposes an experimental validation showing feasibility of migrating to cloud. The primary focus of this report is to provide a brief background on different theoretical concepts of cloud computing, particularly virtualisation, and then it elaborates on the practical aspects concerning the setup and implementation of a Cloud lab test bed using open source solutions. This reports serves as a reference for institutions looking at the possibilities of implementing cloud solutions, in order to benefit from getting the basics and a view on the different aspects of cloud migration concepts.
A Broadcast News Corpus for Evaluation and Tuning of German LVCSR Systems
Venue: arXiv cs.CL 2014
Year: 2014

Transcription of broadcast news is an interesting and challenging application for large-vocabulary continuous speech recognition (LVCSR). We present in detail the structure of a manually segmented and annotated corpus including over 160 hours of German broadcast news, and propose it as an evaluation framework of LVCSR systems. We show our own experimental results on the corpus, achieved with a state-of-the-art LVCSR decoder, measuring the effect of different feature sets and decoding parameters, and thereby demonstrate that real-time decoding of our test set is feasible on a desktop PC at 9.2% word error rate.
Rule-based Emotion Detection on Social Media: Putting Tweets on Plutchik's Wheel
Venue: arXiv cs.CL 2014
Year: 2014

We study sentiment analysis beyond the typical granularity of polarity and instead use Plutchik's wheel of emotions model. We introduce RBEM-Emo as an extension to the Rule-Based Emission Model algorithm to deduce such emotions from human-written messages. We evaluate our approach on two different datasets and compare its performance with the current state-of-the-art techniques for emotion detection, including a recursive auto-encoder. The results of the experimental study suggest that RBEM-Emo is a promising approach advancing the current state-of-the-art in emotion detection.
Fair anonymity for the Tor network
Venue: arXiv cs.CR 2014
Year: 2014

Current anonymizing networks have become an important tool for guaranteeing users' privacy. However, these platforms can be used to perform illegitimate actions, which sometimes makes service providers see traffic coming from these networks as a probable threat. In order to solve this problem, we propose to add support for fairness mechanisms to the Tor network. Specifically, by introducing a slight modification to the key negotiation process with the entry and exit nodes, in the shape of group signatures. By means of these signatures, we set up an access control method to prevent misbehaving users to make use of the Tor network. Additionally, we establish a predefined method for denouncing illegitimate actions, which impedes the application of the proposed fairness mechanisms as a threat eroding users' privacy. As a direct consequence, traffic coming from Tor would be considered less suspicious by service providers.
Experimental economics for web mining
Venue: arXiv cs.CE 2014
Year: 2014

This paper offers a step towards research infrastructure, which makes data from experimental economics efficiently usable for analysis of web data. We believe that regularities of human behavior found in experimental data also emerge in real world web data. A format for data from experiments is suggested, which enables its publication as open data. Once standardized datasets of experiments are available on-line, web mining can take advantages from this data. Further, the questions about the order of causalities arisen from web data analysis can inspire new experiment setups.