OpenRaiser/Intern-Atlas huggingface dataset:
A Re-ranker Scheme for Integrating Large Scale NLU models
Venue: arXiv cs.CL 2018
Year: 2018

Large scale Natural Language Understanding (NLU) systems are typically trained on large quantities of data, requiring a fast and scalable training strategy. A typical design for NLU systems consists of domain-level NLU modules (domain classifier, intent classifier and named entity recognizer). Hypotheses (NLU interpretations consisting of various intent+slot combinations) from these domain specific modules are typically aggregated with another downstream component. The re-ranker integrates outputs from domain-level recognizers, returning a scored list of cross domain hypotheses. An ideal re-ranker will exhibit the following two properties: (a) it should prefer the most relevant hypothesis for the given input as the top hypothesis and, (b) the interpretation scores corresponding to each hypothesis produced by the re-ranker should be calibrated. Calibration allows the final NLU interpretation score to be comparable across domains. We propose a novel re-ranker strategy that addresses these aspects, while also maintaining domain specific modularity. We design optimization loss functions for such a modularized re-ranker and present results on decreasing the top hypothesis error rate as well as maintaining the model calibration. We also experiment with an extension involving training the domain specific re-rankers on datasets curated independently by each domain to allow further asynchronization. %The proposed re-ranker design showcases the following: (i) improved NLU performance over an unweighted aggregation strategy, (ii) cross-domain calibrated performance and, (iii) support for use cases involving training each re-ranker on datasets curated by each domain independently.
Optimizing the Human-Machine Partnership with Zooniverse
Venue: arXiv cs.HC 2018
Year: 2018

Over the past decade, Citizen Science has become a proven method of distributed data analysis, enabling research teams from diverse domains to solve problems involving large quantities of data with complexity levels which require human pattern recognition capabilities. With over 120 projects built reaching nearly 1.7 million volunteers, the Zooniverse.org platform has led the way in the application of Citizen Science as a method for closing the Big Data analysis gap. Since the launch in 2007 of the Galaxy Zoo project, the Zooniverse platform has enabled significant contributions across many disciplines; e.g., in ecology, humanities, and astronomy. Citizen science as an approach to Big Data combines the twin advantages of the ability to scale analysis to the size of modern datasets with the ability of humans to make serendipitous discoveries. To cope with the larger datasets looming on the horizon such as astronomy's Large Synoptic Survey Telescope (LSST) or the 100's of TB from ecology projects annually, Zooniverse has been researching a system design that is optimized for efficiency in task assignment and incorporating human and machine classifiers into the classification engine. By making efficient use of smart task assignment and the combination of human and machine classifiers, we can achieve greater accuracy and flexibility than has been possible to date. We note that creating the most efficient system must consider how best to engage and retain volunteers as well as make the most efficient use of their classifications. Our work thus focuses on understanding the factors that optimize efficiency of the combined human-machine system. This paper summarizes some of our research to date on integration of machine learning with Zooniverse, while also describing new infrastructure developed on the Zooniverse platform to carry out this research.
Learning Consumer and Producer Embeddings for User-Generated Content Recommendation
Venue: arXiv cs.IR 2018
Year: 2018

User-Generated Content (UGC) is at the core of web applications where users can both produce and consume content. This differs from traditional e-Commerce domains where content producers and consumers are usually from two separate groups. In this work, we propose a method CPRec (consumer and producer based recommendation), for recommending content on UGC-based platforms. Specifically, we learn a core embedding for each user and two transformation matrices to project the user's core embedding into two 'role' embeddings (i.e., a producer and consumer role). We model each interaction by the ternary relation between the consumer, the consumed item, and its producer. Empirical studies on two large-scale UGC applications show that our method outperforms standard collaborative filtering methods as well as recent methods that model producer information via item features.
La prédiction des intérêts des utilisateurs pour la RI contextuelle et la recommandation d'amis dans un environnement mobile
Venue: arXiv cs.IR 2018
Year: 2018

The emergence of smartphones has given mobile computing access to everyday reality. More specifically, the context modeling offers users an effective way to customize search results and even the recommended elements by limiting the data space. Moreover, in recent years, many social sites have embraced the notion of context in their recommendations. Indeed, with the availability of mobile devices, these new mobile sites have the advantage of providing users with more relevant elements based on their current situations. Thus, we introduce a new approach of contextual IR in a mobile environment. We offer a hand, an approach called SA-IRI based on the prediction of users' interests, from DBpedia, given their current situations. This approach applies the technique of associative classification in order to enrich the users' queries. Secondly, we introduce an approach of communities discovering, called Foaf-A-Walk, combining the random walk technique and the Foaf modeling, for friend recommendation.
An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time
Venue: arXiv cs.DS 2018
Year: 2018

