OpenRaiser/Intern-Atlas huggingface dataset:
An empirical study of passive 802.11 Device Fingerprinting
Venue: arXiv cs.CR 2014
Year: 2014

802.11 device fingerprinting is the action of characterizing a target device through its wireless traffic. This results in a signature that may be used for identification, network monitoring or intrusion detection. The fingerprinting method can be active by sending traffic to the target device, or passive by just observing the traffic sent by the target device. Many passive fingerprinting methods rely on the observation of one particular network feature, such as the rate switching behavior or the transmission pattern of probe requests. In this work, we evaluate a set of global wireless network parameters with respect to their ability to identify 802.11 devices. We restrict ourselves to parameters that can be observed passively using a standard wireless card. We evaluate these parameters for two different tests: i) the identification test that returns one single result being the closest match for the target device, and ii) the similarity test that returns a set of devices that are close to the target devices. We find that the network parameters transmission time and frame inter-arrival time perform best in comparison to the other network parameters considered. Finally, we focus on inter-arrival times, the most promising parameter for device identification, and show its dependency from several device characteristics such as the wireless card and driver but also running applications.
Parallel Gaussian Networks with a Common State-Cognitive Helper
Venue: arXiv cs.IT 2014
Year: 2014

A class of state-dependent parallel networks with a common state-cognitive helper, in which $K$ transmitters wish to send $K$ messages to their corresponding receivers over $K$ state-corrupted parallel channels, and a helper who knows the state information noncausally wishes to assist these receivers to cancel state interference. Furthermore, the helper also has its own message to be sent simultaneously to its corresponding receiver. Since the state information is known only to the helper, but not to the corresponding transmitters $1,\dots,K$, transmitter-side state cognition and receiver-side state interference are mismatched. Our focus is on the high state power regime, i.e., the state power goes to infinity. Three (sub)models are studied. Model I serves as a basic model, which consists of only one transmitter-receiver (with state corruption) pair in addition to a helper that assists the receiver to cancel state in addition to transmitting its own message. Model II consists of two transmitter-receiver pairs in addition to a helper, and only one receiver is interfered by a state sequence. Model III generalizes model I include multiple transmitter-receiver pairs with each receiver corrupted by independent state. For all models, inner and outer bounds on the capacity region are derived, and comparison of the two bounds leads to characterization of either full or partial boundary of the capacity region under various channel parameters.
Digital Repository of Mathematical Formulae
Venue: arXiv cs.DL 2014
Year: 2014

The purpose of the NIST Digital Repository of Mathematical Formulae (DRMF) is to create a digital compendium of mathematical formulae for orthogonal polynomials and special functions (OPSF) and of associated mathematical data. The DRMF addresses needs of working mathematicians, physicists and engineers: providing a platform for publication and interaction with OPSF formulae on the web. Using MediaWiki extensions and other existing technology (such as software and macro collections developed for the NIST Digital Library of Mathematical Functions), the DRMF acts as an interactive web domain for OPSF formulae. Whereas Wikipedia and other web authoring tools manifest notions or descriptions as first class objects, the DRMF does that with mathematical formulae. See http://gw32.iu.xsede.org/index.php/Main_Page.
Interference Mitigating Satellite Broadcast Receiver using Reduced Complexity List-Based Detection in Correlated Noise
Venue: arXiv cs.IT 2014
Year: 2014

The recent commercial trends towards using smaller dish antennas for satellite receivers, and the growing density of broadcasting satellites, necessitate the application of robust adjacent satellite interference (ASI) cancellation schemes. This orbital density growth along with the wider beamwidth of a smaller dish have imposed an overloaded scenario at the satellite receiver, where the number of transmitting satellites exceeds the number of receiving elements at the dish antenna. To ensure successful operation in this practical scenario, we propose a satellite receiver that enhances signal detection from the desired satellite by mitigating the interference from neighboring satellites. Towards this objective, we propose a reduced complexity list-based group-wise search detection (RC-LGSD) receiver under the assumption of spatially correlated additive noise. To further enhance detection performance, the proposed satellite receiver utilizes a newly designed whitening filter to remove the spatial correlation amongst the noise parameters, while also applying a preprocessor that maximizes the signal-to-interference-plus-noise ratio (SINR). Extensive simulations under practical scenarios show that the proposed receiver enhances the performance of satellite broadcast systems in the presence of ASI compared to existing methods.
E-books and Graphics with LaTeXML
Venue: arXiv cs.DL 2014
Year: 2014

