ppxscal/embedding_network huggingface dataset:
A Frame-Based Language in Information Retrieval
Authors: Marybeth T. Weaver, Robert K. France, Qi Chen, Edward A. Fox
Venue:  (1988)

With the advent of the information society, many researchers are turning to artificial intelligence techniques to provide effective retrieval over large bodies of textual information. Yet any AI system requires a formalism for encoding its knowledge about the objects of its knowledge, the world, and the intelligence that it is designed to manifest. In the CODER system, the mission of which is to provide an environment for experiments in applying AI to information retrieval, that formalism is provided by a single well defined factual representation language. Designed as a flexible tool for retrieval research, the CODER factual representation language is a hybrid AI language involving a system of strong types for attribute values, a frame system, and a system of Prolog-like relational structures. Inheritance is enforced throughout, and the semantics of type subsumption and object matching formally defined. A collection of type and object managers called the knowledge administration complex implements this common language for storing knowledge and communicating it within the system. Of the three types of knowledge structures in the language, the frame facility has proven most useful in the retrieval domain. The factual representation language is implemented in Prolog as a set of predicates accessible to all system modules. Each level of knowledge representation (elementary primitives, frames, and relations) has a type manager; the frame and relation levels also have object managers. Storage of complete knowledge objects (statements in the factual representation language) is supported by a system or external knowledge bases. One paper discusses the frame construct itself, the implementation of the knowledge administration complex and external knowledge bases. and the use of the construct in retrieval research. The paper closes with a discussion of the utility of the language in experiments.
On the Complexity of Achieving K-Consistency
Authors: Raimund Seidel
Venue:  (1983)

A number of combinatorial search problems can be formulated as constraint satisfaction problems. Typically backtrack search is used to solve these problems. To counteract the frequent thrashing behaviour of backtrack search, methods have been proposed to precondition constraint satisfaction problems. These methods remove inconsistencies involving only a small number of variables from the problem. In this note we analyze the time complexity of the most general of these methods, Freuder''s $k$-consistency algorithm. We show that it takes worst case time $O(n^{k})$, where $n$ is the number of variables in the problem.
Eliminating Spurious Error Messages Using Exceptions, Polymorphism, and Higher-Order Functions
Authors: Norman Ramsey
Venue:  (1997)

Many language processors make assumptions after detecting an error. If the assumptions are invalid, processors may issue a cascade of error messages in which only the first represents a true error in the input; later messages are side effects of the original error. Eliminating such spurious error messages requires keeping track of values within the compiler that are not available because of a previously detected error. Examples include symbol-table entries, types, and intermediate code. This paper presents a discipline for tracking unavailable values and avoiding cascading error messages. The discipline itself is unsurprising, but it is both formalized and implemented in terms of a type constructor and combinators expressed in Standard&#x00A0;ML, and the ML type rules enforce the discipline. The type constructor distinguishes intermediate results that are unavailable because of a previously detected error. The combinators transform ordinary functions, which assume all intermediate results are available, into functions that silently propagate the unavailability of intermediate results. ML''s type system guides the application of the combinators; if the compiler writer does not account for a potentially unavailable value, the source code of the compiler does not type-check. The techniques presented exploit several features of Standard&#x00A0;ML, including exceptions, higher-order functions, parametric polymorphism, and static type checking. Using these features enables the ML type system to ensure that the error-tracking discipline is applied consistently, relieving the programmer of that burden.
DYNAMIC STORAGE RECLAMATION IN C++ (M.S. Thesis)
Authors: Daniel R Edelson
Venue:  (1990)

Dynamically allocated memory is a pervasive element of modern programming practices, but efficient dynamic memory reclamation is difficult. One class of algorithms that accomplish this is *copying garbage collection*. These algorithms require one pass to collect and compact objects in memory. It is the preferred form of garbage collection for systems with large virtual memories and large free-stores because the work of these algorithms is proportional to the amount of living data rather than the total data allocated. A copying collector organization appropriate for object-oriented imperative programming languages is presented. The system is both encapsulated and efficient. The efficiency of reclaiming a data structure depends solely on the size of the data structure, not the size of the program. It remains within the philosophy of its implementation language, C++, because code fragments that do not use the collector are not affected in any way. Any number of collectors can coexist concurrently in an application on disjoint data structures, making it an appropriate component of an object-oriented system. This system adds an important feature to C++ that increases productivity and makes the language more convenient. It makes dynamic memory management more efficient than manual reclamation for an important class of problems. It serves as a platform for research into reclamation techniques, particularly virtual memory issues, and it provides an appropriate organization for automatic dynamic memory reclamation in object-oriented imperative programming languages.
Visual Cryptography
Authors: M. Naor, A. Shamir
Venue:  (1994)

