ppxscal/embedding_network huggingface dataset:
An Integrated CMOS Front-End for Optical Absolute Rotary Encoders
Authors: Massimo Gottardi, Lorenzo Gonzo, Stefano Gregori, Valentino Liberali, Andrea Simoni, Guido Torelli
Venue: Analog Integrated Circuits and Signal Processing (2003)

This paper presents a front-end circuit for optical rotary encoders. The light pulses modulated by the encoder disc are transduced into current signals, which are pre-processed and converted into digital waveforms related to the disc angular position information. The proposed front-end circuit is compensated against temperature drifts. Digitally programmable calibration is provided to account for spreads in impinging light pulse power. Measurement results on integrated prototypes are shown, demonstrating correct operation of the front-end with an optical input power from 0.5 &mu;W to 3 &mu;W up to a signal frequency of 500 kHz in a temperature range from 0 &deg;C to 80 &deg;C.
Test Sets and Reject Rates: All Fault Coverages are Not Created Equal
Authors: Peter C. Maxwell, Robert C. Aitken
Venue: IEEE Design Test (1993)

The use of stuck-at-fault coverage for estimating overall quality levels is examined. Data from a part tested with both functional and scan tests are analyzed and compared with quality predictions generated by three existing theoretical models. It is shown that reasonable predictions are possible for functional tests, but that scan tests, due to misuse of theoretical equations, produce significantly worse quality levels than predicted.
Diversity in Reuse Processes
Authors: Maurizio Morisio, Colin Tully, Michel Ezran
Venue: IEEE Software (2000)

The authors present and contrast the processes put in place by four companies to achieve systematic reuse. The companies have different sizes, business contexts, and development approaches. However, all achieved their reuse goals, even though they made radically different choices on essential processes and technologies. This article discusses the key reasons for the different processes' success, including strong commitment from management, identifying and addressing the issues for change, and minimizing changes.
The Cache DRAM Architecture: A DRAM with an On-Chip Cache Memory
Authors: Hideto Hidaka, Yoshio Matsuda, Mikio Asakura, Kazuyasu Fujishima
Venue: IEEE Micro (1990)

A DRAM (dynamic RAM) with an on-chip cache, called the cache DRAM, has been proposed and fabricated. It is a hierarchical RAM containing a 1-Mb DRAM for the main memory and an 8-kb SRAM (static RAM) for cache memory. It uses a 1.2- mu m CMOS technology. Suitable for no-wait-state memory access in low-end workstations and personal computers, the chip also serves high-end systems as a secondary cache scheme. It is shown how the cache DRAM bridges the gap in speed between high-performance microprocessor units and existing DRAMs. The cache DRAM concept is explained, and its architecture is presented. The error checking and correction scheme used to improve the cache DRAM's reliability is described. Performance results for an experimental device are reported
ASC: An Associative-Computing Paradigm
Authors: Jerry Potter, Johnnie Baker, Stephen Scott, Arvomd Bansal, Chokchai Leangsuksun, Chandra Asthagiri
Venue: Computer (1994)

Today's increased computing speeds allow conventional sequential machines to effectively emulate associative computing techniques. We present a parallel programming paradigm called ASC (ASsociative Computing), designed for a wide range of computing engines. Our paradigm has an efficient associative-based, dynamic memory-allocation mechanism that does not use pointers. It incorporates data parallelism at the base level, so that programmers do not have to specify low-level sequential tasks such as sorting, looping and parallelization. Our paradigm supports all of the standard data-parallel and massively parallel computing algorithms. It combines numerical computation (such as convolution, matrix multiplication, and graphics) with nonnumerical computing (such as compilation, graph algorithms, rule-based systems, and language interpreters). This article focuses on the nonnumerical aspects of ASC.
A Benes-Like Theorem for the Shuffle-Exchange Graph
Authors: E. J. Schwabe
Venue: IEEE Transactions on Computers (1992)

One of the first theorems on permutation routing, proved by V.E. Benes (1965), shows that give a set of source-destination pairs in an N-node butterfly network with at most a constant number of sources or destinations in each column of the butterfly, there exists a set of paths of lengths O(log N) connecting each pair such that the total congestion is constant. An analogous theorem yielding constant-congestion paths for off-line routing in the shuffle-exchange graph is proved here. The necklaces of the shuffle-exchange graph play the same structural role as the columns of the butterfly in the Benes theorem.
Globalization of Software Supply and Demand
Authors: Capers Jones
Venue: IEEE Software (1994)

