OpenRaiser/Intern-Atlas huggingface dataset:
Like-for-like bibliometric substitutes for peer review: advantages and limits of indicators calculated from the ep index
Venue: arXiv cs.DL 2019
Year: 2019

The use of bibliometric indicators would simplify research assessments. The 2014 Research Excellence Framework (REF) is a peer review assessment of UK universities, whose results can be taken as benchmarks for bibliometric indicators. In this study we use the REF results to investigate whether the ep index and a top percentile of most cited papers could substitute for peer review. The probability that a random university's paper reaches a certain top percentile in the global distribution of papers is a power of the ep index, which can be calculated from the citation-based distribution of university's papers in global top percentiles. Making use of the ep index in each university and research area, we calculated the ratios between the percentage of 4-star-rated outputs in REF and the percentages of papers in global top percentiles. Then, we fixed the assessment percentile so that the mean ratio between these two indicators across universities is 1.0. This method was applied to four units of assessment in REF: Chemistry, Economics & Econometrics joined to Business & Management Studies, and Physics. Some relevant deviations from the 1.0 ratio could be explained by the evaluation procedure in REF or by the characteristics of the research field; other deviations need specific studies by experts in the research area. The present results indicate that in many research areas the substitution of a top percentile indicator for peer review is possible. However, this substitution cannot be made straightforwardly; more research is needed to establish the conditions of the bibliometric assessment.
Robust NFP generation for Nesting problems
Venue: arXiv cs.CG 2019
Year: 2019

Cutting and packing problems arise in a large variety of industrial applications, where there is a need to cut pieces from a large object, or placing them inside a containers, without overlap. When the pieces or the containers have irregular outline, the problem is classified as a Nesting problem. The geometrical challenges of the Nesting problem are addressed by focusing on the geometric aspect of the 2D pieces and containers involved. The challenges of the geometrical component are mainly derived from the complexity of the pieces, due to high number of vertices, which is common when dealing with real world scenarios. This complexity is challenging for current algorithms to process efficiently and effectively, leading to high computational cost and less satisfactory results, particularly when dealing with overlap verification operations. Usually, when tackling Nesting problems, the overlap verification process between two objects is done through the use of a structure known as No-Fit-Polygon (NFP). In this work, the generation of the NFP is achieved through a simple algorithm which produces a simplified shape while reducing numerical precision errors and fully representing the region that forms the NFP including positions with perfect fits.
Efficient Trajectory Generation for Robotic Systems Constrained by Contact Forces
Venue: arXiv cs.RO 2019
Year: 2019

In this work, we propose a trajectory generation method for robotic systems with contact force constraint based on optimal control and reachability analysis. Normally, the dynamics and constraints of the contact-constrained robot are nonlinear and coupled to each other. Instead of linearizing the model and constraints, we directly solve the optimal control problem to obtain the feasible state trajectory and the control input of the system. A tractable optimal control problem is formulated which is addressed by dual approaches, which are sampling-based dynamic programming and rigorous reachability analysis. The sampling-based method and Partially Observable Markov Decision Process (POMDP) are used to break down the end-to-end trajectory generation problem via sample-wise optimization in terms of given conditions. The result generates sequential pairs of subregions to be passed to reach the final goal. The reachability analysis ensures that we will find at least one trajectory starting from a given initial state and going through a sequence of subregions. The distinctive contributions of our method are to enable handling the intricate contact constraint coupled with system's dynamics due to the reduction of computational complexity of the algorithm. We validate our method using extensive numerical simulations with a legged robot.
Differential Privacy of Aggregated DC Optimal Power Flow Data
Venue: arXiv cs.CR 2019
Year: 2019

We consider the problem of privately releasing aggregated network statistics obtained from solving a DC optimal power flow (OPF) problem. It is shown that the mechanism that determines the noise distribution parameters are linked to the topology of the power system and the monotonicity of the network. We derive a measure of "almost" monotonicity and show how it can be used in conjunction with a linear program in order to release aggregated OPF data using the differential privacy framework.
Auto-Embedding Generative Adversarial Networks for High Resolution Image Synthesis
Venue: arXiv cs.CV 2019
Year: 2019

Generating images via the generative adversarial network (GAN) has attracted much attention recently. However, most of the existing GAN-based methods can only produce low-resolution images of limited quality. Directly generating high-resolution images using GANs is nontrivial, and often produces problematic images with incomplete objects. To address this issue, we develop a novel GAN called Auto-Embedding Generative Adversarial Network (AEGAN), which simultaneously encodes the global structure features and captures the fine-grained details. In our network, we use an autoencoder to learn the intrinsic high-level structure of real images and design a novel denoiser network to provide photo-realistic details for the generated images. In the experiments, we are able to produce 512x512 images of promising quality directly from the input noise. The resultant images exhibit better perceptual photo-realism, i.e., with sharper structure and richer details, than other baselines on several datasets, including Oxford-102 Flowers, Caltech-UCSD Birds (CUB), High-Quality Large-scale CelebFaces Attributes (CelebA-HQ), Large-scale Scene Understanding (LSUN) and ImageNet.
Graded Relevance Assessments and Graded Relevance Measures of NTCIR: A Survey of the First Twenty Years
Venue: arXiv cs.IR 2019
Year: 2019

