OpenRaiser/Intern-Atlas huggingface dataset:
A Parallelism-Based Approach to Network Anonymization
Venue: arXiv cs.CR 2009
Year: 2009

Considering topologies of anonymous networks we used to organizing anonymous communication into hard to trace paths hiding its origin or destination. In anonymity the company is crucial, however the serial transportation imposes a costly tradeoff between a level of privacy and a speed of communication. This paper introduces a framework of a novel architecture for anonymous networks that hides initiators of communications by parallelization of anonymous links. The new approach, which is based on the grounds of the anonymous P2P network called P2Priv, does not require content forwarding via a chain of proxy nodes to assure high degree of anonymity. Contrary to P2Priv, the new architecture can be suited to anonymization of various network communications, including anonymous access to distributed as well as client-server services. In particular, it can be considered as an anonymization platform for these network applications where both privacy and low delays are required.
Analysis of the various key management algorithms and new proposal in the secure multicast communications
Venue: arXiv cs.CR 2009
Year: 2009

With the evolution of the Internet, multicast communications seem particularly well adapted for large scale commercial distribution applications, for example, the pay TV channels and secure videoconferencing. Key management for multicast remains an open topic in secure Communications today. Key management mainly has to do with the distribution and update of keying material during the group life. Several key tree based approach has been proposed by various authors to create and distribute the multicast group key in effective manner. There are different key management algorithms that facilitate efficient distribution and rekeying of the group key. These protocols normally add communication overhead as well as computation overhead at the group key controller and at the group members. This paper explores the various algorithms along with the performances and derives an improved method.
A Quantum-based Model for Interactive Information Retrieval (extended version)
Venue: arXiv cs.IR 2009
Year: 2009

Even the best information retrieval model cannot always identify the most useful answers to a user query. This is in particular the case with web search systems, where it is known that users tend to minimise their effort to access relevant information. It is, however, believed that the interaction between users and a retrieval system, such as a web search engine, can be exploited to provide better answers to users. Interactive Information Retrieval (IR) systems, in which users access information through a series of interactions with the search system, are concerned with building models for IR, where interaction plays a central role. There are many possible interactions between a user and a search system, ranging from query (re)formulation to relevance feedback. However, capturing them within a single framework is difficult and previously proposed approaches have mostly focused on relevance feedback. In this paper, we propose a general framework for interactive IR that is able to capture the full interaction process in a principled way. Our approach relies upon a generalisation of the probability framework of quantum physics, whose strong geometric component can be a key towards a successful interactive IR model.
On the Definition of Non-deterministic Mechanisms
Venue: arXiv cs.LO 2009
Year: 2009

We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three mathematical concepts are equivalent to one another. This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach.
A Performance Analysis of HICCUPS - a Steganographic System for WLAN
Venue: arXiv cs.CR 2009
Year: 2009

The paper presents an analysis of performance features of the HICCUPS (HIdden Communication system for CorrUPted networkS) including the efficiency and the cost of the system in WLANs (Wireless Local Area Networks). The analysis relies on the original CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) 802.11 Markov chain-based model.
On Chase Termination Beyond Stratification
Venue: arXiv cs.DB 2009
Year: 2009

We study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, Conjunctive Query optimization, rewriting queries using views, data exchange, and data integration. The basic idea of the chase is, given a database instance and a set of constraints as input, to fix constraint violations in the database instance. It is well-known that, for an arbitrary set of constraints, the chase does not necessarily terminate (in general, it is even undecidable if it does or not). Addressing this issue, we review the limitations of existing sufficient termination conditions for the chase and develop new techniques that allow us to establish weaker sufficient conditions. In particular, we introduce two novel termination conditions called safety and inductive restriction, and use them to define the so-called T-hierarchy of termination conditions. We then study the interrelations of our termination conditions with previous conditions and the complexity of checking our conditions. This analysis leads to an algorithm that checks membership in a level of the T-hierarchy and accounts for the complexity of termination conditions. As another contribution, we study the problem of data-dependent chase termination and present sufficient termination conditions w.r.t. fixed instances. They might guarantee termination although the chase does not terminate in the general case. As an application of our techniques beyond those already mentioned, we transfer our results into the field of query answering over knowledge bases where the chase on the underlying database may not terminate, making existing algorithms applicable to broader classes of constraints.
A Bandwidth Characterization Tool For MPEG-2 File
Venue: arXiv cs.MM 2009
Year: 2009

