ppxscal/embedding_network huggingface dataset:
Generalization and Generalizability Measures
Authors: Benjamin W. Wah
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

In this paper, we define the generalization problem, summarize various approaches in generalization, identify the credit assignment problem, and present the problem and some solutions in measuring generalizability. We discuss anomalies in the ordering of hypotheses in a subdomain when performance is normalized and averaged, and show conditions under which anomalies can be eliminated. To generalize performance across subdomains, we present a measure called probability of win that measures the probability whether one hypothesis is better than another. Finally, we discuss some limitations in using probabilities of win and illustrate their application in finding new parameter values for TimberWolf, a package for VLSI cell placement and routing.
Design for Verification?
Authors: Todd Austin
Venue: IEEE Design Test (2001)

(available without subscription)No abstract available.
Unidirectional Bit/Byte Error Control
Authors: Nitin H. Vaidya
Venue: IEEE Transactions on Computers (1995)

This paper defines a new class of unidirectional errors, named t/u-unidirectional errors, which affect at most t bits confined to at most u bytes of the code word. Codes that are capable of detecting, locating and correcting t/1-unidirectional errors are presented. Lower bounds on the number of checkbits required for t/1-unidirectional error detection and location are also presented.
Performance Analysis of Four Memory Consistency Models for Multithreaded Multiprocessors
Authors: Yong-Kim Chong, Kai Hwang
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Stochastic timed Petri nets are developed to evaluate the relative performance of distributed shared memory models for scalable multiprocessors, using multithreaded processors as building blocks. Four shared memory models are evaluated: the Sequential Consistency (SC) model by Lamport (1979), the Weak Consistency (WC) model by Dubois et al. (1986), the Processor Consistency (PC) model by Goodman (1989), and the Release Consistency (RC) model by Gharachorloo et al. (1990). We assumed a scalable network with a sufficient bandwidth to absorb the increased traffic from multithreading, coherent caches, and memory event reordering. The embedded Markov chains are solved to reveal the performance attributes. Under saturated conditions, we find that multithreading contributes more than 50% of the performance improvement, while the improvement from memory consistency models varies between 20% to 40% of the total performance gain. Petri net models are effective to predict the performance of processors with a larger number of contexts than that can be simulated in previous benchmark studies. The accuracy of these memory performance models was validated with the simulation results from Stanford University. Our analytical results reveal the lowest performance of the SC model amongst four memory consistency models. The PC model requires to use larger write buffers, while the WC and RC models require smaller write buffers. The PC model may perform even lower than the SC model, if a small buffer was used. The performance of the WC model depends heavily on the synchronization rate in user code. For a low synchronization rate, the WC model performs as well as the RC model. With sufficient multithreading and network bandwidth, the RC model shows the best performance among the four models. Furthermore, we discovered that cache interferences cause very little performance degradation in all relaxed memory consistency models; as long as the network is contention-free even when multithreading has saturated the system.
Theory of Extended Linear Machines
Authors: Kolin Paul, D. Roy Choudhury, P. Pal Chaudhuri
Venue: IEEE Transactions on Computers (2002)

This paper extends the theory of autonomous Linear Machines (LMs). The theory of the Extension Field has provided the foundation for the design of such machines referred to as Extended Linear Machines (ELM). An analytical framework has been reported to completely characterize the vector subspace generated by an ELM and also different variations of LMs having cyclic, as well as noncyclic vector subspaces. This formulation has resulted in a single algorithm that characterizes each of the vector subspaces in terms of cyclic and noncyclic subspaces. An ELM significantly reduces the computation time for characterizing the model and study of the behavior of the physical system compared to conventional binary linear machines.
Scan Design at NEC
Authors: Shigehiro Funatsu, Masato Kawai, Akahiko Yamada
Venue: IEEE Design Test (1989)

The authors describe scan path, NEC's implementation of the scan design approach to design for testability. Designers at NEC have found that scan path greatly contributes to the reduced testing and maintenance cost of their products. The authors discuss several implementations of scan design and compare four implementations, including two scan-path techniques.
Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform
Authors: O. Alshibami, S. Boussakta
Venue: Signal Processing (2002)

The three-dimensional discrete Hartley transform (3-D DHT) has been applied in a wide range of 3-D applications such as 3-D power spectrum analysis, 3-D filtering, and medical applications, etc. In this paper, a three-dimensional algorithm for fast computation of the three-dimensional discrete Hartley transform is developed. The mathematical concept and derivation is presented and the arithmetic complexity is analysed and compared to the familiar row-column approach. It is found that this algorithm offers substantial savings in both the number of multiplications and additions.
A Tight Upper Bound on the Bayesian Probability of Error
Authors: W. A. Hashlamoun, P. K. Varshney, V. N. S. Samarasooriya
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

