OpenRaiser/Intern-Atlas huggingface dataset:
Probabilistic Argumentation. An Equational Approach
Venue: arXiv cs.AI 2015
Year: 2015

There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: a. the nature of the arguments involved; b. the membership relation in the set S of arguments; c. the attack relation; and d. the choice of extensions. Generically to add a new aspect (probabilistic, or fuzzy, or temporal, etc) to an argumentation network <S,R> can be done by adding this feature to each component a-d. This is a brute-force method and may yield a non-intuitive or meaningful result. A better way is to meaningfully translate the object system into another target system which does have the aspect required and then let the target system endow the aspect on the initial system. In our case we translate argumentation into classical propositional logic and get probabilistic argumentation from the translation. Of course what we get depends on how we translate. In fact, in this paper we introduce probabilistic semantics to abstract argumentation theory based on the equational approach to argumentation networks. We then compare our semantics with existing proposals in the literature including the approaches by M. Thimm and by A. Hunter. Our methodology in general is discussed in the conclusion.
Exploration of the scalability of LocFaults
Venue: arXiv cs.AI 2015
Year: 2015

A model checker can produce a trace of counterexample, for an erroneous program, which is often long and difficult to understand. In general, the part about the loops is the largest among the instructions in this trace. This makes the location of errors in loops critical, to analyze errors in the overall program. In this paper, we explore the scalability capabilities of LocFaults, our error localization approach exploiting paths of CFG(Control Flow Graph) from a counterexample to calculate the MCDs (Minimal Correction Deviations), and MCSs (Minimal Correction Subsets) from each found MCD. We present the times of our approach on programs with While-loops unfolded b times, and a number of deviated conditions ranging from 0 to n. Our preliminary results show that the times of our approach, constraint-based and flow-driven, are better compared to BugAssist which is based on SAT and transforms the entire program to a Boolean formula, and further the information provided by LocFaults is more expressive for the user.
Text Segmentation based on Semantic Word Embeddings
Venue: arXiv cs.CL 2015
Year: 2015

We explore the use of semantic word embeddings in text segmentation algorithms, including the C99 segmentation algorithm and new algorithms inspired by the distributed word vector representation. By developing a general framework for discussing a class of segmentation objectives, we study the effectiveness of greedy versus exact optimization approaches and suggest a new iterative refinement technique for improving the performance of greedy strategies. We compare our results to known benchmarks, using known metrics. We demonstrate state-of-the-art performance for an untrained method with our Content Vector Segmentation (CVS) on the Choi test set. Finally, we apply the segmentation procedure to an in-the-wild dataset consisting of text extracted from scholarly articles in the arXiv.org database.
Greedy Algorithms make Efficient Mechanisms
Venue: arXiv cs.GT 2015
Year: 2015

We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare at any equilibrium of bidder behavior, via a smoothness argument. This unifies numerous recent results on the price of anarchy of simple auctions. Our results extend to polymatroid and matching constraints, and we discuss extensions to more general matroid intersections.
3-D Statistical Channel Model for Millimeter-Wave Outdoor Mobile Broadband Communications
Venue: arXiv cs.IT 2015
Year: 2015

This paper presents an omnidirectional spatial and temporal 3-dimensional statistical channel model for 28 GHz dense urban non-line of sight environments. The channel model is developed from 28 GHz ultrawideband propagation measurements obtained with a 400 megachips per second broadband sliding correlator channel sounder and highly directional, steerable horn antennas in New York City. A 3GPP-like statistical channel model that is easy to implement in software or hardware is developed from measured power delay profiles and a synthesized method for providing absolute propagation delays recovered from 3-D ray-tracing, as well as measured angle of departure and angle of arrival power spectra. The extracted statistics are used to implement a MATLAB-based statistical simulator that generates 3-D millimeter-wave temporal and spatial channel coefficients that reproduce realistic impulse responses of measured urban channels. The methods and model presented here can be used for millimeter-wave system-wide simulations, and air interface design and capacity analyses.
Edge Detection: A Collection of Pixel based Approach for Colored Images
Venue: arXiv cs.CV 2015
Year: 2015

