OpenRaiser/Intern-Atlas huggingface dataset:
Quantitative and Qualitative Analysis of Editor Behavior through Potentially Coercive Citations
Venue: arXiv cs.DL 2017
Year: 2017

How much is the h-index of an editor of a well ranked journal improved due to citations which occur after his or her appointment? Scientific recognition within academia is widely measured nowadays by the number of citations or h-index. Our dataset is based on a sample of four editors from a well ranked journal (impact factor - IF - greater than 2). The target group consists of two editors who seem to benefit by their position through an increased citation number (and subsequently h-index) within journal. The total amount of citations for the target group is bigger than 600. The control group is formed by another set of two editors from the same journal whose relations between their positions and their citation records remain neutral. The total amount of citations for the control group is more than 1200. The timespan for which pattern of citations has been studied is 1975-2015. Previous coercive citations for a journal benefit (increase its IF) has been signaled. To the best of our knowledge, this is a pioneering work on coercive citations for personal (or editors) benefit. Editorial teams should be aware about this type of potentially unethical behavior and act accordingly.
Some New Permutation Polynomials over Finite Fields
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form $G(x)+ γTr(H(x))$, where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. Charpin and G. Kyureghyan, When does $G(x)+ γTr(H(x))$ permute $\mathbb{F}_{p^n}$?, Finite Fields and Their Applications 15 (2009) 615--632].
XES Tensorflow - Process Prediction using the Tensorflow Deep-Learning Framework
Venue: arXiv cs.LG 2017
Year: 2017

Predicting the next activity of a running process is an important aspect of process management. Recently, artificial neural networks, so called deep-learning approaches, have been proposed to address this challenge. This demo paper describes a software application that applies the Tensorflow deep-learning framework to process prediction. The software application reads industry-standard XES files for training and presents the user with an easy-to-use graphical user interface for both training and prediction. The system provides several improvements over earlier work. This demo paper focuses on the software implementation and describes the architecture and user interface.
Toward Open-Set Face Recognition
Venue: arXiv cs.CV 2017
Year: 2017

Much research has been conducted on both face identification and face verification, with greater focus on the latter. Research on face identification has mostly focused on using closed-set protocols, which assume that all probe images used in evaluation contain identities of subjects that are enrolled in the gallery. Real systems, however, where only a fraction of probe sample identities are enrolled in the gallery, cannot make this closed-set assumption. Instead, they must assume an open set of probe samples and be able to reject/ignore those that correspond to unknown identities. In this paper, we address the widespread misconception that thresholding verification-like scores is a good way to solve the open-set face identification problem, by formulating an open-set face identification protocol and evaluating different strategies for assessing similarity. Our open-set identification protocol is based on the canonical labeled faces in the wild (LFW) dataset. Additionally to the known identities, we introduce the concepts of known unknowns (known, but uninteresting persons) and unknown unknowns (people never seen before) to the biometric community. We compare three algorithms for assessing similarity in a deep feature space under an open-set protocol: thresholded verification-like scores, linear discriminant analysis (LDA) scores, and an extreme value machine (EVM) probabilities. Our findings suggest that thresholding EVM probabilities, which are open-set by design, outperforms thresholding verification-like scores.
Semi-supervised cross-entropy clustering with information bottleneck constraint
Venue: arXiv cs.LG 2017
Year: 2017

In this paper, we propose a semi-supervised clustering method, CEC-IB, that models data with a set of Gaussian distributions and that retrieves clusters based on a partial labeling provided by the user (partition-level side information). By combining the ideas from cross-entropy clustering (CEC) with those from the information bottleneck method (IB), our method trades between three conflicting goals: the accuracy with which the data set is modeled, the simplicity of the model, and the consistency of the clustering with side information. Experiments demonstrate that CEC-IB has a performance comparable to Gaussian mixture models (GMM) in a classical semi-supervised scenario, but is faster, more robust to noisy labels, automatically determines the optimal number of clusters, and performs well when not all classes are present in the side information. Moreover, in contrast to other semi-supervised models, it can be successfully applied in discovering natural subgroups if the partition-level side information is derived from the top levels of a hierarchical clustering.
State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results
Venue: arXiv cs.IT 2017
Year: 2017

This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: i) each user wishes to communicate an independent message to the common receiver, and ii) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independent individual message (this model is also known as the MAC with degraded message sets). For both scenarios, new outer bounds on the capacity region are derived, which improve uniformly over the best known outer bounds. In the first scenario, the two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate to achieve both the corner points and the sum rate capacity. Furthermore, the full capacity region is characterized in situations in which the sum rate capacity is equal to the capacity of the helper problem. The proof exploits the optimal-transportation idea of Polyanskiy and Wu (which was used previously to establish an outer bound on the capacity region of the interference channel) and the worst-case Gaussian noise result for the case in which the input and the noise are dependent.
Modeling temporal constraints for a system of interactive scores
Venue: arXiv cs.SD 2017
Year: 2017

