ppxscal/embedding_network huggingface dataset:
Graph Searching and Interval Completion
Authors: Fedor V. Fomin, Petr A. Golovach
Venue: SIAM Journal on Discrete Mathematics (2000)

In the early studies on graph searching a graph was considered as a system of tunnels in which a fast and clever fugitive is hidden. The "classical" search problem is to find a search plan using the minimal number of searchers. In this paper, we consider a new criterion of optimization, namely, the search cost. First, we prove monotone properties of searching with the smallest cost. Then, making use of monotone properties, we prove that for any graph G the search cost of G is equal to the smallest number of edges of all interval supergraphs of G. Finally, we show how to compute the search cost of a cograph and the corresponding search strategy in linear time.
Report on proposed American standard flowchart symbols for information processing
Authors: Robert J. Rossheim
Venue: Communications of the ACM (1963)

This paper presents the essential contents of the Proposed American Standard Flowchart Symbols for Information Processing. This is the first proposed standard prepared by Subcommittee X3.6 on Problem Description and Analysis of the American Standards Association (ASA).
Computer head control software to compensate for neck movement limitations
Authors: Edmund LoPresti, David M. Brienza, Jennifer Angelo
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Computer head controls provide an alternative means of computer access for people with disabilities. However, a person's ability to use head controls may be reduced if his or her disability involves neck movement limitations. Software was developed which incorporates five methods of compensating for a user's neck movement limitation. This software will be used to evaluate and compare these methods, in order to determine their effectiveness in helping people operate a computer using head controls.
Communication decisions in multi-agent cooperation: model and experiments
Authors: Ping Xuan, Victor Lesser, Shlomo Zilberstein
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In multi-agent cooperation, agents share a common goal, which is evaluated through a global utility function. However, an agent typically cannot observe the global state of an uncertain environment, and therefore they must communicate with each other in order to share the information needed for deciding which actions to take. We argue that, when communication incurs a cost (due to resource consumption, for example), whether to communicate or not also becomes a decision to make. Hence, communication decision becomes part of the overall agent decision problem. In order to explicitly address this problem, we present a multi-agent extension to Markov decision processes in which communication can be modeled as an explicit action that incurs a cost. This framework provides a foundation for a quantified study of agent coordination policies and provides both motivation and insight to the design of heuristic approaches. An example problem is studied under this framework. From this example we can see the impact communication policies have on the overall agent policies, and what implications we can find toward the design of agent coordination policies.
The concurrency hierarchy, and algorithms for unbounded concurrency
Authors: Eli Gafni, Michael Merritt, Gadi Taubenfeld
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We study wait-free computation using (read/write) shared memory under a range of assumptions on the arrival pattern of processes. We distinguish first between bounded and infinite arrival patterns, and further distinguish these models by restricting the number of arrivals minus departures, the concurrency. Under the condition that no process takes infinitely many steps without terminating, for any finite bound k > 0, we show that bounding concurrency reveals a strict hierarchy of computational models: a model in which concurrency is bounded by k + 1 is strictly weaker than the model in which concurrency is bounded by k, for all k &nge; 1. A model in which concurrency is bounded in each run, but no bound holds for all runs, is shown to be weaker than a k-bounded model for any k. The unbounded model is shown to be weaker still&mdash;in this model, finite prefixes of runs have bounded concurrency, but runs are admitted for which no finite bound holds over all prefixes. Hence, as the concurrency grows, the set of solvable problems strictly shrinks. Nevertheless, on the positive side, we demonstrate that many interesting problems (collect, snapshot, renaming) are solvable even in the infinite arrival, unbounded concurrency model. This investigation illuminates relations between notions of wait-free solvability distinguished by arrival pattern, and notions of adaptive, one-shot, and long-lived solvability.
Real-time protocol analysis for detecting link-state routing protocol attacks
Authors: Ho-Yen Chang, S. Felix Wu, Y. Frank Jou
Venue: ACM Transactions on Information and System Security (TISSEC) (2001)

A real-time knowledge-based network intrusion-detection model for a link-state routing protocol is presented for the OSPF protocol. This model includes three layers: a data process layer to parse packets and dispatch data; and event abstractor to abstract predefined real-time events for the link-state routing protocol; and an extended timed finite state machine to express the real-time behavior of the protocol engine and to detect intrusions by pattern matching. The timed FSM, called the JiNao Finite State Machine (JFSM) is extended from the conventional FSM with timed states, multiple timers, and time constraints on state transitions. The JFSM is implemented as a generator that can create and FSM by constructing the configuration file only. The results show that this approach is very effective for detecting real-time intrusions. Our approach can be extended for use in other network protocol intrusion-detection systems, especially for those with known attacks.
Social processes and proofs of theorems and programs
Authors: Richard A. De Millo, Richard J. Lipton, Alan J. Perlis
Venue: Communications of the ACM (1979)

