ppxscal/embedding_network huggingface dataset:
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
Authors: V. Y. Pan
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A nonsingular n*n matrix A is given with its short displacement generator. It has smalldisplacement rank bounded by a fixed constant. The class of such matrices generalizesToeplitz matrices. A good initial approximation to a short displacement generator forA/sup -1/ is readily available. Ways to refine this approximation and numerically compute a displacement generator of A/sup -1/ and the solution vector x=A/sup -1/b to a linear system Ax=b by using O(log/sup 2/n) parallel arithmetic steps and n processors arepresented. These results are extended to some other important classes of densestructure matrices.
Large Chip vs. MCM for a High-Performance System
Authors: Evan E. Davidson
Venue: IEEE Micro (1998)

With the capability of modern semiconductor processes, it is possible to design a system-on-a-chip. This implies a large function on a large chip, and it is valid to question whether partitioning this chip into a few smaller chips and using a multichip module (MCM) to interconnect the functions is better for performance and cost reasons. To answer this question, this article explores the design, performance, and cost issues for a large chip versus a MCM. Performance trends for each approach will be shown to better understand the future performance limits for microprocessors.
A Conceptual Clustering Algorithm for Database Schema Design
Authors: H. W. Beck, T. Anwar, S. B. Navathe
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Conceptual clustering techniques based on current theories of categorization provide a way to design database schemas that more accurately represent classes. An approach is presented in which classes are treated as complex clusters of concepts rather than as simple predicates. An important service provided by the database is determining whether a particular instance is a member of a class. A conceptual clustering algorithm based on theories of categorization aids in building classes by grouping related instances and developing class descriptions. The resulting database schema addresses a number of properties of categories, including default values and prototypes, analogical reasoning, exception handling, and family resemblance. Class cohesion results from trying to resolve conflicts between building generalized class descriptions and accommodating members of the class that deviate from these descriptions. This is achieved by combining techniques from machine learning, specifically explanation-based learning and case-based reasoning. A subsumption function is used to compare two class descriptions. A realization function is used to determine whether an instance meets an existing class description. A new function, INTERSECT, is introduced to compare the similarity of two instances. INTERSECT is used in defining an exception condition. Exception handling results in schema modification. This approach is applied to the database problems of schema integration, schema generation, query processing, and view creation.
An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches
Authors: Changkyu Kim, Doug Burger, Stephen W. Keckler
Venue: ACM SIGPLAN Notices (2002)

Growing wire delays will force substantive changes in the designs of large caches. Traditional cache architectures assume that each level in the cache hierarchy has a single, uniform access time. Increases in on-chip communication delays will make the hit time of large on-chip caches a function of a line's physical location within the cache. Consequently, cache access times will become a continuum of latencies rather than a single discrete latency. This non-uniformity can be exploited to provide faster access to cache lines in the portions of the cache that reside closer to the processor. In this paper, we evaluate a series of cache designs that provides fast hits to multi-megabyte cache memories. We first propose physical designs for these Non-Uniform Cache Architectures (NUCAs). We extend these physical designs with logical policies that allow important data to migrate toward the processor within the same level of the cache. We show that, for multi-megabyte level-two caches, an adaptive, dynamic NUCA design achieves 1.5 times the IPC of a Uniform Cache Architecture of any size, outperforms the best static NUCA scheme by 11%, outperforms the best three-level hierarchy--while using less silicon area--by 13%, and comes within 13% of an ideal minimal hit latency solution.
Applying the PSP in Industry
Authors: Maurizio Morisio
Venue: IEEE Software (2000)

The author introduced the PSP in a company and reports that experience. One year after the introduction, only part of the PSP is still in use. The PSP proved to be more useful as a model to inspire a process improvement effort than an off-the-shelf process to be reused without modification.
Protocol Design: Redefining the State of the Art
Authors: Gerard J. Holzman
Venue: IEEE Software (1992)

The application of formal methods to high-level protocol design is addressed. A formal method is considered to be one that has the capability of rendering correctness proofs. The traditional and formal design processes are described and compared. The framework for proving logical correctness in protocol engineering is then discussed.
Case studies of software-process-improvement measurement
Authors: Daniel J. Paulish, Anita D. Carleton
Venue: Computer (1994)

