ppxscal/embedding_network huggingface dataset:
Towards autonomic web-sites based on learning automata
Authors: Pradeep S, Chitra Ramachandran, Srinath Srinivasa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Autonomics or self-reorganization becomes pertinent for web-sites serving a large number of users with highly varying workloads. An important component of self-adaptation is to model the behaviour of users and adapt accordingly. This paper proposes a learning-automata based technique for model discovery. User access patterns are used to construct an FSM model of user behaviour that in turn is used for prediction and prefetching. The proposed technique uses a generalization algorithm to classify behaviour patterns into a small number of generalized classes. It has been tested on both synthetic and live data-sets and has shown a prediction hit-rate of up to 89% on a real web-site.
PRC Inc.: description of the Paktus system used for MUC-4
Authors: Bruce Loatman
Venue: Proceedings of the 4th conference on Message understanding (1992)

The PRC Adaptive Knowledge-based Text Understanding System (PAKTUS) has been under development as an Independent Research and Development project at PRC since 1984. It includes a core English lexicon and grammar, a concept network, processes for applying these to lexical, syntactic, semantic, and discourse analysis, and tools that support the adaptation of the generic core to new domains, primarily by acquiring sublanguage and domain-specific lexicon and conceptual topic patterns of interest. The lexical, syntactic, and semantic analysis components were completed before MUC-4 and required little adaptation. The discourse analysis component is new and was completed in the course of applying the system to MUC-4, although it is generic. The overall system is described in [1]. The present description concentrates on discourse analysis.
Marketing strategies for electroacoustics and computer music
Authors: Rosemary Mountain
Venue: Organised Sound (2004)

This article explores possible strategies for appraising electroacoustic and computer music to enhance &lsquo;marketability&rsquo;. It is proposed that the specific aesthetics, characteristics and function of a work may be more salient features than those of the medium of composition (e.g. computer) to many listeners. It is suggested that the common practice of focusing on chronology, geography and specific schools is becoming less relevant due to a proliferation of home studios, the internet, and an increasing saturation of electronic sounds in new media contexts. On the other hand, aspects of form, mood, timbral palette, rhythmic complexity, etc., may become very useful bases for choosing works for a compilation CD or concert programme. The inadequacies of musicians' discourse for describing such attributes leads to the incorporation of analogies from visual and performing arts as well as a discussion of other possible approaches to &lsquo;labelling&rsquo; and the inherent dangers in such a task. In conclusion, it is proposed that the time is ripe for shuffling the categories and regrouping composers' works according to aesthetic preferences, regardless of the percentage of electronic&#x002F;computer content.
Measuring IP and TCP behavior on edge nodes with Tstat
Authors: M. Mellia, R. Lo Cigno, F. Neri
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

Field measurements have always been the starting point for network design and planning; however, their statistical analysis beyond simple traffic volume estimation is not so common. In this paper we present and discuss Tstat, a tool for the collection and statistical analysis of TCP/IP traffic, which, in addition to recognized performance figures, infers TCP connection status from traces. Besides briefly discussing its rationale and use, we present part of the performance figures that can be obtained, and we highlight the insight that such figures can give on TCP/IP protocols and the Internet, thereby supporting the usefulness of a widespread use of Tstat or similar tools.Analyzing Internet traffic is difficult because a large amount of performance figures can be devised in TCP/IP networks, but also because many performance figures can be derived only if both directions of bidirectional traffic are jointly considered. Tstat automatically correlates incoming and outgoing packets. Sophisticated statistics, obtained through data correlation between incoming and outgoing traffic, give reliable estimates of the network performance also from the user perspective.Tstat computes over 80 different performance statistics at both the IP and TCP layers, allowing a good insight in the network performance. To support the latter statement, we discuss several of these figures computed on traffic measurements performed for a time period equivalent to more than three months spread during the years 2000-2003 on the access link of Politecnico di Torino.
A Spatiotemporal Query Service for Mobile Users in Sensor Networks
Authors: Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A noveljust-in-time prefetching algorithm enables MobiQuery to maintain robust spatiotemporal guarantees even when nodes operate under extremely low duty cycles. Furthermore, it significantly reduces the storage cost and network contention caused by continuous queries from mobile users. We validate our approach through both theoretical analysis and simulation results under a range of realistic settings.
Potential Discrepancies in Radar Signature Predictions for Ground Vehicles
Authors: William Coburn, Calvin Le, William Spurgeon
Venue: Proceedings of the 2004 Users Group Conference (2004)

