OpenRaiser/Intern-Atlas huggingface dataset:
Emotional Dynamics in the Age of Misinformation
Venue: arXiv cs.SI 2015
Year: 2015

According to the World Economic Forum, the diffusion of unsubstantiated rumors on online social media is one of the main threats for our society. The disintermediated paradigm of content production and consumption on online social media might foster the formation of homophile communities (echo-chambers) around specific worldviews. Such a scenario has been shown to be a vivid environment for the diffusion of false claims, in particular with respect to conspiracy theories. Not rarely, viral phenomena trigger naive (and funny) social responses -- e.g., the recent case of Jade Helm 15 where a simple military exercise turned out to be perceived as the beginning of the civil war in the US. In this work, we address the emotional dynamics of collective debates around distinct kind of news -- i.e., science and conspiracy news -- and inside and across their respective polarized communities (science and conspiracy news). Our findings show that comments on conspiracy posts tend to be more negative than on science posts. However, the more the engagement of users, the more they tend to negative commenting (both on science and conspiracy). Finally, zooming in at the interaction among polarized communities, we find a general negative pattern. As the number of comments increases -- i.e., the discussion becomes longer -- the sentiment of the post is more and more negative.
Robust Design of Transmit Waveform and Receive Filter For Colocated MIMO Radar
Venue: arXiv cs.IT 2015
Year: 2015

We consider the problem of angle-robust joint transmit waveform and receive filter design for colocated Multiple-Input Multiple-Output (MIMO) radar, in the presence of signal-dependent interferences. The design problem is cast as a max-min optimization problem to maximize the worst-case output signal-to-interference-plus-noise-ratio (SINR) with respect to the unknown angle of the target of interest. Based on rank-one relaxation and semi-definite programming (SDP) representation of a nonnegative trigonometric polynomial, a cyclic optimization algorithm is proposed to tackle this problem. The effectiveness of the proposed method is illustrated via numerical examples.
Group Symmetries of Complementary Code Matrices
Venue: arXiv cs.IT 2015
Year: 2015

We characterize group symmetries of poly-phase complementary code matrices (CCMs), which we use to classify CCMs in terms of their equivalence classes. We also present classification results for CCMs of dimension $N\times 4$ where $N=2,3,4,5,6$. Finally, we present a new construction to generate quad-phase CCMs from ternary CCMs and compare this to other existing constructions that focus on generating CCMs from those of smaller dimensions.
A Critical Review of Recurrent Neural Networks for Sequence Learning
Venue: arXiv cs.LG 2015
Year: 2015

Countless learning tasks require dealing with sequential data. Image captioning, speech synthesis, and music generation all require that a model produce outputs that are sequences. In other domains, such as time series prediction, video analysis, and musical information retrieval, a model must learn from inputs that are sequences. Interactive tasks, such as translating natural language, engaging in dialogue, and controlling a robot, often demand both capabilities. Recurrent neural networks (RNNs) are connectionist models that capture the dynamics of sequences via cycles in the network of nodes. Unlike standard feedforward neural networks, recurrent networks retain a state that can represent information from an arbitrarily long context window. Although recurrent neural networks have traditionally been difficult to train, and often contain millions of parameters, recent advances in network architectures, optimization techniques, and parallel computation have enabled successful large-scale learning with them. In recent years, systems based on long short-term memory (LSTM) and bidirectional (BRNN) architectures have demonstrated ground-breaking performance on tasks as varied as image captioning, language translation, and handwriting recognition. In this survey, we review and synthesize the research that over the past three decades first yielded and then made practical these powerful learning models. When appropriate, we reconcile conflicting notation and nomenclature. Our goal is to provide a self-contained explication of the state of the art together with a historical perspective and references to primary research.
Using Syntactic Features for Phishing Detection
Venue: arXiv cs.CL 2015
Year: 2015

This paper reports on the comparison of the subject and object of verbs in their usage between phishing emails and legitimate emails. The purpose of this research is to explore whether the syntactic structures and subjects and objects of verbs can be distinguishable features for phishing detection. To achieve the objective, we have conducted two series of experiments: the syntactic similarity for sentences, and the subject and object of verb comparison. The results of the experiments indicated that both features can be used for some verbs, but more work has to be done for others.
Sistem penunjang keputusan kelayakan pemberian pinjaman dengna metode fuzzy tsukamoto
Venue: arXiv cs.AI 2015
Year: 2015