Describes an ongoing research project conducted jointly by Siemens and the Software Engineering Institute. Siemens software-development organizations in Germany and the United States are case-study sites at which we measure the effect of methods to improve the software-development process. To observe and quantify the impact of software-process improvement, we must measure the performance of a software-development organization over time. Comparison of performance across organizations is very difficult, since organizations define measures and collect performance data in different ways. However, we can separately track performance improvement in each organization if it defines measures consistently and develops similar products. We have defined basic measures for performance of a software-development organization. We limited ourselves to a small number of simple measures to reduce the complexity of collecting, analyzing, and maintaining the performance data. Improving the software-development process improves the quality of software products and the overall performance of the software-development organization. However, process is only one of several controllable factors in improving software quality and organization performance. Others include the skills and experience of the people developing the software, the technology used (e.g. CASE tools), product complexity, and environmental characteristics such as schedule pressure and communications.
Texture Classification by Wavelet Packet Signatures
Authors: A. Laine, J. Fan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

This correspondence introduces a new approach to characterize textures at multiple scales. The performance of wavelet packet spaces are measured in terms of sensitivity and selectivity for the classification of twenty-five natural textures. Both energy and entropy metrics were computed for each wavelet packet and incorporated into distinct scale space representations, where each wavelet packet (channel) reflected a specific scale and orientation sensitivity. Wavelet packet representations for twenty-five natural textures were classified without error by a simple two-layer network classifier. An analyzing function of large regularity (D/sub 20/) was shown to be slightly more efficient in representation and discrimination than a similar function with fewer vanishing moments (D/sub 6/) In addition, energy representations computed from the standard wavelet decomposition alone (17 features) provided classification without error for the twenty-five textures included in our study. The reliability exhibited by texture signatures based on wavelet packets analysis suggest that the multiresolution properties of such transforms are beneficial for accomplishing segmentation, classification and subtle discrimination of texture.
Neural and Fuzzy Methods in Handwriting Recognition
Authors: Paul D. Gader, James M. Keller, Raghu Krishnapuram, Jung-Hsien Chiang, Magdi A. Mohamed
Venue: Computer (1997)

Handwriting recognition has challenged computer scientists for years. To succeed, a computing solution must ably recognize complex character patterns and represent imprecise, commonsense knowledge about the general appearance of characters, words, and phrases. Character recognition is a classical computing problem, dating back to neural computing's infancy. One of Frank Rosenblatt's first demonstrations on the Mark I Perceptron neurocomputer in the late 1950s involved character recognition. The Perceptron was one of the first computers based on the idea of a neural network, which is a simplified computational model of neurons in a human brain. It was the first functioning neurocomputer, and it was able to recognize a fixed-font character set. As with many artificial intelligence applications, the difficulty of handwriting recognition was greatly underestimated. Significant progress was not achieved until the late 1980s and early 1990s, when many technologies converged to enable rapid increases in recognition rates for digits, characters, and words so that reliable commercial systems could be developed. Handwriting recognition problems are either online or offline. Online recognition systems use a pressure-sensitive pad that records the pen's pressure and velocity, which would be the case with, for example, a personal digital assistant. In offline recognition, the kind we are concerned with here, system input is a digital image of handwritten letters and numbers. Handwriting recognition requires tools and techniques that recognize complex character patterns and represent imprecise, commonsense knowledge about the general appearance of characters, words, and phrases. Neural networks and fuzzy logic are complementary tools for solving such problems. Neural networks, which are highly nonlinear and highly interconnected for processing imprecise information, can finely approximate complicated decision boundaries. Fuzzy set methods can represent degrees of truth or belonging. Fuzzy logic, one of several fuzzy set methods, encodes imprecise knowledge and naturally maintains multiple hypotheses that result from the uncertainty and vagueness inherent in real problems. By combining the complementary strengths of neural and fuzzy approaches into a hybrid system, we can attain increased recognition capability for solving handwriting recognition problems. This article describes the application of neural and fuzzy methods to three problems:recognition of handwritten words,recognition of numeric fields, andlocation of handwritten street numbers in address images. These problems and methods were part of research we conducted on US Postal Service data and on problems of interest to the USPS.
Long and Fast Up/Down Counters
Authors: Mircea R. Stan, Alexandre F. Tenca, Milos D. Ercegovac
Venue: IEEE Transactions on Computers (1998)

