ppxscal/embedding_network huggingface dataset:
Basic Results in Automatic Transformations of Shared Memory Parallel Programs into Sequential Programs
Authors: Yosi Ben-Asher, Esti Stein
Venue: The Journal of Supercomputing (2000)

We study the problem of developing a set of syntax-driven transformations for automatic translation of shared memory parallel programs into sequential programs. The result is a sequential program that is semantically equivalent to the original program. Consequently, the problem of debugging parallel programs is reduced to the problem of debugging sequential programs. Moreover, the efficiency of parallel programs can be increased by sequentializing code segments that include extra parallelism.The main difficulty in developing such a system is to preserve the fairness property of any actual parallel execution, which states that no process can wait forever unserved. Thus, non termination of the sequential version (namely an infinite loop) is allowed only if there is at least one fair parallel execution that does not halt as well (i.e., a process that executes an infinite loop whose termination is not dependent on any other process).We show that it is sufficient to consider the case of two sequential programs executed in parallel in order to solve the general case. We then describe several types of transformations and check their ability to preserve fairness. The results, with regards to the existence of such a transformation for general parallel programs are not conclusive; however, we do show that restricted cases (which are likely to appear in the reality) can be sequentialized using this set of transformations.
A static estimation technique of power sensitivity in logic circuits
Authors: Taewhan Kim, Ki-Seok Chung, C. L. Liu
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

In this paper, we study a new problem of statically estimating the power sensitivity of a given logic circuit with respect to the primary inputs. The power sensitivity defines the characteristics of power dissipation due to changes in state of primary inputs. Consequently, estimating the power sensitivity among the inputs is essential not only to measure the power consumption of the circuit efficiently but also to provide potential opportunities of redesigning the circuit for low power. In this context, we propose a fast and reliable static estimation technique for power sensitivity based on a new concept calledpower equations, which are then collectively transformed into a table calledpower table. Experimental data on MCNC benchmark examples show that the proposed technique is useful and effective in estimating power consumption. In summary, the relative error for the estimation of maximum power consumption is 9.4\% with a huge speed-up in simulation.
Interacting multi-agent and simulation systems: an exploration into mole and james
Authors: Adelinde M. Uhrmacher, Bernd G. Kullick
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

To analyze multi-agent systems by simulation the question arises how agents shall be integrated into the simulation system. In \textsc{James}, a Java-Based Agent Modeling Environment for Simulation, we pursue an approach which supports flexible patterns of integration and interaction.
Java will be faster than C++
Authors: Kirk Reinholtz
Venue: ACM SIGPLAN Notices (2000)

This paper shows that it is possible for Java to have better general performance than C++, and that it is likely that this will actually occur. Java performance can exceed that of C++ because dynamic compilation gives the Java compiler access to runtime information not available to a C++ compiler. This will occur because the rapidly growing market for embedded systems will be driven to extend battery life. Since each CPU clock cycle consumes some energy, battery life is extended by improving performance, thus achieving more computation per clock cycle.
An efficient divide and conquer algorithm for exact hazard free logic minimization
Authors: J. W. J. M. Rutten, M. R. C. M. Berkelaar, C. A. J. van Eijk, M. A. J. Kolsteren
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill/Nowick, which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill/Nowick by avoiding a significant part of the search space. We argue that the proposed algorithm is a promising framework for the development of efficient heuristic algorithms.
Process migration
Authors: Dejan S. Milojičić, Fred Douglis, Yves Paindaveine, Richard Wheeler, Songnian Zhou
Venue: ACM Computing Surveys (CSUR) (2000)

Process migration is the act of transferring a process between two machines. It enables dynamic load distribution, fault resilience, eased system administration, and data access locality. Despite these goals and ongoing research efforts, migration has not achieved widespread use. With the increasing deployment of distributed systems in general, and distributed operating systems in particular, process migration is again receiving more attention in both research and product development. As high-performance facilities shift from supercomputers to networks of workstations, and with the ever-increasing role of the World Wide Web, we expect migration to play a more important role and eventually to be widely adopted.This survey reviews the field of process migration by summarizing the key concepts and giving an overview of the most important implementations. Design and implementation issues of process migration are analyzed in general, and then revisited for each of the case studies described: MOSIX, Sprite, Mach, and Load Sharing Facility. The benefits and drawbacks of process migration depend on the details of implementation and, therefore, this paper focuses on practical matters. This survey will help in understanding the potentials of process migration and why it has not caught on.
A network of cellular automata for a landslide simulation
Authors: Claudia R. Calidonna, Claudia Di Napoli, Maurizio Giordano, Mario Mango Furnari, Salvatore Di Gregorio
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Cellular Automata (CA) offer a promising computational model to simulate complex phenomena that are characterized by different coupled parameters that account for the interactions of their different components. In this paper we present the Cellular Automata Network (CAN) computational model and its application to the simulation of debris/flow phenomena. We carried out some experimentations developing a CAN application that implements the SCIDDICA model (Simulation through Computational Innovative methods for the Detection of Debris flow path using Interactive Cellular Automatamodel), tested on the landslide occurred in Sarno (Italy) in 1998. CAN model allows to represent each component of a physical system in terms of cellular automata, and the interactions among these components in terms of a network of cellular automata. The adoption of the CAN model allows to exploit two different types of parallelism: the data parallelism that comes from the use of Cellular Automata classical model, and the task parallelism that could occur introducing the network of Cellular Automata.
Solaris internals: core kernel architecture
Authors: Jim Mauro, Richard McDougall
Venue:  (2000)

