OpenRaiser/Intern-Atlas huggingface dataset:
Can we learn where people go?
Venue: arXiv cs.CV 2018
Year: 2018

In most agent-based simulators, pedestrians navigate from origins to destinations. Consequently, destinations are essential input parameters to the simulation. While many other relevant parameters as positions, speeds and densities can be obtained from sensors, like cameras, destinations cannot be observed directly. Our research question is: Can we obtain this information from video data using machine learning methods? We use density heatmaps, which indicate the pedestrian density within a given camera cutout, as input to predict the destination distributions. For our proof of concept, we train a Random Forest predictor on an exemplary data set generated with the Vadere microscopic simulator. The scenario is a crossroad where pedestrians can head left, straight or right. In addition, we gain first insights on suitable placement of the camera. The results motivate an in-depth analysis of the methodology.
Ontology based Approach for Semantic Service Selection in Business Process Re-Engineering
Venue: arXiv cs.SE 2018
Year: 2018

This research aims to provide the possibility to the business analysts to be able to know whether their design business processes are feasible or not. In order to solve this problem, we proposed a model called BPMNSemAuto that makes use of the existing services stored in the service registry UDDI (Universal Description Discovery and Integration). From the data extracted from the UDDI, the WSDL files and the tracking data of service execution on the server, a Web Service Ontology (WSOnto) is generated to store all the existing services. The BPMNSemAuto model takes an input of business process design specifications, and it generates an executable business process as an output. It provides an interface for business analysts to specify the description of each service task of the design business process. For each service task, the business analysts specify the task objective (keywords), inputs, outputs and weights of the Quality of Service (QoS) properties. From the design business process with the service task specifications, a Business Process Ontology (BPOnto) is generated. A service selection algorithm performs the mapping between the instances of the WSOnto and the BPOnto to obtain possible mappings between these two ontologies. The obtained mappings help the model to acquire web services to execute the desired service tasks. Moreover, the consistency checking of the inputs of the proposed model is performed before executing the service selection algorithm. WordNet is used to solve the synonym problems and at the same time a keyword extraction method is presented in this paper.
Graph Embedding for Citation Recommendation
Venue: arXiv cs.IR 2018
Year: 2018

As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation on graph and propose a task-specific neighborhood construction strategy to learn the distributed representations of papers. In addition, given the learned representations, we investigate various schemes to rank the candidate papers for citation recommendation. The experimental results show our proposed neighborhood construction strategy outperforms the widely-used random walks based sampling strategy on all ranking schemes, and the model based ranking scheme outperforms embedding based rankings for both neighborhood construction strategies. We also demonstrated that graph embedding is a robust approach for citation recommendation when hidden ratio changes, while the performance of classic methods drop significantly when the set of seed papers is becoming small.
Speed Based Optimal Power Control in Small Cell Networks
Venue: arXiv cs.PF 2018
Year: 2018

Small cell networks promise good quality of service (QoS) even for cell edge users, however pose challenges to cater to the high-speed users. The major difficulty being that of frequent handovers and the corresponding handover losses, which significantly depend upon the speed of the user. It was shown previously that the optimal cell size increases with speed. Thus, in scenarios with diverse users (speeds spanning over large ranges), it would be inefficient to serve all users using common cell radius and it is practically infeasible to design different cell sizes for different speeds. Alternatively, we propose to allocate power to a user based on its speed, e.g., higher power virtually increases the cell size. We solve well known Hamiltonian Jacobi equations under certain assumptions to obtain a power law, optimal for load factor and busy probability, for any given average power constraint and cell size. The optimal power control turns out to be linear in speed. We build a system level simulator for small cell network, using elaborate Monte-Carlo simulations, and show that the performance of the system improves significantly with linear power law. The power law is tested even for the cases, for which the system does not satisfy the assumptions required by the theory. For example, the linear power law has significant improvement in comparison with the 'equal power' system, even in presence of time varying and random interference. We observe good improvement in almost all cases with improvements up to 89\% for certain configurations.
BSSSQS: A Blockchain Based Smart and Secured Scheme for Question Sharing in the Smart Education System
Venue: arXiv cs.CR 2018
Year: 2018