It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.
File organization: implementation of a method guaranteeing retrieval in one access
Authors: Per-Åke Larson, Ajay Kajla
Venue: Communications of the ACM (1984)

A new file organization method that guarantees retrieval of any record in one access is tested on two existing files, producing empirical results that compare favorably with theoretical predictions. The description of the method includes the algorithms used for implementing the required hashing and signature functions.
A parallel algorithm for sparse symbolic LU factorization without pivoting on out&mdash;of&mdash;core matrices
Authors: Michel Cosnard, Laura Grigori
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Finding the nonzero structures of the lower and upper triangular factors of an unsymmetric sparse matrix A is an important problem in the field of sparse matrix computations. Complementing previous research on sequential algorithms, we develop a parallel algorithm by appropriately intertwining a fully concurrent algorithm with an experimentally proved efficient algorithm (both algorithms are previous art). The resulting algorithm, intended to use with out-of-core matrices, leads to sensitive improvements in memory usage. The algorithm is described in terms of its theoretical complexity, its experimental implementation with the MPI communication library the Origin 2000 multiprocessor, as well as its performance on large size real world matrices.
On the complexity of computing the measure of ∪[ai,bi]
Authors: Michael L. Fredman, Bruce Weide
Venue: Communications of the ACM (1978)

The decision tree complexity of computing the measure of the union of n (possibly overlapping) intervals is shown to be &OHgr;(n log n), even if comparisons between linear functions of the interval endpoints are allowed. The existence of an &OHgr;(n log n) lower bound to determine whether any two of n real numbers are within &isin; of each other is also demonstrated. These problems provide an excellent opportunity for discussing the effects of the computational model on the ease of analysis and on the results produced.
Self-Testing without the Generator Bottleneck
Authors: Funda Ergün, S. Ravi Kumar, D. Sivakumar
Venue: SIAM Journal on Computing (2000)

Suppose P is a program designed to compute a function f defined on a group G. The task of self-testing P, that is, testing if P computes f correctly on most inputs, usually involves testing explicitly if P computes f correctly on every generator of G. In the case of multivariate functions, the number of generators, and hence the number of such tests, becomes prohibitively large. We refer to this problem as the generator bottleneck. We develop a technique that can be used to overcome the generator bottleneck for functions that have a certain nice structure, specifically if the relationship between the values of the function on the set of generators is easily checkable. Using our technique, we build the first efficient self-testers for many linear, multilinear, and some nonlinear functions. This includes the FFT, and various polynomial functions. All of the self-testers we present make only O(1) calls to the program that is being tested. As a consequence of our techniques, we also obtain efficient program result-checkers for all these problems.
Identifying information network profiles for planning management
Authors: Saad Haj Bakry
Venue: International Journal of Network Management (2000)

The increasing need for information networks and the increasing change affecting these networks are making their development and planning increasingly sophisticated. This paper attempts to identify a comprehensive information profile for such networks, and discuss its use for enhancing the management of network development and supporting future planning decisions. Copyright &copy; 2000 John Wiley Sons, Ltd.
Education related to the use of computers in organizations
Authors: Daniel Teichroew
Venue: Communications of the ACM (1971)

The ACM Curriculum Committee on Computer Education for Management has been carrying out a study on &ldquo;Curriculum Development in Management Information Systems Education in Colleges and Universities&rdquo; under a grant from the National Science Foundation. This position paper provides a framework for the study. Preliminary conclusions are presented on the need for education in administrative information systems, and appropriate college curricula and courses are suggested. Also, the role of professional societies and organizations using computers is discussed, and the plans of the Committee are outlined. The initial approach of the Committee has been to describe the education necessary for the effective use of computers in organizations, to classify the positions for which education is required, and to survey educational programs now available.
Interference in multiprocessor computer systems with interleaved memory
Authors: Forest Baskett, Alan Jay Smith
Venue: Communications of the ACM (1976)

