ppxscal/embedding_network huggingface dataset:
Aspects of Functional Programming
Authors: Gary Meehan
Venue:  (1999)

This thesis explores the application of functional programming in new areas and its implementation using new technologies. We show how functional languages can be used to implement solutions to problems in fuzzy logic using a number of languages: Haskell, Ginger and Aladin. A compiler for the weakly-typed, lazy language Ginger is developed using Java byte-code as its target code. This is used as the inspiration for an implementation of Aladin, a simple functional language which has two novel features: its primitives are designed to be written in any language, and evaluation is controlled by declaring the strictness of all functions. Efficient denotational and operational semantics are given for this machine and an implementation is developed using these semantics. We then show that by using the advantages of Aladin (simplicity and strictness control) we can employ partial evaluation to achieve considerable speed-ups in the running times of Aladin programs.
Sign for a Fully Transportable Natural Language Front-end to Database Management Systems
Authors: Jane T Nutter, Steve J. Safigan, Angel M. Diaz,  Jr.
Venue:  (1989)

Natural language front-ends to database management systems represent a major improvement in accessibility for non-expert users. Unfortunately, such interfaces usually require extensive customizing not only of the front-end, but also of the data manager and hence of the DBMS itself. Developing such customized systems represents a huge investment of time and resources. In the 1980s, research has centered on making such systems portable at least across data bases, and in some cases across data base management systems. This report describes an architecture for complete transportability with minimal reprogramming, which has been partially implemented in a prototype system called TIPS. The TIPS architecture is compared briefly with other recent architectures, with attention to ease of portability, amount and locus of reprogramming needed, and extent of coverage both linguistically and in terms of database operations.
Misconceptions about real-time databases
Authors: John Stankovic, Sang H. Son, Jorgen Hansson
Venue:  (1998)

More and more databases are being used in situations where real-time constraints exist. A set of misconceptions have arisen regarding what a real-time database is and the appropriateness of using conventional databases in real-time applications. Nine misconceptions are identified and discussed. Various research challenges are enumerated and explained. In total, the paper articulates the special nature of real-time databases.
Logical Foundations for Category Theory
Authors: Paul C. Gilmore, George K. Tsiknis
Venue:  (1990)

Category theory provides an abstract and uniform treatment for many mathematical structures, and increasingly has found applications in computer science. Nevertheless, no suitable logic within which the theory can be developed has been provided. The classical set theories of Zermelo-Fraenkel and Godel-Bernays, for example, are not suitable because of the use category theory makes of self-referencing abstractions, such as in the theorem that the set of categories forms a category. That a logic for the theory must be developed, Feferman has argued, follows from the use in the theory of concepts fundamental to logic, namely, propositional logic, quantification and the abstractions of set theory. \nIn this paper a demonstration that the logic and set theory NaDSet is suitable for category theory is provided. Specifically, a proof of the cited theorem of category theory is provided within NaDSet. \nNaDSet succeeds as a logic for category theory because the resolution of the paradoxes provided for it is based on a reductionist semantics similar to the classical semantics of Tarski for first and second order logic. Self-membership and self-reference is not explicitly excluded. The reductionist semantics is most simply presented as a natural deduction logic. In this paper a sketch of the elementary and logical syntax or proof theory of the logic is described. \nFormalizations for most of the fundamental concepts and constructs in category theory are presented. NaDSet definitions for natural transformations and functor categories are given and an equivalence relation on categories is defined. Additional definitions and discussions on products, comma categories, universals limits and adjoints are presented. They provide enough evidence to support the claim that any construct, not only in categories, but also in toposes, sheaves, triples and similar theories can be formalized within NaDSet.
Contention Resolution with Bounded Delay
Authors: M. S. Paterson
Venue:  (1995)

When many distributed processes contend for a single shared resource that can service at most one process per time slot, the key problem is devising a good distributed protocol for contention resolution. This has been studied in the context of multiple-access channels (e.g. ALOHA, Ethernet), and recently for PRAM emulation and routing in optical computers. Under a stochastic model of continuous request generation from a set of n synchronous processes, Raghavan and Upfal have recently shown a protocol which is stable if the request rate is at most lambda_0 for some fixed lambda_0 > 1; their main result is that for any given resource request, its expected delay (expected time to get serviced) is O(log n). Assuming further that the initial clock times of the processes are within a known bound B of each other, we present a stable protocol, again for some fixed positive request rate lambda_1, 0 > lambda_1 > 1, wherein the expected delay for each request is O(1), independent of n. We derive this by showing an analogous result for an infinite number of processes, assuming that all processes agree on the time; this is the first such result. We also present tail bounds which show that for every given resource request, it is unlikely to remain unserviced for much longer than expected, and extend our results to other classes of input distributions. 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
Fault-Tolerance in Coarse Grain Data Flow
Authors: Anh Nguyen-Tuong, Andrew S. Grimshaw, John F. Karpovich
Venue:  (1995)

