ppxscal/embedding_network huggingface dataset:
Guest Editor's Introduction: Introducing the Itanium Processors
Authors: John Crawford
Venue: IEEE Micro (2000)

The press and the technical community have generated much excitement and speculation about the IA-64 instruction set and the Itanium processor. Intel and Hewlett-Packard have rolled out (one instruction at a time) the instruction set. Intel is rolling out (one transistor at a time) the Itanium processor and other platform components. This special issue provides the broad technical community with a comprehensive introduction to the concepts and mechanisms that form the basis of the IA-64 instruction set and the related Itanium processor products.
Analysis of Worst Case DMA Response Time in a Fixed-Priority Bus Arbitration Protocol
Authors: Joosun Hahn, Rhan Ha, Sang Lyul Min, Jane W.-S. Liu
Venue: Real-Time Systems (2002)

We propose a technique for finding the worst case response time (WCRT) of a DMA request that is needed in the schedulability analysis of a whole real-time system. The technique consists of three steps. In the first step, we find the worst case bus usage pattern of each CPU task. Then in the second step, we combine the worst case bus usage patterns of CPU tasks to construct the worst case bus usage pattern of the CPU. This second step considers not only the bus requests made by CPU tasks individually but also those due to preemptions among the CPU tasks. Finally, in the third step, we use the worst case bus usage pattern of the CPU to derive the WCRT of DMA requests assuming the fixed-priority bus arbitration protocol. Experimental results show that overestimation of the DMA response time by the proposed technique is within 20% for most DMA request sizes and that the percentage overestimation decreases as the DMA request size increases.
The Impact of Pipelined Channels on k-ary n-Cube Networks
Authors: S. L. Scott, J. R. Goodman
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

In a pipelined-channel interconnection network, multiple bits may be simultaneously inflight on a single wire. This allows the cycle time of the network to be independent of thewire lengths, significantly affecting the network design trade-offs. This paper investigatesthe design and performance of pipelined channel k-ary n-cube networks, with particularemphasis on the choice of dimensionality and radix. Networks are investigated under theconstant link width, constant node size and constant bisection constraints. We find thatthe optimal dimensionality of pipelined-channel networks is higher than that ofnonpipelined-channel networks, with the difference being greater under looser wiringconstraints. Their radix should remain roughly constant as network size is grown,decreasing slightly for some unidirectional tori and increasing slightly for some bi-directional meshes. Pipelined-channel networks are shown to provide lower latency and higher bandwidth than their nonpipelined-channel counterparts, especially for high-dimensional networks. The paper also investigates the effects of switching overhead and message lengths, indicating where results agree with and differ from previous results obtained for nonpipelined-channel networks.
A customizable view for web-based STEP data
Authors: Minsoo Kim, Seung J. Noh, Yeongho Kim, Suk-Ho Kang
Venue: Data Knowledge Engineering (2002)

A key to successful deployment of concurrent engineering is sharing of product data. We propose a new approach to sharing the product data on the Web. In a concurrent engineering environment, each participant who is as disparate as design, production, and purchase requires a different view depending on their roles and interests. Therefore, it is very important to support the individuals' data requirements. Our system supports views for custom-defined functionalities as well as predefined standardized views. The system allows individual users to design their own views. An important consideration is given to improve the system performance by maintaining indexes.
Efficient Rollback-Recovery Technique in Distributed Computing Systems
Authors: Ge-Ming Chiu, Cheng-Ru Young
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

In this paper we propose a new approach for implementing rollback-recovery in a distributed computing system. A concept of logical ring is introduced for the maintenance of information required for consistent recovery from a system crash. Message processing order of a process is kept by all other processes on its logical ring. Transmission of data messages are accompanied by the circulation of the associated order messages on the ring. The sizes of the order messages are small. In addition, redundant transmission of order information is avoided, thereby reducing the communication overhead incurred during failure-free operation. Furthermore, updating of the order information and garbage collection task are simplified in the proposed mechanism. Our approach does not require information about message processing order be written to stable storage; in fact, the time-consuming operations of saving information in stable storage are confined to the checkpointing activities. When failures occur, a surviving process need roll back only if some preceding order information is totally lost, which is relatively unlikely considering the ever growing speed of communication networks. It is shown that a system can recover correctly as long as there exists at least one surviving process.
Application of Homing Sequences to Synchronous Sequential Circuit Testing
Authors: I. Pomeranz, S. M. Reddy
Venue: IEEE Transactions on Computers (1994)

