ppxscal/embedding_network huggingface dataset:
Teaching Design in a Computer Architecture Course
Authors: Daniel C. Hyde
Venue: IEEE Micro (2000)

This approach introduces design to computer architecture students at an appropriate, concise, high level of abstraction.
Morphing Active Contours
Authors: Marcelo Bertalmío, Guillermo Sapiro, Gregory Randall
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

A method for deforming curves in a given image to a desired position in a second image is introduced in this paper. The algorithm is based on deforming the first image toward the second one via a Partial Differential Equation (PDE), while tracking the deformation of the curves of interest in the first image with an additional, coupled, PDE. The tracking is performed by projecting the velocities of the first equation into the second one. In contrast with previous PDE-based approaches, both the images and the curves on the frames/slices of interest are used for tracking. The technique can be applied to object tracking and sequential segmentation. The topology of the deforming curve can change without any special topology handling procedures added to the scheme. This permits, for example, the automatic tracking of scenes where, due to occlusions, the topology of the objects of interest changes from frame to frame. In addition, this work introduces the concept of projecting velocities to obtain systems of coupled PDEs for image analysis applications. We show examples for object tracking and segmentation of electronic microscopy.
Information-Theoretic Bounds on Target Recognition Performance Based on Degraded Image Data
Authors: Avinash Jain, Pierre Moulin, Michael I. Miller, Kannan Ramchandran
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper derives bounds on the performance of statistical object recognition systems, wherein an image of a target is observed by a remote sensor. Detection and recognition problems are modeled as composite hypothesis testing problems involving nuisance parameters. We develop information-theoretic performance bounds on target recognition based on statistical models for sensors and data, and examine conditions under which these bounds are tight. In particular, we examine the validity of asymptotic approximations to probability of error in such imaging problems. Problems involving Gaussian, Poisson, and multiplicative noise, and random pixel deletions are considered, as well as least-favorable Gaussian clutter. A sixth application involving compressed sensor image data is considered in some detail. This study provides a systematic and computationally attractive framework for analytically characterizing target recognition performance under complicated, non-Gaussian models and optimizing system parameters.
The role of user services in distributed processing
Authors: Ralph W. Vincent, Harvey J. Poorbaugh
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

University use of minicomputers and microcomputers is rapidly growing. Without coordination, the effectiveness of these resources will be hampered by lack of communication, interface incompatibilities, and lack of software transportability. User Services is in an ideal position to assume the leadership role in coordination and support to produce an effective utilization of these resources.
Stress control of sputter-deposited Mo-N films for micromechanical applications
Authors: H. Kattelus, J. Koskenala, A. Nurmela, A. Niskanen
Venue: Microelectronic Engineering (2002)

Sputter-deposited metallic thin films are attractive materials for micromechanics but they suffer from large stress variations within the batch or even a single wafer. The origin of such variations is in the microcrystalline structure, and specifically its dependence on sputtering geometry. It might be assumed that getting rid of the long-range atomic order in the deposited film would help in obtaining improved uniformity. The purpose of this study is to amorphise molybdenum films by nitrogen and to characterize the resulting Mo-N film properties. A partial cure for the nonuniformity of stress is, indeed, realized since film-plane stress variations are eliminated by nitridation. A vertical gradient still remains, bending relieved micromechanical beams strongly upwards. This behavior is believed to be due to imperfect amorphisation-the existence of columnar nano-scale crystallites.
Automated Natural Spoken Dialog
Authors: Allen L. Gorin, Alicia Abella, Tirso Alonso, Giuseppe Riccardi, Jeremy H. Wright
Venue: Computer (2002)

Traditional menu-driven speech recognition systems force users to learn the machine's jargon, but many people can't or won't navigate such highly structured interactions. AT&T's "How May I Help You?" technology shifts the burden to the machine by requiring it to adapt to human language and understand what people actually say rather than what a system designer expects them to say. For a given task, it is more crucial to recognize and understand some linguistic events than others. The authors have developed algorithms that automatically learn the salient words, phrases, and grammar fragments for a given task far more reliably than other methods.
Verifying a Multiprocessor Cache Controller Using Random Test Generation
Authors: David A. Wood, Garth A. Gibson, Randy H. Katz
Venue: IEEE Design Test (1990)

The design verification of the cache controller for SPUR, a shared-memory multiprocessor, is reported. The strategy was to develop a random tester that would generate and verify the complex interactions between multiple processors in functional simulation. Replacing the CPU model, the tester generates memory references by random selection from a script of actions and checks. It was easy to develop and detect over half the bugs uncovered during functional simulation. A prototype SPUR multiprocessor system that runs the Sprite operating system is being used for experiments in parallel programming. Results to data are described.
Low Overhead Multiprocessor Allocation Strategies Exploiting System Spare Capacity for Fault Detection and Location
Authors: Arun K. Somani, Srinivasan Tridandapani, Upender R. Sandadi
Venue: IEEE Transactions on Computers (1995)

