ppxscal/embedding_network huggingface dataset:
Object-oriented software for auditing information systems security: following a methodology for IS risk analysis and optimisation per level
Authors: Daniel Guinier
Venue: ACM SIGSAC Review (1992)

Information systems (IS) need permanent attention. Auditors must have effective tools to estimate their level of security and make recommendations to the management, according coherence and optimisation of the resources affected to maintain confidentiality, integrity and availability.Most of the time, risks have various and complex origins. A methodology is needed to analyse the coherence of the factors applied to the security and to suggest appropriate countermeasures, making part of a security policy regarding the objectives of the organization. There is a high demand for improved methodologies supported by software.A methodology for IS risk analysis and optimisation per level named MARION is presented. It has been developed in France from 1984 by APSAD, an association grouping together French insurance companies, and CLUSIF, an association in the area of computer security, MARION works in different contexts: mainframe mono-sites, networks and distributed systems, industrial computing, small and middle sized companies or systems, and microcomputing: involving technical tables, actualized and delivered by APSAD every year.The audit part of the methodology has been implemented in MacMARION, an object-oriented software working on a Macintosh platform, under MacOS operating system and programmed in the C++ language, making adaptation and reusability very easy. Input represents a personal appreciation provided by answer to questions. Output is quantitative and graphical, in the form of tables, roses and differential diagrams, which suggest coherence and relative seriousness with effort to accomplish regarding factors, categories of risks and losses. MacMARION offers an opportunity for self-assessment and a better productivity for auditors who can spend more time for details investigation and higher tasks, detailed investigation of higher or hidden risks.
A definition of an ISWIM-like language via scheme
Authors: Mirjana Ivanovic, Zoran Budimac
Venue: ACM SIGPLAN Notices (1993)

A full definition of a purely functional lSWIM-like language is given in the paper. A set of transformation rules for the translation of ISWlM expressions to expressions of a widely accepted Scheme programming language is given. The paper is supported with appropriate examples of equivalent expressions in both languages.
MediaStation 5000: Integrating Video and Audio
Authors: Woobin Lee, Yongmin Kim, Robert J. Gove, Christopher J. Read
Venue: IEEE MultiMedia (1994)

MediaStation 5000 is a highly integrated desktop multimedia system implemented on a single PC plug-in board. It performs multistandard compression, high-speed image processing, and fast 2D and 3D graphics functions. The Texas instruments Multimedia Video Processor (MVP), a single-chip multiprocessing device with a highly parallel internal architecture, provides the system's processing power and programmability.
Original Contribution: A comparison study of binary feedforward neural networks and digital circuits
Authors: Hubertus M. A. Andree, Gerard T. Barkema, Wim Lourens, Arie Taal, Jos C. Vermeulen
Venue: Neural Networks (1993)

A comparison study was carried out between feedforward neural networks composed of binary linear threshold units and digital circuits. These networks were generated by the regular partitioning algorithm and a modified Quine-McCluskey algorithm, respectively. The size of both types of networks and their generalisation properties are compared as a function of the nearest-neighbour correlation in the binary input sets. The ratio of the number of components required by digital circuits and the number of neurons grows linearly for the input sets considered. The considered neural networks do not outperform digital circuits with respect to generalisation. Sensitivity analysis leads to a preference for digital circuits, especially for increasing number of inputs. In the case of analog input sets, hybrid networks of binary neurons and logic gates are of interest.
A randomized implementation of multiple functional arrays
Authors: Tyng-Ruey Chuang
Venue: Proceedings of the 1994 ACM conference on LISP and functional programming (1994)

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded manner.Baker's shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the languages.The expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.
Logic program synthesis from incomplete specifications
Authors: Pierre Flener, Yves Deville
Venue: Journal of Symbolic Computation (1993)

We develop a framework for stepwise synthesis of logic programs from incomplete specifications. After the definition of logic formalisms for specifications and programs, logic program correctness and comparison criteria are proposed. Then we define criteria for upward and downward progression, in order to state strategies for incremental and non-incremental stepwise synthesis. It is shown how these strategies can be applied in practice. Finally, we instantiate the framework on a particular synthesis mechanism that we have developed. Our synthesis system, called SYNAPSe, is non-incremental, both deductive and inductive, and guided by a divide-and-conquer schema. We describe the objectives and methods of the crucial steps, and illustrate them on a sample problem.
The role of representation in interaction (abstract): discovering focal points among alternative solutions
Authors: Sarit Kraus, Jeffrey S. Rosenschein
Venue: ACM SIGOIS Bulletin (1992)

