OpenRaiser/Intern-Atlas huggingface dataset:
"Let me convince you to buy my product ... ": A Case Study of an Automated Persuasive System for Fashion Products
Venue: arXiv cs.AI 2017
Year: 2017

Persuasivenes is a creative art aimed at making people believe in certain set of beliefs. Many a times, such creativity is about adapting richness of one domain into another to strike a chord with the target audience. In this research, we present PersuAIDE! - A persuasive system based on linguistic creativity to transform given sentence to generate various forms of persuading sentences. These various forms cover multiple focus of persuasion such as memorability and sentiment. For a given simple product line, the algorithm is composed of several steps including: (i) select an appropriate well-known expression for the target domain to add memorability, (ii) identify keywords and entities in the given sentence and expression and transform it to produce creative persuading sentence, and (iii) adding positive or negative sentiment for further persuasion. The persuasive conversion were manually verified using qualitative results and the effectiveness of the proposed approach is empirically discussed.
Agile Software Development Methods: Review and Analysis
Venue: arXiv cs.SE 2017
Year: 2017

Agile - denoting "the quality of being agile, readiness for motion, nimbleness, activity, dexterity in motion" - software development methods are attempting to offer an answer to the eager business community asking for lighter weight along with faster and nimbler software development processes. This is especially the case with the rapidly growing and volatile Internet software industry as well as for the emerging mobile application environment. The new agile methods have evoked substantial amount of literature and debates. However, academic research on the subject is still scarce, as most of existing publications are written by practitioners or consultants. The aim of this publication is to begin filling this gap by systematically reviewing the existing literature on agile software development methodologies. This publication has three purposes. First, it proposes a definition and a classification of agile software development approaches. Second, it analyses ten software development methods that can be characterized as being "agile" against the defined criterion. Third, it compares these methods and highlights their similarities and differences. Based on this analysis, future research needs are identified and discussed.
Crowdsourced correlation clustering with relative distance comparisons
Venue: arXiv cs.DS 2017
Year: 2017

Crowdsourced, or human computation based clustering algorithms usually rely on relative distance comparisons, as these are easier to elicit from human workers than absolute distance information. A relative distance comparison is a statement of the form "item A is closer to item B than to item C". However, many existing clustering algorithms that use relative distances are rather complex. They are often based on a two-step approach, where the relative distances are first used to learn either a distance matrix, or an embedding of the items, and then some standard clustering method is applied in a second step. In this paper we argue that it should be possible to compute a clustering directly from relative distance comparisons. Our ideas are built upon existing work on correlation clustering, a well-known non-parametric approach to clustering. The technical contribution of this work is twofold. We first define a novel variant of correlation clustering that is based on relative distance comparisons, and hence suitable for human computation. We go on to show that our new problem is closely related to basic correlation clustering, and use this property to design an approximation algorithm for our problem. As a second contribution, we propose a more practical algorithm, which we empirically compare against existing methods from literature. Experiments with synthetic data suggest that our approach can outperform more complex methods. Also, our method efficiently finds good and intuitive clusterings from real relative distance comparison data.
A Methodology for the Selection of Requirement Elicitation Techniques
Venue: arXiv cs.SE 2017
Year: 2017

In this paper, we present an approach to select a subset of requirement elicitation technique for an optimum result in the requirement elicitation process. Our approach consists of three steps. First, we identify various attribute in three important dimensions namely project, people and the process of software development that can influence the outcome of an elicitation process. Second, we construct three p matrix (3PM) separately for each dimension, that shows a relation between the elicitation techniques and three dimensions of a software. Third, we provide a mapping criteria and use them in the selection of a subset of elicitation techniques. We demonstrate the applicability of the proposed approach using case studies to evaluate and provide the contextual knowledge of selecting requirement elicitation technique.
Key Management and Learning based Two Level Data Security for Metering Infrastructure of Smart Grid
Venue: arXiv cs.MA 2017
Year: 2017

In the smart grid, smart meters, and numerous control and monitoring applications employ bidirectional wireless communication, where security is a critical issue. In key management based encryption method for the smart grid, the Trusted Third Party (TTP), and links between the smart meter and the third party are assumed to be fully trusted and reliable. However, in wired/wireless medium, a man-in-middle may want to interfere, monitor and control the network, thus exposing its vulnerability. Acknowledging this, in this paper, we propose a novel two level encryption method based on two partially trusted simple servers (constitutes the TTP) which implement this method without increasing packet overhead. One server is responsible for data encryption between the meter and control center/central database, and the other server manages the random sequence of data transmission. Numerical calculation shows that the number of iterations required to decode a message is large which is quite impractical. Furthermore, we introduce One-class support vector machine (machine learning) algorithm for node-to-node authentication utilizing the location information and the data transmission history (node identity, packet size and frequency of transmission). This secures data communication privacy without increasing the complexity of the conventional key management scheme.
Designing a Framework for Smart IoT Adaptations
Venue: arXiv cs.SE 2017
Year: 2017

