ppxscal/embedding_network huggingface dataset:
Hierarchical Ring Network Configuration and Performance Modeling
Authors: V. Carl Hamacher, Hong Jiang
Venue: IEEE Transactions on Computers (2001)

Approximate analytical queuing network models for expected message packet delay in 2-level and 3-level hierarchical ring interconnection networks (INs) are developed. A major class of traffic carried by these INs consists of cache line transfers between processor caches and remote memory modules in shared-memory multiprocessors. Such traffic consists of short, fixed-length messages; they can be conveniently transported by the slotted-ring transmission technique which is studied here. The packet delay results derived from the models are shown to be quite accurate when checked against a simulation study. As well as facilitating analysis, the analytical models can be used to determine optimal sizes for the rings at different levels in the hierarchy, where optimality is in terms of minimizing average packet delay.
W4: Real-Time Surveillance of People and Their Activities
Authors: Ismail Haritaoglu, Davis Harwood, Larry S. David
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

$W^4$ is a real time visual surveillance system for detecting and tracking multiple people and monitoring their activities in an outdoor environment. It operates on monocular gray-scale video imagery, or on video imagery from an infrared camera. $W^4$ employs a combination of shape analysis and tracking to locate people and their parts (head, hands, feet, torso) and to create models of people's appearance so that they can be tracked through interactions such as occlusions. It can determine whether a foreground region contains multiple people and can segment the region into its constituent people and track them. $W^4$ can also determine whether people are carrying objects, and can segment objects from their silhouettes, and construct appearance models for them so they can be identified in subsequent frames. $W^4$ can recognize events between people and objects, such as depositing an object, exchanging bags, or removing an object. It runs at 25 Hz for 320$\times$240 resolution images on a 400 Mhz dual-Pentium II PC.
Dhrystone: a synthetic systems programming benchmark
Authors: Reinhold P. Weicker
Venue: Communications of the ACM (1984)

Reflecting current data on the use of programming language constructs in systems programming, a synthetic benchmark is constructed based on the distribution appearing in the data. The benchmark executes 100 Ada statements that are balanced in terms of the distribution of statement types, data types, and data locality. Pascal and C versions of the benchmark are discussed.
Meeting the IT-skill shortage in Europe head-on: approaching in unison from practice and academia
Authors: Carl Erik Moe, Maung Kyaw Sein
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The IT Personnel crisis is global afflicting many areas, including the US, Australia and Europe. In this paper, we report and evaluate on-going approaches in Europe from both practice and academia. We focus especially on the CEPIS projects that aim at addressing the IT skills shortage. We then examine how research projects based on theoretical and conceptual premises in Norway can enhance these practical approaches. We propose ways of integrating the two approaches, and incorporate human resource processes to successfully meet the IT needs of organisations.
Coping with errors: the importance of process data in robust sociotechnical systems
Authors: Michael B. Twidale, Paul F. Marty
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

This paper presents an analysis of written and electronic records that document the collaborative process of packing museum artifacts in preparation for a move. The majority of data recorded detailed the process of packing, while only a small amount of the data concerned which artifacts were packed in which boxes. Museum staff members were able to use these process data to solve the numerous errors that occurred during packing. We explore the design implications for collaborative systems which focus on supporting error recovery rather than error prevention.
Accessible accessibility
Authors: David Sloan, Peter Gregor, Murray Rowan, Paul Booth
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

This paper discusses the need for an all-encompassing methodology for determining the level of accessibility of web resources, and the requirement that the results of such a procedure are as meaningful as possible to developers. It is argued that current accessibility evaluation methods are unsatisfactory in the scope and presentation of their results. An alternative meta-method of accessibility assessment is then described.
Optimal Left-to-Right Binary Signed-Digit Recoding
Authors: Marc Joye, Sung-Ming Yen
Venue: IEEE Transactions on Computers (2000)

This paper describes new methods for producing optimal binary signed-digit representations. This can be useful in the fast computation of exponentiations. Contrary to existing algorithms, the digits are scanned from left to right (i.e., from the most significant position to the least significant position). This may lead to better performances in both hardware and software.
Model and techniques to specify, develop and use a framework: a meta modeling approach
Authors: Pascal Rapicault
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Object-oriented frameworks are very popular for the efficiency they provide in reusing software. However, their use by instantiation, their enrichment by composition, and their extension by specialization, are all complicated operations requiring to be simplified by the introduction of new techniques and models.
Web Servers and Dynamic Content
Authors: Dan Teodor
Venue: Linux Journal (2001)

