ppxscal/embedding_network huggingface dataset:
Display techniques in information-rich virtual environments
Authors: Doug Bowman, Chris North
Venue:  (2006)

Across domains, researchers, engineers, and designers are faced with large volumes of data that are heterogeneous in nature - including spatial, abstract, and temporal information. There are numerous design and technical challenges when considering the unification, management, and presentation of these information types. Most research and applications have focused on display techniques for each of the information types individually, but much less in known about how to represent the relationships between information types. This research explores the perceptual and usability impacts of data representations and layout algorithms for the next-generation of integrated information spaces. We propose Information-Rich Virtual Environments (IRVEs) as a solution to challenges of integrated information spaces. In this presentation, we will demonstrate the application requirements and foundational technology of IRVEs and articulate crucial tradeoffs in IRVE information design. We will present a design space and evaluation methodology to explore the usability effects of these tradeoffs. Experimental results will be presented for a series of empirical usability evaluations that increase our understanding of how these tradeoffs can be resolved to improve user performance. Finally, we interpret the results though the models of Information Theory and Human Information Processing to derive new conclusions regarding the role of perceptual cues in determining user performance in IRVEs. These lessons are posed as a set of design guidelines to aid developers of new IRVE interfaces and specifications.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation). The CD requires the following system requirements: Windows MediaPlayer or RealPlayer.
Ewens sampling formulae with and without selection
Authors: Thierry Huillet
Venue: Journal of Computational and Applied Mathematics (2007)

We shall first consider the random Dirichlet partitioning of the interval into n fragments at temperature @q>0. Using calculus for Dirichlet integrals, pre-asymptotic versions of the Ewens sampling formulae from finite Dirichlet partitions follow up. From these preliminaries, straightforward proofs of the usual sampling formulae from random proportions with Poisson-Dirichlet (PD)(@c) distribution can be obtained, while considering the Kingman limit n@?~, @q@?0, with n@q=@c>0. In this manuscript, the Gibbs version of the Dirichlet partition with symmetric selection is considered. By use of similar series expansion calculus for Dirichlet integrals, closed-form expressions of Ewens sampling formulae in the presence of selection are obtained; special types of Bell polynomials are shown to be involved.
A measure theoretic approach to information retrieval
Authors: Sándor Dominich, Tamás Kiezer
Venue: Journal of the American Society for Information Science and Technology (2007)

The vector space model of information retrieval is one of the classical and widely applied retrieval models. Paradoxically, it has been characterized by a discrepancy between its formal framework and implementable form. The underlying concepts of the vector space model are mathematical terms: linear space, vector, and inner product. However, in the vector space model, the mathematical meaning of these concepts is not preserved. They are used as mere computational constructs or metaphors. Thus, the vector space model actually does not follow formally from the mathematical concepts on which it has been claimed to rest. This problem has been recognized for more than two decades, but no proper solution has emerged so far. The present article proposes a solution to this problem. First, the concept of retrieval is defined based on the mathematical measure theory. Then, retrieval is particularized using fuzzy set theory. As a result, the retrieval function is conceived as the cardinality of the intersection of two fuzzy sets. This view makes it possible to build a connection to linear spaces. It is shown that the classical and the generalized vector space models, as well as the latent semantic indexing model, gain a correct formal background with which they are consistent. At the same time it becomes clear that the inner product is not a necessary ingredient of the vector space model, and hence of Information Retrieval (IR). The Principle of Object Invariance is introduced to handle this situation. Moreover, this view makes it possible to consistently formulate new retrieval methods: in linear space with general basis, entropy-based, and probability-based. It is also shown that Information Retrieval may be viewed as integral calculus, and thus it gains a very compact and elegant mathematical way of writing. Also, Information Retrieval may thus be conceived as an application of mathematical measure theory. &copy; 2007 Wiley Periodicals, Inc.
Matrix methods for lost data reconstruction in erasure codes
Authors: James Lee Hafner, Veera Deenadhayalan, K. K. Rao, John A. Tomlin
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Erasures codes, particularly those protecting against multiple failures in RAID disk arrays, provide a code-specific means for reconstruction of lost (erased) data. In the RAID application this is modeled as loss of strips so that reconstruction algorithms are usually optimized to reconstruct entire strips; that is, they apply only to highly correlated sector failures, i.e., sequential sectors on a lost disk. In this paper we address two more general problems: (1) recovery of lost data due to scattered or uncorrelated erasures and (2) recovery of partial (but sequential) data from a single lost disk (in the presence of any number of failures). The latter case may arise in the context of host IO to a partial strip on a lost disk. The methodology we propose for both problems is completely general and can be applied to any erasure code, but is most suitable for XOR-based codes. For the scattered erasures, typically due to hard errors on the disk (or combinations of hard errors and disk loss), our methodology provides for one of two outcomes for the data on each lost sector. Either the lost data is declared unrecoverable (in the information-theoretic sense) or it is declared recoverable and a formula is provided for the reconstruction that depends only on readable sectors. In short, the methodology is both complete and constructive.
A defense system on ddos attacks in mobile ad hoc networks
Authors: Drew Hamilton
Venue:  (2007)

