OpenRaiser/Intern-Atlas huggingface dataset:
Revenue Maximization for Query Pricing
Venue: arXiv cs.DB 2019
Year: 2019

Buying and selling of data online has increased substantially over the last few years. Several frameworks have already been proposed that study query pricing in theory and practice. The key guiding principle in these works is the notion of {\em arbitrage-freeness} where the broker can set different prices for different queries made to the dataset, but must ensure that the pricing function does not provide the buyers with opportunities for arbitrage. However, little is known about revenue maximization aspect of query pricing. In this paper, we study the problem faced by a broker selling access to data with the goal of maximizing her revenue. We show that this problem can be formulated as a revenue maximization problem with single-minded buyers and unlimited supply, for which several approximation algorithms are known. We perform an extensive empirical evaluation of the performance of several pricing algorithms for the query pricing problem on real-world instances. In addition to previously known approximation algorithms, we propose several new heuristics and analyze them both theoretically and experimentally. Our experiments show that algorithms with the best theoretical bounds are not necessarily the best empirically. We identify algorithms and heuristics that are both fast and also provide consistently good performance when valuations are drawn from a variety of distributions.
Disks in Curves of Bounded Convex Curvature
Venue: arXiv cs.CG 2019
Year: 2019

We say that a simple, closed curve $γ$ in the plane has bounded convex curvature if for every point $x$ on $γ$, there is an open unit disk $U_x$ and $\varepsilon_x>0$ such that $x\in\partial U_x$ and $B_{\varepsilon_x}(x)\cap U_x\subset\text{Int}\;γ$. We prove that the interior of every curve of bounded convex curvature contains an open unit disk.
Federated Imitation Learning: A Privacy Considered Imitation Learning Framework for Cloud Robotic Systems with Heterogeneous Sensor Data
Venue: arXiv cs.RO 2019
Year: 2019

Humans are capable of learning a new behavior by observing others perform the skill. Robots can also implement this by imitation learning. Furthermore, if with external guidance, humans will master the new behavior more efficiently. So how can robots implement this? To address the issue, we present Federated Imitation Learning (FIL) in the paper. Firstly, a knowledge fusion algorithm deployed on the cloud for fusing knowledge from local robots is presented. Then, effective transfer learning methods in FIL are introduced. With FIL, a robot is capable of utilizing knowledge from other robots to increase its imitation learning. FIL considers information privacy and data heterogeneity when robots share knowledge. It is suitable to be deployed in cloud robotic systems. Finally, we conduct experiments of a simplified self-driving task for robots (cars). The experimental results demonstrate that FIL is capable of increasing imitation learning of local robots in cloud robotic systems.
Reliability and Local Delay in Wireless Networks: Does Bandwidth Partitioning Help?
Venue: arXiv cs.IT 2019
Year: 2019

This paper studies the effect of bandwidth partitioning (BWP) on the reliability and delay performance in infrastructureless wireless networks. The reliability performance is characterized by the density of concurrent transmissions that satisfy a certain reliability (outage) constraint and the delay performance by so-called local delay, defined as the average number of time slots required to successfully transmit a packet. We concentrate on the ultrareliable regime where the target outage probability is close to 0. BWP has two conflicting effects: while the interference is reduced as the concurrent transmissions are divided over multiple frequency bands, the signal-to-interference ratio (SIR) requirement is increased due to smaller allocated bandwidth if the data rate is to be kept constant. Instead, if the SIR requirement is to be kept the same, BWP reduces the data rate and in turn increases the local delay. For these two approaches with adaptive and fixed SIR requirements, we derive closed-form expressions of the local delay and the maximum density of reliable transmissions in the ultrareliable regime. Our analysis shows that, in the ultrareliable regime, BWP leads to the reliability-delay tradeoff.
Counterfactual Depth from a Single RGB Image
Venue: arXiv cs.CV 2019
Year: 2019

We describe a method that predicts, from a single RGB image, a depth map that describes the scene when a masked object is removed - we call this "counterfactual depth" that models hidden scene geometry together with the observations. Our method works for the same reason that scene completion works: the spatial structure of objects is simple. But we offer a much higher resolution representation of space than current scene completion methods, as we operate at pixel-level precision and do not rely on a voxel representation. Furthermore, we do not require RGBD inputs. Our method uses a standard encoder-decoder architecture, and with a decoder modified to accept an object mask. We describe a small evaluation dataset that we have collected, which allows inference about what factors affect reconstruction most strongly. Using this dataset, we show that our depth predictions for masked objects are better than other baselines.
A First Look at Blockchain-based Decentralized Applications
Venue: arXiv cs.SE 2019
Year: 2019

