OpenRaiser/Intern-Atlas huggingface dataset:
Stochastic Geometry-Based Performance Bounds for Non-Fading and Rayleigh Fading Ad Hoc Networks
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we study the performance of non-fading and Rayleigh fading ad hoc networks. We first characterize the distribution of the signal-to-interference-plus-noise ratio (SINR) through the Laplace transform of the inverted SINR for non-fading channels. Since most communication systems are interference-limited, we also consider the case of negligible noise power, and derive the upper and lower bounds for the signal-to-interference ratio (SIR) distribution under both non-fading and fading cases. These bounds are of closed forms and thus more convenient for theoretical analysis. Based on these derivations, we obtain closed-form bounds for both the average Shannon and outage rates. We also leverage the above results to study partial fading ad-hoc systems. These results are useful for investigating and comparing fifth-generation communication systems, for example massive multi-antenna and small-cell networks as in our illustrative example.
Numerical Study on Secrecy Capacity and Code Length Dependence of the Performances in Optical Wiretap Channels
Venue: arXiv cs.IT 2015
Year: 2015

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on on-off keying modulation under typical conditions met in satellite-ground links. It is shown that under reasonable degraded conditions on a wiretapper, information theoretically secure communications should be possible in a much wider distance range than a range limit of quantum key distribution, enabling secure optical links between geostationary earth orbit satellites and ground stations with currently available technologies. We also provide the upper bounds on the decoding error probability and the leaked information to estimate a necessary code length for given required levels of performances. This result ensures that a reasonable length wiretap channel code for our proposed scheme must exist.
A systematic literature review on process model testing: Approaches, challenges, and research directions
Venue: arXiv cs.SE 2015
Year: 2015

Testing is a key concern when developing process-oriented solutions as it supports modeling experts who have to deal with increasingly complex models and scenarios such as cross-organizational processes. However, the complexity of the research landscape and the diverse set of approaches and goals impedes the analysis and advancement of research and the identification of promising research areas, challenges, and research directions. Hence, a systematic literature review is conducted to identify interesting areas for future research and to provide an overview of existing work. Over 6300 potentially matching publications were determined during the search (literature databases, selected conferences\journals, and snowballing). Finally, 153 publications from 2002 to 2013 were selected, analyzed, and classified. It was found that the software engineering domain has influenced process model testing approaches (e.g., regarding terminology and concepts), but recent publications are presenting independent approaches. Additionally, historical data sources are not exploited to their full potential and current testing related publications frequently contain evaluations of relatively weak quality. Overall, the publication landscape is unevenly distributed so that over 31 publications concentrate on test-case generation but only 4 publications conduct performance test. Hence, the full potential of such insufficiently covered testing areas is not exploited. This systematic review provides a comprehensive overview of the interdisciplinary topic of process model testing. Several open research questions are identified, for example, how to apply testing to cross-organizational or legacy processes and how to adequately include users into the testing methods.
An Iterative Abstraction Algorithm for Reactive Correct-by-Construction Controller Synthesis
Venue: arXiv cs.SY 2015
Year: 2015

In this paper, we consider the problem of synthesizing correct-by-construction controllers for discrete-time dynamical systems. A commonly adopted approach in the literature is to abstract the dynamical system into a Finite Transition System (FTS) and thus convert the problem into a two player game between the environment and the system on the FTS. The controller design problem can then be solved using synthesis tools for general linear temporal logic or generalized reactivity(1) specifications. In this article, we propose a new abstraction algorithm. Instead of generating a single FTS to represent the system, we generate two FTSs, which are under- and over-approximations of the original dynamical system. We further develop an iterative abstraction scheme by exploiting the concept of winning sets, i.e., the sets of states for which there exists a winning strategy for the system. Finally, the efficiency of the new abstraction algorithm is illustrated by numerical examples.
Emerging trends on the topic of Information Technology in the field of Educational Sciences: a bibliometric exploration
Venue: arXiv cs.DL 2015
Year: 2015

The paper presents a bibliometric analysis on the topic of Information Technology (IT) in the field of Educational Sciences, aimed at envisioning the research emerging trends. The ERIC data base is used as a consultation source; the results were subjected to productivity by authors, journals, and term co-occurrence analysis indicators for the period 2009-2013. The productivity of Computers & Education, and Turkish Online Journal of Educational Technology-TOJET, as well as the preceding authors from Canada, have been emphasized. The more used terms are the following: Information technology, foreign countries, educational technology, technology integration, and student attitudes. Researches performed here seem to have a largely qualitative character, highlighting computers and internet as the mostly explored technological objects. The largest subject matter trend refers to the integration of IT in the higher education learning context, and its incidence over the teaching methods.
Power Interference Modeling for CSMA/CA based Networks using Directional Antenna
Venue: arXiv cs.NI 2015
Year: 2015

