ppxscal/embedding_network huggingface dataset:
Instruction generation for hybrid reconfigurable systems
Authors: Ryan Kastner, Seda Ogrenci-Memik, Elaheh Bozorgzadeh, Majid Sarrafzadeh
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. The algorithm is general and can be applied to any type of graph, including directed graphs and hypergraphs. We discuss how to target the algorithm towards the novel problem of instruction generation and selection for a hybrid (re)configurable systems. In particular, we target the Strategically Programmable System, which embeds complex computational units like ALUs, IP blocks, etc. into a configurable fabric. We argue that an essential compilation step for these systems is instruction generation, as it is needed to specify the functionality of the embedded computational units. Additionally, instruction generation can be used to create soft macros -- tightly sequenced pre-specified operations placed in the configurable fabric.
Compression: A Key for Next-Generation Text Retrieval Systems
Authors: Nivio Ziviani, Edleno Silva de Moura, Gonzalo Navarro, Ricardo Baeza-Yates
Venue: Computer (2000)

As online textual information explodes through the widespread use of digital libraries, office automation systems, document databases, and the Web, the need arises for an effective information retrieval (IR) system. The Web alone comprises approximately 800 million static pages, containing 6 trillion bytes of plain text--enough to store the text of a million books. Today's IR systems face the dynamic challenge of providing rapid and immediate access to this textual mass.Recent methods have demonstrated that directly searching compressed text is faster than searching original text and that flexible word searching improves the amount of compression obtained.Text compression focuses on finding ways to represent actual text in less space. This process involves replacing text symbols with equivalent symbols that use fewer bits or bytes. Text compression is attractive because it is cost efficient, requires less storage space, speeds up data transmittal, and reduces search time.The authors discuss the recent techniques that allow fast and direct searching of compressed text, and they explain how these techniques can improve the overall efficiency of IR systems.
Language Portability Across Shared Memory Multiprocessors
Authors: G. Alaghband, M. S. Benten, R. Jakob, H. F. Jordan, A. V. Ramanan
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Explains why the Force parallel programming language has been easily portable betweeneight different shared memory multiprocessors. The authors show how a two-layer macroprocessor allows them to hide machine dependencies and to build machine-independenthigh-level language constructs. The importance of packaging low-level synchronizationoperations is demonstrated by a proof of mutual exclusion for asynchronous variableoperations. The Force constructs enable one to write portable parallel programs largely independent of the number of processes executing them.
A Fault-Tolerant GEQRNS Processing Element for Linear Systolic Array DSP Applications
Authors: Fred J. Taylor, Jeremy C. Smith
Venue: IEEE Transactions on Computers (1995)

In this work, the design of a Galois enhanced quadratic residue number system (GEQRNS) [9], [7] processor is presented, which can be used to construct linear systolic arrays. The processor architecture has been optimized to perform multiply-accumulate type operations on complex operands. The properties of finite fields have been exploited to perform this complex multiplication in a manner which results in greatly reduced hardware complexity. The processor is also shown to have a high degree of tolerance to manufacturing defects and faults which can occur during operation. The combination of these two factors makes this an ideal candidate for array signal processing applications, where high complex arithmetic data rates are required. A prototype processing element has been fabricated in 1.5 ¿m CMOS technology, which is shown to operate at 40 MHz.
Weaving Together Requirements and Architectures
Authors: Bashar Nuseibeh
Venue: Computer (2001)

Twin Peaks intertwines software requirements and architectures to achieve incremental development and speedy delivery.
Test Generation for Current Testing (CMOS ICs)
Authors: Phil Nigh, Wojciech Maly
Venue: IEEE Design Test (1990)

Current testing is useful for testing CMOS ICs because it can detect a large class of manufacturing defects, including defects that traditional stuck-at fault testing misses. The effectiveness of current testing can be enhanced if built-in current sensors are applied on-chip to monitor defect-related abnormal currents in the power supply buses. Such sensors have proved effective for built-in self-test. However, current testing requires the use of a special method to generate test vectors. The authors describe this method, which differs from that for traditional voltage-oriented testing, and postulate a test-generation algorithm for both on-chip and off-chip current testing. The algorithm uses realistic fault models extracted directly from the circuit layout.
Case study on the adaptation of interactive visualization applications to web-based production for operational mesoscale weather models
Authors: Lloyd A. Treinish
Venue: Proceedings of the conference on Visualization '02 (2002)

