ppxscal/embedding_network huggingface dataset:
Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment
Authors: B. Ramkumar, L. V. Kalé
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We describe a binding environment for the AND and OR parallel execution of logicprograms that is suitable for both shared and nonshared memory multiprocessors. Thebinding environment was designed with a view of rendering a compiler using this bindingenvironment machine independent. The binding environment is similar to closedenvironments proposed by J. Conery. However, unlike Conery's scheme, it supports ORand independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel.
Achieving software quality with testing coverage measures
Authors: Joseph R. Horgan, Saul London, Michael R. Lyu
Venue: Computer (1994)

Coverage testing helps the tester create a thorough set of tests and gives a measure of test completeness. The concepts of coverage testing are well-described in the literature. However, there are few tools that actually implement these concepts for standard programming languages, and their realistic use on large-scale projects is rare. In this article, we describe the uses of a dataflow coverage-testing tool for C programs-called ATAC for Automatic Test Analysis for C/sup 3/-in measuring, controlling,and understanding the testing process. We present case studies of two real-world software projects using ATAC. The first study involves 12 program versions developed by a university/industry fault-tolerant software project for a critical automatic-flight-control system. The second study involves a Bellcore project of 33 program modules. These studies indicate that coverage analysis of programs during testing not only gives a clear measure of testing quality but also reveals important aspects of software structure. Understanding the structure of a program, as revealed in coverage testing, can be a significant component in confident assessment of overall software quality.
On centroid branches of trees from certain families
Authors: A. Meir, J. W. Moon
Venue: Discrete Mathematics (2002)

We obtain various results involving the centroid branches of randomly chosen trees from simply generated families.
Effect of contrast agent viscosity and injection flow velocity on bolus injection pressures for peripheral venous injection in first-pass myocardial perfusion studies
Authors: Edward G. Walsh, Andreas Anayiotos, Mark Doyle, Gerald M. Pohost
Venue: Technology and Health Care (2002)

Myocardial perfusion imaging using Gd contrast agents is typically performed with bolus injections of the contrast agent using a power injector to provide for consistent and sufficiently rapid injection rates for all patients. For protocols in which a peripheral venous injection is called for (e.g. antecubital vein) injection catheters of 18 ga are used where vessel geometry permits. In some patients, particularly women with smaller veins, 20 and 22 ga catheters are used. The effect of catheter size and pressure tubing length can result in high injection pressures that occasionally cause leakage or connector failure. The viscosity of the contrast agent also impacts injection pressure. In this study, a simulation of the injection pathway was constructed with time resolved pressures measured at two points in the pathway. Pressure drops were calculated for a typical MR perfusion injection protocol.
The Design Space of Register Renaming Techniques
Authors: Dezsö Sima
Venue: IEEE Micro (2000)

In this article we focus on register renaming, a technique that has appeared in virtually all recent superscalars to boost performance. To elucidate this complex issue, we identify the design space of feasible techniques used in superscalars to rename registers. We discuss the main dimensions of the design space, and in each dimension we indicate possible design choices. Finally, we point out basic alternatives and possible implementation schemes of register renaming.
Flexibility as a Design Driver
Authors: Tommi Mikkonen, Peeter Pruuden
Venue: Computer (2001)

Ambiguous requirements and those that emerge late in the design cycle often complicate development and throw off established schedules. The authors describe how reformulating information missing at the design stage into a flexibility requirement can turn the absent data into a design driver. Designers constantly run into issues that have yet to be understood through specification, system design, or standardization. Changes in evolving technologies and businesses often result in unstable system requirements. Reliable hardware or mechanical details might not be available until very late in the development process. Yet engineers must initiate software development even though some subsystem details have not yet been completely defined. Missing information and related flexibility requirements can lead to a design plagued by many well-known problems that affect performance, modularity, scalability, and clear separation of concerns. In some cases, developers must sacrifice rules of thumb to maintain planned development schedules. Providing flexibility for everything in the system isn't possible, so developers will always need to determine the static requirements and explicitly state where continued development and rapid modification require flexibility.
Globe-Trotter: An Intelligent Flight Itinerary Planner
Authors: Prasanta K. Bose, Gautam Biswas, Adithya M. Rao Padala, Theodore A. Linden
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

Flight itinerary planning is viewed as constraint satisfaction. Interactive constraint-based problem solvers must address two basic issues simultaneously and effectively: first, eliciting individual problem constraints; and second, given the constraint set, generating a solution. Globe-Trotter's dialogue management scheme addresses both issues. A system overview of Globe-Trotter is given. The system's knowledge base structure and contents, reasoning system, and the itinerary generation process are examined. Related work and future plans are briefly discussed.
A Formal Specification of an Oscilloscope
Authors: Norman Delisle, David Garlan
Venue: IEEE Software (1990)