Wide-area parallel processing systems will soon be available to researchers to solve a range of problems. It is certain that host failures and other faults will be an every day occurrence in these systems. Unfortunately contemporary parallel processing systems were not designed with fault-tolerance as a design objective. The data-flow model, long a mainstay of parallel processing, offers hope. The model''s functional nature, which makes it so amenable to parallel processing, also facilitates straight- forward fault-tolerant implementations. It is the combination of ease of parallelization and fault- tolerance that we feel will increase the importance of the model in the future, and lead to the widespread use of functional components. Using Mentat, an object-oriented, data-flow based, parallel processing system, we demonstrate two orthogonal methods of providing application fault-tolerance. The first method provides transparent replication of actors and requires modification to the existing Mentat run-time system. Providing direct support for replicating actors enables the programmer to easily build fault-tolerant applications regardless of the complexity of their data-flow graph representation. The second method - the checkboard method - is applicable to applications that contain independent and restartable computations such as "bag of tasks", Monte Carlo''s, and pipelines, and involves some simple restructuring of code. While these methods are presented separately, they could in fact be combined. For both methods, we present experimental data to illustrate the trade-offs between fault-tolerance, performance and resource consumption.
SYNCHRONOUS/REACTIVE PROGRAMMING OF CONCURRENT SYSTEM SOFTWARE
Authors: Bruce Montague, Charles McDowell
Venue:  (1995)

Synchronous languages are intended for programming reactive systems. Reactive systems, which include real-time systems and key operating system components, interact continually with their environment. This paper considers the applicability of imperative synchronous/reactive languages to the development of general system software, that is, to the implementation of operating system kernels, file systems, databases, networks, server architectures, device drivers, etc.. The languages Esterel and Reactive C (RC) receive special attention as Esterel is the oldest and most developed such language and RC is specifically designed for compatibility with C systems programming. An alternative soft-instruction software architecture is described which is well suited to real-world system programming.
Improving Instruction-level Parallelism by Loop Unrolling and Dynamic Memory Disambiguation
Authors: Jack W. Davidson, Sanjay Jinturkar
Venue:  (2001)

Exploitation of instruction-level parallelism is an effective mechanism for improving the performance of modern super-scalar/VLIW processors. Various software techniques can be applied to increase instruction-level parallelism. This paper describes and evaluates a software technique, dynamic memory disambiguation, that permits loops containing loads and stores to be scheduled more aggressively, thereby exposing more instruction-level parallelism. The results of our evaluation show that when dynamic memory disambiguation is applied in conjunction with loop unrolling, register renaming, and static memory disambiguation, the ILP of memory-intensive benchmarks can be increased by as much as 300 percent over loops where dynamic memory disambiguation is not performed. Our measurements also indicate that for the programs that benefit the most from these optimizations, the register usage does not exceed the number of registers on most high-performance processors.
Free Speech, Pornography, Sexual Harassment, and Electronic Networks
Authors: Richard Rosenberg
Venue:  (1993)

Linking most universities and many companies around the world is a vast computer network called Internet. More than 7 million people, at 1.2 million attached hosts, in 117 countries are able to receive and send messages to about 4,000 newsgroups, representing the diverse interests of its users, as they are usually called. Some of these newsgroups deal with technical computer issues, some are frivolous, and some carry obscene or pornographic material. For purposes of this essay, it will be assumed that by most standards the postings of concern consisting of stories with themes of bestiality, bondage, and incest and encrypted pictures with scenes of nude women and men, and even children, are pornographic and offensive to many people. The issue under discussion is what to do about such offensive material. Issues of free speech, censorship, and sexual harassment arise. These as well as many others are explored and recommendations are made.
Parallelization of an Axially Symmetric Steady Flow Program
Authors: Norm Beekwilder, Andrew S. Grimshaw
Venue:  (1998)

Description of the modifications made to an axially symmetric steady flow program to convert it from a sequential code to a parallel code. Some of the difficulties encountered and performance results are discussed.
EXPERIENCE-BASED ADAPTIVE SEARCH
Authors: Jeffrey Gould, Robert Levinson
Venue:  (1992)

