OpenRaiser/Intern-Atlas huggingface dataset:
Efficient Three-stage Auction Schemes for Cloudlets Deployment in Wireless Access Network
Venue: arXiv cs.NI 2018
Year: 2018

Cloudlet deployment and resource allocation for mobile users (MUs) have been extensively studied in existing works for computation resource scarcity. However, most of them failed to jointly consider the two techniques together, and the selfishness of cloudlet and access point (AP) are ignored. Inspired by the group-buying mechanism, this paper proposes three-stage auction schemes by combining cloudlet placement and resource assignment, to improve the social welfare subject to the economic properties. We first divide all MUs into some small groups according to the associated APs. Then the MUs in same group can trade with cloudlets in a group-buying way through the APs. Finally, the MUs pay for the cloudlets if they are the winners in the auction scheme. We prove that our auction schemes can work in polynomial time. We also provide the proofs for economic properties in theory. For the purpose of performance comparison, we compare the proposed schemes with HAF, which is a centralized cloudlet placement scheme without auction. Numerical results confirm the correctness and efficiency of the proposed schemes.
Community structure detection and evaluation during the pre- and post-ictal hippocampal depth recordings
Venue: arXiv cs.SI 2018
Year: 2018

Detecting and evaluating regions of brain under various circumstances is one of the most interesting topics in computational neuroscience. However, the majority of the studies on detecting communities of a functional connectivity network of the brain is done on networks obtained from coherency attributes, and not from correlation. This lack of studies, in part, is due to the fact that many common methods for clustering graphs require the nodes of the network to be `positively' linked together, a property that is guaranteed by a coherency matrix, by definition. However, correlation matrices reveal more information regarding how each pair of nodes are linked together. In this study, for the first time we simultaneously examine four inherently different network clustering methods (spectral, heuristic, and optimization methods) applied to the functional connectivity networks of the CA1 region of the hippocampus of an anaesthetized rat during pre-ictal and post-ictal states. The networks are obtained from correlation matrices, and its results are compared with the ones obtained by applying the same methods to coherency matrices. The correlation matrices show a much finer community structure compared to the coherency matrices. Furthermore, we examine the potential smoothing effect of choosing various window sizes for computing the correlation/coherency matrices.
A Bayesian Model for False Information Belief Impact, Optimal Design, and Fake News Containment
Venue: arXiv cs.SI 2018
Year: 2018

This work is a technical approach to modeling false information nature, design, belief impact and containment in multi-agent networks. We present a Bayesian mathematical model for source information and viewer's belief, and how the former impacts the latter in a media (network) of broadcasters and viewers. Given the proposed model, we study how a particular information (true or false) can be optimally designed into a report, so that on average it conveys the most amount of the original intended information to the viewers of the network. Consequently, the model allows us to study susceptibility of a particular group of viewers to false information, as a function of statistical metrics of the their prior beliefs (e.g. bias, hesitation, open-mindedness, credibility assessment etc.). In addition, based on the same model we can study false information "containment" strategies imposed by network administrators. Specifically, we study a credibility assessment strategy, where every disseminated report must be within a certain distance of the truth. We study the trade-off between false and true information-belief convergence using this scheme which leads to ways for optimally deciding how truth sensitive an information dissemination network should operate.
Focused Crawl of Web Archives to Build Event Collections
Venue: arXiv cs.DL 2018
Year: 2018

Event collections are frequently built by crawling the live web on the basis of seed URIs nominated by human experts. Focused web crawling is a technique where the crawler is guided by reference content pertaining to the event. Given the dynamic nature of the web and the pace with which topics evolve, the timing of the crawl is a concern for both approaches. We investigate the feasibility of performing focused crawls on the archived web. By utilizing the Memento infrastructure, we obtain resources from 22 web archives that contribute to building event collections. We create collections on four events and compare the relevance of their resources to collections built from crawling the live web as well as from a manually curated collection. Our results show that focused crawling on the archived web can be done and indeed results in highly relevant collections, especially for events that happened further in the past.
A high-performance virtual machine filesystem monitor in cloud-assisted cognitive IoT
Venue: arXiv cs.CR 2018
Year: 2018

Cloud-assisted Cognitive Internet of Things has powerful data analytics abilities based on the computing and data storage capabilities of cloud virtual machines, which makes protecting virtual machine filesystem very important for the whole system security. Agentless periodic filesystem monitors are optimal solutions to protect cloud virtual machines because of the secure and low-overhead features. However, most of the periodic monitors usually scan all of the virtual machine filesystem or protected files in every scanning poll, so lots of secure files are scanned again and again even though they are not corrupted. In this paper, we propose a novel agentless periodic filesystem monitor framework for virtual machines with different image formats to improve the performance of agentless periodic monitors. Our core idea is to minimize the scope of the scanning files in both file integrity checking and virus detection. In our monitor, if a file is considered secure, it will not be scanned when it has not been modified. Since our monitor only scans the newly created and modified files, it can check fewer files than other filesystem monitors. To that end, we propose two monitor methods for different types of virtual machine disks to reduce the number of scanning files. For virtual machine with single disk image, we hook the backend driver to capture the disk modification information. For virtual machine with multiple copy-onwrite images, we leverage the copy-on-write feature of QCOW2 images to achieve the disk modification analysis. In addition, our system can restore and remove the corrupted files. The experimental results show that our system is effective for both Windows and Linux virtual machines with different image formats and can reduce the number of scanning files and scanning time.
Discovering Communities of Malapps on Android-based Mobile Cyber-physical Systems
Venue: arXiv cs.CR 2018
Year: 2018

Android-based devices like smartphones have become ideal mobile cyber-physical systems (MCPS) due to their powerful processors and variety of sensors. In recent years, an explosively and continuously growing number of malicious applications (malapps) have posed a great threat to Android-based MCPS as well as users' privacy. The effective detection of malapps is an emerging yet crucial task. How to establish relationships among malapps, discover their potential communities, and explore their evolution process has become a challenging issue in effective detection of malapps. To deal with this issue, in this work, we are motivated to propose an automated community detection method for Android malapps by building a relation graph based on their static features. First, we construct a large feature set to profile the behaviors of malapps. Second, we propose an E-N algorithm by combining epsilon graph and k-nearest neighbor (k-NN) graph for graph construction. It solves the problem of an incomplete graph led by epsilon method and the problem of noise generated by k-NN graph. Finally, a community detection method, Infomap, is employed to explore the underlying structures of the relation graph, and obtain the communities of malapps. We evaluate our community detection method with 3996 malapp samples. Extensive experimental results show that our method outperforms the traditional clustering methods and achieves the best performance with rand statistic of 94.93% and accuracy of 79.53%.
Towards Massive Connectivity Support for Scalable mMTC Communications in 5G networks
Venue: arXiv cs.IT 2018
Year: 2018

The fifth generation of cellular communication systems is foreseen to enable a multitude of new applications and use cases with very different requirements. A new 5G multiservice air interface needs to enhance broadband performance as well as provide new levels of reliability, latency and supported number of users. In this paper we focus on the massive Machine Type Communications (mMTC) service within a multi-service air interface. Specifically, we present an overview of different physical and medium access techniques to address the problem of a massive number of access attempts in mMTC and discuss the protocol performance of these solutions in a common evaluation framework.
Spatially coupled turbo-like codes: a new trade-off between waterfall and error floor
Venue: arXiv cs.IT 2018
Year: 2018

Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate performance (BER) in the waterfall region. In this paper, we discuss the effect of spatial coupling on the performance of TCs in the finite block-length regime. We investigate the effect of coupling on the error-floor performance of SC-TCs by establishing conditions under which spatial coupling either preserves or improves the minimum distance of TCs. This allows us to investigate the error-floor performance of SC-TCs by performing a weight enumerator function (WEF) analysis of the corresponding uncoupled ensembles. While uncoupled TC ensembles with close-to-capacity performance exhibit a high error floor, our results show that SC-TCs can simultaneously approach capacity and achieve very low error floor.
Observation-driven scheduling for remote estimation of two Gaussian sources
Venue: arXiv cs.SY 2018
Year: 2018

Joint estimation and scheduling for sensor networks is considered in a system formed by two sensors, a scheduler and a remote estimator. Each sensor observes a Gaussian source, which may be correlated. The scheduler observes the output of both sensors and chooses which of the two is revealed to the remote estimator. The goal is to jointly design scheduling and estimation policies that minimize a mean-squared estimation error criterion. The person-by-person optimality of a policy pair called "max-scheduling/mean-estimation" is established, where the measurement with the largest absolute value is revealed to the estimator, which uses a corresponding conditional mean operator. This result is obtained for independent sources, and in the case of correlated sources and symmetric variances. We also consider the joint design of scheduling and linear estimation policies for two correlated Gaussian sources with an arbitrary correlation structure. In this case, the optimization problem can be cast a difference-of-convex program, and locally optimal solutions can be efficiently found using a simple numerical procedure.
Multi-level Activation for Segmentation of Hierarchically-nested Classes
Venue: arXiv cs.CV 2018
Year: 2018

For many biological image segmentation tasks, including topological knowledge, such as the nesting of classes, can greatly improve results. However, most `out-of-the-box' CNN models are still blind to such prior information. In this paper, we propose a novel approach to encode this information, through a multi-level activation layer and three compatible losses. We benchmark all of them on nuclei segmentation in bright-field microscopy cell images from the 2018 Data Science Bowl challenge, offering an exemplary segmentation task with cells and nested subcellular structures. Our scheme greatly speeds up learning, and outperforms standard multi-class classification with soft-max activation and a previously proposed method stemming from it, improving the Dice score significantly (p-values<0.007). Our approach is conceptually simple, easy to implement and can be integrated in any CNN architecture. It can be generalized to a higher number of classes, with or without further relations of containment.
Scalable Magnetic Field SLAM in 3D Using Gaussian Process Maps
Venue: arXiv cs.RO 2018
Year: 2018

