OpenRaiser/Intern-Atlas huggingface dataset:
A Holistic Approach to Securing Web Applications
Venue: arXiv cs.CR 2010
Year: 2010

Protection of Web applications is an activity that requires constant monitoring of security threats as well as looking for solutions in this field. Since protection has moved from the lower layers of OSI models to the application layer and having in mind the fact that 75% of all the attacks are performed at the application layer, special attention should be paid to the application layer. It is possible to improve protection of Web application on the level of the system architecture by introducing new components which will realize protection on higher levels of OSI models. This paper deals with Intrusion Detection Systems, Intrusion Prevention Systems, Web Application Firewall and gives a holistic approach to securing Web applications using aforementioned components.
Features Based Text Similarity Detection
Venue: arXiv cs.CV 2010
Year: 2010

As the Internet help us cross cultural border by providing different information, plagiarism issue is bound to arise. As a result, plagiarism detection becomes more demanding in overcoming this issue. Different plagiarism detection tools have been developed based on various detection techniques. Nowadays, fingerprint matching technique plays an important role in those detection tools. However, in handling some large content articles, there are some weaknesses in fingerprint matching technique especially in space and time consumption issue. In this paper, we propose a new approach to detect plagiarism which integrates the use of fingerprint matching technique with four key features to assist in the detection process. These proposed features are capable to choose the main point or key sentence in the articles to be compared. Those selected sentence will be undergo the fingerprint matching process in order to detect the similarity between the sentences. Hence, time and space usage for the comparison process is reduced without affecting the effectiveness of the plagiarism detection.
3D Skull Recognition Using 3D Matching Technique
Venue: arXiv cs.CV 2010
Year: 2010

Biometrics has become a "hot" area. Governments are funding research programs focused on biometrics. In this paper the problem of person recognition and verification based on a different biometric application has been addressed. The system is based on the 3DSkull recognition using 3D matching technique, in fact this paper present several bio-metric approaches in order of assign the weak point in term of used the biometric from the authorize person and insure the person who access the data is the real person. The feature of the simulate system shows the capability of using 3D matching system as an efficient way to identify the person through his or her skull by match it with database, this technique grantee fast processing with optimizing the false positive and negative as well .
Plausible Mobility: Inferring Movement from Contacts
Venue: arXiv cs.NI 2010
Year: 2010

We address the difficult question of inferring plausible node mobility based only on information from wireless contact traces. Working with mobility information allows richer protocol simulations, particularly in dense networks, but requires complex set-ups to measure, whereas contact information is easier to measure but only allows for simplistic simulation models. In a contact trace a lot of node movement information is irretrievably lost so the original positions and velocities are in general out of reach. We propose a fast heuristic algorithm, inspired by dynamic force-based graph drawing, capable of inferring a plausible movement from any contact trace, and evaluate it on both synthetic and real-life contact traces. Our results reveal that (i) the quality of the inferred mobility is directly linked to the precision of the measured contact trace, and (ii) the simple addition of appropriate anticipation forces between nodes leads to an accurate inferred mobility.
On Fast Algorithm for Computing Even-Length DCT
Venue: arXiv cs.DS 2010
Year: 2010

We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in \mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when $m \leqslant 2$. We also show that C.W.Kok's factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, and show that for some lengths it achieves lower multiplicative complexity than one of known prime factor-based scaled transforms.
Severity Prediction of Drought in A Large Geographical Area Using Distributed Wireless Sensor Networks
Venue: arXiv cs.DC 2010
Year: 2010

In this paper, the severity prediction of drought through the implementation of modern sensor networks is discussed. We describe how to design a drought prediction system using wireless sensor networks. This paper will describe a terrestrial interconnected wireless sensor network paradigm for the prediction of severity of drought over a vast area of 10,000 sq km. The communication architecture for sensor network is outlined and the protocols developed for each layer is explored. The data integration model and sensor data analysis at the central computer is explained. The advantages and limitations are discussed along with the use of wireless standards. They are analyzed for its relevance. Finally a conclusion is presented along with open research issues.
Page-Differential Logging: An Efficient and DBMS-independent Approach for Storing Data into Flash Memory
Venue: arXiv cs.DB 2010
Year: 2010

