OpenRaiser/Intern-Atlas huggingface dataset:
Classification of automatic software build methods
Venue: arXiv cs.SE 2013
Year: 2013

The process of creating working software from source code and other components (like libraries, database files, etc.) is called "software build". Apart from linking and compiling, it can include other steps like automated testing, static code analysis, documentation generation, deployment and other. All that steps can be automated using a build description of some sort (e.g. script). This article classifies the automatic software build processes beginning at build script and reaching the various types of continuous integration.
Life-Add: Lifetime Adjustable Design for WiFi Networks with Heterogeneous Energy Supplies
Venue: arXiv cs.IT 2013
Year: 2013

WiFi usage significantly reduces the battery lifetime of handheld devices such as smartphones and tablets, due to its high energy consumption. In this paper, we propose "Life-Add": a Lifetime Adjustable design for WiFi networks, where the devices are powered by battery, electric power, and/or renewable energy. In Life-Add, a device turns off its radio to save energy when the channel is sensed to be busy, and sleeps for a random time period before sensing the channel again. Life-Add carefully controls the devices' average sleep periods to improve their throughput while satisfying their operation time requirement. It is proven that Life-Add achieves near-optimal proportional-fair utility performance for single access point (AP) scenarios. Moreover, Life-Add alleviates the near-far effect and hidden terminal problem in general multiple AP scenarios. Our ns-3 simulations show that Life-Add simultaneously improves the lifetime, throughput, and fairness performance of WiFi networks, and coexists harmoniously with IEEE 802.11.
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
Venue: arXiv cs.CG 2013
Year: 2013

Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortest path in S between two points s, t in R^2, where the distances are measured according to the weighted Euclidean metric-the length of a path is defined to be the weighted sum of (Euclidean) lengths of the sub-paths within each region. We show that this problem cannot be solved in the Algebraic Computation Model over the Rational Numbers (ACMQ). In the ACMQ, one can compute exactly any number that can be obtained from the rationals Q by applying a finite number of operations from +, -, \times, ÷, \sqrt[k]{}, for any integer k >= 2. Our proof uses Galois theory and is based on Bajaj's technique.
A toy model of information retrieval system based on quantum probability
Venue: arXiv cs.IR 2013
Year: 2013

Recent numerical results show that non-Bayesian knowledge revision may be helpful in search engine training and optimization. In order to demonstrate how basic assumption about about the physical nature (and hence the observed statistics) of retrieved documents can affect the performance of search engines we suggest an idealized toy model with minimal number of parameters.
A game-theoretic analysis of baccara chemin de fer
Venue: arXiv cs.GT 2013
Year: 2013

Assuming that cards are dealt with replacement from a single deck and that each of Player and Banker sees the total of his own two-card hand but not its composition, baccara is a 2 x 2^88 matrix game, which was solved by Kemeny and Snell in 1957. Assuming that cards are dealt without replacement from a d-deck shoe and that Banker sees the composition of his own two-card hand while Player sees only his own total, baccara is a 2 x 2^484 matrix game, which was solved by Downton and Lockwood in 1975 for d=1,2,...,8. Assuming that cards are dealt without replacement from a d-deck shoe and that each of Player and Banker sees the composition of his own two-card hand, baccara is a 2^5 x 2^484 matrix game, which is solved herein for every positive integer d.
Denoising the 3-Base Periodicity Walks of DNA Sequences in Gene Finding
Venue: arXiv cs.CE 2013
Year: 2013

A nonlinear Tracking-Differentiator is one-input-two-output system that can generate smooth approximation of measured signals and get the derivatives of the signals. The nonlinear tracking-Differentiator is explored to denoise and generate the derivatives of the walks of the 3-periodicity of DNA sequences. An improved algorithm for gene finding is presented using the nonlinear Tracking-Differentiator. The gene finding algorithm employs the 3-base periodicity of coding region. The 3-base periodicity DNA walks are denoised and tracked using the nonlinear Tracking-Differentiator. Case studies demonstrate that the nonlinear Tracking-Differentiator is an effective method to improve the accuracy of the gene finding algorithm.
On/Off Macrocells and Load Balancing in Heterogeneous Cellular Networks
Venue: arXiv cs.IT 2013
Year: 2013

