ppxscal/embedding_network huggingface dataset:
Fault-Tolerant Multicasting in Multistage Interconnection Networks
Authors: Jinsoo Kim, Jaehyung Park, Jung Wan Cho, Hyunsoo Yoon
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

In this paper, we study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerance multicasting, which employs the restricted header encoding schemes. The proposed approach is based on a recursive scheme in order to send a multicast packet to the desired destinations detouring faulty element(s). In the proposed fault-tolerant multicasting, a multicast packet is routed to its own destinations in only two passes through the MIN having a number of faulty elements by exploiting its nonblocking property.
SOPView+: an object browser which supports navigating database by changing base object
Authors: Sung-Woo Chang, Hyoung-Joo Kim
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

We present the design and implementation of SOPView+, an object browser that supports navigation of a large database by changing the base object. The base object is an object which is a basis for navigation; forward navigation is provided for the reference paths ahead of the base object and backward navigation for the ones behind it. SOPView+ allows users to change the base object along the reference hierarchy among a number of database objects; this makes it possible for them to explore a large database until they find objects of their interest on the limited screen space, solving the screen real estate problem. SOPView+ also supports extended synchronized browsing, which synchronizes displaying objects along both forward and backward navigational paths.
A Groupware Benchmark Based on Lotus Notes
Authors: Kenneth Moore, Michelle Peterson
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In this paper, we propose a new benchmark for groupware systems. It incorporates elements of previous messaging, text retrieval, and database benchmarks. The benchmark is based on groupware functions found in Lotus Notes, but should be adaptable by any groupware system.
A Transparent Object-Oriented Schema Change Approach Using View Evolution
Authors: Young-Gook Ra, Elke A. Rundensteiner
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

When a database is shared by many users, updates to the database schema are almost always prohibited because there is a risk of making existing application programs obsolete when they run against the modified schema. This paper addresses the problem by integrating schema evolution with view facilities. When new requirements necessitate schema updates for a particular user, the user specifies schema changes to the personal view rather than to the shared base schema. Our view evolution approach then computes a new view schema that reflects the semantics of the desired schema change, and replaces the old view with the new one. We present algorithms that implement the set of schema evolution operations typically supported by OODB systems as view definitions. This approach provides the means for schema change without affecting other views (and thus without affecting existing application programs). The persistent data is shared by different views of the schema, i.e., both old as well as newly developed applications can continue to interoperate. In this paper, we present examples that demonstrate our approach.
Requirement Capturing and 3CR Approac
Authors: Sergey Baranov, Vsevolod Kotlyarov, Julia V. Kapitonova, Alexander A. Letichevsky, Vladislav A. Volkov
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

An approach to requirement capturing based on formal methods is described with preliminary results of its application to particular industrial projects. The respective software ADE tool has been developed and is under piloting.
Distributing Tokens on a Hypercube without Error Accumulation
Authors: Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A simple algorithm is presented operating in time \O(\log p + m\cdot\log\log p) on average.
An Evaluation of the Use of PDAs for Reading Course Materials
Authors: Jennifer Waycott
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper reports a study that evaluated the use of PDAs as tools for reading course materials on a distance education course. The findings are discussed with reference to activity theory to explain how new tools are integrated into existing activities.
A Proposed Method for Creating VCR Functions using MPEG Streams
Authors: David B. Andersen
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The development of video-on-demand (VOD) systems for movie delivery requires that the user be able to perform VCR functions over a broadband network system. These functions include Play, Pause, Fast Forward, and Fast Rewind. No standard method exists between content developers, server manufacturers and client applications to provide these functions. This paper proposes a standard method for implementing these functions using MPEG streams and discusses some of the important tradeoffs. The encoding and distribution of content has become one of the most important issues facing video information providers. Today, in the case of movies, every service provider must encode the material for the specific equipment being deployed in the network. Therefore, the ease of use and speed of the algorithms employed to encode the material are extremely important. In the future, the creator of the content may encode the material once and distribute it to the service providers in compressed form, but this is not the case today due to the lack of standards.
Machine responsibility-how to deal with it
Authors: Sandy Tyndale-Biscoe, Bryan Wood
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

