OpenRaiser/Intern-Atlas huggingface dataset:
A Randomized Generic Lucas Seed Algorithm (RGLSA) with Tail Boosting for Threat Modeling in Virtual Machines
Venue: arXiv cs.CR 2013
Year: 2013

The paper is about a self-propagating and self-replicating model of malicious seeds.
Reverse Proxy Framework using Sanitization Technique for Intrusion Prevention in Database
Venue: arXiv cs.DB 2013
Year: 2013

With the increasing importance of the internet in our day to day life, data security in web application has become very crucial. Ever increasing on line and real time transaction services have led to manifold rise in the problems associated with the database security. Attacker uses illegal and unauthorized approaches to hijack the confidential information like username, password and other vital details. Hence the real time transaction requires security against web based attacks. SQL injection and cross site scripting attack are the most common application layer attack. The SQL injection attacker pass SQL statement through a web applications input fields, URL or hidden parameters and get access to the database or update it. The attacker take a benefit from user provided data in such a way that the users input is handled as a SQL code. Using this vulnerability an attacker can execute SQL commands directly on the database. SQL injection attacks are most serious threats which take users input and integrate it into SQL query. Reverse Proxy is a technique which is used to sanitize the users inputs that may transform into a database attack. In this technique a data redirector program redirects the users input to the proxy server before it is sent to the application server. At the proxy server, data cleaning algorithm is triggered using a sanitizing application. In this framework we include detection and sanitization of the tainted information being sent to the database and innovate a new prototype.
Random Grammar-based Testing for Covering All Non-Terminals
Venue: arXiv cs.SE 2013
Year: 2013

In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation of the data -- of a given size -- is practically impossible, and most approaches are either based on random techniques or on coverage criteria. In this paper, we show how to combine these two techniques by biasing the random generation in order to optimise the probability of satisfying a coverage criterion.
Efficiency Improvement of Measurement Pose Selection Techniques in Robot Calibration
Venue: arXiv cs.RO 2013
Year: 2013

The paper deals with the design of experiments for manipulator geometric and elastostatic calibration based on the test-pose approach. The main attention is paid to the efficiency improvement of numerical techniques employed in the selection of optimal measurement poses for calibration experiments. The advantages of the developed technique are illustrated by simulation examples that deal with the geometric calibration of the industrial robot of serial architecture.
Advanced robot calibration using partial pose measurements
Venue: arXiv cs.RO 2013
Year: 2013

The paper focuses on the calibration of serial industrial robots using partial pose measurements. In contrast to other works, the developed advanced robot calibration technique is suitable for geometrical and elastostatic calibration. The main attention is paid to the model parameters identification accuracy. To reduce the impact of measurement errors, it is proposed to use directly position measurements of several points instead of computing orientation of the end-effector. The proposed approach allows us to avoid the problem of non-homogeneity of the least-square objective, which arises in the classical identification technique with the full-pose information. The developed technique does not require any normalization and can be efficiently applied both for geometric and elastostatic identification. The advantages of a new approach are confirmed by comparison analysis that deals with the efficiency evaluation of different identification strategies. The obtained results have been successfully applied to the elastostatic parameters identification of the industrial robot employed in a machining work-cell for aerospace industry.
Digitize Your Body and Action in 3-D at Over 10 FPS: Real Time Dense Voxel Reconstruction and Marker-less Motion Tracking via GPU Acceleration
Venue: arXiv cs.GR 2013
Year: 2013

In this paper, we present an approach to reconstruct 3-D human motion from multi-cameras and track human skeleton using the reconstructed human 3-D point (voxel) cloud. We use an improved and more robust algorithm, probabilistic shape from silhouette to reconstruct human voxel. In addition, the annealed particle filter is applied for tracking, where the measurement is computed using the reprojection of reconstructed voxel. We use two different ways to accelerate the approach. For the CPU only acceleration, we leverage Intel TBB to speed up the hot spot of the computational overhead and reached an accelerating ratio of 3.5 on a 4-core CPU. Moreover, we implement an intensively paralleled version via GPU acceleration without TBB. Taking account all data transfer and computing time, the GPU version is about 400 times faster than the original CPU implementation, leading the approach to run at a real-time speed.
A Class of Orthogonal Sequences
Venue: arXiv cs.CR 2013
Year: 2013

This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences have autocorrelation function that is zero everywhere excepting at the origin. These sequences may be used as keys and in other cryptography applications.
Fast Resource Scheduling in HetNets with D2D Support
Venue: arXiv cs.NI 2013
Year: 2013