The rate distribution in heterogeneous networks (HetNets) greatly benefits from load balancing, by which mobile users are pushed onto lightly-loaded small cells despite the resulting loss in SINR. This offloading can be made more aggressive and robust if the macrocells leave a fraction of time/frequency resource blank, which reduces the interference to the offloaded users. We investigate the joint optimization of this technique - referred to in 3GPP as enhanced intercell interference coordination (eICIC) via almost blank subframes (ABSs) - with offloading in this paper. Although the joint cell association and blank resource (BR) problem is nominally combinatorial, by allowing users to associate with multiple base stations (BSs), the problem becomes convex, and upper bounds the performance versus a binary association. We show both theoretically and through simulation that the optimal solution of the relaxed problem still results in an association that is mostly binary. The optimal association differs significantly when the macrocell is on or off; in particular the offloading can be much more aggressive when the resource is left blank by macro BSs. Further, we observe that jointly optimizing the offloading with BR is important. The rate gain for cell edge users (the worst 3-10%) is very large - on the order of 5-10x - versus a naive association strategy without macrocell blanking.
Memory size bounds of prefix DAGs
Venue: arXiv cs.DS 2013
Year: 2013

In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by merging isomorphic subtrees.
What is Visualization Really for?
Venue: arXiv cs.HC 2013
Year: 2013

Whenever a visualization researcher is asked about the purpose of visualization, the phrase "gaining insight" by and large pops out instinctively. However, it is not absolutely factual that all uses of visualization are for gaining a deep understanding, unless the term insight is broadened to encompass all types of thought. Even when insight is the focus of a visualization task, it is rather difficult to know what insight is gained, how much, or how accurate. In this paper, we propose that "saving time" in accomplishing a user's task is the most fundamental objective. By giving emphasis to saving time, we can establish a concrete metric, alleviate unnecessary contention caused by different interpretations of insight, and stimulate new research efforts in some aspects of visualization, such as empirical studies, design optimisation and theories of visualization.
The Web Geometry Laboratory Project
Venue: arXiv cs.CY 2013
Year: 2013

The "Web Geometry Laboratory" (WGL) project's goal is to build an adaptive and collaborative blended-learning Web-environment for geometry. In its current version (1.0) the WGL is already a collaborative blended-learning Web-environment integrating a dynamic geometry system (DGS) and having some adaptive features. All the base features needed to implement the adaptive module and to allow the integration of a geometry automated theorem prover (GATP) are also already implemented. The actual testing of the WGL platform by high-school teachers is underway and a field-test with high-school students is being prepared. The adaptive module and the GATP integration will be the next steps of this project.
Edge Detection in Radar Images Using Weibull Distribution
Venue: arXiv cs.CV 2013
Year: 2013

Radar images can reveal information about the shape of the surface terrain as well as its physical and biophysical properties. Radar images have long been used in geological studies to map structural features that are revealed by the shape of the landscape. Radar imagery also has applications in vegetation and crop type mapping, landscape ecology, hydrology, and volcanology. Image processing is using for detecting for objects in radar images. Edge detection; which is a method of determining the discontinuities in gray level images; is a very important initial step in Image processing. Many classical edge detectors have been developed over time. Some of the well-known edge detection operators based on the first derivative of the image are Roberts, Prewitt, Sobel which is traditionally implemented by convolving the image with masks. Also Gaussian distribution has been used to build masks for the first and second derivative. However, this distribution has limit to only symmetric shape. This paper will use to construct the masks, the Weibull distribution which was more general than Gaussian because it has symmetric and asymmetric shape. The constructed masks are applied to images and we obtained good results.
Tree Decomposition based Steiner Tree Computation over Large Graphs
Venue: arXiv cs.DS 2013
Year: 2013

In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.
Efficient methods for computing observation impact in 4D-Var data assimilation
Venue: arXiv cs.CE 2013
Year: 2013

This paper presents a practical computational approach to quantify the effect of individual observations in estimating the state of a system. Such an analysis can be used for pruning redundant measurements, and for designing future sensor networks. The mathematical approach is based on computing the sensitivity of the reanalysis (unconstrained optimization solution) with respect to the data. The computational cost is dominated by the solution of a linear system, whose matrix is the Hessian of the cost function, and is only available in operator form. The right hand side is the gradient of a scalar cost function that quantifies the forecast error of the numerical model. The use of adjoint models to obtain the necessary first and second order derivatives is discussed. We study various strategies to accelerate the computation, including matrix-free iterative solvers, preconditioners, and an in-house multigrid solver. Experiments are conducted on both a small-size shallow-water equations model, and on a large-scale numerical weather prediction model, in order to illustrate the capabilities of the new methodology.
Model Theoretic Characterisations of Description Logics
Venue: arXiv cs.LO 2013
Year: 2013

