ppxscal/embedding_network huggingface dataset:
Object-Oriented Database Access via Reflection
Authors: Raimund K. Ege
Venue: 23rd International Computer Software and Applications Conference (1999)

The object-oriented programming language Java is an ideal companion to an object-oriented database system. This paper describes our approach to provide an almost seamless application programmer interface that allows Java programs to exchange objects with a database. Unlike other approaches that add persistence capabilities to Java, our approach does not change the Java language nor does it require changes to the Java Virtual machine. We use reflection, i.e. self inspection and change of a running program, to map Java classes to database classes, and to enable persistence. The result is a very flexible and efficient style of Java database access.
Design for hierarchical testability of RTL circuits obtained by behavioral synthesis
Authors: Indradeep Ghosh, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Most behavioral synthesis and design for testability techniques target subsequent gate-level sequential test generation, which is frequently incapable of handling complex controller/data path circuits with large data path bit-widths. Hierarchical testing attempts to counter the complexity of test generation by exploiting information from multiple levels of the design hierarchy. We present techniques that add minimal test hardware to the given register-transfer level (RTL) design obtained through behavioral synthesis in order to ensure that all the embedded modules in the circuit are hierarchically testable. An important by-product of our DFT procedure is a system-level test set that is guaranteed to deliver pre-computed module test sets to each module in the RTL circuit. This eliminates the need to apply gate-level sequential test generation to the controller/data path. We performed extensive experiments with several complex data path/controller circuits synthesized by two different high level synthesis systems which do not target testability.
Mapping Techniques for Parallel Evaluation of Chains of Recurrences
Authors: Eugene V. Zima, Karthi R. Vadivelu, Thomas L. Casavant
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

If it is assumed, for discussion's sake, that "massive" means at least one thousand, there are probably at most one or two hundred massively parallel machines (i.e, machines with at least one thousand processors). This panel will focus on the APPLICATION AREAS that can make possible the "massive" sales of massively parallel machines. What (if any) APPLICATION AREAS can make possible the existence of a "massive" number of massively parallel machines in the five to ten year time frame? If there are no applications that can do this in five to ten years, then when will there be such applications and what will they be? Who are the USERS/CUSTOMERS that need massively parallel machines to perform these applications? What RESEARCH and DEVELOPMENT should the parallel processing ACADEMIC and INDUSTRIAL communities do to facilitate the use of parallel machines for these applications and users? That is, what are the PARTICULAR application domains that will lead to MASSIVE sales of massively parallel machines, what SPECIFIC software and hardware advances are needed for these applications, and PRECISELY who are the customers that should be pursued?
Addressing Dynamism in E-Negotiations by Workflow Management Systems
Authors: Sarita Bassil, Morad Benyoucef, Rudolf K. Keller, Peter G. Kropf
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Workflows (Wfs) are a major enabling technology for e-commerce. In our research, a Combined Negotiation (CN) is modeled and enacted using Wf technology. The modeling task captures the sequencing of the individual negotiations as well as the dependencies between them, and the enacting task runs the model. A CN support system (CONSENSUS) is used by the user to perform both tasks. Supporting dynamic modifications to the model during run-timeshould increase the benefits of our approach. In this paper, we highlight the need for such support by identifying the dynamic aspects that can occur while negotiating the different items of a package (i.e., the CN object). To address these aspects, we experimented using ADEPT, a Wf Management System supporting dynamism. This leads us to discuss the Wf Reference Model of the Wf Management Coalition, and suggest a "dynamic" extension to the current functional areas and architecture.
Analyzing Reconfigurable Algorithms for Managing Replicated Data with Strict Consistency Requirements: A Case Study
Authors: Ding-Chau Wang, Chih-Ping Chu, Ing-Ray Chen
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper, we address reconfigurable algorithms for managing replicated data with strict consistency requirements, that is, whenever the user performs an update operation, the update is applied to all reachable copies as part of the update protocol. A key issue of designing such algorithms is to determine ho w often one should detect and react to failure conditions so that reorganization operations can be performed at the appropriate time to improve the availability of replicated data. In this paper, we use dynamic voting as a case study to illustrate how often such failure detection and reconfiguration activities should be performed so as to maximum the data availability. The paper shows that there exists an optimal period at which the failure detection and reconfiguration activities should be performed to optimize the system availability. Stochastic Petri nets (SPNs) are used as a tool to facilitate our analysis.
Concurrent automatic test pattern generation algorithm for combinational circuits
Authors: Abdel-Fattah Yousif, Jun Gu
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The test generation problem for combinational circuits is known to be NP-hard. Efficient techniques for test generation are essential in order to reduce the test generation time. In this paper, we present a new and efficient test generation system based on global computations techniques. We aim at reducing the test generation time by using concurrent search to find tests for more than one fault at a time as opposed to the single target fault technique used by current test systems. In order to achieve our objective, a new, model for test generation is presented. We present a formal definition for the new test generation model and an implementation for the test generation system. Experimental results using ISCAS'85 and ISCAS'89 benchmarks are also presented.
Supporting Evolution and Maintenance of Components Using a Remote Service Architecture
Authors: Stuart Thomason, Pearl Brereton
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