In IEEE 802.11 based wireless networks adding more access points does not always guarantee an increase of network capacity. In some cases, additional access points may contribute to degrade the aggregated network throughput as more interference is introduced. This paper characterizes the power interference in CSMA/CA based networks consisting of nodes using directional antenna. The severity of the interference is quantized via an improved form of the Attacking Case metric as the original form of this metric was developed for nodes using omnidirectional antenna. The proposed metric is attractive because it considers nodes using directional or omnidirectional antenna, and it enables the quantization of interference in wireless networks using multiple transmission power schemes. The improved Attacking Case metric is useful to study the aggregated throughput of IEEE 802.11 based networks; reducing Attacking Case probably results in an increase of aggregated throughput. This reduction can be implemented using strategies such as directional antenna, transmit power control, or both.
Nicht-propositionales Wissen aus Literaturlektüre und Bedingungen seiner Darstellbarkeit in Wikipedia-Einträgen zu literarischen Werken
Venue: arXiv cs.CY 2015
Year: 2015

(English title) Wikipedia entries on fiction: Under what terms is it possible to report about non-propositional knowledge gained from reading? Given that Wikipedia entries are likely to extert a strong influence on how literary texts are perceived - due to their preferential ranking in Google - there is some demand that research dealing with the transfer of knowledge on literature to the public be more concerned with looking into both the content that is available for free on the Web and any aspect that may come with writing about literature for free. This contribution argues from within Wikipedia's multidisciplinary consensus-driven space in which propositional knowledge is given priority that it would be essential for entries on fiction to present non-propositional knowledge as being one of its hallmarks. For this aim, a special concept is developed that is designed to function as the study's formal object: "Erlesnis" (which in German is a pun that combines "Erlebnis" - adventure experience - and "lesen" - reading). It is defined as non-propositional knowledge that has been acquired in an individual reading process. Writing about one's own Erlesnis in new ways is being tried out in four essays, and on de.wikipedia.org an experiment is conducted to find out what community members think about the idea of including, in entries on fiction, sections specifically designed to report about what people felt like when reading a certain text. Finally, a draft typology of Erlesnis-writing is suggested. This contribution is the first of its kind internationally to deal with Wikipedia from the point of view of transfer of knowledge on literature to the public. For the theory of this field of research some new aspects are offered for debate.
Twitter Sentiment Analysis
Venue: arXiv cs.CL 2015
Year: 2015

This project addresses the problem of sentiment analysis in twitter; that is classifying tweets according to the sentiment expressed in them: positive, negative or neutral. Twitter is an online micro-blogging and social-networking platform which allows users to write short status updates of maximum length 140 characters. It is a rapidly expanding service with over 200 million registered users - out of which 100 million are active users and half of them log on twitter on a daily basis - generating nearly 250 million tweets per day. Due to this large amount of usage we hope to achieve a reflection of public sentiment by analysing the sentiments expressed in the tweets. Analysing the public sentiment is important for many applications such as firms trying to find out the response of their products in the market, predicting political elections and predicting socioeconomic phenomena like stock exchange. The aim of this project is to develop a functional classifier for accurate and automatic sentiment classification of an unknown tweet stream.
Parareal convergence for 2D unsteady flow around a cylinder
Venue: arXiv cs.CE 2015
Year: 2015

In this technical report we study the convergence of Parareal for 2D incompressible flow around a cylinder for different viscosities. Two methods are used as fine integrator: backward Euler and a fractional step method. It is found that Parareal converges better for the implicit Euler, likely because it under-resolves the fine-scale dynamics as a result of numerical diffusion.
Evolution of structure of some binary group based n bit comparator, n-to-2n decoder by reversible technique
Venue: arXiv cs.ET 2015
Year: 2015

Reversible logic has attracted substantial interest due to its low power consumption which is the main concern of low power VLSI circuit design. In this paper, a novel 4x4 reversible gate called inventive gate has been introduced and using this gate 1-bit, 2-bit, 8-bit, 32-bit and n-bit group-based reversible comparator have been constructed with low value of reversible parameters. The MOS transistor realizations of 1-bit, 2- bit, and 8-bit of reversible comparator are also presented and finding power, delay and power delay product (PDP) with appropriate aspect ratio W/L. Novel inventive gate has the ability to use as an n-to-2n decoder. Different proposed novel reversible circuit design style is compared with the existing ones. The relative results shows that the novel reversible gate wide utility, group-based reversible comparator outperforms the present design style in terms of number of gates, garbage outputs and constant input.
Stable Nash Equilibria in the Gale-Shapley Matching Game
Venue: arXiv cs.DS 2015
Year: 2015