Network security is a weak link in wired and wireless network systems. Malicious attacks have caused tremendous loss by impairing the functionalities of the computer networks. Denial of Service (DoS) and Distributed DoS (DDoS) attacks are two of the most harmful threats to the network functionality. Mobile Ad Hoc Networks (MANET) are even more vulnerable to such attacks. Ad Hoc On-Demand Distance Vector (AODV) is an outstanding wireless routing protocol. However, AODV has significant security vulnerabilities. Most current proposed security strategies for AODV or other MANET routing protocols require modifications of the protocols, or of the topology, or even both. Fixing the protocol flaws is obvious and straightforward. But it is impractical and infeasible for an operational commercial MANET. To circumscribe the attack traffic by deploying a large amount of the edge ingress control nodes or clustering the networks is effective. But it is costly and also requires protocol modification in some circumstances. The dissertation presents the security solution for AODV and AODV-like networks from a novel perspective. The proposed defense system is based on proxy-based overlay architecture. The proxy guard nodes control the service-related traffic, filter the malicious packets and reinforce the legitimate ones. It assumes a strong restriction on any secure modification on the objective MANET infrastructure. The proposed solution assures a minimum impact on the objective system infrastructure or the network communication interface to make it easy to implement and update, while providing an acceptable secure protection against DDoS attacks, such as Router Requirement (RREQ) flooding, data flooding and black-hole.
Automatic Partitioning of Parallel Loops for Cache-Coherent Multiprocessors
Authors: Anant Agarwal, David Kranz, Venkat Natarajan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

This paper presents a theoretical framework for automatically partitioning parallel loops to minimize cache coherency traffic on shared-memory multiprocessors. While several previous papers have looked at hyperplane partitioning of iteration spaces to reduce communication traffic, the problem of deriving the optimal tiling parameters for minimal communication in loops with general affine index expressions and multiple arrays hasremained open. Our paper solves this open problem by presenting a method for deriving an optimal hyperparallelepiped tiling of iteration spaces for minimal communication in multiprocessors with caches. We show that the same theoretical framework can also be used to determine optimal tiling parameters for data and loop partitioning in distributed memory multiprocessors without caches. Like previous papers, our framework uses matrices to represent iteration and data space mappings and the notion of uniformly intersecting references to capture temporal locality in array references. We introduce the notion of data footprints to estimate the communication traffic between processors and use lattice theory to compute precisely the size of data footprints. We have implemented a subset of this framework in a compiler for the Alewife machine.
Point-symmetric signal extension for tile-based image compression
Authors: I. Kharitonenko
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

A new method called point-symmetric signal extension is developed for finite-length signal sub-band decomposition providing perfect reconstruction. The proposed approach is considered as an alternative to the well-known symmetric signal extension in dealing with the boundary artifacts that manifest when tiles of images are lossy compressed. The new solution greatly reduces discontinuity between the adjacent tiles without requiring any post processing technique or additional information from the neighbouring tiles. A memory efficient implementation based upon the point-symmetric extension has been accepted into the Verification Model of the emerging JPEG2000 image compression standard.
Japanese Face Emotions Classification Using LIP Features
Authors: Mohamed Rizon, M. Karthigayan, Sazali Yaacob, R. Nagarajan
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

