ppxscal/embedding_network huggingface dataset:
Mining free text for structure
Authors: Vladimir A. Kulyukin, Robin Burke
Venue: Data mining: opportunities and challenges (2003)

Knowledge of the structural organization of information in documents can be of significant assistance to information systems that use documents as their knowledge bases. In particular, such knowledge is of use to information retrieval systems that retrieve documents in response to user queries. This chapter presents an approach to mining free-text documents for structure that is qualitative in nature. It complements the statistical and machine-learning approaches, insomuch as the structural organization of information in documents is discovered through mining free text for content markers left behind by document writers. The ultimate objective is to find scalable data mining (DM) solutions for free-text documents in exchange for modest knowledge-engineering requirements. The problem of mining free text for structure is addressed in the context of finding structural components of files of frequently asked questions (FAQs) associated with many USENET newsgroups. The chapter describes a system that mines FAQs for structural components. The chapter concludes with an outline of possible future trends in the structural mining of free text.
Characterizations of 1-Way Quantum Finite Automata
Authors: Alex Brodsky, Nicholas Pippenger
Venue:  (1999)

The 2-way quantum finite automaton introduced by Kondacs and Watrous\cite{KoWa97} can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two different models of 1-way quantum finite automata. The first model, termed measure-once quantum finite automata, was introduced by Moore and Crutchfield\cite{MoCr98}, and the second model, termed measure-many quantum finite automata, was introduced by Kondacs and Watrous\cite{KoWa97}. We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group. We also show that it can be simulated by a probabilistic finite automaton and describe an algorithm that determines if two measure-once automata are equivalent. We prove several closure properties of the classes of languages accepted by measure-many automata, including inverse homomorphisms, and provide a new necessary condition for a language to be accepted by the measure-many model with bounded error. Finally, we show that piecewise testable languages can be accepted with bounded error by a measure-many quantum finite automaton, in the process introducing new construction techniques for quantum automata.
MIX&MATCH: A CONSTRUCTION KIT FOR SCIENTIFIC VISUALIZATION (Ph.D. Thesis)
Authors: Naim Alper
Venue:  (1995)

A new, modular and extensible scientific visualization environment is presented. It provides the ability for a user to define a visualization technique from basic components through visual programming. Unlike data-flow based modular visualization environments, where the network defines a program and the end result is the visualization, the composition in Mix&Match defines the overall behavior of a tool. Different tools can be used to visualize the same data in different ways. High level mode-settings allow different modes of interaction without necessarily requiring changes in composition. This greatly enhances the level of interactivity and emphasizes the exploratory nature of scientific visualization. Another distinguishing feature of the environment is the finer granularity of the components. Finer granularity allows greater flexibility in composition and results in a rich collection of techniques. The components are simple and small, permitting new ones to be readily added to the system, thereby encouraging the exploration of new visualization techniques. This is facilitated by an easy to use configuration manager. The tool behaviors are based on the same simple, particle based, template which acts as a unifying representation for visualization techniques. In addition to the development of the environment, traditional techniques are decomposed to fit this template and new visualization techniques are developed.
Opportunistic Logic Program Analysis and Optimisation:Enhanced Schema-Based Transformations for Logic Programs and their Usagein an Opportunistic Framework for Program Analysis and Optimisation
Authors: Wamberto W. Vasconcelos, Norbert E. Fuchs
Venue:  (1995)

A program schema is a generic description of a logic program highlighting important features and suppressing unimportant ones. A schema-based transformation is an abstract description of syntactic changes that transform programs into more efficient ones while preserving their meaning. We define an enhanced schema language that can be used to describe concisely a very large class of logic programs and their transformations. We present a realistic framework to automatically transform a complete program in an opportunistic way: all available schema-based transformations are systematically matched against the program, and if the matching is successful, the suggested alterations are carried out. Heuristic selection criteria guarantee that the optimal sequence of transformations is performed. We have implemented OpTiS, a prototypical transformation system, based on these ideas.
Minimum Distance Error Recovery for LR Parsers
Authors: J. A. Dain
Venue:  (1992)

