ppxscal/embedding_network huggingface dataset:
Temporal Specialization and Generalization
Authors: C. S. Jensen, Richard Thomas Snodgrass
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

A standard relation has two dimensions: attributes and tuples. A temporal relation contains two additional orthogonal time dimensions: valid time records when facts are true in the modeled reality, and transaction time records when facts are stored in the temporal relation. Although there are no restrictions between the valid time and transaction time associated with each fact, in many practical applications the valid and transaction times exhibit restricted interrelationships that define several types of specialized temporal relations. This paper examines areas where different specialized temporal relations are present. In application systems with multiple, interconnected temporal relations, multiple time dimensions may be associated with facts as they flow from one temporal relation to another. The paper investigates several aspects of the resulting generalized temporal relations, including the ability to query a predecessor relation from a successor relation. The presented framework for generalization and specialization allows one to precisely characterize and compare temporal relations and the application systems in which they are embedded. The framework's comprehensiveness and its use in understanding temporal relations are demonstrated by placing previously proposed temporal data models within the framework. The practical relevance of the defined specializations and generalizations is illustrated by sample realistic applications in which they occur. The additional semantics of specialized relations are especially useful for improving the performance of query processing.
Sequential Model Criticism in Probabilistic Expert Systems
Authors: R. G. Cowell, A. P. Dawid, D. J. Spiegelhalter
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Probabilistic expert systems based on Bayesian networks require initial specification of both qualitative graphical structure and quantitative conditional probability assessments. As (possibly incomplete) data accumulate on real cases, the parameters of the system may adapt, but it is also essential that the initial specifications be monitored with respect to their predictive performance. A range of monitors based on standardized scoring rules that are designed to detect both qualitative and quantitative departures from the specified model is presented. A simulation study demonstrates the efficacy of these monitors at uncovering such departures.
Mastering Red Hat Linux 7.1, 2nd edition
Authors: Arman Danesh
Venue:  (2001)

:Join the Red Hat Revolution! Newly revised and updated, Mastering Red Hat Linux is the essential guide to the world's leading Linux distribution. Inside, you'll find everything you need to know to install, configure, use, and optimize Red Hat Linux. You'll even find the operating system itself-the Publisher's Edition of Red Hat Linux 7.1, absolutely free on the enclosed CD! Whatever you want to achieve with Linux, Mastering Red Hat Linux makes it easy, providing the clear instruction and unique insights of a Linux expert who understands the needs of the non-Unix world. Coverage includes: Installing Red Hat Linux Configuring and using the GNOME and KDE graphical user interfaces Configuring and using X Windows v. 4 Using Linux commands Managing files in Linux Connecting to the Internet and sending email with Linux Using Netscape 6 for Linux Faxing from Linux Using Linux on a LAN Using Linux as part of a Windows network Connecting and configuring USB peripherals Creating a Linux Web server Setting up and using a Linux mail server Running DOS and Windows applications using Vine Configuring your Linux system with Linuxconf Re-compiling the Linux kernel On the enclosed CD, you'll find the Publisher's Edition of Red Hat Linux 7.1, the world's most popular Linux distribution. This is a non-expiring version that you can install and use for as long as you like.
Artificial Intelligence: Where Has it Been, and Where is it Going?
Authors: H. A. Simon
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The directions for near-future development of artificial intelligence (AI) can be described in terms of four dichotomies: the use of reasoning versus the use of knowledge; the roles of parallel and of serial systems; systems that perform and systems that learn to perform; and programming languages derived from the search metaphor versus languages derived from the logical reasoning metaphor. Although the author believes that there are reasons for emphasizing knowledge systems (production systems) that are serial, capable of expert performance, and designed in terms of the search metaphor, the other pathways are also important and should not be ignored. In particular, empirical work is needed in the construction and empirical testing of the performance of large systems to explore all of these branching pathways.
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
Authors: Hsing-Lung Chen, Nian-Feng Tzeng
Venue: IEEE Transactions on Computers (1994)

While a certain resource in the hypercube may be shared by cube nodes to lower the cost, multiple copies of a shared resource often exist in the hypercube to reduce contention, and thus the potential delay, in fetching any shared copy. It is desirable that one employs as few resource copies as possible to ensure that every node is able to reach the resource in a given number of hops, achieving efficient resource placement. This placement method also keeps system performance degradation minimal after one resource copy becomes unavailable due to a fault. First, we consider placing multiple copies of a certain resource in a way that every cube node without the resource is adjacent to a specified number of resource copies. The use of our developed perfect and quasiperfect multiple-adjacency codes makes it possible to arrive at efficient solutions to this placement problem in a simple and systematic manner for an arbitrary hypercube. We then deal with the generalized resource placement in the hypercube such that every node without the resource can reach no less than a specified number of resource copies in no more than a certain number of hops, using as few resource copies as possible. Our placement results yield lowest potential access contention for a given number of resource copies (i.e., cost), particularly useful for large-scale hypercubes.
Quantifying Design Quality Through Design Experiments
Authors: Einar J. Aas, Tore Steen, Karl Klingsheim
Venue: IEEE Design Test (1994)

