ppxscal/embedding_network huggingface dataset:
An Empirical Study of Domain Knowledge and Its Benefits to Substructure Discovery
Authors: Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working with a database in their area of expertise often search for predetermined types of structures or for structures exhibiting characteristics specific to the domain. This paper presents a method for guiding the discovery process with domain-specific knowledge. In this paper, the SUBDUE discovery system is used to evaluate the benefits of using domain knowledge to guide the discovery process. Domain knowledge is incorporated into SUBDUE following a single general methodology to guide the discovery process. Results show that domain-specific knowledge improves the search for substructures that are useful to the domain and leads to greater compression of the data. To illustrate these benefits, examples and experiments from the computer programming, computer-aided design circuit, and artificially generated domains are presented.
Low-Cost Testing of High-Density Logic Components
Authors: Robert W. Bassett, Barry J. Butkus, Stephen L. Dingle, Marc R. Faucher, Pamela S. Gillis, Jeannie H. Panner, John G. Petrovick Jr., Donald L. Wheater
Venue: IEEE Design Test (1990)

The evolution of a testing method and architecture of a logic-device tester to be used for the next generation of IBM's high-density CMOS ASIC (application-specific integrated circuit) logic components is described. The tester's design is based on the architecture of an existing IBM memory tester rather than on a conventional logic-tester design. The testing strategy calls for boundary-scan in each component design, built-in self-test logic within embedded memory arrays, and the use of weighted random-pattern logic testing. The development of the tester hardware is discussed, and capital costs of the new tester are compared with those of other approaches.
The anti-aliasing requirements for area and timing measurements in sampled systems
Authors: Paolo Walter Cattaneo
Venue: Signal Processing (2002)

This paper calculates the requirements of a class of anti-aliasing filters for detector read-out in sampled systems. The filter order and its cut-off frequency are related to the errors in area and timing reconstruction, assuming that the phase variation is the dominant source of error compared with quantization and electronic noise. Plots are presented to facilitate the design of filter parameters matching the physics requirements on the maximal error.
Commonsense Approach to Process Modeling
Authors: James E. Dutton
Venue: IEEE Software (1993)

The first phase of the three-phase ProSLCSE project, a US government-sponsored effort to give users of the Software Life-Cycle Support Environment (SLCSE) the ability to model and then execute processes, is described. The emphasis of the first phase is on providing a complete notation and vernacular for process definition. The proposed modeling notation includes infrastructure-modeling, information-modeling, and process-modeling notations that are intended to be easy to learn and use, even by busy project managers. The process concepts, modeling concepts, modeling notation, and process enactment of ProSLCSE are discussed.
Consistent parametrization by quinary subdivision for remeshing and mesh metamorphosis
Authors: Jian Liang Lin, Jung Hong Chuang, Cheng Chung Lin, Chih Chun Chen
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

The vertex correspondence establishment among multiple objects is a versatile operation in computer graphics and geometry processing. We propose a systematic method called recursive quinary subdivision to efficiently find a dissection for a meshed object of genus-zero with little user input. The process can be easily extended to multiple objects, taking into account the alignment of extra feature points for applications such as mesh metamorphosis, to derive a common dissection. Based on the dissection and the parameterization associated with each resulting patch, uniform or adaptive remeshing can be performed to yield a set of semi-regular meshes. Moveover, geometric details can be easily resampled and stored as normal maps. We demonstrate the mesh metamorphosis application between two or more objects based on the vertex correspondence established by the common dissection and parameterization.
A Generic Framework for Modeling Resources with UML
Authors: Bran Selic
Venue: Computer (2000)

Current wisdom encourages designers to first focus on the logical aspects of their problem and then defer platform and technology issues until the concluding phases of development. This behavior is reasonable, considering that devising logically sound solutions is frequently the most difficult aspect of development. Unfortunately--and this has been understated to date--there are many situations in which this approach is inappropriate. Real-time software design is one domain where this situation is particularly obvious because the domain's requirements force software to interact with the physical world in some way. Recently, a generic object-oriented framework has been proposed for modeling both physical and logical resources. Although the framework is generic, it is mainly used with the industry-standard unified modeling language (UML). By providing a standard means for representing resources and their attributes, it becomes possible to seamlessly transfer UML models of real-time systems between design and specialized analysis tools. The author shows how developers can use the OMG's UML to model resources and thus predict crucial system properties before fully implementing a system.
The minimum forcing number for the torus and hypercube
Authors: Matthew E. Riddle
Venue: Discrete Mathematics (2002)

