OpenRaiser/Intern-Atlas huggingface dataset:
Localized LQR Optimal Control
Venue: arXiv cs.SY 2014
Year: 2014

This paper introduces a receding horizon like control scheme for localizable distributed systems, in which the effect of each local disturbance is limited spatially and temporally. We characterize such systems by a set of linear equality constraints, and show that the resulting feasibility test can be solved in a localized and distributed way. We also show that the solution of the local feasibility tests can be used to synthesize a receding horizon like controller that achieves the desired closed loop response in a localized manner as well. Finally, we formulate the Localized LQR (LLQR) optimal control problem and derive an analytic solution for the optimal controller. Through a numerical example, we show that the LLQR optimal controller, with its constraints on locality, settling time, and communication delay, can achieve similar performance as an unconstrained H2 optimal controller, but can be designed and implemented in a localized and distributed way.
Proof Generation from Delta-Decisions
Venue: arXiv cs.LO 2014
Year: 2014

We show how to generate and validate logical proofs of unsatisfiability from delta-complete decision procedures that rely on error-prone numerical algorithms. Solving this problem is important for ensuring correctness of the decision procedures. At the same time, it is a new approach for automated theorem proving over real numbers. We design a first-order calculus, and transform the computational steps of constraint solving into logic proofs, which are then validated using proof-checking algorithms. As an application, we demonstrate how proofs generated from our solver can establish many nonlinear lemmas in the the formal proof of the Kepler Conjecture.
Learning to Match for Multi-criteria Document Relevance
Venue: arXiv cs.IR 2014
Year: 2014

In light of the tremendous amount of data produced by social media, a large body of research have revisited the relevance estimation of the users' generated content. Most of the studies have stressed the multidimensional nature of relevance and proved the effectiveness of combining the different criteria that it embodies. Traditional relevance estimates combination methods are often based on linear combination schemes. However, despite being effective, those aggregation mechanisms are not effective in real-life applications since they heavily rely on the non-realistic independence property of the relevance dimensions. In this paper, we propose to tackle this issue through the design of a novel fuzzy-based document ranking model. We also propose an automated methodology to capture the importance of relevance dimensions, as well as information about their interaction. This model, based on the Choquet Integral, allows to optimize the aggregated documents relevance scores using any target information retrieval relevance metric. Experiments within the TREC Microblog task and a social personalized information retrieval task highlighted that our model significantly outperforms a wide range of state-of-the-art aggregation operators, as well as a representative learning to rank methods.
Product Line Metrics for Legacy Software in Practice
Venue: arXiv cs.SE 2014
Year: 2014

Nowadays, customer products like vehicles do not only contain mechanical parts but also a highly complex software and their manufacturers have to offer many variants of technically very similar systems with sometimes only small differences in their behavior. The proper reuse of software artifacts which realize this behavior using a software product line is discussed in recent literature and appropriate methods and techniques for their management are proposed. However, establishing a software product line for integrating already existing legacy software to reuse valuable resources for future similar products is very company-specific. In this paper, a method is outlined for evaluating objectively a legacy software's potential to create a software product line. This method is applied to several development projects at Volkswagen AG Business Unit Braunschweig to evaluate the software product line potential for steering systems.
Automated Testing of Graphical Models in Heterogeneous Test Environments
Venue: arXiv cs.SE 2014
Year: 2014

Automated and therefore repeatable tests are important in product lines to ensure and maintain quality of software functions as well as efficiency of the developers. This article shows methods for fully automated testing of SIMULINK models with the slUnit framework and techniques for the integration of slUnit tests in a general test framework to allow integrated and automated test reports.
A Framework for Realtime Online Auctions
Venue: arXiv cs.SE 2014
Year: 2014

Among the existing E-Commerce applications, online auctions are the most influential ones. Their impact on trading in the B2B (business to business) as well as in the B2C (business to consumer) and C2C (consumer to consumer) areas will be inevitable. This article describes the architecture of a web-based realtime online auction system, together with the functional and technical requirements that evolved during the development process and heavily influenced the architecture. From the point of view of this real world case study, ways to minimize the development time and yet ensure a robust and flexible system are explained: combining standard software and self- developed components, reusing code wherever possible, and employing the eXtreme Programming approach and its test concepts.
The WebShop E-Commerce Framework
Venue: arXiv cs.SE 2014
Year: 2014

This paper presents an e-commerce framework called WebShop, which was developed by the authors for the purpose of demonstrating the use of UML and the UML-F in the domain of Web applications. Thus, the WebShop is not regarded as a full-fledged system out of which real Web stores can be derived. For example, the framework in the presented version does not encounter security features. However, it presents the most important variation points related to online catalogs. The UML-F Web site http://www.UML-F.net provides the Java source files and some sample adaptations of WebShop.
Retrofitting Security into a Web-Based Information System
Venue: arXiv cs.SE 2014
Year: 2014

