OpenRaiser/Intern-Atlas huggingface dataset:
HYBRIST Mobility Model- A Novel Hybrid Mobility Model for VANET Simulations
Venue: arXiv cs.NI 2014
Year: 2014

Simulations play a vital role in implementing, testing and validating proposed algorithms and protocols in VANET. Mobility model, defined as the movement pattern of vehicles, is one of the main factors that contribute towards the efficient implementation of VANET algorithms and protocols. Using near reality mobility models ensure that accurate results are obtained from simulations. Mobility models that have been proposed and used to implement and test VANET protocols and algorithms are either the urban mobility model or highway mobility model. Algorithms and protocols implemented using urban or highway mobility models may not produce accurate results in hybrid mobility models without enhancement due to the vast differences in mobility patterns. It is on this score the Hybrist, a novel hybrid mobility model is proposed. The realistic mobility pattern trace file of the proposed Hybrist hybrid mobility model can be imported to VANET simulators such as Veins and network simulators such as ns2 and Qualnet to simulate VANET algorithms and protocols.
Block-Structured Supermarket Models
Venue: arXiv cs.PF 2014
Year: 2014

Supermarket models are a class of parallel queueing networks with an adaptive control scheme that play a key role in the study of resource management of, such as, computer networks, manufacturing systems and transportation networks. When the arrival processes are non-Poisson and the service times are non-exponential, analysis of such a supermarket model is always limited, interesting, and challenging. This paper describes a supermarket model with non-Poisson inputs: Markovian Arrival Processes (MAPs) and with non-exponential service times: Phase-type (PH) distributions, and provides a generalized matrix-analytic method which is first combined with the operator semigroup and the mean-field limit. When discussing such a more general supermarket model, this paper makes some new results and advances as follows: (1) Providing a detailed probability analysis for setting up an infinite-dimensional system of differential vector equations satisfied by the expected fraction vector, where "the invariance of environment factors" is given as an important result. (2) Introducing the phase-type structure to the operator semigroup and to the mean-field limit, and a Lipschitz condition can be obtained by means of a unified matrix-differential algorithm. (3) The matrix-analytic method is used to compute the fixed point which leads to performance computation of this system. Finally, we use some numerical examples to illustrate how the performance measures of this supermarket model depend on the non-Poisson inputs and on the non-exponential service times. Thus the results of this paper give new highlight on understanding influence of non-Poisson inputs and of non-exponential service times on performance measures of more general supermarket models.
Using Mobile Agents for Information Retrival in B2B Systems
Venue: arXiv cs.IR 2014
Year: 2014

This paper presents an architecture of an information retrieval system that use the advantages offered by mobile agents to collect information from different sources and bring the result to the calling user. Mobile agent technology will be used for determine the traceability of a product and also for searching information about a specific entity.
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
Venue: arXiv cs.LO 2014
Year: 2014

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there exist finite binary relations that can be substituted for the relation names so that $e$ evaluates to a nonempty result. This result already holds in restriction to expressions that mention just a single relation name, and where the difference operator can be nested at most once.
Simulation and Virtual Prototyping of Tangible User Interfaces
Venue: arXiv cs.HC 2014
Year: 2014

Prototyping is an important part in research and development of tangible user interfaces (TUIs). On the way from the idea to a working prototype, new hardware prototypes usually have to be crafted repeatedly in numerous iterations. This brings us to think about virtual prototypes that exhibit the same functionality as a real TUI, but reduce the amount of time and resources that have to be spent. Building upon existing open-source software - the middleware Robot Operating System (ROS) and the 3D simulator Gazebo - we have created a toolkit that can be used for developing and testing fully functional implementations of a tangible user interface as a virtual device. The entire interaction between the TUI and other hardware and software components is controlled by the middleware, while the human interaction with the TUI can be explored using the 3D simulator and 3D input/output technologies. We argue that by simulating parts of the hardware-software co-design process, the overall development effort can be reduced.
Automatic Recognition of Dyslalia Affecting Pre-Scholars
Venue: arXiv cs.CY 2014
Year: 2014