This paper describes adaptive predictive search (APS), a learning system framework, which given little initial domain knowledge, increases its predictive abilities in complex problems domains. APS systems are termed experience-based learners because they are given as much responsibility for the learning process as possible. This framework has been applied to a number of complex domains (including chess, othello, pente, and image alignment) where the combinatorics of the state space is large and the learning process only receives reinforcement at the end of each search. The unique features of the APS framework are its pattern-weight representation of control knowledge and its integration of several learning techniques including temporal difference learning, simulated annealing, and genetic algorithms. In addition to APS, Morph, an APS chess system, is described in detail. Through training, despite little initial domain knowledge and using only one ply of search, Morph has managed several dozen draws and two wins against a traditional search based chess program stronger than most tournament players.
Proof running two state-of-the-art pattern recognition techniques in the field of direct marketing
Authors: Stijn Viaene, Bart Baesens, Guido Dedene, Jan Vanthienen, Dirk Van den Poel
Venue: Enterprise information systems IV (2003)

In this paper, we synthesize the main findings of three repeat purchase modelling case studies using real-life direct marketing data. Historically, direct marketing -- more recently, targeted web marketing -- has been one of the most popular domains for the exploration of the feasibility and the viable use of novel business intelligence techniques. Many a data mining technique has been field tested in the direct marketing domain. This can be explained by the (relatively) low-cost availability of recency, frequency, monetary (RFM) and several other customer relationship data, the (relatively) well-developed understanding of the task and the domain, the clearly identifiable costs and benefits, and because the results can often be readily applied to obtain a high return on investment. The purchase incidence modelling cases reported on in this paper were in the first place undertaken to trial run state-of-the-art supervised Bayesian learning multilayer perceptron (MLP) and least squares support vector machine (LS-SVM) classifiers. For each of the cases, we also aimed at exploring the explanatory power (relevance) of the available RFM and other customer relationship related variable operationalizations for predicting purchase incidence in the context of direct marketing.
Aspect Oriented Programming: A Critical Analysis of a New Programming Paradigm
Authors: Timothy Highley, Michael Lack, Perry Myers
Venue:  (1999)

Aspect-oriented programming is a paradigm which addresses crosscutting concerns in computer programs. A crosscutting concern is something that cannot be cleanly encapsulated in a generalized module. This paper serves several purposes. The first section will attempt to give some background for AOP and describe some of the motivation in more detail. It will also briefly describe the syntax and semantics of AspectJ, a Java based implementation of AOP. We will also present a design philosophy for using aspects on top of an object-oriented paradigm. The second section discusses some problems we have observed in the AspectJ implementation. The third section discusses alternative paradigms to which AOP might apply. While current research seems to favor OO languages as the basis for AOP, this does not necessarily need to be the case. Procedural languages will be considered to see if they also might benefit from AOP. An implementation for C will be briefly outlined here. Finally, we will give some concluding remarks about AOP and its usefulness.
Instructional Footprinting: A Model for Exploiting Concurrency through Instructional Decomposition and Code Motion
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 as 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 or 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 instructions. This paper presents research findings that entail the development of the instructional footprint model, an algorithmic framework in which to exploit concurrency in programming languages, and some preliminary results from applying the instructional footprint model.
Modeling and Executing the Data Warehouse Refreshment Process
Authors: Athanasios Vavouras, Stella Gatziu, Klaus R. Dittrich
Venue:  (2000)

Data warehouse refreshment is often viewed as a problem of maintaining materialized views over operational sources. In this paper, we show that the data warehouse refreshment process is a complex process comprising several tasks, e.g.,monitoring, extracting, transforming, integrating and cleaning operational data, deriving new data, building histories and loading the data warehouse. We propose a novel approach for defining and executing the refreshment process based on specifications stored in an object-oriented metadata repository. Our approach considers the multidimensional character of OLAP data and can be used in conjunction with various operational sources and target data warehouses.
Authentication Based on Logical Time
Authors: Anand Natrajan
Venue:  (1996)

Timestamp-based authentication protocols rely on real-time synchronisation between the principals involved. This synchronisation, which involves all concerned principals agreeing on the notion of their time, is often difficult to achieve, and hence nonce-based protocols were developed. However, the principals in a timestamp-based authentication protocol can be made to synchronise to logical time. Efficient logical time systems can guarantee that processors (or principals in this case) agree on a logical time. Using this property, new protocols can be developed for various communication paradigms. We show one such protocol for interactive communication between two parties using a trusted authentication server.
Formal Specification of AI Systems: Four Case Studies
Authors: I. D. Craig
Venue:  (1991)

