ppxscal/embedding_network huggingface dataset:
A Parallel Algorithm for Singular Value Decomposition as Applied to Failure Tolerant Manipulators
Authors: Tracy D. Braun, Anthony A. Maciejewski, Howard Jay Siegel
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The system of equations that govern kinematically redundant manipulators is commonly solved by finding the singular value decomposition (SVD) of the corresponding Jacobian matrix.This can require considerable amounts of time to compute, thus a parallel SVD algorithm minimizing execution time is sought. The approach employed here lends itself to parallelization by using Givens rotations and information from previous decompositions.The key contributions of this research include the presentation and implementation of a new variation of a parallel SVD algorithm to compute the SVD for a set of post-fault Jacobians. Results from implementation of the algorithm on a MasPar MP-1 and an IBM SP2 are provided.Specific issues considered for each implementation include how data is mapped to the processing elements, the effect that increasing the number of processing elements has on execution time, and the type of parallel architecture used.
Some Results on Automatic Structures
Authors: Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We study the class of countable structures which can be presented by synchronous finite automata. We reduce the problem of existence of an automatic presentation of a structure to that for a graph. We exhibit a series of properties of automatic equivalence structures, linearly ordered sets and permutation structures. These serve as a first step in producing practical descriptions of some automatic structures or illuminating the complexity of doing so for others.
Online Upgrades Become Standard
Authors: Louise E. Moser, P. M. Melliar-Smith, L. A. Tewksbury
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Significant efforts are now underway to develop middleware standards, within the Object Management Group (OMG), the Java Community Process and the Service Availability Forum, for the online upgrading of application software while that software continues to provide service. In this paper we highlight the main features of the proposed OMG online upgrade specification. We also present several online upgrade scenarios and give an example use case of the online upgrade specification.
Farming Methodology for TMN Platform Independent Class Repository Design
Authors: Soo-Hyun Park, Sang-Hoon Park, Doo-Kwon Baik
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

As the agents in a TMN system are constructed based on different platform, there are some problems in development, maintenance & administration of class in distributed object (DO). To solve these problems, this paper suggests Farming methodology, which originated from network computing concept. With the methodology, the redundant software and data components in the distributed objects are moved to platform independent class repository (PICR) in the form of componentware. When the PICR is constructed, several aspects of TMN are considered. After setting up the framework of DO, some small componentwares are loaded dynamically to DO, while others are loaded statically. DO's can do self-adapt componentware for the evolution of network environment while the TMN system is running.
Can CORBA Fulfill Data Transfer Requirements of Industrial Enterprises?
Authors: Dirk Thißen, Claudia Linnhoff-Popien, Steffen Lipperts
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The globalization of industrial enterprises leads to problems caused by the heterogeneity of hard- and software. To overcome these problems, distributed platforms can be used. Yet, much work remains to be done on distributed platforms before they actually can meet industrial needs. For example, there is no standardized mechanism for asynchronous data transfer and no possibility to transmit so-called container objects. In this paper we look at different methods of data transfer based on the Common Object Request Broker Architecture (CORBA), which are synchronous, oneway, retarded synchronous and asynchronous data transfer. Based upon the requirements of different enterprises, several experiments to realize an optimal CORBA-based data transfer will be studied.
Business Component Identification - A Formal Approach
Authors: Hemant Jain, Naresh Chalimeda, Navin Ivaturi, Balarama Reddy
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Component Based Software Development is carried out in two phases: Component Building and Application Assembly. The key to building business components is a formal approach for identifying the components. This paper describes such an approach, which assists in identifying the components from an Analysis Level Object Model, representing a business domain. The approach makes use of a clustering algorithm, certain constraints, a predefined rule and a set of heuristics. The approach has been implemented in a tool named 'CompMaker' and was used for identifying components for an auto insurance claims domain.
Hypothesis Testing for Module Test in Software Development
Authors: Tsuneo Yamaura, Akira K. Onoma, Wei-Tek Tsai
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

