OpenRaiser/Intern-Atlas huggingface dataset:
On the diameter of lattice polytopes
Venue: arXiv cs.CG 2015
Year: 2015

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for half-integral polytopes the latter bound is tight for any d.
Improving Software Citation and Credit
Venue: arXiv cs.DL 2015
Year: 2015

The past year has seen movement on several fronts for improving software citation, including the Center for Open Science's Transparency and Openness Promotion (TOP) Guidelines, the Software Publishing Special Interest Group that was started at January's AAS meeting in Seattle at the request of that organization's Working Group on Astronomical Software, a Sloan-sponsored meeting at GitHub in San Francisco to begin work on a cohesive research software citation-enabling platform, the work of Force11 to "transform and improve" research communication, and WSSSPE's ongoing efforts that include software publication, citation, credit, and sustainability. Brief reports on these efforts were shared at the BoF, after which participants discussed ideas for improving software citation, generating a list of recommendations to the community of software authors, journal publishers, ADS, and research authors. The discussion, recommendations, and feedback will help form recommendations for software citation to those publishers represented in the Software Publishing Special Interest Group and the broader community.
Texture measures combination for improved meningioma classification of histopathological images
Venue: arXiv cs.CV 2015
Year: 2015

Providing an improved technique which can assist pathologists in correctly classifying meningioma tumours with a significant accuracy is our main objective. The proposed technique, which is based on optimum texture measure combination, inspects the separability of the RGB colour channels and selects the channel which best segments the cell nuclei of the histopathological images. The morphological gradient was applied to extract the region of interest for each subtype and for elimination of possible noise (e.g. cracks) which might occur during biopsy preparation. Meningioma texture features are extracted by four different texture measures (two model-based and two statistical-based) and then corresponding features are fused together in different combinations after excluding highly correlated features, and a Bayesian classifier was used for meningioma subtype discrimination. The combined Gaussian Markov random field and run-length matrix texture measures outperformed all other combinations in terms of quantitatively characterising the meningioma tissue, achieving an overall classification accuracy of 92.50%, improving from 83.75% which is the best accuracy achieved if the texture measures are used individually.
New bounds and constructions for multiply constant-weight codes
Venue: arXiv cs.IT 2015
Year: 2015

Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs and the constructions of optimal MCWCs are studied. Firstly, we derive three different types of upper bounds which improve the Johnson-type bounds given by Chee {\sl et al.} in some parameters. The asymptotic lower bound of MCWCs is also examined. Then we obtain the asymptotic existence of two classes of optimal MCWCs, which shows that the Johnson-type bounds for MCWCs with distances $2\sum_{i=1}^mw_i-2$ or $2mw-w$ are asymptotically exact. Finally, we construct a class of optimal MCWCs with total weight four and distance six by establishing the connection between such MCWCs and a new kind of combinatorial structures. As a consequence, the maximum sizes of MCWCs with total weight less than or equal to four are determined almost completely.
Using Causal Discovery to Track Information Flow in Spatio-Temporal Data - A Testbed and Experimental Results Using Advection-Diffusion Simulations
Venue: arXiv cs.LG 2015
Year: 2015

Causal discovery algorithms based on probabilistic graphical models have emerged in geoscience applications for the identification and visualization of dynamical processes. The key idea is to learn the structure of a graphical model from observed spatio-temporal data, which indicates information flow, thus pathways of interactions, in the observed physical system. Studying those pathways allows geoscientists to learn subtle details about the underlying dynamical mechanisms governing our planet. Initial studies using this approach on real-world atmospheric data have shown great potential for scientific discovery. However, in these initial studies no ground truth was available, so that the resulting graphs have been evaluated only by whether a domain expert thinks they seemed physically plausible. This paper seeks to fill this gap. We develop a testbed that emulates two dynamical processes dominant in many geoscience applications, namely advection and diffusion, in a 2D grid. Then we apply the causal discovery based information tracking algorithms to the simulation data to study how well the algorithms work for different scenarios and to gain a better understanding of the physical meaning of the graph results, in particular of instantaneous connections. We make all data sets used in this study available to the community as a benchmark. Keywords: Information flow, graphical model, structure learning, causal discovery, geoscience.
Data Driven SMART Intercontinental Overlay Networks
Venue: arXiv cs.NI 2015
Year: 2015

