OpenRaiser/Intern-Atlas huggingface dataset:
Software Security analysis, static and dynamic testing in java and C environment, a comparative study
Venue: arXiv cs.CR 2012
Year: 2012

The main stretch in the paper is buffer overflow anomaly occurring in major source codes, designed in various programming language. It describes the various as to how to improve your code and increase its strength to withstand security theft occurring at vulnerable areas in the code. The main language used is JAVA, regarded as one of the most object oriented language still create lot of error like stack overflow, illegal/inappropriate method overriding. I used tools confined to JAVA to test as how weak points in the code can be rectified before compiled. The byte code theft is difficult to be conquered, so it's a better to get rid of it in the plain java code itself. The tools used in the research are PMD(Programming mistake detector), it helps to detect line of code that make pop out error in near future like defect in hashcode(memory maps) overriding due to which the java code will not function correctly. Another tool is FindBUGS which provide the tester of the code to analyze the weak points in the code like infinite loop, unsynchronized wait, deadlock situation, null referring and dereferencing. Another tool which provides the base to above tools is JaCoCo code coverage analysis used to detect unreachable part and unused conditions of the code which improves the space complexity and helps in easy clarification of errors. Through this paper, we design an algorithm to prevent the loss of data. The main audience is the white box tester who might leave out essential line of code like, index variables, infinite loop, and inappropriate hashcode in the major source program. This algorithm serves to reduce the damage in case of buffer overflow
Carrier Frequency Offset Estimation for Two-Way Relaying: Optimal Preamble and Estimator Design
Venue: arXiv cs.IT 2012
Year: 2012

We consider the problem of carrier frequency offset (CFO) estimation for a two-way relaying system based on the amplify-and-forward (AF) protocol. Our contributions are in designing an optimal preamble, and the corresponding estimator, to closely achieve the minimum Cramer-Rao bound (CRB) for the CFO. This optimality is asserted with respect to the novel class of preambles, referred to as the block-rotated preambles (BRPs). This class includes the periodic preamble that is used widely in practice, yet it provides an additional degree of design freedom via a block rotation angle. We first identify the catastrophic scenario of an arbitrarily large CRB when a conventional periodic preamble is used. We next resolve this problem by using a BRP with a non-zero block rotation angle. This angle creates, in effect, an artificial frequency offset that separates the desired relayed signal from the self-interference that is introduced in the AF protocol. With appropriate optimization, the CRB incurs only marginal loss from one-way relaying under practical channel conditions. To facilitate implementation, a specific low-complexity class of estimators is examined, and conditions for the estimators to achieve the optimized CRB is established. Numerical results are given which corroborate with theoretical findings.
An improvement direction for filter selection techniques using information theory measures and quadratic optimization
Venue: arXiv cs.LG 2012
Year: 2012

Filter selection techniques are known for their simplicity and efficiency. However this kind of methods doesn't take into consideration the features inter-redundancy. Consequently the un-removed redundant features remain in the final classification model, giving lower generalization performance. In this paper we propose to use a mathematical optimization method that reduces inter-features redundancy and maximize relevance between each feature and the target variable.
Improved Total Variation based Image Compressive Sensing Recovery by Nonlocal Regularization
Venue: arXiv cs.CV 2012
Year: 2012

Recently, total variation (TV) based minimization algorithms have achieved great success in compressive sensing (CS) recovery for natural images due to its virtue of preserving edges. However, the use of TV is not able to recover the fine details and textures, and often suffers from undesirable staircase artifact. To reduce these effects, this letter presents an improved TV based image CS recovery algorithm by introducing a new nonlocal regularization constraint into CS optimization problem. The nonlocal regularization is built on the well known nonlocal means (NLM) filtering and takes advantage of self-similarity in images, which helps to suppress the staircase effect and restore the fine details. Furthermore, an efficient augmented Lagrangian based algorithm is developed to solve the above combined TV and nonlocal regularization constrained problem. Experimental results demonstrate that the proposed algorithm achieves significant performance improvements over the state-of-the-art TV based algorithm in both PSNR and visual perception.
Adding Methodological Testing to Naur's Anti-formalism
Venue: arXiv cs.OH 2012
Year: 2012

