OpenRaiser/Intern-Atlas huggingface dataset:
High Quality Prediction of Protein Q8 Secondary Structure by Diverse Neural Network Architectures
Venue: arXiv cs.LG 2018
Year: 2018

We tackle the problem of protein secondary structure prediction using a common task framework. This lead to the introduction of multiple ideas for neural architectures based on state of the art building blocks, used in this task for the first time. We take a principled machine learning approach, which provides genuine, unbiased performance measures, correcting longstanding errors in the application domain. We focus on the Q8 resolution of secondary structure, an active area for continuously improving methods. We use an ensemble of strong predictors to achieve accuracy of 70.7% (on the CB513 test set using the CB6133filtered training set). These results are statistically indistinguishable from those of the top existing predictors. In the spirit of reproducible research we make our data, models and code available, aiming to set a gold standard for purity of training and testing sets. Such good practices lower entry barriers to this domain and facilitate reproducible, extendable research.
What Propels Celebrity Follower Counts? Language Use or Social Connectivity
Venue: arXiv cs.SI 2018
Year: 2018

Follower count is a factor that quantifies the popularity of celebrities. It is a reflection of their power, prestige and overall social reach. In this paper we investigate whether the social connectivity or the language choice is more correlated to the future follower count of a celebrity. We collect data about tweets, retweets and mentions of 471 Indian celebrities with verified Twitter accounts. We build two novel networks to approximate social connectivity of the celebrities. We study various structural properties of these two networks and observe their correlations with future follower counts. In parallel, we analyze the linguistic structure of the tweets (LIWC features, syntax and sentiment features and style and readability features) and observe the correlations of each of these with the future follower count of a celebrity. As a final step we use there features to classify a celebrity in a specific bucket of future follower count (HIGH, MID or LOW). We observe that the network features alone achieve an accuracy of 0.52 while the linguistic features alone achieve an accuracy of 0.69 grossly outperforming the network features. The network and linguistic features in conjunction produce an accuracy of 0.76. We also discuss some final insights that we obtain from further data analysis celebrities with larger follower counts post tweets that have (i) more words from friend and family LIWC categories, (ii) more positive sentiment laden words, (iii) have better language constructs and are (iv) more readable.
Classifiers Based on Deep Sparse Coding Architectures are Robust to Deep Learning Transferable Examples
Venue: arXiv cs.LG 2018
Year: 2018

Although deep learning has shown great success in recent years, researchers have discovered a critical flaw where small, imperceptible changes in the input to the system can drastically change the output classification. These attacks are exploitable in nearly all of the existing deep learning classification frameworks. However, the susceptibility of deep sparse coding models to adversarial examples has not been examined. Here, we show that classifiers based on a deep sparse coding model whose classification accuracy is competitive with a variety of deep neural network models are robust to adversarial examples that effectively fool those same deep learning models. We demonstrate both quantitatively and qualitatively that the robustness of deep sparse coding models to adversarial examples arises from two key properties. First, because deep sparse coding models learn general features corresponding to generators of the dataset as a whole, rather than highly discriminative features for distinguishing specific classes, the resulting classifiers are less dependent on idiosyncratic features that might be more easily exploited. Second, because deep sparse coding models utilize fixed point attractor dynamics with top-down feedback, it is more difficult to find small changes to the input that drive the resulting representations out of the correct attractor basin.
DeepConsensus: using the consensus of features from multiple layers to attain robust image classification
Venue: arXiv cs.CV 2018
Year: 2018

We consider a classifier whose test set is exposed to various perturbations that are not present in the training set. These test samples still contain enough features to map them to the same class as their unperturbed counterpart. Current architectures exhibit rapid degradation of accuracy when trained on standard datasets but then used to classify perturbed samples of that data. To address this, we present a novel architecture named DeepConsensus that significantly improves generalization to these test-time perturbations. Our key insight is that deep neural networks should directly consider summaries of low and high level features when making classifications. Existing convolutional neural networks can be augmented with DeepConsensus, leading to improved resistance against large and small perturbations on MNIST, EMNIST, FashionMNIST, CIFAR10 and SVHN datasets.
On Matching Faces with Alterations due to Plastic Surgery and Disguise
Venue: arXiv cs.CV 2018
Year: 2018

