OpenRaiser/Intern-Atlas huggingface dataset:
Optimal Thresholds for Coverage and Rate in FFR Schemes for Planned Cellular Networks
Venue: arXiv cs.IT 2014
Year: 2014

Fractional frequency reuse (FFR) is an inter-cell interference coordination scheme that is being actively researched for emerging wireless cellular networks. In this work, we consider hexagonal tessellation based planned FFR deployments, and derive expressions for the coverage probability and normalized average rate for the downlink. In particular, given reuse $\frac{1}{3}$ (FR$3$ ) and reuse $1$ (FR$1$) regions, and a Signal-to-Interference-plus-noise-Ratio (SINR) threshold $S_{th}$ which decides the user assignment to either the FR$1$ or FR$3$ regions, we theoretically show that: $(i)$ The optimal choice of $S_{th}$ which maximizes the coverage probability is $S_{th} = T$, where $T$ is the required target SINR (for ensuring coverage), and $(ii)$ The optimal choice of $S_{th}$ which maximizes the normalized average rate is given by the expression $S_{th}=\max(T, T')$, where $T'$ is a function of the path loss exponent and the fade parameters. For the optimal choice of $S_{th}$, we show that FFR gives a higher rate than FR$1$ and a better coverage probability than FR$3$. The impact of frequency correlation over the sub-bands allocated to the FR$1$ and FR$3$ regions is analysed, and it is shown that correlation decreases the average rate of the FFR network. Numerical results are provided, and these match with the analytical results.
Evolutionary Optimization for Decision Making under Uncertainty
Venue: arXiv cs.NE 2014
Year: 2014

Optimizing decision problems under uncertainty can be done using a variety of solution methods. Soft computing and heuristic approaches tend to be powerful for solving such problems. In this overview article, we survey Evolutionary Optimization techniques to solve Stochastic Programming problems - both for the single-stage and multi-stage case.
Adaptive Power Allocation Strategies using DSTC in Cooperative MIMO Networks
Venue: arXiv cs.IT 2014
Year: 2014

Adaptive Power Allocation (PA) algorithms with different criteria for a cooperative Multiple-Input Multiple-Output (MIMO) network equipped with Distributed Space-Time Coding (DSTC) are proposed and evaluated. Joint constrained optimization algorithms to determine the power allocation parameters, the channel parameters and the receive filter are proposed for each transmitted stream in each link. Linear receive filter and maximum-likelihood (ML) detection are considered with Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperation strategies. In the proposed algorithms, the elements in the PA matrices are optimized at the destination node and then transmitted back to the relay nodes via a feedback channel. The effects of the feedback errors are considered. Linear MMSE expressions and the PA matrices depend on each other and are updated iteratively. Stochastic gradient (SG) algorithms are developed with reduced computational complexity. Simulation results show that the proposed algorithms obtain significant performance gains as compared to existing power allocation schemes.
Revolutionary Algorithms
Venue: arXiv cs.NE 2014
Year: 2014

The optimization of dynamic problems is both widespread and difficult. When conducting dynamic optimization, a balance between reinitialization and computational expense has to be found. There are multiple approaches to this. In parallel genetic algorithms, multiple sub-populations concurrently try to optimize a potentially dynamic problem. But as the number of sub-population increases, their efficiency decreases. Cultural algorithms provide a framework that has the potential to make optimizations more efficient. But they adapt slowly to changing environments. We thus suggest a confluence of these approaches: revolutionary algorithms. These algorithms seek to extend the evolutionary and cultural aspects of the former to approaches with a notion of the political. By modeling how belief systems are changed by means of revolution, these algorithms provide a framework to model and optimize dynamic problems in an efficient fashion.
Sparse interpolation over finite fields via low-order roots of unity
Venue: arXiv cs.SC 2014
Year: 2014

We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms of $f$. The approach presented in this paper is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest known probabilistic methods for this problem. By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a "soft-Oh" factor of $T$, $\log D$, or $\log q$.
Cryptanalysis of Multi-Server Authenticated Key Agreement Scheme Based on Trust Computing Using Smart Cards and Biometrics
Venue: arXiv cs.CR 2014
Year: 2014

Advancement in communication technology provides a scalable platform for various services where a remote user can access the server from anywhere without moving from its place. It has provided a unique opportunity for online services, such that the user need not physically present at the service center. These services adopt authentication and key agreement protocols to ensure authorized and secure access to resources. Most of the authentication schemes support single server environment where the user has to register with each server. If a user wishes to access multiple application servers, he requires to register with each of the servers. Although multi-server authentication schemes introduced a scalable platform such that a user can interact with any server using single registration. Recently, Chuang and Chen proposed an efficient multi-server authenticated key agreement scheme based on smart cards along with password and biometrics. This is a lightweight authentication scheme which requires the computation of only hash function. In this article, we present a brief review of Chuang and Chen's scheme. We analyze Chuang and Chen's scheme and identify that their scheme does not resist stolen smart card attack which causes the user's impersonation attack, server spoofing attack and man-in-the middle attack. Additionally, we show that their scheme has a weak key agreement protocol, which does not ensure forward secrecy.
Antifragility = Elasticity + Resilience + Machine Learning: Models and Algorithms for Open System Fidelity
Venue: arXiv cs.OH 2014
Year: 2014

We introduce a model of the fidelity of open systems - fidelity being interpreted here as the compliance between corresponding figures of interest in two separate but communicating domains. A special case of fidelity is given by real-timeliness and synchrony, in which the figure of interest is the physical and the system's notion of time. Our model covers two orthogonal aspects of fidelity, the first one focusing on a system's steady state and the second one capturing that system's dynamic and behavioural characteristics. We discuss how the two aspects correspond respectively to elasticity and resilience and we highlight each aspect's qualities and limitations. Finally we sketch the elements of a new model coupling both of the first model's aspects and complementing them with machine learning. Finally, a conjecture is put forward that the new model may represent a first step towards compositional criteria for antifragile systems.
Does Syntactic Knowledge help English-Hindi SMT?
Venue: arXiv cs.CL 2014
Year: 2014

In this paper we explore various parameter settings of the state-of-art Statistical Machine Translation system to improve the quality of the translation for a `distant' language pair like English-Hindi. We proposed new techniques for efficient reordering. A slight improvement over the baseline is reported using these techniques. We also show that a simple pre-processing step can improve the quality of the translation significantly.
The Design of a Network-On-Chip Architecture Based On An Avionic Protocol
Venue: arXiv cs.AR 2014
Year: 2014

When the Network-On-Chip (NoC) paradigm was introduced, many researchers have proposed many novelistic NoC architectures, tools and design strategies. In this paper we introduce a new approach in the field of designing Network-On-Chip (NoC). Our inspiration came from an avionic protocol which is the AFDX protocol. The proposed NoC architecture is a switch centric architecture, with exclusive shortcuts between hosts and utilizes the flexibility, the reliability and the performances offered by AFDX.
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative
Venue: arXiv cs.DC 2014
Year: 2014

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be \emph{silent} (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Omega(\log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(\log\log n) memory bits per node, and stabilizes in O(n\log^2 n) rounds. Our protocol has several attractive features that make it suitable for practical purposes. First, the communication model fits with the model used by existing compilers for real networks. Second, the size of the ring (or any upper bound on this size) needs not to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption, besides a weakly fair scheduler, is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time or minimal assumptions.
What are the fundamental structures of concurrency? We still don't know!
Venue: arXiv cs.LO 2014
Year: 2014

Process algebra has been successful in many ways; but we don't yet see the lineaments of a fundamental theory. Some fleeting glimpses are sought from Petri Nets, physics and geometry.
A Review of Verbal and Non-Verbal Human-Robot Interactive Communication
Venue: arXiv cs.RO 2014
Year: 2014

In this paper, an overview of human-robot interactive communication is presented, covering verbal as well as non-verbal aspects of human-robot interaction. Following a historical introduction, and motivation towards fluid human-robot communication, ten desiderata are proposed, which provide an organizational axis both of recent as well as of future research on human-robot communication. Then, the ten desiderata are examined in detail, culminating to a unifying discussion, and a forward-looking conclusion.
Solving Cubic Equations By the Quadratic Formula
Venue: arXiv cs.NA 2014
Year: 2014

Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $θ$, $V(θ)$, i.e. the set of points that are closer to $θ$ than to the other roots. We prove at least one critical point has the Voronoi property and characterize the cases when both satisfy this property. It is known that for any $ξ\in V(θ)$, the sequence $B_m(ξ) =ξ- p(ξ) d_{m-2}/d_{m-1}$ converges to $θ$, where $d_m$ satisfies the recurrence $d_m =p'(ξ)d_{m-1}-0.5 p(ξ)p''(ξ)d_{m-2} +p^2(ξ)d_{m-3}$, $d_0 =1, d_{-1}=d_{-2}=0$. Thus by the Voronoi property, there is a solution $c$ of $p'(z)=0$ where $B_m(c)$ converges to a root of $p(z)$. The speed of convergence is dependent on the ratio of the distances between $c$ and the closest and the second closest roots of $p(z)$. This results in a different algorithm for solving a cubic equation than the classical methods. We give polynomiography for an example.
Signal recovery using expectation consistent approximation for linear observations
Venue: arXiv cs.IT 2014
Year: 2014

A signal recovery scheme is developed for linear observation systems based on expectation consistent (EC) mean field approximation. Approximate message passing (AMP) is known to be consistent with the results obtained using the replica theory, which is supposed to be exact in the large system limit, when each entry of the observation matrix is independently generated from an identical distribution. However, this is not necessarily the case for general matrices. We show that EC recovery exhibits consistency with the replica theory for a wider class of random observation matrices. This is numerically confirmed by experiments for the Bayesian optimal signal recovery of compressed sensing using random row-orthogonal matrices.
Transition from Analysis to Software Design: A Review and New Perspective
Venue: arXiv cs.SE 2014
Year: 2014

Analysis and design phases are the most crucial part of the software development life-cycle. Reusing the artifacts of these early phases is very beneficial to improve the productivity and software quality. In this paper we analyze the literature on the automatic transformation of artifacts from the problem space (i.e., requirement analysis models) into artifacts in the solution space (i.e., architecture, design and implementation code). The goal is to assess the current state of the art with regard to the ability of automatically reusing previously developed software designs in synthesizing a new design for a given requirement. We surveyed various related areas such as model-driven development and model transformation techniques. Our analysis revealed that this topic has not been satisfactorily covered yet. Accordingly, we propose a framework consists of three stages to address uncovered limitations in current approaches.
A user-friendly nano-CT image alignment and 3D reconstruction platform based on LabVIEW
Venue: arXiv cs.CE 2014
Year: 2014

X-ray computed tomography at the nanometer scale (nano-CT) offers a wide range of applications in scientific and industrial areas. Here we describe a reliable, user-friendly and fast software package based on LabVIEW that may allow to perform all procedures after the acquisition of raw projection images in order to obtain the inner structure of the investigated sample. A suitable image alignment process to address misalignment problems among image series due to mechanical manufacturing errors, thermal expansion and other external factors has been considered together with a novel fast parallel beam 3D reconstruction procedure, developed ad hoc to perform the tomographic reconstruction. Remarkably improved reconstruction results obtained at the Beijing Synchrotron Radiation Facility after the image calibration confirmed the fundamental role of this image alignment procedure that minimizes unwanted blurs and additional streaking artifacts always present in reconstructed slices. Moreover, this nano-CT image alignment and its associated 3D reconstruction procedure fully based on LabVIEW routines, significantly reduce the data post-processing cycle, thus making faster and easier the activity of the users during experimental runs.
The Effect Of Online Cooperative Homework On Students' Academic Success
Venue: arXiv cs.CY 2014
Year: 2014

In this study, the effect of online cooperative learning homework practices on academic success of students is searched. The experience group of the research consists of 58 students from Anadolu University Education Faculty Education of Computer and Instruction Technology Section. Students in A section are taken to traditional method by neutral appointment; those in B section are taken to online homework practice method. In each class consisting of 29 people, it's decided that 14 students prepare their homework individually; the rest 15 students prepare their homework with cooperative as triple groups. It's students' own choice to prepare their homework individually or cooperatively. There has been a success scale at the end of the teaching period. According to research results, there isn't statistically considerable difference between students who attend traditional homework practices and online homework practices. According to research results, there isn't statistically considerable difference between students who attend individual homework practices and cooperative homework practices. The academic success of the students who attend online-based individual homework practices is higher than traditional individual and online based cooperative learning homework practices.
An Analysis of Ruspini Partitions in Gödel Logic
Venue: arXiv cs.LO 2014
Year: 2014

By a Ruspini partition we mean a finite family of fuzzy sets $\{f_1, \ldots, f_n\}$, $f_i : [0,1] \to [0,1]$, such that $\sum_{i=1}^n f_i(x)=1$ for all $x \in [0,1]$, where $[0,1]$ denotes the real unit interval. We analyze such partitions in the language of Gödel logic. Our first main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition by a theory in Gödel logic. Our second main result extends this analysis to Ruspini partitions fulfilling the natural additional condition that each $f_i$ has at most one left and one right neighbour, meaning that $\min_{x \in [0,1]}{\{f_{i_1}(x),f_{i_2}(x),f_{i_3}(x)\}}=0$ holds for $i_1\neq i_2\neq i_3$.
Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
Venue: arXiv cs.LO 2014
Year: 2014

It is shown that for any fixed $i>0$, the $Σ_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for $\mathsfΣ^{\mathsf{EXP}}_{i}$, the $i$-th level of the weak EXP hierarchy, an analogue to the polynomial-time hierarchy residing between $\mathsf{NEXP}$ and $\mathsf{EXPSPACE}$. This result completes the computational complexity landscape for Presburger arithmetic, a line of research which dates back to the seminal work by Fischer & Rabin in 1974. Moreover, we apply some of the techniques developed in the proof of the lower bound in order to establish bounds on sets of naturals definable in the $Σ_1$-fragment of Presburger arithmetic: given a $Σ_1$-formula $Φ(x)$, it is shown that the set of non-negative solutions is an ultimately periodic set whose period is at most doubly-exponential and that this bound is tight.
Non-Termination Analysis of Java Bytecode
Venue: arXiv cs.PL 2014
Year: 2014

We introduce a fully automated static analysis that takes a sequential Java bytecode program P as input and attempts to prove that there exists an infinite execution of P. The technique consists in compiling P into a constraint logic program P_CLP and in proving non-termination of P_CLP; when P consists of instructions that are exactly compiled into constraints, the non-termination of P_CLP entails that of P. Our approach can handle method calls; to the best of our knowledge, it is the first static approach for Java bytecode able to prove the existence of infinite recursions. We have implemented our technique inside the Julia analyser. We have compared the results of Julia on a set of 113 programs with those provided by AProVE and Invel, the only freely usable non-termination analysers comparable to ours that we are aware of. Only Julia could detect non-termination due to infinite recursion.
How are identifiers named in open source software? About popularity and consistency
Venue: arXiv cs.SE 2014
Year: 2014

With the rapid increasing of software project size and maintenance cost, adherence to coding standards especially by managing identifier naming, is attracting a pressing concern from both computer science educators and software managers. Software developers mainly use identifier names to represent the knowledge recorded in source code. However, the popularity and adoption consistency of identifier naming conventions have not been revealed yet in this field. Taking forty-eight popular open source projects written in three top-ranking programming languages Java, C and C++ as examples, an identifier extraction tool based on regular expression matching is developed. In the subsequent investigation, some interesting findings are obtained. For the identifier naming popularity, it is found that Camel and Pascal naming conventions are leading the road while Hungarian notation is vanishing. For the identifier naming consistency, we have found that the projects written in Java have a much better performance than those written in C and C++. Finally, academia and software industry are urged to adopt the most popular naming conventions consistently in their practices so as to lead the identifier naming to a standard, unified and high-quality road.
An Integer Programming Approach to UEP Coding for Multiuser Broadcast Channels
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, an integer programming approach is introduced to construct Unequal Error Protection (UEP) codes for multiuser broadcast channels. We show that the optimal codes can be constructed that satisfy the integer programming bound. Based on the bound, we compute asymptotic code rate and perform throughput analysis for the degraded broadcast channel.
Compositional Operators in Distributional Semantics
Venue: arXiv cs.CL 2014
Year: 2014

This survey presents in some detail the main advances that have been recently taking place in Computational Linguistics towards the unification of the two prominent semantic paradigms: the compositional formal semantics view and the distributional models of meaning based on vector spaces. After an introduction to these two approaches, I review the most important models that aim to provide compositionality in distributional semantics. Then I proceed and present in more detail a particular framework by Coecke, Sadrzadeh and Clark (2010) based on the abstract mathematical setting of category theory, as a more complete example capable to demonstrate the diversity of techniques and scientific disciplines that this kind of research can draw from. This paper concludes with a discussion about important open issues that need to be addressed by the researchers in the future.
Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs
Venue: arXiv cs.CG 2014
Year: 2014

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and consequently cheaper. A straight-line drawing of a planar graph G of n vertices is a drawing of G such that each edge is drawn as a straight-line segment without edge crossings. However, a problem with current graph layout methods which are capable of producing satisfactory results for a wide range of graphs is that they often put an extremely high demand on computational resources. This paper introduces a new layout method, which nicely draws internally convex of planar graph that consumes only little computational resources and does not need any heavy duty preprocessing. Here, we use two methods: The first is self organizing map known from unsupervised neural networks which is known as (SOM) and the second method is Inverse Self Organized Map (ISOM).