The Internet of Things (IoT) is the science of connecting multiple devices that coordinate to provide the service in question. IoT environments are complex, dynamic, rapidly changing and resource constrained. Therefore, proactively adapting devices to align with context fluctuations becomes a concern. To propose suitable configurations, it should be possible to sense information from devices, analyze the data and reconfigure them accordingly. Applied in the service of the environment, a fleet of devices can monitor environment indicators and control it in order to propose best fit solutions or prevent risks like over consumption of resources (e.g., water and energy). This paper describes our methodology in designing a framework for the monitoring and multi-instantiation of fleets of connected objects. First by identifying the particularities of the fleet, then by specifying connected object as a Dynamic Software Product Line (DSPL), capable of readjusting while running.
Evolutionary Acyclic Graph Partitioning
Venue: arXiv cs.DS 2017
Year: 2017

Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor architectures. However due to resource restrictions, an acyclicity constraint on the partition is necessary when mapping streaming applications to an embedded multiprocessor. Here, we contribute a multi-level algorithm for the acyclic graph partitioning problem. Based on this, we engineer an evolutionary algorithm to further reduce communication cost, as well as to improve load balancing and the scheduling makespan on embedded multiprocessor architectures.
Muon Trigger for Mobile Phones
Venue: arXiv cs.CV 2017
Year: 2017

The CRAYFIS experiment proposes to use privately owned mobile phones as a ground detector array for Ultra High Energy Cosmic Rays. Upon interacting with Earth's atmosphere, these events produce extensive particle showers which can be detected by cameras on mobile phones. A typical shower contains minimally-ionizing particles such as muons. As these particles interact with CMOS image sensors, they may leave tracks of faintly-activated pixels that are sometimes hard to distinguish from random detector noise. Triggers that rely on the presence of very bright pixels within an image frame are not efficient in this case. We present a trigger algorithm based on Convolutional Neural Networks which selects images containing such tracks and are evaluated in a lazy manner: the response of each successive layer is computed only if activation of the current layer satisfies a continuation criterion. Usage of neural networks increases the sensitivity considerably comparable with image thresholding, while the lazy evaluation allows for execution of the trigger under the limited computational power of mobile phones.
Camera-Aware Multi-Resolution Analysis (CAMRA) for Raw Sensor Data Compression
Venue: arXiv cs.CV 2017
Year: 2017

We propose a novel lossless and lossy compression scheme for color filter array~(CFA) sampled images based on the wavelet transform of them. Our analysis suggests that the wavelet coefficients of HL and LH subbands are highly correlated. Hence, we decorrelate Mallat wavelet packet decomposition to further sparsify the coefficients. In addition, we develop a camera processing pipeline for compressing CFA sampled images aimed at maximizing the quality of the color images constructed from the compressed CFA sampled images. We validated our theoretical analysis and the performance of the proposed compression scheme using images of natural scenes captured in a raw format. The experimental results verify that our proposed method improves coding efficiency relative to the standard and the state-of-the-art compression schemes CFA sampled images.
Automated Behavioral Analysis of Malware A Case Study of WannaCry Ransomware
Venue: arXiv cs.CR 2017
Year: 2017

Ransomware, a class of self-propagating malware that uses encryption to hold the victims' data ransom, has emerged in recent years as one of the most dangerous cyber threats, with widespread damage; e.g., zero-day ransomware WannaCry has caused world-wide catastrophe, from knocking U.K. National Health Service hospitals offline to shutting down a Honda Motor Company in Japan[1]. Our close collaboration with security operations of large enterprises reveals that defense against ransomware relies on tedious analysis from high-volume systems logs of the first few infections. Sandbox analysis of freshly captured malware is also commonplace in operation. We introduce a method to identify and rank the most discriminating ransomware features from a set of ambient (non-attack) system logs and at least one log stream containing both ambient and ransomware behavior. These ranked features reveal a set of malware actions that are produced automatically from system logs, and can help automate tedious manual analysis. We test our approach using WannaCry and two polymorphic samples by producing logs with Cuckoo Sandbox during both ambient, and ambient plus ransomware executions. Our goal is to extract the features of the malware from the logs with only knowledge that malware was present. We compare outputs with a detailed analysis of WannaCry allowing validation of the algorithm's feature extraction and provide analysis of the method's robustness to variations of input data\textemdash changing quality/quantity of ambient data and testing polymorphic ransomware. Most notably, our patterns are accurate and unwavering when generated from polymorphic WannaCry copies, on which 63 (of 63 tested) anti-virus (AV) products fail.
Exploiting Dual Connectivity in Heterogeneous Cellular Networks
Venue: arXiv cs.NI 2017
Year: 2017