This paper reports on an incremental method that allows adding security mechanisms to an existing, but insecure system, such as a prototype or a legacy system. The incremental method is presented and as a showcase its application is demonstrated at the example of a Web-based information system.
Towards a System Model for UML. The Structural Data Model
Venue: arXiv cs.SE 2014
Year: 2014

In this document we introduce a system model as the basis for a semantic model for UML 2.0. The system model is supposed to form the core and foundation of the UML semantics definition. For that purpose the basic system is targeted towards UML. This document is structured as follows: In the rest of Section 1 we will discuss the general approach and highlight the main decisions. This section is important to understand the rest of this document. Section 2 contains the actual definition of the structural part of the system model. It is built in layers as described in Section 1. For brevity of the approach, we defer deeper discussions into the Appendix in Section 4. This document is part of a project on the formalization of the UML 2.0 in cooperation between the Queens University Kingston and the Technische Universitäten Braunschweig and München. This version 1.0 is the result of a longer effort to define the structure, behavior and interaction of object-oriented, possibly distributed systems abstract enough to be of general value, but also in sufficient detail for a semantic foundation of the UML. We also wish to thank external reviewers, and especially Gregor von Bochmann, Gregor Engels and Sébastien Gérard for their help.
Model Driven Testing of Time Sensitive Distributed Systems
Venue: arXiv cs.SE 2014
Year: 2014

In this paper we demonstrate an approach to model structure and behavior of distributed systems, to map those models to a lightweight execution engine by using a functional programming language and to systematically define and execute tests for these models within the same technology. This is a prerequisite for a smooth integration of model based development into an agile method. The novelty of this paper is the demonstration, how composition and state machine models for distributed asynchronously communicating systems can easily be mapped to a lazy functional language and then using standard testing techniques to define test on those programs. In particular distributed timing aspects and underspecification can be treated accordingly within a functional language, using a certain style of functions.
Roles in Software Development using Domain Specific Modeling Languages
Venue: arXiv cs.SE 2014
Year: 2014

Domain-specific modelling languages (DSMLs) successfully separate the conceptual and technical design of a software system by modelling requirements in the DSML and adding technical elements by appropriate generator technology. In this paper we describe the roles within an agile development process that allows us to implement a software system by using a combination of domain specific models and source code. We describe the setup of such a process using the MontiCore framework and demonstrate the advantages by describing how a group of developers with diverse individual skills can develop automotive HMI software.
Modular Description of a Comprehensive Semantics Model for the UML (Version 2.0)
Venue: arXiv cs.SE 2014
Year: 2014

In this document, we introduce a system model as a semantic domain for the Unified Modeling Language (UML) [OMG07a, OMG07b]. The system model is supposed to form a possible core and foundation of the UML semantics definition. For that purpose, the definitions in this document are targeted towards UML which means that central concepts of UML have been formalized as theories of the system model. This document is structured as follows: In the rest of Chapter 1, we discuss the general approach and highlight the main decisions. This chapter is important to understand the rest of this document. Chapter 2 contains the definition of the structural part of the system model. Chapters 3 and 4 contain the control and communication related definition definitions which form the basis to describe the state of a system in Chapter 5. Two variants of state transitions systems are introduced to define object behavior in Chapters 6 (event-based) and 7 (timed). Chapter 8 concludes the document. This document is the second version of the system model which is the result of a major effort to define the structure, behavior and interaction of object oriented, possibly distributed systems abstract enough to be of general value, but also in sufficient detail for a semantic foundation of the UML. The first version of the system model can be found in [BCR06, BCR07a, BCR07b].
Attendee-Sourcing: Exploring The Design Space of Community-Informed Conference Scheduling
Venue: arXiv cs.HC 2014
Year: 2014

Constructing a good conference schedule for a large multi-track conference needs to take into account the preferences and constraints of organizers, authors, and attendees. Creating a schedule which has fewer conflicts for authors and attendees, and thematically coherent sessions is a challenging task. Cobi introduced an alternative approach to conference scheduling by engaging the community to play an active role in the planning process. The current Cobi pipeline consists of committee-sourcing and author-sourcing to plan a conference schedule. We further explore the design space of community-sourcing by introducing attendee-sourcing -- a process that collects input from conference attendees and encodes them as preferences and constraints for creating sessions and schedule. For CHI 2014, a large multi-track conference in human-computer interaction with more than 3,000 attendees and 1,000 authors, we collected attendees' preferences by making available all the accepted papers at the conference on a paper recommendation tool we built called Confer, for a period of 45 days before announcing the conference program (sessions and schedule). We compare the preferences marked on Confer with the preferences collected from Cobi's author-sourcing approach. We show that attendee-sourcing can provide insights beyond what can be discovered by author-sourcing. For CHI 2014, the results show value in the method and attendees' participation. It produces data that provides more alternatives in scheduling and complements data collected from other methods for creating coherent sessions and reducing conflicts.
A Concept Learning Approach to Multisensory Object Perception
Venue: arXiv cs.CV 2014
Year: 2014

