OpenRaiser/Intern-Atlas huggingface dataset:
Recovering Dense Tissue Multispectral Signal from in vivo RGB Images
Venue: arXiv cs.CV 2017
Year: 2017

Hyperspectral/multispectral imaging (HSI/MSI) contains rich information clinical applications, such as 1) narrow band imaging for vascular visualisation; 2) oxygen saturation for intraoperative perfusion monitoring and clinical decision making [1]; 3) tissue classification and identification of pathology [2]. The current systems which provide pixel-level HSI/MSI signal can be generally divided into two types: spatial scanning and spectral scanning. However, the trade-off between spatial/spectral resolution, the acquisition time, and the hardware complexity hampers implementation in real-world applications, especially intra-operatively. Acquiring high resolution images in real-time is important for HSI/MSI in intra-operative imaging, to alleviate the side effect caused by breathing, heartbeat, and other sources of motion. Therefore, we developed an algorithm to recover a pixel-level MSI stack using only the captured snapshot RGB images from a normal camera. We refer to this technique as "super-spectral-resolution". The proposed method enables recovery of pixel-level-dense MSI signals with 24 spectral bands at ~11 frames per second (FPS) on a GPU. Multispectral data captured from porcine bowel and sheep/rabbit uteri in vivo has been used for training, and the algorithm has been validated using unseen in vivo animal experiments.
Association of Networked Flying Platforms with Small Cells for Network Centric 5G+ C-RAN
Venue: arXiv cs.NI 2017
Year: 2017

5G+ systems expect enhancement in data rate and coverage area under limited power constraint. Such requirements can be fulfilled by the densification of small cells (SCs). However, a major challenge is the management of fronthaul links connected with an ultra dense network of SCs. A cost effective and scalable idea of using network flying platforms (NFPs) is employed here, where the NFPs are used as fronthaul hubs that connect the SCs to the core network. The association problem of NFPs and SCs is formulated considering a number of practical constraints such as backhaul data rate limit, maximum supported links and bandwidth by NFPs and quality of service requirement of the system. The network centric case of the system is considered that aims to maximize the number of associated SCs without any biasing, i.e., no preference for high priority SCs. Then, two new efficient greedy algorithms are designed to solve the presented association problem. Numerical results show a favorable performance of our proposed methods in comparison to exhaustive search.
Strong immersion is a well-quasi-ordering for semi-complete digraphs
Venue: arXiv cs.DM 2017
Year: 2017

We prove that the strong immersion order is a well-quasi-ordering on the class of semi-complete digraphs, thereby strengthening a result of Chudnovsky and Seymour that this holds for the class of tournaments.
Security evaluation of cyber networks under advanced persistent threats
Venue: arXiv cs.CR 2017
Year: 2017

This paper is devoted to measuring the security of cyber networks under advanced persistent threats (APTs). First, an APT-based cyber attack-defense process is modeled as an individual-level dynamical system. Second, the dynamic model is shown to exhibit the global stability. On this basis, a new security metric of cyber networks, which is known as the limit security, is defined as the limit expected fraction of compromised nodes in the networks. Next, the influence of different factors on the limit security is illuminated through theoretical analysis and computer simulation. This work helps understand the security of cyber networks under APTs.
Machine Learning for RealisticBall Detection in RoboCup SPL
Venue: arXiv cs.CV 2017
Year: 2017

In this technical report, we describe the use of a machine learning approach for detecting the realistic black and white ball currently in use in the RoboCup Standard Platform League. Our aim is to provide a ready-to-use software module that can be useful for the RoboCup SPL community. To this end, the approach is integrated within the official B-Human code release 2016. The complete code for the approach presented in this work can be downloaded from the SPQR Team homepage at http://spqr.diag.uniroma1.it and from the SPQR Team GitHub repository at https://github.com/SPQRTeam/SPQRBallPerceptor. The approach has been tested in multiple environments, both indoor and outdoor. Furthermore, the ball detector described in this technical report has been used by the SPQR Robot Soccer Team during the competitions of the Robocup German Open 2017. To facilitate the use of our code by other teams, we have prepared a step-by-step installation guide.
Structured Sparse Ternary Weight Coding of Deep Neural Networks for Efficient Hardware Implementations
Venue: arXiv cs.CV 2017
Year: 2017