PCs and industrial microcomputers are changing the software industry dramatically. Many developing countries are now entering the commercial software domain, and this trend should accelerate in the twenty-first century. Software use is also expanding rapidly on a global basis. The author considers how these trends are sure to have a major effect on the US software industry.
A Distributed Resource Management Mechanism for a Partitionable Multiprocessor System
Authors: W. Lin, C. -L. Wu
Venue: IEEE Transactions on Computers (1988)

A resource-management mechanism is presented for a multiprocessor system consisting of a pool of homogeneous processing elements interconnected by multistage networks. The mechanism aims at making effective use of hardware resources of the multiprocessor system in support of high-performance parallel computations. It can create many physically independent subsystems simultaneously without incurring internal fragmentation,. Each subsystem can configure itself to form a desired topology for matching the structure of the parallel computation. The mechanism is distributed in nature; it is divided into three functionally disjoint procedures that can reside in different loci for handling various resource-management tasks concurrently. Simulation results show that, by eliminating internal fragmentation, the mechanism achieves better source utilization than a reference machine.
An Expert System for Journal Selection
Authors: Roy Rada
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The National Library of Medicine indexes about 3000 of the world's 20000 biomedical journals and maintains various indices to health-professional literature. The decision on which journals to index is based on a policy that is difficult to apply precisely. The current method for selecting journals is described and experiments in building an expert system to facilitate that task are discussed. It is explained how knowledge refinement strategies developed for a medical-diagnosis expert system were adapted to the present task, as well as how the massive database and knowledge base maintained by the library was tapped to support the journal selection decision-making process. The application of a learning program to the expert system to improve its accuracy is discussed.
Engineering Software Under Statistical Quality Control
Authors: Richard H. Cobb, Harlan D. Mills
Venue: IEEE Software (1990)

Eight common misconceptions of software quality are examined and refuted. The concept of cleanroom engineering of software is introduced. Cleanroom engineering achieves intellectual control by applying rigorous, mathematics-based engineering practices, establishes an errors-are-unacceptable attitude and a team responsibility for quality, delegates development and testing responsibilities to separate teams, and certifies the software's mean time to failure through the application of statistical quality-control methods. A typical project is used to explain the concepts and procedures.
Virtual Network Transport Protocols for Myrinet
Authors: Brent N. Chun, Alan M. Mainwaring, David E. Culler
Venue: IEEE Micro (1998)

This article describes a protocol for a general-purpose cluster communication system that supports multiprogramming with virtual networks, direct and protected network access, reliable message delivery using message time-outs and retransmissions, a powerful return-to-send error model for applications, and automatic network mapping. The protocols use simple, low-cost mechanisms that exploit properties of our interconnect without limiting flexibility, usability, or robustness. We have implemented the protocols in an active message communication system that runs a network of 100+ Sun UltraSPARC workstations interconnected with 40 Myrinet switches. A progression of microbenchmarks demonstrate good performance - 42 microsecond round-trip times and 31 MB/s node-to-node bandwidth - as well as scalability under heavy load and graceful performance degradation in the presence of high contention.
Optimizing Main-Memory Join on Modern Hardware
Authors: Stefan Manegold, Peter Boncz, Martin Kersten
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In the past decade, the exponential growth in commodity CPU's speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems have not yet adapted to these trends and show poor utilization of both CPU and memory resources on current hardware. In this paper, we show how these resources can be optimized for large joins and translate these insights into guidelines for future database architectures, encompassing data structures, algorithms, cost modeling, and implementation. In particular, we discuss how vertically fragmented data structures optimize cache performance on sequential data access. On the algorithmic side, we refine the partitioned hash-join with a new partitioning algorithm called radix-cluster, which is specifically designed to optimize memory access. The performance of this algorithm is quantified using a detailed analytical model that incorporates memory access costs in terms of a limited number of parameters, such as cache sizes and miss penalties. We also present a calibration tool that extracts such parameters automatically from any computer hardware. The accuracy of our models is proven by exhaustive experiments conducted with the Monet database system on three different hardware platforms. Finally, we investigate the effect of implementation techniques that optimize CPU resource usage. Our experiments show that large joins can be accelerated almost an order of magnitude on modern RISC hardware when both memory and CPU resources are optimized.
Learning to Classify Parallel Input/Output Access Patterns
Authors: Tara M. Madhyastha, Daniel A. Reed
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Input/output performance on current parallel file systems is sensitive to a good match of application access patterns to file system capabilities. Automatic input/output access pattern classification can determine application access patterns at execution time, guiding adaptive file system policies. In this paper, we examine and compare two novel input/output access pattern classification methods based on learning algorithms. The first approach uses a feedforward neural network previously trained on access pattern benchmarks to generate qualitative classifications. The second approach uses hidden Markov models trained on access patterns from previous executions to create a probabilistic model of input/output accesses. In a parallel application, access patterns can be recognized at the level of each local thread or as the global interleaving of all application threads. Classification of patterns at both levels is important for parallel file system performance; we propose a method for forming global classifications from local classifications. We present results from parallel and sequential benchmarks and applications that demonstrate the viability of this approach.
Capturing and Tuning Nonlinear Characteristics of Economic Stabilization Systems by Fuzzy Control Techniques
Authors: V. Georgescu
Venue: Computational Economics (2002)