Existing education systems are facing a threat of question paper leaking (QPL) in the exam which jeopardizes the quality of education. Therefore, it is high time to think about a more secure and flexible question sharing system which can prevent QPL issue in the future education system. Blockchain enables a way of creating and storing transactions, contracts or anything that requires protection against tampering, accessing etc. This paper presents a new scheme for smart education, by utilizing the concept of blockchain, for question sharing. A two-phase encryption technique for encrypting question paper (QSP) is proposed. In the first phase, QSPs are encrypted using timestamp and in the second phase, previous encrypted QSPs are encrypted again using a timestamp, salt hash and hashes from previous QSPs. These encrypted QSPs are stored in the blockchain along with a smart contract which helps the user to unlock the selected QSP. An algorithm is also proposed for selecting a QSP for the exam which picks a QSP randomly. Moreover, a timestamp based lock is imposed on the scheme so that no one can decrypt the QSP before the allowed time. Finally, security is analyzed by proving different propositions and the superiority of the proposed scheme over existing schemes is proven through a comparative study based on the different features.
Cryptaxforensic, When Cryptocurrency, Taxation, and Digital Forensic Collide: An Overview of Indonesian Cryptocurrency Market
Venue: arXiv cs.CY 2018
Year: 2018

Blockchain has emerged into one of the most promising technologies for the future. Its most successful implementation in the form of cryptocurrency has shifted many existing paradigms where financial instruments were limited by locations or jurisdictions. While blockchain is touted to offer many significant and promising features on the other hand it also increases the difficulty level in the taxation area as well as digital forensics. We investigated the issues and explores the real-world situation and how taxation and digital forensics can cope with these technology challenges.
Learning Sharing Behaviors with Arbitrary Numbers of Agents
Venue: arXiv cs.LG 2018
Year: 2018

We propose a method for modeling and learning turn-taking behaviors for accessing a shared resource. We model the individual behavior for each agent in an interaction and then use a multi-agent fusion model to generate a summary over the expected actions of the group to render the model independent of the number of agents. The individual behavior models are weighted finite state transducers (WFSTs) with weights dynamically updated during interactions, and the multi-agent fusion model is a logistic regression classifier. We test our models in a multi-agent tower-building environment, where a Q-learning agent learns to interact with rule-based agents. Our approach accurately models the underlying behavior patterns of the rule-based agents with accuracy ranging between 0.63 and 1.0 depending on the stochasticity of the other agent behaviors. In addition we show using KL-divergence that the model accurately captures the distribution of next actions when interacting with both a single agent (KL-divergence < 0.1) and with multiple agents (KL-divergence < 0.37). Finally, we demonstrate that our behavior model can be used by a Q-learning agent to take turns in an interactive turn-taking environment.
Optimal Structure Synthesis for Environment Augmenting Robots
Venue: arXiv cs.RO 2018
Year: 2018

Building structures can allow a robot to surmount large obstacles, expanding the set of areas it can reach. This paper presents a planning algorithm to automatically determine what structures a construction-capable robot must build in order to traverse its entire environment. Given an environment, a set of building blocks, and a robot capable of building structures, we seek a optimal set of structures (using a minimum number of building blocks) that could be built to make the entire environment traversable with respect to the robot's movement capabilities. We show that this problem is NP-Hard, and present a complete, optimal algorithm that solves it using a branch-and-bound strategy. The algorithm runs in exponential time in the worst case, but solves typical problems with practical speed. In hardware experiments, we show that the algorithm solves 3D maps of real indoor environments in about one minute, and that the structures selected by the algorithm allow a robot to traverse the entire environment. An accompanying video is available online at https://youtu.be/B9WM557NP44.
Privacy-preserving data aggregation in resource-constrained sensor nodes in Internet of Things: A review
Venue: arXiv cs.CR 2018
Year: 2018

Privacy problems are lethal and getting more attention than any other issue with the notion of the Internet of Things (IoT). Since IoT has many application areas including smart home, smart grids, smart healthcare system, smart and intelligent transportation and many more. Most of these applications are fueled by the resource-constrained sensor network, such as Smart healthcare system is powered by Wireless Body Area Network (WBAN) and Smart home and weather monitoring systems are fueled by Wireless Sensor Networks (WSN). In the mentioned application areas sensor node life is a very important aspect of these technologies as it explicitly effects the network life and performance. Data aggregation techniques are used to increase sensor node life by decreasing communication overhead. However, when the data is aggregated at intermediate nodes to reduce communication overhead, data privacy problems becomes more vulnerable. Different Privacy-Preserving Data Aggregation (PPDA) techniques have been proposed to ensure data privacy during data aggregation in resource-constrained sensor nodes. We provide a review and comparative analysis of the state of the art PPDA techniques in this paper. The comparative analysis is based on Computation Cost, Communication overhead, Privacy Level, resistance against malicious aggregator, sensor node life and energy consumption by the sensor node. We have studied the most recent techniques and provide in-depth analysis of the minute steps involved in these techniques. To the best of our knowledge, this survey is the most recent and comprehensive study of PPDA techniques.
Coarse-to-fine: A RNN-based hierarchical attention model for vehicle re-identification
Venue: arXiv cs.CV 2018
Year: 2018

