OpenRaiser/Intern-Atlas huggingface dataset:
Antescofo Intermediate Representation
Venue: arXiv cs.MM 2014
Year: 2014

We describe an intermediate language designed as a medium-level internal representation of programs of the interactive music system Antescofo. This representation is independent both of the Antescofo source language and of the architecture of the execution platform. It is used in tasks such as verification of timings, model-based conformance testing, static control-flow analysis or simulation. This language is essentially a flat representation of Antescofo's code, as a finite state machine extended with local and global variables, with delays and with concurrent threads creation. It features a small number of simple instructions which are either blocking (wait for external event, signal or duration) or not (variable assignment, message emission and control).
Explicit and almost sure conditions for K/2 degrees of freedom
Venue: arXiv cs.IT 2014
Year: 2014

It is well known that in K-user constant single-antenna interference channels K/2 degrees of freedom (DoF) can be achieved for almost all channel matrices. Explicit conditions on the channel matrix to admit K/2 DoF are, however, not available. The purpose of this paper is to identify such explicit conditions, which are satisfied for almost all channel matrices. We also provide a construction of corresponding asymptotically DoF-optimal input distributions. The main technical tool used is a recent breakthrough result by Hochman in fractal geometry.
Summary of the First Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE1)
Venue: arXiv cs.SE 2014
Year: 2014

Challenges related to development, deployment, and maintenance of reusable software for science are becoming a growing concern. Many scientists' research increasingly depends on the quality and availability of software upon which their works are built. To highlight some of these issues and share experiences, the First Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE1) was held in November 2013 in conjunction with the SC13 Conference. The workshop featured keynote presentations and a large number (54) of solicited extended abstracts that were grouped into three themes and presented via panels. A set of collaborative notes of the presentations and discussion was taken during the workshop. Unique perspectives were captured about issues such as comprehensive documentation, development and deployment practices, software licenses and career paths for developers. Attribution systems that account for evidence of software contribution and impact were also discussed. These include mechanisms such as Digital Object Identifiers, publication of "software papers", and the use of online systems, for example source code repositories like GitHub. This paper summarizes the issues and shared experiences that were discussed, including cross-cutting issues and use cases. It joins a nascent literature seeking to understand what drives software work in science, and how it is impacted by the reward systems of science. These incentives can determine the extent to which developers are motivated to build software for the long-term, for the use of others, and whether to work collaboratively or separately. It also explores community building, leadership, and dynamics in relation to successful scientific software.
Intelligent Resource Allocation Technique For Desktop-as-a-Service in Cloud Environment
Venue: arXiv cs.DC 2014
Year: 2014

The specialty of desktop-as-a-service cloud computing is that user can access their desktop and can execute applications in virtual desktops on remote servers. Resource management and resource utilization are most significant in the area of desktop-as-a-service, cloud computing; however, handling a large amount of clients in the most efficient manner poses important challenges. Especially deciding how many clients to handle on one server, and where to execute the user applications at each time is important. This is because we have to ensure maximum resource utilization along with user data confidentiality, customer satisfaction, scalability, minimum Service level agreement (SLA) violation etc. Assigning too many users to one server leads to customer dissatisfaction, while assigning too little leads to higher investments costs. So we have taken into consideration these two situations also. We study different aspects to optimize the resource usage and customer satisfaction. Here in this paper We proposed Intelligent Resource Allocation (IRA) Technique which assures the above mentioned parameters like minimum SLA violation. For this, priorities are assigned to user requests based on their SLA Factors in order to maintain their confidentiality. The results of the paper indicate that by applying IRA Technique to the already existing overbooking mechanism will improve the performance of the system with significant reduction in SLA violation.
On Cloud-Based Engineering of Dependable Systems
Venue: arXiv cs.SE 2014
Year: 2014

The cloud computing paradigm is being adopted by many organizations in different application domains as it is cost effective and offers a virtually unlimited pool of resources. Engineering critical systems can benefit from clouds in attaining all dependability means: fault tolerance, fault prevention, fault removal and fault forecasting. Our research aims to investigate the potential of supporting engineering of dependable software systems with cloud computing and proposes an open, extensible, and elastic cloud-based software engineering workflow system which represents and executes software processes to improve collaboration, reliability and quality assurance, and automation in software projects.
A Map of Update Constraints in Inductive Inference
Venue: arXiv cs.LG 2014
Year: 2014

