OpenRaiser/Intern-Atlas huggingface dataset:
Sentiment Analysis by Joint Learning of Word Embeddings and Classifier
Venue: arXiv cs.CL 2017
Year: 2017

Word embeddings are representations of individual words of a text document in a vector space and they are often use- ful for performing natural language pro- cessing tasks. Current state of the art al- gorithms for learning word embeddings learn vector representations from large corpora of text documents in an unsu- pervised fashion. This paper introduces SWESA (Supervised Word Embeddings for Sentiment Analysis), an algorithm for sentiment analysis via word embeddings. SWESA leverages document label infor- mation to learn vector representations of words from a modest corpus of text doc- uments by solving an optimization prob- lem that minimizes a cost function with respect to both word embeddings as well as classification accuracy. Analysis re- veals that SWESA provides an efficient way of estimating the dimension of the word embeddings that are to be learned. Experiments on several real world data sets show that SWESA has superior per- formance when compared to previously suggested approaches to word embeddings and sentiment analysis tasks.
The basic principles and the structure and algorithmically software of computing by hypercomplex number
Venue: arXiv cs.MS 2017
Year: 2017

In article the basic principles put in a basis of algorithmicallysoftware of hypercomplex number calculations, structure of a software, structure of functional subsystems are considered. The most important procedures included in subsystems are considered, program listings and examples of their application are given.
Security for 4G and 5G Cellular Networks: A Survey of Existing Authentication and Privacy-preserving Schemes
Venue: arXiv cs.CR 2017
Year: 2017

This paper presents a comprehensive survey of existing authentication and privacy-preserving schemes for 4G and 5G cellular networks. We start by providing an overview of existing surveys that deal with 4G and 5G communications, applications, standardization, and security. Then, we give a classification of threat models in 4G and 5G cellular networks in four categories, including, attacks against privacy, attacks against integrity, attacks against availability, and attacks against authentication. We also provide a classification of countermeasures into three types of categories, including, cryptography methods, humans factors, and intrusion detection methods. The countermeasures and informal and formal security analysis techniques used by the authentication and privacy preserving schemes are summarized in form of tables. Based on the categorization of the authentication and privacy models, we classify these schemes in seven types, including, handover authentication with privacy, mutual authentication with privacy, RFID authentication with privacy, deniable authentication with privacy, authentication with mutual anonymity, authentication and key agreement with privacy, and three-factor authentication with privacy. In addition, we provide a taxonomy and comparison of authentication and privacy-preserving schemes for 4G and 5G cellular networks in form of tables. Based on the current survey, several recommendations for further research are discussed at the end of this paper.
uStash: a Novel Mobile Content Delivery System for Improving User QoE in Public Transport
Venue: arXiv cs.NI 2017
Year: 2017

Mobile data traffic is growing exponentially and it is even more challenging to distribute content efficiently while users are "on the move" such as in public transport.The use of mobile devices for accessing content (e.g. videos) while commuting are both expensive and unreliable, although it is becoming common practice worldwide. Leveraging on the spatial and temporal correlation of content popularity and users' diverse network connectivity, we propose a novel content distribution system, \textit{uStash}, which guarantees better QoE with regards to access delays and cost of usage. The proposed collaborative download and content stashing schemes provide the uStash provider the flexibility to control the cost of content access via cellular networks. We model the uStash system in a probabilistic framework and thereby analytically derive the optimal portions for collaborative downloading. Then, we validate the proposed models using real-life trace driven simulations. In particular, we use dataset from 22 inter-city buses running on 6 different routes and from a mobile VoD service provider to show that uStash reduces the cost of monthly cellular data by approximately 50\% and the expected delay for content access by 60\% compared to content downloaded via users' cellular network connections.
Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)
Venue: arXiv cs.GT 2017
Year: 2017

Routing games are amongst the most well studied domains of game theory. How relevant are these pen-and-paper calculations to understanding the reality of everyday traffic routing? We focus on a semantically rich dataset that captures detailed information about the daily behavior of thousands of Singaporean commuters and examine the following basic questions: (i) Does the traffic equilibrate? (ii) Is the system behavior consistent with latency minimizing agents? (iii) Is the resulting system efficient? In order to capture the efficiency of the traffic network in a way that agrees with our everyday intuition we introduce a new metric, the stress of catastrophe, which reflects the combined inefficiencies of both tragedy of the commons as well as price of anarchy effects.
The Complexity of Probabilistic Justification Logic
Venue: arXiv cs.LO 2017
Year: 2017

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in polynomial space. We show that this upper complexity bound is tight.
Divide and Fuse: A Re-ranking Approach for Person Re-identification
Venue: arXiv cs.CV 2017
Year: 2017