We present a method for recovering from syntax errors encountered during parsing. The method provides a form of minimum distance repair, has linear time complexity, and is completely automatic. It is incorporated into the LR parser-generator yacc in such a way that the compiler writer can generate a parser with recovery without providing any additional information to yacc |Error messages phrased in terms of source input are generated automatically. We present a formal method for evaluating the performance of error recovery methods, based on global minimum-distance error correction, and show that the error recovery method presented achieves a theoretically best performance on 80 percent of Pascal programs in the Ripley-Druseikis collection. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Additional Requirements for Matrix \& Transposed Matrix Products
Authors: M. Kaminski, David G. Kirkpatrick, N. H. Bshouty
Venue:  (1986)

Let $M$ be an $s \times t$ matrix and let $M^{T}$ be the transpose of $M$. Let {\bf x} and {\bf y} be $t$- and $s$-dimensional indeterminate column vectors, respectively. We show that any linear algorithm $A$ that computes $M${\bf x} has associated with it a natural dual linear algorithm denoted $A^{T}$ that computes $M^{T}${\bf y}. Furthermore, if $M$ has no zero rows or columns then the number of additions used by $A^{T}$ exceeds the number of additions used by $A$ by exactly $s-t$. In addition, a strong correspondence is established between linear algorithms that compute the product $M{\bf x}$ and bilinear algorithms that compute the bilinear form ${\bf y}^{T}M{\bf x}$.}
Discrete Conservative Approximation of Hybrid Systems
Authors: Carl Seger, Andrew Martin
Venue:  (1993)

Systems that are modeled using both continuous and discrete mathematics are commonly called hybrid systems. Although much work has been done to develop frameworks in which both types of systems can be handled at the same time, this is often a very difficult task. Verifying that desired properties hold in such hybrid models is even more daunting. In this paper we attack the problem from a different direction. First we make a distinction between two models of the system. A detailed model is developed as accurately as possible. Ultimately, one must trust in its correctness. An abstract model, which is typically less detailed, is actually used to verify properties of the system. The detailed model is typically defined in terms of both continuous and discrete mathematics, whereas the abstract one is typically discrete. We formally define the concept of conservative approximation, a relationship between models, that holds with respect to a translation between the questions that can be asked of them. We then progress by developing a theory that allows us to build a complicated detailed model by combining simple primitives, while simultaneously, building a conservative approximation, by similarly combining pre-defined parameterised approximations of those primitives.
Portals: your institution's reputation depends on them
Authors: William H. Graves, Kirsten Hale
Venue: Designing portals: opportunities and challenges (2003)

Whether 18 years old and raised on the Internet or an adult seeking the convenience of online service, today's student expects personalizable, online self-service, along with high-touch access to help when self-service falters. Personalizable, online self-service is the promise of the campus portal, a promise that can be achieved and afforded if colleges and universities take seriously the challenge to transform and redesign the form and substance of their high-touch interactions with students and other stakeholders.
A Relational Notation for State Transition Systems
Authors: Simon S. Lam, A. U Shankar
Venue:  (1989)

The relational notation has two basic constructs: state formulas that represent sets of states, and event formulas that represent sets of state transitions. A relational specification consists of a state transition system, given in the relational notation, and a set of fairness assumptions. Several refinement relations between specifications are defined. To illustrate our concepts and methods, three specifications of the alternating-bit protocol are given. We also apply the theory to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. Our approach is compared with the approaches of other authors.
A Fast Heuristic For Finding The Minimum Weight Triangulation
Authors: Ronald Beirouti
Venue:  (1997)

No polynomial time algorithm is known to compute the minimum weight triangulation MWT of a point set. In this thesis we present an efficient implementation of the LMT-skeleton heuristic. This heuristic computes a subgraph of the MWT of a point set from which the MWT can usually be completed. For uniformly distributed sets of tens of thousands of points our algorithm constructs the exact MWT in expected linear time and space. A fast heuristic, other than being usefull in areas such as stock cutting, finite element analysis, and terrain modeling, allows to experiment with different point sets in order to explore the complexity of the MWT problem. We present point sets constructed with this implementation such that the LMT-skeleton heuristic does not produce a complete graph and can not compute the MWT in polynomial time, or that can be used to prove the NP-Hardness of the MWT problem.
Professionalism in Computing: A Web-Based Learning System
Authors: Lee John A.N.
Venue:  (1997)

Starting from a project to develop a digital library for a Computer Science course studying social impact and computer ethics, a highly interactive Web-based learning system is in the process of development. Capable of supporting a variety of teaching/learning environments, the system is intended to support teachers whose disciplinary primary interest is other than social impact and ethics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Core Legion Object Model
Authors: Michael J. Lewis, Andrew Grimshaw
Venue:  (1995)

