OpenRaiser/Intern-Atlas huggingface dataset:
MBWU: Benefit Quantification for Data Access Function Offloading
Venue: arXiv cs.DC 2019
Year: 2019

The storage industry is considering new kinds of storage devices that support data access function offloading, i.e. the ability to perform data access functions on the storage device itself as opposed to performing it on a separate compute system to which the storage device is connected. But what is the benefit of offloading to a storage device that is controlled by an embedded platform, very different from a host platform? To quantify the benefit, we need a measurement methodology that enables apple-to-apple comparisons between different platforms. We propose a Media-based Work Unit (MBWU, pronounced "MibeeWu"), and an MBWU-based measurement methodology to standardize the platform efficiency evaluation so as to quantify the benefit of offloading. To demonstrate the merit of this methodology, we implemented a prototype to automate quantifying the benefit of offloading the key-value data access function.
NoCs in Heterogeneous 3D SoCs: Co-Design of Routing Strategies and Microarchitectures
Venue: arXiv cs.AR 2019
Year: 2019

Heterogeneous 3D System-on-Chips (3D SoCs) are the most promising design paradigm to combine sensing and computing within a single chip. A special characteristic of communication networks in heterogeneous 3D SoCs is the varying latency and throughput in each layer. As shown in this work, this variance drastically degrades the network performance. We contribute a co-design of routing algorithms and router microarchitecture that allows to overcome these performance limitations. We analyze the challenges of heterogeneity: Technology-aware models are proposed for communication and thereby identify layers in which packets are transmitted slower. The communication models are precise for latency and throughput under zero load. The technology model has an area error and a timing error of less than 7.4% for various commercial technologies from 90 to 28nm. Second, we demonstrate how to overcome limitations of heterogeneity by proposing two novel routing algorithms called Z+(XY)Z- and ZXYZ that enhance latency by up to 6.5x compared to conventional dimension order routing. Furthermore, we propose a high vertical-throughput router microarchitecture that is adjusted to the routing algorithms and that fully overcomes the limitations of slower layers. We achieve an increased throughput of 2 to 4x compared to a conventional router. Thereby, the dynamic power of routers is reduced by up to 41.1% and we achieve improved flit latency of up to 2.26x at small total router area costs between 2.1% and 10.4% for realistic technologies and application scenarios.
Modeling User Reputation in Online Social Networks: The Role of Costs, Benefits, and Reciprocity
Venue: arXiv cs.SI 2019
Year: 2019

We analyze an agent-based model to estimate how the costs and benefits of users in an online social network (OSN) impact the robustness of the OSN. Benefits are measured in terms of relative reputation that users receives from their followers. They can be increased by direct and indirect reciprocity in following each other, which leads to a core-periphery structure of the OSN. Costs relate to the effort to login, to maintain the profile, etc. and are assumed as constant for all users. The robustness of the OSN depends on the entry and exit of users over time. Intuitively, one would expect that higher costs lead to more users leaving and hence to a less robust OSN. We demonstrate that an optimal cost level exists, which maximizes both the performance of the OSN, measured by means of the long-term average benefit of its users, and the robustness of the OSN, measured by means of the life-time of the core of the OSN. Our mathematical and computational analyses unfold how changes in the cost level impact reciprocity and subsequently the core-periphery structure of the OSN, to explain the optimal cost level.
Prediction of Overall Survival of Brain Tumor Patients
Venue: arXiv cs.LG 2019
Year: 2019

Automated brain tumor segmentation plays an important role in the diagnosis and prognosis of the patient. In addition, features from the tumorous brain help in predicting patients overall survival. The main focus of this paper is to segment tumor from BRATS 2018 benchmark dataset and use age, shape and volumetric features to predict overall survival of patients. The random forest classifier achieves overall survival accuracy of 59% on the test dataset and 67% on the dataset with resection status as gross total resection. The proposed approach uses fewer features but achieves better accuracy than state of the art methods.
PTRM: Perceived Terrain Realism Metrics
Venue: arXiv cs.GR 2019
Year: 2019

Terrains are visually important and commonly used in computer graphics. While many algorithms for their generation exist, it is difficult to assess the realism of a generated terrain. This paper presents a first step in the direction of perceptual evaluation of terrain models. We gathered and categorized several classes of real terrains and we generated synthetic terrains by using methods from computer graphics. We then conducted two large studies ranking the terrains perceptually and showing that the synthetic terrains are perceived as lacking realism as compared to the real ones. Then we provide insight into the features that affect the perceived realism by a quantitative evaluation based on localized geomorphology-based landform features (geomorphons) that categorize terrain structures such as valleys, ridges, hollows, etc. We show that the presence or absence of certain features have a significant perceptual effect. We then introduce Perceived Terrain Realism Metrics (PTRM); a perceptual metrics that estimates perceived realism of a terrain represented as a digital elevation map by relating distribution of terrain features with their perceived realism. We validated PTRM on real and synthetic data and compared it to the perceptual studies. To confirm the importance of the presence of these features, we used a generative deep neural network to transfer them between real terrains and synthetic ones and we performed another perceptual experiment that further confirmed their importance for perceived realism.
Fair Sharing: The Shapley Value for Ride-Sharing and Routing Games
Venue: arXiv cs.GT 2019
Year: 2019