Flash memory is widely used as the secondary storage in lightweight computing devices due to its outstanding advantages over magnetic disks. Flash memory has many access characteristics different from those of magnetic disks, and how to take advantage of them is becoming an important research issue. There are two existing approaches to storing data into flash memory: page-based and log-based. The former has good performance for read operations, but poor performance for write operations. In contrast, the latter has good performance for write operations when updates are light, but poor performance for read operations. In this paper, we propose a new method of storing data, called page-differential logging, for flash-based storage systems that solves the drawbacks of the two methods. The primary characteristics of our method are: (1) writing only the difference (which we define as the page-differential) between the original page in flash memory and the up-to-date page in memory; (2) computing and writing the page-differential only once at the time the page needs to be reflected into flash memory. The former contrasts with existing page-based methods that write the whole page including both changed and unchanged parts of data or from log-based ones that keep track of the history of all the changes in a page. Our method allows existing disk-based DBMSs to be reused as flash-based DBMSs just by modifying the flash memory driver, i.e., it is DBMS-independent. Experimental results show that the proposed method improves the I/O performance by 1.2 ~ 6.1 times over existing methods for the TPC-C data of approximately 1 Gbytes.
Effectiveness Of Defect Prevention In I.T. For Product Development
Venue: arXiv cs.SE 2010
Year: 2010

Defect Prevention is the most critical but most neglected component of the software quality assurance in any project. If applied at all stages of software development, it can reduce the time, cost and resources required to engineer a high quality product. Software inspection has proved to be the most effective and efficient technique enabling defect detection and prevention. Inspections carried at all phases of software life cycle have proved to be most beneficial and value added to the attributes of the software. Work is an analysis based on the data collected for three different projects from a leading product based company. The purpose of the paper is to show that 55% to 65% of total number of defects occurs at design phase. Position of this paper also emphasizes the importance of inspections at all phases of the product development life cycle in order to achieve the minimal post deployment defects.
Eigen-Inference for Energy Estimation of Multiple Sources
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, a new method is introduced to blindly estimate the transmit power of multiple signal sources in multi-antenna fading channels, when the number of sensing devices and the number of available samples are sufficiently large compared to the number of sources. Recent advances in the field of large dimensional random matrix theory are used that result in a simple and computationally efficient consistent estimator of the power of each source. A criterion to determine the minimum number of sensors and the minimum number of samples required to achieve source separation is then introduced. Simulations are performed that corroborate the theoretical claims and show that the proposed power estimator largely outperforms alternative power inference techniques.
Inclusion Analysis
Venue: arXiv cs.SE 2010
Year: 2010

Inclusion analysis is the name given by Operis to a black box testing technique that it has found to make the checking of key financial ratios calculated by spreadsheet models quicker, easier and more likely to find omission errors than code inspection.
Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network
Venue: arXiv cs.IT 2010
Year: 2010

