OpenRaiser/Intern-Atlas huggingface dataset:
W3-Scrape - A Windows based Reconnaissance Tool for Web Application Fingerprinting
Venue: arXiv cs.CR 2013
Year: 2013

Web Application finger printing is a quintessential part of the Information Gathering phase of (ethical) hacking. It allows narrowing down the specifics instead of looking for all clues. Also an application that has been correctly recognized can help in quickly analyzing known weaknesses and then moving ahead with remaining aspects. This step is also essential to allow a pen tester to customize its payload or exploitation techniques based on the identification so to increase the chances of successful intrusion. This paper presents a new tool "W3-Scrape" for the relatively nascent field of Web Application finger printing that helps automate web application fingerprinting when performed in the current scenarios.
Linear Dependent Types for Domain Specific Program Analysis (Extended Abstract)
Venue: arXiv cs.PL 2013
Year: 2013

In this tutorial I will present how a combination of linear and dependent type can be useful to describe different properties about higher order programs. Linear types have been proved particularly useful to express properties of functions; dependent types are useful to describe the behavior of the program in terms of its control flow. This two ideas fits together well when one is interested in analyze properties of functions depending on the control flow of the program. I will present these ideas with example taken by complexity analysis and sensitivity analysis. I will conclude the tutorial by arguing about the generality of this approach.
Marrying Many-core Accelerators and InfiniBand for a New Commodity Processor
Venue: arXiv cs.DC 2013
Year: 2013

During the last 15 years, the supercomputing industry has been using mass-produced, off-the-shelf components to build cluster computers. Such components are not perfect for HPC purposes, but are cheap due to effect of scale in their production. The coming exa-scale era changes the landscape: exa-scale computers will contain components in quantities large enough to justify their custom development and production. We propose a new heterogeneous processor, equipped with a network controller and designed specifically for HPC. We then show how it can be used for enterprise computing market, guaranteeing its widespread adoption and therefore low production costs.
Reviewers' ratings and bibliometric indicators: hand in hand when assessing over research proposals?
Venue: arXiv cs.DL 2013
Year: 2013

The peer review system has been traditionally challenged due to its many limitations especially for allocating funding. Bibliometric indicators may well present themselves as a complement. Objective: We analyze the relationship between peers' ratings and bibliometric indicators for Spanish researchers in the 2007 National R&D Plan for 23 research fields. We analyze peers' ratings for 2333 applications. We also gathered principal investigators' research output and impact and studied the differences between accepted and rejected applications. We used the Web of Science database and focused on the 2002-2006 period. First, we analyzed the distribution of granted and rejected proposals considering a given set of bibliometric indicators to test if there are significant differences. Then, we applied a multiple logistic regression analysis to determine if bibliometric indicators can explain by themselves the concession of grant proposals. 63.4% of the applications were funded. Bibliometric indicators for accepted proposals showed a better previous performance than for those rejected; however the correlation between peer review and bibliometric indicators is very heterogeneous among most areas. The logistic regression analysis showed that the main bibliometric indicators that explain the granting of research proposals in most cases are the output (number of published articles) and the number of papers published in journals that belong to the first quartile ranking of the Journal Citations Report. Bibliometric indicators predict the concession of grant proposals at least as well as peer ratings. Social Sciences and Education are the only areas where no relation was found, although this may be due to the limitations of the Web of Science's coverage. These findings encourage the use of bibliometric indicators as a complement to peer review in most of the analyzed areas.
Exploratory Learning
Venue: arXiv cs.LG 2013
Year: 2013

