ppxscal/embedding_network huggingface dataset:
Numerical Accuracy and Hardware Tradeoffs for CORDIC Arithmetic for Special-Purpose Processors
Authors: K. Kota, J. R. Cavallaro
Venue: IEEE Transactions on Computers (1993)

The coordinate rotation digital computer (CORDIC) algorithm is used in numerous special-purpose systems for real-time signal processing applications. An analysis of fixed-point CORDIC in the Y-reduction mode, which allows computation of the inverse tangent function, shows that unnormalized input values can result in large numerical errors. The authors describe two approaches for tackling the numerical accuracy problem. The first approach builds on a fixed-point CORDIC unit and eliminates the problem by including additional hardware for normalization. A method for integrating the normalization operation with the CORDIC iterations for efficient implementation in O(n/sup 1.5/) hardware is provided. The second solution to the accuracy problem is to use a floating-point CORDIC unit but reduce the implementation complexity by using a hybrid architecture. Arguments to support the use of such an architecture in certain special-purpose arrays are presented.
Reply to commentaries on "XML and the new design regime"
Authors: Gilbert Vanburen Wilkes,  IV
Venue: ACM Journal of Computer Documentation (JCD) (2002)

The author responds by agreeing with some of the commentator's points and by clarifying his meaning related to others. He also offers additional discussion and references to the literature concerning some of the article's ideas.
Mobile Computing in the Humanitarian Assistance Setting: An Introduction and Some First Steps
Authors: Joel D. Selanikio, Teresa M. Kemmer, Maria Bovill, Karen Geisler
Venue: Journal of Medical Systems (2002)

We developed a Palm operating system-based handheld computer system for administering nutrition questionnaires and used it to gather nutritional information among the Burmese refugees in the Mae La refugee camp on the Thai&ndash;Burma border. Our experience demonstrated that such technology can be easily adapted for such an austere setting and used to great advantage. Further, the technology showed tremendous potential to reduce both time required and errors commonly encountered when field staff collect information in the humanitarian setting. We also identified several areas needing further development.
Storage Allocation Policies for Time-Dependent Multimedia Data
Authors: Huang-Jen Chen, Thomas D. C. Little
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Multimedia computing requires support for heterogeneous data types with differing storage, communication, and delivery requirements. Continuous media data types such as audio and video impose delivery requirements that are not satisfied by conventional physical storage organizations. In this paper, we describe a physical organization for multimedia data based on the need to support the delivery of multiple playout sessions from a single rotating-disk storage device. Our model relates disk characteristics to the different media recording and playback rates and derives their storage pattern. This storage organization guarantees that as long as a multimedia delivery process is running, starvation will never occur. Furthermore, we derive bandwidth and buffer constraints for disk access and present an approach to minimize latencies for non-continuous media stored on the same device. The analysis and numerical results indicate the feasibility of using conventional rotating magnetic disk storage devices to support multiple sessions for on-demand video applications.
CASh: a novel "clock as shield" design methodology for noise immune precharge-evaluate logic
Authors: Yonghee Im, Kaushik Roy
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In gigascale integrated circuits (GSI), interconnects are expected to play a more dominant role in circuit performance than transistor cells. The circuit performance is affected by signal integrity as cross-talk becomes more significant with the scaling of feature sizes. Many attempts have been made to improve noise immunity, but all require the sacrifice of speed as a trade-off, especially in dynamic circuits. Avoiding noise problems while maintaining the desired speed would involve increased wire spacing or extensive shielding, both of which are unfavorable due to demands for high density and a relatively higher cost of wires in current process technologies. We propose a novel methodology in which clock lines are used as shielding wires to reduce cross-talk effects in domino circuits, thereby minimizing the possibility of functional failures. In addition, this method provides another benefit: a small buffer size is required for driving a long interconnect for iso-noise immunity. Since clock lines, which are always required in domino circuits, are used to shield signal lines, speed penalty and area overhead which are drawbacks of previous work can be avoided. This design methodology CASh (Clock As Shielding) demonstrates the superiority over conventional methods. HSPICE simulations on a 2-input domino AND gate and 4 and 8-bit full adders designed in CASh show higher noise immunity over conventional design.
Teletraffic Analysis of SDMA-Systems with Inhomogeneous MS Location Distribution and Mobility
Authors: Christian Hartmann, Hans-Jörg Vögel
Venue: Wireless Personal Communications: An International Journal (1999)