As re-ranking is a necessary procedure to boost person re-identification (re-ID) performance on large-scale datasets, the diversity of feature becomes crucial to person reID for its importance both on designing pedestrian descriptions and re-ranking based on feature fusion. However, in many circumstances, only one type of pedestrian feature is available. In this paper, we propose a "Divide and use" re-ranking framework for person re-ID. It exploits the diversity from different parts of a high-dimensional feature vector for fusion-based re-ranking, while no other features are accessible. Specifically, given an image, the extracted feature is divided into sub-features. Then the contextual information of each sub-feature is iteratively encoded into a new feature. Finally, the new features from the same image are fused into one vector for re-ranking. Experimental results on two person re-ID benchmarks demonstrate the effectiveness of the proposed framework. Especially, our method outperforms the state-of-the-art on the Market-1501 dataset.
Attacking Automatic Video Analysis Algorithms: A Case Study of Google Cloud Video Intelligence API
Venue: arXiv cs.MM 2017
Year: 2017

Due to the growth of video data on Internet, automatic video analysis has gained a lot of attention from academia as well as companies such as Facebook, Twitter and Google. In this paper, we examine the robustness of video analysis algorithms in adversarial settings. Specifically, we propose targeted attacks on two fundamental classes of video analysis algorithms, namely video classification and shot detection. We show that an adversary can subtly manipulate a video in such a way that a human observer would perceive the content of the original video, but the video analysis algorithm will return the adversary's desired outputs. We then apply the attacks on the recently released Google Cloud Video Intelligence API. The API takes a video file and returns the video labels (objects within the video), shot changes (scene changes within the video) and shot labels (description of video events over time). Through experiments, we show that the API generates video and shot labels by processing only the first frame of every second of the video. Hence, an adversary can deceive the API to output only her desired video and shot labels by periodically inserting an image into the video at the rate of one frame per second. We also show that the pattern of shot changes returned by the API can be mostly recovered by an algorithm that compares the histograms of consecutive frames. Based on our equivalent model, we develop a method for slightly modifying the video frames, in order to deceive the API into generating our desired pattern of shot changes. We perform extensive experiments with different videos and show that our attacks are consistently successful across videos with different characteristics. At the end, we propose introducing randomness to video analysis algorithms as a countermeasure to our attacks.
Cyber-Physical Interference Modeling for Predictable Reliability of Inter-Vehicle Communications
Venue: arXiv cs.DC 2017
Year: 2017

Predictable inter-vehicle communication reliability is a basis for the paradigm shift from the traditional singlevehicle-oriented safety and efficiency control to networked vehicle control. The lack of predictable interference control in existing mechanisms of inter-vehicle communications, however, makes them incapable of ensuring predictable communication reliability. For predictable interference control, we propose the Cyber-Physical Scheduling (CPS) framework that leverages the PRK interference model and addresses the challenges of vehicle mobility to PRK-based scheduling. In particular, CPS leverage physical locations of vehicles to define the gPRK interference model, a geometric approximation of the PRK model, for effective interference relation estimation, and CPS leverages cyber-physical structures of vehicle traffic flows (particularly, spatiotemporal interference correlation as well as macro- and micro-scopic vehicle dynamics) for effective use of the gPRK model. Through experimental analysis with high-fidelity ns-3 and SUMO simulation, we observe that CPS enables predictable reliability while achieving high throughput and low delay in communication. To the best of our knowledge, CPS is the first field deployable method that ensures predictable interference control and thus reliability in inter-vehicle communications.
Fluency-Guided Cross-Lingual Image Captioning
Venue: arXiv cs.CL 2017
Year: 2017

Image captioning has so far been explored mostly in English, as most available datasets are in this language. However, the application of image captioning should not be restricted by language. Only few studies have been conducted for image captioning in a cross-lingual setting. Different from these works that manually build a dataset for a target language, we aim to learn a cross-lingual captioning model fully from machine-translated sentences. To conquer the lack of fluency in the translated sentences, we propose in this paper a fluency-guided learning framework. The framework comprises a module to automatically estimate the fluency of the sentences and another module to utilize the estimated fluency scores to effectively train an image captioning model for the target language. As experiments on two bilingual (English-Chinese) datasets show, our approach improves both fluency and relevance of the generated captions in Chinese, but without using any manually written sentences from the target language.
Learning body-affordances to simplify action spaces
Venue: arXiv cs.AI 2017
Year: 2017