The existing traditional edge detection algorithms process a single pixel on an image at a time, thereby calculating a value which shows the edge magnitude of the pixel and the edge orientation. Most of these existing algorithms convert the coloured images into gray scale before detection of edges. However, this process leads to inaccurate precision of recognized edges, thus producing false and broken edges in the image. This paper presents a profile modelling scheme for collection of pixels based on the step and ramp edges, with a view to reducing the false and broken edges present in the image. The collection of pixel scheme generated is used with the Vector Order Statistics to reduce the imprecision of recognized edges when converting from coloured to gray scale images. The Pratt Figure of Merit (PFOM) is used as a quantitative comparison between the existing traditional edge detection algorithm and the developed algorithm as a means of validation. The PFOM value obtained for the developed algorithm is 0.8480, which showed an improvement over the existing traditional edge detection algorithms.
Improving GPU Performance Through Resource Sharing
Venue: arXiv cs.AR 2015
Year: 2015

Graphics Processing Units (GPUs) consisting of Streaming Multiprocessors (SMs) achieve high throughput by running a large number of threads and context switching among them to hide execution latencies. The number of thread blocks, and hence the number of threads that can be launched on an SM, depends on the resource usage--e.g. number of registers, amount of shared memory--of the thread blocks. Since the allocation of threads to an SM is at the thread block granularity, some of the resources may not be used up completely and hence will be wasted. We propose an approach that shares the resources of SM to utilize the wasted resources by launching more thread blocks. We show the effectiveness of our approach for two resources: register sharing, and scratchpad (shared memory) sharing. We further propose optimizations to hide long execution latencies, thus reducing the number of stall cycles. We implemented our approach in GPGPU-Sim simulator and experimentally validated it on several applications from 4 different benchmark suites: GPGPU-Sim, Rodinia, CUDA-SDK, and Parboil. We observed that with register sharing, applications show maximum improvement of 24%, and average improvement of 11%. With scratchpad sharing, we observed a maximum improvement of 30% and an average improvement of 12.5%.
Implementation of a Practical Distributed Calculation System with Browsers and JavaScript, and Application to Distributed Deep Learning
Venue: arXiv cs.DC 2015
Year: 2015

Deep learning can achieve outstanding results in various fields. However, it requires so significant computational power that graphics processing units (GPUs) and/or numerous computers are often required for the practical application. We have developed a new distributed calculation framework called "Sashimi" that allows any computer to be used as a distribution node only by accessing a website. We have also developed a new JavaScript neural network framework called "Sukiyaki" that uses general purpose GPUs with web browsers. Sukiyaki performs 30 times faster than a conventional JavaScript library for deep convolutional neural networks (deep CNNs) learning. The combination of Sashimi and Sukiyaki, as well as new distribution algorithms, demonstrates the distributed deep learning of deep CNNs only with web browsers on various devices. The libraries that comprise the proposed methods are available under MIT license at http://mil-tokyo.github.io/.
Optimum Fusion of Possibly Corrupted Reports for Distributed Detection in Multi-Sensor Networks
Venue: arXiv cs.SY 2015
Year: 2015

The most common approach to mitigate the impact that the presence of malicious nodes has on the accuracy of decision fusion schemes consists in observing the behavior of the nodes over a time interval T and then removing the reports of suspect nodes from the fusion process. By assuming that some a-priori information about the presence of malicious nodes and their behavior is available, we show that the information stemming from the suspect nodes can be exploited to further improve the decision fusion accuracy. Specifically, we derive the optimum fusion rule and analyze the achievable performance for two specific cases. In the first case, the states of the nodes (corrupted or honest) are independent of each other and the fusion center knows only the probability that a node is malicious. In the second case, the exact number of corrupted nodes is fixed and known to the fusion center. We also investigate the optimum corruption strategy for the malicious nodes, showing that always reverting the local decision does not necessarily maximize the loss of performance at the fusion center.
Leader selection and weight adjustment problems for multi-agent systems
Venue: arXiv cs.SY 2015
Year: 2015

For an uncontrollable system, adding leaders and adjusting edge weights are two methods to improve controllability. In this paper, controllability of multi-agent systems under directed topologies is studied, especially on leader selection problem and weight adjustment problem. For a given system, necessary and sufficient algebraic conditions for controllability with fewest leaders are proposed. From another perspective, when leaders are fixed, controllability could be improved by adjusting edge weights, and therefore the system is supposed to be structurally controllable, which holds if and only if the communication topology contains a spanning tree. It is also proved that the number of fewest edges needed to be assigned on new weights equals the rank deficiency of controllability matrix. An algorithm on how to perform weight adjustment is presented. Simulation examples are provided to illustrate the theoretical results.
On Invariance and Selectivity in Representation Learning
Venue: arXiv cs.LG 2015
Year: 2015

We discuss data representation which can be learned automatically from data, are invariant to transformations, and at the same time selective, in the sense that two points have the same representation only if they are one the transformation of the other. The mathematical results here sharpen some of the key claims of i-theory -- a recent theory of feedforward processing in sensory cortex.
Rank Subspace Learning for Compact Hash Codes
Venue: arXiv cs.LG 2015
Year: 2015