This paper proposes the design and development of MPEG 2 Video Decoder to offer flexible and effective utilization of bandwidth services. The decoder is capable of decoding the MPEG 2 bit stream on a single host machine. The present decoder is designed to be simple, but yet effectively reconstruct the video from MPEG 2 bit stream.
Acquiring Knowledge for Evaluation of Teachers Performance in Higher Education using a Questionnaire
Venue: arXiv cs.LG 2009
Year: 2009

In this paper, we present the step by step knowledge acquisition process by choosing a structured method through using a questionnaire as a knowledge acquisition tool. Here we want to depict the problem domain as, how to evaluate teachers performance in higher education through the use of expert system technology. The problem is how to acquire the specific knowledge for a selected problem efficiently and effectively from human experts and encode it in the suitable computer format. Acquiring knowledge from human experts in the process of expert systems development is one of the most common problems cited till yet. This questionnaire was sent to 87 domain experts within all public and private universities in Pakistani. Among them 25 domain experts sent their valuable opinions. Most of the domain experts were highly qualified, well experienced and highly responsible persons. The whole questionnaire was divided into 15 main groups of factors, which were further divided into 99 individual questions. These facts were analyzed further to give a final shape to the questionnaire. This knowledge acquisition technique may be used as a learning tool for further research work.
Fuzzy Logic Based Method for Improving Text Summarization
Venue: arXiv cs.IR 2009
Year: 2009

Text summarization can be classified into two approaches: extraction and abstraction. This paper focuses on extraction approach. The goal of text summarization based on extraction approach is sentence selection. One of the methods to obtain the suitable sentences is to assign some numerical measure of a sentence for the summary called sentence weighting and then select the best ones. The first step in summarization by extraction is the identification of important features. In our experiment, we used 125 test documents in DUC2002 data set. Each document is prepared by preprocessing process: sentence segmentation, tokenization, removing stop word, and word stemming. Then, we use 8 important features and calculate their score for each sentence. We propose text summarization based on fuzzy logic to improve the quality of the summary created by the general statistic method. We compare our results with the baseline summarizer and Microsoft Word 2007 summarizers. The results show that the best average precision, recall, and f-measure for the summaries were obtained by fuzzy method.
On optimally partitioning a text to improve its compression
Venue: arXiv cs.DS 2009
Year: 2009

In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying C over the entire T at once. This problem was introduced in the context of table compression, and then further elaborated and extended to strings and trees. Unfortunately, the literature offers poor solutions: namely, we know either a cubic-time algorithm for computing the optimal partition based on dynamic programming, or few heuristics that do not guarantee any bounds on the efficacy of their computed partition, or algorithms that are efficient but work in some specific scenarios (such as the Burrows-Wheeler Transform) and achieve compression performance that might be worse than the optimal-partitioning by a $Ω(\sqrt{\log n})$ factor. Therefore, computing efficiently the optimal solution is still open. In this paper we provide the first algorithm which is guaranteed to compute in $O(n \log_{1+\eps}n)$ time a partition of T whose compressed output is guaranteed to be no more than $(1+ε)$-worse the optimal one, where $ε$ may be any positive constant.
Clarksons Algorithm for Violator Spaces
Venue: arXiv cs.CG 2009
Year: 2009

Clarksons algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R^d . In 2006, it has been shown that the algorithm in its original form works for violator spaces too, which are a proper general- ization of LP-type problems. It was not clear, however, whether previous simplifications of the algorithm carry over to the new setting. In this paper we show the following theoretical results: (a) It is shown, for the first time, that Clarksons second stage can be simplified. (b) The previous simplifications of Clarksons first stage carry over to the violator space setting. (c) Furthermore, we show the equivalence of violator spaces and partitions of the hypercube by hypercubes.
(Non)existence of Pleated Folds: How Paper Folds Between Creases
Venue: arXiv cs.CG 2009
Year: 2009

