OpenRaiser/Intern-Atlas huggingface dataset:
PyDraw: a GUI drawing generator based on Tkinter and its design concept
Venue: arXiv cs.HC 2018
Year: 2018

The emergence of GUI is a great progress in the history of computer science and software design. GUI makes human computer interaction more simple and interesting. Python, as a popular programming language in recent years, has not been realized in GUI design. Tkinter has the advantage of native support for Python, but there are too few visual GUI generators supporting Tkinter. This article presents a GUI generator based on Tkinter framework, PyDraw. The design principle of PyDraw and the powerful design concept behind it are introduced in detail. With PyDraw's GUI design philosophy, it can easily design a visual GUI rendering generator for any GUI framework with canvas functionality or programming language with screen display control. This article is committed to conveying PyDraw's GUI free design concept. Through experiments, we have proved the practicability and efficiency of PyDrawd. In order to better convey the design concept of PyDraw, let more enthusiasts join PyDraw update and evolution, we have the source code of PyDraw. At the end of the article, we summarize our experience and express our vision for future GUI design. We believe that the future GUI will play an important role in graphical software programming, the future of less code or even no code programming software design methods must become a focus and hot, free, like drawing GUI will be worth pursuing.
Multiple Lane Detection Algorithm Based on Optimised Dense Disparity Map Estimation
Venue: arXiv cs.CV 2018
Year: 2018

Lane detection is very important for self-driving vehicles. In recent years, computer stereo vision has been prevalently used to enhance the accuracy of the lane detection systems. This paper mainly presents a multiple lane detection algorithm developed based on optimised dense disparity map estimation, where the disparity information obtained at time t_{n} is utilised to optimise the process of disparity estimation at time t_{n+1}. This is achieved by estimating the road model at time t_{n} and then controlling the search range for the disparity estimation at time t_{n+1}. The lanes are then detected using our previously published algorithm, where the vanishing point information is used to model the lanes. The experimental results illustrate that the runtime of the disparity estimation is reduced by around 37% and the accuracy of the lane detection is about 99%.
Psychological Frameworks for Persuasive Information and Communications Technologies
Venue: arXiv cs.HC 2018
Year: 2018

When developing devices to encourage positive change in users, social psychology can offer useful conceptual resources. This article outlines three major theories from the discipline and discusses their implications for designing persuasive technologies.
On Locomotion of a Laminated Fish-inspired robot in a Small-to-size Environment
Venue: arXiv cs.RO 2018
Year: 2018

Many different robots have been designed and built to work under water. In many cases, researchers have chosen to use bio-inspired platforms. In most cases, the main goal of the fish inspired robots has been set to autonomously swim and maneuver in an environment spacious compared to the fish's size. In this paper, the identification control of a low-cost fish-inspired robot is studied with the goal of building a mechanism to not only swim in water but able to interact with its narrow environment. The robotic fish under study uses tail propulsion as main locomotion. Moreover, proper propulsion regimes are identified and used to model and control thrust generated by propulsion.
A Multi-channel DART Algorithm
Venue: arXiv cs.CV 2018
Year: 2018

Tomography deals with the reconstruction of objects from their projections, acquired along a range of angles. Discrete tomography is concerned with objects that consist of a small number of materials, which makes it possible to compute accurate reconstructions from highly limited projection data. For cases where the allowed intensity values in the reconstruction are known a priori, the discrete algebraic reconstruction technique (DART) has shown to yield accurate reconstructions from few projections. However, a key limitation is that the benefit of DART diminishes as the number of different materials increases. Many tomographic imaging techniques can simultaneously record tomographic data at multiple channels, each corresponding to a different weighting of the materials in the object. Whenever projection data from more than one channel is available, this additional information can potentially be exploited by the reconstruction algorithm. In this paper we present Multi-Channel DART (MC-DART), which deals effectively with multi-channel data. This class of algorithms is a generalization of DART to multiple channels and combines the information for each separate channel-reconstruction in a multi-channel segmentation step. We demonstrate that in a range of simulation experiments, MC-DART is capable of producing more accurate reconstructions compared to single-channel DART.
An Academic's Observations from a Sabbatical at Google
Venue: arXiv cs.SE 2018
Year: 2018

How experiences gained in industry can improve academic research and teaching.
A Short Note on Collecting Dependently Typed Values
Venue: arXiv cs.PL 2018
Year: 2018

Within dependently typed languages, such as Idris, types can depend on values. This dependency, however, can limit the collection of items in standard containers: all elements must have the same type, and as such their types must contain the same values. We present two dependently typed data structures for collecting dependent types: \texttt{DList} and \texttt{PList}. Use of these new data structures allow for the creation of single succinct inductive ADT whose constructions were previously verbose and split across many data structures.
Introducing Development Features for Virtualized Network Services
Venue: arXiv cs.NI 2018
Year: 2018