A test generation procedure for synchronous sequential circuits is proposed, that is based on the multiple observation times approach, and uses homing sequences, instead of conventionally used synchronizing sequences, to initialize the circuit. A procedure for computing homing sequences in sequential circuits, for which a state-table description is too large to be practical, is described, and experimental results are presented to demonstrate the effectiveness of the proposed test generation procedure.
Implementation and Performance of the Fast Hartley Transform
Authors: Tho Le-Ngoc, Minh Tue Vo
Venue: IEEE Micro (1989)

The authors investigated the implementation aspects of the fast Hartley transform (FHT) in both software and hardware. They describe the modifications required to convert existing fast Fourier transform (FFT) programs to execute FHTs, showing the ease with which these modifications can be implemented. They compare execution time and memory storage requirements of both transforms and present power spectrum calculation and convolution as illustrative examples to compare the performances of the two transform techniques. They also give a comparative survey of the performances of various microprocessors and digital signal processors in FFT and FHT computation.
Predicting the Expected Behavior of Agents that Learn About Agents: The CLRI Framework
Authors: José M. Vidal, Edmund H. Durfee
Venue: Autonomous Agents and Multi-Agent Systems (2003)

We describe a framework and equations used to model and predict the behavior of multi-agent systems (MASs) with learning agents. A difference equation is used for calculating the progression of an agent's error in its decision function, thereby telling us how the agent is expected to fare in the MAS. The equation relies on parameters which capture the agent's learning abilities, such as its change rate, learning rate and retention rate, as well as relevant aspects of the MAS such as the impact that agents have on each other. We validate the framework with experimental results using reinforcement learning agents in a market system, as well as with other experimental results gathered from the AI literature. Finally, we use PAC-theory to show how to calculate bounds on the values of the learning parameters.
Simulating Multimedia Systems with MVPSIM
Authors: Jihong Kim, Yongmin Kim
Venue: IEEE Design Test (1995)

We present the design and implementation of the highly integrated simulation environment (MVPSIM) for systems based on the MVP (Multimedia Video Processor) and our working experience with MVPSIM in designing and implementing a specific multimedia system. The MVPSIM consists of two simulation environments, the MVP software development environment and the hardware-software cosimulation environment. The MVP software development environment is based on an MVP instruction set simulator. The hardware-software cosimulation environment allows the system designers to simulate their designs at the system level with tight interactions between software and hardware components of a system. The first MVP-based multimedia system, MediaStation 5000, has been successfully completed with the extensive use of MVPSIM. The environment has been heavily utilized throughout the system design and test cycles. Because of the efficient system-level cosimulation of actual target application algorithms on top of the accurate system simulation models, the system designers were able to compare different system architectures, and test and refine their system design thoroughly with various system-level scenarios. When the first prototype of the MediaStation 5000 was assembled, the system integration went exceptionally well without experiencing any single logical error. The importance of the integrated simulation environment such as MVPSIM would increase as more systems are designed with the high level of integration using high-complexity devices. We have demonstrated, with a real-world multimedia system completed, that the highly-integrated environment could be constructed with reasonably low overhead and the benefits of using such environment throughout the system design and test cycles far outweigh the expenses.
Power-Driven Challenges in Nanometer Design
Authors: Dennis Sylvester, Himanshu Kaul
Venue: IEEE Design Test (2001)

Addressing fundamental challenges to designing high-performance ICs in nanometer-scale technologies, the authors advocate a flexible approach to limiting both dynamic and static power. They recommend global-signaling strategies to curb communication power requirements and thermal management techniques to ease the burden on packaging.
Real-Time Communication in Multihop Networks
Authors: D. D. Kandlur, K. G. Shin, D. Ferrari
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Communication in real-time systems has to be predictable, because unpredictable delaysin the delivery of messages can adversely affect the execution of tasks dependent onthese messages. We develop a scheme for providing predictable interprocesscommunication in real-time systems with (partially connected) point-to-pointinterconnection networks, which provide guarantees on the maximum delivery time formessages. This scheme is based on the concept of a real-time channel, a unidirectionalconnection between source and destination. A real-time channel has parameters thatdescribe the performance requirements of the source-destination communication, e.g.,from a sensor station to a control site. Once such a channel is established, thecommunications subsystem guarantees that these performance requirements will be met.We concentrate on methods to compute guarantees for the delivery time of messagesbelonging to real-time channels. We also address problems associated with allocatingbuffers for these messages and develop a scheme that preserves delivery timeguarantees.
An Optimal Graph-Construction Approach to Placing Program Signatures for Signature Monitoring
Authors: K. D. Wilken
Venue: IEEE Transactions on Computers (1993)