Using legacy languages like C and Fortran can aid computationally complex web applications.
Distance, dependencies, and delay in a global collaboration
Authors: James D. Herbsleb, Audris Mockus, Thomas A. Finholt, Rebecca E. Grinter
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Collaborations over distance must contend with the loss of the rich, subtle interactions that co-located teams use to coordinate their work. Previous research has suggested that one consequence of this loss is that cross-site work will take longer than comparable single-site work. We use both survey data and data from the change management system to measure the extent of delay in a multi-site software development organization. We also measure site interdependence, differences in same-site and cross-site communication patterns, and analyze the relationship of these variables to delay. Our results show a significant relationship between delay in cross-site work and the degree to which remote colleagues are perceived to help out when workloads are heavy. This result is particularly troubling in light of the finding that workers generally believed they were as helpful to their remote colleagues as to their local colleagues. We discuss implications of our findings for collaboration technology for distributed organizations.
Proving termination with multiset orderings
Authors: Nachum Dershowitz, Zohar Manna
Venue: Communications of the ACM (1979)

A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a termination function that maps the values of the program variables into some well-founded set, such that the value of the termination function is repeatedly reduced throughout the computation. All too often, the termination functions required are difficult to find and are of a complexity out of proportion to the program under consideration. Multisets (bags) over a given well-founded set S are sets that admit multiple occurrences of elements taken from S. The given ordering on S induces an ordering on the finite multisets over S. This multiset ordering is shown to be well-founded. The multiset ordering enables the use of relatively simple and intuitive termination functions in otherwise difficult termination proofs. In particular, the multiset ordering is used to prove the termination of production systems, programs defined in terms of sets of rewriting rules.
Accuracy of Decoupled Implicit Integration Formulas
Authors: Stig Skelboe
Venue: SIAM Journal on Scientific Computing (1999)

Dynamical systems can often be decomposed into loosely coupled subsystems. The system of ordinary differential equations (ODEs) modelling such a problem can then be partitioned corresponding to the subsystems, and the loose couplings can be exploited by special integration methods to solve the problem using a parallel computer or just solve the problem more efficiently than by standard methods.This paper presents accuracy analysis of methods for the numerical integration of stiff partitioned systems of ODEs. The discretization formulas are based on the implicit Euler formula and the second order implicit backward differentiation formula (BDF2). Each subsystem of the partitioned problem is discretized independently, and the couplings to the other subsystems are based on solution values from previous time steps. Applied this way, the discretization formulas are called decoupled.The stability properties of the decoupled implicit Euler formula are well understood. This paper presents error bounds and asymptotic error expansions to be used in controlling step size, relaxation between subsystems and the validity of the partitioning. The decoupled BDF2 formula is analyzed within the same framework.Finally, the analysis is used in the design of a decoupled numerical integration algorithm with variable step size to control the local error and adaptive selection of partitionings. Two versions of the algorithm with decoupled implicit Euler and BDF2, respectively, are used in examples where a realistic problem is solved. The examples compare the results from the decoupled implicit Euler and BDF2 formulas, and compare them with results from the corresponding classical formulas.
Convergence of the Nonmonotone Perry and Shanno Method for Optimization
Authors: Guanghui Liu, Lili Jing
Venue: Computational Optimization and Applications (2000)

In this paper a new nonmonotone conjugate gradient method is introduced, which can be regarded as a generalization of the Perry and Shanno memoryless quasi-Newton method. For convex objective functions, the proposed nonmonotone conjugate gradient method is proved to be globally convergent. Its global convergence for non-convex objective functions has also been studied. Numerical experiments indicate that it is able to efficiently solve large scale optmization problems.
On the predictability of Java byte codes (abstract) (poster session)
Authors: Karel Driesen, Patrick Lam, Jerome Miecznikowski, Feng Qian, Derek Rayside
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Java byte codes are platform-independent. That means that any characterization of Java applications at the byte code execution level will reveal characteristics that any Java Virtual Machine will have to deal with, no matter whether this JVM is a Just-In-Time native code optimizing compiler running on a state-of-the-art high-performance workstation, or a byte code interpreter running in a watch. We believe that predictability profiles are particularly well-suited to capture and visualize program behavior, at a variable level of detail, as required by a systems architect interested in control flow, data flow, or automatic memory managment. We present predictability profiles for 6 SPECJVM98 programs, for three byte code sub traces. Subtrace: Invoke (polymorphic call target prediction) Load (load effective address prediction) New (new effective type prediction) For example, for Invoke byte codes, we measured the prediction rate achieved by invoke target predictors within every 20000 bytecodes of the first 2 million bytecodes executed using an unlimited, fully accurate BTB, and of Two-level predictors of path lengths 1,2,4,8, and 16. Prediction profiles for all these predictors are generally close together, but usually a BTB performs best in variable program phases.
On computer-assisted classification of coupled integrable equations
Authors: Mikhail V. Foursov, Marc Moreno Maza
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We show how the triangularization method of the second author can be successfully applied to the problem of classification of homogeneous coupled integrable equations. The classifications rely on the recent algorithm developed by the first author that requires solving 17 systems of polynomial equations. We show that these systems can be completely resolved in the case of coupled Korteweg-de Vries, Sawada-Kotera and Kaup-Kupershmidt&mdash;type equations.
Marginal Maximum Entropy Partitioning Yields Asymptotically Consistent Probability Density Functions
Authors: Tom Chau
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