This paper analyzes the memory interference caused by several processors simultaneously using several memory modules. Exact results are computed for a simple model of such a system. The limiting value is derived for the relative degree of memory interference as the system size increases. The model of the limiting behavior of the system yields approximate results for the simple model and also suggests that the results are valid for a much larger class of models, including those more nearly like real systems than the simple model. The assumptions and results of the simple model are tested against some measurements of program behavior and simulations of systems using memory references from real programs. The model results provide a good indication of the performance that should be expected from real systems of this type.
Loop optimization for a class of memory-constrained computations
Authors: D. Cociorva, J. W. Wilkins, C. Lam, G. Baumgartner, J. Ramanujam, P. Sadayappan
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Compute-intensive multi-dimensional summations that involve products of several arrays arise in the modeling of electronic structure of materials. Sometimes several alternative formulations of a computation, representing different space-time trade-offs, are possible. By computing and storing some intermediate arrays, reduction of the number of arithmetic operations is possible, but the size of intermediate temporary arrays may be prohibitively large. Loop fusion can be applied to reduce memory requirements, but that could impede effective tiling to minimize memory access costs. This paper develops an integrated model combining loop tiling for enhancing data reuse, and loop fusion for reduction of memory for intermediate temporary arrays. An algorithm is presented that addresses the selection of tile sizes and choice of loops for fusion, with the objective of minimizing cache misses while keeping the total memory usage within a given limit. Experimental results are reported that demonstrate the effectiveness of the combined loop tiling and fusion transformations performed by using the developed framework.
Preliminary information on SCAMP
Authors: G. S. Burgess
Venue: ACM SIGMICRO Newsletter (1987)

A general description of the salient feature of SCAMP (Scientific Computer and Modular Processer)
Barriers to use: usability and content accessibility on the Web's most popular sites
Authors: Terry Sullivan, Rebecca Matson
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Content accessibility is a key feature in highly usable Web sites, but reports in the popular press typically report that 95% or more of all Web sites are inaccessible to users with disabilities. The present study is a content accessibility compliance audit of 50 of the Web's most popular sites, undertaken to determine if content accessibility can be conceived and reported in continuous, rather than dichotomous, terms. Preliminary results suggest that a meaningful ordinal ranking of content accessibility is not only possible, but also correlates significantly with the results of independent automated usability assessment procedures.
Comments on &ldquo;Communicating Sequential Processes&rdquo;
Authors: Richard B. Kieburtz, Abraham Silberschatz
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

In his recent paper, &ldquo;Communicating Sequential Processes&rdquo; (Comm. ACM 21, 8 (Aug. 1978), 666-677), C.A.R. Hoare outlines a programming language notation for interprocess communication in which processes are synchronized by the messages they exchange. The notation carries with it certain implications for the synchronization protocols required in a message transfer. These are not at all obvious and are made explicit here. An alternative convention is suggested in which communication and synchronization are partially uncoupled from one another.
Educational programs in information systems: a report of the ACM curriculum committee on information systems
Authors: Jay F. Nunamaker,  Jr.
Venue: Communications of the ACM (1981)

This report describes the status of educational programs in Information Systems at the B.S., M.S., and Ph.D. levels. A survey was conducted during the period June 1977-June 1979 of schools of Business Administration, Departments of Computer Science, Engineering Colleges, and academic units offering programs in Information Systems. A one-page description of each program was then generated according to a standard format. This standardized description was used as a guide to summarize information about each program. The report outlines career opportunities in Information Systems and lists brief descriptions of positions available to graduates of Information Systems programs. The need for an Information Systems program and problem areas with respect to teaching information systems are discussed. The results of the survey include a listing of the most common names for the Information Systems program and an evaluation of the number of programs that met the guidelines established by the Curriculum Committee on Computer Education for Management in 1972 and 1973. A list of institutions by degree level that met the proposed guidelines is presented.
New approaches to covering and packing problems
Authors: Aravind Srinivasan
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic probabilistic method: showing that a certain randomized approach produces a good approximation with positive probability. This approach seems inherently sequential; by employing the method of alteration we present the first RNC and NC approximation algorithms that match the best sequential guarantees. Extending our approach, we get the first RNC and NC approximation algorithms for certain multi-criteria versions of these problems. We also present the first NC algorithms for two packing and covering problems that are not subsumed by the above result: finding large independent sets in graphs, and rounding fractional Group Steiner solutions on trees.
RS-FDRA: a register sensitive software pipelining algorithm for embedded VLIW processors
Authors: Cagdas Akturan, Margarida F. Jacome
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