A new approach produces optimal signature placement for concurrent detection of processor and program-memory errors using signature monitoring. A program control-how graph, labeled with the overhead for placing a signature on each node and arc, is transformed into an undirected graph. For an order-independent signature function such as an XOR or arithmetic checksum, the undirected graph and a spanning tree algorithm are shown to produce an optimal placement in O(n log beta (n, m)) time. Cyclic codes, which are order dependent, are shown to allow significantly lower overhead than order-independent functions. Prior work suggests overhead is unrelated to signature-function type. An O(n) graph-construction algorithm produces an optimal signature placement for cyclic codes. Experimental data show that using a cyclic code and horizontal reference signatures, the new approach can reduce average performance overhead to a fraction of a percent for the SPEC89 benchmark suite, more than 9 times lower than the performance overhead of an existing O(n/sup 2/) placement algorithm.
Hierarchial generation of pareto optimal solutions in large-scale multiobjective systems
Authors: R. Caballero, T. Gómez, M. Luque, F. Miguel, F. Ruiz
Venue: Computers and Operations Research (2002)

In this paper, the problem of the determination of Pareto optimal solutions for certain large-scale systems with multiple conflicting objectives is considered. As a consequence, a two-level hierarchical method is proposed, where the global problem is decomposed into smaller multiobjective problems (lower level) which are coordinated by an upper level that has to take into account the relative importance assigned to each subsystem. The scheme that has been developed is an iterative one, so that a continuous information exchange is carried out between both levels in order to obtain efficient solutions for the initial global problem. The practical implementation of the developed scheme allows us to prove its efficiency in terms of processing time.
A Self-Organizing Knowledge Representation Scheme for Extensible Heterogeneous Information Environment
Authors: W. Sull, R. L. Kashyap
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The self-organizing knowledge representation aspects in heterogeneous information environments involving object-oriented databases, relational databases, and rulebases are investigated. The authors consider a facet of self-organizability which sustains the structural semantic integrity of an integrated schemea regardless of the dynamic nature of local schemata. To achieve this objective, they propose an overall scheme for schema translation and schema integration with an object-oriented data model as common data model, and it is shown that integrated schemata can be maintained effortlessly by propagating updates in local schemata to integrated schemata unambiguously.
Certification of Computational Results
Authors: Dwight S. Wilson, Gregory F. Sullivan, Gerald M. Masson
Venue: IEEE Transactions on Computers (1995)

