OpenRaiser/Intern-Atlas huggingface dataset:
Towards a Frontier of Spatial Scientometric Studies
Venue: arXiv cs.DL 2014
Year: 2014

The research field of spatial scientometrics is dedicated to measuring and analyzing science with spatial components (e.g., location, place, mapping). Because of the dynamic nature of this field, researchers from multidisciplinary domains constantly contribute qualitative, quantitative and computational approaches and technologies into scientometric analysis. This article aims to giving a brief overview about this field by analyzing the publications in (spatial) scientometrics collected from the Scopus database and introduces recent frontier researches which integrate advanced spatial analysis and geovisualization with Semantic Web technologies.
Compositional Testing For FSM-Based Models
Venue: arXiv cs.SE 2014
Year: 2014

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behavior. This is based on finite state machines (FSM). Second, it studies compositional conformance testing i.e. checking whether an implementation made of conforming components combined with integration operators is conform to its specification. Third, it shows the correctness of the global system can be obtained by testing the components involved into it towards the projection of the global specification on the specifications of the components. This result is useful to build adequate test purposes for testing components taking into account the system where they are plugged in.
On the Development of Methodology for Planning and Cost-Modeling of a Wide Area Network
Venue: arXiv cs.NI 2014
Year: 2014

The most important stages in designing a computer network in a wider geographical area include: definition of requirements, topological description, identification and calculation of relevant parameters (i.e. traffic matrix), determining the shortest path between nodes, quantification of the effect of various levels of technical and technological development of urban areas involved, the cost of technology, and the cost of services. These parameters differ for WAN networks in different regions - their calculation depends directly on the data "in the field": number of inhabitants, distance between populated areas, network traffic density, as well as available bandwidth. The main reason for identification and evaluation of these parameters is to develop a model that could meet the constraints imposed by potential beneficiaries. In this paper, we develop a methodology for planning and cost-modeling of a wide area network and validate it in a case study, under the supposition that behavioral interactions of individuals and groups play a significant role and have to be taken into consideration by employing either simple or composite indicators of socioeconomic status.
The Common Structure of Paradoxes in Aggregation Theory
Venue: arXiv cs.MA 2014
Year: 2014

In this paper we analyse some of the classical paradoxes in Social Choice Theory (namely, the Condorcet paradox, the discursive dilemma, the Ostrogorski paradox and the multiple election paradox) using a general framework for the study of aggregation problems called binary aggregation with integrity constraints. We provide a definition of paradox that is general enough to account for the four cases mentioned, and identify a common structure in the syntactic properties of the rationality assumptions that lie behind such paradoxes. We generalise this observation by providing a full characterisation of the set of rationality assumptions on which the majority rule does not generate a paradox.
The role of handbooks in knowledge creation and diffusion: A case of science and technology studies
Venue: arXiv cs.DL 2014
Year: 2014

Genre is considered to be an important element in scholarly communication and in the practice of scientific disciplines. However, scientometric studies have typically focused on a single genre, the journal article. The goal of this study is to understand the role that handbooks play in knowledge creation and diffusion and their relationship with the genre of journal articles, particularly in highly interdisciplinary and emergent social science and humanities disciplines. To shed light on these questions we focused on handbooks and journal articles published over the last four decades belonging to the research area of Science and Technology Studies (STS), broadly defined. To get a detailed picture we used the full-text of five handbooks (500,000 words) and a well-defined set of 11,700 STS articles. We confirmed the methodological split of STS into qualitative and quantitative (scientometric) approaches. Even when the two traditions explore similar topics (e.g., science and gender) they approach them from different starting points. The change in cognitive foci in both handbooks and articles partially reflects the changing trends in STS research, often driven by technology. Using text similarity measures we found that, in the case of STS, handbooks play no special role in either focusing the research efforts or marking their decline. In general, they do not represent the summaries of research directions that have emerged since the previous edition of the handbook.
A Brief State of the Art for Ontology Authoring
Venue: arXiv cs.CL 2014
Year: 2014

One of the main challenges for building the Semantic web is Ontology Authoring. Controlled Natural Languages CNLs offer a user friendly means for non-experts to author ontologies. This paper provides a snapshot of the state-of-the-art for the core CNLs for ontology authoring and reviews their respective evaluations.
Toward a Local Perspective on Online Collaboration
Venue: arXiv cs.SI 2014
Year: 2014