Decision support systems (DSS) can be used to help settlement issues or decisions that are semi-structured or structured. The method used is Fuzzy Tsukamoto. PT Triprima Finance is a company engaged in the service sector lending with collateral in the form of Motor Vehicle Owner Book or car (reg). PT. Triprima Finance should consider borrowing from its customers with the consent of the head manager. Such approval requires a long time because they have to pass through many stages of the reporting procedure. Decision-making activities at PT Triprima Finance carried out by the analysis process manually. To help overcome these problems, the need for completion method in accuracy and speed of decision making feasibility of lending. To overcome this need to develop a new system that is a decision support system Tsukamoto fuzzy method. is expected to facilitate kaposko to determine the decisions to be taken.
A Review of Feature and Data Fusion with Medical Images
Venue: arXiv cs.CV 2015
Year: 2015

The fusion techniques that utilize multiple feature sets to form new features that are often more robust and contain useful information for future processing are referred to as feature fusion. The term data fusion is applied to the class of techniques used for combining decisions obtained from multiple feature sets to form global decisions. Feature and data fusion interchangeably represent two important classes of techniques that have proved to be of practical importance in a wide range of medical imaging problems
An Open Source Testing Tool for Evaluating Handwriting Input Methods
Venue: arXiv cs.HC 2015
Year: 2015

This paper presents an open source tool for testing the recognition accuracy of Chinese handwriting input methods. The tool consists of two modules, namely the PC and Android mobile client. The PC client reads handwritten samples in the computer, and transfers them individually to the Android client in accordance with the socket communication protocol. After the Android client receives the data, it simulates the handwriting on screen of client device, and triggers the corresponding handwriting recognition method. The recognition accuracy is recorded by the Android client. We present the design principles and describe the implementation of the test platform. We construct several test datasets for evaluating different handwriting recognition systems, and conduct an objective and comprehensive test using six Chinese handwriting input methods with five datasets. The test results for the recognition accuracy are then compared and analyzed.
Hamiltonian Cycles in Linear-Convex Supergrid Graphs
Venue: arXiv cs.DM 2015
Year: 2015

A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and triangular grid graphs was known to be NP-complete. In the past, we have shown that the Hamiltonian cycle problem for supergrid graphs is also NP-complete. The Hamiltonian cycle problem on supergrid graphs can be applied to control the stitching trace of computerized sewing machines. In this paper, we will study the Hamiltonian cycle property of linear-convex supergrid graphs which form a subclass of supergrid graphs. A connected graph is called $k$-connected if there are $k$ vertex-disjoint paths between every pair of vertices, and is called locally connected if the neighbors of each vertex in it form a connected subgraph. In this paper, we first show that any 2-connected, linear-convex supergrid graph is locally connected. We then prove that any 2-connected, linear-convex supergrid graph contains a Hamiltonian cycle.
Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer
Venue: arXiv cs.IT 2015
Year: 2015

Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy, which is employed to power its circuitry. In the scenario where the receiver has limited battery size, a signal with bursty energy content may cause power outage at the receiver since the battery will drain during intervals with low signal energy. In this paper, we consider a discrete memoryless channel and characterize achievable information rates when the energy content in each codeword is regularized by ensuring that sufficient energy is carried within every subblock duration. In particular, we study constant subblock-composition codes (CSCCs) where all subblocks in every codeword have the same fixed composition, and this subblock-composition is chosen to maximize the rate of information transfer while meeting the energy requirement. Compared to constant composition codes (CCCs), we show that CSCCs incur a rate loss and that the error exponent for CSCCs is also related to the error exponent for CCCs by the same rate loss term. We show that CSCC capacity can be improved by allowing different subblocks to have different composition while still meeting the subblock energy constraint. We provide numerical examples highlighting the tradeoff between delivery of sufficient energy to the receiver and achieving high information transfer rates. It is observed that the ability to use energy in real-time imposes less of penalty than the ability to use information in real-time.
Parallel Spectral Clustering Algorithm Based on Hadoop
Venue: arXiv cs.DC 2015
Year: 2015

Spectral clustering and cloud computing is emerging branch of computer science or related discipline. It overcome the shortcomings of some traditional clustering algorithm and guarantee the convergence to the optimal solution, thus have to the widespread attention. This article first introduced the parallel spectral clustering algorithm research background and significance, and then to Hadoop the cloud computing Framework has carried on the detailed introduction, then has carried on the related to spectral clustering is introduced, then introduces the spectral clustering arithmetic Method of parallel and relevant steps, finally made the related experiments, and the experiment are summarized.
Using Twitter to learn about the autism community
Venue: arXiv cs.SI 2015
Year: 2015