We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper. In contrast, we show that the model can be folded with additional creases, suggesting that real paper "folds" into this model via small such creases. We conjecture that the circular version of this model, consisting simply of concentric circular creases, also folds without extra creases. At the heart of our results is a new structural theorem characterizing uncreased intrinsically flat surfaces--the portions of paper between the creases. Differential geometry has much to say about the local behavior of such surfaces when they are sufficiently smooth, e.g., that they are torsal ruled. But this classic result is simply false in the context of the whole surface. Our structural characterization tells the whole story, and even applies to surfaces with discontinuities in the second derivative. We use our theorem to prove fundamental properties about how paper folds, for example, that straight creases on the piece of paper must remain piecewise-straight (polygonal) by folding.
Chemical Power for Microscopic Robots in Capillaries
Venue: arXiv cs.RO 2009
Year: 2009

The power available to microscopic robots (nanorobots) that oxidize bloodstream glucose while aggregated in circumferential rings on capillary walls is evaluated with a numerical model using axial symmetry and time-averaged release of oxygen from passing red blood cells. Robots about one micron in size can produce up to several tens of picowatts, in steady-state, if they fully use oxygen reaching their surface from the blood plasma. Robots with pumps and tanks for onboard oxygen storage could collect oxygen to support burst power demands two to three orders of magnitude larger. We evaluate effects of oxygen depletion and local heating on surrounding tissue. These results give the power constraints when robots rely entirely on ambient available oxygen and identify aspects of the robot design significantly affecting available power. More generally, our numerical model provides an approach to evaluating robot design choices for nanomedicine treatments in and near capillaries.
Effective Focused Crawling Based on Content and Link Structure Analysis
Venue: arXiv cs.IR 2009
Year: 2009

A focused crawler traverses the web selecting out relevant pages to a predefined topic and neglecting those out of concern. While surfing the internet it is difficult to deal with irrelevant pages and to predict which links lead to quality pages. In this paper a technique of effective focused crawling is implemented to improve the quality of web navigation. To check the similarity of web pages w.r.t. topic keywords a similarity function is used and the priorities of extracted out links are also calculated based on meta data and resultant pages generated from focused crawler. The proposed work also uses a method for traversing the irrelevant pages that met during crawling to improve the coverage of a specific topic.
Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling
Venue: arXiv cs.DS 2009
Year: 2009

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-complete problem, but it is difficult to find the optimal solution. This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling problem and compares the results obtained by each. With the implementation of our approach the JSS problems reaches optimal solution and minimize the makespan.
Comparing and Aggregating Partially Resolved Trees
Venue: arXiv cs.DS 2009
Year: 2009

We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on three-element subsets of the set of species. For unrooted trees, the measures are based on quartets (four-element subsets). Triplet and quartet-based distances provide a robust and fine-grained measure of the similarities between trees. The distinguishing feature of our distance measures relative to traditional quartet and triplet distances is their ability to deal cleanly with the presence of unresolved nodes, also called polytomies. For rooted trees, these are nodes with more than two children; for unrooted trees, they are nodes of degree greater than three. Our first class of measures are parametric distances, where there is a parameter that weighs the difference between an unresolved triplet/quartet topology and a resolved one. Our second class of measures are based on Hausdorff distance. Each tree is viewed as a set of all possible ways in which the tree could be refined to eliminate unresolved nodes. The distance between the original (unresolved) trees is then taken to be the Hausdorff distance between the associated sets of fully resolved trees, where the distance between trees in the sets is the triplet or quartet distance, as appropriate.
Putting Recommendations on the Map -- Visualizing Clusters and Relations
Venue: arXiv cs.IR 2009
Year: 2009

For users, recommendations can sometimes seem odd or counterintuitive. Visualizing recommendations can remove some of this mystery, showing how a recommendation is grouped with other choices. A drawing can also lead a user's eye to other options. Traditional 2D-embeddings of points can be used to create a basic layout, but these methods, by themselves, do not illustrate clusters and neighborhoods very well. In this paper, we propose the use of geographic maps to enhance the definition of clusters and neighborhoods, and consider the effectiveness of this approach in visualizing similarities and recommendations arising from TV shows and music selections. All the maps referenced in this paper can be found in http://www.research.att.com/~volinsky/maps
Green Cellular - Optimizing the Cellular Network for Minimal Emission from Mobile Stations
Venue: arXiv cs.IT 2009
Year: 2009