This case study presents the development of an abstract oscilloscope specification, using Z notation. A description is given of the problem and its context. An abstract model of an oscilloscope that clarifies its user-accessible functions is described. Issues that must be addressed to scale up this specification to deal with more complicated, realistic oscilloscopes are discussed. The use of formal models and formal reasoning in this specification is examined.
Nondominated Coteries on Graphs
Authors: Takashi Harada, Masafumi Yamashita
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a distributed system. Coterie C is said to G-dominate D (with respect to G) if the following condition holds: For any connected subgraph H of G that contains a quorum in D (as a subset of its vertex set), there exists a connected subgraph H¿ of H that contains a quorum in C. A coterie C on a graph G is said to be G-nondominated (G-ND) (with respect to G) if no coterie D (¿C) on G G-dominates C. Intuitively, a G-ND coterie consists of irreducible quorums.This paper characterizes G-ND coteries in graph theoretical terms, and presents a procedure for deciding whether or not a given coterie C is G-ND with respect to a given graph G, based on this characterization. We then improve the time complexity of the decision procedure, provided that the given coterie C is nondominated in the sense of Garcia-Molina and Barbara. Finally, we characterize the class of graphs G on which the majority coterie is G-ND.
An Efficient Deterministic Test Pattern Generator for Scan-Based BIST Environment
Authors: Wei-Lun Wang, Kuen-Jong Lee
Venue: Journal of Electronic Testing: Theory and Applications (2002)

To obtain satisfactory fault coverage for testing a logic circuit, linear feedback shift registers (LFSRs) have been used to generate not only the pseudorandom, but also the deterministic patterns in the scan-based built-in self-test environment. However, like other scan-based methods, the LFSR based pattern generation schemes take a long test application time to feed deterministic patterns from the LFSR into a scan chain. In this paper we derive a general relationship between the bits in the scan chain and the states of the LFSR and show that any bit to be generated by an LFSR in any future clock cycle can be pre-generated by a linear function of the current LFSR state. With this relationship, we can divide a scan chain into multiple sub-chains and use one LFSR-based multiple sequence generator to simultaneously generate all the subsequences required by the sub-chains, hence can greatly reduce the test application time for deterministic patterns. Moreover, due to the scan time reduction, test power wasted during the scan operation can also be significantly reduced.
Quantifying the Effects on Effort of Process Improvement
Authors: Bradford K. Clark
Venue: IEEE Software (2000)

When organizations make many improvements con-currently, managers have no way of deter-mining how much improvement is due to process maturity versus other factors. Using a 161-project sample, this article isolates the effects on effort of process maturity versus other effects.
Complete Cyberspace Reference and Directory: An Addressing and Utilization Guide to the Internet, Electronic Mail Systems, and Bulletin Board Systems
Authors: Gilbert Held
Venue:  (1997)

:The Complete Cyberspace Reference and Directory An Addressing and Utilization Guide to the Internet, Electronic Mail Systems, and Bulletin Board Systems Gilbert Held This comprehensive guide provides readers with everything they need to know to access and navigate the "Information Superhighway", including:*How to transmit and receive information electronically, via a variety of electronic messaging services, bulletin boards, and the Internet*What information is available electronically, and where to find itBeginning where most references end, The Complete Cyberspace Reference and Directory starts with a comprehensive glossary of terms, definitions and abbreviations, which serves as an excellent introduction to the vast amount of information that the book provides. From there, the book discusses the procedures for electronic communications via a variety of channels, such as Internet FTP, Internet Telnet, CompuServe E-mail, and MCI Mail. Each chapter begins with a tutorial on using an electronic information system and then continues with a comprehensive listing of the information resources that users can access via the system. Over 10,000 electronic addresses -- including more than 1,000 anonymous FTP sites and 300 libraries -- are provided, making The Complete Cyberspace Reference and Directory the most complete resource currently available. Whether you are already an experienced traveler on the electronic highway, or are just embarking on your first trip, The Complete Cyberspace Reference and Directory will give you all the information you need for a swift and prosperous journey. 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
Entropy and Large Deviations for Discrete-Time Markov Chains
Authors: G. Fayolle, A. De La Fortelle
Venue: Problems of Information Transmission (2002)

