OpenRaiser/Intern-Atlas huggingface dataset:
High Level Hardware/Software Embedded System Design with Redsharc
Venue: arXiv cs.SE 2014
Year: 2014

As tools for designing multiple processor systems-on-chips (MPSoCs) continue to evolve to meet the demands of developers, there exist systematic gaps that must be bridged to provide a more cohesive hardware/software development environment. We present Redsharc to address these problems and enable: system generation, software/hardware compilation and synthesis, run-time control and execution of MPSoCs. The efforts presented in this paper extend our previous work to provide a rich API, build infrastructure, and runtime enabling developers to design a system of simultaneously executing kernels in software or hardware, that communicate seamlessly. In this work we take Redsharc further to support a broader class of applications across a larger number of devices requiring a more unified system development environment and build infrastructure. To accomplish this we leverage existing tools and extend Redsharc with build and control infrastructure to relieve the burden of system development allowing software programmers to focus their efforts on application and kernel development.
A Proposed System for Covert Communication to Distant and Broad Geographical Areas
Venue: arXiv cs.CR 2014
Year: 2014

A covert communication system is developed that modulates Morse code characteristics and that delivers its mes- sage economically and to geographically remote areas using radio and EchoLink. Our system allows a covert message to be sent to a receiving individual by hiding it in an existing carrier Morse code message. The carrier need not be sent directly to the receiving person, though the receiver must have access to the signal. Illustratively, we propose that our system may be used as an alternative means of implementing numbers stations.
Swarm Intelligence Based Multi-phase OPF For Peak Power Loss Reduction In A Smart Grid
Venue: arXiv cs.CE 2014
Year: 2014

Recently there has been increasing interest in improving smart grids efficiency using computational intelligence. A key challenge in future smart grid is designing Optimal Power Flow tool to solve important planning problems including optimal DG capacities. Although, a number of OPF tools exists for balanced networks there is a lack of research for unbalanced multi-phase distribution networks. In this paper, a new OPF technique has been proposed for the DG capacity planning of a smart grid. During the formulation of the proposed algorithm, multi-phase power distribution system is considered which has unbalanced loadings, voltage control and reactive power compensation devices. The proposed algorithm is built upon a co-simulation framework that optimizes the objective by adapting a constriction factor Particle Swarm optimization. The proposed multi-phase OPF technique is validated using IEEE 8500-node benchmark distribution system.
A Crude Analysis of Twitch Plays Pokemon
Venue: arXiv cs.GT 2014
Year: 2014

We model and study the game mechanisms and human behavior of the anarchy mode in Twitch Plays Pokemon with a pure-jump continuous-time Markov process. We computed the winning probability and expected game time for $1$ player and $N$ players and identified when collaboration helps. A numerical plug-in example is also provided.
High Level Programming for Heterogeneous Architectures
Venue: arXiv cs.PF 2014
Year: 2014

This work presents an effort to bridge the gap between abstract high level programming and OpenCL by extending an existing high level Java programming framework (APARAPI), based on OpenCL, so that it can be used to program FPGAs at a high level of abstraction and increased ease of programmability. We run several real world algorithms to assess the performance of the framework on both a low end and a high end system. On the low end and high end systems respectively we observed up to 78-80 percent power reduction and 4.8X-5.3X speed increase running NBody simulation, as well as up to 65-80 percent power reduction and 6.2X-7X speed increase for a KMeans, MapReduce algorithm running on top of the Hadoop framework and APARAPI.
A Domain Specific Approach to Heterogeneous Computing: From Availability to Accessibility
Venue: arXiv cs.CE 2014
Year: 2014

We advocate a domain specific software development methodology for heterogeneous computing platforms such as Multicore CPUs, GPUs and FPGAs. We argue that three specific benefits are realised from adopting such an approach: portable, efficient implementations across heterogeneous platforms; domain specific metrics of quality that characterise platforms in a form software developers will understand; automatic, optimal partitioning across the available computing resources. These three benefits allow a development methodology for software developers where they describe their computational problems in a single, easy to understand form, and after a modeling procedure on the available resources, select how they would like to trade between various domain specific metrics. Our work on the Forward Financial Framework ($F^3$) demonstrates this methodology in practise. We are able to execute a range of computational finance option pricing tasks efficiently upon a wide range of CPU, GPU and FPGA computing platforms. We can also create accurate financial domain metric models of walltime latency and statistical confidence. Furthermore, we believe that we can support automatic, optimal partitioning using this execution and modelling capability.
Objektorientierte Graphendarstellung von Simulink-Modellen zur einfachen Analyse und Transformation
Venue: arXiv cs.SE 2014
Year: 2014

