OpenRaiser/Intern-Atlas huggingface dataset:
Vision-based Automated Bridge Component Recognition Integrated With High-level Scene Understanding
Venue: arXiv cs.CV 2018
Year: 2018

Image data has a great potential of helping conventional visual inspections of civil engineering structures due to the ease of data acquisition and the advantages in capturing visual information. A variety of techniques have been proposed to detect damages, such as cracks and spalling on a close-up image of a single component (columns and road surfaces etc.). However, these techniques commonly suffer from severe false-positives especially when the image includes multiple components of different structures. To reduce the false-positives and extract reliable information about the structures' conditions, detection and localization of critical structural components are important first steps preceding the damage assessment. This study aims at recognizing bridge structural and non-structural components from images of urban scenes. During the bridge component recognition, every image pixel is classified into one of the five classes (non-bridge, columns, beams and slabs, other structural, other nonstructural) by multi-scale convolutional neural networks (multi-scale CNNs). To reduce false-positives and get consistent labels, the component classifications are integrated with scene understanding by an additional classifier with 10 higher-level scene classes (building, greenery, person, pavement, signs and poles, vehicles, bridges, water, sky, and others). The bridge component recognition integrated with the scene understanding is compared with the naive approach without scene classification in terms of accuracy, false-positives and consistencies to demonstrate the effectiveness of the integrated approach.
SAS-Assisted Coexistence-Aware Dynamic Channel Assignment in CBRS Band
Venue: arXiv cs.NI 2018
Year: 2018

The paradigm of shared spectrum allows secondary devices to opportunistically access spectrum bands underutilized by primary owners. Recently, the FCC has targeted the sharing of the 3.5 GHz (3550-3700 MHz) federal spectrum with commercial systems such as small cells. The rules require a Spectrum Access System (SAS) to accommodate three service tiers: 1) Incumbent Access, 2) Priority Access (PA), and 3) Generalized Authorized Access (GAA). In this work, we study the SAS-assisted dynamic channel assignment (CA) for PA and GAA tiers.We introduce the node-channel-pair conflict graph to capture pairwise interference, channel and geographic contiguity constraints, spatially varying channel availability, and coexistence awareness. The proposed conflict graph allows us to formulate PA CA and GAA CA with binary conflicts as max-cardinality and max-reward CA, respectively. Approximate solutions can be found by a heuristic-based algorithm that search for the maximum weighted independent set. We further formulate GAA CA with non-binary conflicts as max-utility CA. We show that the utility function is submodular, and the problem is an instance of matroid-constrained submodular maximization. A polynomial-time algorithm based on local search is proposed that provides a provable performance guarantee. Extensive simulations using a real-world Wi-Fi hotspot location dataset are conducted to evaluate the proposed algorithms. Our results have demonstrated the advantages of the proposed graph representation and improved performance of the proposed algorithms over the baseline algorithms.
SoPa: Bridging CNNs, RNNs, and Weighted Finite-State Machines
Venue: arXiv cs.CL 2018
Year: 2018

Recurrent and convolutional neural networks comprise two distinct families of models that have proven to be useful for encoding natural language utterances. In this paper we present SoPa, a new model that aims to bridge these two approaches. SoPa combines neural representation learning with weighted finite-state automata (WFSAs) to learn a soft version of traditional surface patterns. We show that SoPa is an extension of a one-layer CNN, and that such CNNs are equivalent to a restricted version of SoPa, and accordingly, to a restricted form of WFSA. Empirically, on three text classification tasks, SoPa is comparable or better than both a BiLSTM (RNN) baseline and a CNN baseline, and is particularly useful in small data settings.
A Framework to Integrate Mode Choice in the Design of Mobility-on-Demand Systems
Venue: arXiv cs.SY 2018
Year: 2018

Mobility-on-Demand (MoD) systems are generally designed and analyzed for a fixed and exogenous demand, but such frameworks fail to answer questions about the impact of these services on the urban transportation system, such as the effect of induced demand and the implications for transit ridership. In this study, we propose a unified framework to design, optimize and analyze MoD operations within a multimodal transportation system where the demand for a travel mode is a function of its level of service. An application of Bayesian optimization (BO) to derive the optimal supply-side MoD parameters (e.g., fleet size and fare) is also illustrated. The proposed framework is calibrated using the taxi demand data in Manhattan, New York. Travel demand is served by public transit and MoD services of varying passenger capacities (1, 4 and 10), and passengers are predicted to choose travel modes according to a mode choice model. This choice model is estimated using stated preference data collected in New York City. The convergence of the multimodal supply-demand system and the superiority of the BO-based optimization method over earlier approaches are established through numerical experiments. We finally consider a policy intervention where the government imposes a tax on the ride-hailing service and illustrate how the proposed framework can quantify the pros and cons of such policies for different stakeholders.
Monocular Vehicle Self-localization method based on Compact Semantic Map
Venue: arXiv cs.RO 2018
Year: 2018