Let E be a denumerable state space and X be a homogeneous Markov chain on E with kernel P. Then the chain X verifies a weak Sanov's theorem, i.e., a weak large deviation principle holds for the law of the pair empirical measure. This LDP holds for any discrete state space Markov chain, not necessarily ergodic or irreducible. It is also known that a strong LDP cannot hold in the present framework. The result is obtained by a new method, which allows us to extend the LDP from a finite state space setting to a denumerable one, somehow like the projective limit approach. The analysis presented here offers some by-products, among which there are a contraction principle for the weak LDP, leading directly to a weak Sanov's theorem for the one-dimensional empirical measure. A refined analysis of the ubiquitous entropy function H proves to be useful in other frameworks, e.g., continuous time or stochastic networks, and allows us to improve the sharpness of asymptotics.
An Efficient Scheme for Interprocessor Communication Using Dual-Ported RAMs
Authors: N. Jagadish, J. Mohan Kumar, L. M. Patnaik
Venue: IEEE Micro (1989)

An approach for interprocessor interconnection is described in which communication between the processor nodes involves writing into and reading from a common memory area. The communicating processors do not have to contend for a common bus as in the case of shared-memory systems, since they have independent access to the common memory units shared between them. Only the memory access time of the processors limits the communication speed. Processor-to-processor communication does not use intermediate buffers, input/output ports, or DMAs. The example of a three-dimensional cube is used to illustrate the advantages of this scheme. The implementation of the interprocessor communication scheme on a 64-node cube configuration is discussed
Compact modeling and SPICE-based simulation for electrothermal analysis of multilevel ULSI interconnects
Authors: Ting Yen Chiang, Kaustav Banerjee, Krishna C. Saraswat
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper presents both compact analytical models and fast SPICE based 3-D electro-thermal simulation methodology to characterize thermal effects due to Joule heating in high performance Cu/low-k interconnects under steady-state and transient stress conditions. The results demonstrate excellent agreement with experimental data and those using Finite Element (FE) thermal simulations (ANSYS). The effect of vias, as additional heat sinking paths to alleviate the temp erature rise in the metal wires, is included in our analysis to provide more accurate and realistic thermal diagnosis. It shows that the effectiveness of vias in reducing the temperature rise in interconnects is highly dependent on the via separation and the dielectric materials used. The analytical model is then applied to estimate the temperature distribution in multi-level interconnects. In addition, we discuss the possibility that, under the impact of thermal effects, the performance improvement expected from the use of low-k dielectric materials may be degraded. Furthermore, thermal coupling between wires is evaluated and found to be significant. Finally, the impact of metal wire aspect ratio on interconnect thermal characteristics is discussed.
An efficient DC-gain matched balanced truncation realization for VLSI Interconnect circuit order reduction
Authors: Xuan Zeng, Dian Zhou, Wei Cai
Venue: Microelectronic Engineering (2002)

In this paper, we present a linear time DC-Gain matched BTR (DBTR) method for the VLSI interconnect order reduction. From the circuit point of view, the original BTR has a serious drawback that the DC gain between the original and the reduced order system doesn't match. We propose the DBTR method which can both match the DC gain and guarantee the performance of the reduced order system. Moreover, considering that the practical VLSI circuit order can be up to several thousands, we derive a linear time algorithm for computing a DBTR by extending the O(n) Krylov Subspace Oblique Projection. With linear time algorithm, the obstacle caused by the expensive computation cost of TBR for large circuit order reduction can be solved efficiently, and the advantage of the BTR, guaranteed performance on the reduced order system, can be fully utilized.
Using Your Home PC to Create the Ultimate Home Theater System
Authors: Bart Farkas, Jeff Govier
Venue:  (2002)

:"Using Your PC to Create the Ultimate Home Theater System" is meant for those home theatre enthusiasts with some working knowledge of personal computers, and who want to create the ultimate home theatre experience. The chapters are laid out chronologically and follow the authors' activities as they assemble various HTPC systems. The book begins with a detailed background of video and audio technologies to help the reader understand what the HTPC can do.The HTPC can do much more than play DVD movies on a HDTV-ready television. The convergence of digital computers and entertainment formats means that the PC platform is well suited to reproducing audio in many formats, including converting older analog recordings to digital. It is also great for capturing and editing home movies, creating slideshow presentations with digital pictures, video conferencing, and much more. "Using Your PC to Create the Ultimate Home Theater System" will show the reader how to set up an HTPC for the most complete home theatre experience available.
Implementation of a portable and reproducible parallel pseudorandom number generator
Authors: Daniel V. Pryor, Steven A. Cuccaro, Michael Mascagni, M. L. Robinson
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We describe in detail the parallel implementation of a family of additive lagged-Fibonacci pseudorandom number generators. The theoretical structure of these generators is exploited to preserve their well-known randomness properties and to provide a parallel system of distinct cycles. The algorithm presented here solves the reproducibility problem for a far larger class of parallel Monte Carlo applications than has been previously possible. In particular, Monte Carlo applications that undergo "splitting" can be coded to be reproducible, independent both of the number of processors and the execution order of the parallel processes. A library of portable C routines (available from the authors) that implements these ideas is also described.
Formal Verification of VHDL Descriptions in the Prevail Environment
Authors: Dominique D. Borrione, Laurence V. Pierre, Ashrak M. Salem
Venue: IEEE Design Test (1992)