Ride-sharing services are gaining popularity and are crucial for a sustainable environment. A special case in which such services are most applicable, is the last mile variant. In this variant it is assumed that all the passengers are positioned at the same origin location (e.g. an airport), and each have a different destination. One of the major issues in a shared ride is fairly splitting of the ride cost among the passengers. In this paper we use the Shapley value, which is one of the most significant solution concepts in cooperative game theory, for fairly splitting the cost of a shared ride. We consider two scenarios. In the first scenario there exists a fixed priority order in which the passengers are dropped-off (e.g. elderly, injured etc.), and we show a method for efficient computation of the Shapley value in this setting. Our results are also applicable for efficient computation of the Shapley value in routing games. In the second scenario there is no predetermined priority order. We show that the Shapley value cannot be efficiently computed in this setting. However, extensive simulations reveal that our approach for the first scenario can serve as an excellent proxy for the second scenario, outperforming other known proxies.
Visual Analytics of Student Learning Behaviors on K-12 Mathematics E-learning Platforms
Venue: arXiv cs.HC 2019
Year: 2019

With increasing popularity in online learning, a surge of E-learning platforms have emerged to facilitate education opportunities for k-12 (from kindergarten to 12th grade) students and with this, a wealth of information on their learning logs are getting recorded. However, it remains unclear how to make use of these detailed learning behavior data to improve the design of learning materials and gain deeper insight into students' thinking and learning styles. In this work, we propose a visual analytics system to analyze student learning behaviors on a K-12 mathematics E-learning platform. It supports both correlation analysis between different attributes and a detailed visualization of user mouse-movement logs. Our case studies on a real dataset show that our system can better guide the design of learning resources (e.g., math questions) and facilitate quick interpretation of students' problem-solving and learning styles.
Reinforcement Learning and Video Games
Venue: arXiv cs.LG 2019
Year: 2019

Reinforcement learning has exceeded human-level performance in game playing AI with deep learning methods according to the experiments from DeepMind on Go and Atari games. Deep learning solves high dimension input problems which stop the development of reinforcement for many years. This study uses both two techniques to create several agents with different algorithms that successfully learn to play T-rex Runner. Deep Q network algorithm and three types of improvements are implemented to train the agent. The results from some of them are far from satisfactory but others are better than human experts. Batch normalization is a method to solve internal covariate shift problems in deep neural network. The positive influence of this on reinforcement learning has also been proved in this study.
Understanding user search processes across varying cognitive levels
Venue: arXiv cs.HC 2019
Year: 2019

Web is often used for finding information and with a learning intention. In this thesis, we propose a study to investigate the process of learning online across varying cognitive learning levels using crowd-sourced participants. Our aim was to study the impact of cognitive learning levels on search as well as increase in knowledge. We present 150 participants with 6 search tasks for varying cognitive levels and collect user interactions and submitted answers as user data. We present quantitative analysis of user data which shows that the outcome for all cognitive levels is learning by quantifying it as calculated knowledge gain. Further, we also investigate the impact of cognitive learning level on user interaction and knowledge gain with the help of user data. We demonstrate that the cognitive learning level of search session has a significant impact on user's search behavior as well as on knowledge that is gained. Further, we establish a pattern in which the search behavior changes across cognitive learning levels where the least complex search task has minimum number of user interactions and most complex search task has maximum user interactions. With this observation, we were able to demonstrate a relation between a learner's search behavior and Krathwohl's revised Bloom's taxonomic structure of cognitive processes. The findings of this thesis intend to provide a significant work to bridge the relation between search, learning, and user.
Spam filtering on forums: A synthetic oversampling based approach for imbalanced data classification
Venue: arXiv cs.IR 2019
Year: 2019