One of the most widely used buzzwords in mobile communications of the recent years is Space Division Multiple Access (SDMA). The introduction of an additional space domain multiple access component is likely to boost system capacity, due to the spatial reuse of physical channels within one cell. While early approaches of SDMA system modelling show capacity to be gained in the order of 300 to 400%, there remains some more in depth system analysis to be done, as inhomogeneities in the user distribution are expected to likely cause dramatic drops in the additional capacity gained by SDMA. The spatial distribution of terminals directly influences the number of channels to be gained by spatial multiplexing. Therefore, it is not until detailed models for user distribution, user mobility and the traffic load generated by users are combined with a model of the SDMA radio subsystem, that realistic approximations for these capacity gains are possible. In this paper, we discuss the issues in modelling and simulation of SDMA systems. We present an approach for integrated SDMA system modelling, discuss analytic teletraffic dimensioning methods for macro- and microcellular environments and their relevance to SDMA systems, and present some early simulation results.
Performance Analysis of Multilevel Bus Networks for Hierarchical Multiprocessors
Authors: S. M. Mahmud
Venue: IEEE Transactions on Computers (1994)

A multiple bus system provides more bandwidth and a high degree of fault tolerance than a single bus system. But such a system becomes very expensive for a large number of processors and memory modules, due to the requirement of too many connections (switches). Lang (1983) proposed a different bus-based system, known as the partial multiple bus system, which requires a lower number of connections than a multiple bus system, but with a slight degradation in system performance. This paper presents a new type of bus-based system, called the multilevel bus system. Such a bus architecture can be used to design hierarchical multiprocessors. This bus-based system requires significantly less connections than multiple and partial multiple bus systems. This system is very cost-effective, as compared to multiple and partial multiple bus systems, when there exists some locality in the computations. Analytical and simulation models have been developed to determine the performance of both synchronous and asynchronous multilevel bus systems. The results obtained from the analysis show that a multilevel bus system performs fairly close to other bus-based systems for the hierarchical reference (HR) model. In the HR model, a processor accesses its nearest memory modules more frequently than other memory modules.
Managing Vulnerabilities in Networked Systems
Authors: Robert A. Martin
Venue: Computer (2001)

Most organizations recognize the importance of cyber security and are implementing various forms of protection. However, many are failing to find and fix known security problems in the software packages they use as the building blocks of their networks and systems, a vulnerability that a hacker can exploit to by-pass all other efforts to secure the enterprise. The Common Vulnerabilities and Exposures initiative seeks to avoid such disasters and transform this area from a liability to a key asset in the fight to build and maintain secure systems. Coordinating international, community-based efforts from industry, government, and academia, CVE strives to find and fix software product vulnerabilities more rapidly, predictably, and efficiently. The initiative seeks the adoption of a common naming practice for describing software vulnerabilities. Once adopted, these names will be included within security tools and services and on the fix sites of commercial and open source software package providers. As vendors respond to more user requests for CVE-compatible fix sites, securing the enterprise will gradually include the complete cycle of finding, analyzing, and fixing vulnerabilities.
Spectral Polynomial Chaos Solutions of the Stochastic Advection Equation
Authors: M. Jardak, C.-H. Su, G. E. Karniadakis
Venue: Journal of Scientific Computing (2002)

We present a new algorithm based on Wiener&ndash;Hermite functionals combined with Fourier collocation to solve the advection equation with stochastic transport velocity. We develop different stategies of representing the stochastic input, and demonstrate that this approach is orders of magnitude more efficient than Monte Carlo simulations for comparable accuracy.
Tracking Deformable Objects in the Plane Using an Active Contour Model
Authors: F. Leymarie, M. D. Levine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The problems of segmenting a noisy intensity image and tracking a nonrigid object in the plane are discussed. In evaluating these problems, a technique based on an active contour model commonly called a snake is examined. The technique is applied to cell locomotion and tracking studies. The snake permits both the segmentation and tracking problems to be simultaneously solved in constrained cases. A detailed analysis of the snake model, emphasizing its limitations and shortcomings, is presented, and improvements to the original description of the model are proposed. Problems of convergence of the optimization scheme are considered. In particular, an improved terminating criterion for the optimization scheme that is based on topographic features of the graph of the intensity image is proposed. Hierarchical filtering methods, as well as a continuation method based on a discrete sale-space representation, are discussed. Results for both segmentation and tracking are presented. Possible failures of the method are discussed.
Locating facilities by minimax relative to closest points of demand areas
Authors: J. Brimberg, G. O. Wesolowsky
Venue: Computers and Operations Research (2002)