Several schemes for detecting faults at the processor level in a multiprocessor system have been discussed in the past. One such scheme [1] works by running secondary versions of jobs on the unused, or spare, processors of the system and uses the comparison approach [2] to detect faults. We build upon this scheme and propose three new multiprocessor allocation strategies that run a variable number of versions per job. These schemes permit on-line detection and, in many cases, location of faulty processors in a system with nominal degradation in its delay/throughput performance; these delays are limited chiefly to the delays associated with job preemptions.Two new metrics, the fault detection capability (FDC) and the fault location capability (FLC), are introduced to evaluate these schemes. Extensive simulation results are performed to obtain performance figures for the various schemes. Stochastic Petri Net models are also developed to obtain approximate performance results. The results show that these schemes utilize spare capacity more efficiently, thereby improving upon the fault detection and location capabilities of the system.
A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems
Authors: Mingrong Cui
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric indefinite linear systems is studied. A simple sufficient condition for the convergence of the inexact Uzawa algorithm is obtained. Two examples and numerical experiments illustrating the conclusion are provided.
A Graph-Based Framework for Multiparadigmatic Visual Access to Databases
Authors: Tiziana Catarci, Shi-Kuo Chang, Maria F. Costabile, Stefano Levialdi, Giuseppe Santucci
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We describe an approach for multiparadigmatic visual access to databases, which is proposed to achieve seamless integration of different interaction paradigms. The user is provided with an adaptive interface augmented by a user model, supporting different visual representations of both data and queries. The visual representations are characterized on the basis of the chosen visual formalisms, namely forms, diagrams, and icons. To access different databases, a unified data model, the Graph Model, is used as a common underlying formalism to which databases, expressed in the most popular data models, can be mapped. Graph Model databases are queried through the adaptive interface. The semantics of the query operations is formally defined in terms of graphical primitives. Such a formal approach permits us to define the concept of "atomic query," which is the minimal portion of a query that can be transferred from one interaction paradigm to another and processed by the system. Since certain interaction modalities and visual representations are more suitable for certain user classes, the system can suggest to the user the most appropriate interaction modality as well as the visual representation, according to the user model. Some results on user model construction are presented.
Knowledge Processing in Control Systems
Authors: Ricardo R. Gudwin, Fernando A. C. Gomide, Márcio L. Andrade Netto, Maurício F. Magalhães
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

A real time knowledge processing procedure is proposed for rule-based systems in general and control systems applications in particular. Distinguishing features of the procedure include a mechanism for rule base compression and an inference scheme based on matrix operators. The procedure is also amenable for schedulability analysis to provide response time warranty An application concerning supervisory group control of elevators is also included to show the usefulness of the proposed procedure.
Modelling Federal Reserve Discount Policy
Authors: Christopher F. Baum, Meral Karasulu
Venue: Computational Economics (1998)

We employ threshold cointegration methodology to model the policy problem solved by the Federal Reserve System in their manipulation of the discount rate under a reserves target operating procedure utilized since October 1979. The infrequent and discrete adjustments that characterize movements in the discount rate instrument vis-a-vis the Federal Funds rate do not lend themselves to a linear cointegration framework. The inherently nonlinear relationship arising from the Fed&lsquo;s self-imposed constraints on discontinuously changing the discount rate is satisfactorily modelled as an instance of threshold cointegration between the discount rate and the Federal Funds rate.
Resource Allocation in Distributed Factory Scheduling
Authors: Kaita P. Sycara, Steven P. Roth, Norman Sadeh, Mark S. Fox
Venue: IEEE Expert: Intelligent Systems and Their Applications (1991)

A distributed factory scheduling model that is based on the concept of constraint-directed search within a centralized framework is presented. A set of texture measures that quantify several characteristics of the problem space being searched has been developed into heuristics that direct the searches conducted by scheduling agents. The heuristics have been used to direct the searches of a centralized activity-based scheduler, achieving good schedule quality and minimizing the likelihood of backtracking. The model discussed uses textures to direct distributed scheduling, optimizing decisions in the global search space by allowing agents to focus and direct searches in their individual search spaces. Experimental results are presented and confirm the effectiveness of the approach.
Temporal and Real-Time Databases: A Survey
Authors: Gultekin Ozsoyoglu, Richard Thomas Snodgrass
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

