ppxscal/embedding_network huggingface dataset:
Lock-Granularity Analysis Tools in SVR4/MP
Authors: Mark D. Campbell, Russ L. Holt
Venue: IEEE Software (1993)

The design of the SVR4/MP multiprocessing system with fine-grained locking is discussed. SVR4/MP scales efficiently to eight processors under a database transaction processing workload and typical multiuser benchmarks. In developing SVR4/MP, initial lock placement was deemphasized and rapid, iterative tuning of lock placement was the focus. Sophisticated tools were used to perform iterative overall performance and scalability tuning of the operating system. The tools developed to determine lock granularity quantitatively are described and an example of their use to optimize overall system efficiency is presented.
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation
Authors: Ismail H. Toroslu, Ghassan Z. Qadah
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms.
Dynamic Programming in Datalog with Aggregates
Authors: Sergio Greco
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Dynamic programming is a general technique for solving optimization problems. It is based on the division of problems into simpler subproblems that can be computed separately. In this paper, we show that Datalog with aggregates and other nonmonotonic constructs can express classical dynamic programming optimization problems in a natural fashion, and then we discuss the important classes of queries and applications that benefit from these techniques.
Using Patterns to Improve Our Architectural Vision
Authors: Norman L. Kerth, Ward Cunningham
Venue: IEEE Software (1997)

Christopher Alexander is an architect who invented the term "pattern" for use in building towns, homes, and offices. Kerth and Cunningham show how concepts in patterns and architecture for building may be applied in software. They explore the relationship between objects and architecture and propose that Alexander's concept of a "pattern language" can be used to fill the gap between the two-especially as project size increases.
A Unified Architecture for the Computation of B-Spline Curves and Surfaces
Authors: Meenakshisundaram Gopi, Swami Manohar
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

B-Splines, in general, and Non-Uniform Rational B-Splines (NURBS), in particular, have become indispensable modeling primitives in computer graphics and geometric modeling applications. In this paper, a novel high-performance architecture for the computation of uniform, nonuniform, rational, and nonrational B-Spline curves and surfaces is presented. This architecture has been derived through a sequence of steps. First, a systolic architecture for the computation of the basis function values, the basis function evaluation array (the BFEA), is developed. Using the BFEA as its core, an architecture for the computation of NURBS curves is constructed. This architecture is then extended to compute NURBS surfaces. Finally, this architecture is augmented to compute the surface normals, so that the output from this architecture can be directly used for rendering the NURBS surface.The overall linear structure of the architecture, its small I/O requirements, its nondependence on the size of the problem (in terms of the number of control points and the number of points on the curve/surface that have to be computed), and its very high throughput make this architecture highly suitable for integration into the standard graphics pipeline of high-end workstations. Results of the timing analysis indicate a potential throughput of one triangle with the normal vectors at its vertices, every two clock cycles.
Delay budgeting for a timing-closure-driven design method
Authors: Chien Chu Kuo, Allen C. H. Wu
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we present an RTL delay-budgeting approach for a timing-closure-driven design method. We formulate the delay-budgeting problem into the Lagrange-Multipliers-based slack distribution problem. We present two algorithms, namely the balanced slack distribution algorithm and the AT-based (Area-Time) slack distribution algorithm, to solve the problem. We also present a timing-closure-driven design flow by integrating commercial synthesis/layout tools with the proposed algorithms. We have demonstrated the viability of the proposed RTL delay-budgeting method. The results show that without an accurate AT-characteristic projection of modules the balanced slack distribution algorithm will be a good choice for delay budgeting at RTL.
Word processing and data entry computing services
Authors: Jon Todd Rickman, Mary Jane Sunkel, Jim Hobbs
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Word Processing is one of the fastest growing applications of computer technology in the world today. Academic and administrative word processing services can be supplied by stand-alone, central logic, and general computing equipment. The authors believe that schools that have found justification for teaching typing, keypunching or data entry courses in the past will find even greater justification for academic offerings that include at least the concepts of word processing. Such offerings will require planning to reduce total campus-wide expenditures for word processing and data entry equipment.Administrative uses of word processing are expanding in most institutions of higher education. Such systems need to communicate with computer stored files and have variable demands on the quality of word processing output.This paper will make the following distinction between data entry and word processing. Data entry involves record-oriented dated which are recorded and then manipulated further by traditional data processing. Word processing includes recording natural language text which in itself is the end product, a printed document.Curricula in institutions of higher education and post-secondary vocational training schools often include one or more degrees which emphasize secretarial skills and may include data entry using keypunch, key to disc, or key to tape equipment. We believe that such programs soon should be expanded to reflect the fact that use of word processing equipment is expected to continue to increase at a phenomenal growth rate.
Temporal Data Management
Authors: Christian S. Jensen, Richard Thomas Snodgrass
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