Marked by the highlights of native generation of EPUB E-books and TikZ support for creating SVG images, we present an annual report of LaTeXML development in 2013. LaTeXML provides a reimplementation of the $\TeX$ parser, geared towards preserving macro semantics; it supports an array of output formats, notably HTML5, EPUB, XHTML and its own $\LaTeX$-near XML. Other highlights include enhancing performance when used inside high-throughput build-systems, via incorporating a native ZIP archive workflow, as well as a simplified installation procedure that now allows to deploy LaTeXML as a cloud service. To this end, we also introduce an official plugin-based scheme for publishing new features that go beyond the core scope of LaTeXML, such as web services or unconventional post-processors. The software suite has now migrated to GitHub and we welcome forks and patches from the wider FLOSS community.
NNexus Reloaded
Venue: arXiv cs.DL 2014
Year: 2014

Interlinking knowledge is one of the cornerstones of online collaboration. While wiki systems typically rely on links supplied by authors, in the early 2000s the mathematics encyclopedia at PlanetMath.org introduced a feature that provides automatic linking for previously defined concepts. The NNexus software suite was developed to support the necessary subtasks of concept indexing, concept discovery and link-annotation. In this paper, we describe our recent reimplementation and revisioning of the NNexus system.
Asymptotic Deployment Gain: A Simple Approach to Characterize the SINR Distribution in General Cellular Networks
Venue: arXiv cs.IT 2014
Year: 2014

In cellular network models, the base stations are usually assumed to form a lattice or a Poisson point process (PPP). In reality, however, they are deployed neither fully regularly nor completely randomly. Accordingly, in this paper, we consider the very general class of motion-invariant models and analyze the behavior of the outage probability (the probability that the signal-to-interference-plus-noise-ratio (SINR) is smaller than a threshold) as the threshold goes to zero. We show that, remarkably, the slope of the outage probability (in dB) as a function of the threshold (also in dB) is the same for essentially all motion-invariant point processes. The slope merely depends on the fading statistics. Using this result, we introduce the notion of the asymptotic deployment gain (ADG), which characterizes the horizontal gap between the success probabilities of the PPP and another point process in the high-reliability regime (where the success probability is near 1). To demonstrate the usefulness of the ADG for the characterization of the SINR distribution, we investigate the outage probabilities and the ADGs for different point processes and fading statistics by simulations.
A Decomposition Algorithm for Nested Resource Allocation Problems
Venue: arXiv cs.DS 2014
Year: 2014

We propose an exact polynomial algorithm for a resource allocation problem with convex costs and constraints on partial sums of resource consumptions, in the presence of either continuous or integer variables. No assumption of strict convexity or differentiability is needed. The method solves a hierarchy of resource allocation subproblems, whose solutions are used to convert constraints on sums of resources into bounds for separate variables at higher levels. The resulting time complexity for the integer problem is $O(n \log m \log (B/n))$, and the complexity of obtaining an $ε$-approximate solution for the continuous case is $O(n \log m \log (B/ε))$, $n$ being the number of variables, $m$ the number of ascending constraints (such that $m < n$), $ε$ a desired precision, and $B$ the total resource. This algorithm attains the best-known complexity when $m = n$, and improves it when $\log m = o(\log n)$. Extensive experimental analyses are conducted with four recent algorithms on various continuous problems issued from theory and practice. The proposed method achieves a higher performance than previous algorithms, addressing all problems with up to one million variables in less than one minute on a modern computer.
10 Inventions on scrolling and scrollbars in Graphical User Interface
Venue: arXiv cs.HC 2014
Year: 2014

Scrolling mechanism is used to display and edit large documents in a limited screen space or window. The scrolling mechanism may include a vertical scroll bar or a horizontal scroll bar or both to move the contents of the documents up and down or left and right. There may be navigation buttons on the screen representing the navigation keys on the keyboard. The user can click these buttons to scroll the screen. There may be very different methods of scrolling such as by using the "thumb", as popularly used with a PDF document. Scrolling may be achieved through eyeball tracking in a hands-free environment where the user does not have hands or wants to use hands for other activities. This article illustrates ten interesting inventions on scrolling selected from US patent database.
Inventions on expressing emotions In Graphical User Interface
Venue: arXiv cs.HC 2014
Year: 2014

The conventional GUI is more mechanical and does not recognize or communicate emotions. The modern GUIs are trying to infer the likely emotional state and personality of the user and communicate through a corresponding emotional state. Emotions are expressed in graphical icons, sounds, pictures and other means. The emotions are found to be useful in especially in communication software, interactive learning systems, robotics and other adaptive environments. Various mechanisms have been developed to express emotions through graphical user interfaces. This article illustrates some interesting inventions selected from US patent database.
Inventions on GUI for Touch Sensitive Screens
Venue: arXiv cs.HC 2014
Year: 2014