The authors present a model for design quality metrics, discuss its relevance, and give some examples of use. Design experiments demonstrate error data extraction and analysis. Using a model of the design process for electronic products that emphasizes the resulting quality of the design, the authors demonstrated that they can quantify design quality. They can best express the probability of an error-free design in terms of the quality of the synthesis process and the quality of the verification procedure.
Current Approaches for Solving Over-Constrained Problems
Authors: Pedro Meseguer, Noureddine Bouhmala, Taoufik Bouzoubaa, Morten Irgens, Martí Sánchez
Venue: Constraints (2003)

We summarize existing approaches to model and solve overconstrained problems. These problems are usually formulated as combinatorial optimization problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization. Regarding solving methods, both systematic and local search approaches are considered. Finally we review a number of case studies on overconstrained problems taken from the specialized literature.
FPGA and CPLD Architectures: A Tutorial
Authors: Stephen Brown, Jonathan Rose
Venue: IEEE Design Test (1996)

This article provides a tutorial survey of architectures of commercially available high-capacity field-programmable devices (FPDs), and gives a summary of recent research results in the field. In the survey section, we first define the relevant terminology in the field and then describe the recent evolution of FPDs. The three main categories of FPDs are delineated: Simple PLDs (SPLDs), Complex PLDs (CPLDs) and Field-Programmable Gate Arrays (FPGAs). We then give details of the architectures of all of the most important commercially available chips. The second part of the article gives an overview of the most important research results on FPD architecture over the past six years, and provides suggestions as to features that may be included in future architectures.
Vector Quantization Technique for Nonparametric Classifier Design
Authors: Q. Xie, C. A. Laszlo, R. K. Ward
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An effective data reduction technique based on vector quantization is introduced for nonparametric classifier design. Two new nonparametric classifiers are developed, and their performance is evaluated using various examples. The new methods maintain a classification accuracy that is competitive with that of classical methods but, at the same time, yields very high data reduction rates.
On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints
Authors: Deng-Jyi Chen, Min-Sheng Lin
Venue: IEEE Transactions on Computers (1994)

Presents an algorithm for computing the reliability of distributed computing systems (DCS). The algorithm, called the Fast Reliability Evaluation Algorithm, is based on the factoring theorem employing several reliability preserving reduction techniques. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economical in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.
Learning Distributed Representations of Concepts Using Linear Relational Embedding
Authors: Alberto Paccanaro, Geoffrey E. Hinton
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In this paper, we introduce Linear Relational Embedding as a means of learning a distributed representation of concepts from data consisting of binary relations between these concepts. The key idea is to represent concepts as vectors, binary relations as matrices, and the operation of applying a relation to a concept as a matrix-vector multiplication that produces an approximation to the related concept. A representation for concepts and relations is learned by maximizing an appropriate discriminative goodness function using gradient ascent. On a task involving family relationships, learning is fast and leads to good generalization.
Perceptron Learning Revisited: The Sonar Targets Problem
Authors: Martina Hasenjäger, Helge Ritter
Venue: Neural Processing Letters (1999)

Recently it was pointed out that a well-known benchmark data set, the sonar target data, indeed is linearly separable. This fact comes somewhat surprising, since earlier studies involving delta rule trained perceptrons did not achieve the separation of the training data. These results immediately raise the question of why a perceptron with a continuous activation function may fail to recognize linear separability and how to remedy this failure. The study of these issues directly leads to a performance comparison of a wide variety of different perceptron training procedures on real world data.
Nonlinear transport in quantum point contact structures
Authors: A. E. Krishnaswamy, S. M. Goodnick, M. N. Wybourne, C. Berven
Venue: Microelectronic Engineering (2002)

We have investigated the magnetotransport properties under nonlinear conditions in quantum point contact structures fabricated on high mobility A1GaAs/GaAs two-dimensional electron gas (2DEG) layers. Non-linearities in the I-V characteristics are observed at the threshold for conduction when biased initially from the tunneling regime as observed previously. We observe that this non-ideality is enhanced by a magnetic field normal to the plane of the 2DEG. This behavior is interpreted in terms of corrections to the Landauer model extended to nonequilibrium conditions.
Guest Editors' Introduction: Preserve or Redesign Legacy Systems?
Authors: Norman F. Schneidewind, Christof Ebert
Venue: IEEE Software (1998)