IT systems play an ever increasing role in business, commerce, government and services, and can be involved in making decisions that carry enormous implications. This implies that these machines carry responsibility for those decisions and for their outcomes. This paper considers the implications of such "machine responsibility" both for the enterprise concerned and for the IT system, and how the issues involved can be addressed through enterprise modelling using the Enterprise Language of the Reference Model for Open Distributed Processing (RM-ODP) as part of an overall system specification approach.
Metadata Support for Safe Component Upgrades
Authors: Premysl Brada
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Component platforms play a major role in current distributed information systems. As these systems evolve, components need to be upgraded without breaking the consistency of component interconnections. In this paper we present a method for the support of automated safe upgrades of black-box components. It relates component versioning with indication of changes between revisions of the same component and uses pre-computed information stored in component metadata. We show how this information is derived from component specifications and used to speed up pre-upgrade checks.
Visualizing Inner Structures in Multimodal Volume Data
Authors: Isabel H. Manssour, Sergio S. Furuie, Sílvia D. Olabarriaga, Carla Maria Dal Sasso Freitas
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. With the evolution of medical image acquisition techniques, the capacity and fidelity of image-based diagnosis were extended. The current trend is to acquire information using multiple sources to help medical diagnosis, but the integration of the multivariate data into a single 3-D representation is non-trivial. Techniques for the visualization of multimodal volume data have been developed with the goal of finding suitable strategies to integrate characteristics of multiple data sets into a single visual representation. Likewise, several techniques are dedicated to the exploration of different ways of incorporating seeing-through capabilities into volume rendering techniques. This paper presents a new approach to visualize inner structures in multimodal volume data, which is based in the utilization of cutting tools.
Increasing and Detecting Memory Address Congruence
Authors: Samuel Larsen, Emmett Witchel, Saman P. Amarasinghe
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence information at compile-time enables new classes of program optimization. In this paper, we present methods for forcing congruence among the dynamic addresses of a memory reference. We also introduce a compiler algorithm for detecting this property. Our transformations do not require interprocedural analysis and introduce almostno overhead. As a result, they can be incorporated into real compilation systems.On average, our transformations are able to achieve a five-fold increase in the number of congruent memory operations. We are then able to detect 95% of these references. This success is invaluable in providing performance gains in a variety of areas. When congruence information is incorporated into a vectorizing compiler, we can increase the performance of a G4 AltiVec processor up to a factor of two. Using the same methods, we are able to reduce energy consumption in a data cache by as much as 35%.
Analysis of conditional resource sharing using a guard-based control representation
Authors: Ivan P. Radivojevic, Forrest Brewer
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of throughput is desired. In this paper, an exact and efficient conditional resource sharing analysis using a guardbased control representation is presented. The analysis is transparent to a scheduler implementation. The proposed technique systematically handles complex conditional resource sharing for cases when folded (software pipelined) loops include conditional behavior within the loop body.
A Log Compression Algorithm for Operation-based Version Control Systems
Authors: Haifeng Shen, Chengzheng Sun
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Version control systems are widely used to support distributed concurrent software development, where document merging is a key function. Most existing systems adoptstate-based merging, which relies on the derivation of deltas among documents. The derivation of deltas involves transferring documents over the network and executing time-consuming text differentiation algorithms, which may result in a poor system response. Operation-based merging saves executed operations in logs as deltas, thus eliminating theneed for deriving deltas. However, for the operation-based merging to be adopted in version control systems, a major technical challenge is how to keep the size of logs small so that it requires less time to transfer the log over the network and to re-execute operations in the log. In this paper, we contribute a novel compression algorithm, which is able to minimize the size of a log as well as the number of operations within it. It has been proven both correct and complete in the sense that the compressed log has the same effect as the original one and operations that can be merged have already been merged.
Characterizing and Distinguishing Text in Bank Cheque Images
Authors: José Eduardo Bastos Dos Santos, Bernard Dubuisson, Flávio Bortolozzi
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The most common goal of automatic bank cheque treatment systems is the recognition ofhandwritten information. However, in order to do this, it is necessary to use a reliable and efficient process able to identify and to extract the information, which can then be submitted to a further recognition phase. In this paper we present a process for identifying and distinguishing between handwritten information and machine printed text based on a set of local features. This process is based on the characterization of textual elements via properties derived from their content and their shape. The main advantage of this process compared with other similar approaches is that no a priori information of the treated document is used, thus making it more generic and effective.
Accuracy vs. performance in parallel simulation of interconnection networks
Authors: Doug Burger, David A. Wood
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Parallel simulation is emerging as the dominant technique for studying parallel computers. However the interconnection networks of these machines can be modeled at many different levels of abstraction, allowing researchers to trade off accuracy and performance. We use the Wisconsin Wind Tunnel, a parallel simulator for cache-coherent shared-memory machines, to study the trade-offs of accuracy versus performance for six different network simulation models. We evaluate these models for a variety of parallel applications, cache-coherence protocols, and topologies. We show that only the two most expensive models-which model contention at individual links-are robust in the presence of high network loads or non-uniform traffic patterns.
STREAMOBILE: Pay-per-View Video Streaming to Mobile Devices Over the Internet
Authors: Josep Domingo-Ferrer, Antoni Martínez-Ballesté
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