In this paper, lip features are applied to classify the human emotion using a set of irregular ellipse fitting equations using Genetic algorithm. As Japanese, is considered in this study. All six universally accepted emotions are considered for classifications. Lip is usually considered as one of the features for recognizing the emotion. In this work, three feature extraction methods are proposed and their respective performances are compared for determining the feature of the lips. The method which is fastest in extracting lip features is adopted in this study. Observation of various emotions of the subject lead to unique characteristic of lips. GA is adopted to optimize such irregular ellipse characteristics of the lip features in each emotion. That is, the top portion of lip configuration is a part of one ellipse and the bottom of different ellipse. Two ellipse based fitness equations are proposed for the lip configuration and relevant parameters that define the emotion. This has given reasonably successful emotion classifications for Japanese subject.
A fast algorithm for solving the Sylvester structured total least squares problem
Authors: Bingyu Li, Zhuojun Liu, Lihong Zhi
Venue: Signal Processing (2007)

In this paper, we develop a fast structured total least squares (STLS) algorithm for computing an approximate greatest common divisor (GCD) of two univariate polynomials. By exploiting the displacement structure of the Sylvester matrix and applying the generalized Schur algorithm, each single iteration of the proposed algorithm has quadratic computational complexity in the degrees of the given polynomials.
Improvements on the pronunciation prefix tree search organization
Authors: F. Alleva
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The need for ever more efficient search organizations persists as the size and complexity of the knowledge sources used in continuous speech recognition (CSR) tasks continues to increase. We address efficiency issues associated with a search organization based on pronunciation prefix trees (PPTs). In particular we present (1) a mechanism that eliminates redundant computations in non-reentrant trees, (2) a comparison of two methods for distributing language model probabilities in PPTs, and (3) report results on two look ahead pruning strategies. Using the 1994 DARPA 20 k NAB word bigram for the male segment of si dev5m 92 (the 5k speaker independent development test set for the WSJ), the error rate was 12.2% with a real-time factor of 1.0 on a 120 MHz Pentium.
Failure Prediction in Computational Grids
Authors: Woochul Kang, Andrew Grimshaw
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Accurate failure prediction in Grids is critical for reasoning about QoS guarantees such as job completion time and availability. Statistical methods can be used but they suffer from the fact that they are based on assumptions, such as time-homogeneity, that are often not true. In particular, periodic failures are not modeled well by statistical methods. In this paper, we present an alternative mechanism for failure prediction in which periodic failures are first determined and then filtered from the failure list. The remaining failures are then used in a traditional statistical method. We show that the use of prefiltering leads to an order of magnitude better predictions.
Comparisons of sequence labeling algorithms and extensions
Authors: Nam Nguyen, Yunsong Guo
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In this paper, we survey the current state-of-art models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron (AP), Structured SVMs (SVMstruct), Max Margin Markov Networks (M3N), and an integration of search and learning algorithm (SEARN). With all due tuning efforts of various parameters of each model, on the data sets we have applied the models to, we found that SVMstruct enjoys better performance compared with the others. In addition, we also propose a new method which we call the Structured Learning Ensemble (SLE) to combine these structured learning models. Empirical results show that our SLE algorithm provides more accurate solutions compared with the best results of the individual models.
Petri Net-Based Cooperation In Multi-Agent Systems
Authors: Y. T. Kotb, S. S. Beauchemin, J. L. Barron
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

We present a formal framework for robotic cooperation in which we use an extension to Petri nets, known as workflow nets, to establish a protocol among mobile agents based on the task coverage they maintain. Our choice is motivated by the fact that Petri nets handle concurrency and that goal reachability can be theoretically established. We describe the means by which cooperation is performed with Petri nets and analyze their structural and behavioral characteristics in order to show the correctness of our framework.
An artificial immune system-inspired multiobjective evolutionary algorithm with application to the detection of distributed computer network intrusions
Authors: Charles R. Haag, Gary B. Lamont, Paul D. Williams, Gilbert L. Peterson
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Today's signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and encoding it into a signature that is stored in its anomaly database, providing a window of vulnerability to computer systems during this time. Further, the maximum size of an Internet Protocol-based message requires the database to be huge in order to maintain possible signature combinations. In order to tighten this response cycle within storage constraints, this paper presents an innovative Artificial Immune System-inspired Multiobjective Evolutionary Algorithm. This distributed intrusion detection system (IDS) is intended to measure the vector of tradeoff solutions among detectors with regard to two independent objectives: best classification fitness and optimal hypervolume size. Our antibody detectors promiscuously monitor network traffic for exact and variant abnormal system events based on only the detector's own data structure and the application domain truth set, responding heuristically. Applied to the MIT-DARPA 1999 insider intrusion detection data set, our software engineered algorithm correctly classifies normal and abnormal events at a high level which is directly attributed to a detector affinity threshold.
SPRED: Active Queue Management Mechanism for Wide-Area Networks
Authors: Hiroyuki Ohsaki, Hideyuki Yamamoto, Makoto Imase
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

