ppxscal/embedding_network huggingface dataset:
A Simulator for E aluating Redundancy Analysis Algorithms of Repairable Embedded Memories
Authors: Rei-Fu Huang, Jin-Fu Li, Jen-Chieh Yeh, Cheng-Wen Wu
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We present a simulator for evaluating the redundancy analysis (RA) algorithms. The simulator can calculate the repair rate (the ratio of the number of repaired memories to the number of defective memories) of the given RA algorithm and the associated memory configuration and redundancy structure. With the tool, the user also can easily assess and plan the redundant (spare) elements, and subsequently develop the built-in redundancy analysis (BIRA) algorithms and circuits that are essential for built-in self-repair (BISR) of embedded memories.The simulator has another important feature ¿ it can simulate the sequence of the detected faults in the real order, improving the accuracy of the analysis results.
Visual Basic.NET and XML: Harness the Power of XML in VB.NET Applications
Authors: Rod Stephens, Brian Hochgurtel
Venue:  (2002)

:Microsoft envisions a future where the Web will host millions of distributed applications all communicating via XML. Data packaged in XML will flow to and from databases, between applications, and directly to the browser. With the release of Visual Basic .NET, XML support is tightly integrated into the language and provides numerous methods for manipulating XML data. This tight integration means that VB programmers can load, manipulate, and save XML data faster and more easily than ever before. With real-world and fully functional examples, Rod Stephens and Brian Hochgurtel walk you step-by-step through how to take advantage of XML in all aspects of enterprise VB.NET development.
Stabilized spectral methods for the Navier--Stokes equations: Residual-free bubbles and preconditioning
Authors: Claudio Canuto, Vincent Van Kemenade, Alessandro Russo
Venue:  (1997)