With the increasing popularity of blockchain technologies in recent years, blockchain-based decentralized applications (DApps for short in this paper) have been rapidly developed and widely adopted in many areas, being a hot topic in both academia and industry. Despite of the importance of DApps, we still have quite little understanding of DApps along with its ecosystem. To bridge the knowledge gap, this paper presents the first comprehensive empirical study of blockchain-based DApps to date, based on an extensive dataset of 995 Ethereum DApps and 29,846,075 transaction logs over them. We make a descriptive analysis of the popularity of DApps, summarize the patterns of how DApps use smart contracts to access the underlying blockchain, and explore the worth-addressing issues of deploying and operating DApps. Based on the findings, we propose some implications for DApp users to select proper DApps, for DApp developers to improve the efficiency of DApps, and for blockchain vendors to enhance the support of DApps.
Data-Driven Approach to Encoding and Decoding 3-D Crystal Structures
Venue: arXiv cs.LG 2019
Year: 2019

Generative models have achieved impressive results in many domains including image and text generation. In the natural sciences, generative models have led to rapid progress in automated drug discovery. Many of the current methods focus on either 1-D or 2-D representations of typically small, drug-like molecules. However, many molecules require 3-D descriptors and exceed the chemical complexity of commonly used dataset. We present a method to encode and decode the position of atoms in 3-D molecules from a dataset of nearly 50,000 stable crystal unit cells that vary from containing 1 to over 100 atoms. We construct a smooth and continuous 3-D density representation of each crystal based on the positions of different atoms. Two different neural networks were trained on a dataset of over 120,000 three-dimensional samples of single and repeating crystal structures, made by rotating the single unit cells. The first, an Encoder-Decoder pair, constructs a compressed latent space representation of each molecule and then decodes this description into an accurate reconstruction of the input. The second network segments the resulting output into atoms and assigns each atom an atomic number. By generating compressed, continuous latent spaces representations of molecules we are able to decode random samples, interpolate between two molecules, and alter known molecules.
Modeling Named Entity Embedding Distribution into Hypersphere
Venue: arXiv cs.CL 2019
Year: 2019

This work models named entity distribution from a way of visualizing topological structure of embedding space, so that we make an assumption that most, if not all, named entities (NEs) for a language tend to aggregate together to be accommodated by a specific hypersphere in embedding space. Thus we present a novel open definition for NE which alleviates the obvious drawback in previous closed NE definition with a limited NE dictionary. Then, we show two applications with introducing the proposed named entity hypersphere model. First, using a generative adversarial neural network to learn a transformation matrix of two embedding spaces, which results in a convenient determination of named entity distribution in the target language, indicating the potential of fast named entity discovery only using isomorphic relation between embedding spaces. Second, the named entity hypersphere model is directly integrated with various named entity recognition models over sentences to achieve state-of-the-art results. Only assuming that embeddings are available, we show a prior knowledge free approach on effective named entity distribution depiction.
Link Prediction in Networks Using Effective Transitions
Venue: arXiv cs.SI 2019
Year: 2019

We introduce a new method for predicting the formation of links in real-world networks, which we refer to as the method of effective transitions. This method relies on the theory of isospectral matrix reductions to compute the probability of eventually transitioning from one vertex to another in a (biased) random walk on the network. Unlike the large majority of link prediction techniques, this method can be used to predict links in networks that are directed or undirected which are either weighted or unweighted. We apply this method to a number of social, technological, and natural networks and show that it is competitive with other link predictors often outperforming them. We also provide a method of approximating our effective transition method and show that aside from having much lower temporal complexity, this approximation often provides more accurate predictions than the original effective transition method. We also, prove a number of mathematical results regarding our effective transition algorithm and its approximation.
A study of trends in the effects of TV ratings and social media (Twitter) -- Case study 1
Venue: arXiv cs.SI 2019
Year: 2019

The Japanese TV program 'Drama A' is a drama broadcast from October to December 2016. The audience rating was sluggish, but this drama marked a high audience rating in 2016. Since it was popular from the middle, and it was speculated that there was a part related to social media in the popularity, we considered existing research methods as a case study. In this paper, we used a mathematical model of the hit phenomenon to examine the impact of audience assessment from social media from a sociophysical perspective. We got the same consideration as the audience rating per minute of video research. This paper is IEEE BIGDATA2018's Revised paper(Consideration on TV audience rating and influence of social media).
Automated Data Integration, Cleaning and Analysis Using Data Mining and SPSS Tool For Technical School in Malaysia
Venue: arXiv cs.CY 2019
Year: 2019