This article describes the recognition part of a system that will be used for personalized therapy of dyslalia affecting pre scholars. Dyslalia is a speech disorder that affect pronunciation of one ore many sounds. The full system targets interdisciplinary research (computer science, psychology, electronics) - having as main objective the development of methods, models, algorithms, System on Chip architectures with regards to the elaboration and implementation of a complete system addressing the therapy of dyslalia affecting pre scholars, in a personalized and user centered manner. The system addresses the number of 10% of children with age between 4 and 7 that, according to the statistics, present different variations of speech impairments. Although these impairments do not create major difficulties concerning common communication, it has been noticed that problems are likely to appear affecting negatively the child's personality as well as his social environment.
Multimodal vs. Unimodal Physiological Control in Videogames for Enhanced Realism and Depth
Venue: arXiv cs.HC 2014
Year: 2014

(arXiv abridged abstract) In the last two decades, videogames have evolved in a nearly explosive way from the pixelated graphics to today's near-realistic 3D environments. The interaction devices traditionally used in videogames have not evolved with the same intensity, but recent HCI studies have explored biofeedback interaction - the explicit manipulation of a person's physiological data as input to a system - as an alternative to them. Traditional biofeedback prototypes apply 1 sensor to each game mechanic (unimodality). In this dissertation, we introduce the combination of 2 physiological sensors simultaneously per game mechanic (multimodality) and present a First-Person Shooter game comprised of 8 game mechanics with three interaction flavours (no biofeedback/vanilla, unimodal and multimodal). An empirical study with 32 regular players was employed to explore and study differences between the three interaction types and where they can be best employed. Players compared the three games in terms of Fun, Ease of Use, Originality, Playability and Favourite Condition. For the sake of completeness, other evaluation methods were used as well: IMI Questionnaire, keywords association and open-ended commentaries. The vanilla version was considered easier to use, but both biofeedback versions were considered the most fun. Both versions were praised differently: the unimodal version for its simplicity of use, and the multimodal for its realism, activation safety of game mechanics and depth added to the game. Our conclusion is that multimodal biofeedback can have a relevant impact in terms of added depth, depending on the way it is used inside the game. On a boundary case, it can be used to increase the feeling of empowerment on the player when using certain abilities, or to intentionally make in-game actions more difficult by demanding more physical effort from the player.
Hierarchical Comprehensive Triangular Decomposition
Venue: arXiv cs.SC 2014
Year: 2014

The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC'2007 paper and could be viewed as an analogue of comprehensive Grobner systems for parametric polynomial systems. The first complete algorithm for computing CTD was also proposed in that paper and implemented in the RegularChains library in Maple. Following our previous work on generic regular decomposition for parametric polynomial systems, we introduce in this paper a so-called hierarchical strategy for computing CTDs. Roughly speaking, for a given parametric system, the parametric space is divided into several sub-spaces of different dimensions and we compute CTDs over those sub-spaces one by one. So, it is possible that, for some benchmarks, it is difficult to compute CTDs in reasonable time while this strategy can obtain some "partial" solutions over some parametric sub-spaces. The program based on this strategy has been tested on a number of benchmarks from the literature. Experimental results on these benchmarks with comparison to RegularChains are reported and may be valuable for developing more efficient triangularization tools.
Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle?
Venue: arXiv cs.LO 2014
Year: 2014

When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL system, and we have produced verified code for combinatorial Vickrey auctions. A fundamental question in this was how to represent some basic concepts: since set theory is available inside Isabelle/HOL, when introducing new definitions there is often the issue of balancing the amount of set-theoretical objects and of objects expressed using entities which are more typical of higher order logic such as functions or lists. Likewise, a user has often to answer the question whether to use a constructive or a non-constructive definition. Such decisions have consequences for the proof development and the usability of the formalization. For instance, sets are usually closer to the representation that economists would use and recognize, while the other objects are closer to the extraction of computational content. In this paper we give examples of the advantages and disadvantages for these approaches and their relationships. In addition, we present the corresponding Isabelle library of definitions and theorems, most prominently those dealing with relations and quotients.
Subspace Methods for Data Attack on State Estimation: A Data Driven Approach
Venue: arXiv cs.CR 2014
Year: 2014

Data attacks on state estimation modify part of system measurements such that the tempered measurements cause incorrect system state estimates. Attack techniques proposed in the literature often require detailed knowledge of system parameters. Such information is difficult to acquire in practice. The subspace methods presented in this paper, on the other hand, learn the system operating subspace from measurements and launch attacks accordingly. Conditions for the existence of an unobservable subspace attack are obtained under the full and partial measurement models. Using the estimated system subspace, two attack strategies are presented. The first strategy aims to affect the system state directly by hiding the attack vector in the system subspace. The second strategy misleads the bad data detection mechanism so that data not under attack are removed. Performance of these attacks are evaluated using the IEEE 14-bus network and the IEEE 118-bus network.
From algebra to logic: there and back again -- the story of a hierarchy
Venue: arXiv cs.FL 2014
Year: 2014