Visualization is required for the effective utilization of data from a weather simulation. Appropriate mapping of user goals to the design of pictorial content has been useful in the development of interactive applications with sufficient bandwidth for timely access to the model data. When remote access to the model visualizations is required the limited bandwidth becomes the primary bottleneck. To help address these problems, visualizations are presented on a web page as a meta-representation of the model output and serve as an index to simplify finding other visualizations of relevance. To provide consistency with extant interactive products and to leverage their cost of development, the aforementioned applications are adapted to automatically populate a web site with images and interactions for an operational weather forecasting system.
Toward Inquiry-Based Education Through Interacting Software Agents
Authors: Daniel E. Atkins, William P. Birmingham, Edmund H. Durfee, Eric J. Glover, Tracy Mullen, Elke A. Rundensteiner, Elliot Soloway, José M. Vidal, Raven Wallace, Michael P. Wellman*Authors are listed alphabeticall
Venue: Computer (1996)

The University of Michigan Digital Library (UMDL) project is creating an infrastructure for rendering library services over a digital network. When fully developed, the UMDL will provide a wealth of information sources and library services to students, researchers, and educators. Tasks are distributed among numerous specialized modules called agents. The three classes of agents are user interface agents, mediator agents, and collection interface agents. Complex tasks are accomplished by teams of specialized agents working together-for example, by interleaving various types of search. The UMDL is being deployed in three arenas: secondary-school science classrooms, the University of Michigan library, and space-science laboratories. The development team expects the scale and diversity of the project to test their technical ideas about distributed agents, interoperability, mediation, and economical resource allocation.
Choosing the Brain(s) of an Embedded System
Authors: Thomas M. Conte
Venue: Computer (2002)

When you design an embedded system, you aren't worried about whether AMD beats Intel at 2 gigahertz. Embedded processors are fundamentally different from desktop processors-costs are too tight for fancy chipsets and expensive packaging. Instead of "faster is better," the purchasing philosophy for embedded processors is "fast enough is good enough." Instead of "64 bits or bust," it's "8 or 16 bits will do just fine."
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
Authors: M. Y. Chan, S. J. Lee
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The focus is on the following graph-theoretic question associated with the simulation ofcomplete binary trees by faulty hypercubes: if a certain number of nodes or links areremoved from an n-cube, will an (n-1)-tree still exists as a subgraph? While the generalproblem of determining whether a k-tree, k>n, still exists when an arbitrary number ofnodes/links are removed from the n-cube is found to be NP-complete, an upper bound isfound on how many nodes/links can be removed and an (n-1)-tree still be guaranteed toexist. In fact, as a corollary of this, it is found that if no more than n-3 nodes/links areremoved from an (n-1)-subcube of the n-cube, an (n-1)-tree is also guaranteed to exist.
Maintainability Techniques in Developing Large Expert Systems
Authors: David S. Prerau, Alan S. Gunderson, Robert E. Reinke, Mark R. Adler
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The production of understandable and maintainable expert systems using the current generation of multiparadigm development tools is addressed. This issue is discussed in the context of COMPASS, a large and complex expert system that helps maintain an electronic telephone exchange. As part of the work on COMPASS, several techniques to aid maintainability were developed and successfully implemented. Some of the techniques were new, others were derived from traditional software engineering but modified to fit the rapid prototyping approach of expert system building. An overview of the COMPASS project is presented, software problem areas are identified, solutions adopted in the final system are described and how these solutions can be generalized is discussed.
Collaboratories: Doing Science on the Internet
Authors: Richard T. Kouzes, James D. Myers, William A. Wulf
Venue: Computer (1996)