As the software engineering community moves towards a programming philosophy in which integrators pull together disparate components from multiple sources, there is an increased need to control and record the configuration of systems as they evolve over time. This paper presents VACUUM, an approach to configuration management (CM) for components, and anarchitecture based around component warehouses, remote catalogues of components which can be accessed as plug-in services. It also describes a prototype implementation of the VACUUM CM system and associated architecture. It is shown that this work begins to addressthose factors identified as important to growth in the component marketplace, and also meets many of the established requirements for CM systems.
A Fast HMM Algorithm for On-line Handwritten Character Recognition
Authors: K. Takahashi, H. Yasuda, T. Matsumoto
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A fast HMM algorithm is proposed for on-line hand written character recognition. After preprocessing input stroke are discretized so that a discrete HMM is used. This particular discretization naturally leads to a simple procedure for assigning initial state and state transition probabilities. In the training phase, complete marginelization with respect to state is not performed(Constrained Viterbi). A simple smoothing/flooring procedure yields fast and robust learning. A criterion based on normalized maximum likelihood ratio is given for deciding when to create a new model for the same character in the learning phase, in order to cope with stroke order variations and large shape variations. Preliminary experiments are done on the new Kuchibue data base from Tokyo University of Agriculture and Technology. The results seem encouraging.
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
Authors: J. Choi
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The author presents a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and call it DIMMA (distribution-independent matrix multiplication algorithm). The algorithm is based on two new ideas; it uses a modified pipelined communication scheme to overlap computation and communication effectively, and exploits the LCM block concept to obtain the maximum performance of the sequential BLAS routine in each processor when the block size is too small as well as too large. The algorithm is implemented and compared with SUMMA on the Intel Paragon computer.
A Global Computing Environment for Networked Resources
Authors: Haluk Topcuoglu, Salim Hariri
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Current advances in high-speed networks and WWW technologies have made network computing a cost-effective, high-performance computing alternative. New software tools are being developed to utilize efficiently the network computing environment. Our project, called Virtual Distributed Computing Environment (VDCE), is a high-performance computing environment that allows users to write and evaluate networked applications for different hardware and software configurations using a web interface. In this paper we present the software architecture of VDCE by emphasizing application development and specification, scheduling, and execution/runtime aspects.
A new architectural-level fault simulation using propagation prediction of grouped fault-effects
Authors: Michael S. Hsiao, Janek H. Patel
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A new technique is proposed to handle fault simulation at the architectural level. The technique bypasses the need for complete gate level structure and efficiently uses the architectural information. Symbolic data representing groups of stuck at faults, known as fault effects, are propagated across the circuit with intelligent propagation prediction. Fault effects may combine and form new groups in the process. Automated behavioral simulation using only three data types is used to propagate fault effects at the architectural level by propagation prediction; no additional high level constraints or precomputation of faulty behavior are needed for simulation. Although not a fully deterministic algorithm, the results of ALFSIM, Architectural Level Fault Simulation, show high accuracy when compared with the gate level fault simulation.
Temporal Segmentation of Video Sequences for Content-Based Coding
Authors: Juliana F. Camapum Wanderly, Daniel C. Danna
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