Controlling embodied agents with many actuated degrees of freedom is a challenging task. We propose a method that can discover and interpolate between context dependent high-level actions or body-affordances. These provide an abstract, low-dimensional interface indexing high-dimensional and time- extended action policies. Our method is related to recent ap- proaches in the machine learning literature but is conceptually simpler and easier to implement. More specifically our method requires the choice of a n-dimensional target sensor space that is endowed with a distance metric. The method then learns an also n-dimensional embedding of possibly reactive body-affordances that spread as far as possible throughout the target sensor space.
Shared Spectrum Access Communications: A Neutral Host Micro Operator Approach
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we conceive an advanced neutral host micro operator (NH-μO) network approach providing venues with services tailored to their specialized/specific requirements and/or local context related services that the mobile network operators (MNOs) are poorly-suited to providing it, as well as mobile broadband experience to the users from MNOs in a venue where only a single infrastructure is mandated under shared spectrum access framework. A radio access network slicing concept is conceived to support and optimize both the slice instance (SI) use cases independently and efficiently by running all network implementations in parallel, simultaneously on a common physical network infrastructure. We devise a common shared architecture for the NH-μO small cell base stations and dynamic spectrum assignment control unit, and their required functionalities supporting coexistence of different SIs as well as multiple MNOs in shared spectrum access communications. We devise both inter-SI and intra- SI dynamic spectrum allocation policies considering time-varying requirements of different SIs. The policies are capable of taking care of application level priority, -i.e., mixture of guaranteed quality of service and best-effort service users served by each SI while ensuring a healthy competition. Our proposed framework serves two-fold advantages, such as it gives the venue owner its own managed wireless networks tailored to its very specific requirements, and it also brings out cost savings and coverage extension for MNOs and efficiency of resources that arise from sharing wireless networks, and delivering the network capacity into high density venues.
Throughput Enhancement of Multicarrier Cognitive M2M Networks: Universal-Filtered OFDM Systems
Venue: arXiv cs.IT 2017
Year: 2017

We consider a cognitive radio network consisting of a primary cellular system and a secondary cognitive machine-to-machine (M2M) system, and study the throughput enhancement problem of the latter system employing universal-filtered orthogonal frequency division multiplexing (UF-OFDM) modulation. The downlink transmission capacity of the cognitive M2M system is thereby maximized, while keeping the interference introduced to the primary users (PUs) below the pre-specified threshold, under total transmit power budget of the secondary base station (SBS). The performance of UF-OFDM based CR system is compared to the performances of OFDM-based and filter bank multicarrier (FBMC)-based CR systems. We also propose a near-optimal resource allocation method separating the subband and power allocation. The solution is less complex compared to optimization of the original combinatorial problem. We present numerical results that show that for given interference thresholds of the PUs and maximum transmit power limit of the SBS, the UF-OFDM based CR system exhibits intermediary performance in terms of achievable capacity compared to OFDM and FBMC-based CR systems. Interestingly, for a certain degree of robustness of the PUs, the UF-OFDM performs equally well as FBMC. Furthermore, the percentage rate-gain of UF-OFDM based CR system increases by a large amount when UF-OFDM modulation with lower sidelobes ripple is employed. Numerical results also show that the proposed throughput enhancing method despite having lower computational complexity compared to the optimal solution achieves near-optimal performance.
An Exploratory Study of Health Habit Formation Through Gamification
Venue: arXiv cs.HC 2017
Year: 2017

Promotion of healthy habits help maintain and improve people health, reduce disease risks, and manage chronic illness. Regular healthy activities like walking, exercising, healthy eating, drinking water or taking medication on time require forming the new habits. Gamification techniques are promising in promoting healthy behaviors and delivering health promotion information. However, using gaming elements such as badges, leader boards, health-related challenges in mobile applications to motivate and engage people to change health behavior is quite new. In this exploratory study, we aimed to assess how game mechanics and dynamics influence formation of a habit through the mobile application. Results indicate the different level of user engagement depending on the presence of gamification elements and suggest that there is value in adding game elements to the user experience.
Distributed Weighted Sum-Rate Maximization in Multicell MU-MIMO OFDMA Downlink
Venue: arXiv cs.IT 2017
Year: 2017

