OpenRaiser/Intern-Atlas huggingface dataset:
Plaque Classification in Coronary Arteries from IVOCT Images Using Convolutional Neural Networks and Transfer Learning
Venue: arXiv cs.CV 2018
Year: 2018

Advanced atherosclerosis in the coronary arteries is one of the leading causes of deaths worldwide while being preventable and treatable. In order to image atherosclerotic lesions (plaque), intravascular optical coherence tomography (IVOCT) can be used. The technique provides high-resolution images of arterial walls which allows for early plaque detection by experts. Due to the vast amount of IVOCT images acquired in clinical routines, automatic plaque detection has been addressed. For example, attenuation profiles in single A-Scans of IVOCT images are examined to detect plaque. We address automatic plaque classification from entire IVOCT images, the cross-sectional view of the artery, using deep feature learning. In this way, we take context between A-Scans into account and we directly learn relevant features from the image source without the need for handcrafting features.
Generating Multilingual Parallel Corpus Using Subtitles
Venue: arXiv cs.CL 2018
Year: 2018

Neural Machine Translation with its significant results, still has a great problem: lack or absence of parallel corpus for many languages. This article suggests a method for generating considerable amount of parallel corpus for any language pairs, extracted from open source materials existing on the Internet. Parallel corpus contents will be derived from video subtitles. It needs a set of video titles, with some attributes like release date, rating, duration and etc. Process of finding and downloading subtitle pairs for desired language pairs is automated by using a crawler. Finally sentence pairs will be extracted from synchronous dialogues in subtitles. The main problem of this method is unsynchronized subtitle pairs. Therefore subtitles will be verified before downloading. If two subtitle were not synchronized, then another subtitle of that video will be processed till it finds the matching subtitle. Using this approach gives ability to make context based parallel corpus through filtering videos by genre. Context based corpus can be used in complex translators which decode sentences by different networks after determining contents subject. Languages have many differences in their formal and informal styles, including words and syntax. Other advantage of this method is to make corpus of informal style of languages. Because most of movies dialogues are parts of a conversation. So they had informal style. This feature of generated corpus can be used in real-time translators to have more accurate conversation translations.
Modeling and Testing Implementations of Protocols with Complex Messages
Venue: arXiv cs.SE 2018
Year: 2018

This paper presents a new language called APSL for formally describing protocols to facilitate automated testing. Many real world communication protocols exchange messages whose structures are not trivial, e.g. they may consist of multiple and nested fields, some could be optional, and some may have values that depend on other fields. To properly test implementations of such a protocol, it is not sufficient to only explore different orders of sending and receiving messages. We also need to investigate if the implementation indeed produces correctly formatted messages, and if it responds correctly when it receives different variations of every message type. APSL's main contribution is its sublanguage that is expressive enough to describe complex message formats, both text-based and binary. As an example, this paper also presents a case study where APSL is used to model and test a subset of Courier IMAP email server.
Completeness of Cyclic Proofs for Symbolic Heaps
Venue: arXiv cs.LO 2018
Year: 2018

Separation logic is successful for software verification in both theory and practice. Decision procedure for symbolic heaps is one of the key issues. This paper proposes a cyclic proof system for symbolic heaps with general form of inductive definitions, and shows its soundness and completeness. The decision procedure for entailments of symbolic heaps with inductive definitions is also given. Decidability for entailments of symbolic heaps with inductive definitions is an important question. Completeness of cyclic proof systems is also an important question. The results of this paper answer both questions. The decision procedure is feasible since it is nondeterministic double-exponential time complexity.
Edge-based LBP description of surfaces with colorimetric patterns
Venue: arXiv cs.GR 2018
Year: 2018

In this paper we target the problem of the retrieval of colour patterns over surfaces. We generalize to surface tessellations the well known Local Binary Pattern (LBP) descriptor for images. The key concept of the LBP is to code the variability of the colour values around each pixel. In the case of a surface tessellation we adopt rings around vertices that are obtained with a sphere-mesh intersection driven by the edges of the mesh; for this reason, we name our method edgeLBP. Experimental results are provided to show how this description performs well for pattern retrieval, also when patterns come from degraded and corrupted archaeological fragments.
Experimental similarity assessment for a collection of fragmented artifacts
Venue: arXiv cs.GR 2018
Year: 2018