Various techniques have been used to control or stabilize economic processes: from econometric models based on rational expectations (assuming that shifts in economic policy produce revised expectations of rational agents), to regulatory mechanisms, normally regarded as engineering tools. However, applying nonconventional techniques, such as fuzzy control, could provide more flexible alternatives to the conventional way. Presumably, the interest in applying fuzzy control to economic processes consists of at least two advantages: on one hand in prescribing control actions by linguistic descriptions and on the other hand in the capability of transition from linear to nonlinear modes of control, conjugated with fine-tuning procedures. This paper is intended to exemplify the latter opportunity. After briefly describing certain fundamental concepts of fuzzy control, we focus on the design of fuzzy linear controllers that emulate conventional modes of control in the first stage and on the refinement of such fuzzy controllers by making them progressively nonlinear in the second stage. As an application of fuzzy control to economic processes, we provide a fuzzy extension of the Phillips' stabilization model in two variants: for a closed economy as well as for an open economy. To implement the control schemata, tools like Matlab and Simulink are used.
Is Copyright Law Steering the Right Course?
Authors: Pamela Samuelson
Venue: IEEE Software (1988)

The Whelan decision, a landmark copyright decision, has questioned the legality of reusing the abstractions and structures underlying software. The author argues that this is a flawed decision that could harm software-engineering practice. She discusses copyright versus patent protection, describes the Whelan case, and critiques the decision. She addresses the legal handling of software in general, arguing that it more reasonably ought to be protected by patent than by copyright.
Convergence analysis of block orthogonal projection and affine projection algorithms
Authors: Kazushi Ikeda
Venue: Signal Processing (2002)

The affine projection (AP) and the block orthogonal projection (BOP) algorithms are known to have good convergence properties even when the input signal is correlated. However, their convergence rates are not elucidated yet, since they are based on orthogonal projection, and are too complicated to be analyzed. In this paper, we first consider their geometrical view and derive their convergence rates for white signals. Moreover, we provide an approximation method to evaluate the convergence rate for correlated signals and show the results which are confirmed by computer simulations. The results imply that the convergence rate of the BOP algorithm gets saturated as the block size increases.
Constructing Intrinsic Parameters with Active Models for Invariant Surface Reconstruction
Authors: B. C. Vemuri, R. Malladi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A technique for constructing a canonical surface parameterization in terms of lines of curvature is presented. Two methods of computing the canonical invariant representation are also presented. In the first method, a static instance of the controlled continuity spline is used for the stabilizer. Ways to modify it to reflect a change of parameters to the lines of curvature are described. In the second method, the dynamic instance of the controlled continuity spline called the deformable model is used. A force field defined in terms of the principal vectors is synthesized and applied to the parameter curves of the deformable model to coerce them along the lines of curvature. In essence, any transformation of parameters requires a modification of the stabilizer in the first method, whereas in the second method, it is tantamount to synthesizing a new force field. Experimental results with real and synthetic range data are included.
On Multirate DS-CDMA Schemes with Interference Cancellation
Authors: Ann-Louise Johansson, Arne Svensson
Venue: Wireless Personal Communications: An International Journal (1999)

This paper investigates interference cancellation (IC) in direct-sequence code-division multiple access (DS-CDMA) systems that support multiple data rates. Two methods for implementing multiple data rates are considered. One is the use of mixed modulation and the other is the use of multicodes. We introduce and analyze a new approach that combines these multiple data rate systems with IC. The cancellation in the receiver is performed successively on each user, starting with the user received with the highest power. This procedure can in turn be iterated, forming a multistage scheme, with the number of iterations set as a design parameter. Our analysis employs a Gaussian approximation for the distribution of the interference, and it includes both the AWGN and the flat Rayleigh fading channel. The systems are also evaluated via computer simulations. Our analysis and simulations indicate that the IC schemes used in mixed modulation or multicode systems yield a performance close to the single BPSK user bound and, consequently, give a prospect of a considerable improvement in performance compared to systems employing matched filter detectors.
Data Mining to Support Simulation Modeling of Patient Flow in Hospitals
Authors: Mark W. Isken, Balaji Rajagopalan
Venue: Journal of Medical Systems (2002)