In software and hardware development MATLAB and Simulink are used to model cyber physical systems for many years, , especially in automation technology and the automotive industry. Compliance with the required product quality and project efficiency is facilitated by analyzing and transforming Simulink models. The existing API, provided by MATLAB is only suitable for programmatic changing of Simulink models. We show using our own tool which is used in industry, how such as a Simulink model can be edited more easily. For this purpose the model, is converted to an object-oriented class structure that provides convenient access and editing APIs and allows applying well-known algorithms and analyses from graph theory directly. It is also designed as a bi-directional tool, so it transforms a Simulink model into a graph representation and vice versa. ----- In der Software- und Hardwareentwicklung wird seit Jahren verstärkt MATLAB und Simulink für die Modellierung von cyberphysikalischen Systemen, insbesondere in der Automatisierungstechnik und der Automobilindustrie eingesetzt. Die Einhaltung der notwendigen Produktqualität und Projekteffizienz wird durch Analysen und Transformationen auf Simulink-Modellen erleichtert. Die bestehende, von MATLAB bereitgestellte, API ist für die programmatische Veränderung von Simulink-Modellen nur bedingt geeignet. Wir zeigen deshalb anhand eines eigenen, im industriellen Einsatz befindlichen Werkzeugs, wie ein Simulink-Modell leichter bearbeitet werden kann. Dazu wird es in eine objektorientierte Klassenstruktur überführt, die einen komfortablen Zugang und Bearbeitungs-APIs bietet und es erlaubt bekannte Algorithmen und Analysen aus der Graphentheorie direkt anzuwenden. Das Werkzeug ist bidirektional entworfen, es transformiert also ein Simulink-Modell in eine Graphenrepresentation und umgekehrt.
A Convex Approach to Output Feedback Control of Parabolic PDEs Using Sum-of-Squares
Venue: arXiv cs.SY 2014
Year: 2014

In this paper we use optimization-based methods to design output-feedback controllers for a class of one-dimensional parabolic partial differential equations. The output may be distributed or point-measurements. The input may be distributed or boundary actuation. We use Lyapunov operators, duality, and the Luenberger observer framework to reformulate the synthesis problem as a convex optimization problem expressed as a set of Linear-Operator-Inequalities (LOIs). We then show how feasibility of these LOIs may be tested using Semidefinite Programming (SDP) and the Sum-of-Squares methodology.
A two-stage architecture for stock price forecasting by combining SOM and fuzzy-SVM
Venue: arXiv cs.AI 2014
Year: 2014

This paper proposed a model to predict the stock price based on combining Self-Organizing Map (SOM) and fuzzy-Support Vector Machines (f-SVM). Extraction of fuzzy rules from raw data based on the combining of statistical machine learning models is base of this proposed approach. In the proposed model, SOM is used as a clustering algorithm to partition the whole input space into the several disjoint regions. For each partition, a set of fuzzy rules is extracted based on a f-SVM combining model. Then fuzzy rules sets are used to predict the test data using fuzzy inference algorithms. The performance of the proposed approach is compared with other models using four data sets
Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds
Venue: arXiv cs.IT 2014
Year: 2014

We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via L1-L1 and L1-L2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruct the original signal. Our bounds and geometrical interpretations reveal that if the prior information has good enough quality, L1-L1 minimization improves the performance of CS dramatically. In contrast, L1-L2 minimization has a performance very similar to classical CS and brings no significant benefits. All our findings are illustrated with experimental results.
High-Level Design of Portable and Scalable FPGA Accelerators
Venue: arXiv cs.OH 2014
Year: 2014

This paper presents our approach for making FPGA accelerators accessible to software (SW) programmers. It is intended as a starting point for collaborations with other groups pursuing similar objectives. We report on our current SAccO platform (Scalable Accelerator platform Osnabrück) and the planned project extending this platform.
Stream Processor Generator for HPC to Embedded Applications on FPGA-based System Platform
Venue: arXiv cs.OH 2014
Year: 2014

This paper presents a stream processor generator, called SPGen, for FPGA-based system-on-chip platforms. In our research project, we use an FPGA as a common platform for applications ranging from HPC to embedded/robotics computing. Pipelining in application-specific stream processors brings FPGAs power-efficient and high-performance computing. However, poor productivity in developing custom pipelines prevents the reconfigurable platform from being widely and easily used. SPGen aims at assisting developers to design and implement high-throughput stream processors by generating their HDL codes with our domain-specific high-level stream processing description, called SPD.With an example of fluid dynamics computation, we validate SPD for describing a real application and verify SPGen for synthesis with a pipelined data-flow graph. We also demonstrate that SPGen allows us to easily explore a design space for finding better implementation than a hand-designed one.
Hierarchical Adaptive Structural SVM for Domain Adaptation
Venue: arXiv cs.CV 2014
Year: 2014