In this article we study the stable marriage game induced by the men-proposing Gale-Shapley algorithm. Our setting is standard: all the lists are complete and the matching mechanism is the men-proposing Gale-Shapley algorithm. It is well known that in this setting, men cannot cheat, but women can. In fact, Teo, Sethuraman and Tan \cite{TST01}, show that there is a polynomial time algorithm to obtain, for a given strategy (the set of all lists) $Q$ and a woman $w$, the best partner attainable by changing her list. However, what if the resulting matching is not stable with respect to $Q$? Obviously, such a matching would be vulnerable to further manipulation, but is not mentioned in \cite{TST01}. In this paper, we consider (safe) manipulation that implies a stable matching in a most general setting. Specifically, our goal is to decide for a given $Q$, if w can manipulate her list to obtain a strictly better partner with respect to the true strategy $P$ (which may be different from $Q$), and also the outcome is a stable matching for $P$.
A Methodology for Discovering how to Adaptively Personalize to Users using Experimental Comparisons
Venue: arXiv cs.HC 2015
Year: 2015

We explain and provide examples of a formalism that supports the methodology of discovering how to adapt and personalize technology by combining randomized experiments with variables associated with user models. We characterize a formal relationship between the use of technology to conduct A/B experiments and use of technology for adaptive personalization. The MOOClet Formalism [11] captures the equivalence between experimentation and personalization in its conceptualization of modular components of a technology. This motivates a unified software design pattern that enables technology components that can be compared in an experiment to also be adapted based on contextual data, or personalized based on user characteristics. With the aid of a concrete use case, we illustrate the potential of the MOOClet formalism for a methodology that uses randomized experiments of alternative micro-designs to discover how to adapt technology based on user characteristics, and then dynamically implements these personalized improvements in real time.
Analyzing structural characteristics of object category representations from their semantic-part distributions
Venue: arXiv cs.CV 2015
Year: 2015

Studies from neuroscience show that part-mapping computations are employed by human visual system in the process of object recognition. In this work, we present an approach for analyzing semantic-part characteristics of object category representations. For our experiments, we use category-epitome, a recently proposed sketch-based spatial representation for objects. To enable part-importance analysis, we first obtain semantic-part annotations of hand-drawn sketches originally used to construct the corresponding epitomes. We then examine the extent to which the semantic-parts are present in the epitomes of a category and visualize the relative importance of parts as a word cloud. Finally, we show how such word cloud visualizations provide an intuitive understanding of category-level structural trends that exist in the category-epitome object representations.
Jamming aided Generalized Data Attacks: Exposing Vulnerabilities in Secure Estimation
Venue: arXiv cs.CR 2015
Year: 2015

Jamming refers to the deletion, corruption or damage of meter measurements that prevents their further usage. This is distinct from adversarial data injection that changes meter readings while preserving their utility in state estimation. This paper presents a generalized attack regime that uses jamming of secure and insecure measurements to greatly expand the scope of common 'hidden' and 'detectable' data injection attacks in literature. For 'hidden' attacks, it is shown that with jamming, the optimal attack is given by the minimum feasible cut in a specific weighted graph. More importantly, for 'detectable' data attacks, this paper shows that the entire range of relative costs for adversarial jamming and data injection can be divided into three separate regions, with distinct graph-cut based constructions for the optimal attack. Approximate algorithms for attack design are developed and their performances are demonstrated by simulations on IEEE test cases. Further, it is proved that prevention of such attacks require security of all grid measurements. This work comprehensively quantifies the dual adversarial benefits of jamming: (a) reduced attack cost and (b) increased resilience to secure measurements, that strengthen the potency of data attacks.
Self-Configuring and Evolving Fuzzy Image Thresholding
Venue: arXiv cs.CV 2015
Year: 2015

