ppxscal/embedding_network huggingface dataset:
A Logical Design Tool for Relational Databases
Authors: M. Mehdi Owrang O., W. Gamini Gunaratna
Venue: IEEE Micro (1989)

A method is presented to prevent anomalies from affecting the design of a relational database. The approach, called the logical design tool (LDT), can also be used as an educational tool for the relational database. It allows certain problems that arise when the data is manipulated to be detected during design. An overview of LDT is followed by a discussion of its functions and its application.
Salphasic Distribution of Clock Signals for Synchronous Systems
Authors: V. L. Chi
Venue: IEEE Transactions on Computers (1994)

The design of a synchronous system having a global clock must account for propagation-delay-induced phase shifts experienced by the clock signal (clock skew) in its distribution network. As clock speeds and system diameters increase, this requirement becomes increasingly constraining on system designs. The paper describes a method that exploits properties of standing waves to reduce substantially clock skews due to unequal path lengths, for distribution network diameters up to several meters. The basic principles are developed for a loaded transmission line, and then applied to an arbitrary branching tree of such lines to implement a clock distribution network. The extension of this method to two- and three-dimensional distribution media is also presented, suggesting the feasibility of implementing printed circuit board clock planes exhibiting negligible phase shift over their extents.
Parallel Implementation of the Extended Square-Root Covariance Filter for Tracking Applications
Authors: E. K. B. Lee, S. Haykin
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Parallel implementations of the extended square-root covariance filter (ESRCF) for tracking applications are developed. The decoupling technique and special properties used in the tracking Kalman filter (KF) are employed to reduce computational requirements and to increase parallelism. The application of the decoupling technique to the ESRCF results in the time and measurement updates of m decoupled (n/m)-dimensional matrices instead of one coupled n-dimensional matrix, where m denotes the tracking dimension and n denotes the number of state elements. The updates of m decoupled matrices are found to require approximately m fewer processing elements and clock cycles than the updates of one coupled matrix. The transformation of the Kalman gain which accounts for the decoupling is found to be straightforward to implement. The sparse nature of the measurement matrix and the sparse, band nature of the transition matrix are explored to simplify matrix multiplications.
A parallel Lauritzen-Spiegelhalter algorithm for probabilistic inference
Authors: Alexander V. Kozlov, Jaswinder Pal Singh
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Probabilistic inference in belief networks is a promising technique for diagnosis, forecasting and decision analysis tasks. Unfortunately, exact inference can be very expensive computationally. In this paper, we examine whether probabilistic inference can be sped up effectively through parallel computation on real multiprocessors. Our experiments are performed on a 32-processor Stanford DASH multiprocessor, a cache-coherent shared-address-space machine with physically distributed main memory. We find that the major part of the calculation can be moved outside the actual propagation through the network, and yields good speedups. Speedups for the propagation itself depend on the structure of the network and the size of the cliques that the algorithm creates. We demonstrate good speedup on a CPCS subnetwork used for medical diagnosis. This result as well as a tendency for the speedup to increase with the size of the network invites practical application of parallel techniques for large Bayesian networks in expert systems.
Using Knowledge-Based Technology to Integrate CIM Databases
Authors: D. M. Dilts, W. Wu
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The authors propose a framework for using knowledge-based systems to integrate the heterogeneous multidatabases of computer integrated manufacturing (CIM). For each database, a corresponding knowledge-based system is designed for directing knowledge-processing of shared information. This one-to-one method reduces the complexity of the problem. Specifically, the structure, features, and knowledge representation for a knowledge-based system are presented. Then, a prototype of an interface between manufacturing planning and computer-aided design is described. Due to the potential for rapid changes in the manufacturing environment, the linkages among CIM databases are designed to be dynamic, flexible, and adaptive to a wide variety of situations.
Reminiscences on Influential Papers
Authors: Kenneth A. Ross
Venue: ACM SIGMOD Record (2000)

I'm happy to be able to share with you the following three reminiscences. I continue to invite unsolicited contributions. See http://www.acm.org/sigmod/record/author.html for submission guidelines. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Processing in Memory: The Terasys Massively Parallel PIM Array
Authors: Maya Gokhale, Bill Holmes, Ken Iobst
Venue: Computer (1995)