We investigate how different learning restrictions reduce learning power and how the different restrictions relate to one another. We give a complete map for nine different restrictions both for the cases of complete information learning and set-driven learning. This completes the picture for these well-studied \emph{delayable} learning restrictions. A further insight is gained by different characterizations of \emph{conservative} learning in terms of variants of \emph{cautious} learning. Our analyses greatly benefit from general theorems we give, for example showing that learners with exclusively delayable restrictions can always be assumed total.
A Complex Event Processing Approach for Crisis-Management Systems
Venue: arXiv cs.CY 2014
Year: 2014

In modern advanced emergency management systems many solutions for decision support have been provided as attempts to support humans to take important decisions for the critical situations recovery. The critical situation detection is a complex procedure that involves both human and machine activities and leads to take a decision for the management and situation recovery. This paper presents an approach for critical situation detection which uses event correlation technologies performing online analysis of real events through a Complex Event Processing architecture. Event correlation is used to relate events gathered from various sources, including crowd sensing and crowd sourcing sources, for detecting patterns and situations of interest in the emergency management context.
Integrated Maintenance: analysis and perspective of innovation in railway sector
Venue: arXiv cs.SE 2014
Year: 2014

The high costs for the management of the modern and complex industrial control systems make it necessary to enhance the current maintenance processes. Therefore, the need arises to clearly define the goals of the maintenance, in order to evolve and continuously enhance the management methods, to efficiently integrate the maintenance activities with the ones related to the production, the service provisioning, and the operation, and to use smart computer-based maintenance systems. This paper proposes a general maintenance approach and its specific application to the railway sector.
High-Speed Tracking with Kernelized Correlation Filters
Venue: arXiv cs.CV 2014
Year: 2014

The core component of most modern trackers is a discriminative classifier, tasked with distinguishing between the target and the surrounding environment. To cope with natural image changes, this classifier is typically trained with translated and scaled sample patches. Such sets of samples are riddled with redundancies -- any overlapping pixels are constrained to be the same. Based on this simple observation, we propose an analytic model for datasets of thousands of translated patches. By showing that the resulting data matrix is circulant, we can diagonalize it with the Discrete Fourier Transform, reducing both storage and computation by several orders of magnitude. Interestingly, for linear regression our formulation is equivalent to a correlation filter, used by some of the fastest competitive trackers. For kernel regression, however, we derive a new Kernelized Correlation Filter (KCF), that unlike other kernel algorithms has the exact same complexity as its linear counterpart. Building on it, we also propose a fast multi-channel extension of linear correlation filters, via a linear kernel, which we call Dual Correlation Filter (DCF). Both KCF and DCF outperform top-ranking trackers such as Struck or TLD on a 50 videos benchmark, despite running at hundreds of frames-per-second, and being implemented in a few lines of code (Algorithm 1). To encourage further developments, our tracking framework was made open-source.
Selecting a Small Set of Optimal Gestures from an Extensive Lexicon
Venue: arXiv cs.CV 2014
Year: 2014

Finding the best set of gestures to use for a given computer recognition problem is an essential part of optimizing the recognition performance while being mindful to those who may articulate the gestures. An objective function, called the ellipsoidal distance ratio metric (EDRM), for determining the best gestures from a larger lexicon library is presented, along with a numerical method for incorporating subjective preferences. In particular, we demonstrate an efficient algorithm that chooses the best $n$ gestures from a lexicon of $m$ gestures where typically $n \ll m$ using a weighting of both subjective and objective measures.
Exact random coding error exponents of optimal bin index decoding
Venue: arXiv cs.IT 2014
Year: 2014

We consider ensembles of channel codes that are partitioned into bins, and focus on analysis of exact random coding error exponents associated with optimum decoding of the index of the bin to which the transmitted codeword belongs. Two main conclusions arise from this analysis: (i) for independent random selection of codewords within a given type class, the random coding exponent of optimal bin index decoding is given by the ordinary random coding exponent function, computed at the rate of the entire code, independently of the exponential rate of the size of the bin. (ii) for this ensemble of codes, sub-optimal bin index decoding, that is based on ordinary maximum likelihood (ML) decoding, is as good as the optimal bin index decoding in terms of the random coding error exponent achieved. Finally, for the sake of completeness, we also outline how our analysis of exact random coding exponents extends to the hierarchical ensemble that correspond to superposition coding and optimal decoding, where for each bin, first, a cloud center is drawn at random, and then the codewords of this bin are drawn conditionally independently given the cloud center. For this ensemble, conclusions (i) and (ii), mentioned above, no longer hold necessarily in general.
Towards a Swiss National Research Infrastructure
Venue: arXiv cs.CY 2014
Year: 2014