As new mobile communication technologies are becoming broadly available, there is urgent pressure to populate them with services that provide returns for the huge investements made by telecom operators. Services around video transmission are expected to play a key role: news broadcasting, video conferencing, movie channels, on-line gambling, etc. The goal of the STREAMOBILE project is to demonstrate an Internet pay-per-view distribution system toward GPRS and UMTS mobile devices. Copyright-protected contents are streamed to the customer and a micropayment scheme is used so that contents are not paid for in advance, but as they are being received by the customer. This paper presents an evolving prototype, whose client software has been designed in such a way that it can be easily migrated to 3G mobile devices.
Optimal Multicast with Packetization and Network Interface Support
Authors: Ram Kesavan, Dhabaleswar K. Panda
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Modern networks typically limit the size of the largest packet for efficient communication. Thus, long messages are packetized and transmitted. Such networks also provide network interface support for nodes, which typically includes a coprocessor and memory, to implement the lower layers of the communication protocol. This paper presents a concept of smart network interface support for packetization and an optimal multicast algorithm for systems with such support. Two implementations of smart network interface, First-Child-First-Served (FCFS) and First-Packet-First-Served (FPFS), are studied and compared. It is shown that the FPFS network interface support is more practical and efficient. Next, the components of multicast latency under FPFS implementation are analyzed by using a pipelined model. A concept of k-binomial tree is introduced, and proved to be optimal for multicasting under the FPFS scheme. A method to construct contention-free k-binomial trees on contention-free orderings of the nodes is presented. For a 64-node system with irregular network, simulation results indicate that the optimal k-binomial tree is upto 2 times better than the conventional binomial tree for a range of multicast set sizes and message lengths. Thus, these results demonstrate significant potential to be applied to current and future generation high performance systems including MPPs and NOWs, where network interface support for multicast is provided.
The Augmint multiprocessor simulation toolkit for Intel x86 architectures
Authors: Anthony-Trung Nguyen, Maged Michael, Arun Sharma, Josep Torrella
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Most publicly available simulation tools only simulate RISC architectures. These tools cannot capture the instruction mix and memory reference patterns of CISC architectures. We present an overview of Augmint, an execution driven multiprocessor simulation toolkit that fills this gap by supporting Intel x86 architectures. Augmint also supports trace driven simulation for uniprocessors as well as multiprocessors, with minor effort on the part of simulator developers. Augmint runs m4 macro extended C and C++ applications such as those in the SPLASH and SPLASH-2 benchmark suites. Augmint supports a thread based programming model with shared global address space and private stack space. Augmint supports a simulator interface compatible with that of the MINT simulation toolkit for MIPS architectures, thus allowing the reuse of most architecture simulators written for MINT. Augmint simulations run on x8d based uniprocessor systems under Unix or Windows NT. The source code of Augmint is publicly available from http://www.csrd.uiuc.edu/iacoma/augmint.
Incremental Support Vector Machine Construction
Authors: Carlotta Domeniconi, Dimitrios Gunopulos
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