This document describes the core Legion object model. The model specifies the composition and functionality of Legion''s core objects - those objects that cooperate to create, locate, manage, and remove objects from the Legion system. The model reflects the underlying philosophy and objectives of the Legion project. In particular, the object model facilitates a flexible extensible implementation, provides a single persistent name space, grants site autonomy to participating organizations, and scales to millions of sites and trillions of objects. Further, it offers a framework that is well suited to providing mechanisms for high performance, security, fault tolerance, and commerce.
The UAN: A User-Oriented Representation for Direct ManipulationInterface Designs
Authors: H. R Hartson, Antonio C. Siochi, Deborah Hix
Venue:  (1990)

Almost all existing interface representation techniques, especially those associated with UIMS, are constructional, focused on interface implementation, and therefore do not adequately support a user-centered focus. But it is the behavioral domain of the user that interface designers and evaluators do their work. We are seeking to complement constructional methods by providing a tool supported technique capable of specifying the behavioral aspects of an interactive system -- the tasks and the actions a user performs to accomplish those tasks. In particular, this paper is a practical introduction to use of the User Action Notation (UAN), a task- and User-oriented notation for behavioral representation of asynchronous, direct manipulation interface designs. Interfaces are specified in the UAN as a quasi-hierarchy of asynchronous tasks. At the lower levels, user actions are associated with feedback and system state changes. The notation makes use of visually onomatopoeic symbols, and is simple enough to read without much instruction. The UAN has been used by growing numbers of interface developers and researchers over the past few years. In addition to its design role, current research is investigating how the UAN can support the production and maintenance of code and documentation.
Spatial Context in Recognition
Authors: M. Bar, S. Ullman
Venue:  (1993)

In recognizing objects and scenes, partial recognition of objects or their parts could be used to guide the recognition of other objects. Here, we investigated psychophysically the role of local features in the recognition of complete figures, and the influence of contextual information on the identification of ambiguous features. We used configurations of features that were placed in either proper or improper spatial relations, and measured response times and error rates in a recognition task. Two main results were obtained. First, proper spatial relations among the features of a scene decrease response times and error rates in the recognition of individual features. Second, the presence of features that have a unique interpretation in the scene disambiguates the identity of ambiguous features faster and with less errors compared with the same features that appear in isolation, or in imporper spatial relations. The implications of these findings to the organization of recognition memory are discussed, and a framework for a model for using spatial context, which uses the psychophysical findings, is proposed.
Non-linear behaviour, failure loads and inelastic buckling of multispan cable-stayed bridges
Authors: M. M. Bakhoum, G. Helmy, W. A. Attia, M. Mourad
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The Nonlinear behavior of Multispan Cable-Stayed Bridge (MCSB) is investigated in this paper. Both Geometric and Material Nonlinearities are considered. Analysis up to failure of several configurations of MCSB are conducted, and the load - deformation curves are drawn. Four different types of failure loads are computed in terms of (1) MNL analysis only, (2) MNL and GNL, (3) Elastic Buckling load, (4) Inelastic Buckling load. These failure loads - or ultimate capacities - of the different MCSB are compared.
Aspect-Oriented Incremental Customization of Middleware Services
Authors: Alex Brodsky, Dima Brodsky, Ida Chan, Yvonne Coady, Jody Pomkoski, Gregor Kiczales
Venue:  (2001)

As distributed applications evolve, incremental customization of middleware services is often required; these customizations should be unpluggable, modular, and efficient. This is difficult to achieve because the customizations depend on both application-specific needs and the services provided. Although middleware allows programmers to separate application-specific functionality from lower-level details, traditional methods of customization do not allow efficient modularization. Currently, making even minor changes to customize middleware is complicated by the lack of locality. Programmers may have to compromise between the two extremes: to interpose a simple, well-localized layer of functionality between the application and middleware, or to make a large number of small, poorly localized, invasive changes to all execution points which interact with middleware services. Although the invasive approach allows a more efficient customization, it is harder to ensure consistency, more tedious to implement, and exceedingly difficult to unplug. Thus, a common approach is to add an extra layer for systemic concerns such as robustness, caching, filtering, and security. Aspect-oriented programming (AOP) offers a potential alternative between the interposition and invasive approaches by providing modular support for the implementation of crosscutting concerns. AOP enables the implementation of efficient customizations in a structured and unpluggable manner. We demonstrate this approach by comparing traditional and AOP customizations of fault tolerance in a distributed file system model, JNFS. Our results show that using AOP can reduce the amount of invasive code to almost zero, improve efficiency by leveraging the existing application behaviour, and facilitate incremental customization and extension of middleware services.
Reducing the Mean Time to Remove Faults Through Early Fault Detection, An Experiment in Independent Verification and Validation
Authors: James D. Arthur, Sanjay Gupta, Markus Groener, Martha Cannon, Zakia Khan
Venue:  (1996)