The marginal maximum entropy criterion has been used to guide recursive partitioning of a continuous sample space. Although the criterion has been successfully applied in pattern discovery applications, its theoretical justification has not been clearly addressed. In this paper, it is shown that the basic marginal maximum entropy partitioning algorithm yields asymptotically consistent density estimates. This result supports the use of the marginal maximum entropy criterion in pattern discovery and implies that an optimal classifier can be constructed.
Comment on the conversion of decision tables to computer programs
Authors: Solomon L. Pollack
Venue: Communications of the ACM (1971)

In their article [2] C. R. Muthukrishnan and V. Rajaraman have developed two excellent algorithms for conversion of limited entry and mixed entry decision tables to computer programs. I must, however, take issue with their contention that &ldquo;&hellip;in general, the conditions may be very complicated and a compile time analysis will not be possible.&rdquo; They then cite the following example in Figure 1(b).
A minimum cost path search algorithm through tile obstacles
Authors: Zhaoyun Xing, Russell Kao
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

In this paper, based on tile connection graph, we propose an efficient minimum cost path search algorithm through tile obstacles. This search algorithm is faster than previous graph based algorithm and unlike previous tile based algorithms, this algorithm finds the minimum cost path.
A Hierarchy of Models for Type-II Superconductors
Authors: S. J. Chapman
Venue: SIAM Review (2000)

A hierarchy of models for type-II superconductors is presented. Through appropriate asymptotic limits we pass from the mesoscopic Ginzburg--Landau model to the London model with isolated superconducting vortices as line singularities, to vortex-density models, and finally to macroscopic critical-state models.
Pracniques: Meansort
Authors: Dalia Motzkin
Venue: Communications of the ACM (1983)

This paper presents an efficient algorithm based on Quicksort. The Quicksort algorithm is known to be one of the most efficient sorting techniques; however, one of the drawbacks of this method is its worst case situation of 0 (n2) comparisons. The algorithm presented here improves the average behavior of Quicksort and reduces the occurrence of worst case situations. 3~
The Graph of Linear Extensions Revisited
Authors: Michael Naatz
Venue: SIAM Journal on Discrete Mathematics (2000)

The graph of linear extensions G(P) of a poset P has as vertices the linear extensions of P, and two vertices are adjacent if they differ only by an adjacent transposition. This graph has so far been investigated mainly with respect to Hamilton paths and intrinsic geodesic convexity. The work on the latter topic especially shows how the graph-theoretic properties of G(P) reflect the order-theoretic structure of P.The aim of this paper is to study the graph G(P) with respect to topics from classical graph theory, e.g., connectivity, cycle space, isometric embeddings, and to find order-theoretic interpretations of these notions. The main theorems in this paper are the equality of the connectivity of G(P) and the jump number of P, the existence of a certain generating system for the cycle space, and a relationship of P and its subposets obtained via an embedding of the graph of linear extensions.
An improved program-synthesizing algorithm and its correctness
Authors: R. C. T. Lee, R. J. Waldinger, C. L. Chang
Venue: Communications of the ACM (1974)

An improved program-synthesizing algorithm based on the algorithm proposed by Waldinger and Lee in 1969 is given. In the old algorithm, the program-synthesizing problem is translated into a theorem-proving problem, and a program is obtained by analyzing a proof. For the improved algorithm, the analysis is not necessary, and a program is obtained as soon as the proof is completed. This is achieved by using a modified variable tracing mechanism invented by Green in 1969. The correctness of the improved algorithm is also proved; i.e. the program thus obtained always satisfies the specification.
A high security log-in procedure
Authors: George B. Purdy
Venue: Communications of the ACM (1974)