In the Visual Heritage domain, search engines are expected to support archaeologists and curators to address cross-correlation and searching across multiple collections. Archaeological excavations return artifacts that often are damaged with parts that are fragmented in more pieces or totally missing. The notion of similarity among fragments cannot simply base on the geometric shape but style, material, color, decorations, etc. are all important factors that concur to this concept. In this work, we discuss to which extent the existing techniques for 3D similarity matching are able to approach fragment similarity, what is missing and what is necessary to be further developed.
A Generation Method of Filtering Rules of Twitter Via Smartphone Based Participatory Sensing System for Tourist by Interactive GHSOM and C4.5
Venue: arXiv cs.CY 2018
Year: 2018

Mobile Phone based Participatory Sensing (MPPS) systems involve a community of users sending personal information and participating in autonomous sensing through their mobile phones. Sensed data can also be obtained from external sensing devices that can communicate wirelessly to the phone. We have developed the tourist subjective data collection system with Android smartphone. The tourist can tweet the information of sightseeing spots by using the application. The application can determine the filtering rules to provide the important information of sightseeing spot. The rules are automatically generated by Interactive Growing Hierarchical SOM and C4.5.
Bipartitioning Problems on Graphs with Bounded Tree-Width
Venue: arXiv cs.DS 2018
Year: 2018

For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as an induced subgraph? These problems are NP-complete and are expressible in monadic second order logic (MSOL). The MSOL formulation, together with Courcelle's theorem implies linear time solvability on graphs with bounded tree-width. This approach yields algorithms with running time f(|phi|, t) * n, where |phi| is the length of the MSOL formula, t is the tree-width of the graph and n is the number of vertices of the graph. The dependency of f(|phi|, t) on |phi| can be as bad as a tower of exponentials. In this paper, we present explicit combinatorial algorithms for these problems for graphs G whose tree-width is bounded. We obtain 2^{O(t^r)} * n time algorithms when H is any fixed graph of order r. In the special case when H = K_r, a complete graph on r vertices, we get an 2^{O(t+r \log t)} * n time algorithm. The techniques can be extended to provide FPT algorithms to determine the smallest number q such that V can be partitioned into q parts such that none of the parts have H as a subgraph (induced subgraph).
Flexible and Scalable Deep Learning with MMLSpark
Venue: arXiv cs.DC 2018
Year: 2018

In this work we detail a novel open source library, called MMLSpark, that combines the flexible deep learning library Cognitive Toolkit, with the distributed computing framework Apache Spark. To achieve this, we have contributed Java Language bindings to the Cognitive Toolkit, and added several new components to the Spark ecosystem. In addition, we also integrate the popular image processing library OpenCV with Spark, and present a tool for the automated generation of PySpark wrappers from any SparkML estimator and use this tool to expose all work to the PySpark ecosystem. Finally, we provide a large library of tools for working and developing within the Spark ecosystem. We apply this work to the automated classification of Snow Leopards from camera trap images, and provide an end to end solution for the non-profit conservation organization, the Snow Leopard Trust.
Fully Dynamic Effective Resistances
Venue: arXiv cs.DS 2018
Year: 2018

In this paper we consider the \emph{fully-dynamic} All-Pairs Effective Resistance problem, where the goal is to maintain effective resistances on a graph $G$ among any pair of query vertices under an intermixed sequence of edge insertions and deletions in $G$. The effective resistance between a pair of vertices is a physics-motivated quantity that encapsulates both the congestion and the dilation of a flow. It is directly related to random walks, and it has been instrumental in the recent works for designing fast algorithms for combinatorial optimization problems, graph sparsification, and network science. We give a data-structure that maintains $(1+ε)$-approximations to all-pair effective resistances of a fully-dynamic unweighted, undirected multi-graph $G$ with $\tilde{O}(m^{4/5}ε^{-4})$ expected amortized update and query time, against an oblivious adversary. Key to our result is the maintenance of a dynamic \emph{Schur complement}~(also known as vertex resistance sparsifier) onto a set of terminal vertices of our choice. This maintenance is obtained (1) by interpreting the Schur complement as a sum of random walks and (2) by randomly picking the vertex subset into which the sparsifier is constructed. We can then show that each update in the graph affects a small number of such walks, which in turn leads to our sub-linear update time. We believe that this local representation of vertex sparsifiers may be of independent interest.
Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs
Venue: arXiv cs.DS 2018
Year: 2018

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_t$-free graphs, that is, on graphs not containing any induced path on $t$ vertices. So far, polynomial-time algorithms are known only for $t\le 5$ [Lokshtanov et al., SODA 2014, 570--581, 2014], and an algorithm for $t=6$ announced recently [Grzesik et al. Arxiv 1707.05491, 2017]. Here we study the existence of subexponential-time algorithms for the problem: we show that for any $t\ge 1$, there is an algorithm for Maximum Independent Set on $P_t$-free graphs whose running time is subexponential in the number of vertices. Even for the weighted version MWIS, the problem is solvable in $2^{O(\sqrt {tn \log n})}$ time on $P_t$-free graphs. For approximation of MIS in broom-free graphs, a similar time bound is proved. Scattered Set is the generalization of Maximum Independent Set where the vertices of the solution are required to be at distance at least $d$ from each other. We give a complete characterization of those graphs $H$ for which $d$-Scattered Set on $H$-free graphs can be solved in time subexponential in the size of the input (that is, in the number of vertices plus the number of edges): If every component of $H$ is a path, then $d$-Scattered Set on $H$-free graphs with $n$ vertices and $m$ edges can be solved in time $2^{O(|V(H)|\sqrt{n+m}\log (n+m))}$, even if $d$ is part of the input. Otherwise, assuming the Exponential-Time Hypothesis (ETH), there is no $2^{o(n+m)}$-time algorithm for $d$-Scattered Set for any fixed $d\ge 3$ on $H$-free graphs with $n$-vertices and $m$-edges.
Comparing scientific and technological impact of biomedical research
Venue: arXiv cs.DL 2018
Year: 2018

