ppxscal/embedding_network huggingface dataset:
Low-Power Multimedia RISC
Authors: Kouhei Nadehara, Ichiro Kuroda, Masayuki Daito, Takashi Nakayama
Venue: IEEE Micro (1995)

The V830, high-performance, low-power RISC microprocessor with signal processing enhancements is designed for low-cost multimedia equipment. It includes special instructions that improve signal-processing performance such as fast multiply/multiply-accumulate instructions, saturated arithmetic instructions, and conditional branch instructions with prediction.Some basic benchmarks show the signal-processing performance of this processor is comparable to that of the latest fixed-point DSPs.
Bipartizing matchings and Sabidussi's compatibility conjecture
Authors: Herbert Fleischner
Venue: Discrete Mathematics (2002)

In a cubic graph G3 with dominating cycle C, a matching M is called bipartizing if M ∩ E(C) = φ, M covers all of V(G3)- V(C), and G3 - M is homeomorphic to a cubic bipartite graph. In this note it will be shown that if G3 has two disjoint bipartizing matchings, then G3 has a cycle double cover S with C ∈ S.
Cost-Effective Deterministic Partitioning for Rapid Diagnosis in Scan-Based BIST
Authors: Ismet Bayraktaroglu, Alex Orailoglu
Venue: IEEE Design Test (2002)

Identifying fault-embedding scan cells is a significant challenge for fault diagnosis in scan-based BIST. Deterministic partitioning techniques provide cost-effective solutions to this problem. Both mathematical solutions and simulations on hardware implementations demonstrate the effectiveness of these techniques.
Implications of Classical Scheduling Results for Real-Time Systems
Authors: John A. StankovicThis work was done while the, Marco Spuri, Marco Di Natale, Giorgio C. Buttazzo
Venue: Computer (1995)

Important classical scheduling theory results for real-time computing are identified. Implications of these results from the perspective of a real-time systems designer are discussed. Uni- processor and multiprocessor results are addressed as well as important issues such as future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic scheduling, preemption versus non-preemption, multiprocessing anomalies, and metrics. Examples of what scheduling algorithms are used in actual applications are given.
A Fast Radix-4 Division Algorithm and its Architecture
Authors: Keshab K. Parhi, Hosahalli R. Srinivas
Venue: IEEE Transactions on Computers (1995)

In this paper we present a fast radix-4 division algorithm for floating point numbers. This method is based on Svoboda¿s division algorithm and the radix-4 redundant number system. The algorithm involves a simple recurrence with carry-free addition and employs prescaling of the operands. In the proposed divider implementation, each radix-4 digit (belonging to set {¿3, ¿, +3}) of the quotient and partial remainder is encoded using two radix-2 digits (belonging to the set {¿1, 0, +1}) and this leads to hardware simplicity. The quotient digits are determined by observing three most-significant radix-2 digits of the partial remainder and independent of the divisor. The architecture presented for the proposed algorithm is faster than previously proposed radix-4 dividers, which require at least four digits of the partial remainder to be observed to determine quotient digits.
Three Low Cost Static-Code Analyzers
Venue: IEEE Software (1990)

No abstract available 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
Probabilistic Analysis of Regularization
Authors: D. Keren, M. Werman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

In order to use interpolated data wisely, it is important to have reliability and confidence measures associated with it. A method for computing the reliability at each point of any linear functional of a surface reconstructed using regularization is presented. The proposed method is to define a probability structure on the class of possible objects and compute the variance of the corresponding random variable. This variance is a natural measure for uncertainty, and experiments have shown it to correlate well with reality. The probability distribution used is based on the Boltzmann distribution. The theoretical part of the work utilizes tools from classical analysis, functional analysis, and measure theory on function spaces. The theory was tested and applied to real depth images. It was also applied to formalize a paradigm of optimal sampling, which was successfully tested on real depth images.
A Model for Adaptable Systems for Transaction Processing
Authors: B. Bhargava, J. Riedl
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Adaptability is an essential tool for managing escalating software costs and to build high-reliability, high-performance systems. Algorithmic adaptability, which supports techniques for switching between classes of schedulers in distributed transaction systems, is modeled. RAID, an experimental system implemented to support experimentation in adaptability, is discussed. Adaptability features in RAID, including algorithmic adaptability, fault tolerance, and implementation techniques for an adaptable server-based design, are modeled.
Geographical information systems and location science
Authors: Richard L. Church
Venue: Computers and Operations Research (2002)

