OpenRaiser/Intern-Atlas huggingface dataset:
Algorithms for an Efficient Tensor Biclustering
Venue: arXiv cs.LG 2019
Year: 2019

Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and a subset of features whose signal trajectories over time lie in a low-dimensional subspace, modeling similarity among the signal trajectories while allowing different scalings across different individuals or different features. This approach are based on spectral decomposition in order to build the desired biclusters. We evaluate the quality of the results from each algorithms with both synthetic and real data set.
Demand Prediction for Electric Vehicle Sharing
Venue: arXiv cs.AI 2019
Year: 2019

Electric Vehicle (EV) sharing systems have recently experienced unprecedented growth across the globe. Many car sharing service providers as well as automobile manufacturers are entering this competition by expanding both their EV fleets and renting/returning station networks, aiming to seize a share of the market and bring car sharing to the zero emissions level. During their fast expansion, one fundamental determinant for success is the capability of dynamically predicting the demand of stations. In this paper we propose a novel demand prediction approach, which is able to model the dynamics of the system and predict demand accordingly. We use a local temporal encoding process to handle the available historical data at individual stations, and a spatial encoding process to take correlations between stations into account with graph convolutional neural networks. The encoded features are fed to a prediction network, which forecasts both the long-term expected demand of the stations. We evaluate the proposed approach on real-world data collected from a major EV sharing platform. Experimental results demonstrate that our approach significantly outperforms the state of the art.
Stackelberg Independence
Venue: arXiv cs.GT 2019
Year: 2019

The standard model of sequential capacity choices is the Stackelberg quantity leadership model with linear demand. I show that under the standard assumptions, leaders' actions are informative about market conditions and independent of leaders' beliefs about the arrivals of followers. However, this Stackelberg independence property relies on all standard assumptions being satisfied. It fails to hold whenever the demand function is non-linear, marginal cost is not constant, goods are differentiated, firms are non-identical, or there are any externalities. I show that small deviations from the linear demand assumption may make the leaders' choices completely uninformative.
Nature of System Calls in CPU-centric Computing Paradigm
Venue: arXiv cs.OS 2019
Year: 2019

Modern operating systems are typically POSIX-compliant with major system calls specified decades ago. The next generation of non-volatile memory (NVM) technologies raise concerns about the efficiency of the traditional POSIX-based systems. As one step toward building high performance NVM systems, we explore the potential dependencies between system call performance and major hardware components (e.g., CPU, memory, storage) under typical user cases (e.g., software compilation, installation, web browser, office suite) in this paper. We build histograms for the most frequent and time-consuming system calls with the goal to understand the nature of distribution on different platforms. We find that there is a strong dependency between the system call performance and the CPU architecture. On the other hand, the type of persistent storage plays a less important role in affecting the performance.
Sidechains and interoperability
Venue: arXiv cs.CR 2019
Year: 2019

There appears to be an insatiable desire for spawning new bespoke blockchains to harness the functionality provided by blockchain technologies, resulting in a constant stream of blockchain start-up companies entering the market with their own unique vision and mission. Some target a particular niche market such as supply chain and financial services, while others strive to differentiate themselves from the increasingly saturated market by offering new functionality. This dynamic and constantly changing blockchain ecosystem makes it very challenging to keep abreast of all the latest breakthroughs and research. It is evident that there is also a growing desire to collaborate with others developing blockchain solutions, which brings new impetus to blockchain interoperability research. We review the strategies that some key players in the blockchain ecosystem have implemented, or are proposing to develop, to satisfy this increasing demand for cross-chain communication and transactions between sidechains. Interoperability presents a complex and challenging stumbling block to the wider uptake of blockchain technology. We find that although there is a plethora of blockchains and interoperability implementations, or proposals, at a higher level of abstraction there is only a handful of approaches. However, the way they are implemented can differ quite substantially. We present a summary of the reviews we conducted in a table for ease of comparing and contrasting.
A Hybrid Framework for Action Recognition in Low-Quality Video Sequences
Venue: arXiv cs.CV 2019
Year: 2019

Vision-based activity recognition is essential for security, monitoring and surveillance applications. Further, real-time analysis having low-quality video and contain less information about surrounding due to poor illumination, and occlusions. Therefore, it needs a more robust and integrated model for low quality and night security operations. In this context, we proposed a hybrid model for illumination invariant human activity recognition based on sub-image histogram equalization enhancement and k-key pose human silhouettes. This feature vector gives good average recognition accuracy on three low exposure video sequences subset of original actions video datasets. Finally, the performance of the proposed approach is tested over three manually downgraded low qualities Weizmann action, KTH, and Ballet Movement dataset. This model outperformed on low exposure videos over existing technique and achieved comparable classification accuracy to similar state-of-the-art methods.
MTRNet: A Generic Scene Text Eraser
Venue: arXiv cs.CV 2019
Year: 2019

