OpenRaiser/Intern-Atlas huggingface dataset:
Contextual Multi-Scale Region Convolutional 3D Network for Activity Detection
Venue: arXiv cs.CV 2018
Year: 2018

Activity detection is a fundamental problem in computer vision. Detecting activities of different temporal scales is particularly challenging. In this paper, we propose the contextual multi-scale region convolutional 3D network (CMS-RC3D) for activity detection. To deal with the inherent temporal scale variability of activity instances, the temporal feature pyramid is used to represent activities of different temporal scales. On each level of the temporal feature pyramid, an activity proposal detector and an activity classifier are learned to detect activities of specific temporal scales. Temporal contextual information is fused into activity classifiers for better recognition. More importantly, the entire model at all levels can be trained end-to-end. Our CMS-RC3D detector can deal with activities at all temporal scale ranges with only a single pass through the backbone network. We test our detector on two public activity detection benchmarks, THUMOS14 and ActivityNet. Extensive experiments show that the proposed CMS-RC3D detector outperforms state-of-the-art methods on THUMOS14 by a substantial margin and achieves comparable results on ActivityNet despite using a shallow feature extractor.
Performance Analysis of Robust Stable PID Controllers Using Dominant Pole Placement for SOPTD Process Models
Venue: arXiv cs.SY 2018
Year: 2018

This paper derives new formulations for designing dominant pole placement based proportional-integral-derivative (PID) controllers to handle second order processes with time delays (SOPTD). Previously, similar attempts have been made for pole placement in delay-free systems. The presence of the time delay term manifests itself as a higher order system with variable number of interlaced poles and zeros upon Pade approximation, which makes it difficult to achieve precise pole placement control. We here report the analytical expressions to constrain the closed loop dominant and non-dominant poles at the desired locations in the complex s-plane, using a third order Pade approximation for the delay term. However, invariance of the closed loop performance with different time delay approximation has also been verified using increasing order of Pade, representing a closed to reality higher order delay dynamics. The choice of the nature of non-dominant poles e.g. all being complex, real or a combination of them modifies the characteristic equation and influences the achievable stability regions. The effect of different types of non-dominant poles and the corresponding stability regions are obtained for nine test-bench processes indicating different levels of open-loop damping and lag to delay ratio. Next, we investigate which expression yields a wider stability region in the design parameter space by using Monte Carlo simulations while uniformly sampling a chosen design parameter space. Various time and frequency domain control performance parameters are investigated next, as well as their deviations with uncertain process parameters, using thousands of Monte Carlo simulations, around the robust stable solution for each of the nine test-bench processes.
Optimal Beam Sweeping and Communication in Mobile Millimeter-Wave Networks
Venue: arXiv cs.IT 2018
Year: 2018

Millimeter-wave (mm-wave) communications incur a high beam alignment cost in mobile scenarios such as vehicular networks. Therefore, an efficient beam alignment mechanism is required to mitigate the resulting overhead. In this paper, a one-dimensional mobility model is proposed where a mobile user (MU), such as a vehicle, moves along a straight road with time-varying and random speed, and communicates with base stations (BSs) located on the roadside over the mm-wave band. To compensate for location uncertainty, the BS widens its transmission beam and, when a critical beamwidth is achieved, it performs beam-sweeping to refine the MU position estimate, followed by data communication over a narrow beam. The average rate and average transmission power are computed in closed form and the optimal beamwidth for communication, number of sweeping beams, and transmission power allocation are derived so as to maximize the average rate under an average power constraint. Structural properties of the optimal design are proved, and a bisection algorithm to determine the optimal sweeping -- communication parameters is designed. It is shown numerically that an adaptation of the IEEE 802.11ad standard to the proposed model exhibits up to 90% degradation in spectral efficiency compared to the proposed scheme.
Document Image Classification with Intra-Domain Transfer Learning and Stacked Generalization of Deep Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

In this work, a region-based Deep Convolutional Neural Network framework is proposed for document structure learning. The contribution of this work involves efficient training of region based classifiers and effective ensembling for document image classification. A primary level of `inter-domain' transfer learning is used by exporting weights from a pre-trained VGG16 architecture on the ImageNet dataset to train a document classifier on whole document images. Exploiting the nature of region based influence modelling, a secondary level of `intra-domain' transfer learning is used for rapid training of deep learning models for image segments. Finally, stacked generalization based ensembling is utilized for combining the predictions of the base deep neural network models. The proposed method achieves state-of-the-art accuracy of 92.2% on the popular RVL-CDIP document image dataset, exceeding benchmarks set by existing algorithms.
Safe and Efficient Intersection Control of Connected and Autonomous Intersection Traffic
Venue: arXiv cs.SY 2018
Year: 2018