We consider network utility maximization problems over heterogeneous cellular networks (HetNets) that permit dual connectivity. Dual connectivity (DC) is a feature that targets emerging practical HetNet deployments that will comprise of non-ideal (higher latency) connections between transmission nodes, and has been recently introduced to the LTE-Advanced standard. DC allows for a user to be simultaneously served by a macro node as well as one other (typically micro or pico) node and requires relatively coarser level coordination among serving nodes. For such a DC enabled HetNet we comprehensively analyze the problem of determining an optimal user association, where in any feasible association each user can be associated with (i.e., configured to receive data from) any one macro node (in a given set of macro nodes) and any one pico node that lies in the chosen macro node's coverage area. We consider the weighted sum rate system utility subject to per-user maximum and minimum rate constraints, as well as the proportional fairness (PF) system utility. For both utility choices we construct approximation algorithms and establish their respective approximation guarantees. We then validate the performance of our algorithms via numerical results.
Ultra-Dense HetNets Meet Big Data: Green Frameworks, Techniques, and Approaches
Venue: arXiv cs.IT 2017
Year: 2017

Ultra-dense heterogeneous networks (Ud-HetNets) have been put forward to improve the network capacity for next-generation wireless networks. However, counter to the 5G vision, ultra-dense deployment of networks would significantly increase energy consumption and thus decrease network energy efficiency suffering from the conventional worst-case network design philosophy. This problem becomes particularly severe when Ud-HetNets meet big data because of the traditional reactive request-transmit service mode. In view of these, this article first develops a big-data-aware artificial intelligent based framework for energy-efficient operations of Ud-HetNets. Based on the framework, we then identify four promising techniques, namely big data analysis, adaptive base station operation, proactive caching, and interference-aware resource allocation, to reduce energy cost on both large and small scales. We further develop a load-aware stochastic optimization approach to show the potential of our proposed framework and techniques in energy conservation. In a nutshell, we devote to constructing green Ud-HetNets of big data with the abilities of learning and inferring by improving the flexibility of control from worst-case to adaptive design and shifting the manner of services from reactive to proactive modes.
Polysemy Detection in Distributed Representation of Word Sense
Venue: arXiv cs.DS 2017
Year: 2017

In this paper, we propose a statistical test to determine whether a given word is used as a polysemic word or not. The statistic of the word in this test roughly corresponds to the fluctuation in the senses of the neighboring words a nd the word itself. Even though the sense of a word corresponds to a single vector, we discuss how polysemy of the words affects the position of vectors. Finally, we also explain the method to detect this effect.
Networks of Music Groups as Success Predictors
Venue: arXiv cs.SI 2017
Year: 2017

More than 4,600 non-academic music groups emerged in the USSR and post-Soviet independent nations in 1960--2015, performing in 275 genres. Some of the groups became legends and survived for decades, while others vanished and are known now only to select music history scholars. We built a network of the groups based on sharing at least one performer. We discovered that major network measures serve as reasonably accurate predictors of the groups' success. The proposed network-based success exploration and prediction methods are transferable to other areas of arts and humanities that have medium- or long-term team-based collaborations.
A Comparison of Hybrid Beamforming and Digital Beamforming with Low-Resolution ADCs for Multiple Users and Imperfect CSI
Venue: arXiv cs.IT 2017
Year: 2017