In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant of the k out of n secret sharing problem, in which a dealer provides a transparency to each one of the n users; any k of them can see the image by stacking their transparencies, but any k-1 of them gain no information about it.
A BEST-FIRST ERROR CORRECTION ALGORITHM (M.S. Thesis)
Authors: Frank A Jas
Venue:  (1990)

An algorithm for repairing syntax errors is presented. The algorithm is a modified best-first search which searches for the shortest repair. The algorithm adds little time or space costs to the parsing of correct input. It performs as well as other published techniques on a standard set of Pascal programs. A survey of other techniques shows a marked similarity between the first phase of each algorithm. This phase has been generalized into a full search in the best-first approach. A review of the set of programs reveals the successes of other approaches may be primarily due to this first phase.
Caching Proxies: Limitations and Potentials
Authors: Marc Abrams, Charles R. Standridge, Ghaleb Abdulla, Stephen Williams, Edward A. Fox
Venue:  (1995)

As the number of World-Wide Web users grow, so does the number of connections made to servers. This increases both network load and server load. Caching can reduce both loads by migrating copies of server files closer to the clients that use those files. Caching can either be done at a client or in the network (by a proxy server or gateway). We assess the potential of proxy servers to cache documents retrieved with the HTTP protocol. We monitored traffic corresponding to three types of educational workloads over a one semester period, and used this as input to a cache simulation. Our main findings are (1) that with our workloads a proxy has a 30-50% maximum possible hit rate no matter how it is designed; (2) that when the cache is full and a document is replaced, least recently used (LRU) is a poor policy, but simple variations can dramatically improve hit rate and reduce cache size; (3) that a proxy server really functions as a second level cache, and its hit rate may tend to decline with time after initial loading given a more or less constant set of users; and (4) that certain tuning configuration parameters for a cache may have little benefit.
A platform for the integration of civil engineering services and tools
Authors: Z. Turk, R. J. Scherer
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The wired and wireless networking technology is redefining the role of information technology in civil engineering. It used to provide software tools for the design and analysis and access to common design information. Today, technology is providing the media for accessing information, software, services and also people. In the paper we present efforts of the ISTforCE project to define a framework of this media. ISTforCE is a European 5th Framework Information Society project. It is developing and demonstrating technologies which will enable any computer based engineering tool to be available through the Internet and easily integrated with other tools. The novel approaches in ISTforCE are (1) that one should not provide project centred environments, but that these should be focused on a human, (2) that collaboration environments should be open so that they provide a platform where users and providers of engineering information, services and tools meet - clients of such environments are therefore both engineers as well as providers of services, (3) that object level data exchange is possible and (4) that infrastructure for on-line business is provided (legal and financial transactions). In the paper we present the framework and the architecture of the platform.
FRAMBOISE -- an Approach to construct Active Database Mechanisms
Authors: Hans Fritschi, Stella Gatziu, Klaus R. Dittrich
Venue:  (1997)

Current active database management systems (ADBMS) are typically realized as monolithic, tightly integrated software systems. Separating the active database mechanisms from the DBMS, would open the opportunity to use them in a variety of ways and environments. In order to build the respective decoupled active database facilities, construction systems are required. The realization of such a construction system is investigated in the FRAMBOISE project. FRAMBOISE is used to build a "ready-to-run" software system that allows the definition and execution of active database mechanisms in the context of specific DBMSs. It comprises specification mechanisms, construction tools and an object- oriented framework that provides implemented components realizing specific ADBMS tasks. This paper outlines the general approach of FRAMBOISE and discusses the first steps of the realization.
USING AN OBJECT-ORIENTED FRAMEWORK TO CONSTRUCT WIDE-AREA GROUP COMMUNICATION MECHANISMS
Authors: Richard A. Golding, Darrell D. E. Long
Venue:  (1993)

Many wide-area distributed applications, including distributed databases, can be implemented using a group communication mechanism. We have developed a family of weak-consistency group communication mechanisms, based on the timestamped anti-entropy communication protocol, that provides the scalability and fault-tolerance needed by wide-area systems. We discuss an object-oriented framework for constructing this kind of group communication mechanism, and how its components can be selected to take advantage of specific application semantics. We examine several design choices that we made in building two very different wide-area distributed database applications, and how this framework led to simple, efficient implementations in both systems.
Access Ordering and Memory-Conscious Cache Utilization
Authors: Sally A. McKee
Venue:  (1994)