One of the most important issues in the software develop-ment is how to guarantee that the software satisfies the quality defined in the requirement specification. This paper proposes that the issue can be solved, first the number of test cases is statistically calculated from the failure density defined in the requirement specification, then the selected test cases are executed basing on the hypothesis testing.This paper also presents how our method can be used for debugging. When the number of the test cases is calculated, we applied the statistical behavior of the software quality tothe integration testing. We, however, did not consider the ripple effect since it is unable to measure.In order to guarantee the quality of 4ÿ and 5ÿ , we found that many more test cases are needed than is previously be-lieved enough.
SONET Configuration Management with OpenPM
Authors: Weimin Du, Ming-Chien Shan, Chris Whitney
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

SONET (Synchronous Optical NETwork) has been proposed as the backbone of future information superhighway infrastructure. SONET network management, however, is a complex process that involves many heterogeneous systems and applications, as well as human interactions. In this paper, we describe a prototype system developed at Hewlett-Packard (HP) that provides a service for configuring large SONET networks. The prototype differs from the existing systems in that it employs the HP OpenPM (Open Process Management) workflow system to define, execute and monitor network management processes. Using OpenPM (a middleware service that enables the automation of activities supporting complex enterprise business processes in a distributed heterogeneous computing environment) as a reliable and efficient workflow execution engine, this prototype supports efficient distributed network management and easy integration of legacy applications. The paper describes how an example network configuration management process is modeled, executed and monitored using OpenPM.
Query Interoperation Among Object-Oriented and Relational Databases
Authors: Xiaolei Qian, Louiqa Raschid
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We develop an efficient algorithm for the query interoperation among existing heterogeneous object-oriented and relational databases. Our algorithm utilizes a canonical deductive database as a uniform representation of object-oriented schema and data. High-order object queries are transformed to the canonical deductive database in which they are partially evaluated and optimized, before being translated to relational queries. Our algorithm can be incorporated into object-oriented interfaces to relational databases or object-oriented federated databases to support object queries to heterogeneous relational databases.
Multiplexor Network Generation in High Level Synthesis
Authors: Yung-Ming Fang, D. F. Wong
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

In high level synthesis, after the binding stage, multiplexor network is generated to connect the outputs of modules (functional-units/registers) to the inputs of modules. In this paper, we present an algorithm to generate a 2-to-1 multiplexor network with minimum number of multiplexors. Our algorithm is based on iteratively solving minimum vertex cover problems. Experimental results show that our approach obtains 8 to 25 % improvement over a direct multiplexor-forest approach.
Adaptive load-balancing algorithms using symmetric broadcast networks: performance study on an IBM SP2
Authors: S. K. Das, D. J. Harvey, R. Biswas
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In a distributed-computing environment, it is important to ensure that the processor work loads are adequately balanced. Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three SBN-based load-balancing algorithms, and implement them on an SP2. A thorough experimental study with Poisson-distributed synthetic loads demonstrates that these algorithms are very effective in balancing system load while minimizing processor idle time. They also compare favorably with several existing techniques.
Language identification of on-line documents using word shapes
Authors: Nicola Nobile, Sabina Bergler, Ching Y. Suen, Sami Khoury
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The authors have extended existing methods to identify the language of an on-line document after the characters have been coded using 10 character classes based on visual characteristics. In particular, they exploit word bigrams and trigrams in both a linear combination of score values and an expert systems approach. Knowledge about each language as acquired from a large number of on-line texts. Using a small set of rules, the expert system outperforms the linear combination in accuracy and shows more stability when parameter settings are varied.
Strategies for Integration of a Non-OO EIS and the J2EE Framework
Authors: Shengru Tu, Gongqin Li, Paul Augustin
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In this paper, we report an architectural design that integrates a large-scale PeopleSoft human resource system into the J2EE framework by using the vendor's messaging mechanism. A unique situation of this project is that the COTS part and the J2EE components are designed at the same time. The designers have to make more choices than those in the cases of wrapping legacy systems. In addition to performance and scalability, we have particularly paid attention to the manageability of COTS products upgrading. In doing so, we have recommended five integration design strategies, among which the application-level data replication strategy is very effective.
A Flexible Service Selection Model for Enterprise Distributed Systems
Authors: Geoffrey H. Outhred, John Potter
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