In this dissertation, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, an algorithm that is called the Discrete-time occupancies trajectory based Intersection traffic Coordination Algorithm (DICA) is proposed. All vehicles in the system are Connected and Autonomous Vehicles (CAVs) and capable of wireless Vehicle-to-Intersection communication. In the proposed framework, an intersection coordinates the motions of CAVs based on their proposed DTOTs to let them cross the intersection efficiently while avoiding collisions. In case when there is a collision between vehicles' DTOTs, the intersection modifies conflicting DTOTs to avoid the collision and requests CAVs to approach and cross the intersection according to the modified DTOTs. We then prove that the basic DICA is deadlock free and also starvation free. We also show that the basic DICA is conservative in computational complexity and improve it by several computational approaches. Next, we addressed the problem of evacuating emergency vehicles as quickly as possible through autonomous and connected intersection traffic in this dissertation. The proposed intersection control algorithm Reactive DICA aims to determine an efficient vehicle-passing sequence which allows the emergency vehicle to cross an intersection as soon as possible while the travel times of other vehicles are minimally affected. When there are no emergency vehicles within the intersection area, the vehicles are controlled by DICA. When there are emergency vehicles entering communication range, we prioritize emergency vehicles through optimal ordering of vehicles. A genetic algorithm is proposed to solve the optimization problem which finds the optimal vehicle sequence that gives the emergency vehicles the highest priority.
Ultra Reliable Communication via Opportunistic ARQ Transmission in Cognitive Networks
Venue: arXiv cs.IT 2018
Year: 2018

This paper presents a novel opportunistic spectrum sharing scheme that applies ARQ protocol to achieve ultra reliability in the finite blocklength regime. A primary user shares its licensed spectrum to a secondary user, where both communicate to the same base station. The base station applies ARQ with the secondary user, which possess a limited number of trials to transmit each packet. We resort to the interweave model in which the secondary user senses the primary user activity and accesses the channel with access probabilities which depend on the primary user arrival rate and the number of available trials. We characterize the secondary user access probabilities and transmit power in order to achieve target error constraints for both users. Furthermore, we analyze the primary user performance in terms of outage probability and delay. The results show that our proposed scheme outperforms the open loop and non-opportunistic scenarios in terms of secondary user transmit power saving and primary user reliability.
Learning-based Image Reconstruction via Parallel Proximal Algorithm
Venue: arXiv cs.CV 2018
Year: 2018

In the past decade, sparsity-driven regularization has led to advancement of image reconstruction algorithms. Traditionally, such regularizers rely on analytical models of sparsity (e.g. total variation (TV)). However, more recent methods are increasingly centered around data-driven arguments inspired by deep learning. In this letter, we propose to generalize TV regularization by replacing the l1-penalty with an alternative prior that is trainable. Specifically, our method learns the prior via extending the recently proposed fast parallel proximal algorithm (FPPA) to incorporate data-adaptive proximal operators. The proposed framework does not require additional inner iterations for evaluating the proximal mappings of the corresponding learned prior. Moreover, our formalism ensures that the training and reconstruction processes share the same algorithmic structure, making the end-to-end implementation intuitive. As an example, we demonstrate our algorithm on the problem of deconvolution in a fluorescence microscope.
21 Million Opportunities: A 19 Facility Investigation of Factors Affecting Hand Hygiene Compliance via Linear Predictive Models
Venue: arXiv cs.CY 2018
Year: 2018

This large-scale study, consisting of 21.3 million hand hygiene opportunities from 19 distinct facilities in 10 different states, uses linear predictive models to expose factors that may affect hand hygiene compliance. We examine the use of features such as temperature, relative humidity, influenza severity, day/night shift, federal holidays and the presence of new medical residents in predicting daily hand hygiene compliance; the investigation is undertaken using both a "global" model to glean general trends, and facility-specific models to elicit facility-specific insights. The results suggest that colder temperatures and federal holidays have an adverse effect on hand hygiene compliance rates, and that individual cultures and attitudes regarding hand hygiene exist among facilities.
DeepLung: Deep 3D Dual Path Nets for Automated Pulmonary Nodule Detection and Classification
Venue: arXiv cs.CV 2018
Year: 2018

