ppxscal/embedding_network huggingface dataset:
Partial Evaluation of the Euclidean Algorithm, Revisited
Authors: C. S. Lee
Venue: Higher-Order and Symbolic Computation (1999)

The usual formulation of the Euclidean Algorithm is not well-suited to be specialized with respect to one of its arguments, at least when using offline partial evaluation. This has led Danvy and Goldberg to reformulate it using bounded recursion. In this article, we show how The Trick can be used to obtain a formulation of the Euclidean Algorithm with good binding-time separation. This formulation of the Euclidean Algorithm specializes effectively using standard offline partial evaluation.
Real-Time Current Testing for A/D Converters
Authors: Yukiya Miura
Venue: IEEE Design Test (1996)

This article describes a method for testing A/D converters using current testing. This method achieves real-time current testing without any need to analyze the results of testing. We also examine the effectiveness of fault detection by current testing combined with variable power supply voltage testing. The current testing used in this article measures the integral of the power supply current during one clock period when a test vector is applied. The target circuit is a 2-bit CMOS A/D converter and target faults are resistive bridging faults and resistive-capacitive breaking faults. Simulation results show that a step-voltage input stimulus is effective for detecting these faults in the A/D converter because this input stimulus allows the current to be measured at discrete time intervals. Moreover, in a variable power supply voltage environment, fault detection by current testing becomes easier as the power supply voltage becomes higher.
Large Eddy simulations of a stirred tank using the lattice Boltzmann method on a nonuniform grid
Authors: Zhenyu Lu, Ying Liao, Dongying Qian, J. B. McLaughlin, J. J. Derksen, K. Kontomaris
Venue: Journal of Computational Physics (2002)

A nonuniform grid lattice Boltzmann technique previously described by He et al. [1] has been extended to simulate three-dimensional flows in complex geometries. The technique is applied to the computation of the turbulent flow in a stirred tank driven by a standard Rushton turbine. With the nonuniform grid approach, the total CPU time required for a simulation of the flow in a stirred tank can be reduced by roughly 75% and still provide the same spatial accuracy as would be obtained with a uniform high-resolution grid. Statistical results for the computed flow fields will be compared with experimental results (H. Wu and G. K. Patterson, Chem. Eng. Sci. 44, 2207 (1989)) and with simulations by J. G. M. Eggels (Int. J. Heat Fluid Flow 17, 307 (1996)) and J. J. Derksen and H. E. A. Van den Akker (AIChE J. 45, 209 (1999)). The results of the nonuniform mesh simulation are in reasonable agreement with the available experimental data and the results of previous simulations.
Constraint-Based Query Evaluation in Deductive Databases
Authors: J. Han
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Constraints play an important role in the efficient query evaluation in deductive databases. Constraint-based query evaluation in deductive databases is investigated, with emphasis on linear recursions with function symbols. Constraints are grouped into three classes: rule constraints, integrity constraints, and query constraints. Techniques are developed for the maximal use of different kinds of constraints in rule compilation and query evaluation. The study on the roles of different classes of constraints in set-oriented evaluation of linear recursions shows the following: rule constraints should be integrated with their corresponding deduction rules in the compilation of recursions; integrity constraints, including finiteness constraints and monotonicity constraints, should be used in the analysis of finite evaluability and termination for specific queries; and query constraints, which are often useful in search space reduction and termination, should be transformed, when necessary, and should be pushed into the compiled chains as deeply as possible for efficient evaluation. The constraint-based query-processing technique integrates query-independent compilation and chain-based query evaluation methods and demonstrates its great promise in deductive query evaluation.
Testing Iterative Logic Arrays for Sequential Faults with a Constant Number of Patterns
Authors: Chih-Yuang Su, Cheng-Wen Wu
Venue: IEEE Transactions on Computers (1994)

Shows that a constant number of test vectors are sufficient for fully testing a k-dimensional ILA for sequential faults if the cell function is bijective. The authors then present an efficient algorithm to obtain such a test sequence. By extending the concept of C-testability and M-testability to sequential faults, the constant-length test sequence can be obtained. A pipelined array multiplier is shown to be C-testable with only 53 test vectors for exhaustively testing the sequential faults.
Segmenting Handwritten Signatures at Their Perceptually Important Points
Authors: J. J. Brault, R. Plamondon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A new algorithm for segmenting continuous handwritten signatures sampled by a digitizer is described. The segmentation points are found using a two-step procedure. The principal step is to construct a function that weights the perceptual importance of every signature point according to its specific neighboring points. The second step points out the various local maxima of this function that correspond to where the signature should be segmented. The method is well illustrated and tested on a number of signatures that require different kinds of segmentation decisions.
On the superconnectivity of generalized p-cycles
Authors: C. Balbuena, I. Pelayo, J. Gómez
Venue: Discrete Mathematics (2002)