Every segmentation algorithm has parameters that need to be adjusted in order to achieve good results. Evolving fuzzy systems for adjustment of segmentation parameters have been proposed recently (Evolving fuzzy image segmentation -- EFIS [1]. However, similar to any other algorithm, EFIS too suffers from a few limitations when used in practice. As a major drawback, EFIS depends on detection of the object of interest for feature calculation, a task that is highly application-dependent. In this paper, a new version of EFIS is proposed to overcome these limitations. The new EFIS, called self-configuring EFIS (SC-EFIS), uses available training data to auto-configure the parameters that are fixed in EFIS. As well, the proposed SC-EFIS relies on a feature selection process that does not require the detection of a region of interest (ROI).
Fast Template Matching by Subsampled Circulant Matrix
Venue: arXiv cs.DS 2015
Year: 2015

Template matching is widely used for many applications in image and signal processing and usually is time-critical. Traditional methods usually focus on how to reduce the search locations by coarse-to-fine strategy or full search combined with pruning strategy. However, the computation cost of those methods is easily dominated by the size of signal N instead of that of template K. This paper proposes a probabilistic and fast matching scheme, which computation costs requires O(N) additions and O(K \log K) multiplications, based on cross-correlation. The nuclear idea is to first downsample signal, which size becomes O(K), and then subsequent operations only involves downsampled signals. The probability of successful match depends on cross-correlation between signal and the template. We show the sufficient condition for successful match and prove that the probability is high for binary signals with K^2/log K >= O(N). The experiments shows this proposed scheme is fast and efficient and supports the theoretical results.
Recurrent Neural Networks for Driver Activity Anticipation via Sensory-Fusion Architecture
Venue: arXiv cs.CV 2015
Year: 2015

Anticipating the future actions of a human is a widely studied problem in robotics that requires spatio-temporal reasoning. In this work we propose a deep learning approach for anticipation in sensory-rich robotics applications. We introduce a sensory-fusion architecture which jointly learns to anticipate and fuse information from multiple sensory streams. Our architecture consists of Recurrent Neural Networks (RNNs) that use Long Short-Term Memory (LSTM) units to capture long temporal dependencies. We train our architecture in a sequence-to-sequence prediction manner, and it explicitly learns to predict the future given only a partial temporal context. We further introduce a novel loss layer for anticipation which prevents over-fitting and encourages early anticipation. We use our architecture to anticipate driving maneuvers several seconds before they happen on a natural driving data set of 1180 miles. The context for maneuver anticipation comes from multiple sensors installed on the vehicle. Our approach shows significant improvement over the state-of-the-art in maneuver anticipation by increasing the precision from 77.4% to 90.5% and recall from 71.2% to 87.4%.
Problem of optimization of a transport traffic at preliminary registration of queires with use of CBSMAP-model
Venue: arXiv cs.OH 2015
Year: 2015

The problem of optimization of a transport traffic at preliminary registration of demands with use of the CBSMAP model is investigated. For the solution of an objective application of the queueing theory and the theory of controlled processes is supposed.
Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences
Venue: arXiv cs.CV 2015
Year: 2015

Let $t_1,\ldots,t_{n_l} \in \mathbb{R}^d$ and $p_1,\ldots,p_{n_s} \in \mathbb{R}^d$ and consider the bipartite location recovery problem: given a subset of pairwise direction observations $\{(t_i - p_j) / \|t_i - p_j\|_2\}_{i,j \in [n_l] \times [n_s]}$, where a constant fraction of these observations are arbitrarily corrupted, find $\{t_i\}_{i \in [n_ll]}$ and $\{p_j\}_{j \in [n_s]}$ up to a global translation and scale. We study the recently introduced ShapeFit algorithm as a method for solving this bipartite location recovery problem. In this case, ShapeFit consists of a simple convex program over $d(n_l + n_s)$ real variables. We prove that this program recovers a set of $n_l+n_s$ i.i.d. Gaussian locations exactly and with high probability if the observations are given by a bipartite Erdős-Rényi graph, $d$ is large enough, and provided that at most a constant fraction of observations involving any particular location are adversarially corrupted. This recovery theorem is based on a set of deterministic conditions that we prove are sufficient for exact recovery. Finally, we propose a modified pipeline for the Structure for Motion problem, based on this bipartite location recovery problem.
Out of vocabulary words decrease, running texts prevail and hashtags coalesce: Twitter as an evolving sociolinguistic system
Venue: arXiv cs.SI 2015
Year: 2015

Twitter is one of the most popular social media. Due to the ease of availability of data, Twitter is used significantly for research purposes. Twitter is known to evolve in many aspects from what it was at its birth; nevertheless, how it evolved its own linguistic style is still relatively unknown. In this paper, we study the evolution of various sociolinguistic aspects of Twitter over large time scales. To the best of our knowledge, this is the first comprehensive study on the evolution of such aspects of this OSN. We performed quantitative analysis both on the word level as well as on the hashtags since it is perhaps one of the most important linguistic units of this social media. We studied the (in)formality aspects of the linguistic styles in Twitter and find that it is neither fully formal nor completely informal; while on one hand, we observe that Out-Of-Vocabulary words are decreasing over time (pointing to a formal style), on the other hand it is quite evident that whitespace usage is getting reduced with a huge prevalence of running texts (pointing to an informal style). We also analyze and propose quantitative reasons for repetition and coalescing of hashtags in Twitter. We believe that such phenomena may be strongly tied to different evolutionary aspects of human languages.