OpenRaiser/Intern-Atlas huggingface dataset:
String diagrams for game theory
Venue: arXiv cs.GT 2015
Year: 2015

This paper presents a monoidal category whose morphisms are games (in the sense of game theory, not game semantics) and an associated diagrammatic language. The two basic operations of a monoidal category, namely categorical composition and tensor product, correspond roughly to sequential and simultaneous composition of games. This leads to a compositional theory in which we can reason about properties of games in terms of corresponding properties of the component parts. In particular, we give a definition of Nash equilibrium which is recursive on the causal structure of the game. The key technical idea in this paper is the use of continuation passing style for reasoning about the future consequences of players' choices, closely based on applications of selection functions in game theory. Additionally, the clean categorical foundation gives many opportunities for generalisation, for example to learning agents.
HyCell: Enabling GREEN Base Station Operations in Software-Defined Radio Access Networks
Venue: arXiv cs.NI 2015
Year: 2015

The radio access networks (RANs) need to support massive and diverse data traffic with limited spectrum and energy. To cope with this challenge, software-defined radio access network (SDRAN) architectures have been proposed to renovate the RANs. However, current researches lack the design and evaluation of network protocols. In this paper, we address this problem by presenting the protocol design and evaluation of hyper-cellular networks (HyCell), an SDRAN framework making base station (BS) operations globally resource-optimized and energy-efficient (GREEN). Specifically, we first propose a separation scheme to realize the decoupled air interface in HyCell. Then we design a BS dispatching protocol which determines and assigns the optimal BS for serving mobile users, and a BS sleeping protocol to improve the network energy efficiency. Finally, we evaluate the proposed design in our HyCell testbed. Our evaluation validates the feasibility of the proposed separation scheme, demonstrates the effectiveness of BS dispatching, and shows great potential in energy saving through BS sleeping control.
On Orchestrating Virtual Network Functions in NFV
Venue: arXiv cs.NI 2015
Year: 2015

Middleboxes or network appliances like firewalls, proxies and WAN optimizers have become an integral part of today's ISP and enterprise networks. Middlebox functionalities are usually deployed on expensive and proprietary hardware that require trained personnel for deployment and maintenance. Middleboxes contribute significantly to a network's capital and operational costs. In addition, organizations often require their traffic to pass through a specific sequence of middleboxes for compliance with security and performance policies. This makes the middlebox deployment and maintenance tasks even more complicated. Network Function Virtualization (NFV) is an emerging and promising technology that is envisioned to overcome these challenges. It proposes to move packet processing from dedicated hardware middleboxes to software running on commodity servers. In NFV terminology, software middleboxes are referred to as Virtualized Network Functions (VNFs). It is a challenging problem to determine the required number and placement of VNFs that optimizes network operational costs and utilization, without violating service level agreements. We call this the VNF Orchestration Problem (VNF-OP) and provide an Integer Linear Programming (ILP) formulation with implementation in CPLEX. We also provide a dynamic programming based heuristic to solve larger instances of VNF-OP. Trace driven simulations on real-world network topologies demonstrate that the heuristic can provide solutions that are within 1.3 times of the optimal solution. Our experiments suggest that a VNF based approach can provide more than 4x reduction in the operational cost of a network.
Exploring NK Fitness Landscapes Using Imitative Learning
Venue: arXiv cs.MA 2015
Year: 2015

The idea that a group of cooperating agents can solve problems more efficiently than when those agents work independently is hardly controversial, despite our obliviousness of the conditions that make cooperation a successful problem solving strategy. Here we investigate the performance of a group of agents in locating the global maxima of NK fitness landscapes with varying degrees of ruggedness. Cooperation is taken into account through imitative learning and the broadcasting of messages informing on the fitness of each agent. We find a trade-off between the group size and the frequency of imitation: for rugged landscapes, too much imitation or too large a group yield a performance poorer than that of independent agents. By decreasing the diversity of the group, imitative learning may lead to duplication of work and hence to a decrease of its effective size. However, when the parameters are set to optimal values the cooperative group substantially outperforms the independent agents.
Modeling browser-based distributed evolutionary computation systems
Venue: arXiv cs.DC 2015
Year: 2015