This study aims to integrate, clean and analysis through automated data mining techniques. Using data mining (DM) techniques is one of the processes of transferring raw data from current educational system to meaningful information that can be used to help the school community to make a right decision to achieve much better results. This proved DM provides means to assist both educators and students, and improve the quality of education. The result and findings in the study show that automated system will give the same result compare with manual system of integration and analysis and also could be used by the management to make faster and more efficient decision in order to map or plan efficient teaching approach for students in the future.
AHINE: Adaptive Heterogeneous Information Network Embedding
Venue: arXiv cs.SI 2019
Year: 2019

Network embedding is an effective way to solve the network analytics problems such as node classification, link prediction, etc. It represents network elements using low dimensional vectors such that the graph structural information and properties are maximumly preserved. Many prior works focused on embeddings for networks with the same type of edges or vertices, while some works tried to generate embeddings for heterogeneous network using mechanisms like specially designed meta paths. In this paper, we propose two novel algorithms, GHINE (General Heterogeneous Information Network Embedding) and AHINE (Adaptive Heterogeneous Information Network Embedding), to compute distributed representations for elements in heterogeneous networks. Specially, AHINE uses an adaptive deep model to learn network embeddings that maximizes the likelihood of preserving the relationship chains between non-adjacent nodes. We apply our embeddings to a large network of points of interest (POIs) and achieve superior accuracy on some prediction problems on a ride-hailing platform. In addition, we show that AHINE outperforms state-of-the-art methods on a set of learning tasks on public datasets, including node labelling and similarity ranking in bibliographic networks.
A Generic Sharding Scheme for Blockchain Protocols
Venue: arXiv cs.CR 2019
Year: 2019

This thesis introduces a formal general framework for scaling blockchain protocols by sharding. The framework is modular and it can be adjusted for different needs or sets of assumptions. We prove that sharded protocols obtained by following our scheme (with correct modules in place) live up to the same safety and liveness guarantees as their non-sharded counterparts. The proof is general and relies on well-defined specifications of certain components. This lays the ground for simple proofs of correctness for sharded protocols obtained by following the proposed scheme. The framework is not left as an obscure specification of some high level structure; explicit use is demonstrated by applying it to shard Algorand. As part of this concrete construction, a tamper-proof mechanism to assign nodes to shards is introduced. This mechanism is constructed by using verifiable random functions and can safely withstand a powerful adaptive adversary.
Demucs: Deep Extractor for Music Sources with extra unlabeled data remixed
Venue: arXiv cs.SD 2019
Year: 2019

We study the problem of source separation for music using deep learning with four known sources: drums, bass, vocals and other accompaniments. State-of-the-art approaches predict soft masks over mixture spectrograms while methods working on the waveform are lagging behind as measured on the standard MusDB benchmark. Our contribution is two fold. (i) We introduce a simple convolutional and recurrent model that outperforms the state-of-the-art model on waveforms, that is, Wave-U-Net, by 1.6 points of SDR (signal to distortion ratio). (ii) We propose a new scheme to leverage unlabeled music. We train a first model to extract parts with at least one source silent in unlabeled tracks, for instance without bass. We remix this extract with a bass line taken from the supervised dataset to form a new weakly supervised training example. Combining our architecture and scheme, we show that waveform methods can play in the same ballpark as spectrogram ones.
Complexity analysis of the Controlled Loosening-up (CLuP) algorithm
Venue: arXiv cs.IT 2019
Year: 2019

In our companion paper \cite{Stojnicclupint19} we introduced a powerful mechanism that we referred to as the Controlled Loosening-up (CLuP) for handling MIMO ML-detection problems. It turned out that the algorithm has many remarkable features and one of them, the \emph{computational complexity}, we discuss in more details in this paper. As was explained in \cite{Stojnicclupint19}, the CLuP is an iterative procedure where each iteration amounts to solving a simple quadratic program. This clearly implies that the key contributing factor to its overall computational complexity is the number of iterations needed to achieve a required precision. As was also hinted in \cite{Stojnicclupint19}, that number seems to be fairly low and in some of the most interesting scenarios often not even larger than $10$. Here we provide a Random Duality Theory based careful analysis that indeed indicates that a very small number of iterations is sufficient to achieve an excellent performance. A solid set of results obtained through numerical experiments is presented as well and shown to be in a nice agreement with what the theoretical analysis predicts. Also, as was the case in \cite{Stojnicclupint19}, we again focus only on the core CLuP algorithm but do mention on several occasions that the concepts that we introduce here are as remarkably general as those that we introduced in \cite{Stojnicclupint19} and can be utilized in the analysis of a large number of classes of algorithms applicable in the most diverse of scientific fields. Many results in these directions we will present in several of our companion papers.
A Low-Cost, Flexible and Portable Volumetric Capturing System
Venue: arXiv cs.CV 2019
Year: 2019