As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for many applications. Several approaches to bridging this performance gap have been suggested. This paper examines one approach, access ordering, and pushes its limits to determine bounds on memory performance. We present several access-ordering schemes, and compare their performance, developing analytic models and partially validating these with benchmark timings on the Intel i860XR.
Instructional Footprinting: A Basis for Exploiting Concurrency Through Instructional Decomposition and Code Motion: A Research Prospectus
Authors: Kenneth D. Landry, James D. Arthur
Venue:  (1992)

In many languages, the programmer is provided the capability of communicating, through the use of function calls, with other, separate, independent processes. This capability can be simple, as a service request made to the operating system, or more advanced, as Tuple space operations specific to a Linda programming system. The problem with such calls, however, is that they block while waiting for data of information to be returned. This synchronous nature and lack of concurrency can be avoided by initiating the request for data earlier in the code and retrieving the returned data later when it is needed. In order to facilitate this concurrency of processing, an instructional footprint model is developed which formally describes movement of instruction. This paper presents a proposal for research that involves the development of the instructional footprint model and an algorithmic framework in which to exploit concurrency in programming languages.
ROUTABILITY-DRIVEN TECHNOLOGY MAPPING FOR LookUp TABLE-BASED FPGAs
Authors: Martine Schlag, Jackson Kong, Pak K. Chan
Venue:  (1992)

A new algorithm for technology mapping of LookUp Table-based Field-Programmable Gate Arrays (FPGAs) is presented. It has the capability of producing slightly more *compact* designs (using less cells (CLBs)) than some existing mappers. More significantly, it has the flexibility of trading routability with compactness of a design. Research in this area has focussed on minimizing the number of cells. However, minimizing the number of cells without regard to routability is ineffective. Since placment and routing is really the most time-consuming part of the FPGA design process, producing a routable design with a slightly larger number of cells is preferable than producing a design using fewer cells which is difficult to route, or in the worst case unroutable. We have implemented our algorithm in the Rmap program, and studied routability of two other mappers with respect to Rmap in this paper. In general Rmap produces mappings with better routability characteristics, and more significantly Rmap produces routable mappings when other mappers do not.
AUTOMATIC SYNTHESIS OF SELF-TEST USING ASyST
Authors: Peter Johnson
Venue:  (1991)

This thesis describes an automated *Built-In Self-Test* (BIST) technique for general sequential circuits. The technique replaces storage elements in a given circuit with self-test elements. These elements are then connected as a shift register, and used both to generate test patterns and to compress test responses. Benchmarks were run on a number of standard sequential benchmark circuits to determine single stuck-at fault coverage. The results of these tests indicate that the self-test techniques presented here obtain fault coverage similar to that of random test techniques. 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
New schemes of biologically inspired evolutionary computation
Authors: Hidefumi Sawai, Susumu Adachi, Sachio Kizu
Venue: Advances in evolutionary computing: theory and applications (2003)

We propose a novel genetic algorithm which we call a parameter-free genetic algorithm (PfGA). The PfGA is inspired by the idea of a biological evolution hypothesis, i.e., the "disparity theory of evolution." The theory is based on different mutation rates in double strands of DNA. Its idea can be extended to a very compact and fast adaptive search algorithm accelerating its evolution based on the variable size of a population and taking a dynamic but delicate balance between exploration (i.e., global search) and exploitation (i.e, local search). The PfGA is not only simple and robust, but it is unnecessary to set almost all the genetic parameters in advance which need to be set up in other genetic algorithms. Furthermore, a uniformly distributed parallel architecture and a master-slave architecture for the PfGA are investigated as an extension. We discuss the performance of the parallel distributed architectures using a general set of function optimization problems including the functions in the first International Contest on Evolutionary Optimization. On the other hand, gene duplication theory was first proposed by a Japanese biologist, Dr. Susumu Ohno, in the 1970's. Inspired by this theory, we develop a gene-duplicating genetic algorithm. Several variants of this algorithm are considered. Individuals with various lengths of genes are evolved based on the PfGA or steady-state GA and then genes with different lengths are concatenated by migrating among subpopulations. To verify the effectiveness of the gene-duplicating genetic algorithm, we also performed a comparative study using the general set of function optimization problems.
On Degenerate Interpolation, Entropy and Extremal Problems for Matrix Schur Functions
Authors: V. Bolotnikov, H. Dym
Venue:  (1998)