From the era of big science we are back to the "do it yourself", where you do not have any money to buy clusters or subscribe to grids but still have algorithms that crave many computing nodes and need them to measure scalability. Fortunately, this coincides with the era of big data, cloud computing, and browsers that include JavaScript virtual machines. Those are the reasons why this paper will focus on two different aspects of volunteer or freeriding computing: first, the pragmatic: where to find those resources, which ones can be used, what kind of support you have to give them; and then, the theoretical: how evolutionary algorithms can be adapted to an environment in which nodes come and go, have different computing capabilities and operate in complete asynchrony of each other. We will examine the setup needed to create a very simple distributed evolutionary algorithm using JavaScript and then find a model of how users react to it by collecting data from several experiments featuring different classical benchmark functions.
Is the Low-Complexity Mobile-Relay-Aided FFR-DAS Capable of Outperforming the High-Complexity CoMP?
Venue: arXiv cs.IT 2015
Year: 2015

Coordinated multi-point transmission/reception aided collocated antenna system (CoMP-CAS) and mobile relay assisted fractional frequency reuse distributed antenna system (MR-FFR-DAS) constitute a pair of virtual-MIMO based technical options for achieving high spectral efficiency in interference-limited cellular networks. In practice both techniques have their respective pros and cons, which are studied in this paper by evaluating the achievable cell-edge performance on the uplink of multicell systems. We show that assuming the same antenna configuration in both networks, the maximum available cooperative spatial diversity inherent in the MR-FFR-DAS is lower than that of the CoMP-CAS. However, when the cell-edge MSs have a low transmission power, the lower-complexity MR-FFR-DAS relying on the simple single-cell processing may outperform the CoMP-CAS by using the proposed soft-combining based probabilistic data association (SC-PDA) receiver, despite the fact that the latter scheme is more complex and incurs a higher cooperation overhead. Furthermore, the benefits of the SC-PDA receiver may be enhanced by properly selecting the MRs' positions. Additionally, we show that the performance of the cell-edge MSs roaming near the angular direction halfway between two adjacent RAs (i.e. the "worst-case direction") of the MR-FFR-DAS may be more significantly improved than that of the cell-edge MSs of other directions by using multiuser power control, which also improves the fairness amongst cell-edge MSs. Our simulation results show that given a moderate MS transmit power, the proposed MR-FFR-DAS architecture employing the SC-PDA receiver is capable of achieving significantly better bit-error rate (BER) and effective throughput across the entire cell-edge area, including even the "worst-case direction" and the cell-edge boundary, than the CoMP-CAS architecture.
Model Checking Tap Withdrawal in C. Elegans
Venue: arXiv cs.LO 2015
Year: 2015

We present what we believe to be the first formal verification of a biologically realistic (nonlinear ODE) model of a neural circuit in a multicellular organism: Tap Withdrawal (TW) in \emph{C. Elegans}, the common roundworm. TW is a reflexive behavior exhibited by \emph{C. Elegans} in response to vibrating the surface on which it is moving; the neural circuit underlying this response is the subject of this investigation. Specifically, we perform reachability analysis on the TW circuit model of Wicks et al. (1996), which enables us to estimate key circuit parameters. Underlying our approach is the use of Fan and Mitra's recently developed technique for automatically computing local discrepancy (convergence and divergence rates) of general nonlinear systems. We show that the results we obtain are in agreement with the experimental results of Wicks et al. (1995). As opposed to the fixed parameters found in most biological models, which can only produce the predominant behavior, our techniques characterize ranges of parameters that produce (and do not produce) all three observed behaviors: reversal of movement, acceleration, and lack of response.
Construction of FuzzyFind Dictionary using Golay Coding Transformation for Searching Applications
Venue: arXiv cs.DB 2015
Year: 2015