The definitive Sun Microsystems guide to the internals of the Solaris kernel.This book focuses on the core kernel functions, major data structures and algorithms. Its practical approach makes it an essential resource for anyone responsible for kernel, driver or application software. Anyone doing development, debugging, maintenance, performance tuning, capacity planning, or application tuning will also benefit from Mauro and McDougall's in-depth coverage of the Solaris kernel.Solaris Internals is an indispensable reference for kernel developers and is full of useful information for monitoring and optimizing Solaris systems. Whether you're a software developer, systems architect, system administrator, or performance analyst you'll rely on it constantly.
Modeling the Effects of Combining Diverse Software Fault Detection Techniques
Authors: Bev Littlewood, Peter T. Popov, Lorenzo Strigini, Nick Shryane
Venue: IEEE Transactions on Software Engineering (2000)

The software engineering literature contains many studies of the efficacy of fault finding techniques. Few of these, however, consider what happens when several different techniques are used together. We show that the effectiveness of such multitechnique approaches depends upon quite subtle interplay between their individual efficacies and dependence between them. The modeling tool we use to study this problem is closely related to earlier work on software design diversity. The earliest of these results showed that, under quite plausible assumptions, it would be unreasonable even to expect software versions that were developed ¿truly independently¿ to fail independently of one another. The key idea here was a ¿difficulty function¿ over the input space. Later work extended these ideas to introduce a notion of ¿forced¿ diversity, in which it became possible to obtain system failure behavior better even than could be expected if the versions failed independently. In this paper, we show that many of these results for design diversity have counterparts in diverse fault detection in a single software version. We define measures of fault finding effectiveness and of diversity and show how these might be used to give guidance for the optimal application of different fault finding procedures to a particular program. We show that the effects upon reliability of repeated applications of a particular fault finding procedure are not statistically independent¿in fact, such an incorrect assumption of independence will always give results that are too optimistic. For diverse fault finding procedures, on the other hand, things are different: Here it is possible for effectiveness to be even greater than it would be under an assumption of statistical independence. We show that diversity of fault finding procedures is, in a precisely defined way, ¿a good thing¿ and should be applied as widely as possible. The new model and its results are illustrated using some data from an experimental investigation into diverse fault finding on a railway signalling application.
Jump searching: a fast sequential search technique
Authors: Ben Shneiderman
Venue: Communications of the ACM (1978)

When sequential file structures must be used and binary searching is not feasible, jump searching becomes an appealing alternative. This paper explores variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records. Multiple level and variable size jump strategies are explored, appropriate applications are discussed and performance is evaluated.
Cost effectiveness analysis of BMD referral for DXA using ultrasound as a selective pre-screen in a group of women with low trauma Colles' fractures
Authors: M. F. Victor Sim, Mike Stone, Antony Johansen, Wil Evans
Venue: Technology and Health Care (2000)

Measurements of bone density (BMD) are central to the World Health Organisation (WHO) approach to the definition of osteoporosis. Dual energy X- ray absorptiometry (DXA) remains the gold standard technique for measuring the bone mineral density (BMD) but Quantitative Ultrasound (QUS) is an attractive alternative method of bone assessment because it is easy to use and relatively inexpensive. It has been suggested that QUS could be used as a selective population pre-screen, to maximise the cost effectiveness of referral for DXA assessment of BMD. We set out to examine how such an approach might perform in the assessment of women with low trauma Colles' fracture. In 46 women aged 50--80 (mean 67) years we used DXA to measure BMD at lumbar spine and hip, and heel bone ultrasound to measure Broad Band Attenuation (BUA) and Velocity of Sound (VOS). We calculated local costs of \pounds 45 for DXA and \pounds 15 for QUS. We identified a BUA threshold of 60 dB/MHz as most cost effective as pre-screen, and calculated a sensitivity of 93% 84% having osteoporosis by DXA. DXA assessment of all patients had a cost of \pounds 77 per osteoporotic subject identified. We examined the cost-effectiveness of using QUS as a pre-screen, only referring subjects for more expensive DXA assessment if BUA was less than 60~dB/MHz. However this approach had no advantage, still costing \pounds 78 per osteoporotic subject identified. QUS assessment does not appear cost-effective as a pre-screen for DXA, even in this high risk group of women with low trauma Colles' fracture. A QUS pre-screen would only be cost-effective if the scan could be performed at a substantially lower cost.
On the nonexistence of a phrase structure grammar for ALGOL 60
Authors: Robert W. Floyd
Venue: Communications of the ACM (1962)