We study the structural properties of large scale collaboration in online communities of innovation and the role that position in the community plays in determining knowledge contribution. Contrary to previous research, we argue for a more local perspective when examining online collaboration. We demonstrate that a member's centrality and spanning within his/her local neighborhood is a better predictor of contribution than global centrality and spanning within the whole community. We contribute both theoretically and methodologically to research on large scale collaboration. On the theoretical front, a local view of position implies a more confined and local organization of work in online communities than previously thought. From a methodological perspective, evaluating the local structure of large networks involves radically different algorithms that have only recently become feasible with the increase of processing power.
Comparative Performance Analysis of Different Modulation Techniques for PAPR Reduction of OFDM Signal
Venue: arXiv cs.NI 2014
Year: 2014

One of the most important multi-carrier transmission techniques used in the latest wireless communication arena is known as Orthogonal Frequency Division Multiplexing (OFDM). It has several characteristics such as providing greater immunity to multipath fading & impulse noise, eliminating Inter Symbol Interference (ISI) & Inter Carrier Interference (ICI) using a guard interval known as Cyclic Prefix (CP). A regular difficulty of OFDM signal is high peak to average power ratio (PAPR) which is defined as the ratio of the peak power to the average power of OFDM Signal. An improved design of amplitude clipping & filtering technique of us previously reduced significant amount of PAPR with slightly increase bit error rate (BER) compare to an existing method in case of Quadrature Phase Shift Keying (QPSK) & Quadrature Amplitude Modulation (QAM). This paper investigates a comparative performance analysis of the different higher order modulation techniques on that design.
Assessing the Quality of Web Content
Venue: arXiv cs.IR 2014
Year: 2014

This paper describes our approach towards the ECML/PKDD Discovery Challenge 2010. The challenge consists of three tasks: (1) a Web genre and facet classification task for English hosts, (2) an English quality task, and (3) a multilingual quality task (German and French). In our approach, we create an ensemble of three classifiers to predict unseen Web hosts whereas each classifier is trained on a different feature set. Our final NDCG on the whole test set is 0:575 for Task 1, 0:852 for Task 2, and 0:81 (French) and 0:77 (German) for Task 3, which ranks second place in the ECML/PKDD Discovery Challenge 2010.
An Information Value Function for Nonparametric Gaussian Processes
Venue: arXiv cs.IT 2014
Year: 2014

This paper presents a novel information value function that can be used in online sensor planning to monitor a spatial phenomenon in which the spatial phenomenon is modeled by nonparametric Gaussian processes. The information value function is derived from the Kullback-Leibler (KL) divergence and represents the information value brought by sensor decision. The sensor decision at every time step is to select the sensing location that maximizes the information value function associated with the measurement taken. Gaussian processes (GPs) are employed to obtain the posterior distribution of the spatial phenomenon given a number of sensor measurements, because GPs have sufficient flexibilities to adopt the complexity from data. Furthermore, a greedy algorithm is designed based on the information value function. By comparing the greedy algorithm with the random algorithm, it is shown that the error decreases faster defined as the difference between the estimated posterior distribution and the true distribution of the spatial phenomenon via the greedy algorithm.
Evolutionary Robotics on the Web with WebGL and Javascript
Venue: arXiv cs.NE 2014
Year: 2014

Web-based applications are highly accessible to users, providing rich, interactive content while eliminating the need to install software locally. However, evolutionary robotics (ER) has faced challenges in this domain as web-based technologies have not been amenable to 3D physics simulations. Traditionally, physics-based simulations require a local installation and a high degree of user knowledge to configure an environment, but the emergence of Javascript-based physics engines enables complex simulations to be executed in web browsers. These developments create opportunities for ER research to reach new audiences by increasing accessibility. In this work, we introduce two web-based tools we have built to facilitate the exchange of ideas with other researchers as well as outreach to K-12 students and the general public. The first tool is intended to distribute and exchange ER research results, while the second is a completely browser-based implementation of an ER environment.
Lattices from Codes for Harnessing Interference: An Overview and Generalizations
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, using compute-and-forward as an example, we provide an overview of constructions of lattices from codes that possess the right algebraic structures for harnessing interference. This includes Construction A, Construction D, and Construction $π_A$ (previously called product construction) recently proposed by the authors. We then discuss two generalizations where the first one is a general construction of lattices named Construction $π_D$ subsuming the above three constructions as special cases and the second one is to go beyond principal ideal domains and build lattices over algebraic integers.
On Infinite Words Determined by Indexed Languages
Venue: arXiv cs.FL 2014
Year: 2014