Since the 1970s the field of Geographical Information Systems (GIS) has evolved into a mature research and application area involving a number of academic fields including Geography, Civil Engineering, Computer Science, Land Use Planning, and Environmental Science. GIS can support a wide range of spatial queries that can be used to support location studies. GIS will play a significant role in future location model development and application. We review existing work that forms the interface between GIS and Location Science and discuss some of the potential research areas involving both GIS and Location Science.
Moving-Target Search: A Real-Time Search for Changing Goals
Authors: Toru Ishida, Richard E. Korf
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids the problem solver. We present a moving-target search algorithm (MTS) to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guaranteed to eventually reach the target in a connected problem space.The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, includingcommitment to goals, anddeliberation for selecting plans.Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.
The Challenges of Wearable Computing: Part 1
Authors: Thad Starner
Venue: IEEE Micro (2001)

Wearable computing pursues an interface ideal of a continuously worn, intelligent assistant that augments memory, intellect, creativity, communication, and physical senses and abilities. Many challenges await wearable designers as they balance innovative interfaces, power requirements, network resources, and privacy concerns. This survey describes the possibilities offered by wearable systems and, in doing so, demonstrates unique attributes to this class of computing.
Visual attention-based polygon level of detail management
Authors: Ross Brown, Luke Cooper, Binh Pham
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Modern real-time graphics systems are required to render millions of polygons to the screen per second. However, even with this high polygon rendering bandwidth, there are still applications which tax this rendering capability. We introduce in this paper a technique which adaptively allocates polygons to objects in a scene according to their visual importance. It is expected that using this technique, an improvement in the perceptual quality of a rendered image should result, for the same overall number of polygons being rendered.We present both a theoretical basis and a complete design for a visual attention-based level of detail management technique. We also present some preliminary assessment of output from the system. Applications for this technique are expected to be found in the areas of entertainment, visualisation and simulation.
Techniques of Successful Application of Factor Analysis in Software Measurement
Authors: Nadine Hanebutte, Carol S. Taylor, Reiner R. Dumke
Venue: Empirical Software Engineering (2003)

Metrics in a software sense can be roughly divided into two groups, internal metrics and external metrics. Internal metrics can be measured directly, while external metrics are predicted using internal metrics. Factor analysis is a statistical technique which can be applied to analyze the structure of internal metrics and form a prediction model for external metrics A prediction model generated by using factor analysis needs further validation since factor analysis has a non-unique solution for the factor-loading matrix. The computational methodology to establish a model is presented as well as the validation process. This is illustrated by an empirical study of design metrics and a prediction model for design quality.
Guest Editors' Introduction: Benchmarking for Design and Test
Authors: Scott Davidson, Justin Harlow
Venue: IEEE Design Test (2000)

This special issue on benchmarking for design and test represents a snapshot of a continuing effort to collect and utilize larger and more sophisticated benchmarks for design and test tools and algorithms. Before we start, let's discuss what we mean by benchmarking, explain why we want to have benchmarks, and provide a short history of benchmarking efforts.
Collecting data via the internet: the development and deployment of a web-based survey
Authors: Joel Epstein, W. Dean Klinkenberg
Venue: Journal of Technology in Human Services (2002)

This report discusses the process of developing and deploying an Internet-based study that sought to replicate the results of a traditionally administered questionnaire. We present data on the characteristics of respondents, hit and completion rates, and the effectiveness of a dozen different methods of advertising the survey. Overall, we were very successful in soliciting a gay and lesbian sample of Internet-users and collected one of the largest samples for a Web-based survey to date. Publicity methods that addressed the target audience's specific interests were far more effective than broader advertising methods.
Future SOC Possibilities
Authors: Ken Sakamura
Venue: IEEE Micro (2002)

The empirical Moore's law essentially states that the ability of large-scale integration (LSI) becomes twice denser every 18 months. This law has held true, even at the beginning of the 21st century. If the law still holds in the coming decade, we will see a micro-processor with one billion transistors sometime around 2005, and a CPU with 10 billion transistors sometime in the 2010s. Scientists say that the human brain has about 1.4 billion neurons. But we must throw away the simple view that one neuron could correspond to one tran-sistor. Our brains and the current digital computer work in very different manners. So comparing the numbers of neurons and transistors is just a matter of general interest with no real application. Still, it is impressive that designers can pack so many logic devices in a single LSI.
Object Technology and Reuse: Lessons from Early Adopters
Authors: Robert G. Fichman, Chris F. Kemerer
Venue: Computer (1997)

