OpenRaiser/Intern-Atlas huggingface dataset:
Amplify-and-Forward Relaying in Two-Hop Diffusion-Based Molecular Communication Networks
Venue: arXiv cs.IT 2015
Year: 2015

This paper studies a three-node network in which an intermediate nano-transceiver, acting as a relay, is placed between a nano-transmitter and a nano-receiver to improve the range of diffusion-based molecular communication. Motivated by the relaying protocols used in traditional wireless communication systems, we study amplify-and-forward (AF) relaying with fixed and variable amplification factor for use in molecular communication systems. To this end, we derive a closed-form expression for the expected end-to-end error probability. Furthermore, we derive a closed-form expression for the optimal amplification factor at the relay node for minimization of an approximation of the expected error probability of the network. Our analytical and simulation results show the potential of AF relaying to improve the overall performance of nano-networks.
On the Finiteness of the Capacity of Continuous Channels
Venue: arXiv cs.IT 2015
Year: 2015

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic, memoryless and possibly non-linear additive noise channels. The results are based on a novel sufficient condition that guarantees the convergence of differential entropies under point-wise convergence of Probability Density Functions. Perhaps surprisingly, the finiteness of channel capacity holds for the majority of setups, including those where inputs and outputs have possibly infinite second-moments.
Parametric Linear Dynamic Logic (full version)
Venue: arXiv cs.LO 2015
Year: 2015

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all omega-regular specifications while still maintaining many of LTL's desirable properties like intuitive syntax and semantics and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all omega-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi automata of exponential size via alternating automata. This yields polynomial space algorithms for model checking and assume-guarantee model checking and a realizability algorithm with doubly-exponential running time. All three problems are also shown to be complete for these complexity classes. Moreover, we give tight upper and lower bounds on optimal parameter values for model checking and realizability. Using these bounds, we present a polynomial space procedure for model checking optimization and an algorithm with triply-exponential running time for realizability optimization. Our results show that PLDL model checking and realizability are no harder than their respective (parametric) LTL counterparts.
A Feature-based Classification of Model Repair Approaches
Venue: arXiv cs.SE 2015
Year: 2015

Consistency management, the ability to detect, diagnose and handle inconsistencies, is crucial during the development process in Model-driven Engineering (MDE). As the popularity and application scenarios of MDE expanded, a variety of different techniques were proposed to address these tasks in specific contexts. Of the various stages of consistency management, this work focuses on inconsistency fixing in MDE, where such task is embodied by model repair techniques. This paper proposes a feature-based classification system for model repair techniques, based on an systematic review of previously proposed approaches. We expect this work to assist both the developers of novel techniques and the MDE practitioners looking for suitable solutions.
Mining Semi-structured Data
Venue: arXiv cs.DB 2015
Year: 2015

The need for discovering knowledge from XML documents according to both structure and content features has become challenging, due to the increase in application contexts for which handling both structure and content information in XML data is essential. So, the challenge is to find an hierarchical structure which ensure a combination of data levels and their representative structures. In this work, we will be based on the Formal Concept Analysis-based views to index and query both content and structure. We evaluate given structure in a querying process which allows the searching of user query answers.
The Hilbert spectrum and the Energy Preserving Empirical Mode Decomposition
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we propose algorithms which preserve energy in empirical mode decomposition (EMD), generating finite $n$ number of band limited Intrinsic Mode Functions (IMFs). In the first energy preserving EMD (EPEMD) algorithm, a signal is decomposed into linearly independent (LI), non orthogonal yet energy preserving (LINOEP) IMFs and residue (EPIMFs). It is shown that a vector in an inner product space can be represented as a sum of LI and non orthogonal vectors in such a way that Parseval's type property is satisfied. From the set of $n$ IMFs, through Gram-Schmidt orthogonalization method (GSOM), $n!$ set of orthogonal functions can be obtained. In the second algorithm, we show that if the orthogonalization process proceeds from lowest frequency IMF to highest frequency IMF, then the GSOM yields functions which preserve the properties of IMFs and the energy of a signal. With the Hilbert transform, these IMFs yield instantaneous frequencies and amplitudes as functions of time that reveal the imbedded structures of a signal. The instantaneous frequencies and square of amplitudes as functions of time produce a time-frequency-energy distribution, referred as the Hilbert spectrum, of a signal. Simulations have been carried out for the analysis of various time series and real life signals to show comparison among IMFs produced by EMD, EPEMD, ensemble EMD and multivariate EMD algorithms. Simulation results demonstrate the power of this proposed method.
The homogeneous weight for $R_k$, related Gray map and new binary quasicyclic codes
Venue: arXiv cs.IT 2015
Year: 2015