The term collaboratory was coined when William Wulf merged "collaboration" and "laboratory" to describe a "...center without walls, in which the nation's researchers can perform their research without regard to geographical location--interacting with colleagues, accessing instrumentation, sharing data and computational resources, and accessing information in digital libraries." To what degree can we realize this potential? Computer scientists working with domain specialists have made progress on several fronts to facilitate immersive electronic interaction. A new paradigm for intimate collaboration among scientists is thus emerging that will accelerate the development and dissemination of basic knowledge, optimize the use of research instruments, and minimize the time between discovery and application. However, both technical and sociological challenges remain. A collaboratory is a new, artificial environment that must be socially acceptable to the people who participate, and it must improve their ability to work. Many computing tools must be brought together and integrated to allow seamless interaction. Some of these tools, such as electronic mail and the WWW, are already in wide use, while others, like tele-presence, are still being created.
Generic Object Recognition: Building and Matching Coarse Descriptions from Line Drawings
Authors: R. Bergevin, M. D. Levine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Primal access recognition of visual objects (PARVO), a computer vision system that addresses the problem of fast and generic recognition of unexpected 3D objects from single 2D views, is considered. Recently, recognition by components (RBC), which is a new human image understanding theory, based on some psychological results, has been proposed as an explanation of how PARVO works. However, no systematic computational evaluation of its many aspects has yet been reported. The PARVO system discussed is a first step toward this goal, since its design respects and makes explicit the main assumptions of the proposed theory. It analyzes single-view 2D line drawings of 3D objects typical of the ones used in human image understanding studies. It is designed to handle partially occluded objects of different shape and dimension in various spatial orientations and locations in the image plane. The system is shown to successfully compute generic descriptions and then recognize many common man-made objects.
Adaptive Bandwidth Reservation and Admission Control in QoS-Sensitive Cellular Networks
Authors: Sunghyun Choi, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

How to keep the probability of hand-off drops within a prespecified limit is a very important Quality-of-Service (QoS) issue in cellular networks because mobile users should be able to maintain ongoing sessions even during their hand-off from one cell to another. In order to keep the hand-off dropping probability below a prespecified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes for bandwidth reservation for the hand-offs of ongoing sessions and the admission control of new connections. We first develop a method to estimate user mobility based on an aggregate history of hand-offs observed in each cell. This method is then used to probabilistically predict mobiles' directions and hand-off times in a cell. For each cell, the bandwidth to be reserved for hand-offs is calculated by estimating the total sum of fractional bandwidths of the expected hand-offs within a mobility-estimation time window. Three different admission-control schemes for new connection requests using this bandwidth reservation are proposed. We also consider variations that utilize the path/location information available from the car navigation system or global positioning system (GPS). Finally, we evaluate the performance of the proposed schemes extensively to show that they meet our design goal and outperform the static reservation scheme under various scenarios.
Computer-assisted cel animation: post-processing after inbetweening
Authors: Ji Lu, Hock Soon Seah, Feng Tian
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Although 2D animation production today has become more efficient with the help of improved computer technology, it is still very labor intensive. The less creative inking/painting and inbetweening processes take a significant portion of the total work. Our Computer-assisted Cel Animation (CACAni) research aims at automating the above two processes to assist animators in producing their work faster and with better quality. In this paper, a post-processing algorithm for generating inbetween frames is proposed. Algorithms for generating inbetweenings, particularly, the Feature-based Matching (MFBA) of keyframes and linear inbetween frame generation are also introduced. Images constructed with MFBA may have gaps (artefacts) due to the lack of smoothness among adjacent displacement vectors as well as the discrete feature of rasterization. With the guidance of displacement vectors, our algorithm classifies the gaps into several categories and handles them accordingly. The results are compared with those processed by filtering method to show the superiority of the new algorithm.
SEE: A Spatial Exploration Environment Based on a Direct-Manipulation Paradigm
Authors: Sudhir R. Kaushik, Elke A. Rundensteiner
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

The need forproviding effective tools for analyzing and querying spatial data is becoming increasingly important with the explosion of data in applications such as geographic information systems, image databases, CAD, and remote sensing. The SEE (Spatial Exploration Environment) is the first effort at applying direct-manipulation visual information seeking (VIS) techniques to spatial data analysis by visually querying as well as browsing spatial data and reviewing the visual results for trend analysis. The SEE system incorporates a visual query language (SVIQUEL) that allows users to specify the relative spatial position (both topology and direction) between objects using direct manipulation. The quantitative SVIQUEL sliders (S-sliders) are complemented by the qualitative Active-Picture-for-Querying (APIQ) interface that allows the user to specify qualitative relative position queries. APIQ provides qualitative visual representations of the quantitative query specified by the S-sliders. This increases the utility of the system for spatial browsing and spatial trend discovery with no particular query in mind. The SVIQUEL queries are processed using a k-Bucket index structure specifically tuned for incremental processing of the multidimensional range queries that represent the class of queries that can be expressed by SVIQUEL. We have also designed a tightly integrated map visualization that helps to preserve the spatial context and a bar visualization that provides a qualitative abstraction of aggregates and enables the user to visualize the results of the spatial query as well as the nonspatial attributes of the underlying spatial objects. The SEE system has been fully implemented as an applet using JDK1.1.4. Finally, we compare the spatial exploration environment (SEE) technology with alternative spatial query environments with respect to its querying power and the ease of querying.
BKM: A New Hardware Algorithm for Complex Elementary Functions
Authors: J. -C. Bajard, S. Kla, J. -M. Muller
Venue: IEEE Transactions on Computers (1994)