This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(log n) query time. As a reduction problem, the uery time complexity is the times of invoking the algorithm for Approximate Near Neighbor problem. All former algorithms for the same reduction need polylog(n) query time. A box split method proposed by Vaidya is used in our paper to achieve the O(log n) query time complexity.
FDBB: Fluid Dynamics Building Blocks
Venue: arXiv cs.MS 2018
Year: 2018

High-performance computing platforms are becoming more and more heterogeneous, which makes it very difficult for researchers and scientific software developers to keep up with the rapid changes on the hardware market. In this paper, the open-source project FDBB (Fluid Dynamics Building Blocks) is presented, which eases the development of fluid dynamics applications for heterogeneous systems. It consists of a low-level API that provides a unified interface to many different linear algebra back-ends and a lightweight and extendible high-level expression template library, which provides largely customizable fluid dynamics building blocks, like transformations between primary and secondary variables as well as expressions for Riemann invariants, equations of state, inviscid fluxes and their flux-Jacobians. The performance of the developed approach is assessed both for synthetic micro-benchmarks and within mini-applications.
Geographical veracity of indicators derived from mobile phone data
Venue: arXiv cs.CY 2018
Year: 2018

In this contribution we summarize insights on the geographical veracity of using mobile phone data to create (statistical) indicators. We focus on problems that persist with spatial allocation, spatial delineation and spatial aggregation of information obtained from mobile phone data. For each of the cases, we offer insights from our works on a French CDR dataset and propose both short and long term solutions. As such, we aim at offering a list of challenges, and a roadmap for future work on the topic.
Two-Layer Model Predictive Battery Thermal and Energy Management Optimization for Connected and Automated Electric Vehicles
Venue: arXiv cs.SY 2018
Year: 2018

Future vehicles are expected to be able to exploit increasingly the connected driving environment for efficient, comfortable, and safe driving. Given relatively slow dynamics associated with the state of charge and temperature response in electrified vehicles with large batteries, a long prediction/planning horizon is needed to achieve improved energy efficiency benefits. In this paper, we develop a two-layer Model Predictive Control (MPC) strategy for battery thermal and energy management of electric vehicle (EV), aiming at improving fuel economy through real-time prediction and optimization. In the first layer, the long-term traffic flow information and an approximate model reflective of the relatively slow battery temperature dynamics are leveraged to minimize energy consumption required for battery cooling while maintaining the battery temperature within the desired operating range. In the second layer, the scheduled battery thermal and state of charge (SOC) trajectories planned to achieve long-term battery energy-optimal thermal behavior are used as the reference over a short horizon to regulate the battery temperature. Additionally, an intelligent online constraint handling (IOCH) algorithm is developed to compensate for the mismatch between the actual and predicted driving conditions and reduce the chance for battery temperature constraint violation. The simulation results show that, depending on the driving cycle, the proposed two-layer MPC is able to save 2.8-7.9% of the battery energy compared to the traditional rule-based controller in connected and automated vehicle (CAV) operation scenario. Moreover, as compared to a single layer MPC with a long horizon, the two-layer structure of the proposed MPC solution reduces significantly the computing effort without compromising the performance.
Computational and informatics advances for reproducible data analysis in neuroimaging
Venue: arXiv cs.CY 2018
Year: 2018

The reproducibility of scientific research has become a point of critical concern. We argue that openness and transparency are critical for reproducibility, and we outline an ecosystem for open and transparent science that has emerged within the human neuroimaging community. We discuss the range of open data sharing resources that have been developed for neuroimaging data, and the role of data standards (particularly the Brain Imaging Data Structure) in enabling the automated sharing, processing, and reuse of large neuroimaging datasets. We outline how the open-source Python language has provided the basis for a data science platform that enables reproducible data analysis and visualization. We also discuss how new advances in software engineering, such as containerization, provide the basis for greater reproducibility in data analysis. The emergence of this new ecosystem provides an example for many areas of science that are currently struggling with reproducibility.
Effects of Automated Interventions in Programming Assignments: Evidence from a Field Experiment
Venue: arXiv cs.CY 2018
Year: 2018

A typical problem in MOOCs is the missing opportunity for course conductors to individually support students in overcoming their problems and misconceptions. This paper presents the results of automatically intervening on struggling students during programming exercises and offering peer feedback and tailored bonus exercises. To improve learning success, we do not want to abolish instructionally desired trial and error but reduce extensive struggle and demotivation. Therefore, we developed adaptive automatic just-in-time interventions to encourage students to ask for help if they require considerably more than average working time to solve an exercise. Additionally, we offered students bonus exercises tailored for their individual weaknesses. The approach was evaluated within a live course with over 5,000 active students via a survey and metrics gathered alongside. Results show that we can increase the call outs for help by up to 66% and lower the dwelling time until issuing action. Learnings from the experiments can further be used to pinpoint course material to be improved and tailor content to be audience specific.
Fused Angles: A Representation of Body Orientation for Balance
Venue: arXiv cs.RO 2018
Year: 2018