The era of Big Data has spawned unprecedented interests in developing hashing algorithms for efficient storage and fast nearest neighbor search. Most existing work learn hash functions that are numeric quantizations of feature values in projected feature space. In this work, we propose a novel hash learning framework that encodes feature's rank orders instead of numeric values in a number of optimal low-dimensional ranking subspaces. We formulate the ranking subspace learning problem as the optimization of a piece-wise linear convex-concave function and present two versions of our algorithm: one with independent optimization of each hash bit and the other exploiting a sequential learning framework. Our work is a generalization of the Winner-Take-All (WTA) hash family and naturally enjoys all the numeric stability benefits of rank correlation measures while being optimized to achieve high precision at very short code length. We compare with several state-of-the-art hashing algorithms in both supervised and unsupervised domain, showing superior performance in a number of data sets.
Feeder Load Balancing using Neural Network
Venue: arXiv cs.NE 2015
Year: 2015

The distribution system problems, such as planning, loss minimization, and energy restoration, usually involve the phase balancing or network reconfiguration procedures. The determination of an optimal phase balance is, in general, a combinatorial optimization problem. This paper proposes optimal reconfiguration of the phase balancing using the neural network, to switch on and off the different switches, allowing the three phases supply by the transformer to the end-users to be balanced. This paper presents the application examples of the proposed method using the real and simulated test data.
A Framework for Textbook Enhancement and Learning using Crowdsourced Annotations
Venue: arXiv cs.CY 2015
Year: 2015

Despite a significant improvement in the educational aids in terms of effective teaching-learning process, most of the educational content available to the students is less than optimal in the context of being up-to-date, exhaustive and easy-to-understand. There is a need to iteratively improve the educational material based on the feedback collected from the students' learning experience. This can be achieved by observing the students' interactions with the content, and then having the authors modify it based on this feedback. Hence, we aim to facilitate and promote communication between the communities of authors, instructors and students in order to gradually improve the educational material. Such a system will also help in students' learning process by encouraging student-to-student teaching. Underpinning these objectives, we provide the framework of a platform named Crowdsourced Annotation System (CAS) where the people from these communities can collaborate and benefit from each other. We use the concept of in-context annotations, through which, the students can add their comments about the given text while learning it. An experiment was conducted on 60 students who try to learn an article of a textbook by annotating it for four days. According to the result of the experiment, most of the students were highly satisfied with the use of CAS. They stated that the system is extremely useful for learning and they would like to use it for learning other concepts in future.
The selection monad as a CPS transformation
Venue: arXiv cs.PL 2015
Year: 2015

A computation in the continuation monad returns a final result given a continuation, ie. it is a function with type $(X \to R) \to R$. If we instead return the intermediate result at $X$ then our computation is called a selection function. Selection functions appear in diverse areas of mathematics and computer science (especially game theory, proof theory and topology) but the existing literature does not heavily emphasise the fact that the selection monad is a CPS translation. In particular it has so far gone unnoticed that the selection monad has a call/cc-like operator with interesting similarities and differences to the usual call/cc, which we explore experimentally using Haskell. Selection functions can be used whenever we find the intermediate result more interesting than the final result. For example a SAT solver computes an assignment to a boolean function, and then its continuation decides whether it is a satisfying assignment, and we find the assignment itself more interesting than the fact that it is or is not satisfying. In game theory we find the move chosen by a player more interesting than the outcome that results from that move. The author and collaborators are developing a theory of games in which selection functions are viewed as generalised notions of rationality, used to model players. By realising that strategic contexts in game theory are examples of continuations we can see that classical game theory narrowly misses being in CPS, and that a small change of viewpoint yields a theory of games that is better behaved, and especially more compositional.
Networked Stochastic Multi-Armed Bandits with Combinatorial Strategies
Venue: arXiv cs.LG 2015
Year: 2015

In this paper, we investigate a largely extended version of classical MAB problem, called networked combinatorial bandit problems. In particular, we consider the setting of a decision maker over a networked bandits as follows: each time a combinatorial strategy, e.g., a group of arms, is chosen, and the decision maker receives a reward resulting from her strategy and also receives a side bonus resulting from that strategy for each arm's neighbor. This is motivated by many real applications such as on-line social networks where friends can provide their feedback on shared content, therefore if we promote a product to a user, we can also collect feedback from her friends on that product. To this end, we consider two types of side bonus in this study: side observation and side reward. Upon the number of arms pulled at each time slot, we study two cases: single-play and combinatorial-play. Consequently, this leaves us four scenarios to investigate in the presence of side bonus: Single-play with Side Observation, Combinatorial-play with Side Observation, Single-play with Side Reward, and Combinatorial-play with Side Reward. For each case, we present and analyze a series of \emph{zero regret} polices where the expect of regret over time approaches zero as time goes to infinity. Extensive simulations validate the effectiveness of our results.
Modeling and Analysis of Energy Efficiency and Interference for Cellular Relay Deployment
Venue: arXiv cs.IT 2015
Year: 2015