Forums play an important role in providing a platform for community interaction. The introduction of irrelevant content or spam by individuals for commercial and social gains tends to degrade the professional experience presented to the forum users. Automated moderation of the relevancy of posted content is desired. Machine learning is used for text classification and finds applications in spam email detection, fraudulent transaction detection etc. The balance of classes in training data is essential in the case of classification algorithms to make the learning efficient and accurate. However, in the case of forums, the spam content is sparse compared to the relevant content giving rise to a bias towards the latter while training. A model trained on such biased data will fail to classify a spam sample. An approach based on Synthetic Minority Over-sampling Technique(SMOTE) is presented in this paper to tackle imbalanced training data. It involves synthetically creating new minority class samples from the existing ones until balance in data is achieved. The enhanced data is then passed through various classifiers for which the performance is recorded. The results were analyzed on the data of forums of Spoken Tutorial, IIT Bombay over standard performance metrics and revealed that models trained after Synthetic Minority oversampling outperform the ones trained on imbalanced data by substantial margins. An empirical comparison of the results obtained by both SMOTE and without SMOTE for various supervised classification algorithms have been presented in this paper. Synthetic oversampling proves to be a critical technique for achieving uniform class distribution which in turn yields commendable results in text classification. The presented approach can be further extended to content categorization on educational websites thus helping to improve the overall digital learning experience.
Promises Make Finite (Constraint Satisfaction) Problems Infinitary
Venue: arXiv cs.CC 2019
Year: 2019

The fixed template Promise Constraint Satisfaction Problem (PCSP) is a recently proposed significant generalization of the fixed template CSP, which includes approximation variants of satisfiability and graph coloring problems. All the currently known tractable (i.e., solvable in polynomial time) PCSPs over finite templates can be reduced, in a certain natural way, to tractable CSPs. However, such CSPs are often over infinite domains. We show that the infinity is in fact necessary by proving that a specific finite-domain PCSP, namely (1-in-3-SAT, Not-All-Equal-3-SAT), cannot be naturally reduced to a tractable finite-domain CSP, unless P=NP.
SwarmMesh: A Distributed Data Structure for Cooperative Multi-Robot Applications
Venue: arXiv cs.RO 2019
Year: 2019

We present an approach to the distributed storage of data across a swarm of mobile robots that forms a shared global memory. We assume that external storage infrastructure is absent, and that each robot is capable of devoting a quota of memory and bandwidth to distributed storage. Our approach is motivated by the insight that in many applications data is collected at the periphery of a swarm topology, but the periphery also happens to be the most dangerous location for storing data, especially in exploration missions. Our approach is designed to promote data storage in the locations in the swarm that best suit a specific feature of interest in the data, while accounting for the constantly changing topology due to individual motion. We analyze two possible features of interest: the data type and the data item position in the environment. We assess the performance of our approach in a large set of simulated experiments. The evaluation shows that our approach is capable of storing quantities of data that exceed the memory of individual robots, while maintaining near-perfect data retention in high-load conditions.
Report on the 8th International Workshop on Bibliometric-enhanced Information Retrieval (BIR 2019)
Venue: arXiv cs.IR 2019
Year: 2019

The Bibliometric-enhanced Information Retrieval workshop series (BIR) at ECIR tackled issues related to academic search, at the crossroads between Information Retrieval and Bibliometrics. BIR is a hot topic investigated by both academia (e.g., ArnetMiner, CiteSeerx, DocEar) and the industry (e.g., Google Scholar, Microsoft Academic Search, Semantic Scholar). This report presents the 8th iteration of the one-day BIR workshop held at ECIR 2019 in Cologne, Germany.
Image Segmentation using Multi-Threshold technique by Histogram Sampling
Venue: arXiv cs.CV 2019
Year: 2019

The segmentation of digital images is one of the essential steps in image processing or a computer vision system. It helps in separating the pixels into different regions according to their intensity level. A large number of segmentation techniques have been proposed, and a few of them use complex computational operations. Among all, the most straightforward procedure that can be easily implemented is thresholding. In this paper, we present a unique heuristic approach for image segmentation that automatically determines multilevel thresholds by sampling the histogram of a digital image. Our approach emphasis on selecting a valley as optimal threshold values. We demonstrated that our approach outperforms the popular Otsu's method in terms of CPU computational time. We demonstrated that our approach outperforms the popular Otsu's method in terms of CPU computational time. We observed a maximum speed-up of 35.58x and a minimum speed-up of 10.21x on popular image processing benchmarks. To demonstrate the correctness of our approach in determining threshold values, we compute PSNR, SSIM, and FSIM values to compare with the values obtained by Otsu's method. This evaluation shows that our approach is comparable and better in many cases as compared to well known Otsu's method.
How to detect novelty in textual data streams? A comparative study of existing methods
Venue: arXiv cs.LG 2019
Year: 2019

Since datasets with annotation for novelty at the document and/or word level are not easily available, we present a simulation framework that allows us to create different textual datasets in which we control the way novelty occurs. We also present a benchmark of existing methods for novelty detection in textual data streams. We define a few tasks to solve and compare several state-of-the-art methods. The simulation framework allows us to evaluate their performances according to a set of limited scenarios and test their sensitivity to some parameters. Finally, we experiment with the same methods on different kinds of novelty in the New York Times Annotated Dataset.
Robot Risk-Awareness by Formal Risk Reasoning and Planning
Venue: arXiv cs.RO 2019
Year: 2019