In this paper, we outline four AI systems and their formal specification in Z. Two of the systems (a blackboard framework and the author''s CASSANDR architecture) are of high complexity and are for predominantly real-time, high reliability applications; the other two are production systems of an unconventional type. The first production system (called ELEKTRA) contains extensive facilities for performing meta-level inference. The second extends ELEKTRA with a frame system and organises rules into rulesets for enhanced modularity (its specification is still underway). Both production systems contain control features that can be accessed by rules: both are reflective systems. To date, the four specifications amount to more than 500 A4 pages, including proofs and explanatory text. The four specifications are related in that solutions to the problems encountered in the blackboard and CASSANDRA systems are attempted in the other two specifications. The formal specifications of the second two systems were undertaken because we wanted to experiment with ideas without having to engage in implementation at too early a stage ( ELEKTRA was subsequently implemented in Scheme from its Z specification): this turned out to be an excellent strategy. To conclude the paper, we review our approach and consider the general use of formal specifications in the development of AI systems.
Optimum design of pitched roof steel frames with haunched rafters by genetic algorithm
Authors: M. P. Saka
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Pitched roof steel frame appear to be the simplest structural form used in single storey building. However, its design necessitates consideration of many different structural criteria that are required in the design of complex structures. In this paper, genetic algorithm is used to develop an optimum design method for pitched roof steel frames with haunches for the rafters in the eaves. The algorithm selects the optimum universal beam sections for columns and rafters from the available steel sections table. Furthermore, it determines the optimum depth of haunch at eaves and length of the haunch required to reach the most cost-effective form. Formulation of the design problem is based on the elastic design method. The serviceability and the strength constraints are included in the design problem as defined in BS5950. Furthermore, the overall bucking of columns and rafters in the torsional mode between effective torsional restraints to both flanges is also checked. A pitch roof frame is designed by the algorithm developed to demonstrate its practical application.
Direct Evidence of Occlusion in Stereo and in Motion
Authors: James J Little, Walter E. Gillett
Venue:  (1990)

Discontinuities of surface properties are the most important locations in a scene; they are crucial for segmentation because they often coincide with object boundaries [TMB85]. Standard approaches to discontinuity detection decouple detection of disparity discontinuities from disparity computation. We have developed techniques for locating disparity discontinuities using information internal to the stereo algorithm of [DP86], rather than by post-processing the stereo data. The algorithm determines displacements by maximizing the sum, at overlapping small regions, of local comparisons. The detection methods are motivated by analysis of the geometry of matching and occlusion and the fact that detection is not just a pointwise decision. Our methods can be used in a combination to produce robust performance. This research is part of a project to build a ``Vision Machine'''' [PLG+88] at MIT that integrates outputs from early vision modules. Our techniques have been extensively tested on real images.
A Two-component Model of Texture for Analysis and Synthesis
Authors: Tao Hsu, R. Wilson
Venue:  (1996)

A model of natural texture based on a structural component which uses affine coordinate transformations and a stochastic residual component is presented. It is argued that the selection of an appropriate analysis scale can be formulated in terms of a trade-off between the rate at which parameters are generated and the distortion resulting from the approximation by the structural component. An efficient algorithm for identifying the parameters of the structural model is described and its utility demonstrated on a number of synthetic and natural textures.
Verification and Validation: What Impact Should Project Size and Complexity Have on Attendant V&V Activities and Supporting Infrastructure?
Authors: Arthur James D., Sargent Robert G., Dabney James B., Law Averill M., Morrison John D. (Jack)
Venue:  (1999)

The size and complexity of Modeling and Simulation (M&S) application continue to grow at a significant rate. The focus of this panel is to examine the impact that such growth should have on attendant Verification and Validation (V&V) activities. Two prominent considerations guiding the panel discussion are: (1) Extending the current M&S development objectives to include quality characteristics like maintainability, reliability, and reusability -- the current modus operandi focuses primarily on correctness, and (2) Recognizing the necessity and benefits of tailoring V&V activities commensurate with the size of the project, i.e., one size does not fit all. In this paper we provide six questions and four sets of responses to those questions. These questions and responses are intended to foster additional thought and discussion on topics crucial to the synthesis of quality M&S applications.