In this work, we present a fully automated lung computed tomography (CT) cancer diagnosis system, DeepLung. DeepLung consists of two components, nodule detection (identifying the locations of candidate nodules) and classification (classifying candidate nodules into benign or malignant). Considering the 3D nature of lung CT data and the compactness of dual path networks (DPN), two deep 3D DPN are designed for nodule detection and classification respectively. Specifically, a 3D Faster Regions with Convolutional Neural Net (R-CNN) is designed for nodule detection with 3D dual path blocks and a U-net-like encoder-decoder structure to effectively learn nodule features. For nodule classification, gradient boosting machine (GBM) with 3D dual path network features is proposed. The nodule classification subnetwork was validated on a public dataset from LIDC-IDRI, on which it achieved better performance than state-of-the-art approaches and surpassed the performance of experienced doctors based on image modality. Within the DeepLung system, candidate nodules are detected first by the nodule detection subnetwork, and nodule diagnosis is conducted by the classification subnetwork. Extensive experimental results demonstrate that DeepLung has performance comparable to experienced doctors both for the nodule-level and patient-level diagnosis on the LIDC-IDRI dataset.\footnote{https://github.com/uci-cbcl/DeepLung.git}
First Demonstration of an Automatic Multilayer Intent-Based Secure Service Creation by an Open Source SDN Orchestrator
Venue: arXiv cs.NI 2018
Year: 2018

In this work we demonstrate an automatic intent-based encryption layer selection and configuration for a multilayer network covering IP and optical utilizing an open source SDN orchestrator. Results indicate that the processing impact of a secure channel creation is negligible.
Cooperative repair: Constructions of optimal MDS codes for all admissible parameters
Venue: arXiv cs.IT 2018
Year: 2018

Two widely studied models of multiple-node repair in distributed storage systems are centralized repair and cooperative repair. The centralized model assumes that all the failed nodes are recreated in one location, while the cooperative one stipulates that the failed nodes may communicate but are distinct, and the amount of data exchanged between them is included in the repair bandwidth. As our first result, we prove a lower bound on the minimum bandwidth of cooperative repair. We also show that the cooperative model is stronger than the centralized one, in the sense that any MDS code with optimal repair bandwidth under the former model also has optimal bandwidth under the latter one. These results were previously known under the additional "uniform download" assumption, which is removed in our proofs. As our main result, we give explicit constructions of MDS codes with optimal cooperative repair for all possible parameters. More precisely, given any $n,k,h,d$ such that $2\le h \le n-d\le n-k$ we construct $(n,k)$ MDS codes over the field $F$ of size $|F|\ge (d+1-k)n$ that can optimally repair any $h$ erasures from any $d$ helper nodes. The repair scheme of our codes involves two rounds of communication. In the first round, each failed node downloads information from the helper nodes, and in the second one, each failed node downloads additional information from the other failed nodes. This implies that our codes achieve the optimal repair bandwidth using the smallest possible number of rounds.
Deep Learning based Retinal OCT Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Our objective is to evaluate the efficacy of methods that use deep learning (DL) for the automatic fine-grained segmentation of optical coherence tomography (OCT) images of the retina. OCT images from 10 patients with mild non-proliferative diabetic retinopathy were used from a public (U. of Miami) dataset. For each patient, five images were available: one image of the fovea center, two images of the perifovea, and two images of the parafovea. For each image, two expert graders each manually annotated five retinal surfaces (i.e. boundaries between pairs of retinal layers). The first grader's annotations were used as ground truth and the second grader's annotations to compute inter-operator agreement. The proposed automated approach segments images using fully convolutional networks (FCNs) together with Gaussian process (GP)-based regression as a post-processing step to improve the quality of the estimates. Using 10-fold cross validation, the performance of the algorithms is determined by computing the per-pixel unsigned error (distance) between the automated estimates and the ground truth annotations generated by the first manual grader. We compare the proposed method against five state of the art automatic segmentation techniques. The results show that the proposed methods compare favorably with state of the art techniques, resulting in the smallest mean unsigned error values and associated standard deviations, and performance is comparable with human annotation of retinal layers from OCT when there is only mild retinopathy. The results suggest that semantic segmentation using FCNs, coupled with regression-based post-processing, can effectively solve the OCT segmentation problem on par with human capabilities with mild retinopathy.
Mitigating Spreadsheet Model Risk with Python Open Source Infrastructure
Venue: arXiv cs.SE 2018
Year: 2018

Across an aggregation of EuSpRIG presentation papers, two maxims hold true: spreadsheets models are akin to software, yet spreadsheet developers are not software engineers. As such, the lack of traditional software engineering tools and protocols invites a higher rate of error in the end result. This paper lays ground work for spreadsheet modelling professionals to develop reproducible audit tools using freely available, open source packages built with the Python programming language, enabling stakeholders to develop clearly defined model "oracles" with which to test and audit spreadsheet calculations against.
Early Warnings of Cyber Threats in Online Discussions
Venue: arXiv cs.CR 2018
Year: 2018

We introduce a system for automatically generating warnings of imminent or current cyber-threats. Our system leverages the communication of malicious actors on the darkweb, as well as activity of cyber security experts on social media platforms like Twitter. In a time period between September, 2016 and January, 2017, our method generated 661 alerts of which about 84% were relevant to current or imminent cyber-threats. In the paper, we first illustrate the rationale and workflow of our system, then we measure its performance. Our analysis is enriched by two case studies: the first shows how the method could predict DDoS attacks, and how it would have allowed organizations to prepare for the Mirai attacks that caused widespread disruption in October 2016. Second, we discuss the method's timely identification of various instances of data breaches.
Cross-type Biomedical Named Entity Recognition with Deep Multi-Task Learning
Venue: arXiv cs.IR 2018
Year: 2018

Motivation: State-of-the-art biomedical named entity recognition (BioNER) systems often require handcrafted features specific to each entity type, such as genes, chemicals and diseases. Although recent studies explored using neural network models for BioNER to free experts from manual feature engineering, the performance remains limited by the available training data for each entity type. Results: We propose a multi-task learning framework for BioNER to collectively use the training data of different types of entities and improve the performance on each of them. In experiments on 15 benchmark BioNER datasets, our multi-task model achieves substantially better performance compared with state-of-the-art BioNER systems and baseline neural sequence labeling models. Further analysis shows that the large performance gains come from sharing character- and word-level information among relevant biomedical entities across differently labeled corpora.
SIR Coverage Analysis in Cellular Networks with Temporal Traffic: A Stochastic Geometry Approach
Venue: arXiv cs.IT 2018
Year: 2018

The bloom in mobile applications not just bring in enjoyment to daily life, but also imposes more complicated traffic situation on wireless network. A complete understanding of the impact from traffic profile is thus essential for network operators to respond adequately to the surge in data traffic. In this paper, based on stochastic geometry and queuing theory, we develop a mathematical framework that captures the interplay between the spatial location of base stations (BSs), which determines the magnitude of mutual interference, and their temporal traffic dy- namic. We derive a tractable expression for the SIR distribution, and verify its accuracy via simulations. Based on our analysis, we find that i) under the same configuration, when traffic condition changes from light to heavy, the corresponding SIR requirement can differ by more than 10 dB for the network to maintain coverage, ii) the SIR coverage probability varies largely with traffic fluctuation in the sub-medium load regime, whereas in scenario with very light traffic load, the SIR outage probability increases linearly with the packet arrival rate, iii) the mean delay, as well as coverage probability of cell edge user equipments (UEs) are vulnerable to the traffic fluctuation, thus confirms its appeal for traffic-aware communication technology.
Diagnose like a Radiologist: Attention Guided Convolutional Neural Network for Thorax Disease Classification
Venue: arXiv cs.CV 2018
Year: 2018