In multiclass semi-supervised learning (SSL), it is sometimes the case that the number of classes present in the data is not known, and hence no labeled examples are provided for some classes. In this paper we present variants of well-known semi-supervised multiclass learning methods that are robust when the data contains an unknown number of classes. In particular, we present an "exploratory" extension of expectation-maximization (EM) that explores different numbers of classes while learning. "Exploratory" SSL greatly improves performance on three datasets in terms of F1 on the classes with seed examples i.e., the classes which are expected to be in the data. Our Exploratory EM algorithm also outperforms a SSL method based non-parametric Bayesian clustering.
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic -- Extended Version
Venue: arXiv cs.LO 2013
Year: 2013

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL which satisfies Belnap's generic cut-elimination theorem. To do so, our display calculus actually handles an extension of FILL, called Bi-Intuitionistic Linear Logic (BiILL), with an `exclusion' connective defined via an adjunction with par. We refine our display calculus for BiILL into a cut-free nested sequent calculus with deep inference in which the explicit structural rules of the display calculus become admissible. A separation property guarantees that proofs of FILL formulae in the deep inference calculus contain no trace of exclusion. Each such rule is sound for the semantics of FILL, thus our deep inference calculus and display calculus are conservative over FILL. The deep inference calculus also enjoys the subformula property and terminating backward proof search, which gives the NP-completeness of BiILL and FILL.
Shapley Meets Shapley
Venue: arXiv cs.GT 2013
Year: 2013

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices is the weight of the maximum size matching in the subgraph induced by the coalition. The Shapley value is one of the most important solution concepts in cooperative game theory. After establishing some general insights, we show that the Shapley value of matching games can be computed in polynomial time for some special cases: graphs with maximum degree two, and graphs that have a small modular decomposition into cliques or cocliques (complete k-partite graphs are a notable special case of this). The latter result extends to various other well-known classes of graph-based cooperative games. We continue by showing that computing the Shapley value of unweighted matching games is #P-complete in general. Finally, a fully polynomial-time randomized approximation scheme (FPRAS) is presented. This FPRAS can be considered the best positive result conceivable, in view of the #P-completeness result.
Replacing Network Coordinate System with Internet Delay Matrix Service (IDMS): A Case Study in Chinese Internet
Venue: arXiv cs.NI 2013
Year: 2013

Network distance (Round Trip Time, RTT) is an important parameter for many Internet distributed systems to optimize their performances. Network Coordinate System (NCS) is assumed as a lightweight and scalable mechanism to predict network distance between any two Internet hosts without explicit measurements. Though many NCSes have been proposed in the literatures, they are not satisfactory in terms of accuracy. In this paper, we propose to use delay matrix to replace the NCS. This paper makes three contributions. First, we show that not all the hosts need an independent network coordinate (NC). On the contrary, most hosts can be represented as one or several nodes in NCS. Second, we present an Internet Delay Matrix Service (IDMS) for representing network distances without explicit measurements in Internet. Third, we describe two delay matrices up to date delay matrix (UDM) and previous delay matrices (PDM) for representing the network distances. Extensive simulations on our collected Chinese Internet data sets show that IDMS is an accurate, efficient, scalable and practical method for Chinese Internet. The performance of IDMS is better than other existing approaches.
Epistemic Updates on Algebras
Venue: arXiv cs.LO 2013
Year: 2013

We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss- Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we axiomatize the intuitionistic analogue of the logic of epistemic knowledge and actions, which we refer to as IEAK, prove soundness and completeness of IEAK w.r.t. both algebraic and relational models, and illustrate how IEAK encodes the reasoning of agents in a concrete epistemic scenario.
Improving Pointwise Mutual Information (PMI) by Incorporating Significant Co-occurrence
Venue: arXiv cs.CL 2013
Year: 2013

We design a new co-occurrence based word association measure by incorporating the concept of significant cooccurrence in the popular word association measure Pointwise Mutual Information (PMI). By extensive experiments with a large number of publicly available datasets we show that the newly introduced measure performs better than other co-occurrence based measures and despite being resource-light, compares well with the best known resource-heavy distributional similarity and knowledge based word association measures. We investigate the source of this performance improvement and find that of the two types of significant co-occurrence - corpus-level and document-level, the concept of corpus level significance combined with the use of document counts in place of word counts is responsible for all the performance gains observed. The concept of document level significance is not helpful for PMI adaptation.
A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem
Venue: arXiv cs.DS 2013
Year: 2013

The J-choice K-best secretary problem, also known as the (J,K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J,K)-secretary problem is allowed to make J choices and the payoff to be maximized is the expected number of items chosen among the K best items. Previous works analyzed the case when the total number n of items is finite, and considered what happens when n grows. However, for general J and K, the optimal solution for finite n is difficult to analyze. Instead, we prove a formal connection between the finite model and the infinite model, where there are countably infinite number of items, each attached with a random arrival time drawn independently and uniformly from [0,1]. We use primal-dual continuous linear programming techniques to analyze a class of infinite algorithms, which are general enough to capture the asymptotic behavior of the finite model with large number of items. Our techniques allow us to prove that the optimal solution can be achieved by the (J,K)-Threshold Algorithm, which has a nice "rational description" for the case K = 1.
Simulating the Dynamics of T Cell Subsets Throughout the Lifetime
Venue: arXiv cs.CE 2013
Year: 2013

