ppxscal/embedding_network huggingface dataset:
Securing a global village and its resources: baseline security for interconnected signaling system #7 telecommunications networks
Authors: Hank M. Kluepfel
Venue: Proceedings of the 1st ACM conference on Computer and communications security (1993)

The resulting national focus on Network Integrity issues, spawned the development of an industry commitment to affect and realize a minimum security baseline for interconnected SS7 networks. In addition the affected carriers in those outage have accelerated their pursuit of secure solutions to today's intelligent networking.[2]This paper will focus on the development of the baseline and the current effort to take the baseline into national, e.g., National Institute of Technology and Standards (NIST), and internationally recognized standard bodies or forums, e.g., the Council of European Committees Green Book on Information Security, and the American National Standards Institute efforts on Telecommunications Management Networks within T1M1.5.Avoiding the standard broad based approach to the subject, this paper is addressed to the nationally and internationally interconnected telecommunications carrier systems managers and administrators who are often the &ldquo;frst compromised&rdquo; and &ldquo;last to know&rdquo; that they, their clients and customers are at risk from the networked vulnerabilities of a trusted partner's network or the dumbing down of the deployed security technology from a vendor.
Skills needed by user-centered design practitioners in real software development environments: report on the CHI'92 workshop
Authors: Tom Dayton
Venue: ACM SIGCHI Bulletin (1993)

User-centered design (UCD) of human-computer interfaces--including task flow and documentation---is gaining acceptance in software development organizations. But managers who want their organizations to start using UCD often do not know what characteristics to look for, in candidates for hiring or retraining to fill UCD roles; this article can help. It has the recommendations from participants in a CHI '92 conference workshop on this topic. The 16 workshop participants were UCD practitioners and managers from companies and a few universities across the United States, Canada, and Sweden. This article first describes some typical roles of UCD practitioners in software development organizations. There follows a list of attributes that UCD practitioners should have. Some attributes should be had by all practitioners, regardless of their subspecialties. The most important of those universal attributes are of three types: knowledge that can be acquired formally (e.g., of the human-computer interaction literature, cognitive processes, experimental design, rapid prototyping), skill that can be gotten from experience (e.g., estimating resources needed to do a job, commitment to users, understanding of the software development process, negotiating ability, enjoyment of working on teams, ability to really listen), and attributes that are harder to acquire (e.g., tenacity, flexibility). Every practitioner needs other characteristics as well, but their importances differ by the practitioners' subspecialties (e.g., a design team leader needs team management skills).
Self-sufficiency and critical thinking in the programming languages course
Authors: Bard Bloom, Alan Fekete
Venue: ACM SIGCSE Bulletin (1994)

We describe a project in a standard course in Programming Languages. This project forces students to display self-sufficiency and critical thinking skills. The students are given the documentation and interpreter for smeagol, a small invented language which resembles the control language for many text-processors, spreadsheets, and so forth. They are expected to learn (within two days) enough to write working non-trivial programs. They then must write an evaluation of the language, documentation, and system. In this paper, we explain many specific features of the project, and discuss its effectiveness.
Temporal reasoning for planning and scheduling
Authors: Mark Boddy
Venue: ACM SIGART Bulletin (1993)

We briefly describe the current implementation of the Time Map Manager (TMM), followed by a description of the system's suitability for and application to planning and scheduling tasks.
Relevance feedback and inference networks
Authors: David Haines, W. Bruce Croft
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

Relevance feedback, which modifies queries using judgements of the relevance of a few, highly-ranked documents, has historically been an important method for increasing the performance of information retrieval systems. In this paper, we extend the inference network model introduced by Turtle and Croft to include relevance feedback techniques. The difference between relevance feedback on text abstracts and full text collections is studied. Preliminary results for relevance feedback on the structured queries supported by the inference net model are also reported.
Concurrency control and recovery of multidatabase work flows in telecommunication applications
Authors: W. Woody Jin, Marek Rusinkiewicz, Linda Ness, Amit Sheth
Venue: ACM SIGMOD Record (1993)

In a research and technology application project at Bellcore, we used multidatabase transactions to model multisystem work flows of telecommunication applications. During the project a prototype scheduler for executing multi-database transactions was developed. Two of the issues addressed in this project were concurrent execution of multi-database transactions and their failure recovery. This paper discusses our use of properties of the application and the telecommunication systems to develop simple and efficient solutions to the concurrency control and recovery problems.
Tutorial on specialisation of logic programs
Authors: J. P. Gallagher
Venue: Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (1993)