In a series of papers appeared in the last few years, the use of local bubble functions has been advocated as a stabilizing device for curing spurious oscillations in high order spectral Legendre or Chebyshev methods. This work has been motivated by the success of the bubble approach in low order finite element methods, as a general strategy to design stable approximations to saddle point problems such as the Stokes problem, or to convection-dominated problems. It has been shown that adding local bubbles to the usual (piecewise-)polynomial trial and test functions and eliminating them by static condensation leads to a least-square-type approximation of the Stokes problem, and to an SUPG-type approximation of the convection-diffusion problem. Not only the bubble approach provides an elegant unifying framework in which different stabilization techniques may be cast, but it also yields a path to the fully automatic choice of the stabilization parameters. as well as to adaptivity via a-posteriori error estimators. A previous paper by the first two authors deals with the bubble stabilization of Legendre-Galerkin methods for the incompressible Navier-Stokes equations in velocity-pressure formulation. Local bubbles allow the use of equal order polynomials for approximating the velocity and the pressure; they dramatically reduce the oscillations related to poor resolution in the convection-dominated regime; in addition, they enhance the robustness of a continuation method for treating the nonlinearity. All this, without giving up with the formal infinite-order accuracy of a spectral Legendre method. While the paper clearly indicates the feasibility of the bubble approach, it leaves room for improving the practical efficiency of the method, both by fully exploiting the potential of the bubbles in the automatic (user-independent) setting of the stabilization parameters, and by finding appropriate techniques for the solution of the resulting algebraic system of discrete equations. We address these two issues in the present paper. We propose to adapt to spectral methods the recently developed idea of residual-free bubbles, and to resort to a suitably stabilized finite element preconditioner in solving the algebraic system iteratively. The basic idea of the residual-free bubble approach is as follows: we enlarge the space where the solution is sought by auxiliary functions (the ``bubbles'''') whose support is localized in a cell (or an element). These functions are determined by the solution of local problems, in such a way that, in the enlarged space, the governing equations are solved exactly within each element. This motivates the name ``residual-free'''' bubbles. If we consider a convection-diffusion problem with piecewise constant coefficients and linear finite elements, then the solution of the local problems -- in the convection-dominated regime -- can be obtained essentially without approximation and at a small cost. In more complicated situations, some a
Experiences with Scientific Applications on an SCI-based Linux Cluster
Authors: H. Martin Bücker, Bernhard Eck, Jörg Henrichs
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Today, clusters of PCs are powerful computing platforms offering an inexpensive alternative to traditional supercomputers. Besides the low price, the major reason for the emergence of PC clusters is the availability of a wealth of public domain as well as important commercial software on top of the Linux operating system. Furthermore, a PC cluster can be built in a modular fashion enabling a potential customer to perfectly meet his requirements. For instance, the number of nodes, the node types, and the network can be chosen. In this note, experiences with a SCI-based Linux cluster installed at the Computing Center of Aachen University of Technology are reported. Timing results for two different applications, a two-dimensional fast Fourier transform and a molecular dynamics simulation, are presented. Our experiences demonstrate the importance of a fast network when dealing with large-scale scientific applications on a Linux cluster.
A Communication Computation Model for developing Computer Supported Cooperative Work Systems
Authors: Masahiro Hiji, Hiroshi Nunokawa, Masatoshi Miyazaki
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Cooperative work is done not only by workers but with some software used by each worker. They do various communications including interaction between worker and software in cooperative works. To develop computer supported cooperative work systems, it is important to support various communications among them. A computational model that can represent communicative objects such as workers and software and various communications among them are necessary for that purpose. We propose this communication computation model as such a model. A worker and software are represented as the AutonomousObject, and a group is represented as the GroupField in this model. Various communications are represented by communicative functions that correspond to each communication form. We show that our model is effective for modeling various communications in cooperative work.
The fat banyan ATM switch
Authors: M. Alimuddin, H. M. Alnuweiri, R. W. Donaldson
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

A strategy for fully utilizing switch resources, namely the buffers and links in a banyan network is proposed. A new switch model called the fat-banyan switch is introduced with the objective of achieving high performance at minimal cost. The fat-banyan switch model is a unifying model for the design and analysis of dilated banyan switches. The dilated banyan network forms a special case of the fat-banyan model. By keeping the number of input and output links of a switching element to be variable, the fat-banyan switch achieves a lower order of complexity than the dilated banyan. Further the fat-banyan switch is superior to the buffered-banyan switch in terms of reduced delay and higher throughput. The performance of the fat-banyan under independent uniform traffic pattern is analyzed.
A Wearable Computer Based American Sign Language Recognizer
Authors: Thad Starner, Joshua Weaver, Alex Pentland
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Modern wearable computer designs package workstation level performance in systems small enough to be worn as clothing. These machines enable technology to be brought where it is needed the most for the handicapped: everyday mobile environments. This paper describes a research effort to make a wearable computer that can recognize (with the possible goal of translating) sentence level American Sign Language (ASL) using only a baseball cap mounted camera for input. Current accuracy exceeds 97% per word on a 40 word lexicon.
The Parallel Waveform IQMR Algorithm for Transient Simulation of Semiconductor Devices
Authors: Laurence Tianruo Yang
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In this paper, we mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers since these method are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. Here we propose an improved version of the quasi-minimal residual (IQMR) method mainly based on [3, 4] by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step with waveform Newton. For Lanczos process, stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. Therefore, the cost of global communication can be significantly reduced. Experimental results carried out on Parsytec GC about the comparison with other accelerated approaches such as convolution SOR and waveform GM-RES techniques on waveform relaxation algorithm and pointwise methods are described as well. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
METEORs: High Performance Theorem Provers Using Model Elimination
Authors: L O Astrachan, W D Loveland
Venue:  (1991)

\indent Historically, depth-first (linear) resolution procedures have not fared well in proving deeper theorems relative to breadth-first resolution provers of various types, primarily because of the search redundancy problem. However, we can now demonstrate that the Model Eliminator (ME) procedure, a linear-input resolution-like procedure, may be a superior approach for certain types of problems (generally non-Horn problems). There is a conjunction of reasons why the METEOR provers presently appear so effective. The reasons are: the inherent speed advantage of linear input systems, the sophistication of the WAM architecture in exploiting this advantage, a program written in the language C using tight coding and effective data structures, the speed of the platforms on which they run, and the successful use of different search strategies. We explore single processor and parallel processor implementations of ME using different versions of interactive depth-first search. Among the theorems we prove are variants of a problem in calculus for which this ME theorem prover is presently the only uniform first-order proof procedure realization that has succeeded in proving these variants.
Three-Dimensional Scene Flow
Authors: Sundar Vedula, Simon Baker, Robert Collins, Takeo Kanade, Peter Rander
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Scene flow is the three-dimensional motion field of points in the world, just as optical flow is the two-dimensional motion field of points in an image. Any optical flow is simply the projection of the scene flow onto the image plane of a camera.In this paper, we present a framework for the computation of dense, non-rigid scene flow from optical flow. Our approach leads to straightforward linear algorithms and a classification of the task into three major scenarios: (1) complete instantaneous knowledge of the scene structure, (2) knowledge only of correspondence information, and (3) no knowledge of the scene structure. We also show that multiple estimates of the normal flow cannot be used to estimate dense scene flow directly without some form of smoothing or regularization.
Evaluation of the number of destination hosts for data networking and its application to address cache design
Authors: M. Aida, N. Takahashi
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper discuses how to design the capacity of address cache tables for large-scale computer communication networks. We show that destination addresses of packets can, be assumed to be characterized by two types of Zipf's law. Based on the complementary use of these laws, we derive the relation between the number of accesses and the number of destination addresses. Experimental results show that the relation gives a good approximation. Applying this relation, we derive the upper/lower bounds for cache hit probability. Using the probabilities, design issues including the capacity of the cache table and aging algorithm of cache entries are also discussed.
Towards a High Reliability of the PCR Amplification Process in DNA Computing
Authors: Mashashi Nakatsugawa, Satoshi Kashiwamura, Masahito Yamamoto, Toshikazu Shiba, Azuma Ohuchi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Polymerase Chain Reaction (PCR) is the most important process in DNA computing.When a concentration of DNA sequence is too little too investigate, PCR could amplifythe sequence by a polymerase.PCR is frequently applied to obtain a result in DNAcomputing, because the result is generally shown by alittle amount of DNA sequence.Therefore, a reliability of PCR must be assured for DNA computing.In this paper, weDefine a reproducibility of PCR as the reliability.Similarly, a reaction time is defined asA reaction cost, and other parameters are defined as control factors in quality engineering.By adjusting the factors, we improve a PCR performance shown by the reproducibilityand reaction cost.
Macromedia Flash MX: Training from the Source
Authors: Chrissy Rey
Venue:  (2002)

:Macromedia Flash MX: Training from the Source teaches you how to use Flash MX through a hands-on approach. You'll create a Flash-based Web site, complete with animation, sound, video and interactivity. Detailed explanations provide insight for every step. You'll see how each part of the project works with the others to make a complete Web site. The enclosed CD-ROM contains all the files you'll need to complete the project plus completed files for you to compare with your own results.
AAA and CS 1 The Applied Apprenticeship Approach to CS 1
Authors: Owen Astrachan, David Reed
Venue:  (1994)

We have developed an application-based approach to introductory courses in computer science. This approach follows an {\em apprenticeship} model of learning, where students begin by reading, studying, and extending programs written by experienced and expert programmers. Applications play a central role since programming constructs are motivated and introduced in the context of applications, not the other way around as is the tradition in most texts and courses. Under our applied approach, students are able to learn from interesting real-world examples, the synthesis of different programming constructs is supported using incremental examples, and good design is stressed via code reuse. In this paper, we provide several examples of our method as well as pointers to all the material we have developed which is freely available electronically. The philosophy underlying this method transcends a particular programming language, but we present our examples using C++ since that is the language we use in our CS 1 and CS 2 courses. We have also used this method in a Pascal-based CS 0.5 class with equal success.
Using the Mach Communication Primitives in X11
Authors: Michael Ginsberg, Robert V. Baron, Brian N. Bershad
Venue:  (1993)

We have modified the X11 windowing system to use the native communication facilities of the Mach 3.0 microkernel. Our new implementation can rely on Mach''s low-overhead IPC facility as a direct replacement for sockets, or it can use shared memory as a transport between X11 clients and the server. On conventional BSD Unix systems, X11 communication is done through sockets. Because a user-level process implements Unix functionality on top of Mach 3.0, a socket-based version of X11 performs substantially worse than when running on a monolithic Unix kernel. Using Mach IPC as the transport between X11 clients and the server, X11 performance is slightly better than that of a monolithic system in which sockets are implemented inside the kernel as opposed to within a user level process. Using Mach''s shared memory facilities as the transport, we have measured performance improvements of over 40%.
Should Yield be a Design Objective?
Authors: Israel Koren
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The objectives of good chip design have traditionally included issues like performance, power and reliability. Yield is rarely considered during the design process, except in the design of memory ICs, where specific defect-tolerance techniques are incorporated into the architecture for yield enhancement.In order to make the case for establishing yield as another design objective we must first prove that a chip's yield can not only be affected, but consistently improved, by decisions made during the design process.
Stochastic Differential Equations in Transport
Authors: D. W. Dean
Venue:  (1999)

This report is intended to explain our use of stochastic differential equations as mathematical models of contaminant transport in highly heterogeneous environments. The two major components in the stochastic model are a drift term and a dispersion term. The drift term is the expected velocity of the fluid particle along its streamline and the dispersion term is derived from the velocity field. The details of the development of the dispersion term are found in Dean [14], Dean and Russell [15]. This report focuses on the connection between the model stochastic differential equations and their associated partial differential equations. Ito^''s formula is used to explain the relationship between the stochastic differential equation and the advection-dispersion equation. By solving the stochastic differential equation via the Monte Carlo method, contaminant plumes are produced. The effectiveness of a remediation well is tested with this approach using actual data from flow tank experiments conducted by the civil engineering department in Boulder.
Segmentation and Validation of Commercial Documents Logical Structure
Authors: Miguel Diogenes Matrakas, Flávio Bortolozzi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The main objective of this work is to present an approach to extract and validate the logical structure from the images that compose a commercial document. The nearest neighbor rule algorithm was used for labeling the elements, and the Run Length Smoothing Algorithm (RLSA) was used to segment the image of a commercial document of the type letter, official letter or memo. The most common classes considered are: date, logotype, text body, signature, addressee, invocation and greeting. The labeling of the elements is accomplished using the nearest neighbor rule algorithm with a vector constituted of 28 characteristics. The accomplished study presented a good result for the classification of elements on commercial documents. It was created and used a base composed of 283 images of commercial documents in 256 gray levels for the document element classification.
Information systems problems and issues in Australian companies
Authors: D. J. Falconer, R. A. Hodgett
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Accountants in senior management positions in three samples of Australian organisations were surveyed and asked to identify the main information systems problems organisations have faced in the last three years and the main information systems issues facing organisations in next three years. The returns from the three samples were compared to identify similarities and major differences The combined results for the samples were compared to identify past problems that are current issues, problems that are no longer issues and new issues.
Adaptive object management for a reconfigurable microkernel
Authors: S. Oikawa, K. Sugiura, H. Tokuda
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Generic mechanisms and policies provided by the existing operating system kernels cannot satisfy requirements of the current and future applications especially in mobile system environments. An operating system kernel needs to be adaptable, customizable, and extensible to cope with the changes of a computation environment and requirements from applications. This paper introduces a DKM (Dynamic Kernel Module) as a mechanism and the DKM server as a service to reconfigure RT-Mach. A DKM is an extension of a LKM (Loadable Kernel Module), which is provided by UNIX kernels to extend their functionality dynamically. The DKM server manages their load and detachment. It must be programmable not to lose the flexibility of their management but to be reconfigurable to cope with a variety of applications and systems.
On the Consequences of Acting in the Presence of Inconsistency
Authors: Bashar Nuseibeh, Alessandra Russo
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

Managing inconsistency in specifications covers a range of activities from consistency checking and inconsistency analysis to inconsistency handling through action. In this paper we argue that inconsistency analysis is insufficient to determine the choice of actions to take in the presence of inconsistency. Rather, we propose that some form of 'hypothetical reasoning' is needed in order to determine the consequences of different actions and thereby facilitate the decision-making process. We suggest some logic-based techniques and associated heuristics for analysing the consequences of acting in the presence of inconsistency.