Legacy software systems represent a significant investment but often become difficult to maintain as they age. Not only does technology evolve beyond them, but business needs change and may require adding or modifying functions. This introduction addresses the question of whether to maintain or replace a legacy system, and gives an overview of the alternatives in dealing with our software legacies.
The Design, Implementation, and Performance Evaluation of BERMUDA
Authors: Y. E. Ioannidis, M. M. Tsangaris
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We describe the design and implementation of BERMUDA, which is a loosely coupled system interfacing Prolog to the Britton-Lee Intelligent Database Machine (IDM-500). BERMUDA allows multiple concurrent Prolog processes, possibly running on different machines, to share a database. In addition, it preserves the semantics of Prolog programs and makes the use of the database system transparent to the user. We discuss several architectural issues faced by such systems and the approach adopted for each one in BERMUDA. We also present the performance results of a variety of experiments with the system. These include single-user benchmarks of BERMUDA against stand-alone Prolog and stand-alone IDM, detailed profiling of the costs of the modules of BERMUDA that shows the overhead imposed by the interface, and multiuser benchmarks of BERMUDA that show how the system behaves under heavier load. These experiments demonstrate the effectiveness of loosely coupled systems in general and of BERMUDA specifically. They also help in the identification of some aspects of the design and implementation of BERMUDA that could be improved.
Type II Matrices and Their Bose-Mesner Algebras
Authors: Rie Hosoya, Hiroshi Suzuki
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

Type II matrices were introduced in connection with spin models for link invariants. It is known that a pair of Bose-Mesner algebras (called a dual pair) of commutative association schemes are naturally associated with each type II matrix. In this paper, we show that type II matrices whose Bose-Mesner algebras are imprimitive are expressed as so-called generalized tensor products of some type II matrices of smaller sizes. As an application, we give a classification of type II matrices of size at most 10 except 9 by using the classification of commutative association schemes.
Test Development for Second-Generation ColdFire Microprocessors
Authors: Dale Amason, Alfred L. Crouch, Renny Eisele, Grady Giles, Michael Mateja
Venue: IEEE Design Test (1998)

A case study of the development of the design for test methodology of the second generation of the ColdFire(r) Microprocessor family is described from the viewpoint of goals, initial strategy, and implementation. Methodology includes at-speed scan path design, path delay testing, IDDQ, and direct access test modes for embedded memories. Scan tests are applied with timing identical to that specified for peak performance normal operation.
Synthesis of operation-centric hardware descriptions
Authors: James C. Hoe, Arvind
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Most hardware description frameworks, whether schematic or textual, use cooperating finite state machines (CFSM) as the underlying abstraction. In the CFSM framework, a designer explicitly manages the concurrency by scheduling the exact cycle-by-cycle interactions between multiple concurrent state machines. Design mistakes are common in coordinating interactions between two state machines because transitions in different state machines are not semantically coupled. It is also difficult to modify one state machine without considering its interaction with the rest of the system.This paper presents a method for hardware synthesis from an "operation centric" description, where the behavior of a system is described as a collection of "atomic" operations in the form of rules. Typically, a rule is defined by a predicate condition and an effect on the state of the system. The atomicity requirement simplifies the task of hardware description by permitting the designer to formulate each rule as if the rest of the system is static.An implementation can execute several rules concurrently in a clock cycle, provided some sequential execution of those rules can reproduce the behavior of the concurrent execution. In fact, detecting and scheduling valid concurrent execution of rules is the central issue in hardware synthesis from operation-centric descriptions. The result of this paper shows that an operation-centric framework offers significant reduction in design time, without loss in implementation quality.
A natural interpretation of fuzzy sets and fuzzy relations
Authors: Mamoru Shimoda
Venue: Fuzzy Sets and Systems (2002)

We present a new and natural interpretation of fuzzy sets and fuzzy relations where the basic notions and operations have quite natural meanings. We interpret fuzzy sets and fuzzy relations in a cumulative Heyting valued model for intuitionistic set theory, and define the basic notions and operations naturally in the model. As far as fuzzy sets and fuzzy relations are considered as extensions of crisp sets and relations, this interpretation seems to be most natural.In the interpretation the canonical embedding from the class of all sets into the model plays an important role. We distinguish generalized fuzzy sets, fuzzy subsets of crisp sets, and membership functions of fuzzy sets on crisp sets. Thus we present a foundation for developing a general theory of fuzzy sets where fuzzy subsets of different sets can be treated in a natural and uniform way.
On Continuous Dependence of Solutions of Impulsive Differential Inclusions and Impulse Control Problems
Authors: V. A. Plotnikov, N. M. Kitanov
Venue: Cybernetics and Systems Analysis (2002)