Plastic surgery and disguise variations are two of the most challenging co-variates of face recognition. The state-of-art deep learning models are not sufficiently successful due to the availability of limited training samples. In this paper, a novel framework is proposed which transfers fundamental visual features learnt from a generic image dataset to supplement a supervised face recognition model. The proposed algorithm combines off-the-shelf supervised classifier and a generic, task independent network which encodes information related to basic visual cues such as color, shape, and texture. Experiments are performed on IIITD plastic surgery face dataset and Disguised Faces in the Wild (DFW) dataset. Results showcase that the proposed algorithm achieves state of the art results on both the datasets. Specifically on the DFW database, the proposed algorithm yields over 87% verification accuracy at 1% false accept rate which is 53.8% better than baseline results computed using VGGFace.
Proximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes
Venue: arXiv cs.IR 2018
Year: 2018

Full-text search engines are important tools for information retrieval. Term proximity is an important factor in relevance score measurement. In a proximity full-text search, we assume that a relevant document contains query terms near each other, especially if the query terms are frequently occurring words. A methodology for high-performance full-text query execution is discussed. We build additional indexes to achieve better efficiency. For a word that occurs in the text, we include in the indexes some information about nearby words. What types of additional indexes do we use? How do we use them? These questions are discussed in this work. We present the results of experiments showing that the average time of search query execution is 44-45 times less than that required when using ordinary inverted indexes. This is a pre-print of a contribution "Veretennikov A.B. Proximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes" published in "Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and Applications. IntelliSys 2018. Advances in Intelligent Systems and Computing, vol 868" published by Springer, Cham. The final authenticated version is available online at: https://doi.org/10.1007/978-3-030-01054-6_66. The work was supported by Act 211 Government of the Russian Federation, contract no 02.A03.21.0006.
slimIoT: Scalable Lightweight Attestation Protocol For the Internet of Things
Venue: arXiv cs.CR 2018
Year: 2018

The Internet of Things (IoT) is increasingly intertwined with critical industrial processes, yet contemporary IoT devices offer limited security features, creating a large new attack surface. Remote attestation is a well-known technique to detect cyber threats by remotely verifying the internal state of a networked embedded device through a trusted entity. Multi-device attestation has received little attention although current single-device approaches show limited scalability in IoT applications. Though recent work has yielded some proposals for scalable attestation, several aspects remain unexplored, and thus more research is required. This paper presents slimIoT, a scalable lightweight attestation protocol that is suitable for all IoT devices. slimIoT depends on an efficient broadcast authentication scheme along with symmetric key cryptography. It is resilient against a strong adversary with physical access to the IoT device. Our protocol is informative in the sense that it identifies the precise status of every device in the network. We implement and evaluate slimIoT considering many factors. On the one hand, our evaluation results show a low overhead in terms of memory footprint and runtime. On the other hand, simulations demonstrate that slimIoT is scalable, robust and highly efficient to be used in static and dynamic networks consisting of thousands of heterogenous IoT devices.
A Study on 3D Surface Graph Representations
Venue: arXiv cs.GR 2018
Year: 2018

Surface graphs have been used in many application domains to represent three-dimensional (3D) data. Another approach to representing 3D data is making projections onto two-dimensional (2D) graphs. This approach will result in multiple displays, which is time-consuming in switching between different screens for a different perspective. In this work, we study the performance of 3D version of popular 2D visualization techniques for time series: horizon graph, small multiple, and simple line graph. We explore discrimination tasks with respect to each visualization technique that requires simultaneous representations. We demonstrate our study by visualizing saturated thickness of the Ogallala aquifer - the Southern High Plains Aquifer of Texas in multiple years. For the evaluation, we design comparison and discrimination tasks and automatically record result performed by a group of students at a university. Our results show that 3D small multiples perform well with stable accuracy over numbers of occurrences. On the other hand, shared-space visualization within a single 3D coordinate system is more efficient with small number of simultaneous graphs. 3D horizon graph loses its competence in the 3D coordinate system with the lowest accuracy comparing to other techniques. Our demonstration of 3D spatial-temporal is also presented on the Southern High Plains Aquifer of Texas from 2010 to 2016.
Harmonic Recomposition using Conditional Autoregressive Modeling
Venue: arXiv cs.SD 2018
Year: 2018

We demonstrate a conditional autoregressive pipeline for efficient music recomposition, based on methods presented in van den Oord et al.(2017). Recomposition (Casal & Casey, 2010) focuses on reworking existing musical pieces, adhering to structure at a high level while also re-imagining other aspects of the work. This can involve reuse of pre-existing themes or parts of the original piece, while also requiring the flexibility to generate new content at different levels of granularity. Applying the aforementioned modeling pipeline to recomposition, we show diverse and structured generation conditioned on chord sequence annotations.
Pixel-Anchor: A Fast Oriented Scene Text Detector with Combined Networks
Venue: arXiv cs.CV 2018
Year: 2018