We present a method for scalable and fully 3D magnetic field simultaneous localisation and mapping (SLAM) using local anomalies in the magnetic field as a source of position information. These anomalies are due to the presence of ferromagnetic material in the structure of buildings and in objects such as furniture. We represent the magnetic field map using a Gaussian process model and take well-known physical properties of the magnetic field into account. We build local maps using three-dimensional hexagonal block tiling. To make our approach computationally tractable we use reduced-rank Gaussian process regression in combination with a Rao-Blackwellised particle filter. We show that it is possible to obtain accurate position and orientation estimates using measurements from a smartphone, and that our approach provides a scalable magnetic field SLAM algorithm in terms of both computational complexity and map storage.
On Undetected Redundancy in the Burrows-Wheeler Transform
Venue: arXiv cs.DS 2018
Year: 2018

The Burrows-Wheeler-Transform (BWT) is an invertible permutation of a text known to be highly compressible but also useful for sequence analysis, what makes the BWT highly attractive for lossless data compression. In this paper, we present a new technique to reduce the size of a BWT using its combinatorial properties, while keeping it invertible. The technique can be applied to any BWT-based compressor, and, as experiments show, is able to reduce the encoding size by 8-16 % on average and up to 33-57 % in the best cases (depending on the BWT-compressor used), making BWT-based compressors competitive or even superior to today's best lossless compressors.
Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Model
Venue: arXiv cs.LG 2018
Year: 2018