Considering the raising socio-economic burden of autism spectrum disorder (ASD), timely and evidence-driven public policy decision making and communication of the latest guidelines pertaining to the treatment and management of the disorder is crucial. Yet evidence suggests that policy makers and medical practitioners do not always have a good understanding of the practices and relevant beliefs of ASD-afflicted individuals' carers who often follow questionable recommendations and adopt advice poorly supported by scientific data. The key goal of the present work is to explore the idea that Twitter, as a highly popular platform for information exchange, could be used as a data-mining source to learn about the population affected by ASD -- their behaviour, concerns, needs etc. To this end, using a large data set of over 11 million harvested tweets as the basis for our investigation, we describe a series of experiments which examine a range of linguistic and semantic aspects of messages posted by individuals interested in ASD. Our findings, the first of their nature in the published scientific literature, strongly motivate additional research on this topic and present a methodological basis for further work.
Secure Personal Content Networking over Untrusted Devices
Venue: arXiv cs.CR 2015
Year: 2015

Securely sharing and managing personal content is a challenging task in multi-device environments. In this paper, we design and implement a new platform called Personal Content Networking (PCN). Our work is inspired by Content-Centric Networking (CCN) because we aim to enable access to personal content using its name instead of its location. The unique challenge of PCN is to support secure file operations such as replication, updates, and access control over distributed untrusted devices. The primary contribution of this work is the design and implementation of a secure content management platform that supports secure updates, replications, and fine-grained content-centric access control of files. Furthermore, we demonstrate its feasibility through a prototype implementation on the CCNx skeleton.
Optimization and analysis of large scale data sorting algorithm based on Hadoop
Venue: arXiv cs.DC 2015
Year: 2015

When dealing with massive data sorting, we usually use Hadoop which is a framework that allows for the distributed processing of large data sets across clusters of computers using simple programming models. A common approach in implement of big data sorting is to use shuffle and sort phase in MapReduce based on Hadoop. However, if we use it directly, the efficiency could be very low and the load imbalance can be a big problem. In this paper we carry out an experimental study of an optimization and analysis of large scale data sorting algorithm based on hadoop. In order to reach optimization, we use more than 2 rounds MapReduce. In the first round, we use a MapReduce to take sample randomly. Then we use another MapReduce to order the data uniformly, according to the results of the first round. If the data is also too big, it will turn back to the first round and keep on. The experiments show that, it is better to use the optimized algorithm than shuffle of MapReduce to sort large scale data.
How much is said in a microblog? A multilingual inquiry based on Weibo and Twitter
Venue: arXiv cs.SI 2015
Year: 2015

This paper presents a multilingual study on, per single post of microblog text, (a) how much can be said, (b) how much is written in terms of characters and bytes, and (c) how much is said in terms of information content in posts by different organizations in different languages. Focusing on three different languages (English, Chinese, and Japanese), this research analyses Weibo and Twitter accounts of major embassies and news agencies. We first establish our criterion for quantifying "how much can be said" in a digital text based on the openly available Universal Declaration of Human Rights and the translated subtitles from TED talks. These parallel corpora allow us to determine the number of characters and bits needed to represent the same content in different languages and character encodings. We then derive the amount of information that is actually contained in microblog posts authored by selected accounts on Weibo and Twitter. Our results confirm that languages with larger character sets such as Chinese and Japanese contain more information per character than English, but the actual information content contained within a microblog text varies depending on both the type of organization and the language of the post. We conclude with a discussion on the design implications of microblog text limits for different languages.
Image Retrieval Based on Binary Signature ang S-kGraph
Venue: arXiv cs.CV 2015
Year: 2015

In this paper, we introduce an optimum approach for querying similar images on large digital-image databases. Our work is based on RBIR (region-based image retrieval) method which uses multiple regions as the key to retrieval images. This method significantly improves the accuracy of queries. However, this also increases the cost of computing. To reduce this expensive computational cost, we implement binary signature encoder which maps an image to its identification in binary. In order to fasten the lookup, binary signatures of images are classified by the help of S-kGraph. Finally, our work is evaluated on COREL's images.
Video (GIF) Sentiment Analysis using Large-Scale Mid-Level Ontology
Venue: arXiv cs.MM 2015
Year: 2015

With faster connection speed, Internet users are now making social network a huge reservoir of texts, images and video clips (GIF). Sentiment analysis for such online platform can be used to predict political elections, evaluates economic indicators and so on. However, GIF sentiment analysis is quite challenging, not only because it hinges on spatio-temporal visual contentabstraction, but also for the relationship between such abstraction and final sentiment remains unknown.In this paper, we dedicated to find out such relationship.We proposed a SentiPairSequence basedspatiotemporal visual sentiment ontology, which forms the midlevel representations for GIFsentiment. The establishment process of SentiPair contains two steps. First, we construct the Synset Forest to define the semantic tree structure of visual sentiment label elements. Then, through theSynset Forest, we organically select and combine sentiment label elements to form a mid-level visual sentiment representation. Our experiments indicate that SentiPair outperforms other competing mid-level attributes. Using SentiPair, our analysis frameworkcan achieve satisfying prediction accuracy (72.6%). We also opened ourdataset (GSO-2015) to the research community. GSO-2015 contains more than 6,000 manually annotated GIFs out of more than 40,000 candidates. Each is labeled with both sentiment and SentiPair Sequence.
Notes on Rainbow Distinguished Point Method
Venue: arXiv cs.CR 2015
Year: 2015

