OpenRaiser/Intern-Atlas huggingface dataset:
Oscillator Phase Noise and Small-Scale Channel Fading in Higher Frequency Bands
Venue: arXiv cs.IT 2014
Year: 2014

This paper investigates the effect of oscillator phase noise and channel variations due to fading on the performance of communication systems at frequency bands higher than 10GHz. Phase noise and channel models are reviewed and technology-dependent bounds on the phase noise quality of radio oscillators are presented. Our study shows that, in general, both channel variations and phase noise can have severe effects on the system performance at high frequencies. Importantly, their relative severity depends on the application scenario and system parameters such as center frequency and bandwidth. Channel variations are seen to be more severe than phase noise when the relative velocity between the transmitter and receiver is high. On the other hand, performance degradation due to phase noise can be more severe when the center frequency is increased and the bandwidth is kept a constant, or when oscillators based on low power CMOS technology are used, as opposed to high power GaN HEMT based oscillators.
Generalized weights and bounds for error probability over erasure channels
Venue: arXiv cs.IT 2014
Year: 2014

New upper and lower bounds for the error probability over an erasure channel are provided, making use of Wei's generalized weights, hierarchy and spectra. In many situations the upper and lower bounds coincide and this allows improvement of existing bounds. Results concerning MDS and AMDS codes are deduced from those bounds.
Leveraging Time Distortion for seamless Navigation into Data Space-Time Continuum
Venue: arXiv cs.SE 2014
Year: 2014

Intelligent software systems continuously analyze their surrounding environment and accordingly adapt their internal state. Depending on the criticality index of the situation, the system should dynamically focus or widen its analysis and reasoning scope. A naive -why have less when you can have more- approach would consist in systematically sampling the context at a very high rate and triggering the reasoning process regularly. This reasoning process would then need to mine a huge amount of data, extract a relevant view, and finally analyze this adequate view. This overall process would require some heavy resources and/or be time-consuming, conflicting with the (near) real-time response time requirements of intelligent systems. We claim that a continuous and more flexible navigation into context models, in space and in time, can significantly improve reasoning processes. This paper thus introduces a novel modeling approach together with a navigation concept, which consider time and locality as first-class properties crosscutting any model element, and enable the seamless navigation of models in this space-time continuum. In particular, we leverage a time-relative navigation (inspired by the space-time and distortion theory [7]) able to efficiently empower continuous reasoning processes. We integrate our approach into an open-source modeling framework and evaluate it on a smart grid reasoning engine for electric load prediction. We demonstrate that reasoners leveraging this distorted space-time continuum outperform the full sampling approach, and is compatible with most of (near) real-time requirements.
Mixed-integer Quadratic Programming is in NP
Venue: arXiv cs.DM 2014
Year: 2014

Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-integer quadratic programming is feasible, then there exists a solution of polynomial size. This result generalizes and unifies classical results that quadratic programming is in NP and integer linear programming is in NP.
A new construction of differentially 4-uniform permutations over $F_{2^{2k}}$
Venue: arXiv cs.IT 2014
Year: 2014

Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well known example is that the Advanced Encryption Standard (AES) chooses a differentially 4-uniform permutation, the multiplicative inverse function, as its S-box. In this paper, we present a new construction of differentially 4-uniformity permutations over even characteristic finite fields and obtain many new CCZ-inequivalent functions. All the functions are switching neighbors in the narrow sense of the multiplicative inverse function and have the optimal algebraic degree and high nonlinearity.
Detecting network communities beyond assortativity-related attributes
Venue: arXiv cs.SI 2014
Year: 2014

In network science, assortativity refers to the tendency of links to exist between nodes with similar attributes. In social networks, for example, links tend to exist between individuals of similar age, nationality, location, race, income, educational level, religious belief, and language. Thus, various attributes jointly affect the network topology. An interesting problem is to detect community structure beyond some specific assortativity-related attributes $ρ$, i.e., to take out the effect of $ρ$ on network topology and reveal the hidden community structure which are due to other attributes. An approach to this problem is to redefine the null model of the modularity measure, so as to simulate the effect of $ρ$ on network topology. However, a challenge is that we do not know to what extent the network topology is affected by $ρ$ and by other attributes. In this paper, we propose Dist-Modularity which allows us to freely choose any suitable function to simulate the effect of $ρ$. Such freedom can help us probe the effect of $ρ$ and detect the hidden communities which are due to other attributes. We test the effectiveness of Dist-Modularity on synthetic benchmarks and two real-world networks.
One file to share them all: Using the COMBINE Archive and the OMEX format to share all information about a modeling project
Venue: arXiv cs.DL 2014
Year: 2014