In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation of a logic program with respect to a goal. The practical considerations of gaining efficiency (and not losing any) are discussed. A renaming scheme for performing structure specialisation is then described, and illustrated on a well-known string matching example. The basic algorithm is enhanced by incorporating abstract interpretation. A two-phase specialisation is then described and illustrated, in which partial evaluation is followed by the detection and removal of useless clauses. This is shown for the specialisation of a proof procedure for first order logic. The specialisation of meta programs is very important in logic programming, and the ground representation for object programs has to be handled. Some techniques for doing this are described. Comparisons are made in the tutorial to similar work in other programming languages, and the similarities and differences between them and logic program specialisation is discussed.
How fluent is your interface?: designing for international users
Authors: Patricia Russo, Stephen Boor
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

To successfully build bridges between worlds, user interface designers must increase their awareness of cross-cultural differences, and make changes to the traditional software development process. Creating fluent interfaces for international markets goes beyond translating text and date, time, and number formats. This paper presents and explains a cross-cultural checklist of issues including text, local formats, images, symbols, colors, flow, and product functionality. Suggestions for an effective international product development cycle are provided. The suggested development cycle incorporates international design feedback and usability testing before the initial product is released.
Computing the PSVD of Two $2 \times 2$ Triangular Matrices
Authors: Gary E. Adams, Adam W. Bojanczyk, Franklin T. Luk
Venue: SIAM Journal on Matrix Analysis and Applications (1994)

In this paper, the authors propose a method for computing the singular value decomposition (SVD) of a product of two $2 \times 2$ triangular matrices. The method shown is numerically desirable in that all relevant residual elements will be numerically small.
A test problem generator for the Steiner problem in graphs
Authors: B. N. Khoury, P. M. Pardalos, D.-Z. Du
Venue: ACM Transactions on Mathematical Software (TOMS) (1993)

In this paper we present a new binary-programming formulation for the Steiner problem in graphs (SPG), which is well known to be NP-hard. We use this formulation to generate test problems with known optimal solutions. The technique uses the KKT optimality conditions on the corresponding quadratically constrained optimization problem.
A prototype of an interface builder for the Common Lisp Interface Manager&mdash;CLIB
Authors: Jan Hesse, Rainer König, Filippo Logi, Jens Herder
Venue: ACM SIGPLAN Notices (1993)

The Common Lisp Interface Manager (CLIM) is used to develop graphical user interfaces for Lisp-based applications. With the prototype of the CLIM Interface Builder (CLIB) the programmer can generate code for CLIM interactively. The developing process will be fast and less prone to errors. With this new tool, the interactive rapid prototyping reduces costs of a specification phase. Here we present the concept and first results of the prototype of CLIB.
The Automorphism Group and the Convex Subgraphs of the Quadratic Forms Graph in Characteristic 2
Authors: A. Munemasa, D. V. Pasechnik, S. V. Shpectorov
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

We determine the automorphism group and the convex subgraphs of the quadratic forms graph Quad(n,q),q even.
Retrieving reusable software by sampling behavior
Authors: Andy Podgurski, Lynn Pierce
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1993)

A new method, called behavior sampling, is proposed for automated retrieval of reusable components from software libraries. Behavior sampling exploits the property of software that distinguished it from other forms of test: executability. Basic behavior sampling identifies relevant routines by executing candidates on a searcher-supplied sample of operational inputs and by comparing their output to output provided by the searcher. The probabilistic basis for behavior sampling is described, and experimental results are reported that suggest that basic behavior sampling exhibits high precision when used with small samples. Extensions to basic behavior sampling are proposed to improve its recall and to make it applicable to the retrieval of abstract data types and object classes.
A client-side stub interpreter
Authors: Peter B. Kessler
Venue: ACM SIGPLAN Notices (1994)

We have built a research operating system in which all services are presented through interfaces described by an interface description language. The system consists of a micro-kernel that supports a small number of these interfaces, and a large number of interfaces that are implemented by user-level code. A typical service implements one or more interfaces, but is a client of many other interfaces that are implemented elsewhere in the system. We have an interface compiler that generates client-side and server-side stubs to deliver calls from clients to servers, providing location transparency if the client and server are in different address spaces. The code for client-side stubs was occupying a large amount of the text space of our clients, so a stub interpreter was written to replace the clientside stub methods. The result was that we traded 125K bytes of stub code for 13K bytes of stub descriptions and 4K bytes of stub interpreter. This paper describes the stub interpreter, the stub descriptions, and discusses some alternatives.
A geometrical data-parallel language
Authors: Jean-Luc Dekeyser, Dominique Lazure, Philippe Marquet
Venue: ACM SIGPLAN Notices (1994)

