OpenRaiser/Intern-Atlas huggingface dataset:
An Approach for Text Steganography Based on Markov Chains
Venue: arXiv cs.MM 2014
Year: 2014

A text steganography method based on Markov chains is introduced, together with a reference implementation. This method allows for information hiding in texts that are automatically generated following a given Markov model. Other Markov - based systems of this kind rely on big simplifications of the language model to work, which produces less natural looking and more easily detectable texts. The method described here is designed to generate texts within a good approximation of the original language model provided.
A Generalized Framework for Ontology-Based Information Retrieval Application to a public-transportation system
Venue: arXiv cs.IR 2014
Year: 2014

In this paper we present a generic framework for ontology-based information retrieval. We focus on the recognition of semantic information extracted from data sources and the mapping of this knowledge into ontology. In order to achieve more scalability, we propose an approach for semantic indexing based on entity retrieval model. In addition, we have used ontology of public transportation domain in order to validate these proposals. Finally, we evaluated our system using ontology mapping and real world data sources. Experiments show that our framework can provide meaningful search results.
Path Relinking for Bandwidth Coloring Problem
Venue: arXiv cs.DM 2014
Year: 2014

A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search based local search procedure. The proposed algorithm is assessed on two sets of 66 benchmark instances commonly used in the literature. Computational results demonstrate that the proposed algorithm is highly competitive in terms of both solution quality and efficiency compared to the best performing algorithms in the literature. Specifically, it improves the previous best known results for 15 out of 66 instances, while matching the previous best known results for 47 cases. Some key elements of the proposed algorithm are investigated.
A Simulation Environment and preliminary evaluation for Automotive CAN-Ethernet AVB Networks
Venue: arXiv cs.NI 2014
Year: 2014

Ethernet is being considered as the backbone network protocol for next-generation automotive control networks. In such networks, Controller Area Network (CAN) messages related to automotive control can be sent from a CAN network to other sub-networks via the backbone Ethernet bus and, if the CAN messages have real-time constraints, these have to be guaranteed. This paper presents a simulation environment for CAN--Ethernet Audio Video Bridging (AVB) mixed networks based on OMNeT++. We use Ethernet AVB, which can guarantee network bandwidth, to improve the real-time property of CAN messages through the backbone Ethernet bus. To simulate the networks, we also developed a CAN--Ethernet AVB gateway (GW) model. To verify the efficacy of our model, we measured the latency of CAN messages sent from a CAN bus to an Ethernet AVB node via the backbone Ethernet AVB bus in both bandwidth-guaranteed and best-effort queue scenarios. The results indicate that the latency of Ethernet AVB frames containing CAN messages is minimized and limited by the bandwidth-guaranteed mechanism of Ethernet AVB.
Evaluating the Electrification of Vehicle Fleets Using the Veins Framework
Venue: arXiv cs.OH 2014
Year: 2014

The case study discussed in this paper involves a company maintaining a vehicle fleet of one hundred vehicles. In this article we will discuss how we extend and deploy the Veins framework, which couples OMNeT++ and SUMO, to help in the process of electrifying this vehicle fleet, i.e., replacing combustion engine cars with electric vehicles to save money and lower CO$_2$ emissions.
Development and Testing of Automotive Ethernet-Networks together in one Tool - OMNeT++
Venue: arXiv cs.NI 2014
Year: 2014

In this paper, the network simulation framework OMNeT++ is used for development and testing of automotive Ethernet-Networks. Therefore OMNeT++ is extended by the INET framework. It is augmented by an implementation of the protocol SOME/IP (-SD) and an connector to the middleware Gamma V. The middleware is used to configure the network by initialization. Additionally data, which is sent over the network, can be changed on the fly. The contribution of this work regards three main aspects: First, the use of OMNeT++ for network development in automotive industry. Second, the employment of an existing simulation model and using it as restbus simulation for Hardware in the Loop (HiL) testing or rapid prototyping. Finally, the implementation of SOME/IP(-SD) into OMNeT++.
Visualizing and Quantifying Impact and Effect in Twitter Narrative using Geometric Data Analysis
Venue: arXiv cs.SI 2014
Year: 2014