In this chapter we explain briefly the fundamentals of the interactive scores formalism. Then we develop a solution for implementing the ECO machine by mixing petri nets and constraints propagation. We also present another solution for implementing the ECO machine using concurrent constraint programming. Finally, we present an extension of interactive score with conditional branching.
Virtual Machine Introspection Based Malware Behavior Profiling and Family Grouping
Venue: arXiv cs.CR 2017
Year: 2017

The proliferation of malwares have been attributed to the alternations of a handful of original malware source codes. The malwares alternated from the same origin share some intrinsic behaviors and form a malware family. Expediently, identifying its malware family when a malware is first seen on the Internet can provide useful clues to mitigate the threat. In this paper, a malware profiler (VMP) is proposed to profile the execution behaviors of a malware by leveraging virtual machine introspection (VMI) technique. The VMP inserts plug-ins inside the virtual machine monitor (VMM) to record the invoked API calls with their input parameters and return values as the profile of malware. In this paper, a popular similarity measurement Jaccard distance and a phylogenetic tree construction method are adopted to discover malware families. The studies of malware profiles show the malwares from a malware family are very similar to each others and distinct from other malware families as well as benign software. This paper also examines VMP against existing anti-malware detection engines and some well-known malware grouping methods to compare the goodness in their malware family constructions. A peer voting approach is proposed and the results show VMP is better than almost all of the compared anti-malware engines, and compatible with the fine tuned text-mining approach and high order N-gram approaches. We also establish a malware profiling website based on VMP for malware research.
Delta-operator based consensus analysis of multi-agent networks with link failures
Venue: arXiv cs.SY 2017
Year: 2017

In this paper, a discrete-time multi-agent system is presented which is formulated in terms of the delta operator. The proposed multi-agent system can unify discrete-time and continuous-time multi-agent systems. In a multi-agent network, in practice, the communication among agents is acted upon by various factors. The communication network among faulty agents may cause link failures, which is modeled by randomly switching graphs. First, we show that the delta representation of discrete-time multi-agent system reaches consensus in mean (in probability and almost surely) if the expected graph is strongly connected. The results induce that the continuous-time multi-agent system with random networks can also reach consensus in the same sense. Second, the influence of faulty agents on consensus value is quantified under original network. By using matrix perturbation theory, the error bound is also presented in this paper. Finally, a simulation example is provided to demonstrate the effectiveness of our theoretical results.
Exact VC-dimension for $L_1$-visibility of points in simple polygons
Venue: arXiv cs.CG 2017
Year: 2017

The VC-dimension plays an important role for the algorithmic problem of guarding art galleries efficiently. We prove that inside a simple polygon at most $5$ points can be shattered by $L_1$-visibility polygons and give an example where 5 points are shattered. The VC-dimension is exactly $5$. The proof idea for the upper bound is different from previous approaches. Keywords: Art gallery, VC-dimension, $L_1$-visibility, polygons
On the Design of Matched Filters for Molecule Counting Receivers
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we design matched filters for diffusive molecular communication systems taking into account the following impairments: signal-dependent diffusion noise, inter-symbol interference (ISI), and external interfering molecules. The receiver counts the number of observed molecules several times within one symbol interval and employs linear filtering to detect the transmitted data. We derive the optimal matched filter by maximizing the expected signal-to-interference-plus-noise ratio of the decision variable. Moreover, we show that for the special case of an ISI-free channel, the matched filter reduces to a simple sum detector and a correlator for the channel impulse response for the diffusion noise-limited and (external) interference-limited regimes, respectively. Our simulation results reveal that the proposed matched filter considerably outperforms the benchmark schemes available in literature, especially when ISI is severe.
A Comparative Case Study of HTTP Adaptive Streaming Algorithms in Mobile Networks
Venue: arXiv cs.MM 2017
Year: 2017