Deep neural networks (DNNs) usually demand a large amount of operations for real-time inference. Especially, fully-connected layers contain a large number of weights, thus they usually need many off-chip memory accesses for inference. We propose a weight compression method for deep neural networks, which allows values of +1 or -1 only at predetermined positions of the weights so that decoding using a table can be conducted easily. For example, the structured sparse (8,2) coding allows at most two non-zero values among eight weights. This method not only enables multiplication-free DNN implementations but also compresses the weight storage by up to x32 compared to floating-point networks. Weight distribution normalization and gradual pruning techniques are applied to mitigate the performance degradation. The experiments are conducted with fully-connected deep neural networks and convolutional neural networks.
Methodology for Multi-stage, Operations- and Uncertainty-Aware Placement and Sizing of FACTS Devices in a Large Power Transmission System
Venue: arXiv cs.CE 2017
Year: 2017

We develop new optimization methodology for planning installation of Flexible Alternating Current Transmission System (FACTS) devices of the parallel and shunt types into large power transmission systems, which allows to delay or avoid installations of generally much more expensive power lines. Methodology takes as an input projected economic development, expressed through a paced growth of the system loads, as well as uncertainties, expressed through multiple scenarios of the growth. We price new devices according to their capacities. Installation cost contributes to the optimization objective in combination with the cost of operations integrated over time and averaged over the scenarios. The multi-stage (-time-frame) optimization aims to achieve a gradual distribution of new resources in space and time. Constraints on the investment budget, or equivalently constraint on building capacity, is introduced at each time frame. Our approach adjusts operationally not only newly installed FACTS devices but also other already existing flexible degrees of freedom. This complex optimization problem is stated using the most general AC Power Flows. Non-linear, non-convex, multiple-scenario and multi-time-frame optimization is resolved via efficient heuristics, consisting of a sequence of alternating Linear Programmings or Quadratic Programmings (depending on the generation cost) and AC-PF solution steps designed to maintain operational feasibility for all scenarios. Computational scalability and application of the newly developed approach is illustrated on the example of the 2736-nodes large Polish system. One most important advantage of the framework is that the optimal capacity of FACTS is build up gradually at each time frame in a limited number of locations, thus allowing to prepare the system better for possible congestion due to future economic and other uncertainties.
Contour and Centreline Tracking of Vessels from Angiograms using the Classical Image Processing Techniques
Venue: arXiv cs.CV 2017
Year: 2017

This article deals with the problem of vessel edge and centerline detection using classical image processing techniques due to their simpleness and easiness to be implemented. The method is divided into four steps: the vessel enhancement which implies a non-linear filtering proposed by Frangi, the thresholding using Otsu method and the contour detection using the Canny edge detector due to its good performances for the small vessels and the morphological skeletonisation. The algorithms are tested on real data collected from a cardiac catheterism laboratory and it is accurate for images with good spatial resolution (512*512). The output image can be used for further processing in order to find the vessel length or its radius.
Using Transfer Learning for Image-Based Cassava Disease Detection
Venue: arXiv cs.CV 2017
Year: 2017

Cassava is the third largest source of carbohydrates for human food in the world but is vulnerable to virus diseases, which threaten to destabilize food security in sub-Saharan Africa. Novel methods of cassava disease detection are needed to support improved control which will prevent this crisis. Image recognition offers both a cost effective and scalable technology for disease detection. New transfer learning methods offer an avenue for this technology to be easily deployed on mobile devices. Using a dataset of cassava disease images taken in the field in Tanzania, we applied transfer learning to train a deep convolutional neural network to identify three diseases and two types of pest damage (or lack thereof). The best trained model accuracies were 98% for brown leaf spot (BLS), 96% for red mite damage (RMD), 95% for green mite damage (GMD), 98% for cassava brown streak disease (CBSD), and 96% for cassava mosaic disease (CMD). The best model achieved an overall accuracy of 93% for data not used in the training process. Our results show that the transfer learning approach for image recognition of field images offers a fast, affordable, and easily deployable strategy for digital plant disease detection.
LinkNet: Exploiting Encoder Representations for Efficient Semantic Segmentation
Venue: arXiv cs.CV 2017
Year: 2017

Pixel-wise semantic segmentation for visual scene understanding not only needs to be accurate, but also efficient in order to find any use in real-time application. Existing algorithms even though are accurate but they do not focus on utilizing the parameters of neural network efficiently. As a result they are huge in terms of parameters and number of operations; hence slow too. In this paper, we propose a novel deep neural network architecture which allows it to learn without any significant increase in number of parameters. Our network uses only 11.5 million parameters and 21.2 GFLOPs for processing an image of resolution 3x640x360. It gives state-of-the-art performance on CamVid and comparable results on Cityscapes dataset. We also compare our networks processing time on NVIDIA GPU and embedded system device with existing state-of-the-art architectures for different image resolutions.
N-GrAM: New Groningen Author-profiling Model
Venue: arXiv cs.CL 2017
Year: 2017