We use geometric multivariate data analysis which has been termed a methodology for both the visualization and verbalization of data. The general objectives are data mining and knowledge discovery. In the first case study, we use the narrative surrounding very highly profiled tweets, and thus a Twitter event of significance and importance. In the second case study, we use eight carefully planned Twitter campaigns relating to environmental issues. The aim of these campaigns was to increase environmental awareness and behaviour. Unlike current marketing, political and other communication campaigns using Twitter, we develop an innovative approach to measuring bevavioural change. We show also how we can assess statistical significance of social media behaviour.
Achievable Regions for Interference Channels with Generalized and Intermittent Feedback
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of Han-Kobayash rate splitting and compress-and-forward at the senders. Each sender compresses the channel output that is observes using a compression scheme that is à-la Lim et al. noisy network coding and Avestimeher et al. quantize-map-and-forward. Next, we study an injective deterministic model in which the senders obtain output feedback only intermittently. Specializing the coding scheme of the model with generalized feedback to this scenario, we obtain useful insights onto effective ways of combining noisy network coding with interference alignment techniques. We also apply our results to linear deterministic interference channels with intermittent feedback.
Toward Green Media Delivery: Location-Aware Opportunities and Approaches
Venue: arXiv cs.MM 2014
Year: 2014

Mobile media has undoubtedly become the predominant source of traffic in wireless networks. The result is not only congestion and poor Quality-of-Experience, but also an unprecedented energy drain at both the network and user devices. In order to sustain this continued growth, novel disruptive paradigms of media delivery are urgently needed. We envision that two key contemporary advancements can be leveraged to develop greener media delivery platforms: 1) the proliferation of navigation hardware and software in mobile devices has created an era of location-awareness, where both the current and future user locations can be predicted; and 2) the rise of context-aware network architectures and self-organizing functionalities is enabling context signaling and in-network adaptation. With these developments in mind, this article investigates the opportunities of exploiting location-awareness to enable green end-to-end media delivery. In particular, we discuss and propose approaches for location-based adaptive video quality planning, in-network caching, content prefetching, and long-term radio resource management. To provide insights on the energy savings, we then present a cross-layer framework that jointly optimizes resource allocation and multi-user video quality using location predictions. Finally, we highlight some of the future research directions for location-aware media delivery in the conclusion.
Recommending Scientific Literature: Comparing Use-Cases and Algorithms
Venue: arXiv cs.IR 2014
Year: 2014

An important aspect of a researcher's activities is to find relevant and related publications. The task of a recommender system for scientific publications is to provide a list of papers that match these criteria. Based on the collection of publications managed by Mendeley, four data sets have been assembled that reflect different aspects of relatedness. Each of these relatedness scenarios reflect a user's search strategy. These scenarios are public groups, venues, author publications and user libraries. The first three of these data sets are being made publicly available for other researchers to compare algorithms against. Three recommender systems have been implemented: a collaborative filtering system; a content-based filtering system; and a hybrid of these two systems. Results from testing demonstrate that collaborative filtering slightly outperforms the content-based approach, but fails in some scenarios. The hybrid system, that combines the two recommendation methods, provides the best performance, achieving a precision of up to 70%. This suggests that both techniques contribute complementary information in the context of recommending scientific literature and different approaches suite for different information needs.
A Survey of Bandwidth Optimization Techniques and Patterns in VoIP Services and Applications
Venue: arXiv cs.NI 2014
Year: 2014

This article surveys the various techniques adopted for optimising bandwidth for VoIP services over the period 1999-2014. The improvement of bandwidth can be realized through; silence suppression measure of repressing the silent portions (packets) in a voice conversation using Voice Activity Detection algorithm; by so doing, the transmission rate during the inactive periods of speech is reduced, and thus, the mean transmission rate can be reduced. A second measure is packet header reduction which defines a process of multiplexing and de-multiplexing packet headers to curb excesses. Voice/ Packet Header compression is considered the most productive of all the techniques, offering a scheme where VoIP packets are compressed from the 40 bytes of size to a smaller byte size of 2 bytes. When combined with aggregation, compression potentially yields a compressed size of up to 1 byte. In either case, bandwidth save is reached using compression and decompression codecs of varying data and bit rates. It is envisaged that an improvement in the performance of codecs would yield a better result in terms of enhancing results favourably in Voice over broadband networks
Compute-and-Forward on a Multi-User Multi-Relay Channel
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes an integer-valued linear combination that relates the transmitted messages. Then, it forwards the linear combination towards the destination. Given these linear combinations, the destination may or may not recover the transmitted messages since the linear combinations are not always full rank. Therefore, we propose an algorithm where we optimize the precoding factor at the users such that the probability that the equations are full rank is increased and that the transmission rate is maximized. We show, through some numerical examples, the effectiveness of our algorithm and the advantage of performing precoding allocation at the users. Also, we show that this scheme can outperform standard relaying techniques in certain regimes.
MoodBar: Increasing new user retention in Wikipedia through lightweight socialization
Venue: arXiv cs.SI 2014
Year: 2014