High precision localization is a crucial requirement for the autonomous driving system. Traditional positioning methods have some limitations in providing stable and accurate vehicle poses, especially in an urban environment. Herein, we propose a novel self-localizing method using a monocular camera and a 3D compact semantic map. Pre-collected information of the road landmarks is stored in a self-defined map with a minimal amount of data. We recognize landmarks using a deep neural network, followed with a geometric feature extraction process which promotes the measurement accuracy. The vehicle location and posture are estimated by minimizing a self-defined re-projection residual error to evaluate the map-to-image registration, together with a robust association method. We validate the effectiveness of our approach by applying this method to localize a vehicle in an open dataset, achieving the RMS accuracy of 0.345 meter with reduced sensor setup and map storage compared to the state of art approaches. We also evaluate some key steps and discuss the contribution of the subsystems.
A Software-Defined Approach for QoS Control in High-Performance Computing Storage Systems
Venue: arXiv cs.DC 2018
Year: 2018

High-performance computing (HPC) storage systems become increasingly critical to scientific applications given the data-driven discovery paradigm shift. As a storage solution for large-scale HPC systems, dozens of applications share the same storage system, and will compete and can interfere with each other. Application interference can dramatically degrade the overall storage system performance. Therefore, developing a flexible and effective storage solution to assure a certain level of resources per application, i.e. the Quality-of-Service (QoS) support, is critical. One of the common solution to achieve QoS assurance for storage systems is using provisioning technique~\cite{3}. Provisioning refers to the ability of providing certain amount of resources for applications and expected workloads. However, provisioning has limitations such as requiring the detailed knowledge of the expected workloads. In addition, the storage workloads are transient hence expensive to be satisfied. Due to these limitations, providing QoS storage systems through provisioning is challenging. In this research, a software-defined approach~\cite{0} is proposed as a flexible solution to achieve QoS guarantee for storage systems. The driving force of using a software-defined approach instead of the traditional approaches, is that it has the ability to enable a more flexible, scalable, and efficient platform. For example, if any changes occurred in the system, it does not necessarily need to re-configure thousands of devices; instead, with re-configuring a logically centralized component, other devices will be automatically notified.
A Cross-Layer Solution in Scientific Workflow System for Tackling Data Movement Challenge
Venue: arXiv cs.DC 2018
Year: 2018

Scientific applications in HPC environment are more com-plex and more data-intensive nowadays. Scientists usually rely on workflow system to manage the complexity: simply define multiple processing steps into a single script and let the work-flow systems compile it and schedule all tasks accordingly. Numerous workflow systems have been proposed and widely used, like Galaxy, Pegasus, Taverna, Kepler, Swift, AWE, etc., to name a few examples. Traditionally, scientific workflow systems work with parallel file systems, like Lustre, PVFS, Ceph, or other forms of remote shared storage systems. As such, the data (including the intermediate data generated during workflow execution) need to be transferred back and forth between compute nodes and storage systems, which introduces a significant performance bottleneck on I/O operations. Along with the enlarging perfor-mance gap between CPU and storage devices, this bottleneck is expected to be worse. Recently, we have introduced a new concept of Compute-on-Data-Path to allow tasks and data binding to be more efficient to reduce the data movement cost. To workflow systems, the key is to exploit the data locality in HPC storage hierarchy: if the datasets are stored in compute nodes, near the workflow tasks, then the task can directly access them with better performance with less network usage. Several recent studies have been done regarding building such a shared storage system, utilizing compute node resources, to serve HPC workflows with locality, such as Hercules [1] and WOSS [2] etc. In this research, we further argue that providing a compute-node side storage system is not sufficient to fully exploit data locality. A cross-layer solution combining storage system, compiler, and runtime is necessary. We take Swift/T [3], a workflow system for data-intensive applications, as a prototype platform to demonstrate such a cross-layer solution
Lightweight Pyramid Networks for Image Deraining
Venue: arXiv cs.CV 2018
Year: 2018