Peter Naur is the leading critic of formalist computing because of his extensive writings that disprove the now dominate characterization of human thought as cognitive information processing. Naur criticizes the ideological position that only discourse that adopts computer inspired forms are acceptable. Lakatosian philosophy of the methodology of scientific research programmes (MSRP) is added to Naur's studies to allow testing of computing theories. After discussing Naur's criticism of mechanical cognitive information processing, I show how to add MSRP competition to Naur's descriptive philosophy. Next, Naur's claim that computing can not become scientific until organizational issues involving ideological suppression of discussions of computing and human thinking are solved is corroborated by institutional suppression of my 1970s attempts to criticize structured programming (SP). Various problems in computing related philosophy are discussed. First, I argue that my MSRP based degenerating research programme disproof of SP is better than Naur's programming as a human activity, Demillo's social processes and Fetzer's unprovable causal nature. Three areas for post ideologically based computing study are discussed: computing as a path to rediscovering 19th century conceptions of infinity, axiom of choice testing facilitated by computing and relation to physical theory, and testing concrete complexity methods based on efficiency proof analysis.
Haskell_#: Coordinating Functional Processes
Venue: arXiv cs.DC 2012
Year: 2012

This paper presents Haskell#, a coordination language targeted at the efficient implementation of parallel scientific applications on loosely coupled parallel architectures, using the functional language Haskell. Examples of applications, their implementation details and performance figures are presented.
Secret Key Generation from Sparse Wireless Channels: Ergodic Capacity and Secrecy Outage
Venue: arXiv cs.CR 2012
Year: 2012

This paper investigates generation of a secret key from a reciprocal wireless channel. In particular we consider wireless channels that exhibit sparse structure in the wideband regime and the impact of the sparsity on the secret key capacity. We explore this problem in two steps. First, we study key generation from a state-dependent discrete memoryless multiple source. The state of source captures the effect of channel sparsity. Secondly, we consider a wireless channel model that captures channel sparsity and correlation between the legitimate users' channel and the eavesdropper's channel. Such dependency can significantly reduce the secret key capacity. According to system delay requirements, two performance measures are considered: (i) ergodic secret key capacity and (ii) outage probability. We show that in the wideband regime when a white sounding sequence is adopted, a sparser channel can achieve a higher ergodic secret key rate than a richer channel can. For outage performance, we show that if the users generate secret keys at a fraction of the ergodic capacity, the outage probability will decay exponentially in signal bandwidth. Moreover, a larger exponent is achieved by a richer channel.
Modelling Dead Rocking In Online Multiplayer Games
Venue: arXiv cs.NI 2012
Year: 2012

This is the web based application, here we analysis the network traffic which occurs when the player plays an online game. Here we are going to trace the current position of the player to rectify the traffic while playing the game. There are different types of measures for different applications, those can be normalized and compared with one another but my application can resolve the inconsistency by knowing the positions quickly and focus on quality of network (QON) which affects a player to leave the game in middle because of poor quality of service (QOS). The existing model leads to leave the game because of network loss from both sides. The proposed model can resolve this problem by applying the replacement of TCP along with the dejitter buffer (DB) it can reduce the network loss and by applying the DEAD RECKONING (DR) vector we can recover the network access because it can view the current position of the player through this we can rectify why the player leaving the game and checks the network conditions and try to reactive the game by using mobile devices automatically or else they receive the message according to the network conditions.
Hybrid models of the cell cycle molecular machinery
Venue: arXiv cs.CE 2012
Year: 2012

Piecewise smooth hybrid systems, involving continuous and discrete variables, are suitable models for describing the multiscale regulatory machinery of the biological cells. In hybrid models, the discrete variables can switch on and off some molecular interactions, simulating cell progression through a series of functioning modes. The advancement through the cell cycle is the archetype of such an organized sequence of events. We present an approach, inspired from tropical geometry ideas, allowing to reduce, hybridize and analyse cell cycle models consisting of polynomial or rational ordinary differential equations.
Towards Cancer Hybrid Automata
Venue: arXiv cs.SY 2012
Year: 2012

This paper introduces Cancer Hybrid Automata (CHAs), a formalism to model the progression of cancers through discrete phenotypes. The classification of cancer progression using discrete states like stages and hallmarks has become common in the biology literature, but primarily as an organizing principle, and not as an executable formalism. The precise computational model developed here aims to exploit this untapped potential, namely, through automatic verification of progression models (e.g., consistency, causal connections, etc.), classification of unreachable or unstable states and computer-generated (individualized or universal) therapy plans. The paper builds on a phenomenological approach, and as such does not need to assume a model for the biochemistry of the underlying natural progression. Rather, it abstractly models transition timings between states as well as the effects of drugs and clinical tests, and thus allows formalization of temporal statements about the progression as well as notions of timed therapies. The model proposed here is ultimately based on hybrid automata, and we show how existing controller synthesis algorithms can be generalized to CHA models, so that therapies can be generated automatically. Throughout this paper we use cancer hallmarks to represent the discrete states through which cancer progresses, but other notions of discretely or continuously varying state formalisms could also be used to derive similar therapies.
Digging Deeper into Deep Web Databases by Breaking Through the Top-k Barrier
Venue: arXiv cs.DB 2012
Year: 2012