Background: With the ever increasing use of computational models in the biosciences, the need to share models and reproduce the results of published studies efficiently and easily is becoming more important. To this end, various standards have been proposed that can be used to describe models, simulations, data or other essential information in a consistent fashion. These constitute various separate components required to reproduce a given published scientific result. Results: We describe the Open Modeling EXchange format (OMEX). Together with the use of other standard formats from the Computational Modeling in Biology Network (COMBINE), OMEX is the basis of the COMBINE Archive, a single file that supports the exchange of all the information necessary for a modeling and simulation experiment in biology. An OMEX file is a ZIP container that includes a manifest file, listing the content of the archive, an optional metadata file adding information about the archive and its content, and the files describing the model. The content of a COMBINE Archive consists of files encoded in COMBINE standards whenever possible, but may include additional files defined by an Internet Media Type. Several tools that support the COMBINE Archive are available, either as independent libraries or embedded in modeling software. Conclusions: The COMBINE Archive facilitates the reproduction of modeling and simulation experiments in biology by embedding all the relevant information in one file. Having all the information stored and exchanged at once also helps in building activity logs and audit trails. We anticipate that the COMBINE Archive will become a significant help for modellers, as the domain moves to larger, more complex experiments such as multi-scale models of organs, digital organisms, and bioengineering.
On the tractability of some natural packing, covering and partitioning problems
Venue: arXiv cs.CC 2014
Year: 2014

In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph $G=(V,E)$ and two "object types" $\mathrm{A}$ and $\mathrm{B}$ chosen from the alternatives above, we consider the following questions. \textbf{Packing problem:} can we find an object of type $\mathrm{A}$ and one of type $\mathrm{B}$ in the edge set $E$ of $G$, so that they are edge-disjoint? \textbf{Partitioning problem:} can we partition $E$ into an object of type $\mathrm{A}$ and one of type $\mathrm{B}$? \textbf{Covering problem:} can we cover $E$ with an object of type $\mathrm{A}$, and an object of type $\mathrm{B}$? This framework includes 44 natural graph theoretic questions. Some of these problems were well-known before, for example covering the edge-set of a graph with two spanning trees, or finding an $s$-$t$ path $P$ and an $s'$-$t'$ path $P'$ that are edge-disjoint. However, many others were not, for example can we find an $s$-$t$ path $P\subseteq E $ and a spanning tree $T\subseteq E$ that are edge-disjoint? Most of these previously unknown problems turned out to be NP-complete, many of them even in planar graphs. This paper determines the status of these 44 problems. For the NP-complete problems we also investigate the planar version, for the polynomial problems we consider the matroidal generalization (wherever this makes sense).
An ECG-SoC with 535nW/channel lossless data compression for wearable sensors
Venue: arXiv cs.AR 2014
Year: 2014

This paper presents a low power ECG recording Sys-tem-on-Chip (SoC) with on-chip low complexity lossless ECG compression for data reduction in wireless/ambulatory ECG sensor devices. The proposed algorithm uses a linear slope predictor to estimate the ECG samples, and uses a novel low complexity dynamic coding-packaging scheme to frame the resulting estimation error into fixed-length 16-bit format. The proposed technique achieves an average compression ratio of 2.25x on MIT/BIH ECG database. Implemented in 0.35 μm process, the compressor uses 0.565 K gates/channel occupying 0.4 mm2 for 4-channel, and consumes 535 nW/channel at 2.4V for ECG sampled at 512 Hz. Small size and ultra-low power consumption makes the proposed technique suitable for wearable ECG sensor application.
Impact Analysis of Allocation of Resources by Project Manager on Success of Software Projects
Venue: arXiv cs.SE 2014
Year: 2014