A touch sensitive screen displays the information on the screen and also receives the input by sensing a user's touch on the same screen. This mechanism facilitates system interaction directly through the screen without needing a mouse or keyboard. This method has the advantage to make the system compact by removing keyboard, mouse and similar interactive device. However there are certain difficulties to implement a touch screen interface. The display screens of portable devices are becoming smaller thereby leaving lesser space for display of data, menu or touch screen interaction. Besides some screens need to display so much of information that they hardly can afford any space to display touch screen buttons. This article illustrates various inventions which have successfully eliminated these difficulties by applying appropriate Inventive principles.
Inventions on GUI for Eye Cursor Controls Systems
Venue: arXiv cs.HC 2014
Year: 2014

Operating a GUI through eyeball is a complex mechanism and not used as often as mouse or trackball. But there are situations where eye-mouse devices can play a tremendous role especially where the hands of the user are not available or busy to perform other activities. The difficulties of implementing an eye-cursor control system are many. The article illustrates some inventions on eye-cursor control system, which attempt to eliminate the difficulties of the prior art mechanisms.
Nothing is Certain but Doubt and Tests
Venue: arXiv cs.SE 2014
Year: 2014

Effective software safety standards will contribute to confidence, or assurance, in the safety of the systems in which the software is used. It is infeasible to demonstrate a correlation between standards and accidents, but there is an alternative view that makes standards "testable". Software projects are subject to uncertainty; good standards reduce uncertainty more than poor ones. Similarly assurance or integrity levels in standards should define an uncertainty gradient. The paper proposes an argument -based method of reasoning about uncertainty that can be used as a basis for conducting experiments (tests) to evaluate standards.
The Efficacy of DO-178B
Venue: arXiv cs.SE 2014
Year: 2014

DO-178B was based on the consensus of the avionic software community as it existed in 1992. Twenty two years after publication, we have no publically available experimental data as to its efficacy. It appears to work extremely well, since there have been no hull loss accidents in passenger service ascribed to software failure. This is a comforting and surprising result. However, if we don't know why DO-178B works so well, there is a danger that we could stop doing something that really matters, which could lead to an accident.
Subspace clustering of dimensionality-reduced data
Venue: arXiv cs.IT 2014
Year: 2014

Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, assumed unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from "undersampling" due to complexity and speed constraints on the acquisition device. More pertinently, even if one has access to the high-dimensional data set it is often desirable to first project the data points into a lower-dimensional space and to perform the clustering task there; this reduces storage requirements and computational cost. The purpose of this paper is to quantify the impact of dimensionality-reduction through random projection on the performance of the sparse subspace clustering (SSC) and the thresholding based subspace clustering (TSC) algorithms. We find that for both algorithms dimensionality reduction down to the order of the subspace dimensions is possible without incurring significant performance degradation. The mathematical engine behind our theorems is a result quantifying how the affinities between subspaces change under random dimensionality reducing projections.
Metamorphic Domain-Specific Languages: A Journey Into the Shapes of a Language
Venue: arXiv cs.PL 2014
Year: 2014

External or internal domain-specific languages (DSLs) or (fluent) APIs? Whoever you are -- a developer or a user of a DSL -- you usually have to choose your side; you should not! What about metamorphic DSLs that change their shape according to your needs? We report on our 4-years journey of providing the "right" support (in the domain of feature modeling), leading us to develop an external DSL, different shapes of an internal API, and maintain all these languages. A key insight is that there is no one-size-fits-all solution or no clear superiority of a solution compared to another. On the contrary, we found that it does make sense to continue the maintenance of an external and internal DSL. The vision that we foresee for the future of software languages is their ability to be self-adaptable to the most appropriate shape (including the corresponding integrated development environment) according to a particular usage or task. We call metamorphic DSL such a language, able to change from one shape to another shape.
An Approach to Maintaining Safety Case Evidence After A System Change
Venue: arXiv cs.SE 2014
Year: 2014

Developers of some safety critical systems construct a safety case. Developers changing a system during development or after release must analyse the change's impact on the safety case. Evidence might be invalidated by changes to the system design, operation, or environmental context. Assumptions valid in one context might be invalid elsewhere. The impact of change might not be obvious. This paper proposes a method to facilitate safety case maintenance by highlighting the impact of changes.
Causality in Databases: The Diagnosis and Repair Connections
Venue: arXiv cs.DB 2014
Year: 2014