A wide range of database applications manage time-varying information. Existing database technology currently provides little support for managing such data. The research area of temporal databases has made important contributions in characterizing the semantics of such information and in providing expressive and efficient means to model, store, and query temporal data. This paper introduces the reader to temporal data management, surveys state-of-the-art solutions to challenging aspects of temporal data management, and points to research directions.
Thinking Outside the Box at the IHMC
Authors: Scott Hamilton
Venue: Computer (2001)

A decade ago, artificial intelligence research came under fire for being overhyped. Several projects now being conducted at The Institute for Human and Machine Cognition (IHMC) in Pensacola, Florida, may stimulate an AI renaissance. The author analyzes IHMC's human-centered computing approach to research and demonstrates how this approach embraces an interrelated collection of practical AI applications. IHMC applies technology to next-generation interfaces, knowledge modeling and sharing, intelligent agents, data mining, and extending human cognition. Scientists and researchers from diverse fields like computer science and engineering, medicine and cognitive psychology, statistics and mathematics, and the social sciences and philosophy are studying the complex phenomenon of human cognition. They aim to develop cognitive prostheses for augmenting our human capabilities and supplementing our human limitations. The IHMC's founders believed that the traditional academic architectonic by which universities divide knowledge reflected a focus on specialization that harmed cutting-edge research. The author describes how the interwoven research projects reflect the institute's interdisciplinary vision.
Toward Advanced Parallel Processing: Exploiting Parallelism at Task and Instruction Levels
Authors: Akira Fukuda, Kazuaki Murakami, Shinji Tomita
Venue: IEEE Micro (1991)

The status of two projects that entail the development of a reconfigurable parallel processor system with 128 Sparc microprocessors and a superscalar processor with four operations proceeding in parallel is discussed. The design principles, system configuration, processing element, network architecture, and memory architecture of the reconfigurable processors (called KRPP) are described. The operating system for KRPP is discussed. The architecture for the superscalar (called a dynamically hazard-resolved, statically code-scheduled, nonuniform superscalar) is presented.
Next-Generation Web Searches for Visual Content
Authors: Michael S. Lew
Venue: Computer (2000)

Although major search engines facilitate finding text on the Web, they typically have few or no capabilities for finding visual media. Many Web users--such as magazine editors or professional Web site designers--need to find images by using a few global features. With hundreds of millions of sites to search through, and 73 percent of the Web devoted to images, finding the exact image needed can be a daunting task.The author and his colleagues developed a prototype system called ImageScape to find visual media over intranets and the Web. The system integrates technologies such as vector-quantization-based compression of the image database and k-d trees for fast searching over high-dimensional spaces. The author claims that ImageScape is the only Web search engine that allows sketch- and icon-based queries.Commercial and academic institutions are working on new paradigms for visual searches including searching by icons, sketches, and similar images. These paradigms have the potential to bring the majority of Web information to anyone with a browser. The author projects that future research will focus on the fusion of visual learning techniques such as neural net-works and decision trees, combining them toward improving visual-concept detection accuracy.
A Cache Visualization Tool
Authors: Eric van der Deijl, Gerco Kanbier, Olivier Temam, Elena D. Granston
Venue: Computer (1997)

Cache performance strongly influences the overall performance of software. As a result, researchers continue to use cache simulators to analyze cache performance and optimization. Most cache simulators, however, provide only raw, global information. To improve cache performance, developers must better understand, for example, the impact of software optimizations and the behavior of new hardware cache designs. Cache behavior analysis is a two-step process: First, code sections with poor cache performance must be identified. Second, the causes for poor performance in these code sections must be understood. Cache profilers handle the first task. The authors' Cache Visualization Tool addresses the second task. It thus complements cache profilers. The tool both dynamically visualizes cache content and provides related statistics. A graphical X Windows tool, CVT has a main window that displays a grid representing the cache content. A cache is composed of cache blocks or cache lines (a set of words with consecutive addresses), and each box in the grid corresponds to a cache line. CVT is dedicated to visualizing cache behavior of selected code sections rather than identifying critical code sections. The authors therefore intend to plug the CVT into a profiler similar to CProf that would address the first phase. Furthermore, by collecting information during the profiling run, such as loop boundaries and array subscripts' coefficients, they intend to reduce the number of references that need to be traced.
An MPEG-4 Renderer for High Quality Video Composition and Texture Mapping
Authors: Quynh-Lien Nguyen-Phuc, Carolina Miro Sorolla
Venue: Journal of VLSI Signal Processing Systems (2003)