Generation Production of successful software project is one of the prime considerations of software industry. Engineering high quality software products is further influenced by several factors such as budget, schedule, resource constraints etc. A project manager is responsible for estimation and allocation of these resources in a project. Hence, role of project manager has a vital influence on success of the project. This research comprises of an empirical study of several projects developed in a product and service based CMMI Level 5 Software Company. The investigation result shows a significant impact of aforementioned factors on the success of software and on the company. The analysis further indicates the vital role of project managers in optimizing the resource allocation towards development of software. This paper brings in impact analysis of efficiency of project manager in effectively allocating resources such as time, cost, number of developers etc. An awareness of efficiency level of project manager in optimal allocation of resources enables one to realize the desired level of quality.
Secure Wireless Information and Power Transfer in Large-Scale MIMO Relaying Systems with Imperfect CSI
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we address the problem of secure wireless information and power transfer in a large-scale multiple-input multiple-output (LS-MIMO) amplify-and-forward (AF) relaying system. The advantage of LS-MIMO relay is exploited to enhance wireless security, transmission rate and energy efficiency. In particular, the challenging issues incurred by short interception distance and long transfer distance are well addressed simultaneously. Under very practical assumptions, i.e., no eavesdropper's channel state information (CSI) and imperfect legitimate channel CSI, this paper investigates the impact of imperfect CSI, and obtains an explicit expression of the secrecy outage capacity in terms of transmit power and channel condition. Then, we propose an optimal power splitting scheme at the relay to maximize the secrecy outage capacity. Finally, our theoretical claims are validated by simulation results.
Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs
Venue: arXiv cs.IT 2014
Year: 2014

Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared to one-step circulant-based liftings. The expected performance improvement is verified by simulation results.
Representing and Reasoning about Game Strategies
Venue: arXiv cs.AI 2014
Year: 2014

As a contribution to the challenge of building game-playing AI systems, we develop and analyse a formal language for representing and reasoning about strategies. Our logical language builds on the existing general Game Description Language (GDL) and extends it by a standard modality for linear time along with two dual connectives to express preferences when combining strategies. The semantics of the language is provided by a standard state-transition model. As such, problems that require reasoning about games can be solved by the standard methods for reasoning about actions and change. We also endow the language with a specific semantics by which strategy formulas are understood as move recommendations for a player. To illustrate how our formalism supports automated reasoning about strategies, we demonstrate two example methods of implementation\/: first, we formalise the semantic interpretation of our language in conjunction with game rules and strategy rules in the Situation Calculus; second, we show how the reasoning problem can be solved with Answer Set Programming.
Nontransitive Ranking to Enhance Routing Decision in MANETS
Venue: arXiv cs.NI 2014
Year: 2014

An ad hoc network is an infrastructureless network in which nodes perform terminal as well as routing functions. A routing protocol is the only substitute to complete the communications in the absence of an access point. In spite of that mobile nodes or so called routers uses some mechanism for calculating the best route when it has multiple routes for the same destination. On the basis of one or more metrics routes are ranked from best to worst. But, in an ad hoc network many factors can affect this decision, such as the delay, load, route lifetime etc. Thus measuring and finding routes on the basis of crisp mathematical model for all these attributes is complicated. That why, the fuzzy approach for best route determination is required for MANET because some of the metrics are fuzzy or vague and the classical ranking of routes and transitivity in the ranking does not hold. The proposed Nontransitive Route Ranking subjective comparison of one route with others and performs nontransitive ranking to rank routes from best to worst. The pairwise comparisons of each route with others give more accurate and fair comparison. The proposed ranking is easier than classical ranking in which metrics have assigned some value and these values are combined to obtain the ranking. Experimental result shows the efficiency of the proposed model. Keywords: Fuzzy, Rank, Nontransitive, Route, Ranking, Relativity
Program Synthesis and Linear Operator Semantics
Venue: arXiv cs.PL 2014
Year: 2014

For deterministic and probabilistic programs we investigate the problem of program synthesis and program optimisation (with respect to non-functional properties) in the general setting of global optimisation. This approach is based on the representation of the semantics of programs and program fragments in terms of linear operators, i.e. as matrices. We exploit in particular the fact that we can automatically generate the representation of the semantics of elementary blocks. These can then can be used in order to compositionally assemble the semantics of a whole program, i.e. the generator of the corresponding Discrete Time Markov Chain (DTMC). We also utilise a generalised version of Abstract Interpretation suitable for this linear algebraic or functional analytical framework in order to formulate semantical constraints (invariants) and optimisation objectives (for example performance requirements).
How to Handle Assumptions in Synthesis
Venue: arXiv cs.LO 2014
Year: 2014

