ppxscal/embedding_network huggingface dataset:
Ein Verfahren zur Klassifikation der Aquivalenzklassen einer Gruppenwirkungmit Anwendungen in der Mustererkennung
Authors: Hanns Schulz-Mirbach
Venue:  (1991)

Eine der Hauptaufgaben der Mustererkennung ist die Zuordnung eines vorgelegten Musters zu einer bestimmten Bedeutungsklasse. Man denke beispielsweise an die automatische Werkst ckerkennung im industriellen Umfeld. Die ber den Me wertaufnehmer gewonnene Information ist im Hinblick auf die Klassifikation meistens hochgradig redundant. So ist f r die Werkst ckerkennung die Beleuchtungsst rke und die Orientierung der Objekte im Raum uninteressant. Oftmals l t sich die Redundanz im Signalraum auf die Wirkung einer geeigneten Gruppe zur ckf hren. Im Beispiel der Werkst ckerkennung k nnte dies die Gruppe der Rotationen und Translationen sein. Die Gruppenwirkung induziert eine Aufspaltung des Signalraums in disjunkte quivalenzklassen. F r Klassifikationszwecke ist man nur an den jeweiligen quivalenzklassen interessiert. Daher soll die Abbildung in den Merkmalraum jede quivalenzklasse in einen Punkt berf hren. Um dabei keine relevanten Informationen zu verlieren mu sichergestellt werden, da disjunkte quivalenzklassen auf verschiedene Punkte im Merkmalraum abgebildet werden. Signal- und Merkmalraum lassen sich in nahezu allen F llen als Teilmengen von geeigneten komplexen Vektorr umen auffassen. Da die Abbildung zwischen diesen R umen auf einem Rechner in endlicher Zeit realisiert werden soll, ist man gezwungen sich auf polynomiale Funktionen zu beschr nken (unendliche Potenzreihen sind beispielsweise ungeeignet). Wir werden unter diesen Rahmenbedingungen (Redundanz durch Gruppenwirkung, polynomiale Abbildungen) eine allgemeine Theorie entwickeln, die ein handliches Kriterium liefert, um zu entscheiden ob eine Abbildung vom Signal- in den Merkmalraum mit den geforderten Eigenschaften existiert. Im Gegensatz zu den meisten aus der Literatur ber Mustererkennung bekannten Ans tzen machen wir hier weder Einschr nkungen an die betrachtete Musterklasse noch an die Symmetriegruppen.
The Complexity of Constraint Satisfaction Revisited
Authors: Alan K. Mackworth, Eugene C. Freuder
Venue:  (1992)

This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency algorithms for constraint satisfaction problems.
And-parallel Execution of Logic Programs on a Shared Memory Multiprocessor:a Summary of Results
Authors: Yow Lin, Vipin Kumar
Venue:  (1988)

This paper presents the implementation of an AND-parallel execution model of logic programs on a shared-memory multiprocessor. The major features of the implementation are (i) dependency analysis between literals of a clause is done dynamically without incurring excessive run-time overhead; (ii) backtracking is done intelligently at the clause level without incurring any extra cost for the determination of the backtrack literal; (iii) the implementation is based upon the Warren Abstract Machine (WAM), hence retains most of the efficiency of the WAM for sequential segments of logic programs. Performance results on Sequent Balance 21000 show that our parallel implementation can achieve reasonable speedup on dozens of processors.
THE WEIGHTED MAJORITY ALGORITHM (Supersedes 89-16)
Authors: Nick Littlestone, Manfred K. Warmuth
Venue:  (1992)

We study the construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a prediction to be made in each, and the goal of the learner is to make few mistakes. We are interested in the case that the learner has reason to believe that one of some pool of known algorithms will perform well, but the learner does not know which one. A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm in such a circumstance. We call this method the Weighted Majority Algorithm. We show that this algorithm is robust in the presence of errors in the data. We discuss various versions of the Weighted Majority Algorithm and prove mistake bounds for them that are closely related to the mistake bounds of the best algorithms of the pool. For example, given a sequence of trials, if there is an algorithm in the pool A that makes at most m mistakes then the Weighted Majority Algorithm will make at most c(log |A| + m) mistakes on that sequence, where c is fixed constant.
Probabilistic Solitude Detection II: Ring Size Known Exactly
Authors: Karl Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Venue:  (1987)