This paper formulates a minimax location problem on the continuous plane where the destinations and even the facilities may be represented by areas instead of points. What is new is that the distance function measures shortest distance between any point on the facility and any point in the demand area. General properties of the model are discussed, and specialized results are obtained for rectangular distances.
Optimizing Sort Order Query Execution in Balanced and Nested Grid Files
Authors: Thomas A. Mueck, Manfred J. Schauer
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Disk input/output (I/O) efficient query execution is an important topic with respect to DBMS performance. In this context, we elaborate on the construction of disk access plans for sort order queries in balanced and nested grid files. The key idea is to use the order information contained in the directory of the multiattribute search structure. The presented algorithms are shown to yield a significant decrease in the number of disk I/O operations by appropriate use of the order information.Two algorithms for the construction of appropriate disk access plans are proposed, namely a greedy approach and a heuristic divide-and-conquer approach. Both approaches yield considerable I/O savings compared to straightforward query processing without consideration of any directory order information. The former performs well for small buffer page allocations, i.e., for a small number of buffer pages relative to the number of data buckets processed in the query. The latter is superior to the greedy algorithm with respect to the total number of I/O operations and with respect to the overall maximum of buffer pages needed to achieve the minimal number of disk I/O operations.Both approaches rely on a binary trie as a temporary data structure. This trie is used as an explicit representation of the order information. The storage consumption of the temporary data structure is shown to be negligible in realistic cases. Even for pathological cases with respect to degenerated balanced and nested grid files, reasonable upper bounds can be given.
Federal Biometric Technology Legislation
Authors: James L. Wayman
Venue: Computer (2000)

Voters in the United States expect the government to deliver more services to an increasing population in a more efficient, cost-effective, and fraud-free manner, while limiting the size and scope of the governmental infrastructure. Encouraged or mandated by federal legislation, governmental agencies at all levels have turned to technology in an attempt to meet these competing requirements. However, the very personal nature of this technology raises concerns about its potential impact on personal freedoms. Some people, however, are concerned with the potential impact that government use of these technologies might have on personal freedoms. In contrast with more impersonal alternatives like passwords or PINs, perhaps it is the very personal nature of biometric identification that raises these concerns. This article explains the varied areas of human life that will be affected by these technological advances: commercial licenses, immigration, employment eligibility, and welfare.The author believes the government's interest in bio-metric technologies is motivated by the desire to improve the delivery of services to citizens by increasing efficiency and convenience, while decreasing costs and fraud.
Semismooth Newton Methods for Operator Equations in Function Spaces
Authors: Michael Ulbrich
Venue: SIAM Journal on Optimization (2002)

We develop a semismoothness concept for nonsmooth superposition operators in function spaces. The considered class of operators includes nonlinear complementarity problem (NCP)-function-based reformulations of infinite-dimensional nonlinear complementarity problems and thus covers a very comprehensive class of applications. Our results generalize semismoothness and $\alpha$-order semismoothness from finite-dimensional spaces to a Banach space setting. For this purpose, a new infinite-dimensional generalized differential is used that is motivated by Qi's finite-dimensional C-subdifferential [Research Report AMR96/5, School of Mathematics, University of New South Wales, Australia, 1996]. We apply these semismoothness results to develop a Newton-like method for nonsmooth operator equations and prove its local q-superlinear convergence to regular solutions. If the underlying operator is $\alpha$-order semismooth, convergence of q-order $1+\alpha$ is proved. We also establish the semismoothness of composite operators and develop corresponding chain rules. The developed theory is accompanied by illustrative examples and by applications to NCPs and a constrained optimal control problem.
Application-driven processor design exploration for power-performance trade-off analysis
Authors: Diana Marculescu, Anoop Iyer
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper presents an efficient design exploration environment for high-end core processors. The heart of the proposed design exploration framework is a two-level simulation engine that combines detailed simulation for critical portions of the code with fast profiling for the rest. Our two-level simulation methodology relies on the inherent clustered structure of application programs and is completely general and applicable to any microarchitectural power/performance simulation engine. The proposed simulation methodology is 3-17X faster, while being sufficiently accurate (within 5%) when compared to the fully detailed simulator. The design exploration environment is able to vary different microarchitectural configurations and find the optimal one as far as energyxdelay product is concerned in a matter of minutes. The parameters that are found to affect drastically the core processor power/performance metrics are issue width, instruction window size, and pipeline depth, along with correlated clock frequency. For very high-end configurations for which balanced pipelining may not be possible, opportunities for running faster stages at lower voltage exist. In such cases, by using up to 3 voltage levels, the energyxdelay product is reduced by 23-30% when compared to the single voltage implementation.
Supporting Ranked Boolean Similarity Queries in MARS
Authors: Michael Ortega, Yong Rui, Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Mehrotra, Thomas S. Huang
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