A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. Any digraph can be shown as a p-cycle with p = 1, and bipartite digraphs are generalized p-cycles with p = 2. A maximally connected digraph is said to be superconnected if every disconnecting set of δ vertices or edges is trivial, where δ stands for the minimum degree. In this work, we study the problem of disconnecting p-cycles by removing nontrivial subsets of vertices or edges. To be more precise, after obtaining optimal lower bounds for the parameters k1,λ1, that measure the superconnectivities, we present sufficient conditions for a p-cycle to be superconnected, and also sufficient conditions to guarantee optimum values of superconnectivities of a p-cycle. Finally, we apply our results to compute the superconnectivities of the family of De Bruijn generalized cycles.
Designing for Parallel Fuzzy Computing
Authors: Giuseppe Ascia, Vincenzo Catania, Biagio Giacalone, Marco Russo, Lorenzo Vita
Venue: IEEE Micro (1995)

This article presents the design of a VLSI fuzzy processor which is capable of performing fuzzy inferences. An analysis of inference methods and their computational complexity has led to the definition of an inference technique which optimizes processing times. The results of this analysis also dictated our choice of the architecture for the processor. The main features of the architecture are: pre-processing of inferences to reduce the number of rules to be processed; parallel computation of the degree of activation of the active rules and scalability. The performance obtainable is in the order of 320KFLIPS (256 rule, 8 inputs, 2 output).
Metal lift-off using physical vapour deposition
Authors: J. O'Sullivan, S. Burgess, N. Rimmer
Venue: Microelectronic Engineering (2002)

Modelling and experimental work have been used to optimise the lift-off process with physical vapour deposition (PVD) metallisation. This work shows that by optimising both the resist profile and the PVD conditions lift-off results similar to evaporation can be achieved. Other advantages of PVD over evaporation are discussed which make PVD the metallisation technique of choice.
Mexitl: Multimedia in Executable Interval Temporal Logic
Authors: Howard Bowman, Helen Cameron, Peter King, Simon Thompson
Venue: Formal Methods in System Design (2003)

This paper explores a formalism for describing a wide class of multimedia document constraints, based on an interval temporal logic. We describe the requirements that arise from the multimedia documents application area, and we illustrate these requirements using several examples. Then we present the temporal logic formalism that we use. This logic extends existing interval temporal logic with a number of new features: actions, framing of actions, past operators, a projection-like operator called filter and a new handling of interval length. The notation is applied to the specification of the examples, and in particular a set of logical manipulations, providing feedback to an author, is presented. A model theory, logic and satisfaction relation are defined for the notation.
Grove: a production-optimised foliage generator for "The Lord of the Rings: The Two Towers"
Authors: Matt Aitken, Martin Preston
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

The production of New Line Cinema's The Lord of the Rings: The Two Towers called for numerous computer generated characters which were decorated with a wide variety of foliage. This short paper describes how we were able to employ a procedural modelling and animation system, Grove, in the production of a number of the sequences in the film. In particular we will concentrate on the practicalities of implementing such technology in large scale feature film production.
Symmetry as a Continuous Feature
Authors: Hagit Zabrodsky, Shmuel Peleg, David Avnir
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Symmetry is treated as a continuous feature and a Continuous Measure of Distance from Symmetry in shapes is defined. The Symmetry Distance (SD) of a shape is defined to be the minimum mean squared distance required to move points of the original shape in order to obtain a symmetrical shape. This general definition of a symmetry measure enables a comparison of the ¿amount¿ of symmetry of different shapes and the ¿amount¿ of different symmetries of a single shape. This measure is applicable to any type of symmetry in any dimension. The Symmetry Distance gives rise to a method of reconstructing symmetry of occluded shapes. We extend the method to deal with symmetries of noisy and fuzzy data. Finally, we consider grayscale images as 3D shapes, and use the Symmetry Distance to find the orientation of symmetric objects from their images, and to find locally symmetric regions in images.
Trends in Advanced Packaging Technology
Authors: J. W. Balde
Venue: Computer (1992)

Advanced packaging is shifting to greater use of multichip modules (MCMs) for applications, not just those running on mainframes. It is argued that the reasons are threefold: higher performance, smaller size, and lower cost.
Querying Multimedia Presentations Based on Content
Authors: Taekyong Lee, Lei Sheng, Tolga Bozkaya, Nevzat Hurkan Balkir, Z. Meral Özsoyoglu, Gultekin Özsoyoglu
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