Text removal algorithms have been proposed for uni-lingual scripts with regular shapes and layouts. However, to the best of our knowledge, a generic text removal method which is able to remove all or user-specified text regions regardless of font, script, language or shape is not available. Developing such a generic text eraser for real scenes is a challenging task, since it inherits all the challenges of multi-lingual and curved text detection and inpainting. To fill this gap, we propose a mask-based text removal network (MTRNet). MTRNet is a conditional adversarial generative network (cGAN) with an auxiliary mask. The introduced auxiliary mask not only makes the cGAN a generic text eraser, but also enables stable training and early convergence on a challenging large-scale synthetic dataset, initially proposed for text detection in real scenes. What's more, MTRNet achieves state-of-the-art results on several real-world datasets including ICDAR 2013, ICDAR 2017 MLT, and CTW1500, without being explicitly trained on this data, outperforming previous state-of-the-art methods trained directly on these datasets.
Semi-Blind Channel-and-Signal Estimation for Uplink Massive MIMO With Channel Sparsity
Venue: arXiv cs.IT 2019
Year: 2019

This paper considers the transceiver design for uplink massive multiple-input multiple-output (MIMO) systems with channel sparsity in the angular domain. Recent progress has shown that sparsity-learning-based blind signal detection is able to retrieve the channel and data by using massage-passing based sparse matrix factorization methods. Short pilots sequences are inserted into user packets to eliminate the so-called phase and permutation ambiguities inherent in sparse matrix factorization. In this paper, to exploit the knowledge of these short pilot sequences more efficiently, we propose a semi-blind channel-and-signal estimation (SCSE) scheme in which the knowledge of the pilot sequences are integrated into the message passing algorithm for sparse matrix factorization. The SCSE algorithm involves enumeration over all possible user permutations, and so is time-consuming when the number of users is relatively large. To reduce complexity, we further develop the simplified SCSE (S-SCSE) to accommodate systems with a large number of users. We show that our semi-blind signal detection scheme substantially outperforms the state-of-the-art blind detection and training-based schemes in the short-pilot regime.
Automated Circuit Approximation Method Driven by Data Distribution
Venue: arXiv cs.AR 2019
Year: 2019

We propose an application-tailored data-driven fully automated method for functional approximation of combinational circuits. We demonstrate how an application-level error metric such as the classification accuracy can be translated to a component-level error metric needed for an efficient and fast search in the space of approximate low-level components that are used in the application. This is possible by employing a weighted mean error distance (WMED) metric for steering the circuit approximation process which is conducted by means of genetic programming. WMED introduces a set of weights (calculated from the data distribution measured on a selected signal in a given application) determining the importance of each input vector for the approximation process. The method is evaluated using synthetic benchmarks and application-specific approximate MAC (multiply-and-accumulate) units that are designed to provide the best trade-offs between the classification accuracy and power consumption of two image classifiers based on neural networks.
Pluralistic Image Completion
Venue: arXiv cs.CV 2019
Year: 2019

Most image completion methods produce only one result for each masked input, although there may be many reasonable possibilities. In this paper, we present an approach for \textbf{pluralistic image completion} -- the task of generating multiple and diverse plausible solutions for image completion. A major challenge faced by learning-based approaches is that usually only one ground truth training instance per label. As such, sampling from conditional VAEs still leads to minimal diversity. To overcome this, we propose a novel and probabilistically principled framework with two parallel paths. One is a reconstructive path that utilizes the only one given ground truth to get prior distribution of missing parts and rebuild the original image from this distribution. The other is a generative path for which the conditional prior is coupled to the distribution obtained in the reconstructive path. Both are supported by GANs. We also introduce a new short+long term attention layer that exploits distant relations among decoder and encoder features, improving appearance consistency. When tested on datasets with buildings (Paris), faces (CelebA-HQ), and natural images (ImageNet), our method not only generated higher-quality completion results, but also with multiple and diverse plausible outputs.
Techno-Economic Analysis and Optimal Control of Battery Storage for Frequency Control Services, Applied to the German Market
Venue: arXiv cs.SY 2019
Year: 2019