Spiraling health care costs in the United States are driving institutions to continually address the challenge of optimizing the use of scarce resources. One of the first steps towards optimizing resources is to utilize capacity effectively. For hospital capacity planning problems such as allocation of inpatient beds, computer simulation is often the method of choice. One of the more difficult aspects of using simulation models for such studies is the creation of a manageable set of patient types to include in the model. The objective of this paper is to demonstrate the potential of using data mining techniques, specifically clustering techniques such as K-means, to help guide the development of patient type definitions for purposes of building computer simulation or analytical models of patient flow in hospitals. Using data from a hospital in the Midwest this study brings forth several important issues that researchers need to address when applying clustering techniques in general and specifically to hospital data.
The Core Method for Real-Time Requirements
Authors: Stuart Faulk, John Brackett, Paul Ward, James Kirby,  Jr.
Venue: IEEE Software (1992)

The member companies of the Software Productivity Consortium develop large, mission-critical, real-time applications. For these companies, requirements are the top-priority problem in systems and software development. These requirements have driven the development of the Consortium Requirements Engineering (Core) method and its prototype CASE tools. Core is a single, coherent method for specifying real-time requirements that integrates object-oriented and forward models, integrates graphical and formal specifications, permits nonalgorithmic specifications, and provides a machine-like model. The Core requirements, component technologies, and conceptual model are discussed. Some important Core features are illustrated with an example of safety-shutdown software for a shipboard fuel-control system.
On Matrices with Signed Null-Spaces
Authors: Si-Ju Kim, Bryan L. Shader, Suk-Geun Hwang
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We denote by ${\cal Q}(A)$ the set of all matrices with the same sign pattern as A. A matrix A has signed null-space provided there exists a set ${\cal S}$ of sign patterns such that the set of sign patterns of vectors in the null-space of $\widetilde{A}$ is ${\cal S}$ for each $\widetilde{A} \in {\cal Q}(A)$. Some properties of matrices with signed null-spaces are investigated.
Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus
Authors: T. Y. Chung, N. Sharma, D. P. Agrawal
Venue: IEEE Transactions on Computers (1994)

Two recent topologies-Manhattan Street Network (MSN) and HR/sup 4/-Net (or 2-D Torus)-proposed for metropolitan areas are primarily mesh connected networks. The authors compare the average distance, the diameter, the terminal reliability, and the cost. Simulation results indicate that they are fairly close in performance, while the MSN is observed to be more cost-effective than the HR/sup 4/-Net.
Materialization
Authors: R. C. Goldstein, V. C. Storey
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

A new data abstraction, called Materialization, is introduced to model a situation that occurs frequently in the real world and has important implications for database design. Materialization is the relationship between two entity types, one that represents a conceptual object, for example, a TV Model, and one that represents its corresponding concrete objects, in this case, actual TV Sets. The Materialization construct is formally defined and contrasted with other well-known data abstractions. Its design implications are presented in terms of the entity-relationship model and its translation into a relational model. Guidelines are offered for the proper employment of this relationship in database design methodologies, and a discussion is provided of why this constitutes an important data modeling construct.
Accurate Unix Benchmarking: Art, Science, or Black Magic?
Authors: David F. Hinnant
Venue: IEEE Micro (1988)

The author offers a simple mathematical model of the interrelation of hardware and software to illustrate the necessity of knowledge of, and control over, the system under evaluation. He presents a list of hardware and software variables in Unix systems that should be considered when running benchmarks and a set of guidelines to benchmarking technique. While Unix is used as the case study, most (if not all) of the unwritten rules generally apply to other operating system environments. The author applies these guidelines to various benchmarks to illustrate the need for proper technique.
A New Efficient and Direct Solution for Pose Estimation Using Quadrangular Targets: Algorithm and Evaluation
Authors: M. a. Abidi, T. Chandra
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Pose estimation is an important operation for many vision tasks. In this paper, we propose a new algorithm for pose estimation based on the volume measurement of tetrahedra composed of feature-point triplets extracted from an arbitrary quadrangular target and the lens center of the vision system. The input to this algorithm are the six distances joining all feature pairs and the image coordinates of the quadrangular target. The output of this algorithm are the effective focal length of the vision system, the interior orientation parameters of the target, the exterior orientation parameters of the camera with respect to an arbitrary coordinate system if the target coordinates are known in this frame, and the final pose of the camera. We have also developed a shape restoration technique which is applied prior to pose recovery in order to reduce the effects of inaccuracies caused by image projection. An evaluation of the method has shown that this pose estimation technique is accurate and robust. Because it is based on a unique and closed-form solution, its speed makes it a potential candidate for solving a variety of landmark-based tracking problems.