Socialization in online communities allows existing members to welcome and recruit newcomers, introduce them to community norms and practices, and sustain their early participation. However, socializing newcomers does not come for free: in large communities, socialization can result in a significant workload for mentors and is hard to scale. In this study we present results from an experiment that measured the effect of a lightweight socialization tool on the activity and retention of newly registered users attempting to edit for the first time Wikipedia. Wikipedia is struggling with the retention of newcomers and our results indicate that a mechanism to elicit lightweight feedback and to provide early mentoring to newcomers improves their chances of becoming long-term contributors.
A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks
Venue: arXiv cs.NI 2014
Year: 2014

To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of precise sensor placement is compensated by redundant de-ployment of sensor nodes. This redundancy can also be used for extending the lifetime of the network, if a proper scheduling mechanism is available for scheduling the active and sleep times of sensor nodes in such a way that each node is in active mode only if it is required to. In this pa-per, we propose an efficient scheduling method based on learning automata and we called it LAML, in which each node is equipped with a learning automaton, which helps the node to select its proper state (active or sleep), at any given time. To study the performance of the proposed method, computer simulations are conducted. Results of these simulations show that the pro-posed scheduling method can better prolong the lifetime of the network in comparison to similar existing method.
Power Optimal Non-contiguous Spectrum Access in Multi Front End Radio Enabled Point-to-Point Link
Venue: arXiv cs.NI 2014
Year: 2014

Non-contiguous spectrum chunks allow wireless links to flexibly access a wide amount of bandwidth. Multi- Channel Multi-Radio (MC-MR) and Non-Contiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) are the two commercially viable strategies to access non-contiguous spectrum chunks. MC-MR accesses multiple non-contiguous chunks by activating multiple front ends which, in turn, increases the circuit power consumption of each of the activated front ends. NC-OFDM accesses non-contiguous spectrum chunks with a single front end by nulling remaining subchannels but increases spectrum span which, in turn, increases the power consumption of ADC and DAC. This work focuses on a point-to-point link where transmitter and receiver have multiple front ends and can employ NC-OFDM technology. We investigate optimal spectrum fragmentation in each front end from a system power (summation of transmit power and circuit power) perspective. We formulate a mixed integer non-linear program (MINLP) to perform power control and scheduling, and minimize system power by providing a greedy algorithm (O(M^3 I)) where M and I denote the number of channels and radio front ends respectively.
Optimizing ETL Dataflow Using Shared Caching and Parallelization Methods
Venue: arXiv cs.DB 2014
Year: 2014

Extract-Transform-Load (ETL) handles large amount of data and manages workload through dataflows. ETL dataflows are widely regarded as complex and expensive operations in terms of time and system resources. In order to minimize the time and the resources required by ETL dataflows, this paper presents a framework to optimize dataflows using shared cache and parallelization techniques. The framework classifies the components in an ETL dataflow into different categories based on their data operation properties. The framework then partitions the dataflow based on the classification at different granularities. Furthermore, the framework applies optimization techniques such as cache re-using, pipelining and multi-threading to the already-partitioned dataflows. The proposed techniques reduce system memory footprint and the frequency of copying data between different components, and also take full advantage of the computing power of multi-core processors. The experimental results show that the proposed optimization framework is 4.7 times faster than the ordinary ETL dataflows (without using the proposed optimization techniques), and outperforms the similar tool (Kettle).
Generalization of Mrs. Gerber's Lemma
Venue: arXiv cs.IT 2014
Year: 2014

Mrs. Gerber's Lemma (MGL) hinges on the convexity of $H(p*H^{-1}(u))$, where $H(u)$ is the binary entropy function. In this work, we prove that $H(p*f(u))$ is convex in $u$ for every $p\in [0,1]$ provided $H(f(u))$ is convex in $u$, where $f(u) : (a, b) \to [0, \frac12]$. Moreover, our result subsumes MGL and simplifies the original proof. We show that the generalized MGL can be applied in binary broadcast channel to simplify some discussion.
New polynomial case for efficient domination in $P_6$-free graphs
Venue: arXiv cs.DM 2014
Year: 2014