To address the emerging needs of applications that require access to and retrieval of multimedia objects, we are developing the Multimedia Analysis and Retrieval System (MARS) [29]. In this paper, we concentrate on the retrieval subsystem of MARS and its support for content-based queries over image databases. Content-based retrieval techniques have been extensively studied for textual documents in the area of automatic information retrieval [40], [4]. This paper describes how these techniques can be adapted for ranked retrieval over image databases. Specifically, we discuss the ranking and retrieval algorithms developed in MARS based on the Boolean retrieval model and describe the results of our experiments that demonstrate the effectiveness of the developed model for image retrieval.
MicroTool: An Environment for Programming Microprocessors
Authors: James L. Elshoff, Michael Marcotty
Venue: IEEE Software (1991)

A description is given of MicroTool, a programming environment that reports programming errors immediately, blocking their entry into the database from which both executable code and documentation are derived. MicroTool's primary objective is to maintain a consistent database, meaning that the program is correct as far as MicroTool can tell. Aspects of MicroTool that are discussed include feedback to programmers; smart editing windows; address space layout; the program model; data definition; algorithm definition; combining edit, compile, and link; time and space measurement; and programming style.
A Generalised Approach to Similarity-Based Retrieval in Recommender Systems
Authors: David McSherry
Venue: Artificial Intelligence Review (2002)

Recommender systems for helping users to select from available products or services are increasingly common in electronic commerce. Typically in case-based reasoning (CBR) approaches to product recommendation, the items recommended are those that are most similar to a target query representing the elicited requirements of the user. Usually in practice, the user is required to specify a single preferred value for each attribute in the query. However, we argue that a more flexible approach to requirements elicitation is necessary to meet the needs of different users, ranging from those who know exactly what they are looking for to those whose requirements are vague in the extreme. We show how the standard approach to similarity-based retrieval can be generalised to support queries in which the user can enter any number of preferred values of a selected attribute, and examine the potential benefits of the approach.
Smart Cameras as Embedded Systems
Authors: Wayne Wolf, Burak Ozer, Tiehan Lv
Venue: Computer (2002)

Recent technological advances are enabling a new generation of smart cameras that represent a quantum leap in sophistication. While today's digital cameras capture images, smart cameras capture high-level descriptions of the scene and analyze what they see. These devices could support a wide variety of applications including human and animal detection, surveillance, motion analysis, and facial identification. Video processing has an insatiable demand for real-time performance. Smart cameras leverage very large-scale integration to meet this need in a low-cost, low-power system with substantial memory. Moving well beyond pixel processing and compression, these VLSI systems run a wide range of algorithms to extract meaning from streaming video. Recently, Princeton University researchers developed a first-generation smart camera system that can detect people and analyze their movement in real time. Because they push the design space in so many dimensions, these smart cameras are a leading-edge application for embedded system research.Mailbox-Based Scheme for Designing Mobile Agent Communication Protocols
Reliable Butterfly Distributed-Memory Multiprocessors
Authors: Nian-Feng Tzeng
Venue: IEEE Transactions on Computers (1994)

Since the butterfly network possesses various attractive topological properties and its constituent node has a fixed degree, independent of the system size, interconnecting processors in accordance with the butterfly topology to construct a distributed-memory multiprocessor is advantageous, especially for a large sized system. Every butterfly node in a multiprocessor so constructed is a processor, not simply a switch. In this paper, we examine a reliable butterfly-based multiprocessor that preserves its full rigid butterfly configuration even in the presence of faults. The proposed butterfly parallel system can tolerate any single and many multiple node/link failures, giving rise to significantly improved reliability. Reconfiguration in response to an operational fault in our design is easy and may be performed in a distributed manner. A system after reconfiguration is ensured to provide the same high performance. Reliability results show that our design compares favorably with an earlier design. An extension to this reliable design is also addressed.
Visualization and Genetic Algorithms in Minimax Theory for Nonlinear Functionals
Authors: Xiyu Liu, John Frazer, Ming Xi Tang
Venue: Journal of Scientific Computing (2003)

In this paper, evolution and visualization of the existence of saddle points of nonlinear functionals or multi-variable functions in finite dimensional spaces are presented. New algorithms are developed based on the mountain pass lemma and link thery in nonlinear analysis. Further more, a simple comparison of the steepest descent algorithm and the genetic algorithm is given. The process of the saddle point finding is visualised in an inteactive graphical interface.