AQM (Active Queue Management) mechanism is a congestion control mechanism at a router for controlling the number of packets in the router's buffer by actively discarding an arriving packet. AQM mechanism can shorter the average delay in the router's buffer, and can also achieve high throughput. RED (Random Early Detection) is a representative AQM mechanism, which probabilistically discards an arriving packet. However, it is reported that the performance of RED degrades in a wide-area network with a large propagation delay. In this paper, we therefore propose an AQM mechanism called SPRED (Smith Predictor for Random Early Detection) for wide-area networks. The notable feature of SPRED is realizing high steady-state and transient-state performance by using a delay compensator called Smith Predictor for compensating a large feedback delay. In this paper, we show the effectiveness of SPRED by both analysis and simulation experiments.
Chromatogram Image Pre-Processing and Feature Extraction for Automatic Soil Analysis
Authors: V. Saritha, Mary Joseph Minu, Sukhendu Das, Deepak Khemani
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A circular paper chromatogram is obtained from an alkaline solution of silver nitrate and soil. The shape, size, color and textural patterns of the chromatogram image are hypothesized to contain important information of the mineral content in the soil. We present a method to automatically analyze the chromatogram image for feature extraction. Image pre-processing is an important step before extracting the features of the image. Chromatogram image preprocessing involves detecting the center of the chromatogram, normalization and then segmentation into different concentric regions. Since chromatogram patterns are similar to iris (human eye) patterns, we have adopted iris-preprocessing methods. In this paper, we present a combination of different approaches: to detect the center, normalize and segment the chromatogram. Centre detection algorithm finds the center of the chromatogram which is assumed as the origin for normalization. Chromatogram normalization involves transforming from Cartesian to polar coordinates, so that chromatogram looks like an unwrapped polar image. Finally, color texture segmentation is used to detect different regions. Results of feature extraction are compared to that given by soil experts to test the accuracy of the system.
An analysis of trace data for predictive file caching in mobile computing
Authors: Geoffrey H. Kuenning, Gerald J. Popek, Peter L. Reiher
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

One way to provide mobile computers with access to the resources of a network, even in the absence of communication, is to predict which information will be used during disconnection and cache the appropriate data while still connected. To determine the feasibility of this approach, traces of file-access activity for three diverse application domains were collected for periods of over two months. Analysis of these traces using traditional and new measures reveals that user working sets tend to be small compared to modern disk sizes, that users tend to reference the same files for several days or even weeks at a time, and that different users do not tend to write to the same file except in highly constrained circumstances. These factors encourage the conclusion that an automated caching system can be built for a wide variety of environments.
Fast Parallel Algorithms for Routing One-to-One Assignments in Benes Networks
Authors: Ching-Yi Lee, A. Yavuz Oruc
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

This paper presents new results on routing unicast (one-to-one) assignments over Benes networks. Parallel routing algorithms with polylogarithmic routing times have been reported earlier [10,8], but these algorithms can only route permutation assignments unless unused inputs are assigned to dummy outputs. This restriction is removed in this paper by using techniques taht permit bypassing idle or unused inputs without any increase in the order of routing cost or routing time.
Friend Pointer Registration Strategy and Its Scheme for Mobile Location Management
Authors: Daqing Xu, Hisao Kameda
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper proposes a new strategy called as FPR (Friend Pointer Registration) strategy for mobile location management, and applied this strategy in ATM mobile PNNI (Private Network to Network Interface) environment to form a new location management scheme called as FPRMP (Friend Pointer Registration in Mobile PNNI) scheme. The new concepts called as friend node, friend pointer and friend switch are introduced. This scheme relies on the FPR strategy, provides dynamically distributed efficient management for location information of the mobile nodes (MNs). This paper analyzes the performance of the FPRMP scheme, and compares it to the Mobile PNNI scheme, LR (Location Register) scheme and the LAMP (Location Agent Mobile PNNI) scheme. Results show that the FPRMP scheme incurs very lower average total cost (overhead) per move than the other three scheme except for very low CMR values, the signaling overhead and delay for mobile locating is greatly reduced.