In this paper, we consider the problem of querying multimedia presentations based on content information. We believe that presentations should become an integral part of multimedia database systems and users should be able to store, query, and, possibly, manipulate multimedia presentations using a single database management system software. Multimedia presentations are modeled as presentation graphs, which are directed acyclic graphs that visually specify multimedia presentations. Each node of a presentation graph represents a media stream. Edges depict sequential or concurrent playout of streams during the presentation. Information captured in each individual stream and the presentation order of streams constitute the content information of the presentation. Querying multimedia presentation graphs based on content is important for the retrieval of information from a database. We present a graph data model for the specification of multimedia presentations and discuss query languages as effective tools to query and manipulate multimedia presentation graphs with respect to content information. To query the information flow throughout a multimedia presentation, as well as in each individual multimedia stream, we use revised versions of temporal operators Next, Connected, and Until, together with path formulas. These constructs allow us to specify and query paths along a presentation graph. We present an icon-based, graphical query language, GVISUAL, that provides iconic representations for these constructs and a user-friendly graphical interface for query specification. We also present an OQL-like language, GOQL (Graph OQL), with similar constructs, that allows textual and more traditional specifications of graph queries. Finally, we introduce GCalculus (Graph Calculus), a calculus-based language that establishes the formal grounds for the use of temporal operators in path formulas and for querying presentation graphs with respect to content information. We also discuss GCalculus/S (GCalculus with sets) which avoids highly complex query expressions by eliminating universal path quantifier, the negation operator, and the universal quantifier. GCalculus/S represents the formal basis for GVISUAL, i.e., GVISUAL uses the constructs of GCalculus/S directly.
HIFI: Hypertext Interface for Information Systems
Authors: Umberto Cavallaro, Franca Garzotto, Paolo Paolini, Domenico Totaro
Venue: IEEE Software (1993)

HIFI is one of the Esprit III information-processing system and software projects. The goal of HIFI is to create a set of tools that can be used to cheaply and quickly build a hypertext-like interface on top of an external database-information system. The interface provides interactive navigational access to information both within a database of one kind and across databases of different kinds, including multimedia. HIFI's model for the navigational interface, mapping strategy to map the interface model to database structures, and architecture for the execution tools are discussed.
A Formal Process for Evaluating COTS Software Products
Authors: Patricia K. Lawlis, Kathryn E. Mark, Deborah A. Thomas, Terry Courtheyn
Venue: Computer (2001)

A software-product evaluation process grounded in mathematics and decision theory can effectively determine product quality and suitability with less risk and at lower cost than conventional methods. Thus, the authors seek to develop a formal process for effective software-product evaluation to assess commercial-off-the-shelf product quality and suitability before purchase. They propose a requirements-based COTS product evaluation process, RCPEP, that ensures a quality outcome, then demonstrate its use in a case study of a US Air Force product for a large, component-based training-management system. The authors describe how, unlike a typical ad hoc product evaluation, RCPEP relies on user-defined requirements to determine product suitability and quality. RCPEP identifies every product that addresses the requirements, conducts a trade study to narrow the list to serious candidates, and evaluates the remaining candidates using hands-on scenarios. An ad hoc process does not adhere to strict controls that ensure all candidate products receive identical evaluations and generate comparable results. In contrast, RCPEP's hands-on evaluation includes several controls that ensure the evaluation does not compromise the results' validity. The Air Force case study confirmed the authors' expectation that the simplest form of decision analysis, weighted averages, could effectively evaluate COTS products. RCPEP succeeded because it relied on user-defined requirements, contained a sufficient number of evaluators to obtain valid quantitative results, and adhered to the controls. The authors believe that RCPEP will be effective for all forms of COTS product evaluations and could mature into an industry standard.
Pentium Pro Processor Design for Test and Debug
Authors: Adrian Carbine, Derek Feltham
Venue: IEEE Design Test (1998)

This article describes the Design for Test (DFT) and silicon debug features of the Pentium Pro processor, and its production test development methodology. The need to quickly ramp a complex, high-performance microprocessor into high-volume manufacturing with low defect rates led the design team to a custom low-area DFT approach, coupled with a manually-written test methodology which targeted several fault models. Results show that this approach was effective in balancing testability needs with other design constraints, while enabling excellent time to market and test quality.
CURVAZ: a program to calculate magnitude and direction of maximum structural curvature and fracture-flow index
Authors: Sait Ismail Özkaya
Venue: Computers Geosciences (2002)