Although adopting a new software process technology is rarely easy, the early adoption of OO is likely to be particularly difficult and risky. In 1992, the authors initiated four case studies of early OO adopters, which we continued until 1997. The longitudinal case studies reveal the actual challenges early adopters faced and helped us develop recommendations about how organizations can succeed with adoption in spite of potential barriers. The four cases illustrate lessons that should be of direct interest to organizations attempting to achieve greater reuse through OO and those having to confront issues about software process technology adoption. All four case sites encountered learning barriers and barriers from immature technology; more important, all sites found it difficult to achieve systematic reuse. Organizations contemplating the adoption of object orientation and systematic reuse must balance the benefits of early adoption against the costs and risks we describe, and then develop an appropriate innovation strategy. For those organizations that do not have the resources or inclination to make such investments, the authors advise waiting. Over time, technologies destined for broad acceptance inevitably get simpler and easier to use; standards coalesce; complementary tools emerge that make it easier to assemble a complete architecture off the shelf; training gets better, cheaper, and more readily available; the supply of professionals already proficient in the technology increases; and wisdom accumulates in the industry at large about how and where to best apply the technology. Even among organizations that can afford substantial investments in process innovation, the benefits of waiting can often be compelling.
On the Relationship Between Two Systolic Array Design Methodologies
Authors: M. T. O'Keefe, J. A. B. Fortes, B. W. Wah
Venue: IEEE Transactions on Computers (1992)

The parameter method and data dependency method have been proposed as systematic design methodologies for systolic arrays. The authors describe the relationship between the two methodologies and show that the parameter method applies to a subclass of the algorithms that can be processed by the dependency method. The optimization procedure of the parameter method can be applied, in a restricted sense, within the framework of the dependency method. This procedure is used to derive an optimal array for the deconvolution algorithm.
A Look at NASA Goddard Space Flight Center's Knowledge Management Initiatives
Authors: Jay Liebowitz
Venue: IEEE Software (2002)

As we move from the information age to the knowledge era, knowledge is being treated as a key asset. NASA and others are realizing that to maximize their organizations' potential, they must fully leverage their knowledge or intellectual capital. To accomplish this task, an emerging trend is to develop knowledge management and knowledge sharing initiatives within organizations. For example, NASA formed a Knowledge Management Team, comprised of NASA representatives.NASA Goddard Space Flight Center (GSFC) has several knowledge management initiatives underway on the expert and knowledge retention side.
Fast Algorithms for Distributed Resource Allocation
Authors: I. Page, T. Jacob, E. Chern
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Two new algorithms for the distributed static resource allocation problem are presented.The first algorithm, which shows excellent average case behavior in simulation requiresthe maintenance of a global queue. The second, which needs only local communication,has polynomial waiting time and exhibits better average case behavior than the only otherknown polynomial time algorithm. Both algorithms have polynomial message complexity.
Isolated Word Recognition by Neural Network Models with Cross-Correlation Coefficients for Speech Dynamics
Authors: J. Wu, C. Chan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

This paper presents an artificial neural network (ANN) for speaker-independent isolated word speech recognition. The network consists of three subnets in concatenation. The static information within one frame of speech signal is processed in the probabilistic mapping subnet that converts an input vector of acoustic features into a probability vector whose components are estimated probabilities of the feature vector belonging to the phonetic classes that constitute the words in the vocabulary. The dynamics capturing subnet computes the first-order cross correlation between the components of the probability vectors to serve as the discriminative feature derived from the interframe temporal information of the speech signal. These dynamic features are passed for decision-making to the classification subnet, which is a multilayer perceptron (MLP). The architecture of these three subnets are described, and the associated adaptive learning algorithms are derived. The recognition results for a subset of the DARPA TIMIT speech database are reported. The correct recognition rate of the proposed ANN system is 95.5%, whereas that of the best of continuous hidden Markov model (HMM)-based systems is only 91.0%.
Workarounds and distributed viscosity in a workflow system: a case study
Authors: Stephan Poelmans
Venue: ACM SIGGROUP Bulletin (1999)

This research aims at studying enduser acceptance of workflow system. Enduser acceptance is crucial when considering the implementation success of workflow systems (WFS). The case study reported here is the first step in the development of a general diagnostic tool for evaluating the implementation of workflow systems.Many case studies have been presented in the field of Workflow Management [1;2;3]. Some focus on the design of WFS tools, others are ethnographic in nature and describe the factors that lead to success or failure of the WFS. However, most case studies provide case-specific insights and no general systematic framework has been presented yet to evaluate workflow implementation.
Exotic transport properties of two-dimensional graphite
Authors: Tsuneya Ando, Yisong Zheng, Hidekatsu Suzuura
Venue: Microelectronic Engineering (2002)