The increased interest in reactive synthesis over the last decade has led to many improved solutions but also to many new questions. In this paper, we discuss the question of how to deal with assumptions on environment behavior. We present four goals that we think should be met and review several different possibilities that have been proposed. We argue that each of them falls short in at least one aspect.
Are There Good Mistakes? A Theoretical Analysis of CEGIS
Venue: arXiv cs.LO 2014
Year: 2014

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate programs is finite. But the technique may or may not terminate with the correct program if the candidate space of programs is infinite. In this paper, we perform a theoretical analysis of counterexample-guided inductive synthesis technique. We investigate whether the set of candidate spaces for which the correct program can be synthesized using CEGIS depends on the counterexamples used in inductive synthesis, that is, whether there are good mistakes which would increase the synthesis power. We investigate whether the use of minimal counterexamples instead of arbitrary counterexamples expands the set of candidate spaces of programs for which inductive synthesis can successfully synthesize a correct program. We consider two kinds of counterexamples: minimal counterexamples and history bounded counterexamples. The history bounded counterexample used in any iteration of CEGIS is bounded by the examples used in previous iterations of inductive synthesis. We examine the relative change in power of inductive synthesis in both cases. We show that the synthesis technique using minimal counterexamples MinCEGIS has the same synthesis power as CEGIS but the synthesis technique using history bounded counterexamples HCEGIS has different power than that of CEGIS, but none dominates the other.
Low-Effort Specification Debugging and Analysis
Venue: arXiv cs.SE 2014
Year: 2014

Reactive synthesis deals with the automated construction of implementations of reactive systems from their specifications. To make the approach feasible in practice, systems engineers need effective and efficient means of debugging these specifications. In this paper, we provide techniques for report-based specification debugging, wherein salient properties of a specification are analyzed, and the result presented to the user in the form of a report. This provides a low-effort way to debug specifications, complementing high-effort techniques including the simulation of synthesized implementations. We demonstrate the usefulness of our report-based specification debugging toolkit by providing examples in the context of generalized reactivity(1) synthesis.
A RM-Polar Codes
Venue: arXiv cs.IT 2014
Year: 2014

In this letter we propose a new hybrid code called "RM-Polar" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes, therefore it has much better error performance than Polar codes.
Efficient Algorithms for the Closest Pair Problem and Applications
Venue: arXiv cs.DS 2014
Year: 2014

The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of closest points. Another closely related problem is the fixed radius nearest neighbors problem (FRNNP). Given a set of points and a radius $R$, the problem is, for every input point $p$, to identify all the other input points that are within a distance of $R$ from $p$. A naive deterministic algorithm can solve these problems in quadratic time. CPP as well as FRNNP play a vital role in computational biology, computational finance, share market analysis, weather prediction, entomology, electro cardiograph, N-body simulations, molecular simulations, etc. As a result, any improvements made in solving CPP and FRNNP will have immediate implications for the solution of numerous problems in these domains. We live in an era of big data and processing these data take large amounts of time. Speeding up data processing algorithms is thus much more essential now than ever before. In this paper we present algorithms for CPP and FRNNP that improve (in theory and/or practice) the best-known algorithms reported in the literature for CPP and FRNNP. These algorithms also improve the best-known algorithms for related applications including time series motif mining and the two locus problem in Genome Wide Association Studies (GWAS).
Rust for functional programmers
Venue: arXiv cs.PL 2014
Year: 2014

This article provides an introduction to Rust, a systems language by Mozilla, to programmers already familiar with Haskell, OCaml or other functional languages.
A Novel Uplink Data Transmission Scheme For Small Packets In Massive MIMO System
Venue: arXiv cs.IT 2014
Year: 2014

Intelligent terminals often produce a large number of data packets of small lengths. For these packets, it is inefficient to follow the conventional medium access control (MAC) protocols because they lead to poor utilization of service resources. We propose a novel multiple access scheme that targets massive multiple-input multiple-output (MIMO) systems based on compressive sensing (CS). We employ block precoding in the time domain to enable the simultaneous transmissions of many users, which could be even more than the number of receive antennas at the base station. We develop a block-sparse system model and adopt the block orthogonal matching pursuit (BOMP) algorithm to recover the transmitted signals. Conditions for data recovery guarantees are identified and numerical results demonstrate that our scheme is efficient for uplink small packet transmission.