This paper addresses the use of Big Data and machine learning based analytics to the real-time management of Internet scale Quality-of-Service Route Optimisation with the help of an overlay network. Based on the collection of large amounts of data sampled each $2$ minutes over a large number of source-destinations pairs, we show that intercontinental Internet Protocol (IP) paths are far from optimal with respect to Quality of Service (QoS) metrics such as end-to-end round-trip delay. We therefore develop a machine learning based scheme that exploits large scale data collected from communicating node pairs in a multi-hop overlay network that uses IP between the overlay nodes themselves, to select paths that provide substantially better QoS than IP. The approach inspired from Cognitive Packet Network protocol, uses Random Neural Networks with Reinforcement Learning based on the massive data that is collected, to select intermediate overlay hops resulting in significantly better QoS than IP itself. The routing scheme is illustrated on a $20$-node intercontinental overlay network that collects close to $2\times 10^6$ measurements per week, and makes scalable distributed routing decisions. Experimental results show that this approach improves QoS significantly and efficiently in a scalable manner.
Using Students as Experimental Subjects in Software Engineering Research -- A Review and Discussion of the Evidence
Venue: arXiv cs.SE 2015
Year: 2015

Should students be used as experimental subjects in software engineering? Given that students are in many cases readily available and cheap it is no surprise that the vast majority of controlled experiments in software engineering use them. But they can be argued to constitute a convenience sample that may not represent the target population (typically "real" developers), especially in terms of experience and proficiency. This causes many researchers (and reviewers) to have reservations about the external validity of student-based experiments, and claim that students should not be used. Based on an extensive review of published works that have compared students to professionals, we find that picking on "students" is counterproductive for two main reasons. First, classifying experimental subjects by their status is merely a proxy for more important and meaningful classifications, such as classifying them according to their abilities, and effort should be invested in defining and using these more meaningful classifications. Second, in many cases using students is perfectly reasonable, and student subjects can be used to obtain reliable results and further the research goals. In particular, this appears to be the case when the study involves basic programming and comprehension skills, when tools or methodologies that do not require an extensive learning curve are being compared, and in the initial formative stages of large industrial research initiatives -- in other words, in many of the cases that are suitable for controlled experiments of limited scope.
Graph entropies in texture segmentation of images
Venue: arXiv cs.CV 2015
Year: 2015

We study the applicability of a set of texture descriptors introduced in recent work by the author to texture-based segmentation of images. The texture descriptors under investigation result from applying graph indices from quantitative graph theory to graphs encoding the local structure of images. The underlying graphs arise from the computation of morphological amoebas as structuring elements for adaptive morphology, either as weighted or unweighted Dijkstra search trees or as edge-weighted pixel graphs within structuring elements. In the present paper we focus on texture descriptors in which the graph indices are entropy-based, and use them in a geodesic active contour framework for image segmentation. Experiments on several synthetic and one real-world image are shown to demonstrate texture segmentation by this approach. Forthermore, we undertake an attempt to analyse selected entropy-based texture descriptors with regard to what information about texture they actually encode. Whereas this analysis uses some heuristic assumptions, it indicates that the graph-based texture descriptors are related to fractal dimension measures that have been proven useful in texture analysis.
Full-scale Cascade Dynamics Prediction with a Local-First Approach
Venue: arXiv cs.SI 2015
Year: 2015

Information cascades are ubiquitous in various social networking web sites. What mechanisms drive information diffuse in the networks? How does the structure and size of the cascades evolve in time? When and which users will adopt a certain message? Approaching these questions can considerably deepen our understanding about information cascades and facilitate various vital applications, including viral marketing, rumor prevention and even link prediction. Most previous works focus only on the final cascade size prediction. Meanwhile, they are always cascade graph dependent methods, which make them towards large cascades prediction and lead to the criticism that cascades may only be predictable after they have already grown large. In this paper, we study a fundamental problem: full-scale cascade dynamics prediction. That is, how to predict when and which users are activated at any time point of a cascading process. Here we propose a unified framework, FScaleCP, to solve the problem. Given history cascades, we first model the local spreading behaviors as a classification problem. Through data-driven learning, we recognize the common patterns by measuring the driving mechanisms of cascade dynamics. After that we present an intuitive asynchronous propagation method for full-scale cascade dynamics prediction by effectively aggregating the local spreading behaviors. Extensive experiments on social network data set suggest that the proposed method performs noticeably better than other state-of-the-art baselines.
Q-caching: an integrated reinforcement-learning approach for caching and routing in information-centric networks
Venue: arXiv cs.NI 2015
Year: 2015