In this position paper we describe the current status and plans for a Swiss National Research Infrastructure. Swiss academic and research institutions are very autonomous. While being loosely coupled, they do not rely on any centralized management entities. Therefore, a coordinated national research infrastructure can only be established by federating the various resources available locally at the individual institutions. The Swiss Multi-Science Computing Grid and the Swiss Academic Compute Cloud projects serve already a large number of diverse user communities. These projects also allow us to test the operational setup of such a heterogeneous federated infrastructure.
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths
Venue: arXiv cs.DS 2014
Year: 2014

A chordless cycle (induced cycle) $C$ of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the problems of enumerating chordless cycles/paths of a given graph $G=(V,E),$ and propose algorithms taking $O(|E|)$ time for each chordless cycle/path. In the existing studies, the problems had not been deeply studied in the theoretical computer science area, and no output polynomial time algorithm has been proposed. Our experiments showed that the computation time of our algorithms is constant per chordless cycle/path for non-dense random graphs and real-world graphs. They also show that the number of chordless cycles is much smaller than the number of cycles. We applied the algorithm to prediction of NMR (Nuclear Magnetic Resonance) spectra, and increased the accuracy of the prediction.
First-Order Formative Rules
Venue: arXiv cs.LO 2014
Year: 2014

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique.
Distributed Space-Time Interference Alignment with Moderately-Delayed CSIT
Venue: arXiv cs.IT 2014
Year: 2014

This paper proposes an interference alignment method with distributed and delayed channel state information at the transmitter (CSIT) for a class of interference networks. The core idea of the proposed method is to align interference signals over time at the unintended receivers in a distributed manner. With the proposed method, achievable trade-offs between the sum of degrees of freedom (sum-DoF) and feedback delay of CSI are characterized in both the X-channel and three-user interference channel to reveal the impact on how the CSI feedback delay affects the sum-DoF of the interference networks. A major implication of derived results is that distributed and moderately- delayed CSIT is useful to strictly improve the sum-DoF over the case of no CSI at the transmitter in a certain class of interference networks. For a class of X-channels, the results show how to optimally use distributed and moderately-delayed CSIT to yield the same sum-DoF as instantaneous and global CSIT. Further, leveraging the proposed transmission method and the known outer bound results, the sum-capacity of the two-user X-channel with a particular set of channel coefficients is characterized within a constant number of bits.
Information Flow Decomposition in Feedback Systems: Linear Time-Invariant Systems with Gaussian Channels
Venue: arXiv cs.SY 2014
Year: 2014

In our companion paper [1], an information identity decomposition has been derived, which can be interpreted as a law of conservation of information flows in feedback systems. In this paper, we further investigate this decomposition result when specified to linear time-invariant(LTI) systems connected with additive white Gaussian noise(AWGN) channels. It is shown that the quantities in the decomposition are characterized in sensitivity function and the law of conservation is verified.
Computing Strong Nash Equilibria for Multiplayer Games
Venue: arXiv cs.GT 2014
Year: 2014

An heuristic approach to compute strong Nash (Aumann) equilibria is presented. The method is based on differential evolution and three variants of a generative relation for strong Nash equilibria characterization. Numerical experiments performed on the minimum effort game for up to 150 players illustrate the efficiency of the approach. The advantages and disadvantages of each variant is discussed in terms of precision and running time.
Contextual Semantic Parsing using Crowdsourced Spatial Descriptions
Venue: arXiv cs.CL 2014
Year: 2014

We describe a contextual parser for the Robot Commands Treebank, a new crowdsourced resource. In contrast to previous semantic parsers that select the most-probable parse, we consider the different problem of parsing using additional situational context to disambiguate between different readings of a sentence. We show that multiple semantic analyses can be searched using dynamic programming via interaction with a spatial planner, to guide the parsing process. We are able to parse sentences in near linear-time by ruling out analyses early on that are incompatible with spatial context. We report a 34% upper bound on accuracy, as our planner correctly processes spatial context for 3,394 out of 10,000 sentences. However, our parser achieves a 96.53% exact-match score for parsing within the subset of sentences recognized by the planner, compared to 82.14% for a non-contextual parser.
Dimensionality of social networks using motifs and eigenvalues
Venue: arXiv cs.SI 2014
Year: 2014