Optimal investment in battery energy storage systems, taking into account degradation, sizing and control, is crucial for the deployment of battery storage, of which providing frequency control is one of the major applications. In this paper, we present a holistic, data-driven framework to determine the optimal investment, size and controller of a battery storage system providing frequency control. We optimised the controller towards minimum degradation and electricity costs over its lifetime, while ensuring the delivery of frequency control services compliant with regulatory requirements. We adopted a detailed battery model, considering the dynamics and degradation when exposed to actual frequency data. Further, we used a stochastic optimisation objective while constraining the probability on unavailability to deliver the frequency control service. Through a thorough analysis, we were able to decrease the amount of data needed and thereby decrease the execution time while keeping the approximation error within limits. Using the proposed framework, we performed a techno-economic analysis of a battery providing 1 MW capacity in the German primary frequency control market. Results showed that a battery rated at 1.6 MW, 1.6 MWh has the highest net present value, yet this configuration is only profitable if costs are low enough or in case future frequency control prices do not decline too much. It transpires that calendar ageing drives battery degradation, whereas cycle ageing has less impact.
On Application of Learning to Rank for E-Commerce Search
Venue: arXiv cs.IR 2019
Year: 2019

E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of LETOR for web search has been well studied, its use for E-Com search has not yet been well explored. In this paper, we discuss the practical challenges in applying learning to rank methods to E-Com search, including the challenges in feature representation, obtaining reliable relevance judgments, and optimally exploiting multiple user feedback signals such as click rates, add-to-cart ratios, order rates, and revenue. We study these new challenges using experiments on industry data sets and report several interesting findings that can provide guidance on how to optimally apply LETOR to E-Com search: First, popularity-based features defined solely on product items are very useful and LETOR methods were able to effectively optimize their combination with relevance-based features. Second, query attribute sparsity raises challenges for LETOR, and selecting features to reduce/avoid sparsity is beneficial. Third, while crowdsourcing is often useful for obtaining relevance judgments for Web search, it does not work as well for E-Com search due to difficulty in eliciting sufficiently fine grained relevance judgments. Finally, among the multiple feedback signals, the order rate is found to be the most robust training objective, followed by click rate, while add-to-cart ratio seems least robust, suggesting that an effective practical strategy may be to initially use click rates for training and gradually shift to using order rates as they become available.
SleepNet: Automated Sleep Analysis via Dense Convolutional Neural Network Using Physiological Time Series
Venue: arXiv cs.LG 2019
Year: 2019

In this work, a dense recurrent convolutional neural network (DRCNN) was constructed to detect sleep disorders including arousal, apnea and hypopnea using Polysomnography (PSG) measurement channels provided in the 2018 Physionet challenge database. Our model structure is composed of multiple dense convolutional units (DCU) followed by a bidirectional long-short term memory (LSTM) layer followed by a softmax output layer. The sleep events including sleep stages, arousal regions and multiple types of apnea and hypopnea are manually annotated by experts which enables us to train our proposed network using a multi-task learning mechanism. Three binary cross-entropy loss functions corresponding to sleep/wake, target arousal and apnea-hypopnea/normal detection tasks are summed up to generate our overall network loss function that is optimized using the Adam method. Our model performance was evaluated using two metrics: the area under the precision-recall curve (AUPRC) and the area under the receiver operating characteristic curve (AUROC). To measure our model generalization, 4-fold cross-validation was also performed. For training, our model was applied to full night recording data. Finally, the average AUPRC and AUROC values associated with the arousal detection task were 0.505 and 0.922, respectively on our testing dataset. An ensemble of four models trained on different data folds improved the AUPRC and AUROC to 0.543 and 0.931, respectively. Our proposed algorithm achieved the first place in the official stage of the 2018 Physionet challenge for detecting sleep arousals with AUPRC of 0.54 on the blind testing dataset.
Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory
Venue: arXiv cs.SC 2019
Year: 2019

We give an overview of the theoretical results for matrix block-recursive algorithms in commutative domains and present the results of experiments that we conducted with new parallel programs based on these algorithms on a supercomputer MVS-10P at the Joint Supercomputer Center of the Russian Academy of Science. To demonstrate a scalability of these programs we measure the running time of the program for a different number of processors and plot the graphs of efficiency factor. Also we present the main application areas in which such parallel algorithms are used. It is concluded that this class of algorithms allows to obtain efficient parallel programs on clusters with distributed memory.
A GraphBLAS Approach for Subgraph Counting
Venue: arXiv cs.DC 2019
Year: 2019