This paper presents a computational model of concept learning using Bayesian inference for a grammatically structured hypothesis space, and test the model on multisensory (visual and haptics) recognition of 3D objects. The study is performed on a set of artificially generated 3D objects known as fribbles, which are complex, multipart objects with categorical structures. The goal of this work is to develop a working multisensory representational model that integrates major themes on concepts and concepts learning from the cognitive science literature. The model combines the representational power of a probabilistic generative grammar with the inferential power of Bayesian induction.
A New Clustering Algorithm Based on Near Neighbor Influence
Venue: arXiv cs.DB 2014
Year: 2014

This paper presents Clustering based on Near Neighbor Influence (CNNI), a new clustering algorithm which is inspired by the idea of near neighbor and the superposition principle of influence. In order to clearly describe this algorithm, it introduces some important concepts, such as near neighbor point set, near neighbor influence, and similarity measure. By simulated experiments of some artificial data sets and seven real data sets, we observe that this algorithm can often get good clustering quality when making proper value of some parameters. At last, it gives some research expectations to popularize this algorithm.
An Extended Small-Gain Theorem
Venue: arXiv cs.SY 2014
Year: 2014

We extend the results of the general small-gain theorem proposed by Z.P Jiang. The significance of this extension is two fold. First, it allows one to use general vector norm to characterize the input-to-output property of two interconnected subsystems. Second, the gain from input signals to output of each sub-system is provided, which offers one more flexibility in control design.
Cooperative Caching based on File Popularity Ranking in Delay Tolerant Networks
Venue: arXiv cs.NI 2014
Year: 2014

Increasing storage sizes and WiFi/Bluetooth capabilities of mobile devices have made them a good platform for opportunistic content sharing. In this work we propose a network model to study this in a setting with two characteristics: 1. delay tolerant; 2. lack of infrastructure. Mobile users generate requests and opportunistically download from other users they meet, via Bluetooth or WiFi. The difference in popularity of different web content induces a non-uniform request distribution, which is usually a Zipf's law distribution. We evaluate the performance of different caching schemes and derive the optimal scheme using convex optimization techniques. The optimal solution is found efficiently using a binary search method. It is shown that as the network mobility increases, the performance of the optimal scheme far exceeds the traditional caching scheme. To the best of our knowledge, our work is the first to consider popularity ranking in performance evaluation.
Efficiency Evaluation Metrics for Wireless Intelligent Sensors Applications
Venue: arXiv cs.NI 2014
Year: 2014

The metrology field has been progressed with the appearance of the wireless intelligent sensor systems providing more capabilities such as signal processing, remote multi-sensing fusion etc. This kind of devices is rapidly making their way into medical and industrial monitoring, collision avoidance, traffic control, automotive and others applications. However, numerous design challenges for wireless intelligent sensors systems are imposed to overcome the physical limitations in data traffic, such as system noise, real time communication, signal attenuation, response dynamics, power consumption, and effective conversion rates etc, especially for applications requiring specific performances. This paper analyzes the performance metrics of the mentioned sensing devices systems which stands for superior measurement, more accuracy and reliability. Study findings prescribe researchers, developers/ engineers and users to realizing an optimal sensing motes design strategy that offers operational advantages which can offer cost-effective solutions for an application.
State Based Service Description
Venue: arXiv cs.SE 2014
Year: 2014

In this paper we propose I/O state transition diagrams for service description In contrast to other techniques like for example Statecharts we allow to model non atomic services by sequences of transitions This is especially important in a distributed system where concurrent service invocation cannot be prohibited We give a mathematical model of object behaviour based on concurrent and sequential messages Then we give a precise semantics of the service descriptions in terms of the mathematical model.
Coding of Stereo Signals by a Single Digital ΔΣ Modulator
Venue: arXiv cs.IT 2014
Year: 2014