Upper and lower bounds that match to within a constant factor are found for the expected bit complexity of a problem on asynchronous unidirectional rings of known size $n$, for algorithms that must reach a correct conclusion with probability at least $1 - \epsilon$ for some small preassigned $\epsilon \geq 0$. The problem is for a nonempty set of contenders to determine whether there is precisely one contender. If distributive termination is required, the expected bit complexity is \( \Theta (n \min ( \log \nu (n) + \sqrt{\log \log (\frac{1}{\epsilon})}, \sqrt{\log n}, \log \log (\frac{1}{\epsilon}))) \), where $\nu (n)$ is the least nondivisor of $n$. For nondistributive termination, $ \sqrt{\log \log (\frac{1}{\epsilon})}$ and $\sqrt{\log n}$ are replaced by $\log \log \log(\frac{1}{\epsilon})$ and $\log \log n$ respectively. The lower bounds hold even for probabilistic algorithms that exhibit some nondeterministic features.
On Combinatorial Game Theory Foundations with Applications to Digraph Kernels
Authors: A. S. Fraenekl
Venue:  (1996)

Known facts: the decision problem of the existence of a kernel in a digraph G = (V,E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. We construct game theory tools, of independent interest, concerning strategies in the presence of draw positions, to show, in the opposite direction, how to partition V, in linear time, into 3 subsets S>sub<1>/sub<,S>sub<2>/sub<,S>sub<3>/sub<, such that S>sub<1>/sub< lies in all the kernels; S>sub<2>/sub< lies in the complements of all the kernels; and on S>sub<3>/sub< the kernels may be nonunique. Thus, in particular, digraphs with a ``large'''' number of kernels are those in which S>sub<3>/sub< is ``large''''; possibly S>sub<1>/sub< = S>sub<2>/sub< = ?. We also show that G can be ``decomposed'''', in linear time, into two induced subgraphs G>sub<1>/sub<, with vertex-set S>sub<1>/sub<ES>sub<2>/sub<, which has a unique kernel; and G>sub<2>/sub<, with vertex-set S>sub<3>/sub<, such that any kernel K of G is the union of the kernel of G>sub<1>/sub< and a kernel of G>sub<2>/sub<. In particular, G has no kernel if and only if G>sub<2>/sub< has none. 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
A Description of the LAMB Web-Derived Language Model Builder
Authors: Edward K. O''Neil, James C. French
Venue:  (2000)

This paper describes the language modeling script constructed for the Spring 2000 Information Retrieval seminar. The script builds on Callan''s work of automatically generating language models for text databases by creating language models for internet search engines. An overview of the work, principles and observed properties of language models, the language modeling script (LAMB) and its shortcomings are described.
On Boundary Interpolation for Matrix schur Functions
Authors: V. Bolotnikov, H. Dym
Venue:  (1999)

A number of interpolation problems are considered in the Schur class of p&#x00D7;q matrix valued functions S that are analytic and contractive in the open unit disc. The interpolation constraints are specified in terms of nontangential limits and angular derivatives at one or more (of a finite number of) boundary points. Necessary and sufficient conditions for existence of solutions to these problems and a description of all the solutions when these conditions are met is given. The analysis makes extensive use of a class of reproducing kernel Hilbert spaces H(S) that was introduced by de Branges and Rovnyak. The Stein equation that is associated with the interpolation problems under consideration is analyzed in detail. A lossless inverse scattering problem is also considered.
The IT concerns of small and medium sized construction businesses in the information age
Authors: J. H. M. Tah, V. Carr, S. Hoile
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper presents the results of a series of workshops recently held at South Bank University. The workshops were attended by representatives of a number of small-medium sized construction organisations, and the aim was to bring together those responsible for IT within those organisations to determine their concerns and opinions, and to help provide some practical advice for implementing and using IT effectively. Details of the demographics of the attendees are presented, and the subjects of greatest concern during the discussions are detailed. The paper aims to provide a snapshot of IT concerns in small-medium enterprises in the construction industry as it enters the 21st century.
Automatically Generated Test Frames from an S Specification of Separation Minima for the North Atlantic Region
Authors: Michael R. Donat
Venue:  (1998)

A partially automated process for generating tests has been experimentally applied to a formal specification of a real world specification for air traffic separation minima. This report discusses the problems addressed by this process along with how and why this automation was achieved.
Updating data in GIS: how to maintain database consistency?
Authors: Hakima Kadri-Dahmani, A. Osmani
Venue: Enterprise information systems IV (2003)

Preserving the consistency of a geographical database requires the development of tools for integrating or removing data and making several versions of any geographical objects coexist without altering neither the global consistency, nor the informational power of the database. To construct such tool, two problems must be solved: how to organize the data for efficient updating and how to maintain the database consistency during and after the integration of updates. The latter may be automated in the form of an Integration Module. One of its main tasks is to detect conflicts which perturb the consistency of the database during the update integration. This paper describes the Integration Module we have designed and its role in the general updating process we propose for GIS.
Fire resistance of slim floors protected using intumescent coatings
Authors: W. Sha
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The insulating effectiveness of intumescent coatings for fire protecting has been evaluated. The research took the following procedure: (i) correction of temperature data obtained from small furnace tests on unloaded beams; (ii) evaluation of beam temperature distribution as a function of protective coating type and thickness; (iii) calculations of moment resistance and load ratio for any given coating thickness and the determination of minimum coating thickness for different periods of fire resistance; (iv) extension of calculation results for different beam sizes; (v) examination of the effect of service holes. The coating thickness sufficient for all types of Slimflor construction was obtained.
Convergence of the Iterated Prisoner''s Dilemma Game
Authors: Martin Dyer, Leslie A Goldberg, Catherine Greenhill, Gabriel Istrate, Mark Jerrum
Venue:  (2000)

We consider a stochastic process based on the iterated prisoner''s dilemma game. During the game, each of n players has a state, either cooperate or defect. The players are connected by an "interaction graph". During each step of the process, an edge of the graph is chosen uniformly at random and the states of the players connected by the edge are modified according to the Pavlov strategy. The process converges to a unique absorbing state in which all players cooperate. We prove two conjectures of Kittock: The convergence rate is exponential in n when the interaction graph is a complete graph, and it is polynomial in n when the interaction graph is a cycle. In fact, we show that the rate is O(n log n) in the latter case.
EFFECT OF AUTARKY PRUNING ON RANDOM AND CIRCUIT FORMULAS: AN EXPERIMENTAL STUDY
Authors: Fumiaki Kamiya
Venue:  (1996)

Modoc was proposed by VanGelder as an improvement to model elimination. The main contribution of Modoc is in its new pruning technique based on the concept of autarky, first introduced by Monien and Speckenmeyer. Compared to programs based on model search, Modoc has since been observed to excel in speed on circuit formulas yet to fall behind on random formulas. This paper reports on a study conducted to explain this behavior in Modoc. The study is based on experiment in which the effectiveness of the two pruning techniques used in Modoc---autarky pruning and lemma pruning---are examined on random and circuit formulas. We observe that the effectiveness of autarky pruning differs tremendously between the two classes of formulas. We also observe that for circuit formulas, autarkies, which are believed to be very few of, are more likely to be found by simplifying the formula for some partial truth assignment. This may lead to possible new ways to use autarkies to solve the satisfiability problem.
Transforming Command-Line Driven Systems to Web Applications
Authors: Phanouriou Constantinos, Abrams Marc
Venue:  (1996)

A method fo add a Web-based interface to a command-line driven system is presented. Without programming, Javamatic can generate a graphical user interface, then invokes commands in the legacy system transparently to the user. The user interface (UI) is automatically generated as a Java applet or stand-alone interface from a high-level description of the application, which is UI independent, using a set of UI mapping rules. The application is wrapped with an interface serverl thus multiple clients can use the legacy application through the Web.
Global Optimization for Polynomial Programming Problems Usingm-homogeneous Polynomial Homotopies
Authors: Layne T. Watson, Alexander P. Morgan
Venue:  (1989)

A polynomial programming problem is a nonlinear programming problem where the objective function, inequality constraints, and equality constraints all consist of polynomial functions. The necessary optimality conditions for such a problem can be formulated as a polynomial system of equations, among whose zeros the global optimum must lie. This note applies the theory of m-homogeneous polynomials in Cartesian product projective spaces and recent homotopy algorithms to significantly reduce the work of a naive homotopy approach to the polynomial system formation of the mecessary optimality conditions. The m-homogeneous approach, providing the global optimum, is practical for small problems. For example, the geometric modeling problem of finding the distance between two polynomial surfaces is a polynomial programming problem. Also discussed is a prototype structural design problem.
Classification with Multiple Prototypes
Authors: J. C. Bezdek, T. R. Reichherzer, Sok G Lim, Y. Attikiouzel
Venue:  (1996)

Abstract unavailable.
Surface Curvature from Photometric Stereo
Authors: R. J. Woodham
Venue:  (1990)

A method is described to compute the curvature at each point on a visible surface. The idea is to use the intensity values recorded from multiple images obtained from the same viewpoint but under different conditions of illumination. This is the idea of photometric stereo. Previously, photometric stereo has been used to obtain local estimates of surface orientation. Here, an extension to photometric stereo is described in which the spatial derivatives of the intensity values are used to determine the principal curvatures, and associated directions, at each point on a visible surface. The result shows that it is possible to obtain reliable local estimates of both surface orientation and surface curvature without making global smoothness assumptions or requiring prior image segmentation. \n The method is demonstrated using images of several pottery vases. No prior assumption is made about the reflectance characteristics of the objects to be analyzed. Instead, one object of known shape, a solid of revolution, is used for calibration purposes.
Spatial and Temporal Path Planning
Authors: Marc G. Slack, David P. Miller
Venue:  (1987)

For robots to move out of the lab and into the real-world, they must be able to plan routes not only through space but through time as well. The introduction of a time factor to the planning process implies that robots must reason about other processes and agents that move through space independently of the robot''s actions. This thesis presents an integrated route planner and spatial representation system for planning real-time paths through dynamic domains called Robonav. Robonav will find the safest, most efficient route through time and space as described by an evaluation function. Due to the design of the spatial representation and the mechanics of the algorithm, Robonav has an isomorphic mapping onto a machine with a highly parallel SIMD architecture. When Robonav is operated in a predictable domain; paths are found in O(p) time (where p is the length of a path). In unpredictable domains, where Robonav is operated in incremental mode, paths are found and executed in $O(p^2)$ time.
Experiments in Data Colocation
Authors: Clark L. Coleman, Jack W. Davidson
Venue:  (1998)

If two data objects have non-overlapping lifetimes during all possible executions of a program, they could be assigned to the same addresses in memory. Experiments confirm that this can reduce certain pressures throughout a memory hierarchy.
Distributed I/O Using an Object-Based Protocol
Authors: David R. Cheriton
Venue:  (1981)

The design of a distributed I/O system is described. The system is distributed in being implemented by server processes, client processes and a message communication mechanism between them. Data transfer between processes is achieved using a ``connectionless'''' object-based protocol. The concept of \underline{file} is generalized to that of a \underline{view} of an object or activity managed by a server. This allows many objects, including application-defined objects, to be viewed or accessed within the program I/O paradigm. Files are instantiated as \underline{file instance} objects to allow access to the associated data. Conventional byte-stream program input/output facilities are supported by a subroutine library which makes the message-based implementation transparent to applications.
Behavior-based Confinement of Untrusted Applications
Authors: Mandar Raje
Venue:  (1999)

In my thesis, I propose a class-specific sandboxing mechanism to confine untrusted applications. The key idea is to identify different application classes like editor, browser, mail client, shell, filter, server etc and to confine applications belonging to each class in a sandbox that is tailored to the expected behavior/requirements of the class. For example, the sandbox for a MIME-mail client could be restricted to allow it to spawn only a set of helper applications explicitly listed in the mailcap file; the sandbox for an editor could be restricted to disallow network accesses and process creation. Such a mechanism retains the ease-of-use of sandboxes while significantly increasing their flexibility. End-users do not need to maintain complex access control lists or interact frequently with the security subsystem; nor do they need to depend solely on a digital signature. They can configure their systems by specifying the set of classes they would like to allow. To evaluate the feasibility of my proposal, I have: (1) defined a set of application classes and have populated them based on a study of system-call traces of commonly used applications; (2) implemented a infrastructure that uses the /proc-interface to confine native binaries; (3) developed configuration files for the different application classes that I have encountered; (4) have integrated this infrastructure with an X proxy that confines untrusted X applications to windows and other X resources that it creates (and a small number of global attributes); (5) evaluated the overhead introduced by this mechanism.
Parallel Techniques for Construction of Trees and Related Problems
Authors: Teresa M Przytycka
Venue:  (1990)

The concept of a tree has been used in various areas of mathematics for over a century. In particular, trees appear to be one of the most fundamental notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods which seem to be inherently sequential. One of the contributions of this thesis is the introduction of several parallel-techniques for the construction of various types of trees and the presentation of new parallel tree construction algorithms using these methods. Along with the parallel tree construction techniques presented here, we develop techniques which have broader applications. \n We use the Parallel Random Access Machine as our model of computation. We consider two basic methods of constructing trees: {\em tree expansion} and {\em tree synthesis}. \n In the {\em tree expansion method}, we start with a single vertex and construct a tree by adding nodes of degree one and/or by subdividing edges. We use the parallel tree expansion technique to construct the tree representation for graphs in the family of graphs known as cographs. \n In the {\em tree synthesis method}, we start with a forest of single node subtrees and construct a tree by adding edges or (for rooted trees) by creating parent nodes for some roots of the trees in the forest. We present a family of parallel and sequential algorithms to construct various approximations to the Huffman tree. All these algorithms apply the tree synthesis method by constructing a tree in a level-by-level fashion. To support one of the algorithms in the family we develop a technique which we call the {\em cascading sampling technique}. \n One might suspect that the parallel tree synthesis method can be applied only to trees of polylogarithmic height, but this is not the case.We present a technique which we call the {\em valley filling technique} and develop its accelerated version called the {\em accelerated valley filling technique}. We present an application of this technique to an optimal parallel algorithm for construction of minimax trees.