SVMs suffer from the problem of large memory requirement and CPU time when trained in batch mode on large data sets. We overcome these limitations, and at the same time make SVMs suitable for learning with data streams, by constructing incremental learning algorithms.We first introduce and compare different incremental learning techniques, and show that they are capable of producing performance results similar to the batch algorithm, and in some cases superior condensation properties. We then consider the problem of training SVMs using stream data. Our objective is to maintain an updated representation of recent batches of data. We apply incremental schemes to the problem and show that their accuracy is comparable to the batch algorithm.
The use of random simulation in formal verification
Authors: Florian Krohm, Andreas Kuchlmann, Arjen Mets
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

In this paper we present the application of random simulation in formal verification of functional equivalence of hardware designs. We demonstrate that random simulation can effectively complement BDD-based verification approaches in three areas: (1) quick generation of counter example pattern for miscomparing designs, (2) exhaustive comparison of small functions, and (3) providing meaningful signatures for design partitioning based on functionally equivalent cut-points. The presentation describes a smooth and efficient integration of a simulation algorithm into a general verification framework. In this framework the simulator can be applied as one of various engines for Boolean reasoning the outcome of which might be undecided.
The MEA Framework: A New Perspective for the Development of Situation-Specific Methods
Authors: Colin J. Hardy, Helen M. Edwards, J. Barrie Thompson
Venue: 23rd International Computer Software and Applications Conference (1999)

The aim of the MEA (Method Engineering Activity) framework is to support the process of creating situation and project-specific methods for Information Systems development. In order to contextualize the work and to assist in understanding why we believe this approach is necessary, this abstract provides a brief overview of the issues that have driven the development of the framework.Structured methods are created and have evolved to support the process of systems development, yet we are in a situation where only a relatively small proportion of developers use them. In addition, of those who do use methods, the majority feel the need to adapt them to suit individual projects. This dissatisfaction with the methods is not new. There is a steady stream of new methods and approaches hitting the market that promise more relevance than methods that have gone before and yet each of them only provides a slightly different view of the design process.
Handwritten Word Recognition Using Lexicon Free and Lexicon Directed Word
Authors: Malayappan Shridhar, Gilles F. Houle, Fumitaka Kimura
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper discusses the relative merits and complexities of two word recognition algorithms: lexicon directed and lexicon free techniques. This algorithm operates on a pre-segmented word image and yields the optimum concatenation of the image segments for each word in the lexicon. However, the computational complexity of this algorithm is quite high, as the optimum concatenation is required for every word in the lexicon. In the lexicon free word matching process, the character likelihood for all the letters are calculated and the maximum likelihood value and the associated letter are determined. In this approach an optimum string results from the concatenation process. The word matching process is applied only once for an input word image. Comparative results with regard to accuracy, speed and size of lexicon are presented.
Performance Evaluation of Fault Tolerance for Parallel Applications in Networked Environments
Authors: Pierre Sens
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Bertil Folliot This paper presents the performance evaluation of a software fault manager for distributed applications. Dubbed STAR, it uses the natural redundancy existing in networks of workstations to offer a high level of fault tolerance. Fault management is transparent to the supported parallel applications. STAR is application independent, highly configurable and easily portable to UNIX-like operating systems. The current implementation is based on independent checkpointing and message logging. Measurements show the efficiency and the limits of this implementation. The challenge is to show that a software approach to fault tolerance can efficiently be implemented in a standard networked environment.