Using theoretical results about the homogeneous weights for Frobenius rings, we describe the homogeneous weight for the ring family $R_k$, a recently introduced family of Frobenius rings which have been used extensively in coding theory. We find an associated Gray map for the homogeneous weight using first order Reed-Muller codes and we describe some of the general properties of the images of codes over $R_k$ under this Gray map. We then discuss quasitwisted codes over $R_k$ and their binary images under the homogeneous Gray map. In this way, we find many optimal binary codes which are self-orthogonal and quasicyclic. In particular, we find a substantial number of optimal binary codes that are quasicyclic of index 8, 16 and 24, nearly all of which are new additions to the database of quasicyclic codes kept by Chen.
On Distributed Storage Allocations for Memory-Limited Systems
Venue: arXiv cs.IT 2015
Year: 2015

In this paper we consider distributed allocation problems with memory constraint limits. Firstly, we propose a tractable relaxation to the problem of optimal symmetric allocations from [1]. The approximated problem is based on the Q-error function, and its solution approaches the solution of the initial problem, as the number of storage nodes in the network grows. Secondly, exploiting this relaxation, we are able to formulate and to solve the problem for storage allocations for memory-limited DSS storing and arbitrary memory profiles. Finally, we discuss the extension to the case of multiple data objects, stored in the DSS.
Multi-point Codes from Generalized Hermitian Curves
Venue: arXiv cs.IT 2015
Year: 2015

We investigate multi-point algebraic geometric codes defined from curves related to the generalized Hermitian curve introduced by Alp Bassa, Peter Beelen, Arnaldo Garcia, and Henning Stichtenoth. Our main result is to find a basis of the Riemann-Roch space of a series of divisors, which can be used to construct multi-point codes explicitly. These codes turn out to have nice properties similar to those of Hermitian codes, for example, they are easy to describe, to encode and decode. It is shown that the duals are also such codes and an explicit formula is given. In particular, this formula enables one to calculate the parameters of these codes. Finally, we apply our results to obtain linear codes attaining new records on the parameters. A new record-giving $ [234,141,\geqslant 59] $-code over $ \mathbb{F}_{27} $ is presented as one of the examples.
Constraint Satisfaction Problems around Skolem Arithmetic
Venue: arXiv cs.CC 2015
Year: 2015

We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a certain satisfaction problem on circuits to be decidable. This we prove using the decidability of Skolem Arithmetic. We continue by studying first-order expansions of Skolem Arithmetic without constants, (N;*), where * indicates multiplication, as CSPs. We find already here a rich landscape of problems with non-trivial instances that are in P as well as those that are NP-complete.
Genetic algorithm implementation for effective document subject search
Venue: arXiv cs.IR 2015
Year: 2015

This paper describes the software implementation of genetic algorithm for identifying and selecting most relevant results received during sequentially executed subject search operations. Simulated evolutionary process generates sustainable and effective population of search queries, forms search pattern of documents or semantic core, creates relevant sets of required documents, allows automatic classification of search results. The paper discusses the features of subject search, justifies the use of a genetic algorithm, describes arguments of the fitness function and describes basic steps and parameters of the algorithm.
Dynamics of Complex Systems Built as Coupled Physical, Communication and Decision Layers
Venue: arXiv cs.MA 2015
Year: 2015

This paper proposes a simple model to capture the complexity of multi-layer systems where their constituent layers affect, are affected by, each other. The physical layer is a circuit composed by a power source and resistors in parallel. Individual agents can add, remove or keep the resistors they have, and their decisions aiming at maximising the delivered power - a non-linear function dependent on the others' behaviour - based on their internal state, their global state perception, the information received from their neighbours in the communication network, and a randomised selfishness. We develop an agent-based simulation to analyse the effects of number of agents (size of the system), communication network topology, communication errors and the minimum power gain that triggers a behavioural change. Our results show that a wave-like behaviour at macro-level (caused by individual changes in the decision layer) can only emerge for a specific system size, the ratio between cooperators and defectors depends on minimum gain assumed - lower minimal gains lead to less cooperation and vice-versa, different communication network topologies lead to different levels of power utilisation and fairness at the physical layer, and a certain level of error in the communication layer leads to more cooperation.
A Framework of Stability Analysis for Multi-agent Systems on Arbitrary Topology Graph: Linear Systems
Venue: arXiv cs.SY 2015
Year: 2015