Let G be a graph with a perfect matching M. Define the forcing number of M in G to be the smallest size of a subset S ⊆ M that is in no other perfect matching. In this paper, we present a property of bipartite graphs G that acts as a lower bound on the forcing number of perfect matchings in G. We then apply this to the torus and the hypercube, proving that the minimum forcing number of a perfect matching on a 2m × 2n torus with m ≥ n is 2n, and that the minimum forcing number on an n-dimensional hypercube is 2n/4 if n is even.
A Query Model to Synthesize Answer Intervals from Indexed Video Units
Authors: Sujeet Pradhan, Keishi Tajima, Katsumi Tanaka
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

While a query result in a traditional database is a subset of the database, in a video database, it is a set of subintervals extracted from the raw video sequence. It is very hard, if not impossible, to predetermine all the queries that will be issued in the future, and all the subintervals that will become necessary to answer them. As a result, conventional query frameworks are not applicable to video databases. In this paper, we propose a new video query model that computes query results by dynamically synthesizing needed subintervals from fragmentary indexed intervals in the database. We introduce new interval operations required for that computation. We also propose methods to compute relative relevance of synthesized intervals to a given query. A query result is a list of synthesized intervals sorted in the order of their degree of relevance.
RSIM: Simulating Shared-Memory Multiprocessors with ILP Processors
Authors: Christopher J. Hughes, Vijay S. Pai, Parthasarathy Ranganathan, Sarita V. Adve
Venue: Computer (2002)

The early 1990s saw several announcements of commercial shared-memory systems using processors that aggressively exploited instruction-level parallelism (ILP), including the MIPS R10000, Hewlett-Packard PA8000, and Intel Pentium Pro. These processors could potentially reduce memory read stalls by over-lapping read latency with other operations, possibly changing the nature of performance bottlenecks in the system.The authors' experience with Rsim demonstrates that modeling ILP features is important even in shared-memory multiprocessor systems. In particular, current simple processor-based approximations cannot model significant performance effects for applications exhibiting parallel read misses. Further, recent shared-memory designs such as aggressive implementations of sequential consistency use the aggressive ILP-enhancing features of modern processors that simple processor-based simulators do not model.As microprocessor systems become more complex, the availability of shared infrastructure source code is likely to become increasingly crucial. The authors plan to release a new Rsim version shortly that will include instruction caches, TLBs, multimedia extensions, simultaneous multithreading, Rabbit fast simulation mode, and ports to Linux platforms.
A Relational Approach to Querying Data Streams
Authors: C. S. Hartzman, C. R. Watters
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