It is widely accepted that the immune system undergoes age-related changes correlating with increased disease in the elderly. T cell subsets have been implicated. The aim of this work is firstly to implement and validate a simulation of T regulatory cell (Treg) dynamics throughout the lifetime, based on a model by Baltcheva. We show that our initial simulation produces an inversion between precursor and mature Treys at around 20 years of age, though the output differs significantly from the original laboratory dataset. Secondly, this report discusses development of the model to incorporate new data from a cross-sectional study of healthy blood donors addressing balance between Treys and Th17 cells with novel markers for Treg. The potential for simulation to add insight into immune aging is discussed.
How to Build an RSS Feed using ASP
Venue: arXiv cs.OH 2013
Year: 2013

RSS is a XML based format. The Current popular version of RSS is RSS version 2.0. The purpose of adding an RSS feed to your site is to show if anything new is added to the site. For example, if a new article or blog or news item is added to your site that should automatically appear in the RSS feed so that the visitors/ RSS readers will automatically get updated about this new addition. The RSS feed is also called RSS channel. There are two main elements of the RSS XML file, one is the header or channel element that describes the details about the site/feeder and other is the body or item element that describes the consists of individual articles/entries updated in the site. As the format of the RSS feed file is pretty simple, it can be coded in any language, ASP, PHP or anything of that sort. We will build an RSS feeder using classical ASP (Active Server Pages) code in this article.
Regularized Spherical Polar Fourier Diffusion MRI with Optimal Dictionary Learning
Venue: arXiv cs.CV 2013
Year: 2013

Compressed Sensing (CS) takes advantage of signal sparsity or compressibility and allows superb signal reconstruction from relatively few measurements. Based on CS theory, a suitable dictionary for sparse representation of the signal is required. In diffusion MRI (dMRI), CS methods were proposed to reconstruct diffusion-weighted signal and the Ensemble Average Propagator (EAP), and there are two kinds of Dictionary Learning (DL) methods: 1) Discrete Representation DL (DR-DL), and 2) Continuous Representation DL (CR-DL). DR-DL is susceptible to numerical inaccuracy owing to interpolation and regridding errors in a discretized q-space. In this paper, we propose a novel CR-DL approach, called Dictionary Learning - Spherical Polar Fourier Imaging (DL-SPFI) for effective compressed-sensing reconstruction of the q-space diffusion-weighted signal and the EAP. In DL-SPFI, an dictionary that sparsifies the signal is learned from the space of continuous Gaussian diffusion signals. The learned dictionary is then adaptively applied to different voxels using a weighted LASSO framework for robust signal reconstruction. The adaptive dictionary is proved to be optimal. Compared with the start-of-the-art CR-DL and DR-DL methods proposed by Merlet et al. and Bilgic et al., espectively, our work offers the following advantages. First, the learned dictionary is proved to be optimal for Gaussian diffusion signals. Second, to our knowledge, this is the first work to learn a voxel-adaptive dictionary. The importance of the adaptive dictionary in EAP reconstruction will be demonstrated theoretically and empirically. Third, optimization in DL-SPFI is only performed in a small subspace resided by the SPF coefficients, as opposed to the q-space approach utilized by Merlet et al. The experiment results demonstrate the advantages of DL-SPFI over the original SPF basis and Bilgic et al.'s method.
Single Video Performance Analysis for Video-on-Demand Systems
Venue: arXiv cs.NI 2013
Year: 2013

We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize the rate from caches. Our approach reduces the analysis for multiple videos to consideration of decoupled systems with a single video each. For each placement policy, insights gained from the single video analysis carry back to the original multiple video content placement problem. Finally, we propose a hybrid placement technique that achieves near optimal performance with low complexity.
Overview of Web Content Mining Tools
Venue: arXiv cs.IR 2013
Year: 2013