Network virtualization and softwarizing network functions are trends aiming at higher network efficiency, cost reduction and agility. They are driven by the evolution in Software Defined Networking (SDN) and Network Function Virtualization (NFV). This shows that software will play an increasingly important role within telecommunication services, which were previously dominated by hardware appliances. Service providers can benefit from this, as it enables faster introduction of new telecom services, combined with an agile set of possibilities to optimize and fine-tune their operations. However, the provided telecom services can only evolve if the adequate software tools are available. In this article, we explain how the development, deployment and maintenance of such an SDN/NFV-based telecom service puts specific requirements on the platform providing it. A Software Development Kit (SDK) is introduced, allowing service providers to adequately design, test and evaluate services before they are deployed in production and also update them during their lifetime. This continuous cycle between development and operations, a concept known as DevOps, is a well known strategy in software development. To extend its context further to SDN/NFV-based services, the functionalities provided by traditional cloud platforms are not yet sufficient. By giving an overview of the currently available tools and their limitations, the gaps in DevOps for SDN/NFV services are highlighted. The benefit of such an SDK is illustrated by a secure content delivery network service (enhanced with deep packet inspection and elastic routing capabilities). With this use-case, the dynamics between developing and deploying a service are further illustrated.
Distance Based Source Domain Selection for Sentiment Classification
Venue: arXiv cs.IR 2018
Year: 2018