The total aperture of fold-related extensional fractures within a unit distance is proportional to the structural curvature, which is approximately equal to the second derivative. Eigenvalues and vectors of a Jacobian matrix of a structural surface correspond to magnitude and direction of the maximum and minimum second derivatives. The Jacobian matrix can be determined from structural grid data and used to evaluate both direction and magnitude of principal curvatures and total fracture aperture per unit distance. Two orthogonal sets of extensional fractures are associated with a dome-shaped fold. The main set of extensional fractures strikes perpendicular to the maximum structural curvature. A secondary set of extensional fractures may also be present perpendicular to the minimum curvature. Knowing the direction of extensional fractures also allows the calculation of the aperture reduction as a function of the in-situ stress ratio and angle between fractures and maximum in-situ stress orientation. A computer program, CURVAZ, is introduced to find the direction and the aperture of extensional fractures from second derivatives of a structural surface. The program modifies apertures using in-situ stress information and calculates a fracture-flow index (FFI). The results are presented as stick plot maps, which show both the direction and the magnitude of principal curvatures or FFI.
Digital Signature Proposal for Mixed-Signal Circuits
Authors: Anna Maria Brosa, Joan Figueras
Venue: Journal of Electronic Testing: Theory and Applications (2001)

A new Built-In Self-Test structure, based on the information provided by the XY-operation (Lissajous curves) is introduced in this paper. A Digital Signature is obtained which is used to discriminate catastrophic as well as parametric defects. High Fault Coverage is achieved when applying the proposed BIST on an ITC'97 benchmark circuit where 92% of the catastrophic defects and 87.5% of the parametric defects analyzed produced digital signatures clearly distinguishable from the golden signature.
A Spatio-Temporal Semantic Model for Multimedia Database Systems and Multimedia Information Systems
Authors: Shu-Ching Chen, R. L. Kashyap
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

As more information sources become available in multimedia systems, the development of abstract semantic models for video, audio, text, and image data becomes very important. An abstract semantic model has two requirements: It should be rich enough to provide a friendly interface of multimedia presentation synchronization schedules to the users and it should be a good programming data structure for implementation in order to control multimedia playback. An abstract semantic model based on an augmented transition network (ATN) is presented. The inputs for ATNs are modeled by multimedia input strings. Multimedia input strings provide an efficient means for iconic indexing of the temporal/spatial relations of media streams and semantic objects. An ATN and its subnetworks are used to represent the appearing sequence of media streams and semantic objects. The arc label is a substring of a multimedia input string. In this design, a presentation is driven by a multimedia input string. Each subnetwork has its own multimedia input string. Database queries relative to text, image, and video can be answered via substring matching at subnetworks. Multimedia browsing allows users the flexibility to select any part of the presentation they prefer to see. This means that the ATN and its subnetworks can be included in multimedia database systems which are controlled by a database management system (DBMS). User interactions and loops are also provided in an ATN. Therefore, ATNs provide three major capabilities: multimedia presentations, temporal/spatial multimedia database searching, and multimedia browsing.
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
Authors: Chao-Ju Hou, K. G. Shin
Venue: IEEE Transactions on Computers (1994)

Consideration is given to the problem of designing and incorporating a timeout mechanism into load sharing (LS) with state-region change broadcasts in the presence of node failures in a distributed real-time system. Failure of a node is diagnosed by the other nodes through communication timeouts, and the timeout period used to diagnose whether a node is faulty or not usually depends on the dynamic changes in system load, the task attributes at the node, and the state the node was initially in. We formulate the problem of determining the "best" timeout period T/sub out//sup (i)/ for node i as a hypothesis testing problem, and maximize the probability of detecting node failures subject to a pre-specified probability of falsely diagnosing a healthy node as faulty. The parameters needed for the calculation of T/sub out//sup (i)/ are estimated online by node i using the Bayesian technique and are piggy-backed in its region-change broadcasts. The broadcast information is then used to determine T/sub out//sup (i)/. If node n has not heard from node i for T/sub out//sup (i)/ since its receipt of the latest broadcast from node i, it will consider node i failed, and will not consider any task transfer to node i until it receives a broadcast message from node i again. On the other hand, to further reduce the probability of incorrect diagnosis, each node n also determines its own timeout period T/sub out//sup (n)/, and broadcasts its state not only at the time of state-region changes but also when it has remained within a broadcast interval throughout T/sub out//sup (n)/.
A Practical Approach to Dynamic Load Balancing
Authors: Jerrell Watts, Stephen Taylor
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

This paper presents a cohesive, practical load balancing framework that improves upon existing strategies. These techniques are portable to a broad range of prevalent architectures, including massively parallel machines, such as the Cray T3D/E and Intel Paragon, shared memory systems, such as the Silicon Graphics PowerChallenge, and networks of workstations. As part of the work, an adaptive heat diffusion scheme is presented, as well as a task selection mechanism that can preserve or improve communication locality. Unlike many previous efforts in this arena, the techniques have been applied to two large-scale industrial applications on a variety of multicomputers. In the process, this work exposes a serious deficiency in current load balancing strategies, motivating further work in this area.