NTCIR was the first large-scale IR evaluation conference to construct test collections with graded relevance assessments: the NTCIR-1 test collections from 1998 already featured relevant and partially relevant documents. In this paper, I first describe a few graded-relevance measures that originated from NTCIR (and a few variants) which are used across different NTCIR tasks. I then provide a survey on the use of graded relevance assessments and of graded relevance measures in the past NTCIR tasks which primarily tackled ranked retrieval. My survey shows that the majority of the past tasks fully utilised graded relevance by means of graded evaluation measures, but not all of them; interestingly, even a few relatively recent tasks chose to adhere to binary relevance measures. I conclude this paper by a summary of my survey in table form, and a brief discussion on what may lie beyond graded relevance.
Scalable Deep Learning on Distributed Infrastructures: Challenges, Techniques and Tools
Venue: arXiv cs.DC 2019
Year: 2019

Deep Learning (DL) has had an immense success in the recent past, leading to state-of-the-art results in various domains such as image recognition and natural language processing. One of the reasons for this success is the increasing size of DL models and the proliferation of vast amounts of training data being available. To keep on improving the performance of DL, increasing the scalability of DL systems is necessary. In this survey, we perform a broad and thorough investigation on challenges, techniques and tools for scalable DL on distributed infrastructures. This incorporates infrastructures for DL, methods for parallel DL training, multi-tenant resource scheduling and the management of training and model data. Further, we analyze and compare 11 current open-source DL frameworks and tools and investigate which of the techniques are commonly implemented in practice. Finally, we highlight future research trends in DL systems that deserve further research.
Hierarchical Attention Generative Adversarial Networks for Cross-domain Sentiment Classification
Venue: arXiv cs.LG 2019
Year: 2019

Cross-domain sentiment classification (CDSC) is an importance task in domain adaptation and sentiment classification. Due to the domain discrepancy, a sentiment classifier trained on source domain data may not works well on target domain data. In recent years, many researchers have used deep neural network models for cross-domain sentiment classification task, many of which use Gradient Reversal Layer (GRL) to design an adversarial network structure to train a domain-shared sentiment classifier. Different from those methods, we proposed Hierarchical Attention Generative Adversarial Networks (HAGAN) which alternately trains a generator and a discriminator in order to produce a document representation which is sentiment-distinguishable but domain-indistinguishable. Besides, the HAGAN model applies Bidirectional Gated Recurrent Unit (Bi-GRU) to encode the contextual information of a word and a sentence into the document representation. In addition, the HAGAN model use hierarchical attention mechanism to optimize the document representation and automatically capture the pivots and non-pivots. The experiments on Amazon review dataset show the effectiveness of HAGAN.
Chance-Constrained AC Optimal Power Flow -- A Polynomial Chaos Approach
Venue: arXiv cs.SY 2019
Year: 2019

As the share of renewables in the grid increases, the operation of power systems becomes more challenging. The present paper proposes a method to formulate and solve chance-constrained optimal power flow while explicitly considering the full nonlinear AC power flow equations and stochastic uncertainties. We use polynomial chaos expansion to model the effects of arbitrary uncertainties of finite variance, which enables to predict and optimize the system state for a range of operating conditions. We apply chance constraints to limit the probability of violations of inequality constraints. Our method incorporates a more detailed and a more flexible description of both the controllable variables and the resulting system state than previous methods. Two case studies highlight the efficacy of the method, with a focus on satisfaction of the AC power flow equations and on the accurate computation of moments of all random variables.
Learning semantic sentence representations from visually grounded language without lexical knowledge
Venue: arXiv cs.CL 2019
Year: 2019