This paper presents the hardware architecture of a co-processor supporting the real time rendering of all 2D natural or synthetic visual objects proposed by the MPEG-4 standard as well as sprite decoding. It enables the composition and the transformation of natural video objects and the texture mapping on triangles, allowing the 2D-mesh decoding. This architecture is able to render scenes that are compliant with MPEG-4 Main Profile, Level3 and Hybrid Visual Profile. The co-processor is designed to be used in a shared memory system architecture. It consists in a dedicated implementation that seeks the best compromise between cost and performances. In a first step, a software model is used to guarantee the visual quality of the rendered scene and to validate the algorithmic choices. Then, the complexity and performances of this novel architecture are evaluated. Finally, a behavioral model validates the architectural choices.
Adaptive Split-and-Merge Segmentation Based on Piecewise Least-Square Approximation
Authors: X. Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The performance of the classic split-and-merge segmentation algorithm is severely hampered by its rigid split-and-merge processes, which are insensitive to the image semantics. The author proposes efficient algorithms and data structures to optimize the split-and-merge processes by piecewise least-square approximation of image intensity functions. This optimization aims at the unification of segment finding and edge detection. The optimized split-and-merge algorithm is shown to be adaptive to the image semantics and, hence, improves the segmentation validity of the previous algorithms. This algorithm also appears to work well on noisy sources. Since the optimization is done within the split-and-merge framework, the better segmentation performance is achieved at the same order of time complexity as the previous algorithms.
The complexity of solving equations over finite groups
Authors: Mikael Goldmann, Alexander Russell
Venue: Information and Computation (2002)

We study the computational complexity of solving systems of equations over a finite group. An equation over a group G is an expression of the form w1.w2....wk = 1G, where each wi is either a variable, an inverted variable, or a group constant and 1G is the identity element of G . A solution to such an equation is an assignment of the variables (to values in G) which realizes the equality. A system of equations is a collection of such equations; a solution is then an assigmnent which simultaneously realizes each equation. We show that the problem of determining if a (single) equation has a solution is NP-complete for all nonsolvable groups G. For nilpotent groups, this same problem is shown to be in P. The analogous problem for systems of such equations is shown to be NP-complete if G is non-Abelian, and in P otherwise. Finally, we observe some connections between these problems and the theory of nonuniform automata.
Fault Injection and Dependability Evaluation of Fault-Tolerant Systems
Authors: J. Arlat, A. Costes, Y. Crouzet, J. C. Laprie, D. Powell
Venue: IEEE Transactions on Computers (1993)

The authors describe a dependability evaluation method based on fault injection that establishes the link between the experimental evaluation of the fault tolerance process and the fault occurrence process. The main characteristics of a fault injection test sequence aimed at evaluating the coverage of the fault tolerance process are presented. Emphasis is given to the derivation of experimental measures. The various steps by which the fault occurrence and fault tolerance processes are combined to evaluate dependability measures are identified and their interactions are analyzed. The method is illustrated by an application to the dependability evaluation of the distributed fault-tolerant architecture of the Esprit Delta-4 Project.
Adaptive hierarchy of hidden Markov models for transformation-based adaptation
Authors: Jen-Tzung Chien
Venue: Speech Communication (2002)

Transformation-based adaptation, which transforms clusters of speaker-independent (SI) hidden Markov model (HMM) parameters to an enrolled speaker by using cluster-dependent transformation functions, is an effective algorithm for robust speech recognition. To obtain desirable performance for any amount of adaptation data, it is beneficial to establish a tree structure of HMM parameters and apply it to dynamically control the sharing of transformation parameters. Traditionally, the transformation sharing is determined by phonetic rules or by clustering the acoustic space of training data. The tree structure is then kept unchanged for speaker adaptation (SA). In this paper, we adapt the tree structure to new environment such that the transformation parameters can be extracted adaptively by referring to the newest hierarchy of HMM parameters. The adaptation of hierarchical tree is herein combined into the maximum likelihood (ML) estimation of transformation parameters. From a series of speaker adaptation experiments, we find that the transformation-based adaptation with adaptive hierarchy of HMM parameters outperforms that with the static hierarchy for different cases of tree depths and adaptation data lengths.
From Nationalism to Pragmatism: IT Policy in China
Authors: Kenneth L. Kraemer, Jason Dedrick
Venue: Computer (1995)