Anomalies present at zero energy are shown to give rise to a peculiar and singular behavior of the dynamical and static conductivity in two-dimensional (2D) lattices having the structure of 2D graphite.
An Associative Processing Module for a Heterogeneous Vision Architecture
Authors: Richard Storer, Mike R. Pout, Andrew R. Thomson, Erik L. Dagless, Andrew W. G. Duller, A. Paul Marriott, Peter J. Hick
Venue: IEEE Micro (1992)

The heterogeneous vision architecture that satisfies the computing demands of real-time computer vision by providing parallelism in three different forms is described. A pipeline of digital signal processing (DSP) chips initially processes signals. Then a SIMD associative processor array processes images and extract features, and a MIMD network of transputers processes extracted objects in parallel. The array's VLSI implementation, the processing modes available due to the use of content-addressable memory, and the means of achieving efficient 2-D interprocessor communication in the linear array are described. An application as a vehicle number plate recognition system is presented.
A D&T Special Report: P1149.4 Mixed-Signal Test Bus
Authors: Adam Cron
Venue: IEEE Design Test (1996)

The IEEE P1149.4 Mixed-Signal Test Bus Working Group has been busy developing a usable standard addressing analog testability issues for mixed-signal technologies. The Working Group's charter is to define, document, and promote the use of a standard mixed-signal test bus that can be used at the device and assembly levels to improve the controllability and observability of mixed-signal designs and to support mixed-signal built-in self-test structures in order to reduce test development time, testing costs, and improve test quality.This short article will update the reader with the current standard architecture proposal, explain how the architecture can be used in a test scenario, and challenge the reader to respond to the Working Group with solutions or observations concerning some current topics of debate within the group. This standard is still in the stages of finalization, and the ideas and constructs presented here are proposals generally accepted by the Working Group, but may still change for technical or other reasons.
Automatic form generation
Authors: Sandra A. Mamrak, Sheetal Pole
Venue: Software&mdash;Practice Experience (2002)

The Acuity project, in support of a collaborative brain-tumor research effort, provides WWW-based input forms implemented as Java applets for updating a WWW-accessible database. The continuing need to develop new, but closely related, input forms motivated the design and implementation of the Acuity Form Generator (AFG), an automatic form-generation tool. This paper documents the AFG technology.
Borrow: A Fault-Tolerance Scheme for Wavefront Array Processors
Authors: T. Stouraitis
Venue: IEEE Transactions on Computers (1993)

A hardware fault-tolerance mechanism for wavefront array processors is proposed and evaluated. A faulty processing element borrows a working one to reperform the computations and achieve reliable results. The performance level is a stronger function of the fault pattern rather than the actual number of faults. The scheme adopts simple localized or step-wise localized control for its implementation.
Fast Combinatorial RNS Processors for DSP Applications
Authors: Francesco Piazza, Elio D. Di Claudio, Gianni Orlandi
Venue: IEEE Transactions on Computers (1995)

It is known that RNS VLSI processors can parallelize fixed-point addition and multiplication operations by the use of the Chinese Remainder Theorem (CRT). The required modular operations, however, must use specialized hardware whose design and implementation can create several problems. In this paper a modified residue arithmetic, called pseudo-RNS is introduced in order to alleviate some of the RNS problems when Digital Signal Processing (DSP) structures are implemented. Pseudo-RNS requires only the use of modified binary processors and exhibits a speed performance comparable with other RNS traditional approaches. Some applications of the pseudo-RNS to common DSP architectures, such as multipliers and filters, are also presented in this paper. They are compared in terms of the Area-Time Square product versus other RNS and weighted binary structures. It is proven that existing combinatorial or look-up table approaches for RNS are tailored to small designs or special applications, while the pseudo-RNS approach remains competitive also for complex systems.
Regional Variation in Medical Systems Data: Influences on Upcoding
Authors: Daniel P. Lorence, Amanda Spink
Venue: Journal of Medical Systems (2002)

Attempts to minimize over-reimbursement to health care providers have resulted in highly publicized prosecution of health care providers and provider organizations. Such prosecution has led many to propose that upcoding influences exerted upon health care information managers would largely disappear, both within and external to the provider organization. This study seeks to examine the degree of both intra- and extraorganizational influences on reimbursement optimizing practices through a national survey of accredited health information managers. Results suggest that significant upcoding influence continues to occur within organizations, despite the risk of severe counterfraud penalties designed to eliminate such practices. We examine variation in intra- and extraorganizational optimizing influences, finding such influence was found to exist both within and external to the provider organization. We also examine how optimization influences vary across demographic, practice setting, and market characteristics. We find significant variation in influence across practice settings and managed care markets. Ramifications for reimbursement assessment are discussed.