In this paper, we present a new upper bound on the minimum probability of error of Bayesian decision systems for statistical pattern recognition. This new bound is continuous everywhere and is shown to be tighter than several existing bounds such as the Bhattacharyya and the Bayesian bounds. Numerical results are also presented.
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors
Authors: E. P. Markatos, T. J. LeBlanc
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Loops are the single largest source of parallelism in many applications. One way to exploit this parallelism is to execute loop iterations in parallel on different processors. Previous approaches to loop scheduling attempted to achieve the minimum completion time by distributing the workload as evenly as possible while minimizing the number of synchronization operations required. The authors consider a third dimension to the problem of loop scheduling on shared-memory multiprocessors: communication overhead caused by accesses to nonlocal data. They show that traditional algorithms for loop scheduling, which ignore the location of data when assigning iterations to processors, incur a significant performance penalty on modern shared-memory multiprocessors. They propose a new loop scheduling algorithm that attempts to simultaneously balance the workload, minimize synchronization, and co-locate loop iterations with the necessary data. They compare the performance of this new algorithm to other known algorithms by using five representative kernel programs on a Silicon Graphics multiprocessor workstation, a BBN Butterfly, a Sequent Symmetry, and a KSR-1, and show that the new algorithm offers substantial performance improvements, up to a factor of 4 in some cases. The authors conclude that loop scheduling algorithms for shared-memory multiprocessors cannot afford to ignore the location of data, particularly in light of the increasing disparity between processor and memory speeds.
Level set segmentation from multiple non-uniform volume datasets
Authors: Ken Museth, David E. Breen, Leonid Zhukov, Ross T. Whitaker
Venue: Proceedings of the conference on Visualization '02 (2002)

Typically 3-D MR and CT scans have a relatively high resolution in the scanning X - Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an object can miss small or thin structures. One way to address this problem is to scan the same object from multiple directions. In this paper we describe a method for deforming a level set model using velocity information derived from multiple volume datasets with non-uniform resolution in order to produce a single high-resolution 3D model. The method locally approximates the values of the multiple datasets by fitting a distance-weighted polynomial using moving least-squares. The proposed method has several advantageous properties: its computational cost is proportional to the object surface area, it is stable with respect to noise, imperfect registrations and abrupt changes in the data, it provides gain-correction, and it employs a distance-based weighting to ensures that the contributions from each scan are properly merged into the final result. We have demonstrated the effectiveness of our approach on four multi-scan datasets, a griffin laser scan reconstruction, a CT scan of a teapot and MR scans of a mouse embryo and a zucchini.
An Adaptive Algorithm for Mining Association Rules on Shared-Memory Parallel Machines
Authors: David W. Cheung, Kan Hu, Shaowei Xia
Venue: Distributed and Parallel Databases (2001)

Mining association rules from large databases is very costly. We propose to develop parallel algorithms for this task on shared-memory multiprocessor (SMP). All proposed parallel algorithms for other paradigms follow the conventional level-wise approach: they need as many iterations as the length of the maximum large itemset. To make matter worse, they impose a synchronization in every iteration which would cause serious I/O contention on shared-memory parallel system. An adaptive asynchronous parallel mining algorithm APM has been proposed for SMP. All processors generate candidates dynamically and count itemset supports independently without synchronization. Two optimization techniques have been proposed for the reduction of database scanning and the number of candidates. The algorithm APM has been implemented on a Sun Enterprise 4000 shared-memory multiprocessor with 12 nodes. The experiments show that the optimizations have very good effects and APM has a substantial lead in performance over other proposed level-wise algorithms.
Numerical solutions for a nonlocal equation with reflection of the argument
Authors: D. Andrade, T. F. Ma
Venue: Neural, Parallel Scientific Computations (2002)

The nonlinear equation involving reflection of the argument M(∫-LL u(s) ds) u"(x) = f(x,u(x), u(-x)) x ∈ [-L, L], where M and f are continuous functions with M < 0, is studied through iterative methods. An existence theorem and numerical results are presented.
An Approach for Recording Multimedia Collaborative Sessions: Design and Implementation
Authors: Shervin Shirmohammadi, Li Ding, Nicolas Georganas
Venue: Multimedia Tools and Applications (2003)