An investigation of modeling issues at Ka-Band and above was conducted using Xpatch, a high-frequency radar signature prediction code based on the shooting and bouncing ray technique. The lessons learned apply to a large class of ground targets of interest for millimeter wave radar applications. We summarize the unclassified modeling results and computational requirements at Ka-band frequencies. The ground vehicle simulations indicate that accurate target representations are required to a resolution on the order of the wavelength. In many cases the available data corresponds to near-field measurements. In this case we use the Xpatch near-field simulations to better reproduce the measured radar signatures.
The equational theory of regular words
Authors: Stephen L. Bloom, Zoltán Ésik
Venue: Information and Computation (2005)

Courcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regular trees. Heilbrunner showed that a nonempty word is regular if it can be generated from the singletons by the operations of concatenation, omega power, omega-op power, and the infinite family of shuffle operations. We prove that the algebra of nonempty regular words on the set A, equipped with these operations, is freely generated by A in a variety which is axiomatizable by an infinite collection of some natural equations. We also show that this variety has no finite equational basis and that its equational theory is decidable in polynomial time.
A neural network based multi-classifier system for gene identification in DNA sequences
Authors: Romesh Ranawana, Vasile Palade
Venue: Neural Computing and Applications (2005)

The paper presents a neural network based multi-classifier system for the identification of Escherichia coli promoter sequences in strings of DNA. As each gene in DNA is preceded by a promoter sequence, the successful location of an E. coli promoter leads to the identification of the corresponding E. coli gene in the DNA sequence. A set of 324 known E. coli promoters and a set of 429 known non-promoter sequences were encoded using four different encoding methods. The encoded sequences were then used to train four different neural networks. The classification results of the four individual neural networks were then combined through an aggregation function, which used a variation of the logarithmic opinion pool method. The weights of this function were determined by a genetic algorithm. The multi-classifier system was then tested on 159 known promoter sequences and 171 non-promoter sequences not contained in the training set. The results obtained through this study proved that the same data set, when presented to neural networks in different forms, can provide slightly varying results. It also proves that when different opinions of more classifiers on the same input data are integrated within a multi-classifier system, we can obtain results that are better than the individual performances of the neural networks. The performances of our multi-classifier system outperform the results of other prediction systems for E. coli promoters developed so far.
On the convergence of two-point partial Padé approximants for meromorphic functions of Stieltjes type
Authors: C. Díaz-Mendoza, P. González-Vera, R. Orive
Venue: Applied Numerical Mathematics (2005)

Let µ be a (possibly complex) measure on R+ = [0, ∞) such that ∫xn d|µ|(x) < +∞, n ∈ Z. Let r denote a rational function whose poles lie in C\R+ and r (∞) = 0. We consider two-point rational interpolants to the function f(z) = ∫dµ(x)/z - x + r(z), where some poles are prescribed in advance and the others are left free. We show that if the prescribed poles are chosen conveniently, then sequences of two-point rational approximants converge geometrically to f on compact subsets of C\R+ away from the poles of r. Estimates of the rate of convergence along with some numerical experiments are also given.
Two algorithms for fast reclustering of dynamic meshed surfaces
Authors: Nathan A. Carr, John C. Hart
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two novel approaches for maintaining mesh clusterings on dynamically deforming meshes. The first approach maintains a complete face cluster tree hierarchy using a randomized data structure. The second algorithm maintains a mesh decomposition for a fixed set of clusters. With both algorithms we are able to maintain clusterings on dynamically deforming surfaces of over 100K faces in fractions of a second.
CodeCrawler: an information visualization tool for program comprehension
Authors: Michele Lanza, Stéphane Ducasse, Harald Gall, Martin Pinzger
Venue: Proceedings of the 27th international conference on Software engineering (2005)

CodeCrawler (in the remainder of the text CC) is a language independent, interactive, information visualization tool. It is mainly targeted at visualizing object-oriented software, and has been successfully validated in several industrial case studies over the past few years. CC adheres to lightweight principles: it implements and visualizes polymetric views, visualizations of software enriched with information such as software metrics and other source code semantics. CC is built on top of Moose, an extensible language independent reengineering environment that implements the FAMIX metamodel. In its last implementation, CC has become a general-purpose information visualization tool.
Fast Converging Adaptive MMSE Multiuser Detector for DS-CDMA System
Authors: Zhiwei Mao, Vijay K. Bhargava
Venue: Wireless Personal Communications: An International Journal (2005)