The possibility of using a single digital ΔΣ modulator to simultaneously encode the two channels of a stereo signal is illustrated. From the modulated stream, the two channels can be recovered with minimal processing and no cross-talk. Notably, demultiplexing does not affect the sample-depth so that, after it, one still has a data stream suitable for directly driving a power bridge and convertible into analog by mere low-pass filtering. Furthermore, the approach is very flexible and if one channel is unused, it lets the other get improved dynamic range and SNR. The approach can take advantage of recent techniques for the design of ΔΣ modulators, including methods for psychoacoustically optimal distribution of quantization noise. Code is available to replicate the proposed examples and as a general computer aided design tool.
Throughput Analysis for Wireless Networks with Full-Duplex Radios
Venue: arXiv cs.IT 2014
Year: 2014

This paper investigates the throughput for wireless network with full-duplex radios using stochastic geometry. Full-duplex (FD) radios can exchange data simultaneously with each other. On the other hand, the downside of FD transmission is that it will inevitably cause extra interference to the network compared to half-duplex (HD) transmission. In this paper, we focus on a wireless network of nodes with both HD and FD capabilities and derive and optimize the throughput in such a network. Our analytical result shows that if the network is adapting an ALOHA protocol, the maximal throughput is always achieved by scheduling all concurrently transmitting nodes to work in FD mode instead of a mixed FD/HD mode or HD mode regardless of the network configurations. Moreover, the throughput gain of using FD transmission over HD transmission is analytically lower and upper bounded.
On the strictness of the quantifier structure hierarchy in first-order logic
Venue: arXiv cs.LO 2014
Year: 2014

We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of Ehrenfeucht-Fraisse games that characterizes quantifier classes and use it to prove that this hierarchy is strict over finite structures, using strategy compositions. Moreover, we prove that this hierarchy is strict even over ordered finite structures, which is interesting in the context of descriptive complexity.
Overlapping Communities in Complex Networks
Venue: arXiv cs.SI 2014
Year: 2014

Communities are subsets of a network that are densely connected inside and share only few connections to the rest of the network. The aim of this research is the development and evaluation of an efficient algorithm for detection of overlapping, fuzzy communities. The algorithm gets as input some members of each community that we aim to discover. We call these members seed nodes. The algorithm then propagates this information by using random walks that start at non-seed nodes and end as they reach a seed node. The probability that a random walk starting at a non-seed node $v$ ends at a seed node $s$ is then equated with the probability that $v$ belongs to the communities of $s$. The algorithm runs in time $\tilde{O}(l \cdot m \cdot \log n)$, where $l$ is the number of communities to detect, $m$ is the number of edges, $n$ is the number of nodes. The $\tilde{O}$-notation hides a factor of at most $(\log \log n)^2$. The LFR benchmark proposed by Lancichinetti et al.\ is used to evaluate the performance of the algorithm. We found that, given a good set of seed nodes, it is able to reconstruct the communities of a network in a meaningful manner.
How close are we to understanding image-based saliency?
Venue: arXiv cs.CV 2014
Year: 2014

Within the set of the many complex factors driving gaze placement, the properities of an image that are associated with fixations under free viewing conditions have been studied extensively. There is a general impression that the field is close to understanding this particular association. Here we frame saliency models probabilistically as point processes, allowing the calculation of log-likelihoods and bringing saliency evaluation into the domain of information. We compared the information gain of state-of-the-art models to a gold standard and find that only one third of the explainable spatial information is captured. We additionally provide a principled method to show where and how models fail to capture information in the fixations. Thus, contrary to previous assertions, purely spatial saliency remains a significant challenge.
Irrelevant Components and Exact Computation of the Diameter Constrained Reliability
Venue: arXiv cs.DS 2014
Year: 2014

Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,...,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect but links fail stochastically and independently, with probabilities $q_i=1-p_i$. The \emph{diameter-constrained reliability} (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by $d$ links, or less. This number is denoted by $R_{K,G}^{d}(p)$. The general computation of the parameter $R_{K,G}^{d}(p)$ belongs to the class of $\mathcal{N}\mathcal{P}$-Hard problems, since is subsumes the complexity that a random graph is connected. A discussion of the computational complexity for DCR-subproblems is provided in terms of the number of terminal nodes $k=|K|$ and diameter $d$. Either when $d=1$ or when $d=2$ and $k$ is fixed, the DCR is inside the class $\mathcal{P}$ of polynomial-time problems. The DCR turns $\mathcal{N}\mathcal{P}$-Hard even if $k \geq 2$ and $d\geq 3$ are fixed, or in an all-terminal scenario when $d=2$. The traditional approach is to design either exponential exact algorithms or efficient solutions for particular graph classes. The contributions of this paper are two-fold. First, a new recursive class of graphs are shown to have efficient DCR computation. Second, we define a factorization method in order to develop an exact DCR computation in general. The approach is inspired in prior works related with the determination of irrelevant links and deletion-contraction formula.