The HELP project proposes a model of data-parallel programming allowing a programmer to develop an algorithm the nearest of his thought. Usually, for many parts of a data-parallel program, the manipulations of data could be modelized as geometrical migrations in side a cartesian reference space.We define the language C-HELP in the frame of explicit data-parallel languages, the communications and the computations are separated, moreover any vector description is banished.This model and the associated languages are based on the hyper-space notion, and the algorithm development follows an original semantic of computations limited to a set of hyper-space points. The hyper-space is not only a compilation-oriented concept but consists in a multi-dimentional virtual array integrated at the programming model and provides a referential for any object access.
Information systems and power: structural versus personal views
Authors: Rebecca Koop, Rebecca Grant
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

Power issues impact information systems design, development, and implementation. Our understanding of the sources of power affects how we interpret its potential impacts. This study examines the foundations of both personal and structural power sources. The outcomes of two well-known IS case studies are re-interpreted using the two perspectives. This study shows that IS researchers should employ a structural view of power when exploring its impact on IS design and implementation.
Metric-driven reengineering for static concurrency analysis
Authors: David L. Levine, Richard N. Taylor
Venue: Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis (1993)

An approach to statically analyzing a concurrent program not suited for analysis is described. The program is reengineered to reduce the complexity of concurrency-related activities, thereby reducing the size of the concurrency state space. The key to the reengineering process is a metric set that characterizes program task interaction complexity and provides guidance for restructuring. An initial version of a metric set is proposed and applied to two examples to demonstrate the utility of the reengineering-for-analysis process. The reengineering has potential benefits apart from supporting analyzability, following the dictum that if it is hard to analyze, it is hard to understand and maintain.
A derived algorithm for evaluating ε-expressions over abstract sets
Authors: Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
Venue: Journal of Symbolic Computation (1993)

Four weak theories of pure sets are axiomatically characterized. A decision method is given for checking sentences of the form @?"y"1...@?"y"n@?"x"p, where n varies over natural numbers and p over unquantified matrices, for provability in each theory. Dually, the method can be used to check @?"y"1...@?"y"n@?"x"@?"p for satisfiability. The completeness proof is fully constructive: this means that given a satisfiable constraint of the form @?"y"1...@?"y"n@?"x"@?"p, a computable model of the axioms which also fulfills the constraint can be synthesized. In this sense, we have a way of automatically generating a concrete representation of the abstract data-type ''set'' under varying axioms. The problem is also addressed of how to determine @? x p; i.e., how to find a @z fulfilling p(@x"1,...,@x"n,@z) in a computable model M of one of our theories, as a function of input M-sets @x"1,...,@x"n. A partial solution to this problem is supplied, which works when @?"y"1...@?"y"n@?"x"p is a theorem and M meets a suitable condition which happens to be satisfied by those models that are produced by our automatic synthesis algorithm. A stronger condition on M is also characterized that makes @? x p computable in all cases (at worst through a blind search method). Examples showing the expressive power of the @?*@?-constraints and the usefulness of @?-expressions in set computations are included. Envisaged extensions of the proposed methods to axiomatic set theories antithetic to the classical ones are briefly hinted at.
Visual interaction design special interest area: getting started
Authors: Maria G. Wadlow
Venue: ACM SIGCHI Bulletin (1993)

The theme for this issue is "Getting Started." I've been looking over the list of goals we made at our last meeting at CHI 92 and our Special Interest Area seems to have gotten off to quite a good start, with admirable progress on almost every item.
Lifetime-sensitive modulo scheduling
Authors: Richard A. Huff
Venue: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation (1993)

This paper shows how to software pipeline a loop for minimal register pressure without sacrificing the loop's minimum execution time. This novel bidirectional slack-scheduling method has been implemented in a FORTRAN compiler and tested on many scientific benchmarks. The empirical results&mdash;when measured against an absolute lower bound on execution time, and against a novel schedule-independent absolute lower bound on register pressure&mdash;indicate near-optimal performance.
SANP: a communication level protocol for negotiations (abstract)
Authors: Man Kit Chang, Carson C. Woo
Venue: ACM SIGOIS Bulletin (1992)

Distributed Artificial Intelligent (DAI) researchers have long been interested in the question of how to resolve conflicts among cooperative agents in distributed problem solving environments. Negotiation has been suggested by many researchers as an important technique to resolve conflicts. However, most of the existing negotiation protocols used in DAI systems are inflexible. Actual protocols rarely take into account the result from negotiation research. In this paper, we propose a negotiation protocol, SANP (Speech Sct based Negotiation Protocol), that is based on Ballmer and Brennenstuhl's speech act theory, and on the negotiation analysis literature from other disciplines. SANP is a flexible protocol that supports multi-level negotiations between two parties. In addition, SANP also allows third party arbitration if the parties involved in the negotiation cannot resolve the conflict themselves.
Designing Optimum One-Level Carry-Skip Adders
Authors: Vitit Kantabutra
Venue: IEEE Transactions on Computers (1993)