Existing deep convolutional neural networks have found major success in image deraining, but at the expense of an enormous number of parameters. This limits their potential application, for example in mobile devices. In this paper, we propose a lightweight pyramid of networks (LPNet) for single image deraining. Instead of designing a complex network structures, we use domain-specific knowledge to simplify the learning process. Specifically, we find that by introducing the mature Gaussian-Laplacian image pyramid decomposition technology to the neural network, the learning problem at each pyramid level is greatly simplified and can be handled by a relatively shallow network with few parameters. We adopt recursive and residual network structures to build the proposed LPNet, which has less than 8K parameters while still achieving state-of-the-art performance on rain removal. We also discuss the potential value of LPNet for other low- and high-level vision tasks.
On Affine Tropical F5 Algorithms
Venue: arXiv cs.SC 2018
Year: 2018

Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can be defined with a theory of Gr{ö}bner bases taking into account the valuation of $K$.Because of the use of the valuation, the theory of tropical Gr{ö}bner bases has proved to provide settings for computations over polynomial rings over a $p$-adic field that are more stable than that of classical Gr{ö}bner bases.Beforehand, these strategies were only available for homogeneous polynomials. In this article, we extend the F5 strategy to a new definition of tropical Gr{ö}bner bases in an affine setting.We provide numerical examples to illustrate time-complexity and $p$-adic stability of this tropical F5 algorithm.We also illustrate its merits as a first step before an FGLM algorithm to compute (classical) lex bases over $p$-adics.
Non-Altering Time Scales for Aggregation of Dynamic Networks into Series of Graphs
Venue: arXiv cs.SI 2018
Year: 2018

Many dynamic networks coming from real-world contexts are link streams, i.e. a finite collection of triplets $(u,v,t)$ where $u$ and $v$ are two nodes having a link between them at time $t$. A very large number of studies on these objects start by aggregating the data in disjoint time windows of length $Δ$ in order to obtain a series of graphs on which are made all subsequent analyses. Here we are concerned with the impact of the chosen $Δ$ on the obtained graph series. We address the fundamental question of knowing whether a series of graphs formed using a given $Δ$ faithfully describes the original link stream. We answer the question by showing that such dynamic networks exhibit a threshold for $Δ$, which we call the \emph{saturation scale}, beyond which the properties of propagation of the link stream are altered, while they are mostly preserved before. We design an automatic method to determine the saturation scale of any link stream, which we apply and validate on several real-world datasets.
Fair Allocation of Indivisible Items With Externalities
Venue: arXiv cs.GT 2018
Year: 2018

One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that a bundle allocated to an agent may affect the utilities of other agents. In this paper, we conduct a study of fair allocation of indivisible goods when the externalities are not negligible. We present a simple and natural model, namely \emph{network externalities}, to capture the externalities. To evaluate fairness in the network externalities model, we generalize the idea behind the notion of maximin-share ($\MMS$) to achieve a new criterion, namely, \emph{extended-maximin-share} ($\EMMS$). Next, we consider two problems concerning our model. First, we discuss the computational aspects of finding the value of $\EMMS$ for every agent. For this, we introduce a generalized form of partitioning problem that includes many famous partitioning problems such as maximin, minimax, and leximin partitioning problems. We show that a $1/2$-approximation algorithm exists for this partitioning problem. Next, we investigate on finding approximately optimal $\EMMS$ allocations. That is, allocations that guarantee every agent a utility of at least a fraction of his extended-maximin-share. We show that under a natural assumption that the agents are $α$-self-reliant, an $α/2$-$\EMMS$ allocation always exists. The combination of this with the former result yields a polynomial-time $α/4$-$\EMMS$ allocation algorithm.
Predicting the Next Best View for 3D Mesh Refinement
Venue: arXiv cs.CV 2018
Year: 2018

3D reconstruction is a core task in many applications such as robot navigation or sites inspections. Finding the best poses to capture part of the scene is one of the most challenging topic that goes under the name of Next Best View. Recently, many volumetric methods have been proposed; they choose the Next Best View by reasoning over a 3D voxelized space and by finding which pose minimizes the uncertainty decoded into the voxels. Such methods are effective, but they do not scale well since the underlaying representation requires a huge amount of memory. In this paper we propose a novel mesh-based approach which focuses on the worst reconstructed region of the environment mesh. We define a photo-consistent index to evaluate the 3D mesh accuracy, and an energy function over the worst regions of the mesh which takes into account the mutual parallax with respect to the previous cameras, the angle of incidence of the viewing ray to the surface and the visibility of the region. We test our approach over a well known dataset and achieve state-of-the-art results.
A Local Polynomial Approach to Nonparametric Estimation of the Best Linear Approximation of Lithium-Ion Battery From Multiple Datasets
Venue: arXiv cs.SY 2018
Year: 2018