A large number of web databases are only accessible through proprietary form-like interfaces which require users to query the system by entering desired values for a few attributes. A key restriction enforced by such an interface is the top-k output constraint - i.e., when there are a large number of matching tuples, only a few (top-k) of them are preferentially selected and returned by the website, often according to a proprietary ranking function. Since most web database owners set k to be a small value, the top-k output constraint prevents many interesting third-party (e.g., mashup) services from being developed over real-world web databases. In this paper we consider the novel problem of "digging deeper" into such web databases. Our main contribution is the meta-algorithm GetNext that can retrieve the next ranked tuple from the hidden web database using only the restrictive interface of a web database without any prior knowledge of its ranking function. This algorithm can then be called iteratively to retrieve as many top ranked tuples as necessary. We develop principled and efficient algorithms that are based on generating and executing multiple reformulated queries and inferring the next ranked tuple from their returned results. We provide theoretical analysis of our algorithms, as well as extensive experimental results over synthetic and real-world databases that illustrate the effectiveness of our techniques.
BPM, Agile, and Virtualization Combine to Create Effective Solutions
Venue: arXiv cs.SE 2012
Year: 2012

The rate of change in business and government is accelerating. A number of techniques for addressing that change have emerged independently to provide for automated solutions in this environment. This paper will examine three of the most popular of these technologies-business process management, the agile software development movement, and infrastructure virtualization-to expose the commonalities in these approaches and how, when used together, their combined effect results in rapidly deployed, more successful solutions.
Significance of Rapid Solutions Development to Business Process Management
Venue: arXiv cs.SE 2012
Year: 2012

Business process management (BPM) is moving from a niche market into the mainstream. One of the factors leading to this transformation is the emergence of very powerful rapid solutions development tools for creating BPM solutions (BPM RSD). It has been widely recognized that this facility is important for achieving benefits quickly. Similar benefits are attributed to the agile software movement, but BPM RSD differs in that the objective is to reduce the need for custom software development. As the BPM RSD features of some of the current business process management suites (BPMS) products have matured, additional benefits have emerged that fundamentally change the way we approach solutions in this space.
Using strong isomorphisms to construct game strategy spaces
Venue: arXiv cs.GT 2012
Year: 2012

When applied to the same game, probability theory and game theory can disagree on calculated values of the Fisher information, the log likelihood function, entropy gradients, the rank and Jacobian of variable transforms, and even the dimensionality and volume of the underlying probability parameter spaces. These differences arise as probability theory employs structure preserving isomorphic mappings when constructing strategy spaces to analyze games. In contrast, game theory uses weaker mappings which change some of the properties of the underlying probability distributions within the mixed strategy space. In this paper, we explore how using strong isomorphic mappings to define game strategy spaces can alter rational outcomes in simple games, and might resolve some of the paradoxes of game theory.
Concept driven framework for Latent Table Discovery
Venue: arXiv cs.DB 2012
Year: 2012

Database systems have to cater to the growing demands of the information age. The growth of the new age information retrieval powerhouses like search engines has thrown a challenge to the data management community to come up with novel mechanisms for feeding information to end users. The burgeoning use of natural language query interfaces compels system designers to present meaningful and customised information. Conventional query languages like SQL do not cater to these requirements due to syntax oriented design. Providing a semantic cover over these systems was the aim of latent table discovery focusing on semantically connecting unrelated tables that were not syntactically related by design and document the discovered knowledge. This paper throws a new direction towards improving the semantic capabilities of database systems by introducing a concept driven framework over the latent table discovery method.
Recent Technological Advances in Natural Language Processing and Artificial Intelligence
Venue: arXiv cs.CL 2012
Year: 2012

A recent advance in computer technology has permitted scientists to implement and test algorithms that were known from quite some time (or not) but which were computationally expensive. Two such projects are IBM's Jeopardy as a part of its DeepQA project [1] and Wolfram's Wolframalpha[2]. Both these methods implement natural language processing (another goal of AI scientists) and try to answer questions as asked by the user. Though the goal of the two projects is similar, both of them have a different procedure at it's core. In the following sections, the mechanism and history of IBM's Jeopardy and Wolfram alpha has been explained followed by the implications of these projects in realizing Ray Kurzweil's [3] dream of passing the Turing test by 2029. A recipe of taking the above projects to a new level is also explained.
M3R: Increased performance for in-memory Hadoop jobs
Venue: arXiv cs.DB 2012
Year: 2012