In multiagent planning an agent sometimes needs to collaborate with others to construct complex plans, or to accomplish large organizational tasks which he cannot do alone. Since each agent in a group may have incorrect beliefs about the world, and because agent's abilities differ, construction of a coordinated plan can be confounded. In this paper we propose a scheme for constructing plans for collaborating agents from their, possibly incorrect, beliefs and partial knowledge of the world. In the proposed scheme, when agents want to accomplish a goal together, each agent first proposes a possibly incomplete individual plan based on his own beliefs and skills. Then the agents use their individual plans to mutually construct a collaborative plan to accomplish the goal. A collaborative activity can be a composite action involving parts to be done by one agent, parts to be done concurrently by agents, and parts to be done jointly. The proposed method makes it possible for each agent to decide, without excessive communication, what actions he should take in collaboration.
Efficient programming in Maple: a case study
Authors: Bruno Salvy
Venue: ACM SIGSAM Bulletin (1993)

Studying the computation of orbits of some given group acting on a set, we show how successive refinements of a simple program provide a speedup factor of up to 200. The initial program cannot solve the problem at all, it is first converted into a program which needs one c.p.u. week and after all the optimizations have been performed, the computation takes only four hours. Although the problem is specific, we shall show that many of the optimizations we use are of interest for other problems as well.
Symmetric Toeplitz Matrices with Two Prescribed Eigenpairs
Authors: Moody T. Chu, Melissa A. Erbrecht
Venue: SIAM Journal on Matrix Analysis and Applications (1994)

The inverse problem of constructing a real symmetric Toeplitz matrix based on two prescribed eigenpairs is considered. Two new results are obtained. First, it is shown that the dimension of the subspace of Toeplitz matrices with two generically prescribed eigenvectors is independent of the size of the problem, and, in fact, is either two, three, or four, depending upon whether the eigenvectors are symmetric or skew-symmetric and whether $n$ is even or odd. This result is quite notable in that when only one eigenvector is prescribed the dimension is known to be at least $\[(n + 1)/2\]$. Taking into account the prescribed eigenvalues, the authors then show how each unit vector in the null subspace of a certain matrix uniquely determines a Toeplitz matrix that satisfies the prescribed eigenpairs constraint. The cases where two prescribed eigenpairs uniquely determine a Toeplitz matrix are explicitly characterized.
Double- and triple-step incremental generation of lines
Authors: Phil Graham, S. Sitharama Iyengar
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

A method of increasing the efficiency of line drawing algorithms by setting additional pixels during loop iterations is presented in this paper. This method adds no additional costs to the loop. It is applied here to the double-step algorithm presented in [15] and later used in [14], resulting in up to a thirty-three percent reduction in the number of iterations and a sixteen percent increase in speed. In addition, the code complexity and initialization costs of the resulting algorithm remain the same.
An equational framework for the flow analysis of higher order functional programs
Authors: Dan Stefanescu, Yuli Zhou
Venue: Proceedings of the 1994 ACM conference on LISP and functional programming (1994)

We present a simple method for the general flow analysis of high-order functional programs. The method computes an abstraction of the program's runtime environment via a system of monotonic equations. As the environment can grow unbounded, we exploit patterns in the program's control structure (i.e., the call-tree) to determine some static partition of the environment, and merge points in the environment belonging to the same equivalent-class. High order functions are handled by embedding control information into closures. The method is proven correct with respect to a rewriting system based operational semantics. Various implementation issues are also considered.
A Geometric Characterization of Fischer's Baby Monster
Authors: Alexander A. Ivanov
Venue: Journal of Algebraic Combinatorics: An International Journal (1992)

The sporadic simple group F2 known as Fischer's Baby Monster acts flag-transitively on a rank 5 P-geometry {\cal G}(F_2). P-geometries are geometries with string diagrams, all of whose nonempty edges except one are projective planes of order 2 and one terminal edge is the geometry of the Petersen graph. Let {\cal K} be a flag-transitive P-geometry of rank 5. Suppose that each proper residue of {\cal K} is isomorphic to the corresponding residue in {\cal G}(F_2). We show that in this case {\cal K} is isomorphic to {\cal G}(F_2). This result realizes a step in classification of the flag-transitive P-geometries and also plays an important role in the characterization of the Fischer&ndash;Griess Monster in terms of its 2-local parabolic geometry.
A concurrent process model of software development
Authors: Alan M. Davis, Pradip Sitaram
Venue: ACM SIGSOFT Software Engineering Notes (1994)