We consider a general bitangential interpolation problem for matrix Schur functions and focus mainly on the case when the associated Pick matrix is singular (and positive semidefinite). Descriptions of the set of all solutions are given in terms of special linear fractional transformations which are obtained using two quite different approaches. As applications of the obtained results we consider the maximum entropy and the maximum determinant extension problems suitably adapted to the degenerate situation.
SAMOS in Hindsight: Experiences in Building an Active Object-OrientedDBMS
Authors: Klaus R. Dittrich, Hans Fritschi, Stella Gatziu, Andreas Geppert, Anca Vaduva
Venue:  (2000)

Active object-oriented database management systems incorporate object-oriented database technology and active mechanisms such as event- condition rules (ECA-rules). SAMOS has been among the first representatives of this class of systems. During the development of SAMOS, numerous then open research questions have been addressed. In this paper, we present a "historical" perspective of the SAMOS project and report on lessons and experiences we gained in the project. We identify requirements, present the solutions we devised, and report on experiences we draw from this project. In particular, we describe the rule model of SAMOS, which represents a smooth integration of ECA-rules into an object-oriented data model. We also discuss the implementation and architecture of the SAMOS prototype on top of a passive object- oriented database system. Furthermore, we report on performance and usability issues. In order to analyze performance, we have developed a benchmark; we discuss the experiences (and improvements) we made by running the benchmark on SAMOS and by comparing the results to those obtained for other systems. Usability issues have been investigated with respect to tool support for designing SAMOS applications and analyzing rule systems. Finally, we discuss experiences in implementing SAMOS and the conclusions we have drawn for the implementation of other types of event-based persistent systems as well as a development method for active systems in general.
Measurement of Ada Throughout the Software Development Life Cycle
Authors: Bryan L. Chappell, Sallie M. Henry, Kevin A. Mayo
Venue:  (1989)

Quality enhancement has now become a major factor in software production. Software metrics have demonstrated their ability to predict source code complexity at design time and to predict maintainability of a software system from source code. Obviously metrics can assist software developers in the enhancement of quality. Tools which automatically generate metrics for Ada are increasing in popularity. This paper describes an existing tool which produces software metrics for Ada that may be used throughout the software development life cycle. This tool, while calculating established metrics, also calculates a new structure metric that is designed to capture communication interface complexity. Measuring designs written using Ada as a PDL allows designers early feedback on possible problem areas in addition to giving direction on testing strategies.
BOUNDS ON APPROXIMATE STEEPEST DESCENT FOR LIKELIHOOD MAXIMIZATION IN EXPONENTIAL FAMILIES
Authors: Nicolo Cesa-Bianchi, Anders Krogh, Manfred K. Warmuth
Venue:  (1992)

An approximate steepest descent strategy converging, in families of regular exponential densities, to maximum likelihood estimates of density functions is described. These density estimates are also obtained by an application of the principle of minimum relative entropy subject to empirical constraints. We prove tight bounds on the increase of the log-likelihood at each iteration of our strategy for families of exponential densities whose log-densities are spanned by a set of bounded basis functions.
On the Theory of Interconnection Networks for Parallel Computers
Authors: E. Upfal
Venue:  (1994)

Efficient data transfer between processors is an essential component in any large scale parallel computation. Motivated by the growing interest in parallel computers, a significant amount of theoretical research has been devoted to the area of interconnection networks for parallel computers, most of it to the packet routing (or store-and-forward) model of communication. We survey some of the major developments in this field, and discuss several new alternative models of communication, such as wormhole routing, virtual cut-through routing, and hot-potato routing. 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
Heap Games and Numeration Systems
Authors: A. S. Fraenkel
Venue:  (1998)

We propose and analyze a family of 2-player games on two heaps of tokens, which depends on two independent integer parameters. We present a strategy which looks good, but isn''t good. A class of exotic numeration systems is then introduced, which enables us to decide whether the family has a good strategy or not.
Average Probe Complexity in Quorum Systems,
Authors: Y. Hassin, D. Peleg
Venue:  (2001)

This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of non-dominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes.
LU-Decomposition on a Massively Parallel Transputer System
Authors: Stefan Lupke
Venue:  (1993)

Two algorithms for LU-decomposition on a transputer based reconfigurable MIMD parallel computer with distributed memory have been analyzed in view of the interdependence of granularity and execution time. In order to investigate this experimentally, LU-decomposition algorithms have been implemented on a parallel computer, the Parsytec SuperCluster 128. The results of this investigation may be summarized as follows. The LU-decomposition algorithms are very efficient on the parallel computer, if the ratio between problem size and number of processors is not too small. No loss of efficiency is to be expected, if the number of processors is increased only proportionally to the number of elements in the matrix being decomposed.