Subgraph counting aims to count the occurrences of a subgraph template T in a given network G. The basic problem of computing structural properties such as counting triangles and other subgraphs has found applications in diverse domains. Recent biological, social, cybersecurity and sensor network applications have motivated solving such problems on massive networks with billions of vertices. The larger subgraph problem is known to be memory bounded and computationally challenging to scale; the complexity grows both as a function of T and G. In this paper, we study the non-induced tree subgraph counting problem, propose a novel layered softwarehardware co-design approach, and implement a shared-memory multi-threaded algorithm: 1) reducing the complexity of the parallel color-coding algorithm by identifying and pruning redundant graph traversal; 2) achieving a fully-vectorized implementation upon linear algebra kernels inspired by GraphBLAS, which significantly improves cache usage and maximizes memory bandwidth utilization. Experiments show that our implementation improves the overall performance over the state-of-the-art work by orders of magnitude and up to 660x for subgraph templates with size over 12 on a dual-socket Intel(R) Xeon(R) Platinum 8160 server. We believe our approach using GraphBLAS with optimized sparse linear algebra can be applied to other massive subgraph counting problems and emerging high-memory bandwidth hardware architectures.
The Past and the Present of the Color Checker Dataset Misuse
Venue: arXiv cs.CV 2019
Year: 2019

The pipelines of digital cameras contain a part for computational color constancy, which aims to remove the influence of the illumination on the scene colors. One of the best known and most widely used benchmark datasets for this problem is the Color Checker dataset. However, due to the improper handling of the black level in its images, this dataset has been widely misused and while some recent publications tried to alleviate the problem, they nevertheless erred and created additional wrong data. This paper gives a history of the Color Checker dataset usage, it describes the origins and reasons for its misuses, and it explains the old and new mistakes introduced in the most recent publications that tried to handle the issue. This should, hopefully, help to prevent similar future misuses.
Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results
Venue: arXiv cs.DM 2019
Year: 2019

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $λ= \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a bilinear operation on sixtuples that is derived from the dynamic-programming recursion for computing the number of minimal dominating sets of a tree. We also derive an output-sensitive algorithm for listing all minimal dominating sets with linear set-up time and linear delay between successive solutions.
Evaluating Modern GPU Interconnect: PCIe, NVLink, NV-SLI, NVSwitch and GPUDirect
Venue: arXiv cs.AR 2019
Year: 2019

High performance multi-GPU computing becomes an inevitable trend due to the ever-increasing demand on computation capability in emerging domains such as deep learning, big data and planet-scale simulations. However, the lack of deep understanding on how modern GPUs can be connected and the real impact of state-of-the-art interconnect technology on multi-GPU application performance become a hurdle. In this paper, we fill the gap by conducting a thorough evaluation on five latest types of modern GPU interconnects: PCIe, NVLink-V1, NVLink-V2, NVLink-SLI and NVSwitch, from six high-end servers and HPC platforms: NVIDIA P100-DGX-1, V100-DGX-1, DGX-2, OLCF's SummitDev and Summit supercomputers, as well as an SLI-linked system with two NVIDIA Turing RTX-2080 GPUs. Based on the empirical evaluation, we have observed four new types of GPU communication network NUMA effects: three are triggered by NVLink's topology, connectivity and routing, while one is caused by PCIe chipset design issue. These observations indicate that, for an application running in a multi-GPU node, choosing the right GPU combination can impose considerable impact on GPU communication efficiency, as well as the application's overall performance. Our evaluation can be leveraged in building practical multi-GPU performance models, which are vital for GPU task allocation, scheduling and migration in a shared environment (e.g., AI cloud and HPC centers), as well as communication-oriented performance tuning.
Guiding High-Performance SAT Solvers with Unsat-Core Predictions
Venue: arXiv cs.NE 2019
Year: 2019

The NeuroSAT neural network architecture was recently introduced for predicting properties of propositional formulae. When trained to predict the satisfiability of toy problems, it was shown to find solutions and unsatisfiable cores on its own. However, the authors saw "no obvious path" to using the architecture to improve the state-of-the-art. In this work, we train a simplified NeuroSAT architecture to directly predict the unsatisfiable cores of real problems. We modify several high-performance SAT solvers to periodically replace their variable activity scores with NeuroSAT's prediction of how likely the variables are to appear in an unsatisfiable core. The modified MiniSat solves 10% more problems on SAT-COMP 2018 within the standard 5,000 second timeout than the original does. The modified Glucose solves 11% more problems than the original, while the modified Z3 solves 6% more. The gains are even greater when the training is specialized for a specific distribution of problems; on a benchmark of hard problems from a scheduling domain, the modified Glucose solves 20% more problems than the original does within a one-hour timeout. Our results demonstrate that NeuroSAT can provide effective guidance to high-performance SAT solvers on real problems.