A key topic in classification is the accuracy loss produced when the data distribution in the training (source) domain differs from that in the testing (target) domain. This is being recognized as a very relevant problem for many computer vision tasks such as image classification, object detection, and object category recognition. In this paper, we present a novel domain adaptation method that leverages multiple target domains (or sub-domains) in a hierarchical adaptation tree. The core idea is to exploit the commonalities and differences of the jointly considered target domains. Given the relevance of structural SVM (SSVM) classifiers, we apply our idea to the adaptive SSVM (A-SSVM), which only requires the target domain samples together with the existing source-domain classifier for performing the desired adaptation. Altogether, we term our proposal as hierarchical A-SSVM (HA-SSVM). As proof of concept we use HA-SSVM for pedestrian detection and object category recognition. In the former we apply HA-SSVM to the deformable part-based model (DPM) while in the latter HA-SSVM is applied to multi-category classifiers. In both cases, we show how HA-SSVM is effective in increasing the detection/recognition accuracy with respect to adaptation strategies that ignore the structure of the target data. Since, the sub-domains of the target data are not always known a priori, we shown how HA-SSVM can incorporate sub-domain structure discovery for object category recognition.
A Many-Core Overlay for High-Performance Embedded Computing on FPGAs
Venue: arXiv cs.AR 2014
Year: 2014

In this work, we propose a configurable many-core overlay for high-performance embedded computing. The size of internal memory, supported operations and number of ports can be configured independently for each core of the overlay. The overlay was evaluated with matrix multiplication, LU decomposition and Fast-Fourier Transform (FFT) on a ZYNQ-7020 FPGA platform. The results show that using a system-level many-core overlay avoids complex hardware design and still provides good performance results.
Energy-Efficient Antenna Selection and Power Allocation for Large-Scale Multiple Antenna Systems with Hybrid Energy Supply
Venue: arXiv cs.IT 2014
Year: 2014

The combination of energy harvesting and large-scale multiple antenna technologies provides a promising solution for improving the energy efficiency (EE) by exploiting renewable energy sources and reducing the transmission power per user and per antenna. However, the introduction of energy harvesting capabilities into large-scale multiple antenna systems poses many new challenges for energy-efficient system design due to the intermittent characteristics of renewable energy sources and limited battery capacity. Furthermore, the total manufacture cost and the sum power of a large number of radio frequency (RF) chains can not be ignored, and it would be impractical to use all the antennas for transmission. In this paper, we propose an energy-efficient antenna selection and power allocation algorithm to maximize the EE subject to the constraint of user's quality of service (QoS). An iterative offline optimization algorithm is proposed to solve the non-convex EE optimization problem by exploiting the properties of nonlinear fractional programming. The relationships among maximum EE, selected antenna number, battery capacity, and EE-SE tradeoff are analyzed and verified through computer simulations.
Random strings and tt-degrees of Turing complete C.E. sets
Venue: arXiv cs.LO 2014
Year: 2014

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the degree~0, even within the c.e. truth-table degrees, but when taking the meet over all such truth-table degrees, the infinite meet is indeed~0. The latter result proves a conjecture of Allender, Friedman and Gasarch. We also show that there are two Turing complete c.e. sets whose truth-table degrees form a minimal pair.
Model Matching Challenge: Benchmarks for Ecore and BPMN Diagrams
Venue: arXiv cs.SE 2014
Year: 2014

In the last couple of years, Model Driven Engineering (MDE) gained a prominent role in the context of software engineering. In the MDE paradigm, models are considered first level artifacts which are iteratively developed by teams of programmers over a period of time. Because of this, dedicated tools for versioning and management of models are needed. A central functionality within this group of tools is model comparison and differencing. In two disjunct research projects, we identified a group of general matching problems where state-of-the-art comparison algorithms delivered low quality results. In this article, we will present five edit operations which are the cause for these low quality results. The reasons why the algorithms fail, as well as possible solutions, are also discussed. These examples can be used as benchmarks by model developers to assess the quality and applicability of a model comparison tool for a given model type.
The Complexity of Counting Models of Linear-time Temporal Logic
Venue: arXiv cs.LO 2014
Year: 2014

We determine the complexity of counting models of bounded size of specifications expressed in Linear-time Temporal Logic. Counting word models is #P-complete, if the bound is given in unary, and as hard as counting accepting runs of nondeterministic polynomial space Turing machines, if the bound is given in binary. Counting tree models is as hard as counting accepting runs of nondeterministic exponential time Turing machines, if the bound is given in unary. For a binary encoding of the bound, the problem is at least as hard as counting accepting runs of nondeterministic exponential space Turing machines. On the other hand, it is not harder than counting accepting runs of nondeterministic doubly-exponential time Turing machines.
Diffusion of Innovations over Multiplex Social Networks
Venue: arXiv cs.SI 2014
Year: 2014

