ppxscal/embedding_network huggingface dataset:
Preliminary Case Study on Software Reuse with Object Persistency Framework
Authors: Hiroshi Suganuma, Norikazu Kijima, Takeshi Nii, Kinya Nakamura
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Software reuse is considered one of the most effective ways of achieving higher productivity improvement. In this paper we propose an object persistency reuse framework toovercome the issues such as database connection handling problems, time consuming unit testing for database access modules, and larger maintenance cost due to the frequent changes in the target applications specifications.The OPRF consists of (1) SQL execution component, which provides the database connection and data conversion, (2) database connection component, which provides a mechanism to attach and detach to/from a web application server without source code changes, and (3) table access source code generator, which generates the table access components.We applied our technique to the several actual web application development projects. The study showed that 20%, 17%, and 30% cost reductions for implementation, unit testing/debugging, and maintenance respectively.
IBM System/390 Division: Overview of IBM System/390 Parallel Sysplex - A Commercial Parallel Processing System
Authors: Jeffrey M. Nick, Jen-Yao Chung, Nicholas S. Bowen
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Scalability has never been more a part of System/390 than with Parallel Sysplex. The Parallel Sysplex environment permits a mainframe or Parallel Enterprise Server to grow from a single system to a configuration of 32 systems (initially), and appear as a single image to the end user and applications. The IBM S/390 Parallel Sysplex provides capacity for today's largest commercial workloads by enabling a workload to be spread transparently across a collection of S/390 systems with shared access to data. By way of its parallel architecture and MVS operating system support, the S/390 Parallel Sysplex offers near-linear scalability and continuous availability for customers' mission-critical applications. S/390 Parallel Sysplex optimizes responsiveness and reliability by distributing workloads across all of the processors in the Sysplex. Should one or more processors fail, the workload is redistributed across the remaining processors. Because all of the processors have access to all of the data, the Parallel Sysplex provides a computing environment with near-continuous availability.
Document image database retrieval and browsing using texture analysis
Authors: John F. Cullen, Jonathan J. Hull, Peter E. Hart
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A system is presented that uses texture to retrieve and browse images stored in a large document image database. A method of graphically generating a candidate search image is used that shows the visual layout and content of a target document. All images similar to this candidate are returned for the purpose of browsing or further query. The system is accessed using a World Wide Web (Web) browser. Applications include the retrieval and browsing of document images including newspapers, fares and business letters.
An Efficient Fuzzy C-Means Clustering Algorithm
Authors: Ming-Chuan Hung, Don-Lin Yang
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The Fuzzy C-Means (FCM) algorithm is commonly used for clustering.The performance of the FCM algorithm depends on the selection of the initial cluster center and/or the initial membership value.If a good initial cluster center that is close to the actual final clustercenter can be found, the FCM algorithm will converge very quickly and the processing time can be drastically.In this paper, we propose a novel algorithm for efficient clustering.This algorithm is a modified FCM called the psFCM algorithm, which significantly reduces the computation timerequired to partition a dataset into desired cluster.We find the actual cluster center by using a simplified set of the original complete dataset.It refines the initial value of the FCM algorithm to speed up the convergence time.Our Experiments show that the proposed psFCM algorithm isAlgorithm.We also demonstrate that the quality of the Proposed psFCM algorithm is the same as the FCM algorithm.
Implementation and Performance Evaluation of Locust
Authors: Manish Verma, Tzi-cker Chiueh
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Locust is a distributed shared virtual memory system that exploits compile-time data dependency information to address the issues of false sharing, cache coherence overhead, and affinity process scheduling. This paper reports the results and their analysis of a comprehensive performance evaluation study of the first Locust prototype, which is implemented on a 12-node Pentium cluster running FreeBSD Unix and is fully operational for a year. The results show that for the set of regular programs tested, the performance of Locust is within 1-8% of that of message passing system implemented on the same hardware/software platform. The main performance gain of {\em Locust} as compared to existing weak cache consistency models mainly comes from the elimination of unnecessary synchronizations using the generational cache coherence protocol, and the function-shipping approach of implementing synchronization operations.
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
Authors: Dahai Xu, Chunming Qiao, Yizhi Xiong
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows that a heuristic algorithm can also have better overall performance than its time-consuming, Integer Linear Programming (ILP) based counterparts in the on-line case, which is non-intuitive.The proposed heuristic algorithm is useful for developing effective shared path (mesh) protection schemes that establish survivable connections in modern networks. The advantage of our heuristic algorithm over existing algorithms for finding a pair of link (or node) disjoint paths, Active Path (AP) and Backup Path (BP) comes from the following salient feature. It uses a so-called Potential Backup Cost (PBC) function when selecting an AP in thefirst phase, in order to take into consideration the backup bandwidth needed by the corresponding BP yet to be chosen in the second phase. The PBC function is derived mathematically based on rigorous statistical analysis of experimental data. While the use ofPBC only requires partial aggregate information on existing connections and distributed control, it can also be applied even more effectively when complete information is available.
Covering Problems with Hard Capacities
Authors: Julia Chuzhoy, Joseph (Seffi) Naor
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios.We obtain the following results. For the unweighted vertex cover problem with hard capacities we give a 3-approximation algorithm which is based on randomized rounding with alterations. We prove that the weighted version is at least as hard as the set cover problem. This is an interesting separation between the approximability of weighted and unweighted versions of a "natural" graph problem. A logarithmic approximation factor for both the set cover and the weighted vertex cover problem with hard capacities follows from the work of Wolsey [23] on submodular set cover. We provide in this paper a simple and intuitive proof for this bound.
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Authors: Ahmad Afsahi, Nikitas J. Dimopoulos
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several parallel benchmarks) that there exists communications locality, and that this locality is "structured". We have devised a number of heuristics that can "predict" the target of subsequent communication requests. This technique, can be applied to reconfigurable interconnects to hide the communications latency by reconfiguring the interconnect concurrently to the computation. By comparing the inter-communication computation times of a number of parallel benchmarks with some specific reconfiguration times, we argue that the computation interval can be used to hide the concurrent reconfiguration of the interconnect, and present the performance enhancements of the proposed heuristics.
A High Performance Hand-printed Numeral Recognition System with Verification Module
Authors: Jie Zhou, Qiang Gan, Ching Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a high performance off-line system for recognizing hand-printed numerals. An innovative verification module is applied which drastically improves the recognition rate. The approaches used in the modules are described. The importance of verification module is analysed in detail. A practical automatic form reading system TOCR V1.0 was developed based on the algorithms. The system was put into practical use in several provinces of China for statistical analysis of Revenue China. Test results are given based on 1)data collected when the system was used in China as well as 2)CENPARMI database.
Identifying Domain Axioms Using Binary Decision Diagrams
Authors: Barbara J. Czerny, Mats Per Erik Heimdahl
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Statically analyzing requirements specifications to assure that they possess desirable properties is a useful activity in any rigorous software development project. The analysis is performed on an abstraction of the original requirements specification. The abstractions in the model may lead to spurious errors in the analysis output. Spurious errors are errors that are reported to occur under certain conditions, but information abstracted from the model precludes the conditions from being satisfied in the original model. A high ratio of spurious errors to true errors in the analysis output makes it difficult, error-prone, and time consuming to find and correct the true errors. In this paper we describe a technique that uses Binary Decision Diagrams to help the analyst identify the abstractions that are leading to excessive spurious errors in the analysis output. Information about these abstractions can then be incorporated into the analysis to eliminate the corresponding spurious error reports.
Maintenance In a Dual-Lifecycle Software Engineering Process
Authors: M. Weisskopf, C. W. Irving, Charles McKay, Colin Atkinson, David Eichmann
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Dual lifecycle software processes have the potential to significantly improve the way in which suites of software applications are generated and sustained. However, several outstanding issues need to be more adequately addressed before the full potential of this philosophy can be realized. Detailed strategies for maintaining domain architectures in parallel with suites of fielded applications are at present particularly conspicuous by their absence. In this paper we present a dual-lifecycle maintenance process that was developed for the ROSE project, a major reengineering and repository-building effort in the domain of Flight Design and Dynamics. We present the major features of the process, the rationale behind these features, and changes which we feel would be beneficial based on lessons learned from the application of the process. The process is presented using a variant of the Fusion object-oriented design method known as ProFusion.
Formal Verification of Delayed Consistency Protocols
Authors: Fong Pong, Michel Dubois
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In a cache-coherent, shared-memory multiprocessor system, data consistency among cached copies can be delayed until synchronization points under relaxed memory consistency models. Some protocols called delayed consistency protocols take advantage of this flexibility to reduce cache miss rates and memory traffic. However, they are very complex and validating their correctness, even at the behavior level, is a challenge. We have successfully applied a new verification tool to verify the delayed consistency protocol at the behavior level. The method is called SSM [22] for Symbolic State Model. The contribution of this paper, besides verifying the protocol, is to demonstrate how to deal with relaxed memory models and latency tolerance hardware in the context of SSM.
Testing of embedded A/D converters in mixed-signal circuit
Authors: Naim Ben-Hamida, Bechir Ayari, Bozena Kaminska
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