Vehicle re-identification is an important problem and becomes desirable with the rapid expansion of applications in video surveillance and intelligent transportation. By recalling the identification process of human vision, we are aware that there exists a native hierarchical dependency when humans identify different vehicles. Specifically, humans always firstly determine one vehicle's coarse-grained category, i.e., the car model/type. Then, under the branch of the predicted car model/type, they are going to identify specific vehicles by relying on subtle visual cues, e.g., customized paintings and windshield stickers, at the fine-grained level. Inspired by the coarse-to-fine hierarchical process, we propose an end-to-end RNN-based Hierarchical Attention (RNN-HA) classification model for vehicle re-identification. RNN-HA consists of three mutually coupled modules: the first module generates image representations for vehicle images, the second hierarchical module models the aforementioned hierarchical dependent relationship, and the last attention module focuses on capturing the subtle visual information distinguishing specific vehicles from each other. By conducting comprehensive experiments on two vehicle re-identification benchmark datasets VeRi and VehicleID, we demonstrate that the proposed model achieves superior performance over state-of-the-art methods.
Deep Density-based Image Clustering
Venue: arXiv cs.LG 2018
Year: 2018

Recently, deep clustering, which is able to perform feature learning that favors clustering tasks via deep neural networks, has achieved remarkable performance in image clustering applications. However, the existing deep clustering algorithms generally need the number of clusters in advance, which is usually unknown in real-world tasks. In addition, the initial cluster centers in the learned feature space are generated by $k$-means. This only works well on spherical clusters and probably leads to unstable clustering results. In this paper, we propose a two-stage deep density-based image clustering (DDC) framework to address these issues. The first stage is to train a deep convolutional autoencoder (CAE) to extract low-dimensional feature representations from high-dimensional image data, and then apply t-SNE to further reduce the data to a 2-dimensional space favoring density-based clustering algorithms. The second stage is to apply the developed density-based clustering technique on the 2-dimensional embedded data to automatically recognize an appropriate number of clusters with arbitrary shapes. Concretely, a number of local clusters are generated to capture the local structures of clusters, and then are merged via their density relationship to form the final clustering result. Experiments demonstrate that the proposed DDC achieves comparable or even better clustering performance than state-of-the-art deep clustering methods, even though the number of clusters is not given.
Analytic heuristics for a fast DSC-MRI
Venue: arXiv cs.CV 2018
Year: 2018

In this paper we propose a deterministic approach for the reconstruction of Dynamic Susceptibility Contrast magnetic resonance imaging data and compare it with the compressed sensing solution existing in the literature for the same problem. Our study is based on the mathematical analysis of the problem, which is computationally intractable because of its non polynomial complexity, but suggests simple heuristics that perform quite well. We give results on real images and on artificial phantoms with added noise.
Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems
Venue: arXiv cs.DB 2018
Year: 2018

Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs) are arguably among the most fundamental tasks in Computer Science. They are classical NP-complete problems. Consequently, the search for tractable fragments of these problems has received a lot of research interest over the decades. This research has traditionally progressed along three orthogonal threads. a) Reformulating queries into simpler, equivalent, queries (semantic optimization) b) Bounding answer sizes based on structural properties of the query c) Decomposing the query in such a way that global consistency follows from local consistency. Much progress has been made by various works that connect two of these threads. Bounded answer sizes and decompositions have been shown to be tightly connected through the important notions of fractional hypertree width and, more recently, submodular width. recent papers by Barceló et al. study decompositions up to generalized hypertree width under semantic optimization. In this work, we connect all three of these threads by introducing a general notion of semantic width and investigating semantic versions of fractional hypertree width, adaptive width, submodular width and the fractional cover number.
Distributed Weight Balancing in Directed Topologies
Venue: arXiv cs.DC 2018
Year: 2018