The parameterisation of rotations in three dimensional Euclidean space is an area of applied mathematics that has long been studied, dating back to the original works of Euler in the 18th century. As such, many ways of parameterising a rotation have been developed over the years. Motivated by the task of representing the orientation of a balancing body, the fused angles parameterisation is developed and introduced in this paper. This novel representation is carefully defined both mathematically and geometrically, and thoroughly investigated in terms of the properties it possesses, and how it relates to other existing representations. A second intermediate representation, tilt angles, is also introduced as a natural consequence thereof.
The insoluble problems of books: What does Altmetric.com have to offer?
Venue: arXiv cs.DL 2018
Year: 2018

The purpose of this paper is to analyze the capabilities, functionalities and appropriateness of Altmetric.com as a data source for the bibliometric analysis of books in comparison to PlumX. We perform an exploratory analysis on the metrics the Altmetric Explorer for Institutions platform offers for books. We use two distinct datasets of books: the Book Collection included in Altmetric.com and the Clarivate's Master Book List, to analyze Altmetric.com's capabilities to download and merge data with external databases. Finally, we compare our findings with those obtained in a previous study performed in PlumX. Altmetric.com combines and orderly tracks a set of data sources combined by DOI identifiers to retrieve metadata from books, being Google Books its main provider. It also retrieves information from commercial publishers and from some Open Access initiatives, including those led by university libraries such as Harvard Library. We find issues with linkages between records and mentions or ISBN discrepancies. Furthermore, we find that automatic bots affect greatly Wikipedia mentions to books. Our comparison with PlumX suggests that none of these tools provide a complete picture of the social attention generated by books and are rather complementary than comparable tools.
Computer-Aided Diagnosis of Label-Free 3-D Optical Coherence Microscopy Images of Human Cervical Tissue
Venue: arXiv cs.CV 2018
Year: 2018

Objective: Ultrahigh-resolution optical coherence microscopy (OCM) has recently demonstrated its potential for accurate diagnosis of human cervical diseases. One major challenge for clinical adoption, however, is the steep learning curve clinicians need to overcome to interpret OCM images. Developing an intelligent technique for computer-aided diagnosis (CADx) to accurately interpret OCM images will facilitate clinical adoption of the technology and improve patient care. Methods: 497 high-resolution 3-D OCM volumes (600 cross-sectional images each) were collected from 159 ex vivo specimens of 92 female patients. OCM image features were extracted using a convolutional neural network (CNN) model, concatenated with patient information (e.g., age, HPV results), and classified using a support vector machine classifier. Ten-fold cross-validations were utilized to test the performance of the CADx method in a five-class classification task and a binary classification task. Results: An 88.3 plus or minus 4.9% classification accuracy was achieved for five fine-grained classes of cervical tissue, namely normal, ectropion, low-grade and high-grade squamous intraepithelial lesions (LSIL and HSIL), and cancer. In the binary classification task (low-risk [normal, ectropion and LSIL] vs. high-risk [HSIL and cancer]), the CADx method achieved an area-under-the-curve (AUC) value of 0.959 with an 86.7 plus or minus 11.4% sensitivity and 93.5 plus or minus 3.8% specificity. Conclusion: The proposed deep-learning based CADx method outperformed three human experts. It was also able to identify morphological characteristics in OCM images that were consistent with histopathological interpretations. Significance: Label-free OCM imaging, combined with deep-learning based CADx methods, hold a great promise to be used in clinical settings for the effective screening and diagnosis of cervical diseases.
Scaling simulation-to-real transfer by learning composable robot skills
Venue: arXiv cs.LG 2018
Year: 2018

We present a novel solution to the problem of simulation-to-real transfer, which builds on recent advances in robot skill decomposition. Rather than focusing on minimizing the simulation-reality gap, we learn a set of diverse policies that are parameterized in a way that makes them easily reusable. This diversity and parameterization of low-level skills allows us to find a transferable policy that is able to use combinations and variations of different skills to solve more complex, high-level tasks. In particular, we first use simulation to jointly learn a policy for a set of low-level skills, and a "skill embedding" parameterization which can be used to compose them. Later, we learn high-level policies which actuate the low-level policies via this skill embedding parameterization. The high-level policies encode how and when to reuse the low-level skills together to achieve specific high-level tasks. Importantly, our method learns to control a real robot in joint-space to achieve these high-level tasks with little or no on-robot time, despite the fact that the low-level policies may not be perfectly transferable from simulation to real, and that the low-level skills were not trained on any examples of high-level tasks. We illustrate the principles of our method using informative simulation experiments. We then verify its usefulness for real robotics problems by learning, transferring, and composing free-space and contact motion skills on a Sawyer robot using only joint-space control. We experiment with several techniques for composing pre-learned skills, and find that our method allows us to use both learning-based approaches and efficient search-based planning to achieve high-level tasks using only pre-learned skills.
An Infrastructure for Software Release Analysis through Provenance Graphs
Venue: arXiv cs.SE 2018
Year: 2018