In this paper, a complete functional testing of embedded ADC is presented. The integral non-linearity error, INLE, differential non-linearity error, DNLE, offset error, OSE, gain error and the signal-to-noise ratio, SNR are rested. The problem related to the propagation of the analog signal to the input of the ADC and the observation of the digital output of the converter at the output of the digital circuit are discussed. The two means for functional testing are discussed: the histogram and the FFT. To observe the outputs of the ADC at the digital circuit, the inverse function of the digital circuit is computed. This can be done by inverting the transfer function of the digital circuit whenever it is available. In the other case, when the digital circuit structure is available, the inverse of the digital circuit is found by boolean function manipulation.
Optimal single probe traversal algorithm for testing of MCM substrat
Authors: Rajesh Pendurkar, Abhijit Chatterjee, Craig Tovey
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

An algorithm for finding the optimal traversal route of a single probe to test MCM interconnects is presented. The goal of this work is to optimize the total distance traveled by a single test probe on an MCM substrate and thereby reduce the substrate testing time. It is assumed that only one terminal pad of each interconnection net is to be probed. Our algorithm is based on tour construction and improvement with arbitrary insertion for solving a complex variation of the traveling salesman problem. Improved insertion and shuffling techniques guarantee the step by step optimization of the total traversal cost. The validity of the algorithm has been confirmed with experiments and shows that up to 50% reduction in probe traversal time can be obtained with our technique.
Oblivious Deadlock-Free Routing in a Faulty Hypercube
Authors: Jin Suk Kim, Eric Lehman, Tom Leighton
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock-free routing algorithm for the hypercube. The algorithm tolerates a large number of faults in a worst-case configuration.
Network Performance under Physical Constraints
Authors: Fabrizio Petrini, Marco Vanneschi
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The performance of an interconnection network in a massively parallel architecture is subject to physical constraints whose impact needs to be re-evaluated from time to time. Fat-trees and low dimensional cubes have raised a great interest in the scientific community in the last few years and are emerging standards in the design of interconnection networks for massively parallel computers. In this paper we compare the communication performance of these two classes of interconnection networks using a detailed simulation model. The comparison is made using a set of synthetic benchmarks, taking into account physical constraints, as pin and bandwidth limitations, and the router complexity. In our experiments we consider two networks with 256 nodes, a 16-ary 2-cube and 4-ary 4-tree.
Construction of retrieval system for pictorial book of flora
Authors: Yasuhiko Watanabe, Makoto Nagao
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Pattern information and natural language information used together can complement and reinforce each other to enable more effective communication than can either medium alone. A good example is a pictorial book of flora (PBF). In the PBF, readable explanations combine texts and pictures. However, it is difficult to retrieve explanation text and pictures from the PBF when we don't know the names of flowers. To solve this problem, we propose a retrieval method for the PBF using the color feature of each flower and fruit, and construct an experimental retrieval system for the PBF. For obtaining the color feature of each flower and fruit, we analysed the PBF pictures and found several problems as follows: Pictures of the PBF contain many kinds of objects. In addition to flowers and fruits, there are leaves, stems, skies, soils, and sometimes humans in the PBF pictures. The position, size, and direction of flowers and fruits vary quite widely in each picture. Each flower and fruit has its unique shape, color, and texture which are commonly different from those of the others. Because of these problems, it is difficult to build the general and precise model for analyzing the PBF pictures in advance. We propose a method for image analysis using natural language information. Our method works as follows. First, we analyse the PBF explanation texts for extracting the color information on each flower and fruit. Then, we analyse the PBF pictures by using the results of the natural language processing, and finally obtain the color feature of each flower and fruit.
Improved On-Line Handwriting Recognition Using Context Dependent Hidden Markov Models
Authors: Andreas Kosmala, Jörg Rottland, Gerhard Rigoll
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents the introduction of context dependent Hidden Markov Models for cursive, unconstrained handwriting recognition with large vocabularies. Since context dependent models were successfully introduced to speech recognition, it seems obvious that the use of trigraphs could also lead to improved on-line handwriting recognition systems. In analogy to triphones in speech recognition, trigraphs are context dependent sub-word units representing a single written character in its left and right context.The tests were conducted on a writer dependent system with three different writers and two different vocabulary sizes (1000 words and 30000 words). The results we obtained with the trigraph-based system compared to the monograph system are very encouraging: A mean relative error reduction of 46% for the 1000 word handwriting recognition system and a mean relative error reduction of 37% for the same system with the 30000 word vocabulary. We believe that this represents one of the first systematic investigations of the influence of context dependent models and parameter reduction methods for a difficult large vocabulary handwriting recognition task.
Design and Implementation of a Network Application Architecture for Thin Clients
Authors: Chia-Chen Kuo, Ping Ting, Ming-Syan Chen, Jeng-Chun Chen
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper explores the issues and the techniques of enabling multimedia applications for the thin client computing. Our study on the network applications over thin clients is devoted to the universal plug-in architecture which supports multimedia applications over thin clients. With the proposed architecture, the universal plug-in technique is devised to shift jobs from thin clients to a supporting server, thus reducing the computing overhead required by the thin clients. In addition, this plug-in architecture is implemented and empirically evaluated. It is shown by our experiments that the proposed architecture not only significantly enhances the multimedia capability of thin clients but also reduces the memory consumed by the clients for various applications, showing the very advantage of the universal plug-in architecture for thin clients of limited resources.
Performance Evaluation of Single and Multiple-Gaussian Models for Skin Color Modeling
Authors: Tiberio S. Caetano, Silvia D. Olabarriaga, Dante Augusto Couto Barone
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present an experimental setup to evaluate the relative peiformance of single gaussian and mixture of gaussians models for skin color modeling. Firstly, a sample set of J, J 20, 000 skin pixels from a number of ethnic groups is selected and represented in the chromaticity space. In the following, parameter estimation for both the single gaussian and seven (with 2 to 8 gaussian components) gaussian mixture models is peiformed. For the mixture models, learningis carried out via the expectation-maximisation (EM) algorithm. In order to compare performances achieved by the 8 different models, we apply to each model a test set of 800images -none from the training set. 1rue skin regions, representing the ground truth, are manually selected, and false positive and true positive rates are computed for each value of a specific threshold. Finally, receiver operating characteristics (ROC) curves are plotted for each model, which make it possible to analyze and compare their relative performances. Results obtained show that, for medium to high true positive rates, mixture models (with 2 to 8 components) outperform the single gaussian model. Nevertheless. for low false positive rates, all the models behave similarly.
Association Rules Enhanced Classification of Underwater Acoustic Signal
Authors: Jie Chen, Haiying Li, Shiwei Tang
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Classification of underwater acoustic signal is one ofthe important fields of pattern recognition. Inspired bythe experience of training man experts in sonar, wepropose a two-phase training algorithm to exploit theassociation rules to reveal the understandable intrinsicrules contributing to correct classification in the knownmisclassification datasets in this paper. Preliminaryexperimental results demonstrate the potential ofclassification association rules to enhance the accuracyof classification of underwater acoustic signals.