This doctoral thesis concerns novel distributed algorithms for weight balancing over directed (communication) topologies. A directed topology (digraph) with nonnegative (or positive) weights assigned on each edge is weight-balanced if, for each node, the sum of the weights of in-coming edges equals the sum of the weights of out-going edges. The novel algorithms introduced in this thesis can facilitate the development of strategies for generating weight balanced digraphs, in a distributed manner, and find numerous applications in coordination and control of multi-component systems. In the first part of this thesis, we introduce a novel distributed algorithm that operates over a static topology and solves the weight balancing problem when the weights are restricted to be nonnegative integers. In the second part of the thesis, we present a novel distributed algorithm which solves the integer weight balancing problem in the presence of arbitrary (time-varying and inhomogeneous) delays that might affect the transmission at a particular link at a particular time. In the third part of this thesis, we present a novel distributed algorithm for obtaining admissible and balanced integer weights for the case when there are lower and upper weight constraints on the communication links. In the fourth part of this thesis we present a novel distributed algorithm which solves the integer weight balancing problem under lower and upper weight constraints over the communication links for the case where arbitrary (time-varying and inhomogeneous) time delays and possible packet drops affect the transmission at a particular link at a particular time.
Urban scaling of football followership on Twitter
Venue: arXiv cs.SI 2018
Year: 2018

Social sciences have an important challenge today to take advantage of new research opportunities provided by large amounts of data generated by online social networks. Because of its marketing value, sports clubs are also motivated in creating and maintaining a stable audience in social media. In this paper, we analyze followers of prominent footballs clubs on Twitter by obtaining their home locations. We then measure how city size is connected to the number of followers using the theory of urban scaling. The results show that the scaling exponents of club followers depend on the income of a country. These findings could be used to understand the structure and potential growth areas of global football audiences.
plasp 3: Towards Effective ASP Planning
Venue: arXiv cs.LO 2018
Year: 2018

We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by SAT planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
Dynamic Walking on Slippery Surfaces: Demonstrating Stable Bipedal Gaits with Planned Ground Slippage
Venue: arXiv cs.RO 2018
Year: 2018

Dynamic bipedal robot locomotion has achieved remarkable success due in part to recent advances in trajectory generation and nonlinear control for stabilization. A key assumption utilized in both theory and experiments is that the robot's stance foot always makes no-slip contact with the ground, including at impacts. This assumption breaks down on slippery low-friction surfaces, as commonly encountered in outdoor terrains, leading to failure and loss of stability. In this work, we extend the theoretical analysis and trajectory optimization to account for stick-slip transitions at point foot contact using Coulomb's friction law. Using AMBER-3M planar biped robot as an experimental platform, we demonstrate for the first time a slippery walking gait which can be stabilized successfully both on a lubricated surface and on a rough no-slip surface. We also study the influence of foot slippage on reducing the mechanical cost of transport, and compare energy efficiency in both numerical simulations and experimental measurements.
Anomaly Generation using Generative Adversarial Networks in Host Based Intrusion Detection
Venue: arXiv cs.LG 2018
Year: 2018

Generative adversarial networks have been able to generate striking results in various domains. This generation capability can be general while the networks gain deep understanding regarding the data distribution. In many domains, this data distribution consists of anomalies and normal data, with the anomalies commonly occurring relatively less, creating datasets that are imbalanced. The capabilities that generative adversarial networks offer can be leveraged to examine these anomalies and help alleviate the challenge that imbalanced datasets propose via creating synthetic anomalies. This anomaly generation can be specifically beneficial in domains that have costly data creation processes as well as inherently imbalanced datasets. One of the domains that fits this description is the host-based intrusion detection domain. In this work, ADFA-LD dataset is chosen as the dataset of interest containing system calls of small foot-print next generation attacks. The data is first converted into images, and then a Cycle-GAN is used to create images of anomalous data from images of normal data. The generated data is combined with the original dataset and is used to train a model to detect anomalies. By doing so, it is shown that the classification results are improved, with the AUC rising from 0.55 to 0.71, and the anomaly detection rate rising from 17.07% to 80.49%. The results are also compared to SMOTE, showing the potential presented by generative adversarial networks in anomaly generation.
Joint Computation Offloading and Resource Allocation in Cloud Based Wireless HetNets
Venue: arXiv cs.NI 2018
Year: 2018

In this paper, we study the joint computation offloading and resource allocation problem in the two-tier wireless heterogeneous network (HetNet). Our design aims to optimize the computation offloading to the cloud jointly with the subchannel allocation to minimize the maximum (min-max) weighted energy consumption subject to practical constraints on bandwidth, computing resource and allowable latency for the multi-user multitask computation system. To tackle this non-convex mixed integer non-linear problem (MINLP), we employ the bisection search method to solve it where we propose a novel approach to transform and verify the feasibility of the underlying problem in each iteration. In addition, we propose a low-complexity algorithm, which can decrease the number of binary optimization variables and enable more scalable computation offloading optimization in the practical wireless HetNets. Numerical studies confirm that the proposed design achieves the energy saving gains about 55% in comparison with the local computation scheme under the strict required latency of 0.1s.