Nowadays, quickly evolving and delivering software through a continuous delivery process is a competitive advantage and a way to keep software updated in response to the frequent changes in customers' requirements. However, the faster the software release cycle, the more challenging to track software evolution. In this paper, we propose Releasy, a tool that aims at supporting projects that use continuous delivery by generating and reporting their release provenance. The provenance generated by Releasy allows graphical visualization of the software evolution and supports queries to discover implicit information, such as the implemented features of each release and the involved developers. We also show in this paper a preliminary evaluation of Releasy in action, generating the changelog of an open source project with the provenance collected by our tool.
The QUIC Fix for Optimal Video Streaming
Venue: arXiv cs.NI 2018
Year: 2018

Within a few years of its introduction, QUIC has gained traction: a significant chunk of traffic is now delivered over QUIC. The networking community is actively engaged in debating the fairness, performance, and applicability of QUIC for various use cases, but these debates are centered around a narrow, common theme: how does the new reliable transport built on top of UDP fare in different scenarios? Support for unreliable delivery in QUIC remains largely unexplored. The option for delivering content unreliably, as in a best-effort model, deserves the QUIC designers' and community's attention. We propose extending QUIC to support unreliable streams and present a simple approach for implementation. We discuss a simple use case of video streaming---an application that dominates the overall Internet traffic---that can leverage the unreliable streams and potentially bring immense benefits to network operators and content providers. To this end, we present a prototype implementation that, by using both the reliable and unreliable streams in QUIC, outperforms both TCP and QUIC in our evaluations.
Batch-normalized Recurrent Highway Networks
Venue: arXiv cs.LG 2018
Year: 2018

Gradient control plays an important role in feed-forward networks applied to various computer vision tasks. Previous work has shown that Recurrent Highway Networks minimize the problem of vanishing or exploding gradients. They achieve this by setting the eigenvalues of the temporal Jacobian to 1 across the time steps. In this work, batch normalized recurrent highway networks are proposed to control the gradient flow in an improved way for network convergence. Specifically, the introduced model can be formed by batch normalizing the inputs at each recurrence loop. The proposed model is tested on an image captioning task using MSCOCO dataset. Experimental results indicate that the batch normalized recurrent highway networks converge faster and performs better compared with the traditional LSTM and RHN based models.
Learning-Based Delay-Aware Caching in Wireless D2D Caching Networks
Venue: arXiv cs.IT 2018
Year: 2018

Recently, wireless caching techniques have been studied to satisfy lower delay requirements and offload traffic from peak periods. By storing parts of the popular files at the mobile users, users can locate some of their requested files in their own caches or the caches at their neighbors. In the latter case, when a user receives files from its neighbors, device-to-device(D2D) communication is performed. D2D communication underlaid with cellular networks is also a new paradigm for the upcoming wireless systems. By allowing a pair of adjacent D2D users to communicate directly, D2D communication can achieve higher throughput, better energy efficiency and lower traffic delay. In this work, we propose an efficient learning-based caching algorithm operating together with a non-parametric estimator to minimize the average transmission delay in D2D-enabled cellular networks. It is assumed that the system does not have any prior information regarding the popularity of the files, and the non-parametric estimator is aimed at learning the intensity function of the file requests. An algorithm is devised to determine the best <file,user> pairs that provide the best delay improvement in each loop to form a caching policy with very low transmission delay and high throughput. This algorithm is also extended to address a more general scenario, in which the distributions of fading coefficients and values of system parameters potentially change over time. Via numerical results, the superiority of the proposed algorithm is verified by comparing it with a naive algorithm, in which all users simply cache their favorite files, and by comparing with a probabilistic algorithm, in which the users cache a file with a probability that is proportional to its popularity.
Using Autoencoders To Learn Interesting Features For Detecting Surveillance Aircraft
Venue: arXiv cs.LG 2018
Year: 2018

This paper explores using a Long short-term memory (LSTM) based sequence autoencoder to learn interesting features for detecting surveillance aircraft using ADS-B flight data. An aircraft periodically broadcasts ADS-B (Automatic Dependent Surveillance - Broadcast) data to ground receivers. The ability of LSTM networks to model varying length time series data and remember dependencies that span across events makes it an ideal candidate for implementing a sequence autoencoder for ADS-B data because of its possible variable length time series, irregular sampling and dependencies that span across events.