This thesis studies the model theoretic properties of the Description Logics (DLs) ALC, ALCI, ALCQ, as well as ALCO, ALCQO, ALCQIO and EL. TBoxes of ALC, ALCI and ALCQ are characterised as fragments of FO which are invariant under global bisimulation and disjoint unions. The logics ALCO, ALCQO and ALCQIO, which incorporate individuals, are characterised w.r.t. to the class K of all interpretations which interpret individuals as singleton sets. The characterisations for TBoxes of ALCO and ALCQO both require additionally that an FO-sentence is, under certain circumstances, preserved under forward generated subinterpretations. FO-sentences equivalent to ALCQIO-TBoxes, are - due to ALCQIO's inverse roles - characterised similarly but are required to be preserved under generated subinterpretations. EL as sub-boolean DL is characterised on concept level as the FO-fragment which is preserved under simulation and preserved under direct products. Equally valid is the characterisation by being preserved under simulation and having minimal models. For EL-TBoxes, a global version of simulation was not sufficient but FO-sentences of EL-TBoxes are invariant under global equi-simulation, disjoint unions and direct products. For each of these description logics, the characteristic concepts are explicated and the characterisation is accompanied by an investigation under which notion of saturation the logic in hand enjoys the Hennessy-and-Milner-Property. As application of the results we determine the minimal globally bisimilar companion w.r.t. ALCQO-bisimulation and introduce the L1-to-L2-rewritability problem for TBoxes, where L1 and L2 are (description) logics. The latter is the problem to decide whether or not an L1-TBox can be equivalently expressed as L2-TBox. We give algorithms which decide ALCI-to-ALC-rewritability and ALC-to-EL-rewritability. (See also abstract in the thesis.)
Hierarchical Radio Resource Optimization for Heterogeneous Networks with Enhanced Inter-cell Interference Coordination (eICIC)
Venue: arXiv cs.IT 2013
Year: 2013

Interference is a major performance bottleneck in Heterogeneous Network (HetNet) due to its multi-tier topological structure. We propose almost blank resource block (ABRB) for interference control in HetNet. When an ABRB is scheduled in a macro BS, a resource block (RB) with blank payload is transmitted and this eliminates the interference from this macro BS to the pico BSs. We study a two timescale hierarchical radio resource management (RRM) scheme for HetNet with dynamic ABRB control. The long term controls, such as dynamic ABRB, are adaptive to the large scale fading at a RRM server for co-Tier and cross-Tier interference control. The short term control (user scheduling) is adaptive to the local channel state information within each BS to exploit the multi-user diversity. The two timescale optimization problem is challenging due to the exponentially large solution space. We exploit the sparsity in the interference graph of the HetNet topology and derive structural properties for the optimal ABRB control. Based on that, we propose a two timescale alternative optimization solution for the user scheduling and ABRB control. The solution has low complexity and is asymptotically optimal at high SNR. Simulations show that the proposed solution has significant gain over various baselines.
ÖAGM/AAPR 2013 - The 37th Annual Workshop of the Austrian Association for Pattern Recognition
Venue: arXiv cs.CV 2013
Year: 2013

In this editorial, the organizers summarize facts and background about the event.
ArcLink: Optimization Techniques to Build and Retrieve the Temporal Web Graph
Venue: arXiv cs.IR 2013
Year: 2013

Archiving the web is socially and culturally critical, but presents problems of scale. The Internet Archive's Wayback Machine can replay captured web pages as they existed at a certain point in time, but it has limited ability to provide extensive content and structural metadata about the web graph. While the live web has developed a rich ecosystem of APIs to facilitate web applications (e.g., APIs from Google and Twitter), the web archiving community has not yet broadly implemented this level of access. We present ArcLink, a proof-of-concept system that complements open source Wayback Machine installations by optimizing the construction, storage, and access to the temporal web graph. We divide the web graph construction into four stages (filtering, extraction, storage, and access) and explore optimization for each stage. ArcLink extends the current Web archive interfaces to return content and structural metadata for each URI. We show how this API can be applied to such applications as retrieving inlinks, outlinks, anchortext, and PageRank.
A Polynomial Time Algorithm for the Hamilton Circuit Problem
Venue: arXiv cs.DS 2013
Year: 2013

In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location
Venue: arXiv cs.DS 2013
Year: 2013