A temporal database contains time-varying data. In a real-time database transactions have deadlines or timing constraints. In this paper we review the substantial research in these two previously separate areas. First we characterize the time domain; then we investigate temporal and real-time data models. We evaluate temporal and real-time query languages along several dimensions. We examine temporal and real-time DBMS implementation. Finally, we summarize major research accomplishments to date and list several unanswered research questions.
Load Balancing for Parallel Query Execution on NUMA Multiprocessors
Authors: Luc Bouganim, Daniela Florescu, Patrick Valduriez
Venue: Distributed and Parallel Databases (1999)

To scale up to high-end configurations, shared-memory multiprocessors are evolving towards Non Uniform Memory Access (NUMA) architectures. In this paper, we address the central problem of load balancing during parallel query execution in NUMA multiprocessors. We first show that an execution model for NUMA should not use data partitioning (as shared-nothing systems do) but should strive to exploit efficient shared-memory strategies like Synchronous Pipelining (SP). However, SP has problems in NUMA, especially with skewed data. Thus, we propose a new execution strategy which solves these problems. The basic idea is to allow partial materialization of intermediate results and to make them progressivly public, i.e., able to be processed by any processor, as needed to avoid processor idle times. Hence, we call this strategy Progressive Sharing (PS). We conducted a performance comparison using an implementation of SP and PS on a 72-processor KSR1 computer, with many queries and large relations. With no skew, SP and PS have both linear speed-up. However, the impact of skew is very severe on SP performance while it is insignificant on PS. Finally, we show that, in NUMA, PS can also be beneficial in executing several pipeline chains concurrently.
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms*
Authors: Chenyang Lu, John A. Stankovic, Sang H. Son, Gang Tao
Venue: Real-Time Systems (2002)

This paper presents a feedback control real-time scheduling (FCS) framework for adaptive real-time systems. An advantage of the FCS framework is its use of feedback control theory (rather than ad hoc solutions) as a scientific underpinning. We apply a control theory based methodology to systematically design FCS algorithms to satisfy the transient and steady state performance specifications of real-time systems. In particular, we establish dynamic models of real-time systems and develop performance analyses of FCS algorithms, which are major challenges and key steps for the design of control theory based adaptive real-time systems. We also present a FCS architecture that allows plug-ins of different real-time scheduling policies and QoS optimization algorithms. Based on our framework, we identify different categories of real-time applications where different FCS algorithms should be applied. Performance evaluation results demonstrate that our analytically tuned FCS algorithms provide robust transient and steady state performance guarantees for periodic and aperiodic tasks even when the task execution times vary by as much as 100% from the initial estimate.
Reactive sputter deposition and properties of Tax N thin films
Authors: T. Riekkinen, J. Molarius, T. Laurila, A. Nurmela, I. Suni, J. K. Kivilahti
Venue: Microelectronic Engineering (2002)

The aim of this work was to evaluate tantalum nitride thin films fabricated using reactive sputtering with adjusted deposition parameters. Thin TaxN films were deposited reactively on Si wafers using reactive RF magnetron sputtering at various N2/Ar gas ratios. The films were investigated by four-point probe sheet resistance measurement, profilometry, X-ray diffraction, scanning electron microscope, 2 MeV 4He+ backscattering spectroscopy, and atomic force microscopy. As the amount of nitrogen was increased, the phases in the as-deposited films were identified as β-Ta, Ta2N (5% N2-flow), hexagonal TaN (10% N2-flow) and f.c.c.-TaN (15% N2-flow) with resistivities of 166 µΩ cm, 234 µΩ cm, 505 µΩ cm and 531 µΩ cm, respectively. Only the phase obtained at 5% N2-flow showed a reasonable uniformity over the wafer suggesting suitability as thin film resistors. The value of temperature coefficient of resistance (TCR) determined for the Ta2N thin film resistor was - 103 ppm/°C.
Probability Bounds for Goal Directed Queries in Bayesian Networks
Authors: Michael V. Mannino, Vijay S. Mookerjee
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We derive bounds on the probability of a goal node given a set of acquired input nodes. The bounds apply to decomposable networks; a class of Bayesian Networks encompassing causal trees and causal polytrees. The difficulty of computing the bounds depends on the characteristics of the decomposable network. For directly connected networks with binary goal nodes, tight bounds can be computed in polynomial time. For other kinds of decomposable networks, the derivation of the bounds requires solving an integer program with a nonlinear objective function, a computationally intractable problem in the worst case. We provide a relaxation technique that computes looser bounds in polynomial time for more complex decomposable networks. We briefly describe an application of the probability bounds to a record linkage problem.
Deterministic versus nondeterministic time and lower bound problems
Authors: Richard E. Stearns
Venue: Journal of the ACM (JACM) (2003)