HTTP Adaptive Streaming (HAS) techniques are now the dominant solution for video delivery in mobile networks. Over the past few years, several HAS algorithms have been introduced in order to improve user quality-of-experience (QoE) by bit-rate adaptation. Their difference is mainly the required input information, ranging from network characteristics to application-layer parameters such as the playback buffer. Interestingly, despite the recent outburst in scientific papers on the topic, a comprehensive comparative study of the main algorithm classes is still missing. In this paper we provide such comparison by evaluating the performance of the state-of-the-art HAS algorithms per class, based on data from field measurements. We provide a systematic study of the main QoE factors and the impact of the target buffer level. We conclude that this target buffer level is a critical classifier for the studied HAS algorithms. While buffer-based algorithms show superior QoE in most of the cases, their performance may differ at the low target buffer levels of live streaming services. Overall, we believe that our findings provide valuable insight for the design and choice of HAS algorithms according to networks conditions and service requirements.
A Network Game of Dynamic Traffic
Venue: arXiv cs.GT 2017
Year: 2017

We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given priorities on edges (e.g., road segments). We first constructively prove that there always exists a subgame perfect equilibrium (SPE) in this game. We then study the relationship between this model and a simplified model, in which agents select and fix an origin-destination path simultaneously. We show that the set of Nash equilibrium (NE) flows of the simplified model is a proper subset of the set of SPE flows of our main model. We prove that each NE is also a strong NE and hence weakly Pareto optimal. We establish several other nice properties of NE flows, including global First-In-First-Out. Then for two classes of networks, including series-parallel ones, we show that the queue lengths at equilibrium are bounded at any given instance, which means the price of anarchy of any given game instance is bounded, provided that the inflow size never exceeds the network capacity.
Makespan Minimization via Posted Prices
Venue: arXiv cs.GT 2017
Year: 2017

We consider job scheduling settings, with multiple machines, where jobs arrive online and choose a machine selfishly so as to minimize their cost. Our objective is the classic makespan minimization objective, which corresponds to the completion time of the last job to complete. The incentives of the selfish jobs may lead to poor performance. To reconcile the differing objectives, we introduce posted machine prices. The selfish job seeks to minimize the sum of its completion time on the machine and the posted price for the machine. Prices may be static (i.e., set once and for all before any arrival) or dynamic (i.e., change over time), but they are determined only by the past, assuming nothing about upcoming events. Obviously, such schemes are inherently truthful. We consider the competitive ratio: the ratio between the makespan achievable by the pricing scheme and that of the optimal algorithm. We give tight bounds on the competitive ratio for both dynamic and static pricing schemes for identical, restricted, related, and unrelated machine settings. Our main result is a dynamic pricing scheme for related machines that gives a constant competitive ratio, essentially matching the competitive ratio of online algorithms for this setting. In contrast, dynamic pricing gives poor performance for unrelated machines. This lower bound also exhibits a gap between what can be achieved by pricing versus what can be achieved by online algorithms.
Automatically Installing and Deploying Tools for Conducting Systematic Reviews in ReLiS
Venue: arXiv cs.SE 2017
Year: 2017

Conducting systematic reviews (SR) is a time consuming endeavor that requires several iterations to setup right. We present ReLiS, a framework to configure and deploy projects while conducting a SR. It features a domain-specific modeling editor tailored for researchers who perform SRs and an architecture that enables live installation and deployment of multiple concurrently running projects. See the accompanying video at http://youtu.be/U5zOmk2vWy8
A Rural Lens on a Research Agenda for Intelligent Infrastructure
Venue: arXiv cs.CY 2017
Year: 2017

A National Agenda for Intelligent Infrastructure is not complete without explicit consideration of the needs of rural communities. While the American population has urbanized, the United States depends on rural communities for agriculture, fishing, forestry, manufacturing and mining. Approximately 20% of the US population lives in rural areas with a skew towards aging adults. Further, nearly 25% of Veterans live in rural America. And yet, when intelligent infrastructure is imagined, it is often done so with implicit or explicit bias towards cities. In this brief we describe the unique opportunities for rural communities and offer an inclusive vision of intelligent infrastructure research. In this paper, we argue for a set of coordinated actions to ensure that rural Americans are not left behind in this digital revolution. These technological platforms and applications, supported by appropriate policy, will address key issues in transportation, energy, agriculture, public safety and health. We believe that rather than being a set of needs, the rural United States presents a set of exciting possibilities for novel innovation benefiting not just those living there, but the American economy more broadly
Complex tensor factorisation with PARAFAC2 for the estimation of brain connectivity from the EEG
Venue: arXiv cs.CE 2017
Year: 2017