We characterize the infinite words determined by indexed languages. An infinite language $L$ determines an infinite word $α$ if every string in $L$ is a prefix of $α$. If $L$ is regular or context-free, it is known that $α$ must be ultimately periodic. We show that if $L$ is an indexed language, then $α$ is a morphic word, i.e., $α$ can be generated by iterating a morphism under a coding. Since the other direction, that every morphic word is determined by some indexed language, also holds, this implies that the infinite words determined by indexed languages are exactly the morphic words. To obtain this result, we prove a new pumping lemma for the indexed languages, which may be of independent interest.
An error correcting parser for context free grammars that takes less than cubic time
Venue: arXiv cs.DS 2014
Year: 2014

The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to the language generated by the grammar. A closely related problem of great importance is one where the input are a string ${\cal I}$ and a grammar $G$ and the task is to produce a string ${\cal I}'$ that belongs to the language generated by $G$ and the `distance' between ${\cal I}$ and ${\cal I}'$ is the smallest (from among all the strings in the language). Specifically, if ${\cal I}$ is in the language generated by $G$, then the output should be ${\cal I}$. Any parser that solves this version of the problem is called an {\em error correcting parser}. In 1972 Aho and Peterson presented a cubic time error correcting parser for context free grammars. Since then this asymptotic time bound has not been improved under the (standard) assumption that the grammar size is a constant. In this paper we present an error correcting parser for context free grammars that runs in $O(T(n))$ time, where $n$ is the length of the input string and $T(n)$ is the time needed to compute the tropical product of two $n\times n$ matrices. In this paper we also present an $\frac{n}{M}$-approximation algorithm for the {\em language edit distance problem} that has a run time of $O(Mn^ω)$, where $O(n^ω)$ is the time taken to multiply two $n\times n$ matrices. To the best of our knowledge, no approximation algorithms have been proposed for error correcting parsing for general context free grammars.
Heterogeneous Multi-task Learning for Human Pose Estimation with Deep Convolutional Neural Network
Venue: arXiv cs.CV 2014
Year: 2014

We propose an heterogeneous multi-task learning framework for human pose estimation from monocular image with deep convolutional neural network. In particular, we simultaneously learn a pose-joint regressor and a sliding-window body-part detector in a deep network architecture. We show that including the body-part detection task helps to regularize the network, directing it to converge to a good solution. We report competitive and state-of-art results on several data sets. We also empirically show that the learned neurons in the middle layer of our network are tuned to localized body parts.
Verifying Parallel Loops with Separation Logic
Venue: arXiv cs.SE 2014
Year: 2014

This paper proposes a technique to specify and verify whether a loop can be parallelised. Our approach can be used as an additional step in a parallelising compiler to verify user annotations about loop dependences. Essentially, our technique requires each loop iteration to be specified with the locations it will read and write. From the loop iteration specifications, the loop (in)dependences can be derived. Moreover, the loop iteration specifications also reveal where synchronisation is needed in the parallelised program. The loop iteration specifications can be verified using permission-based separation logic.
Representing Network Trust and Using It to Improve Anonymous Communication
Venue: arXiv cs.CR 2014
Year: 2014

Motivated by the effectiveness of correlation attacks against Tor, the censorship arms race, and observations of malicious relays in Tor, we propose that Tor users capture their trust in network elements using probability distributions over the sets of elements observed by network adversaries. We present a modular system that allows users to efficiently and conveniently create such distributions and use them to improve their security. The major components of this system are (i) an ontology of network-element types that represents the main threats to and vulnerabilities of anonymous communication over Tor, (ii) a formal language that allows users to naturally express trust beliefs about network elements, and (iii) a conversion procedure that takes the ontology, public information about the network, and user beliefs written in the trust language and produce a Bayesian Belief Network that represents the probability distribution in a way that is concise and easily sampleable. We also present preliminary experimental results that show the distribution produced by our system can improve security when employed by users; further improvement is seen when the system is employed by both users and services.
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis
Venue: arXiv cs.NI 2014
Year: 2014