A common problem in distributed systems is the selection of a particular service instance from a set of possible services. In this paper we identify the kinds of information required to select services within enterprise distributed systems and present a flexible mechanism for selecting services. This mechanism enables clients to build complex queries that are able to utilize script-based interaction with service instances. The use of scripts allows selection of particular services based on their internal state and permits services to tailor their responses based on the particular client.
Evaluation of a Knowledge-Based Approach to Program Understanding
Authors: Salwa K. Abd-El-Hafiz
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

This paper evaluates a recently presented knowledge-based program understanding approach that generates first order predicate logic annotations of loops. An initial and partial evaluation of this approach was performed on an existing program of reasonable size. Plans in the knowledge base were designed by performing analysis of the existing program. As a result, the previous study did not demonstrate that the knowledge base generated for a given program is generally usable beyond that program. In this study, an extensive evaluation of the analysis approach is performed. Plans developed during the initial evaluation stage are used to analyze a set of 92 loops in five randomly selected Pascal programs. Results concerning the analyzed loops and utilization of the existing plans are given and discussed. These results generally show a good usability of the knowledge base beyond the original program.
Constructing an EJB Application in a WFMS
Authors: Jian-Wei Wang, Ta-Chun Lin, Huai-Jong Hsu, Feng-Jian Wang
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A workflow system provides enterprises the automatic and paperless process management. The idea of Enterprise JavaBeans (EJB) is to utilize components from various vendors to construct an application, which has the characteristics of scalability, security, distributed, and fast development. In the paper, an EJB module and the enterprise beans are implemented. Workflow designer may use this module to invoke the business methods defined in the enterprise bean on the outer application server. The EJB module may facilitate the component development of a workflow system, and reuse the existing components to fulfill the function needed.
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
Authors: Chengzhi Li, Riccardo Bettati, Wei Zhao
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-case response times of jobs with their timing constraints. We compute response times with a new method, which uses the amount of received service time to determine the response time of instances of a job. We illustrate how this method can be applied to exactly determine worst-case response times for processors with preemptive static-priority schedulers, and how it gives good approximation on the response times for processors with non-preemptive static-priority scheduling or first-come-first-served scheduling. Our schedulability analysis is the first to support systems with arbitrary job arrival patterns. Nevertheless, it performs better han other known approaches used for systems with periodic job arrivals.
A Methodology for Migration of Legacy Applications to Distributed Object Management
Authors: E. R. Hughes, R. S. Hyland, Steven D. Litvintchouk, A. S. Rosenthal, A. L. Schafer, S. L. Surer
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Much of today's software development involves reengineering legacy applications, but the bulk of research and tools address new software development. The Distributed Object Management Integration System (DOMIS, 1993-96) project investigated how legacy applications can be incrementally modified, or migrated, by using distributed object management (DOM) technology. This paper describes a methodology for such migration using DOM technology.
Performance comparison of several feature selection methods based on node pruning in handwritten character recognition
Authors: Kyusik Chung, Jongmin Yoon
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The paper presents a performance comparison of several feature selection methods based on neural network node pruning. Assuming the features are extracted and presented as the inputs of a 3 layered perceptron classifier, we apply the five feature selection methods before/during/after neural network training in order to prune only input nodes of the neural network. Four of them are node pruning methods such as node saliency method, node sensitivity method, and two interactive pruning methods using different contribution measures. The last one is a statistical method based on principle component analysis (PCA). The first two of them prune input nodes during training whereas the last three do before/after network training. For gradient and upper down, left right hole concavity features, we perform several experiments of handwritten English alphabet and digit recognition with/without pruning using the five feature selection algorithms, respectively. The experimental results show that node saliency method outperforms the others.
Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent
Authors: Anjan K. Venkatramani, Timothy Mark Pinkston, José Duato
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.
A Policy Based Role Object Model
Authors: Emil Lupu, Morris Sloman
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Enterprise roles define the duties and responsibilities of the individuals which are assigned to them. This paper introduces a framework for the management of large distributed systems which makes use of the concepts developed in role theory. Our concept of a role groups the specifications of management policies which define the rights and duties corresponding to that role. Individuals may then be assigned to or withdrawn from a role, to enable rapid and flexible organizational change, without altering the specification of the policies. We extend this role concept to include relationships as means of specifying required interactions, duties and rights between related roles. Organizations may contain large numbers of similar roles with multiple relationships between them, so there is a need for reuse of specifications. Role and relationship classes permit multiple instantiation and inheritance is used for incremental extension of the organizational structure with minimal specification effort. We also briefly examine consistency and auditing issues related to this role framework.
Regions Tracking in Ventricle MR Sequence Based on Hierarchical Analysis
Authors: Marco António Garcia de Carvalho, Michel Couprie, Roberto de Alencar Lotufo
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We propose a strategy to track blood volume in cine MR image sequences, based on Multi-scale Watershed[1] algorithm that provides an indexed hierarchy of each frame. We track a class in a sequence, obtained by user interaction without much effort, and refined by hierarchical addition and suppression operations. A class is a video object in each frame that represents the region of interest.
Toward Symbolic Performance Prediction of Parallel Programs
Authors: Thomas Fahringer
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Critical analyses in performance estimators for parallel programs require an algorithm that count the number of integer solutions to a set of inequalities. Most current performance estimators are restricted to linear inequalities for this analysis. In this paper we describe a symbolic algorithm which can estimate the number of integer solutions to a set of both linear and non-linear inequalities. The result is either an integer value or a symbolic expression depending on whether the inequalities contain non-loop variables. We have implemented this algorithm and use it as part of P3T, a performance estimator for data parallel programs. We demonstrate the usefulness of this algorithm by predicting the work load of all processors for a parallel program and compare it to measurements taken on an iPSC/860 hypercube system.
A Foundation for the Concept of Role in Object Modelling
Authors: Guy Genilloud, Alain Wegmann
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Standardization experts in object modelling are having difficulties with defining the concept of role; for example, they are not sure of whether role is a type or an instance concept. This issue is a source of confusion in the UML standard, and prevents ISO experts to reach consensus and finalize a language for ODP enterprise modelling. In this paper, we make an in-depth analysis of the problem, find its likely causes, and come up with a proposal for a new ODP definition of role, as well as with definitions of related concepts. Our findings and our definitions provide a basis for reconciling the positions that people have about the concept of role.
On The Lambda Y Calculus
Authors: Richard Statman
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

In this note we consider three problems concerning the lambda Y calculus obtained from the simply typed lambda calculus by the addition of fixed point combinators Y :(A ¿ A ) ¿ A.The "paradoxical" combinator Y was first discussed in Curry & Feys Vol 1 [3]. It appears first in a typed context in Scott [7] and also in Richard Platek's thesis [5], and forms the basis for L.C.F [6] and its descendants.In this note we shall consider(1) the question of whether higher type Y are "definable" from lower type Y. We shall showthat it is not the case in this context, sharpening a result of ours from [8]. A similar result has been obtained by Warner Damm;(2) the question of the decidability of termination. More precisely, we shall show that it is decidable whether a given term has a normal form. This extends results of Plotkin and Bercovicci. [2]. By similar methods we show that we show that it is decidable whether a term has a head normal form, and whether a term has a finite Bohm tree;(3) the question of the decidability of the word problem. This question was first put to us byAlbert Meyer 20 years ago. We shall show that it is in general undecidable whether twolambda Y terms convert. This is done by encoding the behavior of register machines. In addition we shall give a decision procedure for the special case of only Y's of type (0 ¿ 0) ¿ 0.