It is known that the capacity of parallel (e.g., multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. Recent results have shown that parallel interference channels are not separable, i.e., joint coding is needed to achieve capacity in general. This work studies the separability, from a sum-capacity perspective, of single hop Gaussian interference networks with independent messages and arbitrary number of transmitters and receivers. The main result is that the only network that is always (for all values of channel coefficients) separable from a sum-capacity perspective is the MAC-Z-BC network, i.e., a network where a MAC component and a BC component are linked by a Z component. The sum capacity of this network is explicitly characterized.
Performance Analysis and Special Issues of Broadband Strategies in the Computer Communication
Venue: arXiv cs.NI 2010
Year: 2010

Broadband communications consists of the technologies and equipment required to deliver packet-based digital voice, video, and data services to end users. Broadband affords end users high-speed, always-on access to the Internet while affording service providers the ability to offer value-added services to increase revenues. Due to the growth of the Internet, there has been tremendous buildout of high-speed, inter-city communications links that connect population centers and Internet service providers (ISPs) points of presence (PoPs) around the world. This build out of the backbone infrastructure or core network has occurred primarily via optical transport technology. Broadband access technologies are being deployed to address the bandwidth bottleneck for the "last mile," the connection of homes and small businesses to this infrastructure. One important aspect of broadband access to the home is that it allows people to telecommute effectively by providing a similar environment as when they are physically present in their office: simultaneous telephone and computer access, high-speed Internet and intranet access for e-mail, file sharing, and access to corporate servers.
Statistical Mechanical Analysis of a Typical Reconstruction Limit of Compressed Sensing
Venue: arXiv cs.IT 2010
Year: 2010

We use the replica method of statistical mechanics to examine a typical performance of correctly reconstructing $N$-dimensional sparse vector $bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the basis of minimization of the $L_p$-norm $||bx||_p= lim_{epsilon to +0} sum_{i=1}^N |x_i|^{p+epsilon}$. We characterize the reconstruction performance by the critical relation of the successful reconstruction between the ratio $alpha=P/N$ and the density $rho$ of non-zero elements in $bx$ in the limit $P,,N to infty$ while keeping $alpha sim O(1)$ and allowing asymptotically negligible reconstruction errors. We show that the critical relation $alpha_c(rho)$ holds universally as long as $bF^{rm T}bF$ can be characterized asymptotically by a rotationally invariant random matrix ensemble and $bF bF^{rm T}$ is typically of full rank. This supports the universality of the critical relation observed by Donoho and Tanner ({em Phil. Trans. R. Soc. A}, vol.~367, pp.~4273--4293, 2009; arXiv: 0807.3590) for various ensembles of compression matrices.
A Framework to Manage the Complex Organisation of Collaborating: Its Application to Autonomous Systems
Venue: arXiv cs.MA 2010
Year: 2010

In this paper we present an analysis of the complexities of large group collaboration and its application to develop detailed requirements for collaboration schema for Autonomous Systems (AS). These requirements flow from our development of a framework for collaboration that provides a basis for designing, supporting and managing complex collaborative systems that can be applied and tested in various real world settings. We present the concepts of "collaborative flow" and "working as one" as descriptive expressions of what good collaborative teamwork can be in such scenarios. The paper considers the application of the framework within different scenarios and discuses the utility of the framework in modelling and supporting collaboration in complex organisational structures.
Joint Range of f-divergences
Venue: arXiv cs.IT 2010
Year: 2010

We provide a general method for evaluation of the joint range of f-divergences for two different functions f. Via topological arguments we prove that the joint range for general distributions equals the convex hull of the joint range achieved by the distributions on a two-element set. The joint range technique provides important inequalities between different f-divergences with various applications in information theory and statistics.
Scientometrics and Communication Theory: Towards Theoretically Informed Indicators
Venue: arXiv cs.DL 2010
Year: 2010

A theory of citations should not consider cited and/or citing agents as its sole subject of study. One is able to study also the dynamics in the networks of communications. While communicating agents (e.g., authors, laboratories, journals) can be made comparable in terms of their publication and citation counts, one would expect the communication networks not to be homogeneous. The latent structures of the network indicate different codifications that span a space of possible 'translations'. The various subdynamics can be hypothesized from an evolutionary perspective. Using the network of aggregated journal-journal citations in Science & Technology Studies as an empirical case, the operation of such subdynamics can be demonstrated. Policy implications and the consequences for a theory-driven type of scientometrics will be elaborated.
Rényi Divergence and Majorization
Venue: arXiv cs.IT 2010
Year: 2010

Rényi divergence is related to Rényi entropy much like information divergence (also called Kullback-Leibler divergence or relative entropy) is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as information divergence. We review the most important properties of Rényi divergence, including its relation to some other distances. We show how Rényi divergence appears when the theory of majorization is generalized from the finite to the continuous setting. Finally, Rényi divergence plays a role in analyzing the number of binary questions required to guess the values of a sequence of random variables.
Cop and robber games when the robber can hide and ride
Venue: arXiv cs.DM 2010
Year: 2010

In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G. The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the cop-win graphs as graphs admitting a dismantling scheme. In this paper, we characterize in a similar way the class CW(s,s') of cop-win graphs in the game in which the cop and the robber move at different speeds s' and s, s'<= s. We also establish some connections between cop-win graphs for this game with s'<s and Gromov's hyperbolicity. In the particular case s'=1 and s=2, we prove that the class of cop-win graphs is exactly the well-known class of dually chordal graphs. We show that all classes CW(s,1), s>=3, coincide and we provide a structural characterization of these graphs. We also investigate several dismantling schemes necessary or sufficient for the cop-win graphs in the game in which the robber is visible only every k moves for a fixed integer k>1. We characterize the graphs which are cop-win for any value of k. Finally, we consider the game where the cop wins if he is at distance at most 1 from the robber and we characterize via a specific dismantling scheme the bipartite graphs where a single cop wins in this game.
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Venue: arXiv cs.DS 2010
Year: 2010

Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them \citep{Kall2005,Brejova2007,Gross2007,Brown2010}. In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes.
VLSI Architectures for WIMAX Channel Decoders
Venue: arXiv cs.AR 2010
Year: 2010

This chapter describes the main architectures proposed in the literature to implement the channel decoders required by the WiMax standard, namely convolutional codes, turbo codes (both block and convolutional) and LDPC. Then it shows a complete design of a convolutional turbo code encoder/decoder system for WiMax.
Neyman-Pearson Detection of a Gaussian Source using Dumb Wireless Sensors
Venue: arXiv cs.IT 2010
Year: 2010

We investigate the performance of the Neyman-Pearson detection of a stationary Gaussian process in noise, using a large wireless sensor network (WSN). In our model, each sensor compresses its observation sequence using a linear precoder. The final decision is taken by a fusion center (FC) based on the compressed information. Two families of precoders are studied: random iid precoders and orthogonal precoders. We analyse their performance in the regime where both the number of sensors k and the number of samples n per sensor tend to infinity at the same rate, that is, k/n tends to c in (0, 1). Contributions are as follows. 1) Using results of random matrix theory and on large Toeplitz matrices, it is proved that the miss probability of the Neyman-Pearson detector converges exponentially to zero, when the above families of precoders are used. Closed form expressions of the corresponding error exponents are provided. 2) In particular, we propose a practical orthogonal precoding strategy, the Principal Frequencies Strategy (PFS), which achieves the best error exponent among all orthogonal strategies, and which requires very few signaling overhead between the central processor and the nodes of the network. 3) Moreover, when the PFS is used, a simplified low-complexity testing procedure can be implemented at the FC. We show that the proposed suboptimal test enjoys the same error exponent as the Neyman-Pearson test, which indicates a similar asymptotic behaviour of the performance. We illustrate our findings by numerical experiments on some examples.
Obstacle Constrained Total Area Coverage in Wireless Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