Multi-view capture systems are complex systems to engineer. They require technical knowledge to install and intricate processes to setup related mainly to the sensors' spatial alignment (i.e. external calibration). However, with the ongoing developments in new production methods, we are now at a position where the production of high quality realistic 3D assets is possible even with commodity sensors. Nonetheless, the capturing systems developed with these methods are heavily intertwined with the methods themselves, relying on custom solutions and seldom - if not at all - publicly available. In light of this, we design, develop and publicly offer a multi-view capture system based on the latest RGB-D sensor technology. For our system, we develop a portable and easy-to-use external calibration method that greatly reduces the effort and knowledge required, as well as simplify the overall process.
Neural Attentive Bag-of-Entities Model for Text Classification
Venue: arXiv cs.CL 2019
Year: 2019

This study proposes a Neural Attentive Bag-of-Entities model, which is a neural network model that performs text classification using entities in a knowledge base. Entities provide unambiguous and relevant semantic signals that are beneficial for capturing semantics in texts. We combine simple high-recall entity detection based on a dictionary, to detect entities in a document, with a novel neural attention mechanism that enables the model to focus on a small number of unambiguous and relevant entities. We tested the effectiveness of our model using two standard text classification datasets (i.e., the 20 Newsgroups and R8 datasets) and a popular factoid question answering dataset based on a trivia quiz game. As a result, our model achieved state-of-the-art results on all datasets. The source code of the proposed model is available online at https://github.com/wikipedia2vec/wikipedia2vec.
CMU GetGoing: An Understandable and Memorable Dialog System for Seniors
Venue: arXiv cs.CL 2019
Year: 2019

Voice-based technologies are typically developed for the average user, and thus generally not tailored to the specific needs of any subgroup of the population, like seniors. This paper presents CMU GetGoing, an accessible trip planning dialog system designed for senior users. The GetGoing system design is described in detail, with particular attention to the senior-tailored features. A user study is presented, demonstrating that the senior-tailored features significantly improve comprehension and retention of information.
Thing/Machine-s (Thimacs) Applied to Structural Description in Software Engineering
Venue: arXiv cs.SE 2019
Year: 2019

We are pursuing a modeling methodology that views the world as a realm of things. A thing is defined as something that can be created, processed, released, transferred, and received. Additionally, in this modeling approach, a thing is a five-dimensional structure referred to as a thinging (abstract) machine. On the other hand, machines are things that are operated on; that is, they are created, processed, released, transferred, and received. The intertwining with the world is accomplished by integrating these two modes of an entity s being: being a thing that flows through machines and being a machine that processes things. This paper further enriches these notions of things and machines. We present further exploration of the thinging machine model through introducing a new notion called the thing/machine (thimac) as a label of the unity of things/machines. Thimacs replace traditional categorization, properties, and behavior with creating, processing, releasing, transferring, and receiving, as well as the two linking notions of flow and triggering. The paper discusses the concept of thimacs with examples and focuses on the notion of structure as it applies to various diagrammatic modeling methodologies.
Predicting Specificity in Classroom Discussion
Venue: arXiv cs.CL 2019
Year: 2019

High quality classroom discussion is important to student development, enhancing abilities to express claims, reason about other students' claims, and retain information for longer periods of time. Previous small-scale studies have shown that one indicator of classroom discussion quality is specificity. In this paper we tackle the problem of predicting specificity for classroom discussions. We propose several methods and feature sets capable of outperforming the state of the art in specificity prediction. Additionally, we provide a set of meaningful, interpretable features that can be used to analyze classroom discussions at a pedagogical level.
Effective Strategies for Using Hashtags in Online Communication
Venue: arXiv cs.CY 2019
Year: 2019

The features of use of hashtags among students of Lviv were investigated. The list of optimal strategies for using these communicative tools for personal branding is determined. The effective strategy for using hashtags in online communication for the personal and company branding is considered. The results of calculation of effectiveness of hashtags related to #education is calculated. The reports of using hashtag #education in social networks is presented.
Deep Morphological Neural Networks
Venue: arXiv cs.CV 2019
Year: 2019

Mathematical morphology is a theory and technique to collect features like geometric and topological structures in digital images. Given a target image, determining suitable morphological operations and structuring elements is a cumbersome and time-consuming task. In this paper, a morphological neural network is proposed to address this problem. Serving as a nonlinear feature extracting layer in deep learning frameworks, the efficiency of the proposed morphological layer is confirmed analytically and empirically. With a known target, a single-filter morphological layer learns the structuring element correctly, and an adaptive layer can automatically select appropriate morphological operations. For practical applications, the proposed morphological neural networks are tested on several classification datasets related to shape or geometric image features, and the experimental results have confirmed the high computational efficiency and high accuracy.