A fast converging adaptive minimum-mean-squared-error (MMSE) multiuser detector is proposed for direct-sequence code-division multiple-access (DS-CDMA) systems with severe near-far problem where the convergence rate of adaptive MMSE detectors for distinct users can be very different. It is shown that by successively cancelling the interference signals of strong power users, the convergence rate of the proposed detectors for weak power users can be significantly increased, which helps to reduce the length of training sequence for tracking. It is also shown that the order of cancellation and several important parameters required for interference cancellation can be determined from the convergence behavior of the proposed detector. Numerical results are presented to show that the proposed detector offers improved performance in various DS-CDMA environments.
Red Hat Linux Fedora 3 Unleashed (Unleashed)
Authors: Billy Ball, Hoyt Duff
Venue:  (2004)

Keeping with the tradition of offering the best and most comprehensive coverage of Red Hat Linux on the market, Red Hat Fedora 3 Unleashed includes new and additional materials based on the latest release of Red Hat's Fedora Core Linux distribution. Incorporating an advanced approach, the information presented aims to provide you with the best and latest information about installation, configuration, system administration, server operations and security. Updated discussions of the architecture of several Linux issues, as well as material on new applications, peripherals and Web development are also included. Get the most out of the latest Red Hat Linux distribution with Red Hat Fedora 3 Unleashed.
Nanoscale system dynamical behaviors: from quantum-dot-based cell to 1-D arrays
Authors: Luigi Fortuna, Manuela La Rosa, Donata Nicolosi, Domenico Porto
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

In this paper, we consider coupled quantum-dot cells, which are usually used for quantum-dot cellular automata, to build nanoscale dynamical systems. In particular, it is shown how the simple connection of few quantum-dot cells, quantum cellular non-linear networks (Q-CNNs), can cause the onset of chaotic oscillations. Complex dynamics can be obtained only with small differences of polarizations and parameters. Local activity conditions are investigated for a two-cells case satisfying the criteria for the generation of complex spatio-temporal behaviors. The richness of dynamics of quantum CNNs is also emphasized through examples of synchronization in an array of so-built oscillators, in both cases of identical parameters and spatial dissymmetry.
A Unified Stochastic Model for Detecting and Tracking Faces
Authors: Sachin Gangaputra, Donald Geman
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We propose merging face detection and face tracking into a single probabilistic framework. The motivation stems from a broader project in algorithmic modeling, centered on the design and analysis of the online computational process in visual recognition. Detection is represented as a tree-structured graphical network in which likelihoods are assigned to each history or "trace" of processing, thereby introducing a new probabilistic component into coarse-to-fine search strategies. When embedded within a temporal Markov framework, the resulting tracking system yields encouraging results.
Component Metadata Management and Publication for the Grid
Authors: Diego Puppin, Fabrizio Silvestri, Domenico Laforenza
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

There is growing attention to component-oriented software design of Grid applications.Within this framework, applications are built by assembling together independently developed software components. Two main approaches are commonly used to manage, develop and publish software components: one is based on an Interface Description Language (IDL); the other is typical, for instance, of Java and is based on introspection and design conventions. In this paper, we compare them and we propose a third approach that merges the flexibility and fast learning curve of the latter, with the rigor of the former. Our proposal is meant to help the transition towards more modern tools, which is required to develop versatile Grid applications.
The modeling system for ecological expertise of composite technogenic complexes
Authors: B. T. Suimenbaev, I. I. Grachev, V. V. Colovyev
Venue: Mathematics and Computers in Simulation (2004)

The integrated system of modeling for ecological assessment of complex technogenic systems (CST) has been introduced in this paper, It has been implemented in the shape of topside on test shells which consolidates specialized program packages, mathematical systems and spreadsheets.
Studying protein folding on the Grid: experiences using CHARMM on NPACI resources under Legion: Research Articles
Authors: Anand Natrajan, Michael Crowley, Nancy Wilkins-Diehr, Marty A. Humphrey, Anthony D. Fox, Andrew S. Grimshaw, Charles L. Brooks,  III
Venue: Concurrency and Computation: Practice Experience (2004)

One benefit of a computational Grid is the ability to run high-performance applications over distributed resources simply and securely. We demonstrated this benefit with an experiment in which we studied the protein-folding process with the CHARMM molecular simulation package over a Grid managed by Legion, a Grid operating system. High-performance applications can take advantage of Grid resources if the Grid operating system provides both low-level functionality as well as high-level services. We describe the nature of services provided by Legion for high-performance applications. Our experiences indicate that human factors continue to play a crucial role in the configuration of Grid resources, underlying resources can be problematic, Grid services must tolerate underlying problems or inform the user, and high-level services must continue to evolve to meet user requirements. Our experiment not only helped a scientist perform an important study, but also showed the viability of an integrated approach such as Legion's for managing a Grid. Copyright &copy; 2004 John Wiley & Sons, Ltd.An earlier version of this paper has been published under the same title in the Proceedings of the 10th International Symposium on High Performance Distributed Computing (HPDC-10) [1]
A neural-network-based approach for post-fabrication circuit tuning
Authors: A. El-Gamal, L. Abdel-Malek, A. Sorour
Venue: Neural Computing and Applications (2005)