This paper considers the task of thorax disease classification on chest X-ray images. Existing methods generally use the global image as input for network learning. Such a strategy is limited in two aspects. 1) A thorax disease usually happens in (small) localized areas which are disease specific. Training CNNs using global image may be affected by the (excessive) irrelevant noisy areas. 2) Due to the poor alignment of some CXR images, the existence of irregular borders hinders the network performance. In this paper, we address the above problems by proposing a three-branch attention guided convolution neural network (AG-CNN). AG-CNN 1) learns from disease-specific regions to avoid noise and improve alignment, 2) also integrates a global branch to compensate the lost discriminative cues by local branch. Specifically, we first learn a global CNN branch using global images. Then, guided by the attention heat map generated from the global branch, we inference a mask to crop a discriminative region from the global image. The local region is used for training a local CNN branch. Lastly, we concatenate the last pooling layers of both the global and local branches for fine-tuning the fusion branch. The Comprehensive experiment is conducted on the ChestX-ray14 dataset. We first report a strong global baseline producing an average AUC of 0.841 with ResNet-50 as backbone. After combining the local cues with the global information, AG-CNN improves the average AUC to 0.868. While DenseNet-121 is used, the average AUC achieves 0.871, which is a new state of the art in the community.
PEYMA: A Tagged Corpus for Persian Named Entities
Venue: arXiv cs.CL 2018
Year: 2018

The goal in the NER task is to classify proper nouns of a text into classes such as person, location, and organization. This is an important preprocessing step in many NLP tasks such as question-answering and summarization. Although many research studies have been conducted in this area in English and the state-of-the-art NER systems have reached performances of higher than 90 percent in terms of F1 measure, there are very few research studies for this task in Persian. One of the main important causes of this may be the lack of a standard Persian NER dataset to train and test NER systems. In this research we create a standard, big-enough tagged Persian NER dataset which will be distributed for free for research purposes. In order to construct such a standard dataset, we studied standard NER datasets which are constructed for English researches and found out that almost all of these datasets are constructed using news texts. So we collected documents from ten news websites. Later, in order to provide annotators with some guidelines to tag these documents, after studying guidelines used for constructing CoNLL and MUC standard English datasets, we set our own guidelines considering the Persian linguistic rules.