Recently, semantic segmentation and general object detection frameworks have been widely adopted by scene text detecting tasks. However, both of them alone have obvious shortcomings in practice. In this paper, we propose a novel end-to-end trainable deep neural network framework, named Pixel-Anchor, which combines semantic segmentation and SSD in one network by feature sharing and anchor-level attention mechanism to detect oriented scene text. To deal with scene text which has large variances in size and aspect ratio, we combine FPN and ASPP operation as our encoder-decoder structure in the semantic segmentation part, and propose a novel Adaptive Predictor Layer in the SSD. Pixel-Anchor detects scene text in a single network forward pass, no complex post-processing other than an efficient fusion Non-Maximum Suppression is involved. We have benchmarked the proposed Pixel-Anchor on the public datasets. Pixel-Anchor outperforms the competing methods in terms of text localization accuracy and run speed, more specifically, on the ICDAR 2015 dataset, the proposed algorithm achieves an F-score of 0.8768 at 10 FPS for 960 x 1728 resolution images.
On buildings that compute. A proposal
Venue: arXiv cs.ET 2018
Year: 2018

We present ideas aimed at bringing revolutionary changes on architectures and buildings of tomorrow by radically advancing the technology for the building material concrete and hence building components. We propose that by using nanotechnology we could embed computation and sensing directly into the material used for construction. Intelligent concrete blocks and panels advanced with stimuli-responsive smart paints are the core of the proposed architecture. In particular, the photo-responsive paint would sense the buildings internal and external environment while the nano-material-concrete composite material would be capable of sensing the building environment and implement massive-parallel information processing resulting in distributed decision making. A calibration of the proposed materials with in-materio suitable computational methods and corresponding building information modelling, computer-aided design and digital manufacturing tools could be achieved via models and prototypes of information processing at nano-level. The emergent technology sees a building as high-level massive-parallel computer --- assembled of computing concrete blocks. Based on the generic principles of neuromorphic computation and reservoir computing we envisage a single building or an urban quarter to turn into a large-scale sensing substrate. It could behave as a universal computer, collecting and processing environmental information in situ enabling appropriate data fusion.
Predictive and Semantic Layout Estimation for Robotic Applications in Manhattan Worlds
Venue: arXiv cs.CV 2018
Year: 2018

This paper describes an approach to automatically extracting floor plans from the kinds of incomplete measurements that could be acquired by an autonomous mobile robot. The approach proceeds by reasoning about extended structural layout surfaces which are automatically extracted from the available data. The scheme can be run in an online manner to build water tight representations of the environment. The system effectively speculates about room boundaries and free space regions which provides useful guidance to subsequent motion planning systems. Experimental results are presented on multiple data sets.
On Geometric Alignment in Low Doubling Dimension
Venue: arXiv cs.LG 2018
Year: 2018

In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns, especially in the field of computer vision. Recently, the alignment of geometric patterns in high dimension finds several novel applications, and has attracted more and more attentions. However, the research is still rather limited in terms of algorithms. To the best of our knowledge, most existing approaches for high dimensional alignment are just simple extensions of their counterparts for 2D and 3D cases, and often suffer from the issues such as high complexities. In this paper, we propose an effective framework to compress the high dimensional geometric patterns and approximately preserve the alignment quality. As a consequence, existing alignment approach can be applied to the compressed geometric patterns and thus the time complexity is significantly reduced. Our idea is inspired by the observation that high dimensional data often has a low intrinsic dimension. We adopt the widely used notion "doubling dimension" to measure the extents of our compression and the resulting approximation. Finally, we test our method on both random and real datasets, the experimental results reveal that running the alignment algorithm on compressed patterns can achieve similar qualities, comparing with the results on the original patterns, but the running times (including the times cost for compression) are substantially lower.
Segregated Temporal Assembly Recurrent Networks for Weakly Supervised Multiple Action Detection
Venue: arXiv cs.CV 2018
Year: 2018

This paper proposes a segregated temporal assembly recurrent (STAR) network for weakly-supervised multiple action detection. The model learns from untrimmed videos with only supervision of video-level labels and makes prediction of intervals of multiple actions. Specifically, we first assemble video clips according to class labels by an attention mechanism that learns class-variable attention weights and thus helps the noise relieving from background or other actions. Secondly, we build temporal relationship between actions by feeding the assembled features into an enhanced recurrent neural network. Finally, we transform the output of recurrent neural network into the corresponding action distribution. In order to generate more precise temporal proposals, we design a score term called segregated temporal gradient-weighted class activation mapping (ST-GradCAM) fused with attention weights. Experiments on THUMOS'14 and ActivityNet1.3 datasets show that our approach outperforms the state-of-the-art weakly-supervised method, and performs at par with the fully-supervised counterparts.
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint
Venue: arXiv cs.DS 2018
Year: 2018