The author shows how to design one-level carry-skip adders that attain very high speeds. One-level carry-skip adders are very fast adders that are hardly more complex than the much-slower ripple adders. The design procedure allows the use of realistic component delays obtained by simulation and is technology-independent. An example of a 64-b, 1 mu m CMOS adder is given. This adder achieves an add time of 6.23 ns, measured by SPICE simulation with realistic loads. This delay figure excludes sum buffering delays, which depend on the particular application of the adder. The combination of high-speed and simplicity makes one-level carry-skip adders attractive for applications in highly parallel systems.
Detecting faults in an information engineering effort: a case study of failure
Authors: Richard K. Lynch
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

A case study which recounts the experience of one organization, a large health insurer, adopting an information engineering (IE) approach to its system development efforts. The study suggests that while there were some successes in initially utilizing the techniques, the organization ultimately failed to diffuse the approach throughout the whole organization. The article suggests that a lack of commitment and management discipline contributed to the failure, but that there are also some inherent difficulties with the IE approach.
Computer graphics curriculum: time for a change?
Authors: G. Scott Owen, María M. Larrondo-Petrie, Cary Laxer
Venue: ACM SIGGRAPH Computer Graphics (1994)

Computer graphics is a field driven by technology. Whereas the technology has changed enormously in the past 15 years, the way most computer science faculty teach computer graphics courses has not changed. The authors believe that faculty should seriously consider changing the content and approach of their computer graphics courses, and in this paper we discuss the rationale for the change and our recomendation for a new course. Note that Maria Larrondo-Petrie organized a panel session on this topic for the SIGGRAPH '94 conference (with panelists Jack Bresenham, John Lansdown, Cary Laxer and Scott Owen).
An introduction to assertional reasoning for concurrent systems
Authors: A. Udaya Shankar
Venue: ACM Computing Surveys (CSUR) (1993)

This is a tutorial introduction to assertional reasoning based on temporal logic. The objective is to provide a working familiarity with the technique. We use a simple system model and a simple proof system, and we keep to a minimum the treatment of issues such as soundness, completeness, compositionality, and abstraction. We model a concurrent system by a state transition system and fairness requirements. We reason about such systems using Hoare logic and a subset of linear-time temporal logic, specifically, invariant assertions and leads-to assertions. We apply the method to several examples.
Using fuzzy logic to represent security policies in the multipolicy paradigm
Authors: Hilary H. Hosmer
Venue: ACM SIGSAC Review (1992)

Fuzzy logic is a promising way to represent non-traditional policies, like privacy, integrity and availability. Its vagueness and use of continuous data fit better with many non-military enterprise policy requirements. The theoretical foundation needed for development and assurance of computer systems has been worked out in an extensive literature, but more attention needs to be paid to its use in trusted systems. It is appropriate to use fuzzy logic for implementing aspects of the Multipolicy Paradigm.
A partial evaluator for data flow graphs
Authors: Jesper Vasell
Venue: Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (1993)

It has been shown that control flow decisions often reduce the amount of fine-grain, or instruction-level parallelism in many computations. There exists various architectural solutions to this problem, such as branch prediction and speculative execution. Here we present an alternative solution, based on the use of partial evaluation for statically increasing the parallelism of a computation. In particular we explore the capability of a partial evaluator to remove control flow decisions. A partial evaluator is described, which specializes data flow graphs produced by a compiler for a fine-grained processor array. The data flow graphs can be viewed as the equivalent of a machine-code program for conventional processor, and consequently some aspects of the architecture can be taken into account by the partial evaluator. Results from the use of the partial evaluator show that it can significantly improve the performance of a computation. The performance improvement is partly due to improved parallelism, but mostly due to a reduce dynamic instruction count, i.e. a reduction in the number of operations executed.
Asymptotic First Hitting-Time Distribution of Annealing Processes
Authors: Christian Mazza
Venue: SIAM Journal on Control and Optimization (1994)

This paper presents asymptotics for the distribution of the first hitting time $\tau$ of $E_\min$ for the continuous-time version of simulated annealing processes. The method considers the backward equation associated with the process. It is shown that under certain assumptions, it is possible to characterize the eigenvectors of the transition matrix with the help of polynomials that are related to some families of graphs.