We describe a conceptually novel and powerful technique to achieve fault detection and fault tolerance in hardware and software systems. When used for software fault detection, this new technique uses time and software redundancy and can be outlined as follows. In the initial phase, a program is run to solve a problem and store the result. In addition, this program leaves behind a trail of data which we call a certification trail. In the second phase, another program is run which solves the original problem again. This program, however, has access to the certification trail left by the first program. Because of the availability of the certification trail, the second phase can be performed by a less complex program and can execute more quickly. In the final phase, the two results are compared and if they agree the results are accepted as correct; otherwise an error is indicated. An essential aspect of this approach is that the second program must always generate either an error indication or a correct output even when the certification trail it receives from the first program is incorrect. We formalize the certification trail approach to fault tolerance and illustrate realizations of it by considering algorithms for the following problems: convex hull, sorting, and shortest path. We compare the certification trail approach to other approaches to fault tolerance.
Motion Parameter Estimation from Global Flow Field Data
Authors: R. Hummel, V. Sundareswaran
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Presented are two methods for the determination of the parameters of motion of a sensor, given the vector flow field induced by an imaging system governed by a perspective transformation of a rigid scene. Both algorithms integrate global data to determine motion parameters. The first (the flow circulation algorithm) determines the rotational parameters. The second (the FOE search algorithm) determines the translational parameters of the motion independently of the first algorithm. Several methods for determining when the function has the appropriate form are suggested. One method involves filtering the function by a collection of circular-surround zero-mean receptive fields. The other methods project the function onto a linear space of quadratic polynomials and measures the distance between the two functions. The error function for the first two methods is a quadratic polynomial of the candidate position, yielding a very rapid search strategy.
Self-Timed Boundary-Scan Cells for Multi-Chip Module Test
Authors: T. A. García, A. J. Acosta, J. M. Mora, J. Ramos, J. L. Huertas
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents a self-timed scan-path architecture, to be used in a conventional synchronous environment, and with basic application in digital testing and interconnections checking in a Smart-Substrate MCM (T.A. Garc&iacute;a, A.J. Acosta, J.M. Mora, J. Ramos, and J.L. Huertas, &ldquo;Self-Timed Boundary-Scan Cells for Multi-Chip Module Test,&rdquo; Proceedings of IEEE VLSI Test Symposium, April 1998, pp. 92&ndash;97). With this approach, the potential advantages of self-timed asynchronous systems are explored for their practical use in a classical MCM testing application. Three different self-timed asynchronous boundary scan cells are proposed (Sense, Drive and Drive Sense cells) that can be connected to form a self-timed scan-path. The main advantage is that no global test clock is needed, avoiding clock skew and synchronization faults in test mode, and hence, a more reliable test process is achieved. These cells have been designed and integrated in active substrates, building several boundary-scan configurations and being fully compatible with the ANSI/IEEE 1149.1 Standard. The experimental results, as well as their comparison with their synchronous counterparts, show the feasibility of the proposed self-timed approach for testing interconnections in a MCM.
Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation
Authors: Tuomas Sandholm
Venue: Autonomous Agents and Multi-Agent Systems (2000)

Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent is motivated to follow the strategy that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes: 1. OCSM-contracts in marginal cost based contracting, 2. leveled commitment contracts, 3. anytime coalition structure generation with worst case guarantees, 4. trading off computation cost against optimization quality within each coalition, 5. distributing search among insincere agents, and 6. unenforced contract execution. Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multi-agent systems move into large-scale open settings.
Similarity Searching in Medical Image Databases
Authors: Euripides G. M. Petrakis, Christos Faloutsos
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by attributed relational graphs holding features of objects and relationships between objects. The method relies on the assumption that a fixed number of "labeled" or "expected" objects (e.g., "heart," "lungs," etc.) are common in all images of a given application domain in addition to a variable number of "unexpected" or "unlabeled" objects (e.g., "tumor," "hematoma," etc.). The method can answer queries by example, such as "find all X-rays that are similar to Smith's X-ray." The stored images are mapped to points in a multidimensional space and are indexed using state-of-the-art database methods (R-trees). The proposed method has several desirable properties:Database search is approximate, so that all images up to a prespecified degree of similarity (tolerance) are retrieved.It has no "false dismissals" (i.e., all images qualifying query selection criteria are retrieved).It is much faster than sequential scanning for searching in the main memory and on the disk (i.e., by up to an order of magnitude), thus scaling-up well for large databases.
Minimization of the Intermodulation Distortion of a Nonlinearly Amplified OFDM Signal
Authors: M. Pauli, H.-P. Kuchenbecker
Venue: Wireless Personal Communications: An International Journal (1997)

In the course of development of the HIPERLAN-Standard OFDM (Orthogonal Frequency Division Multiplexing) was a possible candidate for the modulation scheme.An advantage of OFDM is that it can be implemented simply and that it is suitable for the transmission of high data rates in the mobile radio channel. Furthermore, it is insensitive against disturbances caused by multipath propagation. However, the OFDM signal shows a nonconstant envelope that leads to unwanted out-of-band radiation, in case the transmitter amplifier has a nonlinear characteristic.In this paper a method for the reduction of the fluctuation of the envelope of an OFDM signal is presented. Combined with a predistortion to linearize the characteristic of the transmitter amplifier an efficient method for the reduction of the out-of-band radiation results so that OFDM could prove to be a suitable modulation scheme for future mobile telecommunication applications.
Using Tickets to Enforce the Serializability of Multidatabase Transactions
Authors: D. Georgakopoulos, M. Rusinkiewicz, A. Sheth
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficulties, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of their existence. Based on this approach, we introduce optimistic and conservative multidatabase transaction management methods that require the local database systems to ensure only local serializability. The proposed methods do not violate the autonomy of the local database systems and guarantee global serializability by preventing multidatabase transactions from being serialized in different ways at the participating database systems. Refinements of these methods are also proposed for multidatabase environments where the participating database systems allow schedules that are cascadeless or transactions have analogous execution and serialization orders. In particular, we show that forced local conflicts can be eliminated in rigorous local systems, local cascadelessness simplifies the design of a global scheduler, and that local strictness offers no significant advantages over cascadelessness.