This article deals with problems of continuous dependence of solutions of impulsive differential inclusions on their initial conditions and right sides and of the use of these inclusions in control problems arising in systems with impulses.
Percutaneous Transluminal Septal Reduction for Hypertrophic Obstructive Cardiomyopathy: Report from an International Pilot Study
Authors: Hope E. Buell, Rodney H. Stables, Elizabeth R. Delong, Kathy B. Shuping, Donna M. Killip, Harry M. Lever, William J. Mckenna, David Rubin, Ulrich Sigwart, Morimasa Takayama, Galen S. Wagner, Eric L. Eisenstein
Venue: Journal of Medical Systems (2002)

Assessing the effectiveness of newer treatments for rare diseases can be challenging because of the small number of patients treated at individual centers. We enrolled patients undergoing percutaneous transluminal septal myocardial ablation (PTSMA) for hypertrophic obstructive cardiomyopathy (HOCM) at five international centers (1 Japan, 2 United Kingdom, and 2 United States). Our study group developed standard data definitions regarding clinical symptom severity, previous HOCM treatment, procedure status, and outcome, and entered patient data directly into a shared, web-based registry system. In the first 10 months of 1998, 51 patients were enrolled in our registry, with 47 ultimately receiving the PTSMA procedure. Although HOCM is consider a single disease, there were significant differences among centers in patient characteristics (age, gender, and family history of HOCM), symptom severity, diagnostic techniques (measurements taken after provocation), and treatment (amount of alcohol used, timing of injection, and number of branches attempted).
A portable debugger for parallel and distributed programs
Authors: Doreen Cheng, Robert Hood
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We describe the design and implementation of a portable debugger for parallel and distributed programs. The design incorporates a client-server model in order to isolate non-portable debugger code from the user interface. The precise definition of a protocol for client-server interaction facilitates a high degree of client portability. Replication of server components permits the implementation of a debugger for distributed computations.Portability across message passing implementations is achieved with a protocol that specifies the interaction between a message-passing library and the debugger. This permits the same debugger to be used both on PVM and MPI programs.The process abstractions used for debugging message-passing programs can be adapted to debug HPF programs at the source level. This permits the meaningful display of information obscured in tool-generated code.
A Novel Interpolation Method for Maximum Likelihood Timing Recovery
Authors: Deirdre O'Shea, Sean McGrath
Venue: Wireless Personal Communications: An International Journal (1997)

An algorithm to recover bit timing is proposed which maximises a quadratic polynomial approximation to the log-likelihood function. The exact equation for the mean of the log-likelihood function derivative, i.e. the S-curve, is derived and shown to have a sine form. In each time interval the S-curve has two zeros. The zero corresponding to the maximum of the likelihood function is resolved using quadratic interpolation based on four samples per period. The resulting timing synchroniser has a simple open loop feedforward structure which has effectively no acquisition period. Receiver performances in terms of rms timing jitter and bit error rate (BER) are analysed and shown to agree closely with theoretical results.
Characteristics of copper deposition in a supercritical CO2 fluid
Authors: E. Kondoh, H. Kato
Venue: Microelectronic Engineering (2002)

Copper films were deposited in supercfitical carbon dioxide through hydrogen reduction of Cu(hfac)2 at pressures of 10-15 MPa and temperatures of 250-400°C. Preferential deposition on conductive substrates was observed. X-ray photoelectron spectra of the films showed pronounced metallic Cu peaks and trace level of impurity elements. It was also found that the films were (111)-oriented. Copper filling into sub-half-micron high aspect ratio features was demonstrated.
Logic Approaches for Deductive Databases
Authors: Yim Yung Leung, Dik Lun Lee
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

Various ways of introducing deductive capability into a database system through the use of logic are examined. The inference mechanism of Prolog and its use in deductive databases are introduced. Different approaches to designing deductive database systems according to a taxonomy are described. Examples are provided for each approach, and their limitations are discussed.
Microlens array produced using hot embossing process
Authors: N. S. Ong, Y. H. Koh, Y. Q. Fu
Venue: Microelectronic Engineering (2002)

In this paper, the fabrication of molds that are suitable for the production of microlens arrays using the replication technique is discussed. Variation of parameters in the replication process were investigated. A focused ion beam was used to fabricate the microlens cavities on three materials, with silicon showing the best result. Hot embossing was used to produce replicated polycarbonate lens array. The temperature of the mold and the embossing force were the two parameters varied. The microlens array produced using the embossing replication process demonstrates the possibility of nanometre fabrication.