Searching through a large volume of data is very critical for companies, scientists, and searching engines applications due to time complexity and memory complexity. In this paper, a new technique of generating FuzzyFind Dictionary for text mining was introduced. We simply mapped the 23 bits of the English alphabet into a FuzzyFind Dictionary or more than 23 bits by using more FuzzyFind Dictionary, and reflecting the presence or absence of particular letters. This representation preserves closeness of word distortions in terms of closeness of the created binary vectors within Hamming distance of 2 deviations. This paper talks about the Golay Coding Transformation Hash Table and how it can be used on a FuzzyFind Dictionary as a new technology for using in searching through big data. This method is introduced by linear time complexity for generating the dictionary and constant time complexity to access the data and update by new data sets, also updating for new data sets is linear time depends on new data points. This technique is based on searching only for letters of English that each segment has 23 bits, and also we have more than 23-bit and also it could work with more segments as reference table.
Mechanism design for resource allocation with applications to centralized multi-commodity routing
Venue: arXiv cs.GT 2015
Year: 2015

We formulate and study the algorithmic mechanism design problem for a general class of resource allocation settings, where the center redistributes the private resources brought by individuals. Money transfer is forbidden. Distinct from the standard literature, which assumes the amount of resources brought by an individual to be public information, we consider this amount as an agent's private, possibly multi-dimensional type. Our goal is to design truthful mechanisms that achieve two objectives: max-min and Pareto efficiency. For each objective, we provide a reduction that converts any optimal algorithm into a strategy-proof mechanism that achieves the same objective. Our reductions do not inspect the input algorithms but only query these algorithms as oracles. Applying the reductions, we produce strategy-proof mechanisms in a non-trivial application: network route allocation. Our models and result in the application are valuable on their own rights.
A Comparative Analysis of Tensor Decomposition Models Using Hyper Spectral Image
Venue: arXiv cs.NA 2015
Year: 2015

Hyper spectral imaging is a remote sensing technology, providing variety of applications such as material identification, space object identification, planetary exploitation etc. It deals with capturing continuum of images of the earth surface from different angles. Due to the multidimensional nature of the image, multi-way arrays are one of the possible solutions for analyzing hyper spectral data. This multi-way array is called tensor. Our approach deals with implementing three decomposition models LMLRA, BTD and CPD to the sample data for choosing the best decomposition of the data set. The results have proved that Block Term Decomposition (BTD) is the best tensor model for decomposing the hyper spectral image in to resultant factor matrices.
Identifying Web Tables - Supporting a Neglected Type of Content on the Web
Venue: arXiv cs.IR 2015
Year: 2015

The abundance of the data in the Internet facilitates the improvement of extraction and processing tools. The trend in the open data publishing encourages the adoption of structured formats like CSV and RDF. However, there is still a plethora of unstructured data on the Web which we assume contain semantics. For this reason, we propose an approach to derive semantics from web tables which are still the most popular publishing tool on the Web. The paper also discusses methods and services of unstructured data extraction and processing as well as machine learning techniques to enhance such a workflow. The eventual result is a framework to process, publish and visualize linked open data. The software enables tables extraction from various open data sources in the HTML format and an automatic export to the RDF format making the data linked. The paper also gives the evaluation of machine learning techniques in conjunction with string similarity functions to be applied in a tables recognition task.
Exploring Non-Homogeneity and Dynamicity of High Scale Cloud through Hive and Pig
Venue: arXiv cs.DC 2015
Year: 2015