Automated sentiment classification (SC) on short text fragments has received increasing attention in recent years. Performing SC on unseen domains with few or no labeled samples can significantly affect the classification performance due to different expression of sentiment in source and target domain. In this study, we aim to mitigate this undesired impact by proposing a methodology based on a predictive measure, which allows us to select an optimal source domain from a set of candidates. The proposed measure is a linear combination of well-known distance functions between probability distributions supported on the source and target domains (e.g. Earth Mover's distance and Kullback-Leibler divergence). The performance of the proposed methodology is validated through an SC case study in which our numerical experiments suggest a significant improvement in the cross domain classification error in comparison with a random selected source domain for both a naive and adaptive learning setting. In the case of more heterogeneous datasets, the predictability feature of the proposed model can be utilized to further select a subset of candidate domains, where the corresponding classifier outperforms the one trained on all available source domains. This observation reinforces a hypothesis that our proposed model may also be deployed as a means to filter out redundant information during a training phase of SC.
Motorcycle Classification in Urban Scenarios using Convolutional Neural Networks for Feature Extraction
Venue: arXiv cs.CV 2018
Year: 2018

This paper presents a motorcycle classification system for urban scenarios using Convolutional Neural Network (CNN). Significant results on image classification has been achieved using CNNs at the expense of a high computational cost for training with thousands or even millions of examples. Nevertheless, features can be extracted from CNNs already trained. In this work AlexNet, included in the framework CaffeNet, is used to extract features from frames taken on a real urban scenario. The extracted features from the CNN are used to train a support vector machine (SVM) classifier to discriminate motorcycles from other road users. The obtained results show a mean accuracy of 99.40% and 99.29% on a classification task of three and five classes respectively. Further experiments are performed on a validation set of images showing a satisfactory classification.
A Summary Description of the A2RD Project
Venue: arXiv cs.AI 2018
Year: 2018

This paper describes the Autonomous Architecture Over Restricted Domains project. It begins with the description of the context upon which the project is focused, and in the sequence describes the project and implementation models. It finish by presenting the environment conceptual model, showing where stand the components, inputs and facilities required to interact among the intelligent agents of the various implementations in their respective and restricted, routing domains (Autonomous Systems) which together make the Internet work.
PhaseMAC: A 14 TOPS/W 8bit GRO based Phase Domain MAC Circuit for In-Sensor-Computed Deep Learning Accelerators
Venue: arXiv cs.OH 2018
Year: 2018

PhaseMAC (PMAC), a phase domain Gated-Ring-Oscillator (GRO) based 8bit MAC circuit, is proposed to minimize both area and power consumption of deep learning accelerators. PMAC composes of only digital cells and consumes significantly smaller power than standard digital designs, owing to its efficient analog accumulation nature. It occupies 26.6 times smaller area than conventional analog designs, which is competitive to digital MAC circuits. PMAC achieves a peak efficiency of 14 TOPS/W, which is best reported and 48% higher than conventional arts. Results in anomaly detection tasks are demonstrated, which is the hottest application in the industrial IoT scene.
Rational Recurrences
Venue: arXiv cs.CL 2018
Year: 2018

Despite the tremendous empirical success of neural models in natural language processing, many of them lack the strong intuitions that accompany classical machine learning approaches. Recently, connections have been shown between convolutional neural networks (CNNs) and weighted finite state automata (WFSAs), leading to new interpretations and insights. In this work, we show that some recurrent neural networks also share this connection to WFSAs. We characterize this connection formally, defining rational recurrences to be recurrent hidden state update functions that can be written as the Forward calculation of a finite set of WFSAs. We show that several recent neural models use rational recurrences. Our analysis provides a fresh view of these models and facilitates devising new neural architectures that draw inspiration from WFSAs. We present one such model, which performs better than two recent baselines on language modeling and text classification. Our results demonstrate that transferring intuitions from classical models like WFSAs can be an effective approach to designing and understanding neural models.
Application-Network Collaboration Using SDN for Ultra-Low Delay Teleorchestras
Venue: arXiv cs.SY 2018
Year: 2018

Networked Music Performance (NMP) constitutes a class of ultra-low delay sensitive applications, allowing geographically separate musicians to perform seamlessly as a tele-orchestra. For this application type, the QoS indicator is the mouth-to-ear delay, which should be kept under 25 milliseconds. The mouth-to-ear delay comprises signal processing latency and network delay. We propose a strong collaboration between the network and NMP applications to \emph{actively} keep the to mouth-to-ear delay minimal, using direct state notifications. Related approaches can be characterized as \emph{passive}, since they try to estimate the network state indirectly, based on the end application performance. Our solution employs Software Defined Networking (SDN) to implement the network-to-application collaboration, being facilitated by the well-defined network interface that SDN offers. Emulation results show that the proposed scheme achieves an improvement of up to 59% in mouth-to-ear delay over the existing passive solutions.
InfoInternet for Education in the Global South: A Study of Applications Enabled by Free Information-only Internet Access in Technologically Disadvantaged Areas (authors' version)
Venue: arXiv cs.CY 2018
Year: 2018

This paper summarises our work on studying educational applications enabled by the introduction of a new information layer called InfoInternet. This is an initiative to facilitate affordable access to internet based information in communities with network scarcity or economic problems from the Global South. InfoInternet develops both networking solutions as well as business and social models, together with actors like mobile operators and government organisations. In this paper we identify and describe characteristics of educational applications, their specific users, and learning environment. We are interested in applications that make the adoption of Internet faster, cheaper, and wider in such communities. When developing new applications (or adopting existing ones) for such constrained environments, this work acts as initial guidelines prior to field studies.
Layer Trajectory LSTM
Venue: arXiv cs.CL 2018
Year: 2018

It is popular to stack LSTM layers to get better modeling power, especially when large amount of training data is available. However, an LSTM-RNN with too many vanilla LSTM layers is very hard to train and there still exists the gradient vanishing issue if the network goes too deep. This issue can be partially solved by adding skip connections between layers, such as residual LSTM. In this paper, we propose a layer trajectory LSTM (ltLSTM) which builds a layer-LSTM using all the layer outputs from a standard multi-layer time-LSTM. This layer-LSTM scans the outputs from time-LSTMs, and uses the summarized layer trajectory information for final senone classification. The forward-propagation of time-LSTM and layer-LSTM can be handled in two separate threads in parallel so that the network computation time is the same as the standard time-LSTM. With a layer-LSTM running through layers, a gated path is provided from the output layer to the bottom layer, alleviating the gradient vanishing issue. Trained with 30 thousand hours of EN-US Microsoft internal data, the proposed ltLSTM performed significantly better than the standard multi-layer LSTM and residual LSTM, with up to 9.0% relative word error rate reduction across different tasks.
Temporal Saliency Adaptation in Egocentric Videos
Venue: arXiv cs.CV 2018
Year: 2018

This work adapts a deep neural model for image saliency prediction to the temporal domain of egocentric video. We compute the saliency map for each video frame, firstly with an off-the-shelf model trained from static images, secondly by adding a a convolutional or conv-LSTM layers trained with a dataset for video saliency prediction. We study each configuration on EgoMon, a new dataset made of seven egocentric videos recorded by three subjects in both free-viewing and task-driven set ups. Our results indicate that the temporal adaptation is beneficial when the viewer is not moving and observing the scene from a narrow field of view. Encouraged by this observation, we compute and publish the saliency maps for the EPIC Kitchens dataset, in which viewers are cooking. Source code and models available at https://imatge-upc.github.io/saliency-2018-videosalgan/
Impact of News Organizations' Trustworthiness and Social Media Activity on Audience Engagement
Venue: arXiv cs.SI 2018
Year: 2018

News organizations are increasingly using social media to reach out to their audience aimed at raising their attention and engagement with news. Given the continuous decrease in subscription rates and audience trust in news media, it is imperative for news organizations to understand factors contributing to their relationships with the audience. Using Twitter data of 315 U.S. newspaper organizations and their audiences, this study uses multiple regression analysis to examine the influence of key news organization characteristics on audience engagement with news: (1) trustworthiness computed by the Trust Scores in Social Media (TSM) algorithm; (2) quantity of tweets; and (3) skillfulness of Twitter use. The results show significant influence of a news organizations' trustworthiness and level of Twitter activity on its audiences' news engagement. Methods to measure trustworthiness of news organizations and audience news engagement, as well as scalable algorithms to compute them from large-scale datasets, are also proposed.
Joint Doppler and Channel Estimation with Nested Arrays for Millimeter Wave Communications
Venue: arXiv cs.IT 2018
Year: 2018

Channel estimation is essential for precoding/combining in millimeter wave (mmWave) communications. However, accurate estimation is usually difficult because the receiver can only observe the low-dimensional projection of the received signals due to the hybrid architecture. We take the high speed scenario into consideration where the Doppler effect caused by fast-moving users can seriously deteriorate the channel estimation accuracy. In this paper, we propose to incorporate the nested array into analog array architecture by using RF switch networks with an objective of reducing the complexity and power consumption of the system. Based on the covariance fitting criterion, a joint Doppler and channel estimation method is proposed without need of discretizing the angle space, and thus the model mismatch effect can be totally eliminated. We also present an algorithmic implementation by solving the dual problem of the original one in order to reduce the computational complexity. Numerical simulations are provided to demonstrate the effectiveness and superiority of our proposed method.
An Operation Sequence Model for Explainable Neural Machine Translation
Venue: arXiv cs.CL 2018
Year: 2018

We propose to achieve explainable neural machine translation (NMT) by changing the output representation to explain itself. We present a novel approach to NMT which generates the target sentence by monotonically walking through the source sentence. Word reordering is modeled by operations which allow setting markers in the target sentence and move a target-side write head between those markers. In contrast to many modern neural models, our system emits explicit word alignment information which is often crucial to practical machine translation as it improves explainability. Our technique can outperform a plain text system in terms of BLEU score under the recent Transformer architecture on Japanese-English and Portuguese-English, and is within 0.5 BLEU difference on Spanish-English.
Camera-based Image Forgery Localization using Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

Camera fingerprints are precious tools for a number of image forensics tasks. A well-known example is the photo response non-uniformity (PRNU) noise pattern, a powerful device fingerprint. Here, to address the image forgery localization problem, we rely on noiseprint, a recently proposed CNN-based camera model fingerprint. The CNN is trained to minimize the distance between same-model patches, and maximize the distance otherwise. As a result, the noiseprint accounts for model-related artifacts just like the PRNU accounts for device-related non-uniformities. However, unlike the PRNU, it is only mildly affected by residuals of high-level scene content. The experiments show that the proposed noiseprint-based forgery localization method improves over the PRNU-based reference.
Notes on Deep Learning for NLP
Venue: arXiv cs.CL 2018
Year: 2018

My notes on Deep Learning for NLP.
Self-Attentive Sequential Recommendation
Venue: arXiv cs.IR 2018
Year: 2018

Sequential dynamics are a key feature of many modern recommender systems, which seek to capture the `context' of users' activities on the basis of actions they have performed recently. To capture such patterns, two approaches have proliferated: Markov Chains (MCs) and Recurrent Neural Networks (RNNs). Markov Chains assume that a user's next action can be predicted on the basis of just their last (or last few) actions, while RNNs in principle allow for longer-term semantics to be uncovered. Generally speaking, MC-based methods perform best in extremely sparse datasets, where model parsimony is critical, while RNNs perform better in denser datasets where higher model complexity is affordable. The goal of our work is to balance these two goals, by proposing a self-attention based sequential model (SASRec) that allows us to capture long-term semantics (like an RNN), but, using an attention mechanism, makes its predictions based on relatively few actions (like an MC). At each time step, SASRec seeks to identify which items are `relevant' from a user's action history, and use them to predict the next item. Extensive empirical studies show that our method outperforms various state-of-the-art sequential models (including MC/CNN/RNN-based approaches) on both sparse and dense datasets. Moreover, the model is an order of magnitude more efficient than comparable CNN/RNN-based models. Visualizations on attention weights also show how our model adaptively handles datasets with various density, and uncovers meaningful patterns in activity sequences.
Using Taste Groups for Collaborative Filtering
Venue: arXiv cs.IR 2018
Year: 2018

Implicit feedback is the simplest form of user feedback that can be used for item recommendation. It is easy to collect and domain independent. However, there is a lack of negative examples. Existing works circumvent this problem by making various assumptions regarding the unconsumed items, which fail to hold when the user did not consume an item because she was unaware of it. In this paper, we propose as a novel method for addressing the lack of negative examples in implicit feedback. The motivation is that if there is a large group of users who share the same taste and none of them consumed an item, then it is highly likely that the item is irrelevant to this taste. We use Hierarchical Latent Tree Analysis(HLTA) to identify taste-based user groups and make recommendations for a user based on her memberships in the groups.