Content delivery, such as video streaming, is one of the most prevalent Internet applications. Although very popular, the continuous growth of such applications poses novel performance and scalability challenges. Information-centric networks put content at the center, and propose novel solutions to such challenges but also pose new questions on the interface between caching and routing. In this paper, building on top of Q-routing we propose a caching strategy, namely Q-caching, which leverages information that is already collected by the routing algorithm. Q-caching promotes content diversity in the network, reducing the load at custodians and average download times for clients. In stylized topologies, we show that the gains of Q-caching against state-of-the-art algorithms are significant. We then consider the RNP topology, and show that Q-caching performance is more flexible while competitive when compared against existing algorithms.
Not Every Flow is Equal: SMART Discrimination in Redundancy
Venue: arXiv cs.NI 2015
Year: 2015

Software-Defined Data Centers (SDDC) extend virtualization, software-defined networking and systems, and middleboxes to provide a better quality of service (QoS). While many network flow routing algorithms exist, most of them fail to adapt to the dynamic nature of the data center and cloud networks and their users' and enterprise requirements. This paper presents SMART, a Software-Defined Networking (SDN) middlebox architecture for reliable transfers. As an architectural enhancement for network flows allocation, routing, and control, SMART ensures timely delivery of flows by diverting them to a less congested path dynamically in the software-defined data center networks. SMART also clones packets of higher priority flows to route in an alternative path, along with the original flow. Hence SMART offers a differentiated QoS through varying levels of redundancy in the flows.
A framework for robust object multi-detection with a vote aggregation and a cascade filtering
Venue: arXiv cs.CV 2015
Year: 2015

This paper presents a framework designed for the multi-object detection purposes and adjusted for the application of product search on the market shelves. The framework uses a single feedback loop and a pattern resizing mechanism to demonstrate the top effectiveness of the state-of-the-art local features. A high detection rate with a low false detection chance can be achieved with use of only one pattern per object and no manual parameters adjustments. The method incorporates well known local features and a basic matching process to create a reliable voting space. Further steps comprise of metric transformations, graphical vote space representation, two-phase vote aggregation process and a cascade of verifying filters.
An Overview of Emerging Technologies for High Efficiency 3D Video Coding
Venue: arXiv cs.MM 2015
Year: 2015

3D video coding is one of the most popular research area in multimedia. This paper reviews the recent progress of the coding technologies for multiview video (MVV) and free view-point video (FVV) which is represented by MVV and depth maps. We first discuss the traditional multiview video coding (MVC) framework with different prediction structures. The rate-distortion performance and the view switching delay of the three main coding prediction structures are analyzed. We further introduce the joint coding technologies for MVV and depth maps and evaluate the rate-distortion performance of them. The scalable 3D video coding technologies are reviewed by the quality and view scalability, respectively. Finally, we summarize the bit allocation work of 3D video coding. This paper also points out some future research problems in high efficiency 3D video coding such as the view switching latency optimization in coding structure and bit allocation.
Online Keyword Spotting with a Character-Level Recurrent Neural Network
Venue: arXiv cs.CL 2015
Year: 2015

In this paper, we propose a context-aware keyword spotting model employing a character-level recurrent neural network (RNN) for spoken term detection in continuous speech. The RNN is end-to-end trained with connectionist temporal classification (CTC) to generate the probabilities of character and word-boundary labels. There is no need for the phonetic transcription, senone modeling, or system dictionary in training and testing. Also, keywords can easily be added and modified by editing the text based keyword list without retraining the RNN. Moreover, the unidirectional RNN processes an infinitely long input audio streams without pre-segmentation and keywords are detected with low-latency before the utterance is finished. Experimental results show that the proposed keyword spotter significantly outperforms the deep neural network (DNN) and hidden Markov model (HMM) based keyword-filler model even with less computations.
Evaluating Go Game Records for Prediction of Player Attributes
Venue: arXiv cs.AI 2015
Year: 2015

We propose a way of extracting and aggregating per-move evaluations from sets of Go game records. The evaluations capture different aspects of the games such as played patterns or statistic of sente/gote sequences. Using machine learning algorithms, the evaluations can be utilized to predict different relevant target variables. We apply this methodology to predict the strength and playing style of the player (e.g. territoriality or aggressivity) with good accuracy. We propose a number of possible applications including aiding in Go study, seeding real-work ranks of internet players or tuning of Go-playing programs.
Reliability of Dynamic Load Scheduling with Solar Forecast Scenarios
Venue: arXiv cs.SY 2015
Year: 2015