This is an extended survey of the results concerning a hierarchy of languages that is tightly connected with the quantifier alternation hierarchy within the two-variable fragment of first order logic of the linear order.
A Methodology for Empirical Analysis of LOD Datasets
Venue: arXiv cs.AI 2014
Year: 2014

CoCoE stands for Complexity, Coherence and Entropy, and presents an extensible methodology for empirical analysis of Linked Open Data (i.e., RDF graphs). CoCoE can offer answers to questions like: Is dataset A better than B for knowledge discovery since it is more complex and informative?, Is dataset X better than Y for simple value lookups due its flatter structure?, etc. In order to address such questions, we introduce a set of well-founded measures based on complementary notions from distributional semantics, network analysis and information theory. These measures are part of a specific implementation of the CoCoE methodology that is available for download. Last but not least, we illustrate CoCoE by its application to selected biomedical RDF datasets.
An Innovative Wireless Cardiac Rhythm Management (iCRM) System
Venue: arXiv cs.CE 2014
Year: 2014

In this paper, we propose a wireless Communicator to manage and enhance a Cardiac Rhythm Management System. The system includes: (1) an on-body wireless Electrocardiogram (ECG), (2) an Intracardiac Electrogram (EGM) embedded inside an Implantable Cardioverter/Defibrillator, and (3) a Communicator (with a resident Learning System). The first two devices are existing technology available in the market and are emulated using data from the Physionet database, while the Communicator was designed and implemented by our research team. The value of the information obtained by combining the information supplied by (1) and (2), presented to the Communicator, improves decision making regarding use of the actuator or other actions. Preliminary results show a high level of confidence in the decisions made by the Communicator. For example, excellent accuracy is achieved in predicting atrial arrhythmia in 8 patients using only external ECG when we used a neural network.
Timing Analysis for DAG-based and GFP Scheduled Tasks
Venue: arXiv cs.DC 2014
Year: 2014

Modern embedded systems have made the transition from single-core to multi-core architectures, providing performance improvement via parallelism rather than higher clock frequencies. DAGs are considered among the most generic task models in the real-time domain and are well suited to exploit this parallelism. In this paper we provide a schedulability test using response-time analysis exploiting exploring and bounding the self interference of a DAG task. Additionally we bound the interference a high priority task has on lower priority ones.
On Covert Acoustical Mesh Networks in Air
Venue: arXiv cs.CR 2014
Year: 2014

Covert channels can be used to circumvent system and network policies by establishing communications that have not been considered in the design of the computing system. We construct a covert channel between different computing systems that utilizes audio modulation/demodulation to exchange data between the computing systems over the air medium. The underlying network stack is based on a communication system that was originally designed for robust underwater communication. We adapt the communication system to implement covert and stealthy communications by utilizing the ultrasonic frequency range. We further demonstrate how the scenario of covert acoustical communication over the air medium can be extended to multi-hop communications and even to wireless mesh networks. A covert acoustical mesh network can be conceived as a meshed botnet or malnet that is accessible via inaudible audio transmissions. Different applications of covert acoustical mesh networks are presented, including the use for remote keylogging over multiple hops. It is shown that the concept of a covert acoustical mesh network renders many conventional security concepts useless, as acoustical communications are usually not considered. Finally, countermeasures against covert acoustical mesh networks are discussed, including the use of lowpass filtering in computing systems and a host-based intrusion detection system for analyzing audio input and output in order to detect any irregularities.
Basis Identification for Automatic Creation of Pronunciation Lexicon for Proper Names
Venue: arXiv cs.CL 2014
Year: 2014