In this paper, we present an overview of the state of the art of segmentation based video coding aimed at low-bit rate application. The most significant contribution is the algorithm for the segmentation of videoconference image sequences for content-based coding. The segmentation is based on motion estimation trough the computation of the optical flow field and motion segmentation by applying a Graph-Theoretical clustering. The algorithm will be added to the video codecs of the OpenH323 project which is based on H.323 ITU-T Recommendation. This visual collaboration environment for Desktop, composed of terminals, gatekeepers and MCU (Multipoint Control Unit), has already been implemented and tested. It is particularly convenient for academics implementation, the software is freely distributed, and its code can be modified according to the needs of the user. However, the first tests using the H.261 codec showed a video delay of 3 seconds, confirming the need to optimize the video codec.
Fast Euclidean Distance Transform using a Graph-Search Algorithm
Authors: Roberto de Alencar Lotufo, Alexandre X. Falcão, Francisco A. Zampirolli
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

Two new Euclidean distance transform algorithms are described. The algorithms are designed using a shortest path graph-search framework. The distance transform can be seen as the solution of a shortest path forest problem. Previous works have dealt with the Euclidean distance transform (EDT) and with the shortest path forest problem, but none of them have presented an EDT using the graph-search approach. The proposed algorithms are very simple and yet belong to the class of one of the most efficient sequential algorithms. The algorithms easily extend to higher dimensions.
Trust Services: A Framework for Service-Based Solutions
Authors: Adrian Baldwin, Simon Shiu, Marco Casassa Mont
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

It is well understood that using a software component methodology can simplify the development and maintenance of systems. Web services allow this vision to be extended allowing components to be made available on the Internet. This paper proposes the use of trust services as third party web services that allow trust operations to be extracted from solutions and packaged as components. This has obvious advantages in simplifying the task of engendering trust in solutions ¿ both during their creation and in simplifying the maintenance.The paper further argues that using a web service model supports re-usability of not only the software but also the operational environment where the software runs. This operational environment is considered particularly critical in providing security and trust operations.
Omnifont and Unlimited-Vocabulary OCR for English and Arabic
Authors: Issam Bazzi, Chris LaPre, John Makhoul, Chris Raphael, Richard M. Schwartz
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

on We present a set of techniques for omnifont, unlimited-vocabulary OCR, within the context of a system based on Hidden Markov Models (HMM). First, we address the issue of how to perform OCR on omnifont and multi-style data, such as plain and italic, without the need to have a separate model for each style. The amount of training data from each style, which is used to train a single model, becomes an important issue in the face of the conditional independence assumption inherent in the use of HMMs. We demonstrate mathematically and empirically how to allocate training data among the different styles to alleviate this problem. Second, we show how to use a word-based HMM system to perform character recognition with unlimited vocabulary. The method includes the use of a trigram language model on character sequences. Using all these techniques, we have achieved character error rates of 1.1% on data from the University of Washington English Document Image Database and 3.3% on data from the DARPA Arabic OCR Corpus.
Non-uniformly Sampled Feature Extraction Method for Kanji Character Recognition
Authors: Keiji Yamada
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a non-uniform sampling method for obtaining local orientation features to be used in the recognition of Japanese kanji characters. The proposed method determines feature extraction as sampling features one-dimensionally in a direction perpendicular to a given line orientation. Furthermore, it samples features at non-uniform intervals so as to avoid misidentifying two lines in close proximity as a single line. It has been tested with handwritten kanji characters, and the results show a good ability to distinguish kanji characters with similar shapes which can easily confuse conventional recognition methods that rely on uniform sampling of local orientation features.
Prefix-Preserving IP Address Anonymization: Measurement-Based Security Evaluation and a New Cryptography-Based Scheme
Authors: Jun Xu, Jinliang Fan, Mostafa H. Ammar, Sue B. Moon
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Real-world traffic traces are crucial for Internet research, but only a very small percentage of traces collected are made public. One major reason why traffic trace owners hesitate to make the traces publicly available is the concern that confidential and private information may beinferred from the trace. In this paper we focus on the problem of anonymizing IP addresses in a trace. More specifically, we are interested in prefix-preserving anonymization in which the prefix relationship among IP addresses is preserved in the anonymized trace, making such a trace usable in situations where prefix relationships are important. The goal of our work is two fold. First, we develop a cryptography-based, prefix-preserving anonymization technique that is provably as secure as the existing well-known TCPdpriv scheme, and unlike TCPdpriv, provides consistent prefix-preservation in large scale distributed setting. Second, we evaluate the security properties inherent in all prefix-preserving IP address anonymization schemes (including TCPdpriv). Through the analysis of Internet backbone traffic traces, we investigate the effect of some types of attacks on the security of any prefix-preserving anonymization algorithm. We also derive results for the optimum manner in which an attack should proceed, which provides a bound on the effectiveness of attacks in general.
LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint
Authors: Masakazu Seno, George Karypis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Over the years, a variety of algorithms or finding frequentitemsets in very large transaction databases have been developed. The key feature in most to these algorithms is that they use a constant support constraint to control the inherently exponential complexity of the problem. In general, itemsets that contain only a few items will tend to be interesting if they have a high support, whereas long itemsets can still be interesting even if their support is relatively small. Ideally, we desire to have an algorithm that finds all the frequent itemsets whose support decreases as a function of their length. In this paper we present an algorithm called LPMiner, that finds all itemsets that satisfy a length-decreasing support constraint. Our experimental evaluation shows that LPMiner is up to two orders of magnitude faster than the FP-growth algorithm or finding itemsets at a constant support constraint, and that its runtime increasesgradually as the average length of the transactions (and the discovered itemsets) increases.
PENS: A Predictive Event Notification System for e-Commerce Environment
Authors: Jun-Jang Jeng, Youssef Drissi
Venue: 24th International Computer Software and Applications Conference (2000)