Because many problems of general interest have natural nondeterministic algorithms and because computers act deterministically, it is important to understand the relationship between deterministic and nondeterministic time. Specifically, it is important to understand how quickly a deterministic computing device can determine the outcome of a nondeterministic calculation. So far, we have no general techniques that work any better than trying all step-by-step simulations, an exponential method.The most famous question concerning determinism versus nondeterminism is the P = NP question. However, this is a different question than "what is the relationship?" and it is possible that significant progress about the relationship can be achieved without answering the Pv = NP question. Thanks to efficient reductions from Turing machine simulation to SAT, the relationship question can be posed as a question about SAT. The problem of proving a nontrivial lower bound on the time required to solve SAT is just an instance of the larger problem of proving lower bounds for any natural problem. It is suggested that a study of generic problems might be a fruitful approach toward insights on such problems.
Communications Directed by Bound Types in Linda: Presentation and Formal Model
Authors: Alain Gibaud, Philippe Thomin
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show in this paper that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model¿Linda with bound types or B-Linda¿suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.
Radial basis function networks in A+
Authors: Alexander Skomorokhov
Venue: ACM SIGAPL APL Quote Quad (2002)

This paper discusses an implementation and application of Radial Basis Function (RBF) Networks. This type of neural networks performs a universal approach to function approximation. The same algorithm and program may be successfully applied to regression modeling or pattern classification. We illustrate the most important characteristics of RBF networks with a number of examples and discuss network behavior in depth. The software has been implemented in the A+ language, which became available to developers in January of 2001.
On Properties of Solutions to Nonlinear Parabolic Equations of the Second Order
Authors: V. A. Kondrat'ev
Venue: Journal of Dynamical and Control Systems (1999)

A quasilinear elliptic problem is considered for which conditions for existence and nonexistence of positive solutions are discussed.
Intel 870: A Building Block for Cost-Effective, Scalable Servers
Authors: Fayé Briggs, Michel Cekleov, Ken Creta, Manoj Khare, Steve Kulick, Akhilesh Kumar, Lily Pao Looi, Chitra Natarajan, Sivakumar Radhakrishnan, Linda Rankin
Venue: IEEE Micro (2002)

Architects based the Intel 870 system architecture on the scalability port, a coherent system interconnect. The system's building-block approach lets a single chipset support a wide range of server segments.
A Generalized Definition of Rough Approximations Based on Similarity
Authors: Roman Slowinski, Daniel Vanderpooten
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper proposes new definitions of lower and upper approximations, which are basic concepts of the rough set theory. These definitions follow naturally from the concept of ambiguity introduced in this paper. The new definitions are compared to the classical definitions and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.
SNAP: A Market-Propagation Architecture for Knowledge Processing
Authors: D. Moldovan, W. Lee, C. Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The semantic network array processor (SNAP), a highly parallel architecture targeted to artificial intelligence applications, and in particular natural language understanding, is presented. The knowledge is represented in a form of the semantic network. The knowledge base is distributed among the elements of the SNAP array, and the processing is performed locally where the knowledge is stored. A set of powerful instructions specific to knowledge processing is implemented directly in hardware. SNAP is packaged into 256 custom-designed chips assembled on four printed circuit boards and can store a 16 K node semantic network. SNAP is a marker propagation architecture in which the movement of markers between cells is controlled by propagation rules. Various reasoning mechanisms are implemented with these marker propagation rules.
Fitting ARMA Models to linear non-Gaussian processes using higher order statistics
Authors: Adnan Al-Smadi, Ahmad Alshamali
Venue: Signal Processing (2002)

This paper addresses the problem of estimating the parameters of a general autoregressive moving average model using higher order statistics (HOS) when only output data are available. The system is driven by an independent and identically distributed (i.i.d) non-Gaussian process. Simulation results are presented which demonstrate the performance of the new method and compare it with a well-known algorithm based on second order and HOS.
Single-electron control of Wigner crystallization
Authors: M. Bonitz, V. Golubnychiy, A. V. Filinov, Yu. E. Lozovik
Venue: Microelectronic Engineering (2002)

Wigner crystallization in mesoscopic quantum dots containing only few (N > 50) electrons exhibits a number of interesting peculiarities: (i) there exist two distinct crystal phases, and (ii) the phase boundary sensitively depends on the precise particle number. In this paper we demonstrate that this behavior can be used to control the collective transport properties by adding or removing a single electron.