In this paper, from the structural perspective, we propose a new stability analysis approach for the consensus of linear multi-agent systems. Different from the general tools: the Laplacian matrix based method and the Lyapunov's method, this approach treats the multi-agent system as the composition of many isolated agents, and focuses on their special input and output relationship. Through transforming the construction of a graph into a standard procedure only including three basic structures, the stability analysis is recursive and independent of the specific topology. Therefore, this approach can be used for multi-agent systems on any topology graph.
Throughput Maximization in Multi-Hop Wireless Networks under Secrecy Constraint
Venue: arXiv cs.IT 2015
Year: 2015

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitimate link. The communication design problem posed here is how to maximize the multi-hop throughput from the aggregator to the control unit by finding the best combination of relay positions (i.e. hop length: short or long) and coding rates (i.e. high or low spectral efficiency) so that the secrecy constraint is satisfied. Using a stochastic-geometry approach, we show that the optimal choice of coding rate depends only on the path- loss exponent and is normally high while greater number of shorter hops are preferable to smaller number of longer hops. For the scenarios of interest, we prove that the optimal throughput subject to the secrecy constraint achieves the unconstrained optimal performance if a feasible solution exists.
Three-dimensional (3D) Channel Modeling between Seaborne MIMO Radar and MIMO Cellular System
Venue: arXiv cs.IT 2015
Year: 2015

Sharing radar spectrum with communication systems is an emerging area of research. Deploying commercial wireless communication services in radar bands give wireless operators the much needed additional spectrum to meet the growing bandwidth demands. However, to enable spectrum sharing between these two fundamentally different systems interference concerns must be addressed. In order to assess interference concerns we design a three-dimensional (3D) channel model between radar and cellular base stations (BSs) in which the radar uses a two-dimensional (2D) antenna array and the BS uses a one-dimensional (1D) antenna array. We formulate a line-of-sight (LoS) channel and then propose an algorithm that mitigates radar interference to BSs. We extend the previously proposed null space projection algorithm for 2D channels to 3D channels and show that effective nulls can be placed by utilizing both the azimuth and elevation angle information of BSs. This results in effective interference mitigation. In addition we show that the 3D channel model allows us to accurately classify the size of radar's search space when null space projection algorithm is used for interference mitigation.
Dirty Paper Arbitrarily Varying Channel with a State-Aware Adversary
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white Gaussian state, where the state is known non-causally to the encoder and the adversary, but not the decoder. We determine the randomized coding capacity of this AVC under the maximal probability of error criterion. Interestingly, it is shown that the jamming adversary disregards the state knowledge to choose a white Gaussian channel input which is independent of the state.
Evaluating the Quality of RDF Data Sets on Common Vocabularies in the Social, Behavioral, and Economic Sciences
Venue: arXiv cs.DL 2015
Year: 2015

From 2012 to 2015 together with other Linked Data community members and experts from the social, behavioral, and economic sciences (SBE), we developed diverse vocabularies to represent SBE metadata and tabular data in RDF. The DDI-RDF Discovery Vocabulary (DDI-RDF) is designed to support the dissemination, management, and reuse of unit-record data, i.e., data about individuals, households, and businesses, collected in form of responses to studies and archived for research purposes. The RDF Data Cube Vocabulary (QB) is a W3C recommendation for expressing data cubes, i.e. multi-dimensional aggregate data and its metadata. Physical Data Description (PHDD) is a vocabulary to model data in rectangular format, i.e., tabular data. The data could either be represented in records with character-separated values (CSV) or fixed length. The Simple Knowledge Organization System (SKOS) is a vocabulary to build knowledge organization systems such as thesauri, classification schemes, and taxonomies. XKOS is a SKOS extension to describe formal statistical classifications. To ensure high quality of and trust in both metadata and data, their representation in RDF must satisfy certain criteria - specified in terms of RDF constraints. In this paper, we evaluate the data quality of 15,694 data sets (4.26 billion triples) of research data for the social, behavioral, and economic sciences obtained from 33 SPARQL endpoints. We checked 115 constraints on three different and representative SBE vocabularies (DDI-RDF, QB, and SKOS) by means of the RDF Validator, a validation environment which is available at http://purl.org/net/rdfval-demo.
The Influence of Malloc Placement on TSX Hardware Transactional Memory
Venue: arXiv cs.OS 2015
Year: 2015