ALGOL 60 is defined partly by formal mechanisms of phrase structure grammar, partly by informally stated restrictions. It is shown that no formal mechanisms of the type used are sufficient to define ALGOL 60.
Implicit interest indicators
Authors: Mark Claypool, Phong Le, Makoto Wased, David Brown
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Recommender systems provide personalized suggestions about items that users will find interesting. Typically, recommender systems require a user interface that can ``intelligently'' determine the interest of a user and use this information to make suggestions. The common solution, ``explicit ratings'', where users tell the system what they think about a piece of information, is well-understood and fairly precise. However, having to stop to enter explicit ratings can alter normal patterns of browsing and reading. A more ``intelligent'' method is to useimplicit ratings, where a rating is obtained by a method other than obtaining it directly from the user. These implicit interest indicators have obvious advantages, including removing the cost of the user rating, and that every user interaction with the system can contribute to an implicit rating. Current recommender systems mostly do not use implicit ratings, nor is the ability of implicit ratings to predict actual user interest well-understood. This research studies the correlation between various implicit ratings and the explicit rating for a single Web page. A Web browser was developed to record the user's actions (implicit ratings) and the explicit rating of a page. Actions included mouse clicks, mouse movement, scrolling and elapsed time. This browser was used by over 80 people that browsed more than 2500 Web pages. Using the data collected by the browser, the individual implicit ratings and some combinations of implicit ratings were analyzed and compared with the explicit rating. We found that the time spent on a page, the amount of scrolling on a page and the combination of time and scrolling had a strong correlation with explicit interest, while individual scrolling methods and mouse-clicks were ineffective in predicting explicit interest.
Back to the future (panel session): Is worse (still) better?
Authors: Martine Devos, Richard P. Gabriel, James O. Coplien, T. J. D'Hondt, Jutta Eckstein, Brian Foote, Kevlin Henney, Alan O'Callaghan
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Functional programming, AI, patterns, OO, structured programming - they were promising, and yet they seem to have failed to deliver. Did we lose interest too soon? Is the best too good for our industry? Is there &ldquo;a&rdquo; best for our industry or is our endless search for the silver bullet driving us? Do we want the &ldquo;best&rdquo; to (again) be a popular goal? How?
Supporting Different Dimensions of Adaptabilityin Workflow Modeling
Authors: Monica Divitini, Carla Simone
Venue: Computer Supported Cooperative Work (2000)

This paper discusses the theme of workflow system adaptability in relation to process modeling. Starting from a discussion on the role of formal constructs in cooperation, the main claim is that adaptability involves different dimensions of process modeling. These dimensions concern the possibility to flexibly combine a rich set of basic categories in order to obtain the most suitable language for modeling the target business process and the work practices around it&semi; to take into account various levels of visibility of the contexts of definition and use of a process model&semi; and finally to allow for temporary as well as permanent modifications of the process itself. Ariadne, a notation conceived for the above purpose, is illustrated by means of a working example. Moreover, the paper presents the main design principles governing Ariadne's implementation.
On writing OpenMath content dictionaries
Authors: James H. Davenport
Venue: ACM SIGSAM Bulletin (2000)

This paper is based on various discussion with the OpenMath Consortium, and recently at the University of Western Ontario. All errors are the author's. Many helpful suggestions have been made, particularly by Dr. Dewar and Dr. Naylor.This paper outlines some of the issues that affect authors of OpenMath Content Dictionaries, and their associated Small Type System [4] files.
Simplified kinetic connectivity for rectangles and hypercubes
Authors: John Hershberger, Subhash Suri
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider the problem of maintaining connected components in a set of moving objects using the kinetic data structure (KDS) framework. We assume that the motion of each object can be specified by a low-degree algebraic trajectory; this trajectory, however, can be modified in an on-line fashion. While the objects move continuously, their connectivity changes at discrete times. A straightforward dynamic graph approach for maintaining connectivity of n objects has three shortcomings: the graph can have &OHgr;(n2) edges, the update bounds are amortized, and the algorithm is very complicated. Our first result shows that the connectivity for a set of n moving hypercubes can be maintained using a very simple, easy to determine graph with &Ogr;(n) edges. But this graph still requires a general-purpose dynamic graph scheme for connectivity maintenance. Our main result is a simplified connectivity data structure for moving rectangles in the plane. For this special but important case, we are able to overcome all three shortcomings mentioned above: our graph has &Ogr;(n) edges; our data structure supports updates in &Ogr;(log2 n) worst-case time; and the algorithm and data structures are quite a bit simpler than those based on a general dynamic graph scheme.
Some effects of the 6600 computer on language structures
Authors: R. W. Allard, K. A. Wolf, R. A. Zemlin
Venue: Communications of the ACM (1964)