Development of a proper names pronunciation lexicon is usually a manual effort which can not be avoided. Grapheme to phoneme (G2P) conversion modules, in literature, are usually rule based and work best for non-proper names in a particular language. Proper names are foreign to a G2P module. We follow an optimization approach to enable automatic construction of proper names pronunciation lexicon. The idea is to construct a small orthogonal set of words (basis) which can span the set of names in a given database. We propose two algorithms for the construction of this basis. The transcription lexicon of all the proper names in a database can be produced by the manual transcription of only the small set of basis words. We first construct a cost function and show that the minimization of the cost function results in a basis. We derive conditions for convergence of this cost function and validate them experimentally on a very large proper name database. Experiments show the transcription can be achieved by transcribing a set of small number of basis words. The algorithms proposed are generic and independent of language; however performance is better if the proper names have same origin, namely, same language or geographical region.
Algorithmes dynamiques pour la communication dans le réseau ad hoc Coloration des graphes
Venue: arXiv cs.DM 2014
Year: 2014

Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph coloring is a tool to characterize the graphs. In our study, we were interested in particular in the coloring of vertex. In this domain, a large number of parameters of coloring were defined. A coloring for which two neighboring summits do not have same color is called proper coloring. We proposed to evaluate two other parameters vertex coloring maximizing the number of colors to use: b-chromatic number and especially the number of Grundy. These studies have focused on two types of graphs, which are the powers graphs and Cartesian sum of graphs. In the first part, we determined borders among Grundy for the Cartesian sum of graphs and finally we proposed algorithms for the coloration of graphs. First of all, we gave some properties and results for simple graphs (stable, chain, cycle, full, star, bipartisan). Secondly, we studied the Cartesian sum of two graphs by giving exact values of the number of Grundy for diverse classes of graphs (sum of a chain and a chain, a chain and a cycle, a cycle and a cycle) then we estimated borders of this parameter for the sum of a complete graph and any other graph. In the second part, we presented the results of the Cartesian sum of several graphs and in the last part; we also gave an algorithm for generating graphs with a given number of Grundy. Thereafter, we studied another parameter namely the partial coloring Grundy. The properties of this parameter are close to those of total Grundy. Finally, we used parameters of coloring total Grundy and partial Grundy to generate algorithms of coloring of graphs. We proposed algorithms of coloring basing on the properties of certain graphs.
Understanding Types of Users on Twitter
Venue: arXiv cs.SI 2014
Year: 2014

People use microblogging platforms like Twitter to involve with other users for a wide range of interests and practices. Twitter profiles run by different types of users such as humans, bots, spammers, businesses and professionals. This research work identifies six broad classes of Twitter users, and employs a supervised machine learning approach which uses a comprehensive set of features to classify users into the identified classes. For this purpose, we exploit users' profile and tweeting behavior information. We evaluate our approach by performing 10-fold cross validation using manually annotated 716 different Twitter profiles. High classification accuracy (measured using AUC, and precision, recall) reveals the significance of the proposed approach.
Intégration des règles actives dans des documents
Venue: arXiv cs.DB 2014
Year: 2014

The management of technical documentation is an unavoidable activity interesting for the enterprises. Indeed, the need to manage documents during all the life cycle is an important issue. For that, the need to enhance the ability of document management systems is an interesting challenge. Despite existing systems on market (electronic document management systems), they are considered as non-flexible systems which are based on data models preventing any extension or improvement. In addition, those systems do not allow a slight description of documents elements and propose an insufficient mechanisms for both links and consistency management. LIRIS laboratory has developed research in this area and proposed an active system, termed SAGED, whose objectives is to manage link and consistency using active rules. However SAGED is based on an approach that split rules (for consistency management) and documents description. The main drawback is the rigidity of such approach which is highlighted whenever documents are moved from one server to another or during exchanges of documents. To contribute to solve this problem, we propose to develop an approach aiming at improve the document management including consistency. This approach is based on the introduction of rules with the XML description of the documents [BoCP01]. In this context we proposed a XML-oriented storage level allowing the storing of documents and rules uniformly through a native XML database. We defined an intelligent system termed SIGED according a client/server architecture built around an intelligent component for active rules execution. These rules are extracted from XML document, compiled and executed.
On the Performance of Non-Orthogonal Multiple Access in 5G Systems with Randomly Deployed Users
Venue: arXiv cs.IT 2014
Year: 2014

In this letter, the performance of non-orthogonal multiple access (NOMA) is investigated in a cellular downlink scenario with randomly deployed users. The developed analytical results show that NOMA can achieve superior performance in terms of ergodic sum rates; however, the outage performance of NOMA depends critically on the choices of the users' targeted data rates and allocated power. In particular, a wrong choice of the targeted data rates and allocated power can lead to a situation in which the user's outage probability is always one, i.e. the user's targeted quality of service will never be met.