Most published software development models present software engineering as a series of discrete phases. They often capture the "inevitable intertwining" of pairs of phases and they often capture the need to return to earlier phases when new information is ascertained. However, in actual software development projects, activities typically associated with multiple phases are performed concurrently. This paper presents a new model of the software development process that effectively captures the concurrency among activities that is in berent in all non-trivial software development. Statecharts are used to present the model.
A low-cost graphics and multimedia workstation chip set
Authors: Steve Undy, Mick Bass, Dave Hollenbeck, Wayne Kever, Larry Thayer
Venue: IEEE Micro (1994)

With just three VLSI parts, Hewlett-Packard's latest workstation class lets designers optimize performance and cost at the system level. Its Hummingbird microprocessor features two-way superscalar execution incorporating two integer units, a floating-point unit, a 1-Kbyte internal instruction cache, an integrated external cache controller, an integrated memory and I/O controller, plus enhancements for little-endian and multimedia applications. Its Artist graphics controller integrates a graphical user interface accelerator, a frame buffer controller, and a video controller on a single chip.
The implementation of expert systems: a survey of successful implementations
Authors: Craig K. Tyran, Joey F. George
Venue: ACM SIGMIS Database (1993)

A descriptive mail survey of managers of work groups using expert system (ES) technology was performed to gain insight into the management of the ES implementation process. This article presents survey results representing 45 different ES projects that have been successfully implemented in organizations. Each of the managers was asked to evaluate the importance of 13 factors to ES implementation success and to report on the organizational climate and practices related to ES implementation. The survey results are generally consistent with earlier implementation research and indicate that successful ES implementation requires management attention to a combination of organizational factors, implementation activities, and technical factors. Implementation practices that were associated with the successful ES implementations were commitment to the ES project, user participation, and management support.
Indexing, Elaboration and Refinement: Incremental Learning of Explanatory Cases
Authors: Ashwin Ram
Venue: Machine Learning (1993)

This article describes how a reasoner can improve its understanding of an incompletely understood domain through the application of what it already knows to novel problems in that domain. Case-based reasoning is the process of using past experiences stored in the reasoner's memory to understand novel situations or solve novel problems. However, this process assumes that past experiences are well understood and provide good &ldquo;lessons&rdquo; to be used for future situations. This assumption is usually false when one is learning about a novel domain, since situations encountered previously in this domain might not have been understood completely. Furthermore, the reasoner may not even have a case that adequately deals with the new situation, or may not be able to access the case using existing indices. We present a theory of incremental learning based on the revision of previously existing case knowledge in response to experiences in such situations. The theory has been implemented in a case-based story understanding program that can (a) learn a new case in situations where no case already exists, (b) learn how to index the case in memory, and (c) incrementally refine its understanding of the case by using it to reason about new situations, thus evolving a better understanding of its domain through experience. This research complements work in case-based reasoning by providing mechanisms by which a case library can be automatically built for use by a case-based reasoning program.
Approximation and radial-basis-function networks
Authors: Jooyoung Park, Irwin W. Sandberg
Venue: Neural Computation (1993)

This paper concerns conditions for the approximation of functions in certain general spaces using radial-basis-function networks. It has been shown in recent papers that certain classes of radial-basis-function networks are broad enough for universal approximation. In this paper these results are considerably extended and sharpened.
The cost of conservative synchronization in parallel discrete event simulations
Authors: David M. Nicol
Venue: Journal of the ACM (JACM) (1993)

This paper analytically studies the performance of a synchronous conservative parallel discrete-event simulation protocol. The class of models considered simulates activity in a physical domain, and possesses a limited ability to predict future behavior. Using a stochastic model, it is shown that as the volume of simulation activity in the model increases relative to a fixed architecture, the complexity of the average per-event overhead due to synchronization, event list manipulation, lookahead calculations, and processor idle time approaches the complexity of the average per-event overhead of a serial simulation, sometimes rapidly. The method is therefore within a constant factor of optimal. The result holds for the worst case &ldquo;fully-connected&rdquo; communication topology, where an event in any other portion of the domain can cause an event in any other protion of the domain. Our analysis demonstrates that on large problems&mdash;those for which parallel processing is ideally suited&mdash; there is often enough parallel workload so that processors are not usually idle. It also demonstrated the viability of the method empirically, showing how good performance is achieved on large problems using a thirty-two node Intel iPSC/2 distributed memory multiprocessor.
Architecture of the Encina distributed transaction processing family
Authors: Mark Sherman
Venue: ACM SIGMOD Record (1993)