Nowadays, the Web has become one of the most widespread platforms for information change and retrieval. As it becomes easier to publish documents, as the number of users, and thus publishers, increases and as the number of documents grows, searching for information is turning into a cumbersome and time-consuming operation. Due to heterogeneity and unstructured nature of the data available on the WWW, Web mining uses various data mining techniques to discover useful knowledge from Web hyperlinks, page content and usage log. The main uses of web content mining are to gather, categorize, organize and provide the best possible information available on the Web to the user requesting the information. The mining tools are imperative to scanning the many HTML documents, images, and text. Then, the result is used by the search engines. In this paper, we first introduce the concepts related to web mining; we then present an overview of different Web Content Mining tools. We conclude by presenting a comparative table of these tools based on some pertinent criteria.
Suggest an Aspect-Oriented Design Approach for UML Communication Diagram
Venue: arXiv cs.SE 2013
Year: 2013

More and more works are done on the design of the Unified Modeling Language (UML) which is designed to help us for modeling effective object oriented software, Existing Object-Oriented design methods are not mature enough to capture non-functional requirement such as concurrency, fault tolerance, distribution and persistence of a software approach. Our approach proposed to use aspect-oriented software development (AOSD) mechanisms to solve the issues for interactions of the communication diagram in UML that support only the Object-Oriented mechanisms,thus AOSD allow to design programs that are out of reach of strict Object-Orientation and could possibly improve the structures and implementations.
Representing Boolean Functions Using Polynomials: More Can Offer Less
Venue: arXiv cs.CC 2013
Year: 2013

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In practical applications, it is desirable to find a polynomial representation with the smallest number of terms possible, in order to use the least possible number of input lines to the unit under consideration. For this purpose, instead of an exact polynomial representation, usually the sign representation of a Boolean function is considered. The non-uniqueness of the sign representation allows the possibility for using a smaller number of monomials by solving a minimization problem. This minimization problem is combinatorial in nature, and so far the best known deterministic algorithm claims the use of at most $0.75\times 2^n$ of the $2^n$ total possible monomials. In this paper, the basic methods of representing a Boolean function by polynomials are examined, and an alternative approach to this problem is proposed. It is shown that it is possible to use at most $0.5\times 2^n = 2^{n-1}$ monomials based on the $\{0, 1\}$ binary inputs by introducing extra variables, and at the same time keeping the degree upper bound at $n$. An algorithm for further reduction of the number of terms that used in a polynomial representation is provided. Examples show that in certain applications, the improvement achieved by the proposed method over the existing methods is significant.
Toward a Unified Performance and Power Consumption NAND Flash Memory Model of Embedded and Solid State Secondary Storage Systems
Venue: arXiv cs.PF 2013
Year: 2013

This paper presents a set of models dedicated to describe a flash storage subsystem structure, functions, performance and power consumption behaviors. These models cover a large range of today's NAND flash memory applications. They are designed to be implemented in simulation tools allowing to estimate and compare performance and power consumption of I/O requests on flash memory based storage systems. Such tools can also help in designing and validating new flash storage systems and management mechanisms. This work is integrated in a global project aiming to build a framework simulating complex flash storage hierarchies for performance and power consumption analysis. This tool will be highly configurable and modular with various levels of usage complexity according to the required aim: from a software user point of view for simulating storage systems, to a developer point of view for designing, testing and validating new flash storage management systems.
Investigating independent subsets of graphs, with Mathematica
Venue: arXiv cs.MS 2013
Year: 2013

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to highlight the correspondence with other combinatorial objects with the same cardinality. Then we will study the structures obtained by ordering properly independent subsets of paths and cycles. We will approach some enumeration problems on the resulting partially ordered sets, putting in evidence the correspondences with structures known as Fibonacci and Lucas Cubes.
A Mathematica package to cope with partially ordered sets
Venue: arXiv cs.MS 2013
Year: 2013

Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing functions are not always helpful when one has to work on new concepts. In this paper we present a package of features developed in Mathematica which we consider particularly useful for the study of certain categories of partially ordered sets. Among the features offered, the package includes: (1) some basic features to treat partially ordered sets; (2) the ability to enumerate, create, and display monotone and regular partitions of partially ordered sets; (3) the capability of constructing the lattices of partitions of a poset, and of doing some useful computations on these structures; (4) the possibility of computing products and coproducts in the category of partially ordered sets and monotone maps; (5) the possibility of computing products and coproducts in the category of forests (disjoint union of trees) and open maps (cf. [DM06] for the product between forests).