In this article we present the design and implementation of a videoconferencing session recorder multimedia system. Our system is a videoconferencing tool that has the capability of recording live multimedia collaborative/conferencing sessions. The main distinction between our architecture and other ones is that unlike other recording systems, which require the original application for the playback, our system generates Synchronized Multimedia Integration Language (SMIL) compliant documents which can be played back in any SMIL-compliant player.
Generalization of the Spline Interpolation Based on the Principle of the Compact Schemes
Authors: Gennaro Coppola, Carlo Meola
Venue: Journal of Scientific Computing (2002)

In this work the authors extend the high order compact difference schemes to the matching technique to develop a Local Matched Reconstruction theory that can be also considered as a generalization of the spline theory. The problem of the high order reconstructions correlated to an optimal matching in overlapping regions for contiguous expansions in one or more dimensions is stressed; some new generalized matched interpolations and their related numerical schemes are presented together with Fourier analysis of errors. Finally, some relevant aspects of the computational efforts associated to the various approaches are discussed.
On Supernode Transformation with Minimized Total Running Time
Authors: Edin Hodzic, Weijia Shang
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

With the objective of minimizing the total execution time of a parallel program on a distributed memory parallel computer, this paper discusses how to find an optimal supernode size and optimal supernode relative side lengths of a supernode transformation (also known as tiling). We identify three parameters of supernode transformation: supernode size, relative side lengths, and cutting hyperplane directions. For algorithms with perfectly nested loops and uniform dependencies, for sufficiently large supernodes and number of processors, and for the case where multiple supernodes are mapped to a single processor, we give an order n polynomial whose real positive roots include the optimal supernode size. For two special cases, 1) two-dimensional algorithm problems and 2) n-dimensional algorithm problems, where the communication cost is dominated by the startup penalty and, therefore, can be approximated by a constant, we give a closed form expression for the optimal supernode size, which is independent of the supernode relative side lengths and cutting hyperplanes. For the case where the algorithm iteration index space and the supernodes are hyperrectangular, we give closed form expressions for the optimal supernode relative side lengths. Our experiment shows a good match of the closed form expressions with experimental data.
The Application of Workflow Technology in Semantic B2B Integration
Authors: Christoph Bussler
Venue: Distributed and Parallel Databases (2002)

Workflow Management Systems (WFMSs) are often used in context of B2B integration as a base technology to implement business-to-business (B2B) integration processes across enterprises. In this context the notion of &ldquo;distributed inter-organizational workflows&rdquo; is introduced to indicate the collaboration of enterprises on a process level. This notion requires a thorough examination presented in this article since WFMSs were not designed with inter-enterprise distribution as one of the design goals. At a closer look, the proposed use of WFMSs in context of B2B integration is often very na&iuml;ve and inappropriate. Consequently it does not address the real requirements found in enterprises. Enterprises do not share common workflow definitions, let alone common workflow instance execution state and have no intent to do so due to competitive knowledge protection. Furthermore, trading partner specific business rules within enterprises are not accounted for leading to an unwanted &ldquo;explosion&rdquo; of workflow definitions. This article clarifies the notion of &ldquo;distributed inter-organizational workflows&rdquo; as well as private and public processes. Based on this definition, the appropriate use of WFMSs is shown in context of an overall B2B integration solution that allows enterprises to protect their competitive knowledge while participating in B2B integration.
Constraint Analysis: A Design Process for Specifying Operations on Objects
Authors: S. D. Urban, L. M. L. Delcambre
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A design process for an object-oriented database design environment, known as constraint analysis, is presented. Given the increased level of semantics associated with an object-oriented database schema, constraint analysis makes use of semantics expressed as database constraints to support the flexible specification of propagation actions for operations on objects. Constraints are formally represented using Horn logic. The constraint analysis process then reasons about constraints at design time to help the designer understand the effects of constraints on object manipulation, identifying possible constraint violations as well as design alternatives for handling violations. An advantage of constraint analysis is that both inherent and explicit schema constraints are included in the analysis process. A formal representation is given that supports the analysis of constraints and the automatic identification of design alternatives for responding to constraint violations.
On the sums of infinitely many sequences
Authors: Alexander Abian, Paula Kemp
Venue: Octogon Mathematical Magazine (2001)

A Theorem is proved giving a necessary and sufficient condition for the equality of the sum of the limits of infinitely many sequences to the limit of the sequence of their sum.
Efficient circuit clustering for area and power reduction in FPGAs
Authors: Amit Singh, Ganapathy Parthasarathy, Malgorzata Marek-Sadowska
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2002)