This paper proposes a formal robot motion risk reasoning framework and develops a risk-aware path planner that minimizes the proposed risk. While robots locomoting in unstructured or confined environments face a variety of risk, existing risk only focuses on collision with obstacles. Such risk is currently only addressed in ad hoc manners. Without a formal definition, ill-supported properties, e.g. additive or Markovian, are simply assumed. Relied on an incomplete and inaccurate representation of risk, risk-aware planners use ad hoc risk functions or chance constraints to minimize risk. The former inevitably has low fidelity when modeling risk, while the latter conservatively generates feasible path within a probability bound. Using propositional logic and probability theory, the proposed motion risk reasoning framework is formal. Building upon a universe of risk elements of interest, three major risk categories, i.e. locale-, action-, and traverse-dependent, are introduced. A risk-aware planner is also developed to plan minimum risk path based on the newly proposed risk framework. Results of the risk reasoning and planning are validated in physical experiments in real-world unstructured or confined environments. With the proposed fundamental risk reasoning framework, safety of robot locomotion could be explicitly reasoned, quantified, and compared. The risk-aware planner finds safe path in terms of the newly proposed risk framework and enables more risk-aware robot behavior in unstructured or confined environments.
Word and character segmentation directly in run-length compressed handwritten document images
Venue: arXiv cs.CV 2019
Year: 2019

From the literature, it is demonstrated that performing text-line segmentation directly in the run-length compressed handwritten document images significantly reduces the computational time and memory space. In this paper, we investigate the issues of word and character segmentation directly on the run-length compressed document images. Primarily, the spreads of the characters are intelligently extracted from the foreground runs of the compressed data and subsequently connected components are established. The spacing between the connected components would be larger between the adjacent words when compared to that of intra-words. With this knowledge, a threshold is empirically chosen for inter-word separation. Every connected component within a word is further analysed for character segmentation. Here, min-cut graph concept is used for separating the touching characters. Over-segmentation and under-segmentation issues are addressed by insertion and deletion operations respectively. The approach has been developed particularly for compressed handwritten English document images. However, the model has been tested on non-English document images.
On-line collision avoidance for collaborative robot manipulators by adjusting off-line generated paths: An industrial use case
Venue: arXiv cs.RO 2019
Year: 2019

Human-robot collision avoidance is a key in collaborative robotics and in the framework of Industry 4.0. It plays an important role for achieving safety criteria while having humans and machines working side-by-side in unstructured and time-varying environment. This study introduces the subject of manipulator's on-line collision avoidance into a real industrial application implementing typical sensors and a commonly used collaborative industrial manipulator, KUKA iiwa. In the proposed methodology, the human co-worker and the robot are represented by geometric primitives (capsules). The minimum distance and relative velocity between them is calculated, when human/obstacles are nearby the concept of hypothetical repulsion and attraction vectors is used. By coupling this concept with a mathematical representation of robot's kinematics, a task level control with collision avoidance capability is achieved. Consequently, the off-line generated nominal path of the industrial task is modified on-the-fly so the robot is able to avoid collision with the co-worker safely while being able to fulfill the industrial operation. To guarantee motion continuity when switching between different tasks, the notion of repulsion-vector-reshaping is introduced. Tests on an assembly robotic cell in automotive industry show that the robot moves smoothly and avoids collisions successfully by adjusting the off-line generated nominal paths.
The Neural State Pushdown Automata
Venue: arXiv cs.NE 2019
Year: 2019

In order to learn complex grammars, recurrent neural networks (RNNs) require sufficient computational resources to ensure correct grammar recognition. A widely-used approach to expand model capacity would be to couple an RNN to an external memory stack. Here, we introduce a "neural state" pushdown automaton (NSPDA), which consists of a digital stack, instead of an analog one, that is coupled to a neural network state machine. We empirically show its effectiveness in recognizing various context-free grammars (CFGs). First, we develop the underlying mechanics of the proposed higher order recurrent network and its manipulation of a stack as well as how to stably program its underlying pushdown automaton (PDA) to achieve desired finite-state network dynamics. Next, we introduce a noise regularization scheme for higher-order (tensor) networks, to our knowledge the first of its kind, and design an algorithm for improved incremental learning. Finally, we design a method for inserting grammar rules into a NSPDA and empirically show that this prior knowledge improves its training convergence time by an order of magnitude and, in some cases, leads to better generalization. The NSPDA is also compared to a classical analog stack neural network pushdown automaton (NNPDA) as well as a wide array of first and second-order RNNs with and without external memory, trained using different learning algorithms. Our results show that, for Dyck(2) languages, prior rule-based knowledge is critical for optimization convergence and for ensuring generalization to longer sequences at test time. We observe that many RNNs with and without memory, but no prior knowledge, fail to converge and generalize poorly on CFGs.