We describe our participation in the PAN 2017 shared task on Author Profiling, identifying authors' gender and language variety for English, Spanish, Arabic and Portuguese. We describe both the final, submitted system, and a series of negative results. Our aim was to create a single model for both gender and language, and for all language varieties. Our best-performing system (on cross-validated results) is a linear support vector machine (SVM) with word unigrams and character 3- to 5-grams as features. A set of additional features, including POS tags, additional datasets, geographic entities, and Twitter handles, hurt, rather than improve, performance. Results from cross-validation indicated high performance overall and results on the test set confirmed them, at 0.86 averaged accuracy, with performance on sub-tasks ranging from 0.68 to 0.98.
Source-Target Inference Models for Spatial Instruction Understanding
Venue: arXiv cs.CL 2017
Year: 2017

Models that can execute natural language instructions for situated robotic tasks such as assembly and navigation have several useful applications in homes, offices, and remote scenarios. We study the semantics of spatially-referred configuration and arrangement instructions, based on the challenging Bisk-2016 blank-labeled block dataset. This task involves finding a source block and moving it to the target position (mentioned via a reference block and offset), where the blocks have no names or colors and are just referred to via spatial location features. We present novel models for the subtasks of source block classification and target position regression, based on joint-loss language and spatial-world representation learning, as well as CNN-based and dual attention models to compute the alignment between the world blocks and the instruction phrases. For target position prediction, we compare two inference approaches: annealed sampling via policy gradient versus expectation inference via supervised regression. Our models achieve the new state-of-the-art on this task, with an improvement of 47% on source block accuracy and 22% on target position distance.
Burstiness of Intrusion Detection Process: Empirical Evidence and a Modeling Approach
Venue: arXiv cs.CR 2017
Year: 2017

We analyze sets of intrusion detection records observed on the networks of several large, nonresidential organizations protected by a form of intrusion detection and prevention service. Our analyses reveal that the process of intrusion detection in these networks exhibits a significant degree of burstiness as well as strong memory, with burstiness and memory properties that are comparable to those of natural processes driven by threshold effects, but different from bursty human activities. We explore time-series models of these observable network security incidents based on partially observed data using a hidden Markov model with restricted hidden states, which we fit using Markov Chain Monte Carlo techniques. We examine the output of the fitted model with respect to its statistical properties and demonstrate that the model adequately accounts for intrinsic "bursting" within observed network incidents as a result of alternation between two or more stochastic processes. While our analysis does not lead directly to new detection capabilities, the practical implications of gaining better understanding of the observed burstiness are significant, and include opportunities for quantifying a network's risks and defensive efforts.
Dependency Injection for Programming by Optimization
Venue: arXiv cs.AI 2017
Year: 2017

Programming by Optimization tools perform automatic software configuration according to the specification supplied by a software developer. Developers specify design spaces for program components, and the onerous task of determining which configuration best suits a given use case is determined using automated analysis tools and optimization heuristics. However, in current approaches to Programming by Optimization, design space specification and exploration relies on external configuration algorithms, executable wrappers and fragile, preprocessed programming language extensions. Here we show that the architectural pattern of Dependency Injection provides a superior alternative to the traditional Programming by Optimization pipeline. We demonstrate that configuration tools based on Dependency Injection fit naturally into the software development process, while requiring less overhead than current wrapper-based mechanisms. Furthermore, the structural correspondence between Dependency Injection and context-free grammars yields a new class of evolutionary metaheuristics for automated algorithm configuration. We found that the new heuristics significantly outperform existing configuration algorithms on many problems of interest (in one case by two orders of magnitude). We anticipate that these developments will make Programming by Optimization immediately applicable to a large number of enterprise software projects.
Clingo goes Linear Constraints over Reals and Integers
Venue: arXiv cs.AI 2017
Year: 2017

The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints, discuss the respective implementations, and present techniques of how to use these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common fragments and contrast them to related ASP systems. This paper is under consideration for acceptance in TPLP.
Two-Dimensional Pattern Languages
Venue: arXiv cs.FL 2017
Year: 2017

We introduce several classes of array languages obtained by generalising Angluin's pattern languages to the two-dimensional case. These classes of two-dimensional pattern languages are compared with respect to their expressive power and their closure properties are investigated.
Is writing style predictive of scientific fraud?
Venue: arXiv cs.CL 2017
Year: 2017