This paper clarifies the method described in our previous paper (DOI: 978-3-319-02726-5\_21), namely rainbow distinguished point method, and give revised theoretical and experimental results which shows rainbow distinguished point method behaves inferiorly to other time memory tradeoff methods.
Machine Learning Based Auto-tuning for Enhanced OpenCL Performance Portability
Venue: arXiv cs.DC 2015
Year: 2015

Heterogeneous computing, which combines devices with different architectures, is rising in popularity, and promises increased performance combined with reduced energy consumption. OpenCL has been proposed as a standard for programing such systems, and offers functional portability. It does, however, suffer from poor performance portability, code tuned for one device must be re-tuned to achieve good performance on another device. In this paper, we use machine learning-based auto-tuning to address this problem. Benchmarks are run on a random subset of the entire tuning parameter configuration space, and the results are used to build an artificial neural network based model. The model can then be used to find interesting parts of the parameter space for further search. We evaluate our method with different benchmarks, on several devices, including an Intel i7 3770 CPU, an Nvidia K40 GPU and an AMD Radeon HD 7970 GPU. Our model achieves a mean relative error as low as 6.1%, and is able to find configurations as little as 1.3% worse than the global minimum.
Multiplex PI-Control for Consensus in Networks of Heterogeneous Linear Agents
Venue: arXiv cs.SY 2015
Year: 2015

In this paper, we propose a multiplex proportional-integral approach, for solving consensus problems in networks of heterogeneous nodes dynamics affected by constant disturbances. The proportional and integral actions are deployed on two different layers across the network, each with its own topology. Sufficient conditions for convergence are derived that depend upon the structure of the network, the parameters characterizing the control layers and the node dynamics. The effectiveness of the theoretical results is illustrated using a power network model as a representative example.
SkILL - a Stochastic Inductive Logic Learner
Venue: arXiv cs.AI 2015
Year: 2015

Probabilistic Inductive Logic Programming (PILP) is a rel- atively unexplored area of Statistical Relational Learning which extends classic Inductive Logic Programming (ILP). This work introduces SkILL, a Stochastic Inductive Logic Learner, which takes probabilistic annotated data and produces First Order Logic theories. Data in several domains such as medicine and bioinformatics have an inherent degree of uncer- tainty, that can be used to produce models closer to reality. SkILL can not only use this type of probabilistic data to extract non-trivial knowl- edge from databases, but it also addresses efficiency issues by introducing a novel, efficient and effective search strategy to guide the search in PILP environments. The capabilities of SkILL are demonstrated in three dif- ferent datasets: (i) a synthetic toy example used to validate the system, (ii) a probabilistic adaptation of a well-known biological metabolism ap- plication, and (iii) a real world medical dataset in the breast cancer domain. Results show that SkILL can perform as well as a deterministic ILP learner, while also being able to incorporate probabilistic knowledge that would otherwise not be considered.
Toward a generic representation of random variables for machine learning
Venue: arXiv cs.LG 2015
Year: 2015

This paper presents a pre-processing and a distance which improve the performance of machine learning algorithms working on independent and identically distributed stochastic processes. We introduce a novel non-parametric approach to represent random variables which splits apart dependency and distribution without losing any information. We also propound an associated metric leveraging this representation and its statistical estimate. Besides experiments on synthetic datasets, the benefits of our contribution is illustrated through the example of clustering financial time series, for instance prices from the credit default swaps market. Results are available on the website www.datagrapple.com and an IPython Notebook tutorial is available at www.datagrapple.com/Tech for reproducible research.
Higher-Order Game Theory
Venue: arXiv cs.GT 2015
Year: 2015

In applied game theory the motivation of players is a key element. It is encoded in the payoffs of the game form and often based on utility functions. But there are cases were formal descriptions in the form of a utility function do not exist. In this paper we introduce a representation of games where players' goals are modeled based on so-called higher-order functions. Our representation provides a general and powerful way to mathematically summarize players' intentions. In our framework utility functions as well as preference relations are special cases to describe players' goals. We show that in higher-order functions formal descriptions of players may still exist where utility functions do not using a classical example, a variant of Keynes' beauty contest. We also show that equilibrium conditions based on Nash can be easily adapted to our framework. Lastly, this framework serves as a stepping stone to powerful tools from computer science that can be usefully applied to economic game theory in the future such as computational and computability aspects.