This approach to processing in memory integrates single-instruction, multiple-data (SIMD) processing elements into the memory subsystem of a conventional computer. The processor-in-memory (PIM) chip is an enhanced 4-bit SRAM that associates a single-bit processor with each column of memory. To explore the viability of processing in memory, the authors built the Terasys workstation, a Sparcstation-2 augmented with 8 Mbytes of PIM memory holding 32K single-bit processors. They have also designed and implemented a high-level parallel language called data-parallel bit C (dbC). In normal memory mode, the PIM chips function as additional Sbus memory to the Sparc-2. In SIMD mode, the PIM chips accept commands from the Sparc-2 and execute those commands simultaneously on all PIM processors. Pairs of commands can be issued every 200 nanoseconds, giving an effective instruction issue rate of 100 ns. Peak performance for the 32K-processor system is 3.2 '1011 bit operations per second. Microcoded applications have reached (and in one case, exceeded) this theoretical peak, which is the equivalent of 25 Cray-YMP processors. With the successful creation of the Terasys research prototype, the authors have begun work on PIM in a supercomputer setting. In a collaborative research project with Cray Computer, they are incorporating a new Cray-designed implementation of the PIM chips into two octants of Cray-3 memory.
Building Knowledge-Based Systems with Procedural Languages
Authors: C. W. Butler, E. D. Hodil, G. L. Richardson
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The implementation of knowledge-based (KB) software using traditional languages and hardware is shown. Some techniques that need to be added to the programmer's tool kit for successful construction of KB systems using procedural languages are demonstrated. The discussion covers: reasoning and inferencing; procedural flow of control; basic data structures; explanation facilities; certainty factors; and procedural logic differences.
Increasing Test Accuracy by Varying Driver Slew Rate
Authors: Bjorn Dahlberg
Venue: IEEE Design Test (1991)

A variable slew rate, together with the ability to control ascending and descending slew rates independently, significantly improves the overall accuracy of test and verification systems for application-specific ICs. Although a high slew rate is usually desirable, in some cases, such as ECL devices and devices in circuits of older vintage, a variable rate is advantageous. Essential driver characteristics are identified, and the driver model is described. For a small parts cost, and with only a negligible increase in power requirements, it is estimated that independent control of slew rates for ascending and descending edges can improve tester accuracy by several hundred picoseconds.
Intellectual Property Protection: Everything You've Always Wanted to Know
Venue: Computer (1994)

This article examines the legal issues affecting people who spend a lot of time in the computer hardware/software arena. It discusses some of the basic patent-application disclosure requirements which inventors must satisfy. These requirements enumerate what inventors must include in the patent application to meet the US Patent Office's definition of a "fully described" invention. To more clearly demonstrate some of the prominent issues I discuss examples from a patent attorney with both a professional and personal interest in the acquisition of intellectual property rights for computer-related inventions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Body of Knowledge for Software Quality Measurement
Authors: Norman F. Schneidewind
Venue: Computer (2002)

Measuring quality is the key to developing high-quality software.The author describes two approaches that help to identify the bodyof knowledge software engineers need to achieve this goal. The first approachderives knowledge requirements from a preters also support several popular instruction sets, including Alpha, PPC, x86, and ARM.
The Paradox of Digital Preservation
Authors: Su-Shing Chen
Venue: Computer (2001)

Preserving digital information is a problem plagued by short media life, obsolete hardware and software, slow read times of old media, and defunct Web sites. The paradox is: We want to maintain digital information intact, but we also want to be able to access this information in a dynamic use context.Chen explains that we lack proven methods to ensure that the digital information will continue to exist, that we will be able to access this information using improved technology tools, or that accessible information is authentic and reliable.The author asserts that failing to address the problems of preserving information in digital form is analogous to fostering cultural and intellectual poverty and squandering potential long-term gains that we should rightfully receive as a return on our professional, personal, and economic investments in information technology. Finding a solution to the tension between the creation context and the use context constitutes an important challenge.
Coordinating Mutually Exclusive Resources using GPGP
Authors: Keith Decker, Jinjiang Li
Venue: Autonomous Agents and Multi-Agent Systems (2000)

Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associated tests and treatments have become interrelated, the current ad hoc patient scheduling solutions have been observed to break down. We propose a multi-agent solution using the Generalized Partial Global Planning (GPGP) approach that preserves the existing human organization and authority structures, while providing better system-level performance (increased hospital unit throughput and decreased patient stay time). To do this, we extend GPGP with a new coordination mechanism to handle mutually exclusive resource relationships. Like the other GPGP mechanisms, the new mechanism can be applied to any problem with the appropriate resource relationship. We evaluate this new mechanism in the context of the hospital patient scheduling problem, and examine the effect of increasing interrelations between tasks performed by different hospital units.
Automatic Construction of XML-Based Tools Seen as Meta-Programming
Authors: Baltasar Trancón Y Widemann, Markus Lepper, Jacob Wieland
Venue: Automated Software Engineering (2003)