Wireless systems, which include cellular phones, have become an essential part of the modern life. However the mounting evidence that cellular radiation might adversely affect the health of its users, leads to a growing concern among authorities and the general public. Radiating antennas in the proximity of the user, such as antennas of mobile phones are of special interest for this matter. In this paper we suggest a new architecture for wireless networks, aiming at minimal emission from mobile stations, without any additional radiation sources. The new architecture, dubbed Green Cellular, abandons the classical transceiver base station design and suggests the augmentation of transceiver base stations with receive only devices. These devices, dubbed Green Antennas, are not aiming at coverage extension but rather at minimizing the emission from mobile stations. We discuss the implications of the Green Cellular architecture on 3G and 4G cellular technologies. We conclude by showing that employing the Green Cellular approach may lead to a significant decrease in the emission from mobile stations, especially in indoor scenarios. This is achieved without exposing the user to any additional radiation source.
Relational Parametricity for Computational Effects
Venue: arXiv cs.PL 2009
Year: 2009

According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea. Relational parametricity provides a powerful tool for establishing data abstraction properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity. In this paper, we develop a foundational framework for extending the notion of relational parametricity to programming languages with effects.
An Improved Algorithm based on Shannon-Happ Formula for Calculating Transfer Function from Signal Flow Graph and Its Visualization
Venue: arXiv cs.NA 2009
Year: 2009

A new method based on Shannon-Happ formula to calculate transfer function from Signal Flow Graph (SFG) is presented. The algorithm provides an explicit approach to get the transfer function in a format with both numerical and symbolic expressions. The adoption of the symbolic variable in SFG, which could represent the nonlinear item or the independent sub-system, is achieved by variable separation approach. An investigation is given for the solutions of several special conditions of SFG. To improve the efficiency of the algorithm, a new technique combined with Johnson method for generating the combinations of the non-touching loops is developed. It uses the previous combinations in lower order to get the ones in higher order. There is an introduction about the visualization of SFG and the subroutines for system performance analysis in the software, AVANT.
Loading Arbitrary Knowledge Bases in Matrix Browser
Venue: arXiv cs.IR 2009
Year: 2009

This paper describes the work done on Matrix Browser, which is a recently developed graphical user interface to explore and navigate complex networked information spaces. This approach presents a new way of navigating information nets in windows explorer like widget. The problem on hand was how to export arbitrary knowledge bases in Matrix Browser. This was achieved by identifying the relationships present in knowledge bases and then by forming the hierarchies from this data and these hierarchies are being exported to matrix browser. This paper gives solution to this problem and informs about implementation work.
Common Knowledge in Interaction Structures
Venue: arXiv cs.LO 2009
Year: 2009

We consider two simple variants of a framework for reasoning about knowledge amongst communicating groups of players. Our goal is to clarify the resulting epistemic issues. In particular, we investigate what is the impact of common knowledge of the underlying hypergraph connecting the players, and under what conditions common knowledge distributes over disjunction. We also obtain two versions of the classic result that common knowledge cannot be achieved in the absence of a simultaneous event (here a message sent to the whole group).
Bounding the Probability of Error for High Precision Recognition
Venue: arXiv cs.CV 2009
Year: 2009

We consider models for which it is important, early in processing, to estimate some variables with high precision, but perhaps at relatively low rates of recall. If some variables can be identified with near certainty, then they can be conditioned upon, allowing further inference to be done efficiently. Specifically, we consider optical character recognition (OCR) systems that can be bootstrapped by identifying a subset of correctly translated document words with very high precision. This "clean set" is subsequently used as document-specific training data. While many current OCR systems produce measures of confidence for the identity of each letter or word, thresholding these confidence values, even at very high values, still produces some errors. We introduce a novel technique for identifying a set of correct words with very high precision. Rather than estimating posterior probabilities, we bound the probability that any given word is incorrect under very general assumptions, using an approximate worst case analysis. As a result, the parameters of the model are nearly irrelevant, and we are able to identify a subset of words, even in noisy documents, of which we are highly confident. On our set of 10 documents, we are able to identify about 6% of the words on average without making a single error. This ability to produce word lists with very high precision allows us to use a family of models which depends upon such clean word lists.