In the e-Commerce market, we identified the need for an intelligent system that has the capacity to make the customers well informed. One form of information capture and discovery is through the services of event notification equipped with prediction capability. With such capability, an e-Commerce participant can leverage (near) real-time prediction regarding almost every area in the e-Commerce market, ranging from stock selection to market trends. This paper describes a predictive event notification system called PENS. This system is part of the effort to enrich our e-Commerce platform. PENS is presented from two different perspectives: the event notification service and the event prediction service. PENS has been applied to the domain of product support services and generated satisfactory results for the customers. The high-level description of PENS' architecture and implementation is given in this paper.
The Cooperative Hypermedia Approach to Collaborative Engineering and Operation of Virtual Enterprises
Authors: Weigang Wang, Jörg M. Haake, Jessica Rubart
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Current information technology for Extended Enterprise (EE) and virtual enterprises is fragmented. Shared, dynamic and holistic enterprise models are not adequately supported. In this paper, we analyze the requirements on modeling languages, infrastructures, and tools for supporting the EE life cycle. We take a model-driven approach to technology integration. Our approach is based on a cooperative hypermedia-based dynamic holistic enterprise model. The dynamic aspects are supported by the tailorability and extensibility of the model and tools. The holistic modeling is realized by integrating modeling constructs needed for all the important aspects of an enterprise and by integrating cooperative modeling, process enactment and computational simulation capabilities into a cooperative system operating upon the same model. The model is presented as graphical hypermedia structures for team members to manipulate it cooperatively. The resulting system, XCHIPS, is an extensible cooperative hypermedia system that provides comprehensive support for cooperative engineering and operation of virtual enterprises.
Performance prediction for portable parallel execution on MIMD architectures
Authors: Gopal Chillariga, Balkrishna Ramkumar
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Performance debugging and prediction for parallel systems is a difficult problem. The difficulties in identifying performance bottlenecks stem from the need for an intimate understanding of the underlying architecture. It has been recognized that portability is an important requirement for parallel program development. However, this makes the task of performance debugging even more difficult. In this paper, we present a simulation based approach for performance prediction of portable-parallel programs. We demonstrate it using Charm: a message driven programming environment, which provides program portability across a variety of shared and distributed memory MIMD parallel systems. The proposed approach makes it possible to use a single debugging environment for the development of portable parallel software. This environment can provide correctness and performance debugging support that provides the developer with valuable feedback for improving program performance.
Criteria of Virtual University Operation
Authors: Timothy K. Shih
Venue: 24th International Computer Software and Applications Conference (2000)

Administration, awareness, and assessment are the three criteria of virtual university operation. This position paper points out the basic requirements of the 3 A's and proposes questions to the operation of virtual university.