This paper presents and evaluates the performance of an optimal scheduling algorithm that selects the on/off combinations and timing of a finite set of dynamic electric loads on the basis of short term predictions of the power delivery from a photovoltaic source. In the algorithm for optimal scheduling, each load is modeled with a dynamic power profile that may be different for on and off switching. Optimal scheduling is achieved by the evaluation of a user-specified criterion function with possible power constraints. The scheduling algorithm exploits the use of a moving finite time horizon and the resulting finite number of scheduling combinations to achieve real-time computation of the optimal timing and switching of loads. The moving time horizon in the proposed optimal scheduling algorithm provides an opportunity to use short term (time moving) predictions of solar power based on advection of clouds detected in sky images. Advection, persistence, and perfect forecast scenarios are used as input to the load scheduling algorithm to elucidate the effect of forecast errors on mis-scheduling. The advection forecast creates less events where the load demand is greater than the available solar energy, as compared to persistence. Increasing the decision horizon leads to increasing error and decreased efficiency of the system, measured as the amount of power consumed by the aggregate loads normalized by total solar power. For a standalone system with a real forecast, energy reserves are necessary to provide the excess energy required by mis-scheduled loads. A method for battery sizing is proposed for future work.
Fast Computation of Isochrones in Road Networks
Venue: arXiv cs.DS 2015
Year: 2015

We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e.g., reachability analyses, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast computation of isochrones on large, realistic inputs. In this work, we formalize the notion of isochrones in road networks and present a basic approach for the resulting problem based on Dijkstra's algorithm. Moreover, we consider several speedup techniques that are based on previous approaches for one-to-many shortest path computation (or similar scenarios). In contrast to such related problems, the set of targets is not part of the input when computing isochrones. We extend known Multilevel Dijkstra techniques (such as CRP) to the isochrone scenario, adapting a previous technique called isoGRASP to our problem setting (thereby, enabling faster queries). Moreover, we introduce a family of algorithms based on (single-level) graph partitions, following different strategies to exploit the efficient access patterns of PHAST, a well-known approach towards one-to-all queries. Our experimental study reveals that all speedup techniques allow fast isochrone computation on input graphs at continental scale, while providing different tradeoffs between preprocessing effort, space consumption, and query performance. Finally, we demonstrate that all techniques scale well when run in parallel, decreasing query times to a few milliseconds (orders of magnitude faster than the basic approach) and enabling even interactive applications.
Methods for Quantized Compressed Sensing
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we compare and catalog the performance of various greedy quantized compressed sensing algorithms that reconstruct sparse signals from quantized compressed measurements. We also introduce two new greedy approaches for reconstruction: Quantized Compressed Sampling Matching Pursuit (QCoSaMP) and Adaptive Outlier Pursuit for Quantized Iterative Hard Thresholding (AOP-QIHT). We compare the performance of greedy quantized compressed sensing algorithms for a given bit-depth, sparsity, and noise level.
Towards Energy Consumption Verification via Static Analysis
Venue: arXiv cs.PL 2015
Year: 2015

In this paper we leverage an existing general framework for resource usage verification and specialize it for verifying energy consumption specifications of embedded programs. Such specifications can include both lower and upper bounds on energy usage, and they can express intervals within which energy usage is to be certified to be within such bounds. The bounds of the intervals can be given in general as functions on input data sizes. Our verification system can prove whether such energy usage specifications are met or not. It can also infer the particular conditions under which the specifications hold. To this end, these conditions are also expressed as intervals of functions of input data sizes, such that a given specification can be proved for some intervals but disproved for others. The specifications themselves can also include preconditions expressing intervals for input data sizes. We report on a prototype implementation of our approach within the CiaoPP system for the XC language and XS1-L architecture, and illustrate with an example how embedded software developers can use this tool, and in particular for determining values for program parameters that ensure meeting a given energy budget while minimizing the loss in quality of service.
Internet of Things for Residential Areas: Toward Personalized Energy Management Using Big Data
Venue: arXiv cs.NI 2015
Year: 2015

Intelligent management of machines, particularly in a residence area, has been of interest for many years. However, such system design has always been limited to simple control of machines from a local area or remotely from the Internet. In this report, for the first time, an intelligent system is proposed, where not only provides intelligent control ability of machines to user, but also utilizes big data and optimization techniques to provide promotional offers to the user to optimize energy consumption of machines. Since a high traffic communication is involved among the machines and the optimization-big data core of system, the communication core of the proposed system is designed based on cloud, where many challenging issues such as spectrum assignment and resource management are involved. To deal with that, the communication network in the home area network (HAN) is designed based on the cognitive radio system, where a new spectrum assignment method based on the ant colony optimization (ACO) algorithm is proposed to perform spectrum assignment to the machines in the HAN. Performance evaluation of the proposed spectrum assignment method shows its performance in fair spectrum assignment among machines.