The problem of compiling efficient 6600 codes prompted the development of an intermediate language reflecting the structure of the machine, that is more easily manipulated in improving object program efficiency. The subject of this paper is the intermediate language and methods of manipulating it. Compilations of a series of arithmetic statements are discussed. It is assumed that all functions and exponentials have been removed from these statements, and replaced by simple variables. For purposes of simplicity the treatment of subscripts is ignored. A simplified 6600 structure is presented to illustrate the compiling method. Several assumptions are made for purposes of simplification, although there are cases in which the assumptions are violated in the actual machine.
Orderly enumeration of nonsingular binary matrices applied to text encryption
Authors: W. H. Payne, K. L. McMillen
Venue: Communications of the ACM (1978)

Nonsingular binary matrices of order N, i.e., nonsingular over the field {0, 1}, and an initial segment of the natural numbers are placed in one-to-one correspondence. Each natural number corresponds to two intermediate vectors. These vectors are mapped into a nonsingular binary matrix. Examples of complete enumeration of all 2 &times; 2 and 3 &times; 3 nonsingular binary matrices were produced by mapping the intermediate vectors to the matrices. The mapping has application to the Vernam encipherment method using pseudorandom number sequences. A bit string formed from bytes of text of a data encryption key can be used as a representation of a natural number. This natural number is transformed to a nonsingular binary matrix. Key leverage is obtained by using the matrix as a &ldquo;seed&rdquo; in a shift register sequence pseudorandom number generator.
Area-efficient and reusable VLSI architecture of decision feedback equalizer for QAM modern
Authors: Hyeongseok Yu, Byung Wook Kim, Yeon Gon Cho Jun-Dong Cho Jea Woo Kim Hyun Cheol Park, Ki Won Lee
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, an area efficient VLSI architecture of decision feedback equalizer is derived accommodating 64/256 QAM modulators. This architecture is implemented efficiently in reusable VLSI structure using EDA tool due to its regular structure. The main idea is to employ a time-multiplexed design scheme grouping the adjacent filter taps with correlated internal dataflow and with data transfer having same processing sequence between blocks. We simulated the proposed design scheme using SYNOPSYSTM and SPWTM. Index Terms - Decision feedback equalizer, QAM, reusable VLSI implementation, FIR filter.
Chapters continue to grow
Authors: Scott Lang
Venue: ACM SIGGRAPH Computer Graphics (2000)

Scott Langs's spell as Director for Professional Chapters recently ended, but his legacy will live on in a strong organisation that is immensely popular, thanks in great part to the remarkable job Scott has been doing for the past five years. He has influenced not only the chapters, but also so many other aspects of SIGGRAPH life, and his leadership, generosity and commitment have served as tremendous examples to others involved in the organisation. I've benefited from his wisdom and help, and I wish him all the best in his future endeavours, and look forward to working with him again at some point in the future!Colleen Cleary will take on the responsibilities as Director for both the Professional and Student Chapters, and I know that she will do a tremendous job in not only continuing where Scott left off, but in making the position truly her own!Colleen suggested that it would be fitting to reprint Scott's farewell email in addition to the regular Chapters content, and I wholeheartedly agreed. You'll find this plus Colleen's reply, the annual Chapters report and most recent update below.
Semantics of programming languages: a tool-oriented approach
Authors: Jan Heering, Paul Klint
Venue: ACM SIGPLAN Notices (2000)

By paying more attention to semantics-based tool generation, programming language semantics can significantly increase its impact. Ultimately, this may lead to "Language Design Assistants" incorporating substantial amounts of semantic knowledge.
Evaluating Lipschitz Constants for Functions Given by Algorithms
Authors: João Batista Oliveira
Venue: Computational Optimization and Applications (2000)

This paper describes an efficient method (O(n)) to evaluate the Lipschitz constant for functions described in some algorithmic language. Considering arithmetical operations as the basis of the algorithmic language and supported by control structures, the rules to evaluate such Lipschitz constants are presented and their correctness is proved. An extension of the method to evaluate Lipschitz constants over interval domains is also presented. Examples are presented, but the effectiveness of the method is doubtful when compared to other approaches, and effective enhancements based on slope evaluations are also explored.