This article presents XML-based tools for parser generation and data binding generation. The underlying concept is that of transformation between formal languages, which is a form of meta-programming. We discuss the benefits of such a declarative approach with well-defined semantics: productivity, maintainability, verifiability, performance and safety.
A Hardware-Software Codesign Methodology for DSP Applications
Authors: Asawaree Kalavade, Edward A. Lee
Venue: IEEE Design Test (1993)

The authors describe a systematic, heterogeneous design methodology using the Ptolemy framework for simulation, prototyping, and software synthesis of systems containing a mixture of hardware and software components. They focus on signal-processing systems in which the hardware typically consists of custom data paths, finite-state machines (FSMs), glue logic and programmable processors. The software is one or more embedded programs running on the programmable components.
Making Reuse Work At Hewlett-Packard
Authors: Martin L. Griss, Marty Wosser, Shari Lawrence Pfleeger
Venue: IEEE Software (1995)

For the last seven years, Martin Griss and his colleagues have investigated how Hewlett-Packard can improve its software-development process using systematic software reuse. Griss has been a professor, research laboratory manager, and industrial researcher. Marty Wosser has worked closely with him on software reuse for four years. In this column, they share some of what HP has learned about software reuse. This column, which builds on a talk Griss delivered at the International Conference on Software Engineering last May, can help you manage expectations about what software reuse can and cannot deliver.¿ Shari Lawrence Pfleeger
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Authors: Mayez Al-Mouhamed, Hussam Abu-Haimed
Venue: International Journal of Parallel Programming (2001)

Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at runtime.(1, 2) Allocating the data structure(1) to separate memories whenever the data may be accessed in parallel allows improvements in memory access time of 13 to 40%. We are concerned with synthesizing compiler storage schemes for minimizing array access conflicts in parallel memories for a set of compiler predicted data access patterns. The access patterns can be easily found for many synchronous dataflow computations like multimedia compression/decompression algorithms, DSP, vision, robotics, etc. A storage scheme is a mapping from array addresses into storages. Finding a conflict-free storage scheme for a set of data patterns is NP-complete. This problem is reduceable to weighted graph coloring. Optimizing the storage scheme is investigated by using constructive heuristics, neural methods, and genetic algorithms. The details of implementation of these different approaches are presented. Using realistic data patterns, simulation shows that memory utilization of 80% or higher can be achieved in the case of 20 data patterns over up to 256 parallel memories, i.e., a scalable parallel memory. The neural approach was relatively very fast in producing reasonably good solutions even in the case of large problem sizes. Convergence of proposed neural algorithm seems to be only slightly dependent on problem size. Genetic algorithms are recommended for advanced compiler optimization especially for large problem sizes; and applications which are compiled once and run many times over different data sets. The solutions presented are also useful for other optimization problems.
Transport and anisotropic diffusion in time-dependent flow visualization
Authors: D. Bürkle, T. Preußer, M. Rumpf
Venue: Proceedings of the conference on Visualization '01 (2001)

The visualization of time-dependent flow is an important and challenging topic in scientific visualization. Its aim is to represent transport phenomena governed by time-dependent vector fields in an intuitively understandable way, using images and animations. Here we pick up the recently presented anisotropic diffusion method, expand and generalize it to allow a multiscale visualization of longtime, complex transport problems. Instead of streamline type patterns generated by the original method now streakline patterns are generated and advected. This process obeys a nonlinear transport diffusion equation with typically dominant transport. Starting from some noisy initial image, the diffusion actually generates and enhances patterns which are then transported in the direction of the flow field. Simultaneously the image is again sharpened in the direction orthogonal to the flow field. A careful adjustment of the model&sacute; parameters is derived to balance diffusion and transport effects in a reasonable way. Properties of the method can be discussed for the continuous model, which is solved by an efficient upwind finite element discretization. As characteristic for the class of multiscale image processing methods, we can in advance select a suitable scale for representing the flow field.
Using Group Support Systems for Software Inspections
Authors: Michiel van Genuchten, Cor van Dijk, Henk Scholten, Doug Vogel
Venue: IEEE Software (2001)