We utilize Rent's rule as an empirical measure for efficient clustering and placement of circuits in clustered Field Programmable Gate Arrays (FPGAs). We show that careful matching of resource availability and design complexity during the clustering and placement processes can contribute to spatial uniformity in the placed design, leading to overall device decongestion after routing. We present experimental results to show that appropriate logic depopulation during clustering can have a positive impact on the overall FPGA device area. Our clustering and placement techniques can improve the overall device routing area by as much as 62&percnt;, 35&percnt; on average, for the same array size, when compared to state-of-the-art FPGA clustering, placement, and routing tools. Power dissipation simulations using a typical buffered pass-transistor-based FPGA interconnect model are also presented. They show that our clustering and placement techniques can reduce the overall device power dissipation by approximately 13&percnt;.
RISE++: A Symbolic Environment for Scan-Based Testing
Authors: Steve Vinoski
Venue: IEEE Design Test (1993)

The architecture and implementation of the Remote Interactive Scan Environment (RISE++), an object-oriented software system that makes use of distributed computing techniques, are discussed. This system supports the development, application, and debugging of scan-based tests for the HP/Apollo Series 10000 RISC workstation and can be used with other scan architectures. RISE++ executes on a separate workstation and communicates with the system under test via a local area network. Test engineers can develop and debug scan tests under RISE++ because it tracks may trivial but important details for them and provides them with precise control over the test hardware.
Coherence Approach to Logic Program Revision
Authors: Li-Yan Yuan, Jia-Huai You
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

In this paper, we present a new approach to the problem of revising extended programs; we base this approach on the coherence theory initially advocated by Gardenfors for belief revision. Our approach resolves contradiction by removing only conflicting information, not the believed source of it, and therefore, keeps information loss minimal. Furthermore, since there is no need to search for problematic assumptions, as is done in the traditional assumption-removal approach, our approach provides a skeptical revision semantics that is tractable. We define the skeptical and credulous coherence semantics and show that both semantics can be characterized in terms of the fixpoint semantics of a revised program using a simple program-revision technique. These semantics provide a suitable framework for knowledge and belief revision in the context of logic programs. Semantical properties and advantages of the proposed revision semantics are also analyzed.
A Software Development Process for Small Projects
Authors: Melissa L. Russ, John D. McGregor
Venue: IEEE Software (2000)

The authors' development process integrates portions of an iterative, incremental process model with a quality assurance process that assesses each process phase's quality and a measurement process that collects data to guide process improvement. The process's goal is to produce the high quality and timely results required for today's market without imposing a large overhead on a small project.
Pfair Scheduling of Generalized Pinwheel Task Systems
Authors: Sanjoy K. Baruah, Shun-Shii Lin
Venue: IEEE Transactions on Computers (1998)

The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a run-time complexity point of view, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems.
A Study on the Structure of Linear Recursion
Authors: W. Lu, D. L. Lee, J. Han
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We study a general class of single linear recursions and the properties of their expansions by analyzing the structures of the recursions. We show that the expansions of a linear recursion of this class are very regular in that the variable connections are heavily shared and change periodically with respect to the expansions. The variable connections can be precisely characterized as static bindings and chain connections. We conclude that a single linear recursion under our assumptions either is bounded or can be expressed as chain recursions. This study contributes to query processing, because it provides the basis for rule compilation as a general and powerful technique for query processing. Combined with query information, the expansion properties of the recursion provide optimized query-processing plans.
Information Flow in Digital Metal-Oxide Semiconductor Circuits
Authors: Bernd Ingenbleek, Klaus Woelcken, Claudia Matthaus
Venue: IEEE Micro (1989)

An extensible, relational database management system called Requiem is described that offers users a truly relational interface, and is independent of query language. Requiem (relational query and update interactive system) is an interactive system with facilities for querying and updating a database. The organization of Requiem, the structure of its query language RQL, and the structure of the database are discussed.
Cognitive Hacking: A Battle for the Mind
Authors: George Cybenko, Annarita Giani, Paul Thompson
Venue: Computer (2002)

On 25 August 2000, stockholders were stunned by news that server and storage provider Emulex was revising its earnings from a per-share gain to a loss, while lowering its reported net earnings from the previous quarter as well. Within minutes, Emulex shares plummeted. Yet none of this news fostered by a hacker's bogus press release was true.The Emulex case illustrates the speed, scale, and subtlety with which networked information can propagate and how quickly severe consequences can occur. This rapid dissemination, which makes such cognitive hacking possible, is forcing security researchers to look at yet another class of countermeasures a class far different from solutions that seek to secure technology and network infrastructure.