For 5G it will be important to leverage the available millimeter wave spectrum. To achieve an approximately omni- directional coverage with a similar effective antenna aperture compared to state of the art cellular systems, an antenna array is required at both the mobile and basestation. Due to the large bandwidth and inefficient amplifiers available in CMOS for mmWave, the analog front-end of the receiver with a large number of antennas becomes especially power hungry. Two main solutions exist to reduce the power consumption: hybrid beam forming and digital beam forming with low resolution Analog to Digital Converters (ADCs). In this work we compare the spectral and energy efficiency of both systems under practical system constraints. We consider the effects of channel estimation, transmitter impairments and multiple simultaneous users. Our power consumption model considers components reported in literature at 60 GHz. In contrast to many other works we also consider the correlation of the quantization error, and generalize the modeling of it to non-uniform quantizers and different quantizers at each antenna. The result shows that as the SNR gets larger the ADC resolution achieving the optimal energy efficiency gets also larger. The energy efficiency peaks for 5 bit resolution at high SNR, since due to other limiting factors the achievable rate almost saturates at this resolution. We also show that in the multi-user scenario digital beamforming is in any case more energy efficient than hybrid beamforming. In addition we show that if different ADC resolutions are used we can achieve any desired trade-offs between power consumption and rate close to those achieved with only one ADC resolution.
Distributed Information Bottleneck Method for Discrete and Gaussian Sources
Venue: arXiv cs.IT 2017
Year: 2017

We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another signal. The model generalizes Tishby's centralized information bottleneck method to the setting of multiple distributed encoders. We establish single-letter characterizations of the information-rate region of this problem for both i) a class of discrete memoryless sources and ii) memoryless vector Gaussian sources. Furthermore, assuming a sum constraint on rate or complexity, for both models we develop Blahut-Arimoto type iterative algorithms that allow to compute optimal information-rate trade-offs, by iterating over a set of self-consistent equations.
Tensor Product Generation Networks for Deep NLP Modeling
Venue: arXiv cs.CV 2017
Year: 2017

We present a new approach to the design of deep networks for natural language processing (NLP), based on the general technique of Tensor Product Representations (TPRs) for encoding and processing symbol structures in distributed neural networks. A network architecture --- the Tensor Product Generation Network (TPGN) --- is proposed which is capable in principle of carrying out TPR computation, but which uses unconstrained deep learning to design its internal representations. Instantiated in a model for image-caption generation, TPGN outperforms LSTM baselines when evaluated on the COCO dataset. The TPR-capable structure enables interpretation of internal representations and operations, which prove to contain considerable grammatical content. Our caption-generation model can be interpreted as generating sequences of grammatical categories and retrieving words by their categories from a plan encoded as a distributed representation.
Integration of Japanese Papers Into the DBLP Data Set
Venue: arXiv cs.CL 2017
Year: 2017

If someone is looking for a certain publication in the field of computer science, the searching person is likely to use the DBLP to find the desired publication. The DBLP data set is continuously extended with new publications, or rather their metadata, for example the names of involved authors, the title and the publication date. While the size of the data set is already remarkable, specific areas can still be improved. The DBLP offers a huge collection of English papers because most papers concerning computer science are published in English. Nevertheless, there are official publications in other languages which are supposed to be added to the data set. One kind of these are Japanese papers. This diploma thesis will show a way to automatically process publication lists of Japanese papers and to make them ready for an import into the DBLP data set. Especially important are the problems along the way of processing, such as transcription handling and Personal Name Matching with Japanese names.
Dataset Construction via Attention for Aspect Term Extraction with Distant Supervision
Venue: arXiv cs.CL 2017
Year: 2017

Aspect Term Extraction (ATE) detects opinionated aspect terms in sentences or text spans, with the end goal of performing aspect-based sentiment analysis. The small amount of available datasets for supervised ATE and the fact that they cover only a few domains raise the need for exploiting other data sources in new and creative ways. Publicly available review corpora contain a plethora of opinionated aspect terms and cover a larger domain spectrum. In this paper, we first propose a method for using such review corpora for creating a new dataset for ATE. Our method relies on an attention mechanism to select sentences that have a high likelihood of containing actual opinionated aspects. We thus improve the quality of the extracted aspects. We then use the constructed dataset to train a model and perform ATE with distant supervision. By evaluating on human annotated datasets, we prove that our method achieves a significantly improved performance over various unsupervised and supervised baselines. Finally, we prove that sentence selection matters when it comes to creating new datasets for ATE. Specifically, we show that, using a set of selected sentences leads to higher ATE performance compared to using the whole sentence set.
A Profit-Maximizing Strategy of Network Resource Management for 5G Tenant Slices
Venue: arXiv cs.NI 2017
Year: 2017

Supported by the emerging technologies of Network Function Virtualization (NFV) and network slicing, 5G networks allow tenants to rent resources from mobile network operators (MNOs) in order to provide services without possessing an own network infrastructure. The MNOs are therefore facing the problem of deciding if to accept or decline the resource renting requests they receive. This paper builds a stochastic model that describes the MNO's revenue and opportunity cost of accepting a contract, and therewith proposes a strategy that is analytically derived to maximize the expected profit at every decision.