Cloud computing deals with heterogeneity and dynamicity at all levels and therefore there is a need to manage resources in such an environment and properly allocate them. Resource planning and scheduling requires a proper understanding of arrival patterns and scheduling of resources. Study of workloads can aid in proper understanding of their associated environment. Google has released its latest version of cluster trace, trace version 2.1 in November 2014.The trace consists of cell information of about 29 days spanning across 700k jobs. This paper deals with statistical analysis of this cluster trace. Since the size of trace is very large, Hive which is a Hadoop distributed file system (HDFS) based platform for querying and analysis of Big data, has been used. Hive was accessed through its Beeswax interface. The data was imported into HDFS through HCatalog. Apart from Hive, Pig which is a scripting language and provides abstraction on top of Hadoop was used. To the best of our knowledge the analytical method adopted by us is novel and has helped in gaining several useful insights. Clustering of jobs and arrival time has been done in this paper using K-means++ clustering followed by analysis of distribution of arrival time of jobs which revealed weibull distribution while resource usage was close to zip-f like distribution and process runtimes revealed heavy tailed distribution.
Fusing Continuous-valued Medical Labels using a Bayesian Model
Venue: arXiv cs.LG 2015
Year: 2015

With the rapid increase in volume of time series medical data available through wearable devices, there is a need to employ automated algorithms to label data. Examples of labels include interventions, changes in activity (e.g. sleep) and changes in physiology (e.g. arrhythmias). However, automated algorithms tend to be unreliable resulting in lower quality care. Expert annotations are scarce, expensive, and prone to significant inter- and intra-observer variance. To address these problems, a Bayesian Continuous-valued Label Aggregator(BCLA) is proposed to provide a reliable estimation of label aggregation while accurately infer the precision and bias of each algorithm. The BCLA was applied to QT interval (pro-arrhythmic indicator) estimation from the electrocardiogram using labels from the 2006 PhysioNet/Computing in Cardiology Challenge database. It was compared to the mean, median, and a previously proposed Expectation Maximization (EM) label aggregation approaches. While accurately predicting each labelling algorithm's bias and precision, the root-mean-square error of the BCLA was 11.78$\pm$0.63ms, significantly outperforming the best Challenge entry (15.37$\pm$2.13ms) as well as the EM, mean, and median voting strategies (14.76$\pm$0.52ms, 17.61$\pm$0.55ms, and 14.43$\pm$0.57ms respectively with $p<0.0001$).
Structural Similarity Index SSIMplified: Is there really a simpler concept at the heart of image quality measurement?
Venue: arXiv cs.CV 2015
Year: 2015

The Structural Similarity Index (SSIM) is generally considered to be a milestone in the recent history of Image Quality Assessment (IQA). Alas, SSIM's accepted development from the product of three heuristic factors continues to obscure it's real underlying simplicity. Starting instead from a symmetric-antisymmetric reformulation we first show SSIM to be a contrast or visibility function in the classic sense. Furthermore, the previously enigmatic structural covariance is revealed to be the difference of variances. The second step, eliminating the intrinsic quadratic nature of SSIM, allows a near linear correlation with human observer scores, and without invoking the usual, but arbitrary, sigmoid model fitting. We conclude that SSIM can be re-interpreted in terms of perceptual masking: it is essentially equivalent to a normalised error or noise visibility function (NVF), and, furthermore, the NVF alone explains it success in modelling perceptual image quality. We use the term Dissimilarity Quotient (DQ) for the specifically anti/symmetric SSIM derived NVF. It seems that IQA researchers may now have two choices: 1) Continue to use the complex SSIM formula, but noting that SSIM only works coincidentally since the covariance term is actually the mean square error (MSE) in disguise. 2) Use the simplest of all perceptually-masked image quality metrics, namely NVF or DQ. On this choice Occam is clear: in the absence of differences in predictive ability, the fewer assumptions that are made, the better.
Why to Decouple the Uplink and Downlink in Cellular Networks and How To Do It
Venue: arXiv cs.NI 2015
Year: 2015