This paper presents recent advances in the design of constant-time up/down counters in the general context of fast counter design. An overview of existing techniques for the design of long and fast counters reveals several methods closely related to the design of fast adders, as well as some techniques that are only valid for counter design. The main idea behind the novel up/down counters is to recognize that the only extra difficulty with an up/down (vs. up-only or down-only) counter is when the counter changes direction from counting up to counting down (and vice-versa). For dealing with this difficulty, the new design uses a "shadow" register for storing the previous counter state. When counting only up or only down, the counter functions like a standard up-only or down-only constant time counter, but, when it changes direction instead of trying to compute the new value (which typically requires carry propagation), it simply uses the contents of the shadow register which contains the exact desired previous value. An alternative approach for restoring the previous state in constant time is to store the carry bits in a Carry/Borrow register.
Directional Mathematical Morphology and Reformalized Hough Transformation for the Analysis of Topographic Maps
Authors: H. Yamada, K. Yamamoto, K. Hosokawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

One of the most difficult and important problems encountered in the automatic digitizing of graphical topographic maps is the identification and separate digitizing of different kinds of features. Essentially, in topographic maps, there are two kinds of geometric features: linear features, such as roads and railways that have an arbitrary length, and symbols, which indicate a type of building or area of land usage or even numerical information. These two types of features are extracted and recognized by using methods based on multiangled parallelism (MAP). The MAP operation method performs parallel calculation on directional feature planes. The linear features are extracted using erosion-dilation operations on the directional feature planes, and the symbols are extracted using a reformalized and parallel version of the generalized Hough transformation on the same directional planes, which is called the MAP matching method. The methods have been applied to a 1/25000 scale map.
Energy-Efficient Routing in the Broadcast Communication Model
Authors: Koji Nakano, Stephan Olariu, Albert Y. Zomaya
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

The Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by p stations denoted by S(1), S(2), ..., S(p) that communicate by transmitting messages on a communication channel. The stations are assumed to have the computing power of a laptop computer and to be synchronous¿in particular, they all run the same program, albeit on different data. We assume that a station is expending power while transmitting or receiving messages. As it turns out, one of the most effective energy-saving strategies is to mandate individual stations to power their transceiver off (i.e., go to sleep) whenever they are not transmitting or receiving messages. Suppose that the p stations of the BCM store collectively n items such that station S(i), (1
A Planning Aid: An Intelligent Modeling System for Planning Problems Based on Constraint Satisfaction
Authors: S. Raghunathan
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Constraint satisfaction problems have been extensively studied by researchers in both the operations research (OR) and artificial intelligence (AI) areas. The research aimed at integrating the two approaches so that some of their limitations can be removed is described. Specifically, a knowledge-based system that formulates and maintains OR models for manufacturing planning purposes is presented. Domain-specific knowledge allows synthesis of various qualitative relationships into mathematical relationships and its identification of various dependencies between symbolic and mathematical models. The modeler component engages in a search process to identify the simplest model that can be formulated. A truth maintenance system, specifically designed to support modeling for planning, allows the user to explore various scenarios to arrive at an appropriate plan. Preliminary experiments indicate that human planners are able to formulate models that are equivalent to those formulated by experienced OR modelers for various planning problems.
A complete distance field representation
Authors: Jian Huang, Yan Li, Roger Crawfis, Shao Chiung Lu, Shuh Yuan Liou
Venue: Proceedings of the conference on Visualization '01 (2001)

Distance fields are an important volume representation. A high quality distance field facilitates accurate surface characterization and gradient estimation. However, due to Nyquist's Law, no existing volumetric methods based on the linear sampling theory can fully capture surface details, such as corners and edges, in 3D space. We propose a novel complete distance field representation (CDFR) that does not rely on Nyquist's sampling theory. To accomplish this, we construct a volume where each voxel has a complete description of all portions of surface that affect the local distance field. For any desired distance, we are able to extract a surface contour in true Euclidean distance, at any level of accuracy, from the same CDFR representation. Such point-based iso-distance contours have faithful per-point gradients and can be interactively visualized using splatting, providing per-point shaded image quality. We also demonstrate applying CDFR to a cutting edge design for manufacturing application involving high-complexity parts at un-precedented accuracy using only commonly available computational resources.
Resource Scheduling In A High-Performance Multimedia Server
Authors: HweeHwa Pang, Bobby Jose, M. s. Krishnan
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Supporting continuous media (CM) data¿such as video and audio¿imposes stringent demands on the retrieval performance of a multimedia server. In this paper, we propose and evaluate a set of data-placement and retrieval algorithms to exploit the full capacity of the disks in a multimedia server. The data-placement algorithm declusters every object over all of the disks in the server¿using a time-based declustering unit¿with the aim of balancing the disk load. As for runtime retrieval, the quintessence of the algorithm is to give each disk advance notification of the blocks that have to be fetched in the impending time periods, so that the disk can optimize its service schedule accordingly. Moreover, in processing a block request for a replicated object, the server will dynamically channel the retrieval operation to the most lightly loaded disk that holds a copy of the required block. We have implemented a multimedia server based on these algorithms. Performance tests reveal that the server achieves very high disk efficiency. Specifically, each disk is able to support up to 25 MPEG-1 streams. Moreover, experiments suggest that the aggregate retrieval capacity of the server scales almost linearly with the number of disks.
Proxy Cache Algorithms: Design, Implementation, and Performance
Authors: Junho Shim, Peter Scheuermann, Radek Vingralek
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Caching at proxy servers is one of the ways to reduce the response time perceived by World Wide Web users. Cache replacement algorithms play a central rolfe in the response time reduction by selecting a subset of documents for caching, so that a given performance metric is maximized. At the same time, the cache must take extra steps to guarantee some form of consistency of the cached documents. Cache consistency algorithms enforce appropriate guarantees about the staleness of the cached documents. We describe a unified cache maintenance algorithm, LNC-R-W3-U, which integrates both cache replacement and consistency algorithms. The LNC-R-W3-U algorithm evicts documents from the cache based on the delay to fetch each document into the cache. Consequently, the documents that took a long time to fetch are preferentially kept in the cache. The LNC-R-W3-U algorithm also considers in the eviction consideration the validation rate of each document, as provided by the cache consistency component ofLNC-R-W3-U. Consequently, documents that are infrequently updated and thus seldom require validations are preferentially retained in the cache. We describe the implementation of LNC-R-W3-U and its integration with the Apache 1.2.6 code base. Finally, we present a trace-driven experimental study of LNC-R-W3-U performance and its comparison with other previously published algorithms for cache maintenance.
Resistance Characterization for Weak Open Defects
Authors: Rosa Rodríguez Montañés, Paul Volf, José Pineda de Gyvez
Venue: IEEE Design Test (2002)

Strong open defects can cause a circuit tomalfunction, but even weak open defects cancause it to function poorly. Detecting weak opensis thus an important, but challenging, task.Characterizing weak opens can help researchersassess the need for delay fault tests.
Pinnacle: IBM MXT in a Memory Controller Chip
Authors: R. Brett Tremaine, T. Basil Smith, Mike Wazlowski, David Har, Kwok-Ken Mak, Sujith Arramreddy
Venue: IEEE Micro (2001)

Pinnacle leverages state-of-the-art technologies to establish a low-cost, high-performance single-chip memory controller. The chip uses IBM's Memory Expansion Technology system architecture, which more than doubles the installed main memory's effective size without adding significant cost or degrading performance.
Modular architecture for a toolset supporting OCL
Authors: Heinrich Hussmann, Birgit Demuth, Frank Finger
Venue: Science of Computer Programming (2002)

The practical application of the object constraint language (OCL), which is part of the UML specification since version 1.1, depends crucially on the existence of adequate tool support. This paper discusses general design issues for OCL tools. It is argued that the nature of OCL will lead to a large variety of tools, applied in combination with a variety of different UML tools. Therefore, a flexible modular architecture for a UML/OCL toolset is proposed. The paper reports on the first results of an ongoing project which aims at the provision of such an OCL toolset that is available as free software.
A Frequency Domain Technique for Range Data Registration
Authors: Luca Lucchese, Gianfranco Doretto, Guido Maria Cortelazzo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This work introduces an original method for registering pairs of 3D views consisting of range data sets which operates in the frequency domain. The Fourier transform allows the decoupling of the estimate of the rotation parameters from the estimate of the translation parameters, our algorithm exploits this well-known property by suggesting a three-step procedure. The rotation parameters are estimated by the first two steps through convenient representations and projections of the Fourier transforms' magnitudes and the translational displacement is recovered by the third step by means of a standard phase correlation technique after compensating one of the two views for rotation. The performance of the algorithm, which is well-suited for unsupervised registration, is clearly assessed through extensive testing with several objects and shows that good and robust estimates of 3D rigid motion are achievable. Our algorithm can be used as a prealignment tool for more accurate space-domain registration techniques, like the ICP algorithm.
Stabilizability and Detectability of Singularly Perturbed Linear Time-Invariant Systems with Delays in State and Control
Authors: V. Y. Glizer
Venue: Journal of Dynamical and Control Systems (1999)

A singularly perturbed linear time-invariant system with delays in state and control variables is considered. Connection between properties of open-loop stabilizability (detectability) of the reduced-order and boundary-layer systems, associated with the original system, and such properties of the original system itself are analyzed.