In this paper we study generative modeling via autoencoders while using the elegant geometric properties of the optimal transport (OT) problem and the Wasserstein distances. We introduce Sliced-Wasserstein Autoencoders (SWAE), which are generative models that enable one to shape the distribution of the latent space into any samplable probability distribution without the need for training an adversarial network or defining a closed-form for the distribution. In short, we regularize the autoencoder loss with the sliced-Wasserstein distance between the distribution of the encoded training samples and a predefined samplable distribution. We show that the proposed formulation has an efficient numerical solution that provides similar capabilities to Wasserstein Autoencoders (WAE) and Variational Autoencoders (VAE), while benefiting from an embarrassingly simple implementation.
Few-Shot Text Classification with Pre-Trained Word Embeddings and a Human in the Loop
Venue: arXiv cs.CL 2018
Year: 2018

Most of the literature around text classification treats it as a supervised learning problem: given a corpus of labeled documents, train a classifier such that it can accurately predict the classes of unseen documents. In industry, however, it is not uncommon for a business to have entire corpora of documents where few or none have been classified, or where existing classifications have become meaningless. With web content, for example, poor taxonomy management can result in labels being applied indiscriminately, making filtering by these labels unhelpful. Our work aims to make it possible to classify an entire corpus of unlabeled documents using a human-in-the-loop approach, where the content owner manually classifies just one or two documents per category and the rest can be automatically classified. This "few-shot" learning approach requires rich representations of the documents such that those that have been manually labeled can be treated as prototypes, and automatic classification of the rest is a simple case of measuring the distance to prototypes. This approach uses pre-trained word embeddings, where documents are represented using a simple weighted average of constituent word embeddings. We have tested the accuracy of the approach on existing labeled datasets and provide the results here. We have also made code available for reproducing the results we got on the 20 Newsgroups dataset.
Visual augmentation of source code editors: A systematic mapping study
Venue: arXiv cs.SE 2018
Year: 2018