This paper considers max-min fair rate allocation and routing in energy harvesting networks where fairness is required among both the nodes and the time slots. Unlike most previous work on fairness, we focus on multihop topologies and consider different routing methods. We assume a predictable energy profile and focus on the design of efficient and optimal algorithms that can serve as benchmarks for distributed and approximate algorithms. We first develop an algorithm that obtains a max-min fair rate assignment for any given (time-variable or time-invariable) unsplittable routing or a routing tree. For time-invariable unsplittable routing, we also develop an algorithm that finds routes that maximize the minimum rate assigned to any node in any slot. For fractional routing, we study the joint routing and rate assignment problem. We develop an algorithm for the time-invariable case with constant rates. We show that the time-variable case is at least as hard as the 2-commodity feasible flow problem and design an FPTAS to combat the high running time. Finally, we show that finding an unsplittable routing or a routing tree that provides lexicographically maximum rate assignment (i.e., that is the best in the max-min fairness terms) is NP-hard, even for a time horizon of a single slot. Our analysis provides insights into the problem structure and can be applied to other related fairness problems.
bit.ly/malicious: Deep Dive into Short URL based e-Crime Detection
Venue: arXiv cs.CR 2014
Year: 2014

Existence of spam URLs over emails and Online Social Media (OSM) has become a massive e-crime. To counter the dissemination of long complex URLs in emails and character limit imposed on various OSM (like Twitter), the concept of URL shortening has gained a lot of traction. URL shorteners take as input a long URL and output a short URL with the same landing page (as in the long URL) in return. With their immense popularity over time, URL shorteners have become a prime target for the attackers giving them an advantage to conceal malicious content. Bitly, a leading service among all shortening services is being exploited heavily to carry out phishing attacks, work-from-home scams, pornographic content propagation, etc. This imposes additional performance pressure on Bitly and other URL shorteners to be able to detect and take a timely action against the illegitimate content. In this study, we analyzed a dataset of 763,160 short URLs marked suspicious by Bitly in the month of October 2013. Our results reveal that Bitly is not using its claimed spam detection services very effectively. We also show how a suspicious Bitly account goes unnoticed despite of a prolonged recurrent illegitimate activity. Bitly displays a warning page on identification of suspicious links, but we observed this approach to be weak in controlling the overall propagation of spam. We also identified some short URL based features and coupled them with two domain specific features to classify a Bitly URL as malicious or benign and achieved an accuracy of 86.41%. The feature set identified can be generalized to other URL shortening services as well. To the best of our knowledge, this is the first large scale study to highlight the issues with the implementation of Bitly's spam detection policies and proposing suitable countermeasures.
Fourier spectra of measures associated with algorithmically random Brownian motion
Venue: arXiv cs.CC 2014
Year: 2014

In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity. The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.
A methodology to identify the level of reuse using template factors
Venue: arXiv cs.SE 2014
Year: 2014

To build large scale software systems, Component Based Software Engineering (CBSE) has played a vital role. The current practices of software industry demands more development of a software within time and budget which is highly productive to them. It became so necessary to achieve how effectively the software component is reusable. In order to meet this, the component level reuse, in terms of both class and method level can be possibly done. The traditional approaches are presented in the literature upto the level of extent of achievement of reuse. Any how still effective reuse is a challenging issue as a part. In this paper, a methodology has proposed for the identification of reuse level which has been considered by the using reuse metrics such as the Class Template Factor(CTF) and Method Template Factor(MTF). By considering these measures makes easy to identify the level of reuse so that helps in the growth the productivity in the organization.
Interval Forecasting of Electricity Demand: A Novel Bivariate EMD-based Support Vector Regression Modeling Framework
Venue: arXiv cs.LG 2014
Year: 2014

Highly accurate interval forecasting of electricity demand is fundamental to the success of reducing the risk when making power system planning and operational decisions by providing a range rather than point estimation. In this study, a novel modeling framework integrating bivariate empirical mode decomposition (BEMD) and support vector regression (SVR), extended from the well-established empirical mode decomposition (EMD) based time series modeling framework in the energy demand forecasting literature, is proposed for interval forecasting of electricity demand. The novelty of this study arises from the employment of BEMD, a new extension of classical empirical model decomposition (EMD) destined to handle bivariate time series treated as complex-valued time series, as decomposition method instead of classical EMD only capable of decomposing one-dimensional single-valued time series. This proposed modeling framework is endowed with BEMD to decompose simultaneously both the lower and upper bounds time series, constructed in forms of complex-valued time series, of electricity demand on a monthly per hour basis, resulting in capturing the potential interrelationship between lower and upper bounds. The proposed modeling framework is justified with monthly interval-valued electricity demand data per hour in Pennsylvania-New Jersey-Maryland Interconnection, indicating it as a promising method for interval-valued electricity demand forecasting.