The protection of time sharing systems from unauthorized users is often achieved by the use of passwords. By using one-way ciphers to code the passwords, the risks involved with storing the passwords in the computer can be avoided. We discuss the selection of a suitable one-way cipher and suggest that for this purpose polynomials over a prime modulus are superior to one-way ciphers derived from Shannon codes.
New March Tests for Multiport RAM Devices
Authors: Kanad Chakraborty, Pinaki Mazumder
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper describes three new march tests for multiport memories. A read (or write) port in such a memory consists of an n-bit address register, an n-to-2^n-bit decoder (with column multiplexers for the column addresses) and drivers, and a K-bit data register. This approach gives comprehensive fault coverage for both array and multiport decoder coupling faults. It lends itself to a useful BIST implementation with a modest area overhead that tests these faults and achieves low test application time.
Scalable multi-agent systems
Authors: Ralph Deters
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

The multi-agent research community is currently faced with a paradox. While promoting the use of agents as the silver bullet for various software engineering problems, it faces difficulties in presenting successful deployments. Despite the countless multi-agent prototypes that have been developed, the number of actually deployed and in use MAS is at best very small [1]. One reason for the noticeable absence of deployed multi-agent systems is their inability to scale. This paper reports about the use of a CORBA/Java middle-ware layer called DICE, which enables transparent access to the resources of different physical machines. Using this layer it becomes possible to build large multi-agent systems that require large numbers of concurrent threads and significant memory resources. Using DICE it becomes possible to build large agent societies consisting of complex agents defined in JESS.
Syntactic type abstraction
Authors: Dan Grossman
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

Software developers often structure programs in such a way that different pieces of code constitute distinct principals. Types help define the protocol by which these principals interact. In particular, abstract types allow a principal to make strong assumptions about how well-typed clients use the facilities that it provides. We show how the notions of principals and type abstraction can be formalized within a language. Different principals can know the implementation of different abstract types. We use additional syntax to track the flow of values with abstract types during the evaluation of a program and demonstrate how this framework supports syntactic proofs (in the sytle of subject reduction) for type-abstraction properties. Such properties have traditionally required semantic arguments; using syntax aboids the need to build a model and recursive typesfor the language. We present various typed lambda calculi with principals, including versions that have mutable state and recursive types.
Optimal distributed location management in mobile networks
Authors: Govind Krishnamurthi, Murat Azizo&gtilde;lu, Arun K. Somani
Venue: Mobile Networks and Applications (2001)

An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. In this paper, we consider a distributed database architecture for location management in which update and query loads of the individual databases are balanced. WE obtain lower bounds to the worst-case delay in locating a mobile user, to the average delay, and to the call blocking probability. We then propose a dynamic location management algorithm that meets these lower bounds. The optimality of this algorithm with respect to these three perofrmance measures, as well as simplicity, make it an appealing candidate for distributed location management in PCS networks.
The Satchel system architecture: mobile access to documents and services
Authors: Mike Flynn, David Pendlebury, Chris Jones, Marge Eldridge, Mik Lamming
Venue: Mobile Networks and Applications (2000)

Mobile professionals require access to documents and document&dash;related services, such as printing, wherever they may be. They may also wish to give documents to colleagues electronically, as easily as with paper, face&dash;to&dash;face, and with similar security characteristics. The Satchel system provides such capabilities in the form of a mobile browser, implemented on a device that professional people would be likely to carry anyway, such as a pager or mobile phone. Printing may be performed on any Satchel&dash;enabled printer, or any fax machine. Scanning, too, may be accomplished at any Satchel&dash;enabled scanner. Access rights to individual documents may be safely distributed, without regard to document formats. Access to document services is greatly simplified by the use of context sensitivity. The system has been extensively tested and evaluated. This paper describes the architecture of the Satchel system.
Moviemaking on a Linux Box? No Way!
Authors: Adam Williams
Venue: Linux Journal (2001)

Broadcast 2000 aims to bring together the art of making movies and the power of the Linux platform.
The production of better mathematical software
Authors: Lloyd D. Fosdick
Venue: Communications of the ACM (1972)

Some observations are made on steps to be taken toward the creation of better mathematical software. These steps suggest the need for a coordinated effort and the creation of a center to focus activities in this area.