This paper considers distributed linear beamforming in downlink multicell multiuser orthogonal frequency-division multiple access networks. A fast convergent solution maximizing the weighted sum- rate with per base station (BS) transmiting power constraint is formulated. We approximate the non- convex weighted sum-rate maximization (WSRM) problem with a semidefinite relaxed solvable convex form by means of a series of approximation based on interference alignment (IA) analysis. The WSRM optimization is a two-stage optimization process. In the first stage, the IA conditions are satisfied. In the second stage, the convex approximation of the non-convex WSRM is obtained based on the consequences of IA, and high signal-to-interference-plus-noise ratio assumption. Compared to the conventional iterative distributed algorithms where the BSs exchange additional information at each iteration, the BSs of our proposed solution optimize their beamformers locally without reporting additional information during the iterative procedure.
DesnowNet: Context-Aware Deep Network for Snow Removal
Venue: arXiv cs.CV 2017
Year: 2017

Existing learning-based atmospheric particle-removal approaches such as those used for rainy and hazy images are designed with strong assumptions regarding spatial frequency, trajectory, and translucency. However, the removal of snow particles is more complicated because it possess the additional attributes of particle size and shape, and these attributes may vary within a single image. Currently, hand-crafted features are still the mainstream for snow removal, making significant generalization difficult to achieve. In response, we have designed a multistage network codenamed DesnowNet to in turn deal with the removal of translucent and opaque snow particles. We also differentiate snow into attributes of translucency and chromatic aberration for accurate estimation. Moreover, our approach individually estimates residual complements of the snow-free images to recover details obscured by opaque snow. Additionally, a multi-scale design is utilized throughout the entire network to model the diversity of snow. As demonstrated in experimental results, our approach outperforms state-of-the-art learning-based atmospheric phenomena removal methods and one semantic segmentation baseline on the proposed Snow100K dataset in both qualitative and quantitative comparisons. The results indicate our network would benefit applications involving computer vision and graphics.
Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average
Venue: arXiv cs.DS 2017
Year: 2017

The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received significant attention recently. It is known how to approximately compute the $k$-sparse Fourier transform in $\approx k\log^2 n$ time [Hassanieh et al'STOC'12], or using the optimal number $O(k\log n)$ of samples [Indyk et al'FOCS'14] in time domain, or come within $(\log\log n)^{O(1)}$ factors of both these bounds simultaneously, but no algorithm achieving the optimal $O(k\log n)$ bound in sublinear time is known. In this paper we propose a new technique for analysing noisy hashing schemes that arise in Sparse FFT, which we refer to as isolation on average. We apply this technique to two problems in Sparse FFT: estimating the values of a list of frequencies using few samples and computing Sparse FFT itself, achieving sample-optimal results in $k\log^{O(1)} n$ time for both. We feel that our approach will likely be of interest in designing Fourier sampling schemes for more general settings (e.g. model based Sparse FFT).
A Machine Learning Based Intrusion Detection System for Software Defined 5G Network
Venue: arXiv cs.CR 2017
Year: 2017

As an inevitable trend of future 5G networks, Software Defined architecture has many advantages in providing central- ized control and flexible resource management. But it is also confronted with various security challenges and potential threats with emerging services and technologies. As the focus of network security, Intrusion Detection Systems (IDS) are usually deployed separately without collaboration. They are also unable to detect novel attacks with limited intelligent abilities, which are hard to meet the needs of software defined 5G. In this paper, we propose an intelligent intrusion system taking the advances of software defined technology and artificial intelligence based on Software Defined 5G architecture. It flexibly combines security function mod- ules which are adaptively invoked under centralized management and control with a globle view. It can also deal with unknown intrusions by using machine learning algorithms. Evaluation results prove that the intelligent intrusion detection system achieves a better performance.
Optimizing Google Shopping Campaigns Structures With Query-Level Matching
Venue: arXiv cs.OH 2017
Year: 2017

How to bid on a Google shopping account (set of shopping campaigns) with query-level matching like in Google Adwords.
Automatic Summarization of Online Debates
Venue: arXiv cs.CL 2017
Year: 2017

Debate summarization is one of the novel and challenging research areas in automatic text summarization which has been largely unexplored. In this paper, we develop a debate summarization pipeline to summarize key topics which are discussed or argued in the two opposing sides of online debates. We view that the generation of debate summaries can be achieved by clustering, cluster labeling, and visualization. In our work, we investigate two different clustering approaches for the generation of the summaries. In the first approach, we generate the summaries by applying purely term-based clustering and cluster labeling. The second approach makes use of X-means for clustering and Mutual Information for labeling the clusters. Both approaches are driven by ontologies. We visualize the results using bar charts. We think that our results are a smooth entry for users aiming to receive the first impression about what is discussed within a debate topic containing waste number of argumentations.