The ways in which an innovation (e.g., new behaviour, idea, technology, product) diffuses among people can determine its success or failure. In this paper, we address the problem of diffusion of innovations over multiplex social networks where the neighbours of a person belong to one or multiple networks (or layers) such as friends, families, or colleagues. To this end, we generalise one of the basic game-theoretic diffusion models, called networked coordination game, for multiplex networks. We present analytical results for this extended model and validate them through a simulation study, finding among other properties a lower bound for the success of an innovation.While simple and leading to intuitively understandable results, to the best of our knowledge this is the first extension of a game-theoretic innovation diffusion model for multiplex networks and as such it provides a basic framework to study more sophisticated innovation dynamics.
Duration-differentiated Energy Services with a Continuum of Loads
Venue: arXiv cs.SY 2014
Year: 2014

As the proportion of total power supplied by renewable sources increases, it gets more costly to use reserve generation to compensate for the variability of renewables like solar and wind. Hence attention has been drawn to exploiting flexibility in demand as a substitute for reserve generation. Flexibility has different attributes. In this paper we consider loads requiring a constant power for a specified duration (within say one day), whose flexibility resides in the fact that power may be delivered at any time so long as the total duration of service equals the load's specified duration. We give conditions under which a variable power supply is adequate to meet these flexible loads, and describe how to allocate the power to the loads. We also characterize the additional power needed when the supply is inadequate. We study the problem of allocating the available power to loads to maximize welfare, and show that the welfare optimum can be sustained as a competitive equilibrium in a forward market in which electricity is sold as service contracts differentiated by the duration of service and power level. We compare this forward market with a spot market in their ability to capture the flexiblity inherent in duration-differentiated loads.
Analysis of a Reduced-Communication Diffusion LMS Algorithm
Venue: arXiv cs.DC 2014
Year: 2014

In diffusion-based algorithms for adaptive distributed estimation, each node of an adaptive network estimates a target parameter vector by creating an intermediate estimate and then combining the intermediate estimates available within its closed neighborhood. We analyze the performance of a reduced-communication diffusion least mean-square (RC-DLMS) algorithm, which allows each node to receive the intermediate estimates of only a subset of its neighbors at each iteration. This algorithm eases the usage of network communication resources and delivers a trade-off between estimation performance and communication cost. We show analytically that the RC-DLMS algorithm is stable and convergent in both mean and mean-square senses. We also calculate its theoretical steady-state mean-square deviation. Simulation results demonstrate a good match between theory and experiment.
Integration of Heterogeneous Systems as Multi-Agent Systems
Venue: arXiv cs.SE 2014
Year: 2014

Systems integration is a difficult matter particularly when its components are varied. The problem becomes even more difficult when such components are heterogeneous such as humans, robots and software systems. Currently, the humans are regarded as users of artificial systems (robots and software systems). This has several disadvantages such as: (1) incoherence of artificial systems exploitation where humans' roles are not clear and (2) vain research of a user's universal model. In this paper, we adopted a cooperative approach where the system's components are regarded as being of the same level and they cooperate for the service of the global system. We concretized such approach by considering humans, robots and software systems as autonomous agents assuming roles in an organization. The latter will be implemented as a multi-agent system developed using a multi-agent development methodology.
On the causes of subject-specific citation rates in Web of Science
Venue: arXiv cs.DL 2014
Year: 2014

It is well known in bibliometrics that the average number of citations per paper differs greatly between the various disciplines. The differing citation culture (in particular the different average number of references per paper and thereby the different probability of being cited) is widely seen as the cause of this variation. Based on all Web of Science (WoS) records published in 1990, 1995, 2000, 2005, and 2010 we demonstrate that almost all disciplines show similar numbers of references in the appendices of their papers. Our results suggest that the average citation rate is far more influenced by the extent to which the papers (cited as references) are included in WoS as linked database records. For example, the comparatively low citation rates in the humanities are not at all the result of a lower average number of references per paper but are caused by the low fraction of linked references which refer to papers published in the core journals covered by WoS.
Interval-based Synthesis
Venue: arXiv cs.LO 2014
Year: 2014

We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq. In analogy to the case of monadic second-order logic of one successor, the considered synthesis problem receives as input an HSeq formula phi and a finite set Sigma of propositional variables and temporal requests, and it establishes whether or not, for all possible evaluations of elements in Sigma in every interval structure, there exists an evaluation of the remaining propositional variables and temporal requests such that the resulting structure is a model for phi. We focus our attention on decidability of the synthesis problem for some meaningful fragments of HSeq, whose modalities are drawn from the set A (meets), Abar (met by), B (begins), Bbar (begun by), interpreted over finite linear orders and natural numbers. We prove that the fragment ABBbareq is decidable (non-primitive recursive hard), while the fragment AAbarBBbar turns out to be undecidable. In addition, we show that even the synthesis problem for ABBbar becomes undecidable if we replace finite linear orders by natural numbers.