In a graph $G$, an {\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {\textsc{Efficient Dominating Set}} problem (EDS) asks for the existence of an efficient dominating set in a given graph $G$. The EDS is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the EDS problem is unknown for $P_6$-free graphs. In this paper, we show that the EDS problem can be solved in polynomial time for a subclass of $P_6$-free graphs, namely ($P_6$, banner)-free graphs.
A Tale of Three Runtimes
Venue: arXiv cs.DC 2014
Year: 2014

This contribution discusses the automatic generation of event-driven, tuple-space based programs for task-oriented execution models from a sequential C specification. We developed a hierarchical mapping solution using auto-parallelizing compiler technology to target three different runtimes relying on event-driven tasks (EDTs). Our solution benefits from the important observation that loop types encode short, transitive relations among EDTs that are compact and efficiently evaluated at runtime. In this context, permutable loops are of particular importance as they translate immediately into conservative point-to-point synchronizations of distance 1. Our solution generates calls into a runtime-agnostic C++ layer, which we have retargeted to Intel's Concurrent Collections (CnC), ETI's SWARM, and the Open Community Runtime (OCR). Experience with other runtime systems motivates our introduction of support for hierarchical async-finishes in CnC. Experimental data is provided to show the benefit of automatically generated code for EDT-based runtimes as well as comparisons across runtimes.
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
Venue: arXiv cs.FL 2014
Year: 2014

A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets, as it has been conjectured by Martyugin (2011).
Detectability of distributed consensus-based observer networks: An elementary analysis and extensions
Venue: arXiv cs.SY 2014
Year: 2014

This paper continues the study of local detectability and observability requirements on components of distributed observers networks to ensure detectability properties of the network. First, we present a sketch of an elementary proof of the known result equating the multiplicity of the zero eigenvalue of the Laplace matrix of a digraph to the number of its maximal reachable subgraphs. Unlike the existing algebraic proof, we use a direct analysis of the graph topology. This result is then used in the second part of the paper to extend our previous results which connect the detectability of an observer network with corresponding local detectability and observability properties of its node observers. The proposed extension allows for nonidentical matrices to be used in the interconnections.
Multi-Parametric Extremum Seeking-based Auto-Tuning for Robust Input-Output Linearization Control
Venue: arXiv cs.SY 2014
Year: 2014

We study in this paper the problem of iterative feedback gains tuning for a class of nonlinear systems. We consider Input-Output linearizable nonlinear systems with additive uncertainties. We first design a nominal Input-Output linearization-based controller that ensures global uniform boundedness of the output tracking error dynamics. Then, we complement the robust controller with a model-free multi-parametric extremum seeking (MES) control to iteratively auto-tune the feedback gains. We analyze the stability of the whole controller, i.e. robust nonlinear controller plus model-free learning algorithm. We use numerical tests to demonstrate the performance of this method on a mechatronics example.
Computational models of consumer confidence from large-scale online attention data: crowd-sourcing econometrics
Venue: arXiv cs.CY 2014
Year: 2014

Economies are instances of complex socio-technical systems that are shaped by the interactions of large numbers of individuals. The individual behavior and decision-making of consumer agents is determined by complex psychological dynamics that include their own assessment of present and future economic conditions as well as those of others, potentially leading to feedback loops that affect the macroscopic state of the economic system. We propose that the large-scale interactions of a nation's citizens with its online resources can reveal the complex dynamics of their collective psychology, including their assessment of future system states. Here we introduce a behavioral index of Chinese Consumer Confidence (C3I) that computationally relates large-scale online search behavior recorded by Google Trends data to the macroscopic variable of consumer confidence. Our results indicate that such computational indices may reveal the components and complex dynamics of consumer psychology as a collective socio-economic phenomenon, potentially leading to improved and more refined economic forecasting.
GUI system for Elders/Patients in Intensive Care
Venue: arXiv cs.HC 2014
Year: 2014

In the old age, few people need special care if they are suffering from specific diseases as they can get stroke while they are in normal life routine. Also patients of any age, who are not able to walk, need to be taken care of personally but for this, either they have to be in hospital or someone like nurse should be with them for better care. This is costly in terms of money and man power. A person is needed for 24x7 care of these people. To help in this aspect we purposes a vision based system which will take input from the patient and will provide information to the specified person, who is currently may not in the patient room. This will reduce the need of man power, also a continuous monitoring would not be needed. The system is using MS Kinect for gesture detection for better accuracy and this system can be installed at home or hospital easily. The system provides GUI for simple usage and gives visual and audio feedback to user. This system work on natural hand interaction and need no training before using and also no need to wear any glove or color strip.
Analysis of factors that affect the students academic performance - Data Mining Approach
Venue: arXiv cs.CY 2014
Year: 2014

Analysis of factors that affect students academic performance - Data Mining Approach