A new algorithm for computing the complex logarithm and exponential functions is proposed. This algorithm is based on shift-and-add elementary steps, and it generalizes some algorithms by Briggs and De Lugish (1970), as well as the CORDIC algorithm. It can easily be used to compute the classical real elementary functions (sin, cos, arctan, ln, exp). This algorithm is more suitable for computations in a redundant number system than the CORDIC algorithm, since there is no scaling factor when computing trigonometric functions.
Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance
Authors: D. M. Blough, A. Pelc
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Algorithm-based fault tolerance has been proposed as a technique to detect incorrectcomputations in multiprocessor systems. In algorithm-based fault tolerance, processorsproduce data elements that are checked by concurrent error detection mechanisms. Weinvestigate the efficacy of this approach for diagnosis of processor faults. Becausechecks are performed on data elements, the problem of location of data errors must firstbe solved. We propose a probabilistic model for the faults and errors in a multiprocessorsystem and use it to evaluate the probabilities of correct error location and faultdiagnosis. We investigate the number of checks that are necessary to guarantee errorlocation with high probability. We also give specific check assignments that accomplishthis goal. We then consider the problem of fault diagnosis when the locations oferroneous data elements are known. Previous work on fault diagnosis required that thedata sets produced by different processors be disjoint. We show, for the first time, thatfault diagnosis is possible with high probability, even in systems where processorscombine to produce individual data elements.
Design and Implementation of a Hybrid Agent Platform
Authors: Li Chunlin, Lu Zhengding, Li Layuan
Venue: Programming and Computing Software (2003)

This paper presents IMAP, a hybrid agent platform composed of several cooperating intelligent agents and mobile agents. IMAP is implemented in Java and Prolog. Java is used to implement the framework of the system, and in particular for supporting the communication between agents and mobility of agent, while Prolog is used to implement both adduction and derivation mechanisms. IMAP intends to independently employ the underlying derivation/adduction and mobility mechanism. In IMAP, intelligent agent and mobile agent can not only fully exploit individual virtue, but also cooperate to perform a task under a uniform platform. Intelligent agents in IMAP are equipped with hypothetical reasoning capabilities, performed by means of adduction: if the knowledge available to an agent is insufficient to solve a query, the agent could adduce new hypotheses. Each intelligent agent can accept queries from mobile agents by means of the interface module, each query is passed to the reasoning module of intelligent agent which performs a derivation and adduction in order to get an answer for mobile agent. IMAP also provides mobile agents a flexible and efficient coordination mechanism and a reliable migration mechanism, and supports persistence of agent state and agent security. Mobile agent's coordination mechanism exploits the advantages of the XML language and Linda-like coordination. This programmable Linda-like coordination mechanism suits the mobility and openness of the Internet application, XML standard for Internet data representation may guarantee a high-degree of interoperability between heterogeneous environments. The design and implementation key technologies of IMAP are described in this paper. An Internet based auction application example shows the suitability and the effectiveness of the IMAP, and its performance evaluation is also made. Finally, some conclusions and remarks are given.
The IEC/IEEE Train Communication Network
Authors: Hubert Kirrmann, Pierre A. Zuber
Venue: IEEE Micro (2001)

Railway operators and manufacturers have standardized a data communication network that interconnects programmable equipment between and within rail vehicles. This data bus architecture offers a basis for standardization of future railways applications.
The Challenges of Using COTS Software in Component-Based Development
Authors: Jeffrey M. Voas
Venue: Computer (1998)

An increasing number of organizations are using software applications of larger applications. In this new role, acquired software must integrate with other software functionality. In the introduction to the cover features, the author describes why the industry is moving toward a software design paradigm in which many of the needed software functions already exist. The developer's task, then, becomes one of accurately selecting functions and integrating them into a system. The problem is that commercial, off-the- shelf (COTS) software is almost always delivered in a black box with restrictions that keep developers from looking inside. Therefore, most forms of software analysis that would help developers decide if the software is going to perform safely, securely, and reliably are not available. Developers are thus at the mercy of the software vendor in many ways. The author argues that to achieve the goal of widespread component-based engineering, the industry must overcome challenges related to safety, reliability, and security. If the industry cannot adequately address these problems, the goal may remain unmet.