ppxscal/embedding_network huggingface dataset:
Parallel preconditioners for elliptic PDEs
Authors: Vivek Sarin, Ahmed Sameh
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Iterative schemes for solving sparse linear systems arising from elliptic PDEs are very suitable for efficient implementation on large scale multiprocessors. However, these methods rely heavily on effective preconditioners which must also be amenable to parallelization. In this paper, we present a novel method to obtain a preconditioned linear system which is solved using an iterative method. Each iteration comprises of a matrix-vector product with k sparse matrices (k
Agents teaching agents to share meaning
Authors: Andrew B. Williams, Zijian Ren
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The promise of intelligent agents acting on behalf of users' personalized knowledge sharing needs may be hampered by the insistence that these agents begin with a predefined, common ontology instead of personalized, diverse ontologies. Only until recently have researchers diverged from the last decades common &ldquo;ontology paradigm&rdquo; to a paradigm involving agents that can share knowledge using diverse ontologies. This paper describes how we address this agent knowledge sharing problem of how agents deal with diverse ontologies by introducing a methodology and algorithms for multi- agent knowledge sharing and learning. We demonstrate how this approach will enable multi- agent systems to assist groups of people in locating, translating, and sharing knowledge using our Distributed Ontology Gathering Group Integration Environment (DOGGIE) and describe our proof- of- concept experiments. DOGGIE synthesizes agent communication, machine learning, and reasoning for information sharing in the Web domain.
Performance monitoring in a time-sharing system
Authors: Tad B. Pinkerton
Venue: Communications of the ACM (1969)

A software measurement facility which is part of a general purpose time-sharing system is described. The Data Collection Facility (DCF) has been implemented in the Michigan Terminal System (MTS) for the System/360 model 67. It exists for the purpose of monitoring operating system and user program behavior and performance. The overall structure of MTS is outlined in order to explain the implementation of the DCF. Events in the system are identified and recorded from within the supervisor, and dumped to magnetic tape by an auxiliary program for off-line processing. Events in user programs which are unrelated to system actions are recorded with a supervisor call. The time of occurrence of each event is accurately recorded, and data items are further identified by job and type. The overhead associated with data collection and its interference with normal jobs is carefully analyzed, and both are shown to be minimal. Several examples are given of information obtained with the facility and of applications in which it has been useful. Some general guidelines are offered for the construction of future monitoring programs.
The simple ways we deal with complexity
Authors: Tim Budd
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

The CS 2 course is a turning point in the undergraduate CS curriculum. It is often the first point the student encounters formal analysis and techniques, proofs of correctness, abstract data types, and a host of other new ideas (as well as data structures!). But behind the myriad complexities are a few simple ideas. I believe far too few students see the simplicity, because they become too mired in the complexities. In this talk I will try to describe an overarching framework in which we can discuss the few simple ideas that are behind much of the content in the CS 2 course.
Automated test oracles for GUIs
Authors: Atif M. Memon, Martha E. Pollack, Mary Lou Soffa
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Graphical User Interfaces (GUIs) are critical components of today's software. Because GUIs have different characteristics than traditional software, conventional testing techniques do not apply to GUI software. In previous work, we presented an approach to generate GUI test cases, which take the form of sequences of actions. In this paper we develop a test oracle technique to determine if a GUI behaves as expected for a given test case. Our oracle uses a formal model of a GUI, expressed as sets of objects, object properties, and actions. Given the formal model and a test case, our oracle automatically derives the expected state for every action in the test case. We represent the actual state of an executing GUI in terms of objects and their properties derived from the GUI's execution. Using the actual state acquired from an execution monitor, our oracle automatically compares the expected and actual states after each action to verify the correctness of the GUI for the test case. We implemented the oracle as a component in our GUI testing system, called Planning Assisted Tester for grapHical user interface Systems (PATHS), which is based on AI planning. We experimentally evaluated the practicality and effectiveness of our oracle technique and report on the results of experiments to test and verify the behavior of our version of the Microsoft WordPad's GUI.
Exploring design space of parallel realizations: MPEG-2 decoder case study
Authors: Basant K. Dwivedi, Jan Hoogerbrugge, Paul Stravers, M. Balakrishnan
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

Many applications lend them to parallelism at different levels of granularity. We first identify the key issues involved in creating a parallel model of an application. These are done with a view to estimate performance and explore the &ldquo;parallel&rdquo; design space to select a suitable design point. The framework presented provides an opportunity to perform this exploration both in the target architecture independent and target architecture dependent manner. An MPEG-2 decoder model in YAPI has been presented which has more parallelism and improved performance. This modal has further been mapped onto SpaceCAKE architecture to study its architectural parameters. Detailed results obtained with YAPI simulation (target architecture independent) and TSS simulation (after process-processor binding) on MPEG-2 decoder application establish the effectiveness of our approach.
Windows CE 3.0: application programming
Authors: Nick Grattan, Marshall Brain
Venue: Microsoft Technologies Series (2001)

Windows CE 3.0 Application Programming presents programming for Pocket PC, handheld PC, and embedded devices.Topics include:Enterprise computing including COM, DCOM, database access using ADOCE, and Microsoft Message QueueCommunications, including Internet Web access with HTTP, TCP/IP, sockets, serial communications, and desktop synchronization with ActiveSync 3.0Build and run applications in Visual C++ using Microsoft Foundation ClassesCD-ROM with eMbedded Visual C++ 3.0 and Pocket PC SDKBeyond the user interface to hard-core programmingFull-scale networking and enterprise computingGlobal communications from Pocket PCsAll the new features of Windows CE 3.0Advanced techniques for serious Windows CE programmersWindows CE 3.0 Application Programming helps you get beyond user interface programming and discover the behind-the-scenes operating system facilities that will let you make the most of the new features in Windows CE 3.0. This hot technology lets you control Pocket PCs, handheld PCs, and the embedded devices in hundreds of commercial products. Learn the lean and mean techniques that keep your programs humming on portable devices with limited memory, and the key data storage methods that make them possible. Master the communications protocols that keep Windows CE devices in contact with desktop computers and the Internet.In addition:Build and run applications in Visual C++ 6.0 and eMbedded Visual C++ 3.0Use the Windows CE API and Microsoft Foundation ClassesCommunicate via HTTP, TCP/IP, sockets, remote access, and telephonyAccess standard Windows CE databases and Microsoft SQL Server for Windows CEInterface between desktop systems and Windows CE devicesWindows CE 3.0 Application Programming is for serious developers with real programming experience. Besides familiarity with Windows CE devices and general Windows API programming, a basic knowledge of C and C++ is needed to understand the code samples.The accompanying CD-ROM contains all the code examples from the book, as well as a fully searchable index of all the book's examples, programs, and tutorials. The CD-ROM also contains a complete working copy of eMbedded Visual C++ 3.0 and Pocket PC SDK.
ooSEM (poster session): a process model for object-oriented development in an industrial environment
Authors: Hermann Kaindl, Stefan Huber, Ömer Karacan, Ilir Kondo, Herwig Schreiner, Helge-Wernhard Süß
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Applying current object-oriented (OO) methods in an industrial environment is by itself not sufficient for a certification according to the norm EN ISO 9001, which requires the application of a comprehensive process model that includes, among other things, quality assurance. We present ooSEM in this poster, a process model for supporting OO development in an industrial environment based on a meta process model that is consistent with this norm. ooSEM is not a usual OO method but deals primarily with complementary aspects like project management and control, comprehensive documentation, quality assurance and configuration management, as required by EN ISO 9001. So, ooSEM is also flexible with respect to existing OO notations and methods. Specifically for OO modeling, ooSEM provides a clean solution to the problem of the transition from OO analysis to design, which is also the topic of a panel at OOPSLA 2000. ooSEM is available to the software developers in our environment through the company's intranet in the form of a Web application.
An interative factorization techniques for polynomials
Authors: H. A. Luther
Venue: Communications of the ACM (1963)

An iterative technique is displayed whereby factors of arbitrary degree can be found for polynomials in one variable. Convergence is shown to occur always if a certain Jacobian does not vanish and if the initial approximation to a factor is near enough to an actual factor. The process is simply programmed, and preliminary results indicate it to be well adapted to use with digital computers. For factors of degree two, the technique is similar to that of Bairstow, the present method being somewhat simpler.
Implementing phrase-structure productions in PL/I
Authors: Larry Irwin
Venue: Communications of the ACM (1967)

A method is described for implementing the productions of a context-free phrase structure grammar in a PL/I procedure whose structure and statements parallel the structure and notation of the grammar.
Algorithm 425: generation of random correlated normal variables [G5]
Authors: Rex L. Hurst, Robert E. Knop
Venue: Communications of the ACM (1972)

We have programmed and made timing comparisons for two algorithms which sample the multivariate normal density N(&mgr;, V) = |V-1|/(2&pgr;)n/2&middot;exp(- 1/2(Y - &mgr;)T V-1(Y - &mgr;)) (1) where V is an n X n covariance matrix, &mgr; is an n component vector of means, and Y is an n component random vector [1].
Learning to Play Chess Using Temporal Differences
Authors: Jonathan Baxter, Andrew Tridgell, Lex Weaver
Venue: Machine Learning (2000)

In this paper we present TDLEAF(&lambda;), a variation on the TD(&lambda;) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our chess program &ldquo;KnightCap&rdquo; used TDLEAF(&lambda;) to learn its evaluation function while playing on Internet chess servers. The main success we report is that KnightCap improved from a 1650 rating to a 2150 rating in just 308 games and 3 days of play. As a reference, a rating of 1650 corresponds to about level B human play (on a scale from E (1000) to A (1800)), while 2150 is human master level. We discuss some of the reasons for this success, principle among them being the use of on-line, rather than self-play. We also investigate whether TDLEAF(&lambda;) can yield better results in the domain of backgammon, where TD(&lambda;) has previously yielded striking success.
Challenges and approaches in providing QoS monitoring
Authors: Yuming Jiang, Chen-Khong Tham, Chi-Chung Ko
Venue: International Journal of Network Management (2000)

This paper presents a brief survey of current QoS monitoring-related mechanisms, followed by a discussion of the challenges involved in providing QoS distribution monitoring. Several approaches are then proposed to meet these challenges. Finally, the issues that remain open are discussed. Copyright &copy; 2000 John Wiley Sons, Ltd.
The effect of seance communication on multiprocessing systems
Authors: Avi Mendelson, Freddy Gabbay
Venue: ACM Transactions on Computer Systems (TOCS) (2001)

This paper introduces the seance communication phenomenon and analyzes its effect on a multiprocessing environment. Seance communication is an unnecessary coherency-related activity that is associated with dead cache information. Dead information may reside in the cache for various reasons: task migration, context switches, or working-set changes. Dead information does not have a significant performance impact on a single-processor system; however, it can dominate the performance of multicache environment. In order to evaluate the overhead of seance communication, we develop an analytical model that is based on the fractal behavior of the memory references. So far, all previous works that used the same modeling approach extracted the fractal parameters of a program manually. This paper provides an additional important contribution by demonstrating how these parameters can be automatically extracted from the program trace. Our analysis indicates that Seance communication may severely reduce the overall system performance when using write-update or write-invalidate cache coherency protocols. In addition, we find that the performance of write-update protocols is affected more severely than write-invalidate protocols. The results that are provided by our model are important for better understanding of the coherency-related overhead in multicache systems and for better development of parallel applications and operating systems.
Algorithm 424: Clenshaw-Curtis quadrature [D1]
Authors: W. Morven Gentleman
Venue: Communications of the ACM (1972)

Clenshaw-Curtis quadrature is one of the most effective automatic quadrature schemes available, particularly for integrands with some continuous derivatives. It can also be used for any piecewise continuous integrand, although it is not recommended for integrands with discontinuities.
2D and 3D dose distribution determination in proton beam radiotherapy with GafChromic film detectors
Authors: S. O. Troja, E. Egger, P. Francescon, A. M. Gueli, A. Kacperek, M. Coco, R. Musmeci, A. Pedalino
Venue: Technology and Health Care (2000)

This paper presents the results obtained using radiochromic (MD-55 GafChromic^{\rm TM}$) film for the 2D and 3D dosimetric reconstruction of the dose delivered by a proton beam under the real conditions of a programme of radiotherapy treatment for ocular tumours. Standard microdensitometric measurements were used to determine the variation in film optical density (O.D.) vs dose. Calibration curves were obtained by least-square fitting of the experimental OD values using a second order polynomial. This allows conversion of O.D. to dose. With this procedure it was possible to determine the distribution of the dose delivered by the proton beam in a phantom composed of layers of GafChromic^{\rm TM} film, with high surface spatial resolution and, through sections, the complete mapping of the dose delivered to a volume subjected to irradiation, as in a course of radiotherapy treatment.
Gated clock routing minimizing the switched capacitance
Authors: J. Oh, M. Pedram
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a zero-skew gated clock routing technique for VLSI circuits. The gated clock tree has masking gates at the internal nodes of the clock tree, which are selectively turned on and off by the gate control signals during the active and idle times of the circuit modules to reduce switched capacitance of the clock tree. This work extends the work of [4] so as to account for the switched capacitance and the area of the gate control signal routing. Various tradeoffs between power and area for different design options and module activities are discussed and detailed experimental results are presented.
A Practical Method for Specification and Analysis of Exception Handling-A Java/JVM Case Study
Authors: Egon Börger, Wolfram Schulte
Venue: IEEE Transactions on Software Engineering (2000)

In this paper, we provide a rigorous framework for language and platform independent design and analysis of exception handling mechanisms in modern programming languages and their implementations. To illustrate the practicality of the method we develop it for the exception handling mechanism of Java and show that its implementation on the Java Virtual Machine (JVM) is correct.For this purpose we define precise abstract models for exception handling in Java and in the JVM and define a compilation scheme of Java to JVM code which allows us to prove that, in corresponding runs, Java and the JVM throw the same exceptions and with equivalent effect. Thus, the compilation scheme can, with reasonable confidence, be used as a standard reference for Java exception handling compilation.
Algorithm 428: Hu-Tucker minimum redundancy alphabetic coding method [Z]
Authors: J. M. Yohe
Venue: Communications of the ACM (1972)

This algorithm implements the Hu-Tucker method of variable length, minimum redundancy alphabetic binary encoding [1]. The symbols of the alphabet are considered to be an ordered forest of n terminal nodes. Two nodes in an ordered forest are said to be tentative-connecting if the sequence of nodes between the two given nodes is either empty or consists entirely of nonterminal nodes.
Ada exception handling: an axiomatic approach
Authors: David C. Luckham, W. Polak
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

A method of documenting exception propagation and handling in Ada programs is proposed. Exception propagation declarations are introduced as a new component of Ada specifications, permitting documentation of those exceptions that can be propagated by a subprogram. Exception handlers are documented by entry assertions. Axioms and proof rules for Ada exceptions given. These rules are simple extensions of previous rules for Pascal and define an axiomatic semantics of Ada exceptions. As a result, Ada programs specified according to the method can be analyzed by formal proof techniques for consistency with their specifications, even if they employ exception propagation and handling to achieve required results (i.e., nonerror situations). Example verifications are given.
PSCP: a scalable parallel ASIP architecture for reactive systems
Authors: A. Pyttel, A. Sedlmeier, C. Veith
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We describe a Codesign approach based on a parallel and scalable ASIP architecture, which is suitable for the implementation of reactive systems. The specification language of our approach is extended statecharts. Our ASIP architecture is scalable with respect to the number of processing elements as well as parameters such as bus widths and register file sizes. Instruction sets are generated from a library of components covering a spectrum of space/time trade-off alternatives. Our approach features a heuristic static timing analysis step for statecharts. An industrial example requiring the real-time control of several stepper motors illustrates the benefits of our approach.
Separating Inventory Flows in the Materials Management Department of Hancock Medical Center
Authors: Vaidyanathan Jayaraman, Cindy Burnett, Derek Frank
Venue: Interfaces (2000)

The materials management department of Hancock Medical Center was responsible for distribution of medical supplies to four major segments of the medical center, tracking inventory of items, accepting vendor delivery of items, and providing daily mail service for the entire medical center. The department was fraught with problems--deliveries were not made to schedule, departmental staffs were unable to keep accurate information on inventory, and the role of staff was not clearly defined. We made some recommendations that helped the department in streamlining their operations. The recommendations also helped to improve the overall logistics system and were useful for strategic planning and refinement of the materials management department of the Hancock Medical Center.
Improved alternative wiring scheme applying dominator relationship
Authors: Chin-Ngai Sze, Yu-Liang Wu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we present a competent algorithm to the alternative wiring problem by exploring the relationship between dominators of a target wire. Alternative wiring refers to the process of adding a redundant connection to a circuit such that a target connection will become redundant and can be removed from the circuit. The well-known ATPG-based alternative wiring scheme. Redundancy Addition and Removal for Multi-level Boolean Optimization (RAMBO), has shown its effectiveness in solving the problem in the last decade. The deficiency of RAMBO lies in its long execution time for redundancy identification among a large set of candidate alternative wires in the circuit. Implication-tree Based Alternative Wiring Logic Transformation Algorithm (IBAW) improves the speed of RAMBO by introducing an implication-tree structure for source node identification. Our approach of investigating the dominator relationship suggest that a large subset of unnecessary redundancy checks can be further avoided in order to improve the efficiency. Experiments were performed on MCNC benchmark circuits and results are compared to those of RAMBO and IBAW. Results show that our proposed algorithm improves IBAW with a 2.3 times speedup. Moreover, our implementation runs 8.8 times faster than RAMBO while solution quality is still maintained.
Changes in government procurement policies
Authors: James P. Titus
Venue: Communications of the ACM (1967)

Several years ago there was an attempt in Washington to place the selection of government computers in a central, highly placed office. Individual government agencies, led by the Department of Defense, successfully beat back this attempt. Today, two years later, it looks as though other forms of centralization are being worked into the government fabric at lower levels, one in the Department of Defense, another in the General Services Administration.
A virtual 3-D multipole accelerated extractor for VLSI parasitic interconnect capacitance
Authors: Zhaozhi Yang, Zeyi Wang, Shuzhou Fang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A virtual 3-D extractor of the single dielectric is presented in this paper. In the indirect boundary integral equations, the plane charge distribution on the surface of conductors is replaced with mesh charge distribution, and we use the multipole-accelerated algorithm to further depress the computational complexity. Numerical results show that its computational complexity is about O(n), where n is the number of the discrete variables. Within the comparable accuracy, it runs several times faster than the Fastcap, which is a very advanced multipole-accelerated parasitic capacitance extractor now.
Small Blocking Sets in PG(2, p^3)
Authors: Olga Polverino
Venue: Designs, Codes and Cryptography (2000)

In this paper we show that a small minimal blocking set in PG(2,p^ 3), with p\geq 7, is of R&eacute;dei type.