This paper deals with the accomplishment of total area coverage of an arbitrary region using sensors with a finite sensing radius of rs. For a given region, we aim to obtain a deterministic placement of sensors which, apart from ensuring that the entire region comes under the purview of at least a single sensor, minimises the number of sensors utilised. We begin by considering regions devoid of obstacles and thus having every location amenable for placement. Herein, we formalise the popular notion that sensors at the centres of the hexagons of a hexagonal tessellation provide the most optimal placement. We then move on to regions which may comprise obstacles of arbitrary size at arbitrary locations. We recognise two distinct classes of obstacles, namely transparent and opaque obstacles, which are distinguished by their ability (or the lack of it) to permit sensing radiation through them. In the real world, transparent obstacles model lakes, ponds and swamps, while the opaque ones stand for, inter alia, hills, trees and walls.We propose a polynomial-time algorithm for achieving optimal placement in the aforesaid scenarios and we prove its convergence.
An Improved Bound on the Number of Unit Area Triangles
Venue: arXiv cs.CG 2010
Year: 2010

We show that the number of unit-area triangles determined by a set of $n$ points in the plane is $O(n^{9/4+ε})$, for any $ε>0$, improving the recent bound $O(n^{44/19})$ of Dumitrescu et al.
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
Venue: arXiv cs.CC 2010
Year: 2010

The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the maximum degree is at least 25 we obtain a complete classification of the complexity of this problem. It is exactly solvable in polynomial-time if every relation in the constraint language is affine. It is equivalent to the problem of approximately counting independent sets in bipartite graphs if every relation can be expressed as conjunctions of {0}, {1} and binary implication. Otherwise, there is no FPRAS unless NP=RP. For lower degree bounds, additional cases arise in which the complexity is related to the complexity of approximately counting independent sets in hypergraphs.
Trajectory Clustering and an Application to Airspace Monitoring
Venue: arXiv cs.LG 2010
Year: 2010

This paper presents a framework aimed at monitoring the behavior of aircraft in a given airspace. Nominal trajectories are determined and learned using data driven methods. Standard procedures are used by air traffic controllers (ATC) to guide aircraft, ensure the safety of the airspace, and to maximize the runway occupancy. Even though standard procedures are used by ATC, the control of the aircraft remains with the pilots, leading to a large variability in the flight patterns observed. Two methods to identify typical operations and their variability from recorded radar tracks are presented. This knowledge base is then used to monitor the conformance of current operations against operations previously identified as standard. A tool called AirTrajectoryMiner is presented, aiming at monitoring the instantaneous health of the airspace, in real time. The airspace is "healthy" when all aircraft are flying according to the nominal procedures. A measure of complexity is introduced, measuring the conformance of current flight to nominal flight patterns. When an aircraft does not conform, the complexity increases as more attention from ATC is required to ensure a safe separation between aircraft.