This paper presents the results of a study investigating the extent to which Independent Verification and Validation (IV&V) impacts early fault detection, and consequently, the mean time to remove faults. Two separate development groups, one with an IV&V team, are tasked to produce a software system from the same set of requirements. For each development phase, fault detection and removal data are recorded. An analysis of that data reveals that the group having the IV&V contingent: (a) detected errors earlier in the software development process, and (b) on the average, required substantially less time to remove those faults.
The Hough Transform versus the UpWrite
Authors: Robert A. McLaughlin, Michael Alder
Venue:  (1998)

This paper compares the Hough Transform and the UpWrite for the detection of lines, circles and ellipses. Both ideal and noisy images are tested. The UpWrite is found to be more robust for images containing perturbation noise. For ideal images and images with speckle noise, the results are found to depend on the complexity of the object being detected, with more complex objects favouring the UpWrite. A program allowing the reader to experiment with these algorithms can be found at the WWW address http://ciips.ee.uwa.edu.au/Papers/Journal_Papers/1998/02/Index.html
RAPID EXPLORATION OF CURVILINEAR GRIDS USING DIRECT VOLUME RENDERING
Authors: Allen VanGelder, Jane Wilhelms
Venue:  (1993)

Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational fluid dynamics and finite element analysis. Four new projection methods are presented and compared with each other and with previous methods for tetrahedral grids and rectilinear grids. All four methods use polygon-rendering hardware for speed. A simplified algorithm for visibility ordering, which is based on a combination of breadth-first and depth-first searches, is described. A new multi-pass blending method is described that reduces visual artifacts that are introduced by linear interpolation in hardware where exponential interpolation is needed. Multi-pass blending is of equal interest to hardware-oriented projection methods used on rectilinear grids. Visualization tools that permit rapid data banding and cycling through transfer functions, as well as region restriction, are described.
Multiscale Algorithm for Atmospheric Data Assimilation Part I.&#x00A0;Multiscale Iterative Process
Authors: A. Brandt, L. Zaslavsky
Venue:  (1995)

A multiscale algorithm for the problem of optimal statistical interpolation of the observed data has been developed. This problem includes the calculation of the vector of the ``analyzed'''' (best estimated) atmosphere flow field wa by the formula wa = wf+PfHTy, whre the quantity y is defined by the equation (HPfHT+R)y = wo-Hwf, using the given model forecast first guess wf and the vector of observations wo. H is an interpolation operator from the regular grid to the observation network, Pf is the forecast error covariance matrix, and R is the observation error covariance matrix. At this initial stage the case of univariate analysis of single level radiosonde height data is considered. The matrix R is assumed to be diagonal, and the matrix Pf to be given by the formula Pfij = sfimijsfj, where mij is a smooth decreasing function of the distance between the ith and the jth points. Two different multiscale constructions can be used for efficient solving the probelm of optimal statistical interpolation: a technique for fast evaluation of the discrete integral transform ?i Pfijvj, and a fast iterative process which effectively works with a sequence of spatial scales. In this paper we describe a multiscale iterative process based on a multiresolution simultaneous displacement technique and a localized variational calculation of iteration parameters.
Adaptive algorithms vs. Time Warp: An analytical comparison
Authors: Paul F. Reynolds,  Jr.
Venue:  (1995)

Adaptive synchronization algorithms have been proposed to improve upon purely conservative and purely optimisitic algorithms. Experimental studies have have indeed provided encouraging results. In the spirit of previous analyses, we present the first known analytical comparison of adaptively optimisitic algorithms with the Time Warp protocol. We define a class of adaptive protocols, the asynchronous adaptive waiting protocols (AAWP''s) and identify several practical protocols that belong to this class. We show that Time Warp can outperform an AAWP arbitrarily. We describe NPSI adaptive protocols, a sub-class of AAWP''s, and specify a member of this sub-class, the Elastic Time Algorithm. We show that this algorithm can outperform Time Warp arbitrarily.