We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an $m$-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when $m$ scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and LinkedIn. Further, we employ two different methods for confirming the hypothesis: the first uses the distribution of motif counts, and the second exploits the eigenvalue distribution.
On Hardness of Jumbled Indexing
Venue: arXiv cs.DS 2014
Year: 2014

Jumbled indexing is the problem of indexing a text $T$ for queries that ask whether there is a substring of $T$ matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered a lot of interest in the last four years. There is a naive algorithm that preprocesses all answers in $O(n^2|Σ|)$ time allowing quick queries afterwards, and there is another naive algorithm that requires no preprocessing but has $O(n\log|Σ|)$ query time. Despite a tremendous amount of effort there has been little improvement over these running times. In this paper we provide good reason for this. We show that, under a 3SUM-hardness assumption, jumbled indexing for alphabets of size $ω(1)$ requires $Ω(n^{2-ε})$ preprocessing time or $Ω(n^{1-δ})$ query time for any $ε,δ>0$. In fact, under a stronger 3SUM-hardness assumption, for any constant alphabet size $r\ge 3$ there exist describable fixed constant $ε_r$ and $δ_r$ such that jumbled indexing requires $Ω(n^{2-ε_r})$ preprocessing time or $Ω(n^{1-δ_r})$ query time.
Big Data in Critical Infrastructures Security Monitoring: Challenges and Opportunities
Venue: arXiv cs.SE 2014
Year: 2014

Critical Infrastructures (CIs), such as smart power grids, transport systems, and financial infrastructures, are more and more vulnerable to cyber threats, due to the adoption of commodity computing facilities. Despite the use of several monitoring tools, recent attacks have proven that current defensive mechanisms for CIs are not effective enough against most advanced threats. In this paper we explore the idea of a framework leveraging multiple data sources to improve protection capabilities of CIs. Challenges and opportunities are discussed along three main research directions: i) use of distinct and heterogeneous data sources, ii) monitoring with adaptive granularity, and iii) attack modeling and runtime combination of multiple data analysis techniques.
Dovetail: Stronger Anonymity in Next-Generation Internet Routing
Venue: arXiv cs.CR 2014
Year: 2014

Current low-latency anonymity systems use complex overlay networks to conceal a user's IP address, introducing significant latency and network efficiency penalties compared to normal Internet usage. Rather than obfuscating network identity through higher level protocols, we propose a more direct solution: a routing protocol that allows communication without exposing network identity, providing a strong foundation for Internet privacy, while allowing identity to be defined in those higher level protocols where it adds value. Given current research initiatives advocating "clean slate" Internet designs, an opportunity exists to design an internetwork layer routing protocol that decouples identity from network location and thereby simplifies the anonymity problem. Recently, Hsiao et al. proposed such a protocol (LAP), but it does not protect the user against a local eavesdropper or an untrusted ISP, which will not be acceptable for many users. Thus, we propose Dovetail, a next-generation Internet routing protocol that provides anonymity against an active attacker located at any single point within the network, including the user's ISP. A major design challenge is to provide this protection without including an application-layer proxy in data transmission. We address this challenge in path construction by using a matchmaker node (an end host) to overlap two path segments at a dovetail node (a router). The dovetail then trims away part of the path so that data transmission bypasses the matchmaker. Additional design features include the choice of many different paths through the network and the joining of path segments without requiring a trusted third party. We develop a systematic mechanism to measure the topological anonymity of our designs, and we demonstrate the privacy and efficiency of our proposal by simulation, using a model of the complete Internet at the AS-level.
Characterization and Detection of epsilon-Berge Zhukovskii Equilibria
Venue: arXiv cs.GT 2014
Year: 2014

Berge equilibrium in the sense of Zhukovskii (Berge-Zhukovskii) is an alternate solution concept in non-cooperative game theory that formalizes cooperation in a noncooperative setting. In this paper the epsilon-Berge-Zhukovskii equilibrium is introduced and characterized by using a generative relation. A computational method for detecting epsilon-Berge-Zhukovskii equilibrium based on evolutionary multiobjective optimization algorithms is presented. Numerical examples are used to illustrate the results obtained.