Current approaches to learning semantic representations of sentences often use prior word-level knowledge. The current study aims to leverage visual information in order to capture sentence level semantics without the need for word embeddings. We use a multimodal sentence encoder trained on a corpus of images with matching text captions to produce visually grounded sentence embeddings. Deep Neural Networks are trained to map the two modalities to a common embedding space such that for an image the corresponding caption can be retrieved and vice versa. We show that our model achieves results comparable to the current state-of-the-art on two popular image-caption retrieval benchmark data sets: MSCOCO and Flickr8k. We evaluate the semantic content of the resulting sentence embeddings using the data from the Semantic Textual Similarity benchmark task and show that the multimodal embeddings correlate well with human semantic similarity judgements. The system achieves state-of-the-art results on several of these benchmarks, which shows that a system trained solely on multimodal data, without assuming any word representations, is able to capture sentence level semantics. Importantly, this result shows that we do not need prior knowledge of lexical level semantics in order to model sentence level semantics. These findings demonstrate the importance of visual information in semantics.
From the Hands of an Early Adopter's Avatar to Virtual Junkyards: Analysis of Virtual Goods' Lifetime Survival
Venue: arXiv cs.SI 2019
Year: 2019

One of the major questions in the study of economics, logistics, and business forecasting is the measurement and prediction of value creation, distribution, and lifetime in the form of goods. In "real" economies, a perfect model for the circulation of goods is impossible. However, virtual realities and economies pose a new frontier for the broad study of economics, since every good and transaction can be accurately tracked. Therefore, models that predict goods' circulation can be tested and confirmed before their introduction to "real life" and other scenarios. The present study is focused on the characteristics of early-stage adopters for virtual goods, and how they predict the lifespan of the goods. We employ machine learning and decision trees as the basis of our prediction models. Results provide evidence that the prediction of the lifespan of virtual objects is possible based just on data from early holders of those objects. Overall, communication and social activity are the main drivers for the effective propagation of virtual goods, and they are the most expected characteristics of early adopters.
Non-Iterative Subspace-Based DOA Estimation in the Presence of Nonuniform Noise
Venue: arXiv cs.IT 2019
Year: 2019

The uniform white noise assumption is one of the basic assumptions in most of the existing directional-of-arrival (DOA) estimation methods. In many applications, however, the non-uniform white noise model is more adequate. Then the noise variances at different sensors have to be also estimated as nuisance parameters while estimating DOAs. In this letter, different from the existing iterative methods that address the problem of non-uniform noise, a non-iterative two-phase subspace-based DOA estimation method is proposed. The first phase of the method is based on estimating the noise subspace via eigendecomposition (ED) of some properly designed matrix and it avoids estimating the noise covariance matrix. In the second phase, the results achieved in the first phase are used to estimate the noise covariance matrix, followed by estimating the noise subspace via generalized ED. Since the proposed method estimates DOAs in a non-iterative manner, it is computationally more efficient and has no convergence issues as compared to the existing methods. Simulation results demonstrate better performance of the proposed method as compared to other existing state-of-the-art methods.
Fleetwide data-enabled reliability improvement of wind turbines
Venue: arXiv cs.SY 2019
Year: 2019

Wind farms are an indispensable driver toward renewable and nonpolluting energy resources. However, as ideal sites are limited, placement in remote and challenging locations results in higher logistics costs and lower average wind speeds. Therefore, it is critical to increase the reliability of the turbines to reduce maintenance costs. Robust implementation requires a thorough understanding of the loads subject to the turbine's control. Yet, such dynamically changing multidimensional loads are uncommon with other machinery, and generally underresearched. Therefore, a multitiered approach is proposed to investigate the load spectrum occurring in wind farms. Our approach relies on both fundamental research using controllable test rigs, as well as analyses of real-world loading conditions in high-frequency supervisory control and data acquisition data. A method is introduced to detect operational zones in wind farm data and link them with load distributions. Additionally, while focused research further investigates the load spectrum, a method is proposed that continuously optimizes the farm's control protocols without the need to fully understand the loads that occur. A case of gearbox failure is investigated based on a vast body of past experiments and suspect loads are identified. Starting from this evidence on the cause and effects of dynamic loads, the potential of our methods is shown by analyzing real-world farm loading conditions on a steady-state case of wake and developing a preventive row-based control protocol for a case of cascading emergency brakes induced by a storm.
Yet Another Tensor Toolbox for discontinuous Galerkin methods and other applications
Venue: arXiv cs.MS 2019
Year: 2019

The numerical solution of partial differential equations is at the heart of many grand challenges in supercomputing. Solvers based on high-order discontinuous Galerkin (DG) discretisation have been shown to scale on large supercomputers with excellent performance and efficiency, if the implementation exploits all levels of parallelism and is tailored to the specific architecture. However, every year new supercomputers emerge and the list of hardware-specific considerations grows, simultaneously with the list of desired features in a DG code. Thus we believe that a sustainable DG code needs an abstraction layer to implement the numerical scheme in a suitable language. We explore the possibility to abstract the numerical scheme as small tensor operations, describe them in a domain-specific language (DSL) resembling the Einstein notation, and to map them to existing code generators which generate small matrix matrix multiplication routines. The compiler for our DSL implements classic optimisations that are used for large tensor contractions, and we present novel optimisation techniques such as equivalent sparsity patterns and optimal index permutations for temporary tensors. Our application examples, which include the earthquake simulation software SeisSol, show that the generated kernels achieve over 50 % peak performance while the DSL considerably simplifies the implementation.
Laplace Landmark Localization
Venue: arXiv cs.CV 2019
Year: 2019