Since 1978, China has been transforming its centrally planned socialist economy into a "mixed" market system. China has also largely abandoned its nationalist technology strategy, aimed at achieving self-reliance, in favor of a more pragmatic strategy of importing advanced technologies and directing domestic R&D toward commercial purposes. This change has been evident in China's policies toward information technology (IT). The government has given up its goal of producing all classes of computers and is now focusing on increasing IT use and promoting production of personal computers, peripherals, and software. In addition, China is planning massive investments to expand and modernize its telecommunications network. These policies have resulted in rapid growth in IT use and production, but China still faces serious challenges in trying to develop a coordinated strategy for IT production, use, and infrastructure. These include bureaucratic infighting, problems with privatization of IT enterprises, and concerns about loosening control over the flow of information. The rapidly expanding Chinese market offers tremendous opportunities for foreign companies, but they are finding China a difficult place to do business.
Enabling trusted software integrity
Authors: Darko Kirovski, Milenko Drinić, Miodrag Potkonjak
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

Preventing execution of unauthorized software on a given computer plays a pivotal role in system security. The key problem is that although a program at the beginning of its execution can be verified as authentic, while running, its execution flow can be redirected to externally injected malicious code using, for example, a buffer overflow exploit. Existing techniques address this problem by trying to detect the intrusion at run-time or by formally verifying that the software is not prone to a particular attack.We take a radically different approach to this problem. We aim at intrusion prevention as the core technology for enabling secure computing systems. Intrusion prevention systems force an adversary to solve a computationally hard task in order to create a binary that can be executed on a given machine. In this paper, we present an exemplary system--SPEF--a combination of architectural and compilation techniques that ensure software integrity at run-time. SPEF embeds encrypted, processor-specific constraints into each block of instructions at software installation time and then verifies their existence at run-time. Thus, the processor can execute only properly installed programs, which makes installation the only system gate that needs to be protected. We have designed a SPEF prototype based on the ARM instruction set and validated its impact on security and performance using the MediaBench suite of applications.
An embedding theorem for fuzzy numbers on Banach spaces and its applications
Authors: Jianrong Wu
Venue: Fuzzy Sets and Systems (2002)

In this work, we give an embedding theorem for fuzzy number space N(X) on a Banach space X. As its applications, we show that some measurability concepts for fuzzy number valued mappings are equivalent, which partially solves an open problem given by Butnariu (Fuzzy Sets and Systems 31 (1989) 77). Additionally, we generalize some convergence theorems and Lusin Theorem to fuzzy random variables.
Efficient Group Coordination in Multicast Trees
Authors: H.-P. Dommel, J. J. Garcia-Luna-Aceves
Venue: The Journal of Supercomputing (2003)

The majority of today's Internet applications relies on point-to-point communication. In recent years, however, multipoint communication support has become the foundation for such applications as multiparty video conferencing, distributed interactive simulations, and collaborative systems. We describe a novel protocol to coordinate multipoint groupwork within the IP-multicast framework. The protocol supports Internet-wide coordination for large and highly-interactive groupwork, relying on the dissemination of coordination directives among group members across a shared end-to-end multicast tree. We also describe how addressing extensions to IP multicast can be used for our multisite coordination mechanism.
GeneVis: visualization tools for genetic regulatory network dynamics
Authors: C. A. H Baker, M. S. T Carpendale, P. Prusinkiewicz, M. G. Surette
Venue: Proceedings of the conference on Visualization '02 (2002)

GeneVis provides a visual environment for exploring the dynamics of genetic regulatory networks. At present time, genetic regulation is the focus of intensive research worldwide, and computational aids are being called for to help in the research of factors that are difficult to observe directly. GeneVis provides a particle-based simulation of genetic networks and visualizes the process of this simulation as it occurs. Two dynamic visualization techniques are provided, a visualization of the movement of the regulatory proteins and a visualization of the relative concentrations of these proteins. Several interactive tools relate the dynamic visualizations to the underlying genetic network structure.