This article describes the results of the routine use of a group support system to support inspections in the Baan Company. The authors compare 87 inspections using a GSS to 102 traditional inspections. The results indicate that mature inspections supported by a GSS are more effective and efficient. The difference is up to 40 percent, in terms of both major defects per thousand lines of source code and major defects per person-hour for preparation and logging. The benefit of a GSS disappears, however, if the inspection process is not followed properly and the preparation rate is too high.
Fast Surface Interpolation using Multiresolution Wavelet Transform
Authors: M. H. Yaou, W. T. Chang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Discrete formulation of the surface interpolation problem usually leads to a large sparse linear equation system. Due to the poor convergence condition of the equation system, the convergence rate of solving this problem with iterative method is very slow. To improve this condition, a multiresolution basis transfer scheme based on the wavelet transform is proposed. By applying the wavelet transform, the original interpolation basis is transformed into two sets of bases with larger supports while the admissible solution space remains unchanged. With this basis transfer, a new set of nodal variables results and an equivalent equation system with better convergence condition can be solved. The basis transfer can be easily implemented by using an QMF matrix pair associated with the chosen interpolation basis. The consequence of the basis transfer scheme can be regarded as a preconditioner to the subsequent iterative computation method. The effect of the transfer is that the interpolated surface is decomposed into its low-frequency and high-frequency portions in the frequency domain. It has been indicated that the convergence rate of the interpolated surface is dominated by the low-frequency portion. With this frequency domain decomposition, the low-frequency portion of the interpolated surface can be emphasized. As compared with other acceleration methods, this basis transfer scheme provides a more systematical approach for fast surface interpolation. The easy implementation and high flexibility of the proposed algorithm also make it applicable to various regularization problems.
Simics: A Full System Simulation Platform
Authors: Peter S. Magnusson, Magnus Christensson, Jesper Eskilson, Daniel Forsgren, Gustav Hållberg, Johan Högberg, Fredrik Larsson, Andreas Moestedt, Bengt Werner
Venue: Computer (2002)

Full system simulation seeks to strike a balance between accuracy and performance. Many of its possibilities have been obvious to practitioners in both academia and industry for quite some time, perhaps decades, but Simics supports more of these possibilities within a single framework than other tools do.Simics is a platform for full system simulation that can run actual firmware and completely unmodified kernel and driver code. It is sufficiently abstract to achieve tolerable performance levels, and it provides both functional accuracy for running commercial workloads and sufficient timing accuracy to interface to detailed hardware models. Simics can also run a heterogeneous network of systems from different vendors within the same framework. Exceptionally fast, Simics can easily add new components and leverage older ones within a practical abstraction level. It offers a platform with a rich API and a powerful scripting environment for use in a broad range of applications.
Local Versus Nonlocal Computation of Length of Digitized Curves
Authors: S. R,  Kulkarni, S. K. Mitter, R. J. Richardson, J. N. Tsitsiklis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Considers the problem of computing the length of a curve from digitized versions of the curve using parallel computation. The authors' aim is to study the inherent parallel computational complexity of this problem as a function of the digitization level. Precise formulations for the digitization, the parallel computation, and notions of local and nonlocal computations are given. It is shown that length cannot be computed locally from digitizations on rectangular tessellations. However, for a random tessellation and appropriate deterministic ones, the authors show that the length of straight line segments can be computed locally. Implications of the authors' results for a method for image segmentation and a number of open problems are discussed.
Replication Algorithms in a Remote Caching Architecture
Authors: A. Leff, J. L. Wolf, P. S. Yu
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Studies the cache performance in a remote caching architecture. The authors develop aset of distributed object replication policies that are designed to implement differentoptimization goals. Each site is responsible for local cache decisions, and modifies cachecontents in response to decisions made by other sites. The authors use the optimal andgreedy policies as upper and lower bounds, respectively, for performance in thisenvironment. Critical system parameters are identified, and their effect on systemperformance studied. Performance of the distributed algorithms is found to be close tooptimal, while that of the greedy algorithms is far from optimal.