This paper discusses how the Encina&reg; family of distributed transaction processing software can be used to build reliable, distributed applications. We start with the toolkit components of Encina and how they are used for implementing ACID properties. We then consider how the toolkit can be applied in building higher level components in a DCE environment. We conclude with a discussion of the Encina Monitor, which provides a framework for organizing a collection of machines and servers.
Tutorial notes on partial evaluation
Authors: Charles Consel, Olivier Danvy
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

The last years have witnessed a flurry of new results in the area of partial evaluation. These tutorial notes survey the field and present a critical assessment of the state of the art.
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
Authors: Rolf Klein, Andrzej Lingas
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and only if v is the closest vertex of P visible from p. We present a randomized algorithm that builds the bounded Voronoi diagram of a simple polygon in linear expected time. Among other applications, we can construct within the same time bound the generalized Delaunay triangulation of P and the minimal spanning tree on P's vertices that is contained in P.
Wastewater Treatment Systems from Case&ndash;Based Reasoning
Authors: Srinivas Krovvidy, William G. Wee
Venue: Machine Learning (1993)

Case-Based Reasoning (CBR) is one of the emerging paradigms for designing intelligent systems. Preliminary studies indicate that the area is ripe for theoretical advances and innovative applications. Heuristic search is one of the most widely used techniques for obtaining optimal solutions to many real-world problems. We formulated the design of wastewater treatment systems as a heuristic search problem. In this article we identify some necessary properties of the heuristic search problems to be solved in the CBR paradigm. We designed a CBR system based on these observations and performed several experiments with the wastewater treatment problem. We compare the performance of the CBR system with the A* search algorithm.
Dynamic semantic specification by two-level grammars for a block structured language with subroutine parameters
Authors: M. Badii, F. Abdollahzadeh
Venue: ACM SIGPLAN Notices (1993)

This paper presents the application of a formal description language -- Van Wijngaarden Two-Level grammar -- to define the dynamic semantics of a block structured language consisting of several types of parameter passing mechanisms. We will show, in a fairly understandable, concise and clear fashion, that the metalinguistic formalism of Two-Level grammar is a fine descriptive device for this purpose.
An analytical comparison of periodic checkpointing and incremental state saving
Authors: Avinash C. Palaniswamy, Philip A. Wilsey
Venue: Proceedings of the seventh workshop on Parallel and distributed simulation (1993)

The successful application of optimistic synchronization techniques in parallel simulation requires that rollback overheads be contained. The chief contributions to rollback overhead in a Time Warp simulation are the time required to save state information and the time required to restore a previous state. Two competing techniques for reducing rollback overhead are periodic checkpointing (Lin and Lazowska, 1989) and incremental state saving (Bauer et al., 1991). This paper analytically compares the relative performance of periodic checkpointing to incremental state savings. The analytical model derived for periodic checkpointing is based almost entirely on the previous model developed by Lin (Lin and Lazowska, 1989). The analytical model for incremental state saving has been developed for this study. The comparison assumes an optimal checkpoint interval and shows under what simulation parameters each technique performs best.
Summary of the Dagstuhl workshop on future directions in software engineering: February 17&ndash;21, 1992, Schlo&szlig; Dagstuhl
Authors: Walter F. Tichy, Nico Habermann, Lutz Prechelt
Venue: ACM SIGSOFT Software Engineering Notes (1993)

The intent of the workshop was to bring together leading scientists for identifying promising directions for future research in Software Engineering. The motivation for the workshop was the realization that Software Engineering research was not in good shape, with the present emphasis on management and risk control diverting attention from hard, technical subjects.After week-long, intensive discussions of a great number of issues, the following topics were seen as most crucial for progress:1. Developing the area of software architecture as a foundation of Software Engineering;2. Learning to master evolving systems;3. Building a scientific basis for Software Engineering;4. Emphasizing science and engineering know-how when educating practitioners.Formal methods, domain specific knowledge, special purpose languages, and reuse were seen as important approaches, but not as solutions or ends in themselves. There was also a fair amount of introspection on proper method, evaluation, and experimentation in Software Engineering research.This report contains participants' position statements and a record of the discussions. The editors hope that it may help make research in Software Engineering an exciting and thriving endeavor once again.