Resource allocation in LTE networks is known to be an NP-hard problem. In this paper, we address an even more complex scenario: an LTE-based, 2-tier heterogeneous network where D2D mode is supported under the network control. All communications (macrocell, microcell and D2D-based) share the same frequency bands, hence they may interfere. We then determine (i) the network node that should serve each user and (ii) the radio resources to be scheduled for such communication. To this end, we develop an accurate model of the system and apply approximate dynamic programming to solve it. Our algorithms allow us to deal with realistic, large-scale scenarios. In such scenarios, we compare our approach to today's networks where eICIC techniques and proportional fairness scheduling are implemented. Results highlight that our solution increases the system throughput while greatly reducing energy consumption. We also show that D2D mode can effectively support content delivery without significantly harming macrocells or microcells traffic, leading to an increased system capacity. Interestingly, we find that D2D mode can be a low-cost alternative to microcells.
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Venue: arXiv cs.CG 2013
Year: 2013

Given a graph $G$ and a subset $F \subseteq E(G)$ of its edges, is there a drawing of $G$ in which all edges of $F$ are free of crossings? We show that this question can be solved in polynomial time using a Hanani-Tutte style approach. If we require the drawing of $G$ to be straight-line, and allow at most one crossing along each edge in $F$, the problem turns out to be as hard as the existential theory of the real numbers.
A Survey: Various Techniques of Image Compression
Venue: arXiv cs.IT 2013
Year: 2013

This paper addresses about various image compression techniques. On the basis of analyzing the various image compression techniques this paper presents a survey of existing research papers. In this paper we analyze different types of existing method of image compression. Compression of an image is significantly different then compression of binary raw data. To solve these use different types of techniques for image compression. Now there is question may be arise that how to image compress and which types of technique is used. For this purpose there are basically two types are method are introduced namely lossless and lossy image compression techniques. In present time some other techniques are added with basic method. In some area neural network genetic algorithms are used for image compression. Keywords-Image Compression; Lossless; Lossy; Redundancy; Benefits of Compression.
Explicit rank-metric codes list-decodable with optimal redundancy
Venue: arXiv cs.IT 2013
Year: 2013