The problem of detecting scientific fraud using machine learning was recently introduced, with initial, positive results from a model taking into account various general indicators. The results seem to suggest that writing style is predictive of scientific fraud. We revisit these initial experiments, and show that the leave-one-out testing procedure they used likely leads to a slight over-estimate of the predictability, but also that simple models can outperform their proposed model by some margin. We go on to explore more abstract linguistic features, such as linguistic complexity and discourse structure, only to obtain negative results. Upon analyzing our models, we do see some interesting patterns, though: Scientific fraud, for examples, contains less comparison, as well as different types of hedging and ways of presenting logical reasoning.
MAC Resolvability: First And Second Order Results
Venue: arXiv cs.IT 2017
Year: 2017

Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates.
Cultivating DNN Diversity for Large Scale Video Labelling
Venue: arXiv cs.CV 2017
Year: 2017

We investigate factors controlling DNN diversity in the context of the Google Cloud and YouTube-8M Video Understanding Challenge. While it is well-known that ensemble methods improve prediction performance, and that combining accurate but diverse predictors helps, there is little knowledge on how to best promote & measure DNN diversity. We show that diversity can be cultivated by some unexpected means, such as model over-fitting or dropout variations. We also present details of our solution to the video understanding problem, which ranked #7 in the Kaggle competition (competing as the Yeti team).
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Venue: arXiv cs.DC 2017
Year: 2017

Starting with Michail, Chatzigiannakis, and Spirakis work, the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of communication, as long as the network is connected in each round. The problem is central in distributed computing as the number of participants is frequently needed to make important decisions, such as termination, agreement, synchronization, and many others. A variety of algorithms built on top of mass-distribution techniques have been presented, analyzed, and also experimentally evaluated; some of them assumed additional knowledge of network characteristics, such as bounded degree or given upper bound on the network size. However, the question of whether Counting can be solved deterministically in sub-exponential time remained open. In this work, we answer this question positively by presenting Methodical Counting, which runs in polynomial time and requires no knowledge of network characteristics. Moreover, we also show how to extend Methodical Counting to compute the sum of input values and more complex functions without extra cost. Our analysis leverages previous work on random walks in evolving graphs, combined with carefully chosen alarms in the algorithm that control the process and its parameters. To the best of our knowledge, our Counting algorithm and its extensions to other algebraic and Boolean functions are the first that can be implemented in practice with worst-case guarantees.
Who Will You Share a Ride With: Factors that Influence Trust of Potential Rideshare Partners
Venue: arXiv cs.SI 2017
Year: 2017

Ridesharing can save energy, reduce pollution, and alleviate congestion. Ridesharing systems allow peer-to-peer ride matching through mobile-phone applications. In many systems people have little information about the driver and co-riders. Trust heavily influences the usage of a ridesharing system, however, work in this area is limited. In this paper, we investigate the role of social media in shaping trust and delineate factors that influence the decisions of trust placed on a driver or co-rider. We design a ridesharing system where a rider can see the Instagram profile and 10 recent pictures of a co-rider and ask them to make judgments on six trust related questions. We discovered three important factors that shape trust forming: \textit{social proof}, \textit{social approval}, and \textit{self-disclosure}. These three factors account for 40\%, 33\%, and 13\% of the variance, and subsequent factors extracted accounted for substantially less variance. Using these three factors, we successfully build a trust prediction model with F-measure of 87.4\%, an improvement from 78.6\% on using all factors collected.
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
Venue: arXiv cs.DS 2017
Year: 2017

The so-called "one-bit catastrophe" for the compression algorithm LZ'78 asks whether the compression ratio of an infinite word can change when a single bit is added in front of it. We answer positively this open question raised by Lutz and others: we show that there exists an infinite word $w$ such that $ρ_{sup}(w)=0$ but $ρ_{inf}(0w)>0$, where $ρ_{sup}$ and $ρ_{inf}$ are respectively the $\limsup$ and the $\liminf$ of the compression ratios $ρ$ of the prefixes. To that purpose we explore the behaviour of LZ'78 on finite words and show the following results: - There is a constant $C>0$ such that, for any finite word $w$ and any letter $a$, $ρ(aw)\leq C\sqrt{ρ(w)\log|w|}$. Thus, sufficiently compressible words ($ρ(w)=o(1/\log|w|)$) remain compressible with a letter in front; - The previous result is tight up to a multiplicative constant for any compression ratio $ρ(w)=O(1/\log|w|)$. In particular, there are infinitely many words $w$ satisfying $ρ(w)=O(1/\log|w|)$ but $ρ(0w)=Ω(1)$.