Objective: The coupling between neuronal populations and its magnitude have been shown to be informative for various clinical applications. One method to estimate brain connectivity is with electroencephalography (EEG) from which the cross-spectrum between different sensor locations is derived. We wish to test the efficacy of tensor factorisation in the estimation of brain connectivity. Methods: Complex tensor factorisation based on PARAFAC2 is used to decompose the EEG into scalp components described by the spatial, spectral, and complex trial profiles. An EEG model in the complex domain was derived that shows the suitability of PARAFAC2. A connectivity metric was also derived on the complex trial profiles of the extracted components. Results: Results on a benchmark EEG dataset confirmed that PARAFAC2 can estimate connectivity better than traditional tensor analysis such as PARAFAC within a range of signal-to-noise ratios. The analysis of EEG from patients with mild cognitive impairment or Alzheimer's disease showed that PARAFAC2 identifies loss of brain connectivity better than traditional approaches and agreeing with prior pathological knowledge. Conclusion: The complex PARAFAC2 algorithm is suitable for EEG connectivity estimation since it allows to extract meaningful coupled sources and provides better estimates than complex PARAFAC. Significance: A new paradigm that employs complex tensor factorisation has demonstrated to be successful in identifying brain connectivity and the location of couples sources for both a benchmark and a real-world EEG dataset. This can enable future applications and has the potential to solve some the issues that deteriorate the performance of traditional connectivity metrics.
Senti17 at SemEval-2017 Task 4: Ten Convolutional Neural Network Voters for Tweet Polarity Classification
Venue: arXiv cs.CL 2017
Year: 2017

This paper presents Senti17 system which uses ten convolutional neural networks (ConvNet) to assign a sentiment label to a tweet. The network consists of a convolutional layer followed by a fully-connected layer and a Softmax on top. Ten instances of this network are initialized with the same word embeddings as inputs but with different initializations for the network weights. We combine the results of all instances by selecting the sentiment label given by the majority of the ten voters. This system is ranked fourth in SemEval-2017 Task4 over 38 systems with 67.4%
Techniques for improving the finite length performance of sparse superposition codes
Venue: arXiv cs.IT 2017
Year: 2017

Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically capacity-achieving with computationally feasible decoding. However, a direct implementation of the capacity-achieving construction does not give good finite length error performance. In this paper, we consider sparse superposition codes with approximate message passing (AMP) decoding, and describe a variety of techniques to improve their finite length performance. These include an iterative algorithm for SPARC power allocation, guidelines for choosing codebook parameters, and estimating a critical decoding parameter online instead of pre-computation. We also show how partial outer codes can be used in conjunction with AMP decoding to obtain a steep waterfall in the error performance curves. We compare the error performance of AMP-decoded sparse superposition codes with coded modulation using LDPC codes from the WiMAX standard.
Popularity Evolution of Professional Users on Facebook
Venue: arXiv cs.SI 2017
Year: 2017

Popularity in social media is an important objective for professional users (e.g. companies, celebrities, and public figures, etc). A simple yet prominent metric utilized to measure the popularity of a user is the number of fans or followers she succeed to attract to her page. Popularity is influenced by several factors which identifying them is an interesting research topic. This paper aims to understand this phenomenon in social media by exploring the popularity evolution for professional users in Facebook. To this end, we implemented a crawler and monitor the popularity evolution trend of 8k most popular professional users on Facebook over a period of 14 months. The collected dataset includes around 20 million popularity values and 43 million posts. We characterized different popularity evolution patterns by clustering the users temporal number of fans and study them from various perspectives including their categories and level of activities. Our observations show that being active and famous correlate positively with the popularity trend.
Rich-Club Ordering and the Dyadic Effect: Two Interrelated Phenomena
Venue: arXiv cs.SI 2017
Year: 2017

Rich-club ordering and the dyadic effect are two phenomena observed in complex networks that are based on the presence of certain substructures composed of specific nodes. Rich-club ordering represents the tendency of highly connected and important elements to form tight communities with other central elements. The dyadic effect denotes the tendency of nodes that share a common property to be much more interconnected than expected. In this study, we consider the interrelation between these two phenomena, which until now have always been studied separately. We contribute with a new formulation of the rich-club measures in terms of the dyadic effect. Moreover, we introduce certain measures related to the analysis of the dyadic effect, which are useful in confirming the presence and relevance of rich-clubs in complex networks. In addition, certain computational experiences show the usefulness of the introduced quantities with regard to different classes of real networks.
SLDR-DL: A Framework for SLD-Resolution with Deep Learning
Venue: arXiv cs.AI 2017
Year: 2017

This paper introduces an SLD-resolution technique based on deep learning. This technique enables neural networks to learn from old and successful resolution processes and to use learnt experiences to guide new resolution processes. An implementation of this technique is named SLDR-DL. It includes a Prolog library of deep feedforward neural networks and some essential functions of resolution. In the SLDR-DL framework, users can define logical rules in the form of definite clauses and teach neural networks to use the rules in reasoning processes.