Battery short-term electrical impedance behavior varies between linear, linear time-varying, or nonlinear at different operating conditions. Data-based electrical impedance modeling techniques often model the battery as a linear time-invariant system at all operating conditions. In addition, these techniques require extensive and time consuming experimentation. Often due to sensor failures during experiments, constraints in data acquisition hardware, varying operating conditions, and the slow dynamics of the battery, it is not always possible to acquire data in a single experiment. Hence, multiple experiments must be performed. In this letter, a local polynomial approach is proposed to estimate nonparametrically the best linear approximation of the electrical impedance affected by varying levels of nonlinear distortion, from a series of input current and output voltage data subrecords of arbitrary length.
Distributed Automata and Logic
Venue: arXiv cs.FL 2018
Year: 2018

Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite number of synchronous rounds. For the local variant of those automata, where the number of rounds is bounded by a constant, Hella et al. (2012, 2015) have established a logical characterization in terms of basic modal logic. In this thesis, we provide similar logical characterizations for two more expressive classes of distributed automata. The first class extends local automata with a global acceptance condition and the ability to alternate between nondeterministic and parallel computations. We show that it is equivalent to monadic second-order logic on graphs. By restricting transitions to be nondeterministic or deterministic, we also obtain two strictly weaker variants for which the emptiness problem is decidable. Our second class transfers the standard notion of asynchronous algorithm to the setting of nonlocal distributed automata. The resulting machines are shown to be equivalent to a small fragment of least fixpoint logic, and more specifically, to a restricted variant of the modal μ-calculus that allows least fixpoints but forbids greatest fixpoints. Exploiting the connection with logic, we additionally prove that the expressive power of those asynchronous automata is independent of whether or not messages can be lost.
reclaimID: Secure, Self-Sovereign Identities using Name Systems and Attribute-Based Encryption
Venue: arXiv cs.CR 2018
Year: 2018

In this paper we present reclaimID: An architecture that allows users to reclaim their digital identities by securely sharing identity attributes without the need for a centralised service provider. We propose a design where user attributes are stored in and shared over a name system under user-owned namespaces. Attributes are encrypted using attribute-based encryption (ABE), allowing the user to selectively authorize and revoke access of requesting parties to subsets of his attributes. We present an implementation based on the decentralised GNU Name System (GNS) in combination with ciphertext-policy ABE using type-1 pairings. To show the practicality of our implementation, we carried out experimental evaluations of selected implementation aspects including attribute resolution performance. Finally, we show that our design can be used as a standard OpenID Connect Identity Provider allowing our implementation to be integrated into standard-compliant services.
Automatic Annotation of Locative and Directional Expressions in Arabic
Venue: arXiv cs.CL 2018
Year: 2018

In this paper, we introduce a rule-based approach to annotate Locative and Directional Expressions in Arabic natural language text. The annotation is based on a constructed semantic map of the spatiality domain. Challenges are twofold: first, we need to study how locative and directional expressions are expressed linguistically in these texts; and second, we need to automatically annotate the relevant textual segments accordingly. The research method we will use in this article is analytic-descriptive. We will validate this approach on specific novel rich with these expressions and show that it has very promising results. We will be using NOOJ as a software tool to implement finite-state transducers to annotate linguistic elements according to Locative and Directional Expressions. In conclusion, NOOJ allowed us to write linguistic rules for the automatic annotation in Arabic text of Locative and Directional Expressions.
Conflict-free Replicated Data Types (CRDTs)
Venue: arXiv cs.DC 2018
Year: 2018

A conflict-free replicated data type (CRDT) is an abstract data type, with a well defined interface, designed to be replicated at multiple processes and exhibiting the following properties: (1) any replica can be modified without coordinating with another replicas; (2) when any two replicas have received the same set of updates, they reach the same state, deterministically, by adopting mathematically sound rules to guarantee state convergence.
Object detection at 200 Frames Per Second
Venue: arXiv cs.CV 2018
Year: 2018

In this paper, we propose an efficient and fast object detector which can process hundreds of frames per second. To achieve this goal we investigate three main aspects of the object detection framework: network architecture, loss function and training data (labeled and unlabeled). In order to obtain compact network architecture, we introduce various improvements, based on recent work, to develop an architecture which is computationally light-weight and achieves a reasonable performance. To further improve the performance, while keeping the complexity same, we utilize distillation loss function. Using distillation loss we transfer the knowledge of a more accurate teacher network to proposed light-weight student network. We propose various innovations to make distillation efficient for the proposed one stage detector pipeline: objectness scaled distillation loss, feature map non-maximal suppression and a single unified distillation loss function for detection. Finally, building upon the distillation loss, we explore how much can we push the performance by utilizing the unlabeled data. We train our model with unlabeled data using the soft labels of the teacher network. Our final network consists of 10x fewer parameters than the VGG based object detection network and it achieves a speed of more than 200 FPS and proposed changes improve the detection accuracy by 14 mAP over the baseline on Pascal dataset.