Traditionally, the number of citations that a scholarly paper receives from other papers is used as the proxy of its scientific impact. Yet citations can come from domains outside the scientific community, and one such example is through patented technologies---paper can be cited by patents, achieving technological impact. While the scientific impact of papers has been extensively studied, the technological aspect remains less known in the literature. Here we aim to fill this gap by presenting a comparative study on how 919 thousand biomedical papers are cited by U.S. patents and by other papers over time. We observe a positive correlation between citations from patents and from papers, but there is little overlap between the two domains in either the most cited papers, or papers with the most delayed recognition. We also find that the two types of citations exhibit distinct temporal variations, with patent citations lagging behind paper citations for a median of 6 years for the majority of papers. Our work contributes to the understanding of the technological impact of papers.
Learning Abstractions for Program Synthesis
Venue: arXiv cs.PL 2018
Year: 2018

Many example-guided program synthesis techniques use abstractions to prune the search space. While abstraction-based synthesis has proven to be very powerful, a domain expert needs to provide a suitable abstract domain, together with the abstract transformers of each DSL construct. However, coming up with useful abstractions can be non-trivial, as it requires both domain expertise and knowledge about the synthesizer. In this paper, we propose a new technique for learning abstractions that are useful for instantiating a general synthesis framework in a new domain. Given a DSL and a small set of training problems, our method uses tree interpolation to infer reusable predicate templates that speed up synthesis in a given domain. Our method also learns suitable abstract transformers by solving a certain kind of second-order constraint solving problem in a data-driven way. We have implemented the proposed method in a tool called ATLAS and evaluate it in the context of the BLAZE meta-synthesizer. Our evaluation shows that (a) ATLAS can learn useful abstract domains and transformers from few training problems, and (b) the abstractions learned by ATLAS allow BLAZE to achieve significantly better results compared to manually-crafted abstractions.
Machine Learning DDoS Detection for Consumer Internet of Things Devices
Venue: arXiv cs.CR 2018
Year: 2018

An increasing number of Internet of Things (IoT) devices are connecting to the Internet, yet many of these devices are fundamentally insecure, exposing the Internet to a variety of attacks. Botnets such as Mirai have used insecure consumer IoT devices to conduct distributed denial of service (DDoS) attacks on critical Internet infrastructure. This motivates the development of new techniques to automatically detect consumer IoT attack traffic. In this paper, we demonstrate that using IoT-specific network behaviors (e.g. limited number of endpoints and regular time intervals between packets) to inform feature selection can result in high accuracy DDoS detection in IoT network traffic with a variety of machine learning algorithms, including neural networks. These results indicate that home gateway routers or other network middleboxes could automatically detect local IoT device sources of DDoS attacks using low-cost machine learning algorithms and traffic data that is flow-based and protocol-agnostic.
Peeking the Impact of Points of Interests on Didi
Venue: arXiv cs.CY 2018
Year: 2018

Recently, the online car-hailing service, Didi, has emerged as a leader in the sharing economy. Used by passengers and drivers extensive, it becomes increasingly important for the car-hailing service providers to minimize the waiting time of passengers and optimize the vehicle utilization, thus to improve the overall user experience. Therefore, the supply-demand estimation is an indispensable ingredient of an efficient online car-hailing service. To improve the accuracy of the estimation results, we analyze the implicit relationships between the points of Interest (POI) and the supply-demand gap in this paper. The different categories of POIs have positive or negative effects on the estimation, we propose a POI selection scheme and incorporate it into XGBoost [1] to achieve more accurate estimation results. Our experiment demonstrates our method provides more accurate estimation results and more stable estimation results than the existing methods.
Coevolutionary Neural Population Models
Venue: arXiv cs.NE 2018
Year: 2018