We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important matroids. We develop a new algorithm for a \emph{general matroid constraint} with a $1 - 1/e - ε$ approximation that achieves a fast running time provided we have a fast data structure for maintaining a maximum weight base in the matroid through a sequence of decrease weight operations. We construct such data structures for graphic matroids and partition matroids, and we obtain the \emph{first algorithms} for these classes of matroids that achieve a nearly-optimal, $1 - 1/e - ε$ approximation, using a nearly-linear number of function evaluations and arithmetic operations.
Visual-Texual Emotion Analysis with Deep Coupled Video and Danmu Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

User emotion analysis toward videos is to automatically recognize the general emotional status of viewers from the multimedia content embedded in the online video stream. Existing works fall in two categories: 1) visual-based methods, which focus on visual content and extract a specific set of features of videos. However, it is generally hard to learn a mapping function from low-level video pixels to high-level emotion space due to great intra-class variance. 2) textual-based methods, which focus on the investigation of user-generated comments associated with videos. The learned word representations by traditional linguistic approaches typically lack emotion information and the global comments usually reflect viewers' high-level understandings rather than instantaneous emotions. To address these limitations, in this paper, we propose to jointly utilize video content and user-generated texts simultaneously for emotion analysis. In particular, we introduce exploiting a new type of user-generated texts, i.e., "danmu", which are real-time comments floating on the video and contain rich information to convey viewers' emotional opinions. To enhance the emotion discriminativeness of words in textual feature extraction, we propose Emotional Word Embedding (EWE) to learn text representations by jointly considering their semantics and emotions. Afterwards, we propose a novel visual-textual emotion analysis model with Deep Coupled Video and Danmu Neural networks (DCVDN), in which visual and textual features are synchronously extracted and fused to form a comprehensive representation by deep-canonically-correlated-autoencoder-based multi-view learning. Through extensive experiments on a self-crawled real-world video-danmu dataset, we prove that DCVDN significantly outperforms the state-of-the-art baselines.
DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm
Venue: arXiv cs.CR 2018
Year: 2018

A blockchain system is a replicated state machine that must be fault tolerant. When designing a blockchain system, there is usually a trade-off between decentralization, scalability, and security. In this paper, we propose a novel blockchain system, DEXON, which achieves high scalability while remaining decentralized and robust in the real-world environment. We have two main contributions. First, we present a highly scalable sharding framework for blockchain. This framework takes an arbitrary number of single chains and transforms them into the \textit{blocklattice} data structure, enabling \textit{high scalability} and \textit{low transaction confirmation latency} with asymptotically optimal communication overhead. Second, we propose a single-chain protocol based on our novel verifiable random function and a new Byzantine agreement that achieves high decentralization and low latency.
Contributors profile modelization in crowdsourcing platforms
Venue: arXiv cs.AI 2018
Year: 2018

The crowdsourcing consists in the externalisation of tasks to a crowd of people remunerated to execute this ones. The crowd, usually diversified, can include users without qualification and/or motivation for the tasks. In this paper we will introduce a new method of user expertise modelization in the crowdsourcing platforms based on the theory of belief functions in order to identify serious and qualificated users.
Switch-based Active Deep Dyna-Q: Efficient Adaptive Planning for Task-Completion Dialogue Policy Learning
Venue: arXiv cs.CL 2018
Year: 2018

Training task-completion dialogue agents with reinforcement learning usually requires a large number of real user experiences. The Dyna-Q algorithm extends Q-learning by integrating a world model, and thus can effectively boost training efficiency using simulated experiences generated by the world model. The effectiveness of Dyna-Q, however, depends on the quality of the world model - or implicitly, the pre-specified ratio of real vs. simulated experiences used for Q-learning. To this end, we extend the recently proposed Deep Dyna-Q (DDQ) framework by integrating a switcher that automatically determines whether to use a real or simulated experience for Q-learning. Furthermore, we explore the use of active learning for improving sample efficiency, by encouraging the world model to generate simulated experiences in the state-action space where the agent has not (fully) explored. Our results show that by combining switcher and active learning, the new framework named as Switch-based Active Deep Dyna-Q (Switch-DDQ), leads to significant improvement over DDQ and Q-learning baselines in both simulation and human evaluations.