By relying on a wireless backhaul link, relay stations enhance the performance of cellular networks at low infrastructure cost, but at the same time, they can aggravate the interference issue. In this paper, we analyze for several relay coding schemes the maximum energy gain provided by a relay, taking into account the additional relay-generated interference to neighboring cells. First, we define spatial areas for relaying efficiency in log-normal shadowing environments and propose three easily-computable and tractable models. These models allow the prediction of 1) the probability of energy-efficient relaying, 2) the spatial distribution of energy consumption within a cell and 3) the average interference generated by relays. Second, we define a new performance metric that jointly captures both aspects of energy and interference, and characterize the optimal number and location of relays. These results are obtainable with significantly lower complexity and execution time when applying the proposed models as compared to system simulations.We highlight that energy-efficient relay deployment does not necessarily lead to interference reduction and conversely, an interference-aware deployment is suboptimal in the energy consumption. We then propose a map showing the optimal utilization of relay coding schemes across a cell. This map combines two-hop relaying and energy-optimized partial decode-forward as a function of their respective circuitry consumption. Such a combination not only alleviates the interference issue, but also leads to a reduction in the number of relays required for the same performance.
Games and Meta-Games: Pricing Rules for Combinatorial Mechanisms
Venue: arXiv cs.GT 2015
Year: 2015

In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This paper offers a new characterization of approximate incentive-compatibility by casting the pricing problem as a meta-game between the center and the participating agents. Through a suitable set of simplifications, we describe the equilibrium of this game as a variational problem. We use this to characterize the space of optimal prices, enabling closed-form solutions in restricted cases, and numerically-determined prices in the general case. We offer theory motivating this approach, and numerical experiments showing its application.
On the categorization of scientific citation profiles in computer sciences
Venue: arXiv cs.DL 2015
Year: 2015

A common consensus in the literature is that the citation profile of published articles in general follows a universal pattern - an initial growth in the number of citations within the first two to three years after publication followed by a steady peak of one to two years and then a final decline over the rest of the lifetime of the article. This observation has long been the underlying heuristic in determining major bibliometric factors such as the quality of a publication, the growth of scientific communities, impact factor of publication venues etc. In this paper, we gather and analyze a massive dataset of scientific papers from the computer science domain and notice that the citation count of the articles over the years follows a remarkably diverse set of patterns - a profile with an initial peak (PeakInit), with distinct multiple peaks (PeakMul), with a peak late in time (PeakLate), that is monotonically decreasing (MonDec), that is monotonically increasing (MonIncr) and that can not be categorized into any of the above (Oth). We conduct a thorough experiment to investigate several important characteristics of these categories such as how individual categories attract citations, how the categorization is influenced by the year and the venue of publication of papers, how each category is affected by self-citations, the stability of the categories over time, and how much each of these categories contribute to the core of the network. Further, we show that the traditional preferential attachment models fail to explain these citation profiles. Therefore, we propose a novel dynamic growth model that takes both the preferential attachment and the aging factor into account in order to replicate the real-world behavior of various citation profiles. We believe that this paper opens the scope for a serious re-investigation of the existing bibliometric indices for scientific research.
Binary Coding in Stream
Venue: arXiv cs.DS 2015
Year: 2015

Big data is becoming ever more ubiquitous, ranging over massive video repositories, document corpuses, image sets and Internet routing history. Proximity search and clustering are two algorithmic primitives fundamental to data analysis, but suffer from the "curse of dimensionality" on these gigantic datasets. A popular attack for this problem is to convert object representations into short binary codewords, while approximately preserving near neighbor structure. However, there has been limited research on constructing codewords in the "streaming" or "online" settings often applicable to this scale of data, where one may only make a single pass over data too massive to fit in local memory. In this paper, we apply recent advances in matrix sketching techniques to construct binary codewords in both streaming and online setting. Our experimental results compete outperform several of the most popularly used algorithms, and we prove theoretical guarantees on performance in the streaming setting under mild assumptions on the data and randomness of the training set.