Ever since the inception of mobile telephony, the downlink and uplink of cellular networks have been coupled, i.e. mobile terminals have been constrained to associate with the same base station (BS) in both the downlink and uplink directions. New trends in network densification and mobile data usage increase the drawbacks of this constraint, and suggest that it should be revisited. In this paper we identify and explain five key arguments in favor of Downlink/Uplink Decoupling (DUDe) based on a blend of theoretical, experimental, and logical arguments. We then overview the changes needed in current (LTE-A) mobile systems to enable this decoupling, and then look ahead to fifth generation (5G) cellular standards. We believe the introduced paradigm will lead to significant gains in network throughput, outage and power consumption at a much lower cost compared to other solutions providing comparable or lower gains.
Price and capacity competition in balancing markets with energy storage
Venue: arXiv cs.GT 2015
Year: 2015

Energy storage can absorb variability from the rising number of wind and solar power producers. Storage is different from the conventional generators that have traditionally balanced supply and demand on fast time scales due to its hard energy capacity constraints, dynamic coupling, and low marginal costs. These differences are leading system operators to propose new mechanisms for enabling storage to participate in reserve and real-time energy markets. The persistence of market power and gaming in electricity markets suggests that these changes will expose new vulnerabilities. We develop a new model of strategic behavior among storages in energy balancing markets. Our model is a two-stage game that generalizes a classic model of capacity followed by Bertrand-Edgeworth price competition by explicitly modeling storage dynamics and uncertainty in the pricing stage. By applying the model to balancing markets with storage, we are able to compare capacity and energy-based pricing schemes, and to analyze the dynamic effects of the market horizon and energy losses due to leakage. Our first key finding is that capacity pricing leads to higher prices and higher capacity commitments, and that energy pricing leads to lower, randomized prices and lower capacity commitments. Second, we find that a longer market horizon and higher physical efficiencies lead to lower prices by inducing the storage to compete to have their states of charge cycled more frequently.
Massive MIMO: Ten Myths and One Critical Question
Venue: arXiv cs.IT 2015
Year: 2015

Wireless communications is one of the most successful technologies in modern years, given that an exponential growth rate in wireless traffic has been sustained for over a century (known as Cooper's law). This trend will certainly continue driven by new innovative applications; for example, augmented reality and internet-of-things. Massive MIMO (multiple-input multiple-output) has been identified as a key technology to handle orders of magnitude more data traffic. Despite the attention it is receiving from the communication community, we have personally witnessed that Massive MIMO is subject to several widespread misunderstandings, as epitomized by following (fictional) abstract: "The Massive MIMO technology uses a nearly infinite number of high-quality antennas at the base stations. By having at least an order of magnitude more antennas than active terminals, one can exploit asymptotic behaviors that some special kinds of wireless channels have. This technology looks great at first sight, but unfortunately the signal processing complexity is off the charts and the antenna arrays would be so huge that it can only be implemented in millimeter wave bands." The statements above are, in fact, completely false. In this overview article, we identify ten myths and explain why they are not true. We also ask a question that is critical for the practical adoption of the technology and which will require intense future research activities to answer properly. We provide references to key technical papers that support our claims, while a further list of related overview and technical papers can be found at the Massive MIMO Info Point: http://massivemimo.eu
Two Computational Models for Simulating the Tumbling Motion of Elongated Particles in Fluids
Venue: arXiv cs.CE 2015
Year: 2015

Suspensions with fiber-like particles in the low Reynolds number regime are modeled by two different approaches that both use a Lagrangian representation of individual particles. The first method is the well-established formulation based on Stokes flow that is formulated as integral equations. It uses a slender body approximation for the fibers to represent the interaction between them directly without explicitly computing the flow field. The second is a new technique using the 3D lattice Boltzmann method on parallel supercomputers. Here the flow computation is coupled to a computational model of the dynamics of rigid bodies using fluid-structure interaction techniques. Both methods can be applied to simulate fibers in fluid flow. They are carefully validated and compared against each other, exposing systematically their strengths and weaknesses regarding their accuracy, the computational cost, and possible model extensions.