Data streams are long, relatively unstructured sequences of characters that contain information such as electronic mail or a tape backup of various documents and reports created in an office. A conceptual framework is presented, using relational algebra and relational databases, within which data streams may be queried. As information is extracted from the data streams, it is put into a relational database that may be queried in the usual manner. The database schema evolves as the user's knowledge of the content of the data stream changes. Operators are defined in terms of relational algebra that can be used to extract data from a specially defined relation that contains all or part of the data stream. This approach to querying data streams permits the integration of unstructured data with structured data. The operators defined extend the functionality of relational algebra in much the same way that the join does relative to the basic operators select, project, union, difference, and Cartesian product.
A Methodology for Evaluating Potential KBS Applications
Authors: Steven C. Laufmann, D. Michael DeVAney, Mark A. Whiting
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The AI literature contains a number of important references related to the selection of appropriate domains or problems for the application of knowledge-based-system (KBS) technology. The authors extend that previous work by identifying common principles related to selecting appropriate KBS applications. The principles are organized into a methodology for qualitatively analyzing the applicability of KBS technologies to specific problems within specific organizational environments. The principles can be used by individuals with varying levels of technical expertise in applying KBS technologies. Managers can use this procedure prior to discussing potential applications with their development staff, and technical development staff members can use to make it a detailed assessment of the salient issues for a given application. The methodology is divided into two levels of analysis, roughly corresponding to these two types of users. The authors describe the approach and directions for using the procedure. A complete scoring worksheet is included. After presenting the core of the procedure for each level of analysis, the authors explain how to score and interpret results and plan the direction for the next steps to be taken in a KBS development effort. The utility of this methodology is assessed.
Goal-Directed Classification Using Linear Machine Decision Trees
Authors: B. A. Draper, C. E. Brodley, P. E. Utgoff
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Recent work in feature-based classification has focused on nonparametric techniques that can classify instances even when the underlying feature distributions are unknown. The inference algorithms for training these techniques, however, are designed to maximize the accuracy of the classifier, with all errors weighted equally. In many applications, certain errors are far more costly than others, and the need arises for nonparametric classification techniques that can be trained to optimize task-specific cost functions. This correspondence reviews the linear machine decision tree (LMDT) algorithm for inducing multivariate decision trees, and shows how LMDT can be altered to induce decision trees that minimize arbitrary misclassification cost functions (MCF's). Demonstrations of pixel classification in outdoor scenes show how MCF's can optimize the performance of embedded classifiers within the context of larger image understanding systems.
What's So Bad About Rule-Based Programming?
Venue: IEEE Software (1991)

The frustration expressed by some leading researchers in the field with the limited number of large systems deployed based on expert-systems technology is addressed. It is argued that the problem is related to the inherent nature of rule-based programming. It is maintained that systems developed with the rule-based paradigm are unmaintainable, untestable, and unreliable. It is concluded that unless knowledge engineering has a set of mechanisms to address reliability and maintainability, it is headed for a crisis.
DBMS Support for Nonmetric Measurement Systems
Authors: N. A. Lorentzos
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

In commercial DBMSs, it is possible to model only primitive numeric data types and perform arithmetic between them. In practice, however, organizations need to store and manipulate more complex numeric elements that could be interpreted as representing quantities of a non-numeric measurement system like that in which a distance is expressed in feet and inches, or like that in which a weight is expressed in quarters, stones, pounds, and ounces. This implies that users have to choose between two options, either to abandon the nonmetric system and completely adapt their applications to the limited capabilities of the DBMS, or to write their own pieces of code for the management of such more complex numeric data types. The first approach is principally unacceptable, and at the same time, there is a loss in the precision of arithmetic operations, because quantities have to be expressed as real numbers. The second one is tedious, because distinct pieces of code have to be written for handling different nonmetric units. Furthermore, integrity checking for these pieces of data has to be performed by application programs rather than by the DBMS. To overcome these problems, a new generic data type is proposed, the composite number, whose support automatically enables the use of any nonmetric measurement system. Functions and operations are defined for the management of composites. Because, in practice, time is usually expressed in many distinct nonmetric measurement units whose choice depends on the particular application, temporal databases represent one of the many application areas of the proposed formalization.
Easy Algorithm Animation on the Web
Authors: Erkki Sutinen, Jorma Tarhio, Tommi Teräsvirta
Venue: Multimedia Tools and Applications (2003)

The animation environment Jeliot automates visualization of algorithms over the Internet. The user can visualize algorithms of his own, not merely the selection supplied by a service provider. Jeliot is based on self-animating data types: the user selects the data objects of the source code to be visualized, and Jeliot produces the animation based on operations performed on those types. We present the design of Jeliot and the principles of its implementation. In addition, we discuss the educational applications of Jeliot.
Systematic Methods for the Computation of the Directional Fields and Singular Points of Fingerprints
Authors: Asker M. Bazen, Sabih H. Gerez
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The first subject of this paper is the estimation of a high resolution directional field of fingerprints. Traditional methods are discussed and a new method, based on principal component analysis, is proposed. The method not only computes the direction in any pixel location, but its coherence as well. It is proven that this method provides exactly the same results as the ¿averaged square-gradient method¿ that is known from literature. Undoubtedly, the existence of a completely different equivalent solution increases the insight into the problem's nature. The second subject of this paper is singular point detection. A very efficient algorithm is proposed that extracts singular points from the high-resolution directional field. The algorithm is based on the Poincaré index and provides a consistent binary decision that is not based on postprocessing steps like applying a threshold on a continuous resemblance measure for singular points. Furthermore, a method is presented to estimate the orientation of the extracted singular points. The accuracy of the methods is illustrated by experiments on a live-scanned fingerprint database.
Testing the 500-MHz IBM S/390 Microprocessor
Authors: Thomas G. Foote, Dale E. Hoffman, William V. Huott, Timothy J. Koprowski, Mary P. Kusko, Bryan J. Robbins
Venue: IEEE Design Test (1998)

This article describes the design-for-test framework of the 500MHz CMOS central processor (CP) used in the IBM Generation-5 S/390 ??line of servers. It will describe details of modeling logic to achieve correct and effective tests as well as describe the test sets required to test all portions of the design. This includes built-in self-test, array self-test, weighted random pattern generation, algorithmic pattern generation, and manual patterns. Tests are used to detect faults, static and dynamic, and to debug/ diagnose chip failures characteristic to the function under test. The described tests ensure the highest reliability for the components within the system. Some of the same test patterns are applied in chip manufacturing and in system level test. The tests developed for the 500MHz chip are very similar to those developed for the 400MHz Generation-4 S/390 chips.The improvements made to the test of the 500MHz chip were to run more patterns, and run them more efficiently in manufacturing. high quality standards but minimize test costs including minimizing dependencies on expensive test equipment. Tester time is minimized with an effective test pattern set while maintaining well over 99% stuck fault test coverage. Extensive testing begins at the wafer level, continues on a temporary single chip carrier, next to the MCM level and finally at the system level. The end result is a thoroughly tested, affordable, and highly diagnosable design.
Shared Memory vs. Message Passing: The COMOPS Benchmark Experiment
Authors: Yong Luo
Venue: The Journal of Supercomputing (1999)

This paper presents the comparison of the COMOPS benchmark performance in MPI and shared memory on four different shared memory platforms: the DEC AlphaServer 8400/300, the SGI Power Challenge, the SGI Origin2000, and the HP-Convex Exemplar SPP1600. The paper also qualitatively analyzes the obtained performance data based on an understanding of the corresponding architecture and the MPI implementations. Some conclusions are made for the inter-processor communication performance on these four shared memory platforms.
Exploring Alternatives During Requirements Analysis
Authors: John Mylopoulos, Lawrence Chung, Stephen Liao, Huaiqing Wang, Eric Yu
Venue: IEEE Software (2001)

Goal-oriented requirements analysis techniques provide ways to refine organizational and technical objectives, to more effectively explore alternatives during requirements definition. After selecting a set of alternatives to achieve these objectives, you can elaborate on them during subsequent phases to make them more precise and complete.
Combined Polynomial Transform and Radix-q Algorithm for Multi-dimensional DCT-III
Authors: Yonghong Zeng, Guoan Bi, Zhiping Lin
Venue: Multidimensional Systems and Signal Processing (2002)

By combining the polynomial transform and radix-q decomposition, the paper presents a new algorithm for the type-III r-dimensional discrete Cosine transform (rD-DCT-III) with size ql1&times;ql2&times;&mldr;&times;qlr, where q is an odd prime number. The number of multiplications for computing an rD-DCT-III is approximately 1/r times that needed by the row-column method while the number of additions increase slightly. The total number of operations (additions plus multiplications) is also reduced. The proposed algorithm has a simple computational structure because it needs only 1D-DCT-III and the polynomial transform.
Building a Speech Interface to a Medical Diagnostic System
Authors: Smadar Shiffman, Alice W. Wu, Alex D. Poon, Christopher D. Lane, Blackford Middleton, Randolph A. Miller, Fred E. Masarie,  Jr., Gregory F. Cooper, Edward H. Shortliffe, Lawrence M. Fagan
Venue: IEEE Expert: Intelligent Systems and Their Applications (1991)

A description is given of the design of an interface for QMR-DT, an evolving decision-theoretic version of Quick Medical Reference, which performs diagnostic reasoning about diseases in internal medicine. QMR-DT encompasses the part of QMR's functionality that provides differential diagnoses for a set of patient characteristics, but it uses a different algorithm to compute diagnoses. The work described includes two programs that integrate off-the-shelf speech technology with programs that manipulate medical terminology. The term identifier program uses an isolated-word, speaker-dependent speech product to provide an interface for entering medical findings into QMR-DT. Frame browser is an auxiliary program used by the developers of term identifier to examine frame structures. Frame browser was also used to experiment with a continuous-speech system.
A strategy for the procurement of instructional time-sharing services
Authors: Richard T. Close, Robert L. DeMichiell
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

A fully competitive procurement of time-sharing services requires considerable effort from quite a few experienced people. Although the normal measures employed in the evaluation of proposals, such as benchmarking and simulation, are known to be deficient, it is possible to use a combination of techniques to obtain satisfactory results. The development of the Request for Proposal (RFP) to include the plan for evaluation is crucial to the procurement effort. In this regard the RFP is continually being clarified and updated during the procurement. Effective organization and division of labor can be used to produce unbiased evaluations from several viewpoints. The technique of requesting a best and final offer was found to produce more responsive proposals for the final analysis. By carefully structuring the mandatory and desirable features, a point scoring scheme is feasible in which the best overall proposal is identified in an unambiguous fashion. Besides significant cost reductions, the procurement has produced a more comprehensive level of services and a greater inclination of both users and suppliers to develop significant applications.
When Is the Shape of a Scene Unique Given Its Light-Field: A Fundamental Theorem of 3D Vision?
Authors: Simon Baker, Terence Sim, Takeo Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

The complete set of measurements that could ever be used by a passive 3D vision algorithm is the plenoptic function or light-field. We give a concise characterization of when the light-field of a Lambertian scene uniquely determines its shape and, conversely, when the shape is inherently ambiguous. In particular, we show that stereo computed from the light-field is ambiguous if and only if the scene is radiating light of a constant intensity (and color, etc.) over an extended region.