In this work we establish and investigate the connections between causality for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis. The first two are relatively new problems in databases, and the third one is an established subject in knowledge representation. We show how to obtain database repairs from causes and the other way around. The vast body of research on database repairs can be applied to the newer problem of determining actual causes for query answers. By formulating a causality problem as a diagnosis problem, we manage to characterize causes in terms of a system's diagnoses.
DualTable: A Hybrid Storage Model for Update Optimization in Hive
Venue: arXiv cs.DB 2014
Year: 2014

Hive is the most mature and prevalent data warehouse tool providing SQL-like interface in the Hadoop ecosystem. It is successfully used in many Internet companies and shows its value for big data processing in traditional industries. However, enterprise big data processing systems as in Smart Grid applications usually require complicated business logics and involve many data manipulation operations like updates and deletes. Hive cannot offer sufficient support for these while preserving high query performance. Hive using the Hadoop Distributed File System (HDFS) for storage cannot implement data manipulation efficiently and Hive on HBase suffers from poor query performance even though it can support faster data manipulation.There is a project based on Hive issue Hive-5317 to support update operations, but it has not been finished in Hive's latest version. Since this ACID compliant extension adopts same data storage format on HDFS, the update performance problem is not solved. In this paper, we propose a hybrid storage model called DualTable, which combines the efficient streaming reads of HDFS and the random write capability of HBase. Hive on DualTable provides better data manipulation support and preserves query performance at the same time. Experiments on a TPC-H data set and on a real smart grid data set show that Hive on DualTable is up to 10 times faster than Hive when executing update and delete operations.
Applying a Text-Based Affective Dialogue System in Psychological Research: Case Studies on the Effects of System Behavior, Interaction Context and Social Exclusion
Venue: arXiv cs.HC 2014
Year: 2014

This article presents two studies conducted with an affective dialogue system in which text-based system-user communication was used to model, generate, and present different affective and social interaction scenarios. We specifically investigated the influence of interaction context and roles assigned to the system and the participants, as well as the impact of pre-structured social interaction patterns that were modelled to mimic aspects of 'social exclusion' scenarios. The results of the first study demonstrate that both the social context of the interaction and the roles assigned to the system influence the system evaluation, interaction patterns, textual expressions of affective states, as well as emotional self-reports. The results observed for the second study show the system's ability to partially exclude a participant from a triadic conversation without triggering significantly different affective reactions or a more negative system evaluation. The experimental evidence provides insights on the perception, modelling and generation of affective and social cues in artificial systems that can be realized in different modalities, including the text modality, thus delivering valuable input for applying affective dialogue systems as tools for studying affect and social aspects in online communication.
Dividing Line between Decidable PDA's and Undecidable Ones
Venue: arXiv cs.LO 2014
Year: 2014

Senizergues has proved that language equivalence is decidable for disjoint epsilon-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jancar and Srba established the undecidability of the weak bisimilarity for disjoint epsilon-pushing PDA and disjoint epsilon-popping PDA. These decidability and undecidability results are extended in the present paper. The extension is accomplished by looking at the equivalence checking issue for the branching bisimilarity of several variants of PDA.
On the procedural structure of learning ecosystem toward competency learning model
Venue: arXiv cs.CY 2014
Year: 2014

Learning Ecosystem is new model for learning, that addresses to holistic learning model with attention to practical implementation. This paper is conducting the further study on detailed structure of learning ecosystem in component and procedural view. As case study, it connects Learning Ecosystem to Competency Education as Competency Learning Ecosystem Model for reference for practical use.
Heuristics guide the implementation of social preferences in one-shot Prisoner's Dilemma experiments
Venue: arXiv cs.GT 2014
Year: 2014

Cooperation in one-shot anonymous interactions is a widely documented aspect of human behaviour. Here we shed light on the motivations behind this behaviour by experimentally exploring cooperation in a one-shot continuous-strategy Prisoner's Dilemma (i.e. one-shot two-player Public Goods Game). We examine the distribution of cooperation amounts, and how that distribution varies based on the benefit-to-cost ratio of cooperation (b/c). Interestingly, we find a trimodal distribution at all b/c values investigated. Increasing b/c decreases the fraction of participants engaging in zero cooperation and increases the fraction engaging in maximal cooperation, suggesting a role for efficiency concerns. However, a substantial fraction of participants consistently engage in 50% cooperation regardless of b/c. The presence of these persistent 50% cooperators is surprising, and not easily explained by standard models of social preferences. We present evidence that this behaviour is a result of social preferences guided by simple decision heuristics, rather than the rational examination of payoffs assumed by most social preference models. We also find a strong correlation between play in the Prisoner's Dilemma and in a subsequent Dictator Game, confirming previous findings suggesting a common prosocial motivation underlying altruism and cooperation.