The hardware transactional memory (HTM) implementation in Intel's i7-4770 "Haswell" processor tracks the transactional read-set in the L1 (level-1), L2 (level-2) and L3 (level-3) caches and the write-set in the L1 cache. Displacement or eviction of read-set entries from the cache hierarchy or write-set entries from the L1 results in abort. We show that the placement policies of dynamic storage allocators -- such as those found in common "malloc" implementations -- can influence the L1 conflict miss rate in the L1. Conflict misses -- sometimes called mapping misses -- arise because of less than ideal associativity and represent imbalanced distribution of active memory blocks over the set of available L1 indices. Under transactional execution conflict misses may manifest as aborts, representing wasted or futile effort instead of a simple stall as would occur in normal execution mode. Furthermore, when HTM is used for transactional lock elision (TLE), persistent aborts arising from conflict misses can force the offending thread through the so-called "slow path". The slow path is undesirable as the thread must acquire the lock and run the critical section in normal execution mode, precluding the concurrent execution of threads in the "fast path" that monitor that same lock and run their critical sections in transactional mode. For a given lock, multiple threads can concurrently use the transactional fast path, but at most one thread can use the non-transactional slow path at any given time. Threads in the slow path preclude safe concurrent fast path execution. Aborts rising from placement policies and L1 index imbalance can thus result in loss of concurrency and reduced aggregate throughput.
Biometrics for Child Vaccination and Welfare: Persistence of Fingerprint Recognition for Infants and Toddlers
Venue: arXiv cs.CV 2015
Year: 2015

With a number of emerging applications requiring biometric recognition of children (e.g., tracking child vaccination schedules, identifying missing children and preventing newborn baby swaps in hospitals), investigating the temporal stability of biometric recognition accuracy for children is important. The persistence of recognition accuracy of three of the most commonly used biometric traits (fingerprints, face and iris) has been investigated for adults. However, persistence of biometric recognition accuracy has not been studied systematically for children in the age group of 0-4 years. Given that very young children are often uncooperative and do not comprehend or follow instructions, in our opinion, among all biometric modalities, fingerprints are the most viable for recognizing children. This is primarily because it is easier to capture fingerprints of young children compared to other biometric traits, e.g., iris, where a child needs to stare directly towards the camera to initiate iris capture. In this report, we detail our initiative to investigate the persistence of fingerprint recognition for children in the age group of 0-4 years. Based on preliminary results obtained for the data collected in the first phase of our study, use of fingerprints for recognition of 0-4 year-old children appears promising.
A spectral optical flow method for determining velocities from digital imagery
Venue: arXiv cs.CV 2015
Year: 2015

We present a method for determining surface flows from solar images based upon optical flow techniques. We apply the method to sets of images obtained by a variety of solar imagers to assess its performance. The {\tt opflow3d} procedure is shown to extract accurate velocity estimates when provided perfect test data and quickly generates results consistent with completely distinct methods when applied on global scales. We also validate it in detail by comparing it to an established method when applied to high-resolution datasets and find that it provides comparable results without the need to tune, filter or otherwise preprocess the images before its application.
Pseudorandomness for Read-Once, Constant-Depth Circuits
Venue: arXiv cs.CC 2015
Year: 2015

For Boolean functions computed by read-once, depth-$D$ circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\tilde{O}(\log^{D+1} n)$. The previous best seed length known for this model was $\tilde{O}(\log^{D+4} n)$, obtained by Trevisan and Xue (CCC `13) for all of $AC^0$ (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness introduced by Reingold, Steinke, and Vadhan (RANDOM `13) to show that the generator of Gopalan et al. (FOCS `12) fools read-once $AC^0$. To this end, we prove a new Fourier growth bound for read-once circuits, namely that for every $F: \{0,1\}^n\to\{0,1\}$ computed by a read-once, depth-$D$ circuit, \begin{equation*}\sum_{s\subseteq[n], |s|=k}|\hat{F}[s]|\le O(\log^{D-1}n)^k,\end{equation*} where $\hat{F}$ denotes the Fourier transform of $F$ over $\mathbb{Z}^n_2$.
Gap Analysis of Natural Language Processing Systems with respect to Linguistic Modality
Venue: arXiv cs.CL 2015
Year: 2015

Modality is one of the important components of grammar in linguistics. It lets speaker to express attitude towards, or give assessment or potentiality of state of affairs. It implies different senses and thus has different perceptions as per the context. This paper presents an account showing the gap in the functionality of the current state of art Natural Language Processing (NLP) systems. The contextual nature of linguistic modality is studied. In this paper, the works and logical approaches employed by Natural Language Processing systems dealing with modality are reviewed. It sees human cognition and intelligence as multi-layered approach that can be implemented by intelligent systems for learning. Lastly, current flow of research going on within this field is talked providing futurology.