A hierarchical neural-network-based approach for circuit tuning at the post-fabrication stage is proposed. In this approach, measurements that characterize the behavior of the circuit under test are first selected. The best candidates of circuit parameters for tuning are also determined. A training set comprising the selected circuit measurements is then constructed. These measurements are calculated during simulations in which the circuit parameter values are uniformly distributed in a tolerance region around their nominal values. The training set is fed to a self organizing map neural network to cluster the measurements. The generated clusters are manipulated and classified via a hierarchical circuit tuning procedure. Based on this classification, tuning values for the tuning parameters are calculated. Situations in which the circuit cannot be tuned are also addressed. Experimental results indicate that the developed approach provides a robust and efficient technique for circuit tuning.
The Fisher-Rao Metric for Projective Transformations of the Line
Authors: Stephen J. Maybank
Venue: International Journal of Computer Vision (2005)

A conditional probability density function is defined for measurements arising from a projective transformation of the line. The conditional density is a member of a parameterised family of densities in which the parameter takes values in the three dimensional manifold of projective transformations of the line. The Fisher information of the family defines on the manifold a Riemannian metric known as the Fisher-Rao metric. The Fisher-Rao metric has an approximation which is accurate if the variance of the measurement errors is small. It is shown that the manifold of parameter values has a finite volume under the approximating metric.These results are the basis of a simple algorithm for detecting those projective transformations of the line which are compatible with a given set of measurements. The algorithm searches a finite list of representative parameter values for those values compatible with the measurements. Experiments with the algorithm suggest that it can detect a projective transformation of the line even when the correspondences between the components of the measurements in the domain and the range of the projective transformation are unknown.
Managing a Relational Database with Intelligent Agents
Authors: Ira Rudowsky, Olga Kulyba, Mikhail Kunin, Dmitri Ogarodnikov, Theodore Raphan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

A prototype relational database system was developed that has indexing capability, which threads into data acquisition and analysis programs used by a wide range of researchers. To streamline the user interface and table design, free-formatted table entries were used as descriptors for experiments. This approach potentially could increase data entry errors, compromising system index and retrieval capabilities. A methodology of integrating intelligent agents with the relational database was developed to cleanse and improve the data quality for search and retrieval. An intelligent agent was designed using JACK¿ (Agent Oriented Software Group) and integrated with an Oracle-based relational database. The system was tested by triggering agent corrective measures and was found to improve the quality of the data entries. Wider testing protocols and metrics for assessing its performance are subjects for future studies. This methodology for designing intelligent-based database systems should be useful in developing robust larges-cale database systems.
Preliminary evaluation of the interactive drama facade
Authors: Rachel Lee Knickmeyer, Michael Mateas
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

There is growing interest in technologies that support user experiences emphasizing aesthetic satisfaction and enjoyment rather than task accomplishment. Evaluating such experiences remains an open research problem. Here we describe a methodology for evaluating the interactive drama Façade, and present the first experimental results. Interactive dramas are "pure" hedonic experiences, forcing a focus on experience quality rather than efficiency and ease of use. Through the coding of retroactive protocols, we reveal play patterns whereby interaction failures are leveraged into new player goals, thus supporting players in maintaining positive interest in the experience even in the face of interaction failures.
Intrusion prevention systems
Authors: Nick Ierace
Venue: Ubiquity (2005)

Intrusion Prevention Systems are an important component of IT systems defense, and without this technology our data and our networks are much more susceptible to malicious activities.
Node-pancyclicity and edge-pancyclicity of crossed cubes
Authors: Jianxi Fan, Xiaola Lin, Xiaohua Jia
Venue: Information Processing Letters (2005)

Crossed cubes are important variants of the hypercubes. It has been proven that crossed cubes have attractive properties in Hamiltonian connectivity and pancyclicity. In this paper, we study two stronger features of crossed cubes. We prove that the n-dimensional crossed cube is not only node-pancyclic but also edge-pancyclic for n ≥ 2. We also show that the similar property holds for hypercubes.