Main Memory Map Reduce (M3R) is a new implementation of the Hadoop Map Reduce (HMR) API targeted at online analytics on high mean-time-to-failure clusters. It does not support resilience, and supports only those workloads which can fit into cluster memory. In return, it can run HMR jobs unchanged -- including jobs produced by compilers for higher-level languages such as Pig, Jaql, and SystemML and interactive front-ends like IBM BigSheets -- while providing significantly better performance than the Hadoop engine on several workloads (e.g. 45x on some input sizes for sparse matrix vector multiply). M3R also supports extensions to the HMR API which can enable Map Reduce jobs to run faster on the M3R engine, while not affecting their performance under the Hadoop engine.
Muppet: MapReduce-Style Processing of Fast Data
Venue: arXiv cs.DB 2012
Year: 2012

MapReduce has emerged as a popular method to process big data. In the past few years, however, not just big data, but fast data has also exploded in volume and availability. Examples of such data include sensor data streams, the Twitter Firehose, and Facebook updates. Numerous applications must process fast data. Can we provide a MapReduce-style framework so that developers can quickly write such applications and execute them over a cluster of machines, to achieve low latency and high scalability? In this paper we report on our investigation of this question, as carried out at Kosmix and WalmartLabs. We describe MapUpdate, a framework like MapReduce, but specifically developed for fast data. We describe Muppet, our implementation of MapUpdate. Throughout the description we highlight the key challenges, argue why MapReduce is not well suited to address them, and briefly describe our current solutions. Finally, we describe our experience and lessons learned with Muppet, which has been used extensively at Kosmix and WalmartLabs to power a broad range of applications in social media and e-commerce.
Performance improvement of multiple Connections in AODV with the concern of Node bandwidth
Venue: arXiv cs.NI 2012
Year: 2012

Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central coordination. In MANET, node mobility and dynamic topology play an important role in the performance. MANET provide a solution for network connection at anywhere and at any time. The major features of MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET due to it's dynamic topology and high mobility. Several routing algorithms have been developed for routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in the network. Several issues have been identified. The bandwidth is recognized as the prominent factor reducing the performance of the network. This paper gives an improvement of normal AODV for simultaneous multiple connections under the consideration of bandwidth of node.
Reducing a Target Interval to a Few Exact Queries
Venue: arXiv cs.DS 2012
Year: 2012

Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe $U$, a (succinctly-represented) set family $\mathcal{F} \subseteq 2^{U}$, a weight function $ω:U \rightarrow \{1,...,N\}$, and integers $0 \leq l \leq u \leq \infty$. Then the problem is to decide whether there is an $X \in \mathcal{F}$ such that $l \leq \sum_{e \in X}ω(e) \leq u$. Well-known examples of such problems include Knapsack, Subset Sum, Maximum Matching, and Traveling Salesman. In this paper, we develop a generic method to transform a ranged problem into an exact problem (i.e. a ranged problem for which $l=u$). We show that our method has several intriguing applications in exact exponential algorithms and parameterized complexity, namely: - In exact exponential algorithms, we present new insight into whether Subset Sum and Knapsack have efficient algorithms in both time and space. In particular, we show that the time and space complexity of Subset Sum and Knapsack are equivalent up to a small polynomial factor in the input size. We also give an algorithm that solves sparse instances of Knapsack efficiently in terms of space and time. - In parameterized complexity, we present the first kernelization results on weighted variants of several well-known problems. In particular, we show that weighted variants of Vertex Cover, Dominating Set, Traveling Salesman and Knapsack all admit polynomial randomized Turing kernels when parameterized by $|U|$. Curiously, our method relies on a technique more commonly found in approximation algorithms.
Formal Verification of Safety Properties for Ownership Authentication Transfer Protocol
Venue: arXiv cs.LO 2012
Year: 2012

In ubiquitous computing devices, users tend to store some valuable information in their device. Even though the device can be borrowed by the other user temporarily, it is not safe for any user to borrow or lend the device as it may cause private data of the user to be public. To safeguard the user data and also to preserve user privacy we propose and model the technique of ownership authentication transfer. The user who is willing to sell the device has to transfer the ownership of the device under sale. Once the device is sold and the ownership has been transferred, the old owner will not be able to use that device at any cost. Either of the users will not be able to use the device if the process of ownership has not been carried out properly. This also takes care of the scenario when the device has been stolen or lost, avoiding the impersonation attack. The aim of this paper is to model basic process of proposed ownership authentication transfer protocol and check its safety properties by representing it using CSP and model checking approach. For model checking we have used a symbolic model checker tool called NuSMV. The safety properties of ownership transfer protocol has been modeled in terms of CTL specification and it is observed that the system satisfies all the protocol constraint and is safe to be deployed.