The metric uncapacitated facility location problem (UFL) enjoys a special stature in approximation algorithms as a testbed for various techniques. Two generalizations of UFL are capacitated facility location (CFL) and lower-bounded facility location (LBFL). In the former, every facility has a capacity which is the maximum demand that can be assigned to it, while in the latter, every open facility is required to serve a given minimum amount of demand. Both CFL and LBFL are approximable within a constant factor but their respective natural LP relaxations have an unbounded integrality gap. According to Shmoys and Williamson, the existence of a relaxation-based algorithm for CFL is one of the top 10 open problems in approximation algorithms. In this paper we give the first results on this problem. We provide substantial evidence against the existence of a good LP relaxation for CFL by showing unbounded integrality gaps for two families of strengthened formulations. The first family we consider is the hierarchy of LPs resulting from repeated applications of the lift-and-project Lovász-Schrijver procedure starting from the standard relaxation. We show that the LP relaxation for CFL resulting after $Ω(n)$ rounds, where $n$ is the number of facilities in the instance, has unbounded integrality gap. Note that the Lovász-Schrijver procedure is known to yield an exact formulation for CFL in at most $n$ rounds. We also introduce the family of proper relaxations which generalizes to its logical extreme the classic star relaxation, an equivalent form of the natural LP. We characterize the integrality gap of proper relaxations for both LBFL and CFL and show a threshold phenomenon under which it decreases from unbounded to 1.
Robust power allocation for energy-efficient location aware networks
Venue: arXiv cs.IT 2013
Year: 2013

In wireless location-aware networks, mobile nodes (agents) typically obtain their positions through ranging with respect to nodes with known positions (anchors). Transmit power allocation not only affects network lifetime, throughput, and interference, but also determines localization accuracy. In this paper, we present an optimization framework for robust power allocation in network localization to tackle imperfect knowledge of network parameters. In particular, we formulate power allocation problems to minimize the squared position error bound (SPEB) and the maximum directional position error bound (mDPEB), respectively, for a given power budget. We show that such formulations can be efficiently solved via conic programming. Moreover, we design an efficient power allocation scheme that allows distributed computations among agents. The simulation results show that the proposed schemes significantly outperform uniform power allocation, and the robust schemes outperform their non-robust counterparts when the network parameters are subject to uncertainty.
Power Control for D2D Underlaid Cellular Networks: Modeling, Algorithms and Analysis
Venue: arXiv cs.IT 2013
Year: 2013

This paper considers a device-to-device (D2D) underlaid cellular network where an uplink cellular user communicates with the base station while multiple direct D2D links share the uplink spectrum. This paper proposes a random network model based on stochastic geometry and develops centralized and distributed power control algorithms. The goal of the proposed power control algorithms is two-fold: ensure the cellular users have sufficient coverage probability by limiting the interference created by underlaid D2D users, while also attempting to support as many D2D links as possible. For the distributed power control method, expressions for the coverage probabilities of cellular and D2D links are derived and a lower bound on the sum rate of the D2D links is provided. The analysis reveals the impact of key system parameters on the network performance. For example, the bottleneck of D2D underlaid cellular networks is the cross-tier interference between D2D links and the cellular user, not the D2D intra-tier interference. Numerical results show the gains of the proposed power control algorithms and accuracy of the analysis.
Some results on a $χ$-divergence, an~extended~Fisher information and~generalized~Cramér-Rao inequalities
Venue: arXiv cs.IT 2013
Year: 2013

We propose a modified $χ^β$-divergence, give some of its properties, and show that this leads to the definition of a generalized Fisher information. We give generalized Cramér-Rao inequalities, involving this Fisher information, an extension of the Fisher information matrix, and arbitrary norms and power of the estimation error. In the case of a location parameter, we obtain new characterizations of the generalized $q$-Gaussians, for instance as the distribution with a given moment that minimizes the generalized Fisher information. Finally we indicate how the generalized Fisher information can lead to new uncertainty relations.
Fractional Pebbling Game Lower Bounds
Venue: arXiv cs.CC 2013
Year: 2013

Fractional pebbling is a generalization of black-white pebbling introduced recently. In this reasearch paper we solve an open problem by proving a tight lower bound on the pebble weight required to fractionally pebble a balanced d-ary tree of height h. This bound has close ties with branching programs and the separation of P from NL.
Certifying Machine Code Safe from Hardware Aliasing: RISC is not necessarily risky
Venue: arXiv cs.LO 2013
Year: 2013

Sometimes machine code turns out to be a better target for verification than source code. RISC machine code is especially advantaged with respect to source code in this regard because it has only two instructions that access memory. That architecture forms the basis here for an inference system that can prove machine code safe against `hardware aliasing', an effect that occurs in embedded systems. There are programming memes that ensure code is safe from hardware aliasing, but we want to certify that a given machine code is provably safe.
Notes on Physical & Logical Data Layouts
Venue: arXiv cs.DB 2013
Year: 2013

In this short note I review and discuss fundamental options for physical and logical data layouts as well as the impact of the choices on data processing. I should say in advance that these notes offer no new insights, that is, everything stated here has already been published elsewhere. In fact, it has been published in so many different places, such as blog posts, in the literature, etc. that the main contribution is to bring it all together in one place.