Landmark localization in images and videos is a classic problem solved in various ways. Nowadays, with deep networks prevailing throughout machine learning, there are revamped interests in pushing facial landmark detection technologies to handle more challenging data. Most efforts use network objectives based on L1 or L2 norms, which have several disadvantages. First of all, the locations of landmarks are determined from generated heatmaps (i.e., confidence maps) from which predicted landmark locations (i.e., the means) get penalized without accounting for the spread: a high scatter corresponds to low confidence and vice-versa. For this, we introduce a LaplaceKL objective that penalizes for a low confidence. Another issue is a dependency on labeled data, which are expensive to obtain and susceptible to error. To address both issues we propose an adversarial training framework that leverages unlabeled data to improve model performance. Our method claims state-of-the-art on all of the 300W benchmarks and ranks second-to-best on the Annotated Facial Landmarks in the Wild (AFLW) dataset. Furthermore, our model is robust with a reduced size: 1/8 the number of channels (i.e., 0.0398MB) is comparable to state-of-that-art in real-time on CPU. Thus, we show that our method is of high practical value to real-life application.
Lens-based Millimeter Wave Reconfigurable Antenna NOMA
Venue: arXiv cs.IT 2019
Year: 2019

This paper proposes a new multiple access technique based on the millimeter wave lens-based reconfigurable antenna systems. In particular, to support a large number of groups of users with different angles of departures (AoDs), we integrate recently proposed reconfigurable antenna multiple access (RAMA) into non-orthogonal multiple access (NOMA). The proposed technique, named reconfigurable antenna NOMA (RA-NOMA), divides the users with respect to their AoDs and channel gains. Users with different AoDs and comparable channel gains are served via RAMA while users with the same AoDs but different channel gains are served via NOMA. This technique results in the independence of the number of radio frequency chains from the number of NOMA groups. Further, we derive the feasibility conditions and show that the power allocation for RA-NOMA is a convex problem. We then derive the maximum achievable sum-rate of RA-NOMA. Simulation results show that RA-NOMA outperforms conventional orthogonal multiple access (OMA) as well as the combination of RAMA with the OMA techniques.
Adversarial Deep Learning in EEG Biometrics
Venue: arXiv cs.LG 2019
Year: 2019

Deep learning methods for person identification based on electroencephalographic (EEG) brain activity encounters the problem of exploiting the temporally correlated structures or recording session specific variability within EEG. Furthermore, recent methods have mostly trained and evaluated based on single session EEG data. We address this problem from an invariant representation learning perspective. We propose an adversarial inference approach to extend such deep learning models to learn session-invariant person-discriminative representations that can provide robustness in terms of longitudinal usability. Using adversarial learning within a deep convolutional network, we empirically assess and show improvements with our approach based on longitudinally collected EEG data for person identification from half-second EEG epochs.
InfoMask: Masked Variational Latent Representation to Localize Chest Disease
Venue: arXiv cs.CV 2019
Year: 2019

The scarcity of richly annotated medical images is limiting supervised deep learning based solutions to medical image analysis tasks, such as localizing discriminatory radiomic disease signatures. Therefore, it is desirable to leverage unsupervised and weakly supervised models. Most recent weakly supervised localization methods apply attention maps or region proposals in a multiple instance learning formulation. While attention maps can be noisy, leading to erroneously highlighted regions, it is not simple to decide on an optimal window/bag size for multiple instance learning approaches. In this paper, we propose a learned spatial masking mechanism to filter out irrelevant background signals from attention maps. The proposed method minimizes mutual information between a masked variational representation and the input while maximizing the information between the masked representation and class labels. This results in more accurate localization of discriminatory regions. We tested the proposed model on the ChestX-ray8 dataset to localize pneumonia from chest X-ray images without using any pixel-level or bounding-box annotations.
When an attacker meets a cipher-image in 2018: A Year in Review
Venue: arXiv cs.CR 2019
Year: 2019

This paper aims to review the encountered technical contradictions when an attacker meets the cipher-images encrypted by the image encryption schemes (algorithms) proposed in 2018 from the viewpoint of an image cryptanalyst. The most representative works among them are selected and classified according to their essential structures. Almost all image cryptanalysis works published in 2018 are surveyed due to their small number. The challenging problems on design and analysis of image encryption schemes are summarized to receive the attentions of both designers and attackers (cryptanalysts) of image encryption schemes, which may promote solving scenario-oriented image security problems with new technologies.