We construct an explicit family of linear rank-metric codes over any field ${\mathbb F}_h$ that enables efficient list decoding up to a fraction $ρ$ of errors in the rank metric with a rate of $1-ρ-ε$, for any desired $ρ\in (0,1)$ and $ε> 0$. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding beyond the unique decoding radius. Our codes are subcodes of the well-known Gabidulin codes, which encode linearized polynomials of low degree via their values at a collection of linearly independent points. The subcode is picked by restricting the message polynomials to an ${\mathbb F}_h$-subspace that evades the structured subspaces over an extension field ${\mathbb F}_{h^t}$ that arise in the linear-algebraic list decoder for Gabidulin codes due to Guruswami and Xing (STOC'13). This subspace is obtained by combining subspace designs contructed by Guruswami and Kopparty (FOCS'13) with subspace evasive varieties due to Dvir and Lovett (STOC'12). We establish a similar result for subspace codes, which are a collection of subspaces, every pair of which have low-dimensional intersection, and which have received much attention recently in the context of network coding. We also give explicit subcodes of folded Reed-Solomon (RS) codes with small folding order that are list-decodable (in the Hamming metric) with optimal redundancy, motivated by the fact that list decoding RS codes reduces to list decoding such folded RS codes. However, as we only list decode a subcode of these codes, the Johnson radius continues to be the best known error fraction for list decoding RS codes.
Public Key Infrastructure based on Authentication of Media Attestments
Venue: arXiv cs.CR 2013
Year: 2013

Many users would prefer the privacy of end-to-end encryption in their online communications if it can be done without significant inconvenience. However, because existing key distribution methods cannot be fully trusted enough for automatic use, key management has remained a user problem. We propose a fundamentally new approach to the key distribution problem by empowering end-users with the capacity to independently verify the authenticity of public keys using an additional media attestment. This permits client software to automatically lookup public keys from a keyserver without trusting the keyserver, because any attempted MITM attacks can be detected by end-users. Thus, our protocol is designed to enable a new breed of messaging clients with true end-to-end encryption built in, without the hassle of requiring users to manually manage the public keys, that is verifiably secure against MITM attacks, and does not require trusting any third parties.
A Novel Illumination-Invariant Loss for Monocular 3D Pose Estimation
Venue: arXiv cs.CV 2013
Year: 2013

The problem of identifying the 3D pose of a known object from a given 2D image has important applications in Computer Vision. Our proposed method of registering a 3D model of a known object on a given 2D photo of the object has numerous advantages over existing methods. It does not require prior training, knowledge of the camera parameters, explicit point correspondences or matching features between the image and model. Unlike techniques that estimate a partial 3D pose (as in an overhead view of traffic or machine parts on a conveyor belt), our method estimates the complete 3D pose of the object. It works on a single static image from a given view under varying and unknown lighting conditions. For this purpose we derive a novel illumination-invariant distance measure between the 2D photo and projected 3D model, which is then minimised to find the best pose parameters. Results for vehicle pose detection in real photographs are presented.
Function Overloading Implementation in C++
Venue: arXiv cs.PL 2013
Year: 2013

In this article the function overloading in object-oriented programming is elaborated and how they are implemented in C++. The language supports a variety of programming styles. Here we are describing the polymorphism and its types in brief. The main stress is given on the function overloading implementation styles in the language. The polymorphic nature of languages has advantages like that we can add new code without requiring changes to the other classes and interfaces (in Java language) are easily implemented. In this technique, the run-time overhead is also introduced in dynamic binding which increases the execution time of the software. But there are no such types of overheads in this static type of polymorphism because everything is resolved at the time of compile time. Polymorphism; Function Overloading; Static Polymorphism; Overloading; Compile Time Polymorphism.
Limited-Feedback-Based Channel-Aware Power Allocation for Linear Distributed Estimation
Venue: arXiv cs.IT 2013
Year: 2013

This paper investigates the problem of distributed best linear unbiased estimation (BLUE) of a random parameter at the fusion center (FC) of a wireless sensor network (WSN). In particular, the application of limited-feedback strategies for the optimal power allocation in distributed estimation is studied. In order to find the BLUE estimator of the unknown parameter, the FC combines spatially distributed, linearly processed, noisy observations of local sensors received through orthogonal channels corrupted by fading and additive Gaussian noise. Most optimal power-allocation schemes proposed in the literature require the feedback of the exact instantaneous channel state information from the FC to local sensors. This paper proposes a limited-feedback strategy in which the FC designs an optimal codebook containing the optimal power-allocation vectors, in an iterative offline process, based on the generalized Lloyd algorithm with modified distortion functions. Upon observing a realization of the channel vector, the FC finds the closest codeword to its corresponding optimal power-allocation vector and broadcasts the index of the codeword. Each sensor will then transmit its analog observations using its optimal quantized amplification gain. This approach eliminates the requirement for infinite-rate digital feedback links and is scalable, especially in large WSNs.
One-Class Classification: Taxonomy of Study and Review of Techniques
Venue: arXiv cs.LG 2013
Year: 2013

One-class classification (OCC) algorithms aim to build classification models when the negative class is either absent, poorly sampled or not well defined. This unique situation constrains the learning of efficient classifiers by defining class boundary just with the knowledge of positive class. The OCC problem has been considered and applied under many research themes, such as outlier/novelty detection and concept learning. In this paper we present a unified view of the general problem of OCC by presenting a taxonomy of study for OCC problems, which is based on the availability of training data, algorithms used and the application domains applied. We further delve into each of the categories of the proposed taxonomy and present a comprehensive literature review of the OCC algorithms, techniques and methodologies with a focus on their significance, limitations and applications. We conclude our paper by discussing some open research problems in the field of OCC and present our vision for future research.
Characterizing and Extending Answer Set Semantics using Possibility Theory
Venue: arXiv cs.AI 2013
Year: 2013

Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP, in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.
Reuse of existing applications during the development of Enterprise Portals integrating Web Services
Venue: arXiv cs.DC 2013
Year: 2013

During these last years, the use of the web technologies in the enterprises becomes an essential factor to define a new business model. Among these technologies, web services and enterprise portals have gathered to integrate existing heterogeneous systems such as e-commerce, eservices hub and e-learning. However, the design and the modeling of the portals, on the one hand, and their integration with the existing applications, on the other hand, are still two points open for discussion. The first problem is related to the development of the lifecycle that can be used for designing and modeling the enterprise portals. For the second problem, which is the integration of the existing applications, the discussion is intended towards the use of technologies based on web services. In This paper, we present a software engineering solution for the development of Web services-based enterprise portals.
The TTC 2013 Flowgraphs Case
Venue: arXiv cs.SE 2013
Year: 2013

This case for the Transformation Tool Contest 2013 is about evaluating the scope and usability of transformation languages and tools for a set of four tasks requiring very different capabilities. One task deals with typical model-to-model transformation problem, there's a model-to-text problem, there are two in-place transformation problems, and finally there's a task dealing with validation of models resulting from the transformations. The tasks build upon each other, but the transformation case project also provides all intermediate models, thus making it possible to skip tasks that are not suited for a particular tool, or for parallelizing the work among members of participating teams.
The Petri-Nets to Statecharts Transformation Case
Venue: arXiv cs.PL 2013
Year: 2013

This paper describes a case study for the sixth Transformation Tool Contest. The case is based on a mapping from Petri-Nets to statecharts (i.e., from flat process models to hierarchical ones). The case description separates a simple mapping phase from a phase that involves the step by step destruction Petri-Net elements and the corresponding construction of a hierarchy of statechart elements. Although the focus of this case study is on the comparison of the runtime performance of solutions, we also include correctness tests as well as bonus criteria for evaluating transformation language and tool features.
Solving the TTC 2013 Flowgraphs Case with FunnyQT
Venue: arXiv cs.SE 2013
Year: 2013

FunnyQT is a model querying and model transformation library for the functional Lisp-dialect Clojure providing a rich and efficient querying and transformation API. This paper describes the FunnyQT solution to the TTC 2013 Flowgraphs Transformation Case. It solves all four tasks, and it has won the best efficiency award for this case.
Solving the Petri-Nets to Statecharts Transformation Case with UML-RSDS
Venue: arXiv cs.SE 2013
Year: 2013

This paper provides a solution to the Petri-Nets to statecharts case using UML-RSDS. We show how a highly declarative solution which is confluent and invertible can be given using this approach.
Applying AOSE Concepts to Model Crosscutting Variability in Variant-Rich Processes
Venue: arXiv cs.SE 2013
Year: 2013

Software process models need to be variant-rich, in the sense that they should be systematically customizable to specific project goals and project environments. It is currently very difficult to model Variant-Rich Process (VRP) because variability mechanisms are largely missing in modern process modeling languages. Variability mechanisms from other domains, such as programming languages, might be suitable for the representation of variability and could be adapted to the modeling of software processes. Mechanisms from Software Product Line Engineering (SPLE) and concepts from Aspect- Oriented Software Engineering (AOSE) show particular promise when modeling variability. This paper presents an approach that integrates variability concepts from SPLE and AOSE in the design of a VRP approach for the systematic support of tailoring in software processes. This approach has also been implemented in SPEM, resulting in the vSPEM notation. It has been used in a pilot application, which indicates that our approach based on AOSE can make process tailoring easier and more productive.
Capacity Based Evacuation with Dynamic Exit Signs
Venue: arXiv cs.SY 2013
Year: 2013

Exit paths in buildings are designed to minimise evacuation time when the building is at full capacity. We present an evacuation support system which does this regardless of the number of evacuees. The core concept is to even-out congestion in the building by diverting evacuees to less-congested paths in order to make maximal usage of all accessible routes throughout the entire evacuation process. The system issues a set of flow-optimal routes using a capacity-constrained routing algorithm which anticipates evolutions in path metrics using the concept of "future capacity reservation". In order to direct evacuees in an intuitive manner whilst implementing the routing algorithm's scheme, we use dynamic exit signs, i.e. whose pointing direction can be controlled. To make this system practical and minimise reliance on sensors during the evacuation, we use an evacuee mobility model and make several assumptions on the characteristics of the evacuee flow. We validate this concept using simulations, and show how the underpinning assumptions may limit the system's performance, especially in low-headcount evacuations.
Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity
Venue: arXiv cs.DS 2013
Year: 2013

We study property testing in directed graphs in the bounded degree model, where we assume that an algorithm may only query the outgoing edges of a vertex, a model proposed by Bender and Ron in 2002. As our first main result, we we present a property testing algorithm for strong connectivity in this model, having a query complexity of $\mathcal{O}(n^{1-ε/(3+α)})$ for arbitrary $α>0$; it is based on a reduction to estimating the vertex indegree distribution. For subgraph-freeness we give a property testing algorithm with a query complexity of $\mathcal{O}(n^{1-1/k})$, where $k$ is the number of connected componentes in the queried subgraph which have no incoming edge. We furthermore take a look at the problem of testing whether a weakly connected graph contains vertices with a degree of least $3$, which can be viewed as testing for freeness of all orientations of $3$-stars; as our second main result, we show that this property can be tested with a query complexity of $\mathcal{O}(\sqrt{n})$ instead of, what would be expected, $Ω(n^{2/3})$.