Prevail, a formal verification environment for proving the equivalence of two very-high-speed integrated circuit hardware description language (VHDL) design architectures, is described. For simple bit-level combinational descriptions, the environment calls upon a tautology checker. For parameterized repetitive structures and for more abstract sequential designs, the program translates descriptions into recursive functions according to predefined templates and generates a theorem acceptable to the Bover-Moore theorem prover. The specification, implementation, and functional representation of a sequential example are presented.
An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images
Authors: Emma Regentova, Shahram Latifi, Shulan Deng, DongSheng Yao
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

An algorithm, which performs connected components detection in the course of decoding ITU-T (former CCITT) facsimile Group 3/4, i.e., MH/MR/MMR compressed images is presented. New definitions of mode color and a new transition element are introduced that allow MR/MMR codes to analyze and derive information about connection of black runs in two adjacent scan lines in the course of decoding. The experiments on the standard set of eight CCITT documents have shown that, on the average, the complexity of direct processing of MR/MMR codes is lower by a factor of 20 and 2.5 than that for raster images and MH codes processing respectively. Data structures for image vector description are discussed.
Multi-Shot Approach to Multiuser Separation and Interference Suppression in Asynchronous CDMA
Authors: Hongya Ge, Yeheskel Bar-Ness
Venue: Wireless Personal Communications: An International Journal (2000)

In this work, we present a new, computationally simple scheme (termed multi-shot approach) to separate and detect multiuser signals in an asynchronous code-division multiple-access (CDMA) communications system. By exploring the structure inherent in the matrix decomposition of properly arranged data, obtained from multi-shot matched filtering, we propose a near-far resistant multiuser detector. The proposed multiuser detector combines the multiple snapshots of matched filter outputs through a matrix filtering and de-biasing processing, revealed from the structure inherent in properly arranged data, prior to the final stage of decision making. Simulation results demonstrate the superior performance of the newly proposed computationally efficient detection scheme in comparison with other existing methods of comparable complexity.
Visual Keyword Image Retrieval Based on Synergetic NeuralNetwork for Web-Based Image Search
Authors: Tong Zhao, Lilian H. Tang, Horace H. S. Ip, Feihu Qi
Venue: Real-Time Systems (2001)

Feature extraction and similarity measure are two basic key issues in image retrieval. Combining the advantages of SNN in image recognition and selective attention for image retrieval, a novel visual keywords-driven image retrieval approach based on these properties has been proposed. By using a predefined set of visual keywords as prototype patterns stored with the SNN and then measuring the degree of similiarity of the stored images to the visual keywords, we show that such a visual keyword driven SNN can provide the framework for image indexing or retrieval which is scalable, robust and efficient for web-based search.
m-clouds in generalized hexagons
Authors: Leen Brouns, Joseph A. Thas, Hendrik Van Maldeghem
Venue: Discrete Mathematics (2002)

In this paper, we define m-clouds in finite generalized hexagons and look for possible sizes of these pointsets. We also give some remarks on m-clouds and dense clouds in generalized quadrangles.
Convex Envelopes of Monomials of Odd Degree
Authors: Leo Liberti, Constantinos C. Pantelides
Venue: Journal of Global Optimization (2003)

Convex envelopes of nonconvex functions are widely used to calculate lower bounds to solutions of nonlinear programming problems (NLP), particularly within the context of spatial Branch-and-Bound methods for global optimization. This paper proposes a nonlinear continuous and differentiable convex envelope for monomial terms of odd degree, x2k+1, where k &isin; N and the range of x includes zero. We prove that this envelope is the tightest possible. We also derive a linear relaxation from the proposed envelope, and compare both the nonlinear and linear formulations with relaxations obtained using other approaches.
Extensions to SQL for Historical Databases
Authors: N. L. Sarda
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A historical management system (HDBMS) is described which uses an extended relational data model with state-oriented, instead of 'cubic', conceptualization. Two types of historical relations, called state and event relations, are provided for modeling real-world objects. The query language SQL has been extended for definition, retrieval, and update of historical relations. The extended SQL, called HSQL, is a superset of SQL. The author defines a few primitive algebra operations for historical relations, and uses them as a basis for extensions to SQL. In this way, HSQL retains the elegant structural and algebraic framework of SQL. HSQL contains a few new clauses, many operations and built-in functions on time domain, and facilities for retrospective updates and time-rollback.