We present a method for using neural networks to model evolutionary population dynamics, and draw parallels to recent deep learning advancements in which adversarially-trained neural networks engage in coevolutionary interactions. We conduct experiments which demonstrate that models from evolutionary game theory are capable of describing the behavior of these neural population systems.
Multi-scale Neural Networks for Retinal Blood Vessels Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Existing supervised approaches didn't make use of the low-level features which are actually effective to this task. And another deficiency is that they didn't consider the relation between pixels, which means effective features are not extracted. In this paper, we proposed a novel convolutional neural network which make sufficient use of low-level features together with high-level features and involves atrous convolution to get multi-scale features which should be considered as effective features. Our model is tested on three standard benchmarks - DRIVE, STARE, and CHASE databases. The results presents that our model significantly outperforms existing approaches in terms of accuracy, sensitivity, specificity, the area under the ROC curve and the highest prediction speed. Our work provides evidence of the power of wide and deep neural networks in retinal blood vessels segmentation task which could be applied on other medical images tasks.
L1 guidance logic extension for small UAVs: handling high winds and small loiter radii
Venue: arXiv cs.RO 2018
Year: 2018

L1 guidance logic is one of the most widely used path following controllers for small fixed-wing unmanned aerial vehicles (UAVs), primarily due to its simplicity (low-cost implementation on embedded on-board processors, e.g. micro-controllers) and ability to track both circles and lines, which make up the vast majority of a typical fixed-wing vehicle's flight plan. The logic was later extended for speed independent dynamic similarity with an adaptive L1 distance, a formulation currently used on common open-source autopilot platforms. Two primary drawbacks remain, specific to small, slow flying fixed-wing UAVs; namely, 1) the combination of low operator defined gains and high ground speeds may violate the bounds of the algorithms convergence region for the case of loiter circles with small radii and 2) L1 logic breaks down when wind speeds exceed the vehicle's airspeed, another common predicament for small, slow-flying UAVs. This brief presents simple extensions to this extensively field tested algorithm, allowing legacy operators to keep existing controller tunings while taking advantage of the enhanced performance and safety features developed within.
Evaluating Word Embedding Hyper-Parameters for Similarity and Analogy Tasks
Venue: arXiv cs.CL 2018
Year: 2018

The versatility of word embeddings for various applications is attracting researchers from various fields. However, the impact of hyper-parameters when training embedding model is often poorly understood. How much do hyper-parameters such as vector dimensions and corpus size affect the quality of embeddings, and how do these results translate to downstream applications? Using standard embedding evaluation metrics and datasets, we conduct a study to empirically measure the impact of these hyper-parameters.
Bilateral Teleoperation of Multiple Robots under Scheduling Communication
Venue: arXiv cs.SY 2018
Year: 2018

In this paper, bilateral teleoperation of multiple slaves coupled to a single master under scheduling communication is investigated. The sampled-data transmission between the master and the multiple slaves is fulfilled over a delayed communication network, and at each sampling instant, only one slave is allowed to transmit its current information to the master side according to some scheduling protocols. To achieve the master-slave synchronization, Round-Robin scheduling protocol and Try-Once-Discard scheduling protocol are employed, respectively. By designing a scheduling-communication-based controller, some sufficient stability criteria related to the controller gain matrices, sampling intervals, and communication delays are obtained for the closed-loop teleoperation system under Round-Robin and Try-Once-Discard scheduling protocols, respectively. Finally, simulation studies are given to validate the effectiveness of the proposed results.
Clustering via Boundary Erosion
Venue: arXiv cs.CV 2018
Year: 2018

Clustering analysis identifies samples as groups based on either their mutual closeness or homogeneity. In order to detect clusters in arbitrary shapes, a novel and generic solution based on boundary erosion is proposed. The clusters are assumed to be separated by relatively sparse regions. The samples are eroded sequentially according to their dynamic boundary densities. The erosion starts from low density regions, invading inwards, until all the samples are eroded out. By this manner, boundaries between different clusters become more and more apparent. It therefore offers a natural and powerful way to separate the clusters when the boundaries between them are hard to be drawn at once. With the sequential order of being eroded, the sequential boundary levels are produced, following which the clusters in arbitrary shapes are automatically reconstructed. As demonstrated across various clustering tasks, it is able to outperform most of the state-of-the-art algorithms and its performance is nearly perfect in some scenarios.