The paper proposes a novel software-pipelining algorithm, Register Sensitive Force Directed Retiming Algorithm (RS-FDRA), suitable for optimizing compilers targeting embedded VLIW processors. The key difference between RS-FDRA and previous approaches is that our algorithm can handle code size constraints along with latency and resource constraints. This capability enables the exploration of pareto &ldquo;optimal&rdquo; points with respect to code size and performance. RS-FDRA can also minimize the increase in &ldquo;register pressure&rdquo; typically incurred by software pipelining. This ability is critical since, the need to insert spill code may result in significant performance degradation. Extensive experimental results are presented demonstrating that the extended set of optimization goals and constraints supported by RS-FDRA enables a thorough compiler-assisted exploration of trade-offs among performance, code size, and register requirements, for time critical segments of embedded software components.
Virtual memory versus file interfaces for large, memory-intensive scientific applications
Authors: Yoonho Park, Ridgway Scott, Stuart Sechrest
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Scientific applications often require some strategy for temporary data storage to do the largest possible simulations. The use of virtual memory for temporary data storage has received criticism because of performance problems. However, modern virtual memory found in recent operating systems such as Cenju-3/DE give application writers control over virtual memory policies. We demonstrate that custom virtual memory policies can dramatically reduce virtual memory overhead and allow applications to run out-of-core efficiently. We also demonstrate that the main advantage of virtual memory, namely programming simplicity, is not lost.
Performance of a weakly consistent wireless web access mechanism
Authors: Ming Feng Chang, Yi-Bing Lin
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

In wireless web information access, long response may be experienced. To reduce the response times of wireless data access in a mobile network, caches are utilized in the wireless handheld devices or wireless proxy server. This paper proposes a wireless web data access algorithm for WAP (wireless application protocol) caching proxy to speed up data access. Our algorithm utilizes the access frequency to tune the data expiration time. The performance of the algorithm is investigated and is compared with existing TTL-based algorithms. Our study indicates that good performance is expected for the new algorithm.
On the effective use and reuse of HCI knowledge
Authors: Alistair Sutcliffe
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

The article argues that new approaches for delivering HCI knowledge from theory to designers will be necessary in the new millennium. First the role of theory in HCI design to date is reviewed, including the progress made in cognitive theories of interaction and their impact on the design pr ocess. The role of bridging models that build on models of interaction is described, but it is argued that direct application of cognitive theory to design is limited by scalability problems. The alternative of representing HCI knowledge as claims and the role of the task-artefact approach to theory-based design are introduced. Claims are proposed as a possible bridging representation that may enable theories to frame appropriate recommendations for designers and, vice versa, enable designers to ask appropriate questions for theoretical research. However, claims provide design advice grounded in specific scenarios and examples, which limits their generality. The prospects for reuse becoming an important mode of development and the possible directions in generalizing claims for reuse are discussed, including generalizing claims beyond their original context, providing a context for reuse of claims by linking them to generic task and domain models. It is argued that generic models provide a way forward for developing reusable libraries of interactive components. The approach is illustrated from a case study of extracting claims from one information ret rieval application, generalizing claims for future reuse in information-searching tasks, and reapplying claims in the Web-based Multimedia Broker application. The article concludes by proposing that HCI knowledge should be theory-grounded, and development of reusable &ldquo;designer-digestible&rdquo; packets will be an important contribution in the future.
Information transfer and area-time tradeoffs for VLSI multiplication
Authors: Harold Abelson, Peter Andreae
Venue: Communications of the ACM (1980)

The need to transfer information between processing elements can be a major factor in determining the performance of a VLSI circuit. We show that communication considerations alone dictate that any VLSI design for computing the 2n-bit product of two n-bit integers must satisfy the constraint AT2 &ge; n2/64 where A is the area of the chip and T is the time required to perform the computation. This same tradeoff applies to circuits which can shift n-bit words through n different positions.
Wirelength estimation based on rent exponents of partitioning and placement
Authors: Xiaojian Yang, Elaheh Bozorgzadeh, Majid Sarrafzadeh
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

Wirelength estimation is one of the most important Rent's rule applications. Traditional Rent exponent extraction is based on recursive bipartitioning. However, the obtained exponent may not be appropriate for wirelength estimation. In this paper, we propose the concepts of partitioning-based Rent exponent and placement-based Rent exponent. The relationship between them is analyzed and empirically verified. Experiments on large circuits show that for wirelength estimation, the Rent exponent extracted from placement is more reasonable than that from partitioning.