Source code written in textual programming languages is typically edited in integrated development environments or specialized code editors. These tools often display various visual items, such as icons, color highlights or more advanced graphical overlays directly in the main editable source code view. We call such visualizations source code editor augmentation. In this paper, we present a first systematic mapping study of source code editor augmentation tools and approaches. We manually reviewed the metadata of 5,553 articles published during the last twenty years in two phases -- keyword search and references search. The result is a list of 103 relevant articles and a taxonomy of source code editor augmentation tools with seven dimensions, which we used to categorize the resulting list of the surveyed articles. We also provide the definition of the term source code editor augmentation, along with a brief overview of historical development and augmentations available in current industrial IDEs.
Optimal Placement of a UAV to Maximize the Lifetime of Wireless Devices
Venue: arXiv cs.IT 2018
Year: 2018

Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks go down. Prior studies on UAV-based wireless coverage typically consider downlink scenarios from an aerial base station to ground users. In this paper, we consider an uplink scenario under disaster situations (such as earthquakes or floods), when cellular networks are down. We formulate the problem of optimal UAV placement, where the objective is to determine the placement of a single UAV such that the sum of time durations of uplink transmissions is maximized. We prove that the constraint sets of problem can be represented by the intersection of half spheres and the region formed by this intersection is a convex set in terms of two variables. This proof enables us to transform our problem to an optimization problem with two variables. We also prove that the objective function of the transformed problem is a concave function under a restriction on the minimum altitude of the UAV and propose a gradient projection-based algorithm to find the optimal location of the UAV. We validate the analysis by simulations and demonstrate the effectiveness of the proposed algorithm under different cases.
An Energy-Efficient Framework for the Analysis of MIMO Slow Fading Channels
Venue: arXiv cs.NI 2018
Year: 2018

In this work, a new energy-efficiency performance metric is proposed for MIMO (multiple input multiple output) point-to-point systems. In contrast with related works on energy-efficiency, this metric translates the effects of using finite blocks for transmitting, using channel estimates at the transmitter and receiver, and considering the total power consumed by the transmitter instead of the radiated power only. The main objective pursued is to choose the best pre-coding matrix used at the transmitter in the following two scenarios~: 1) the one where imperfect channel state information (CSI) is available at the transmitter and receiver~; 2) the one where no CSI is available at the transmitter. In both scenarios, the problem of optimally tuning the total used power is shown to be non-trivial. In scenario 2), the optimal fraction of training time can be characterized by a simple equation. These results and others provided in the paper, along with the provided numerical analysis, show that the present work can therefore be used as a good basis for studying power control and resource allocation in energy-efficient multiuser networks.
Comparison of frequency estimation methods for wave energy control
Venue: arXiv cs.SY 2018
Year: 2018

A number of wave energy controllers tune the power take-off (PTO) system to the frequency of incident waves. Since real ocean waves are non-stationary by nature and not defined by a single frequency component, the PTO can be either tuned at a constant frequency characterized by the local spectrum, or continuously tuned to a representative wave frequency. In either case, a time-frequency representation of the waves is expected since the wave profile changes over time. This paper discusses about the PTO tuning problem for passive and reactive controllers, in real waves, by comparing different methods for time-varying frequency estimation: the extended Kalman filter (EKF), frequency-locked loop (FLL), and Hilbert-Huang transform (HHT). The aim is to verify the impact of such methods on the absorbed and reactive powers, and the PTO rating. It is shown that the mean estimated frequency of the EKF, and FLL, converges respectively to the mean centroid frequency, and energy frequency, of the excitation force spectrum. Moreover, the HHT mean frequency has no correlation with the spectral statistical properties. A comparison of the energy absorbed shows that up to 37% more energy is obtained with the HHT over the other estimation methods. Numerical simulations are performed with sea elevation data from the Irish coast.
This One Simple Trick Disrupts Digital Communities
Venue: arXiv cs.MA 2018
Year: 2018

This paper describes an agent based simulation used to model human actions in belief space, a high-dimensional subset of information space associated with opinions. Using insights from animal collective behavior, we are able to simulate and identify behavior patterns that are similar to nomadic, flocking and stampeding patterns of animal groups. These behaviors have analogous manifestations in human interaction, emerging as solitary explorers, the fashion-conscious, and members of polarized echo chambers. We demonstrate that a small portion of nomadic agents that widely traverse belief space can disrupt a larger population of stampeding agents. Extending the model, we introduce the concept of Adversarial Herding, where bad actors can exploit properties of technologically mediated communication to artificially create self sustaining runaway polarization. We call this condition the Pishkin Effect as it recalls the large scale buffalo stampedes that could be created by native Americans hunters. We then discuss opportunities for system design that could leverage the ability to recognize these negative patterns, and discuss affordances that may disrupt the formation of natural and deliberate echo chambers.