ppxscal/embedding_network huggingface dataset:
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
Authors: Ashish Tiwari
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a polynomial time algorithm for deciding confluence of groundrewrite systems was open for a long time and was independently solved only recently [4]. Our decision procedure is based on the concepts of abstract congruence closure [2] and abstract rewrite closure [12].
Transformation and Integration Method of Scenarios
Authors: Atsushi Ohnishi, Zhang Hong Hui, Hiroshi Fujimoto
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Scenarios that describe concrete situations of software operation play an important role in software development, and in particular in requirements engineering. Scenario details should vary in content and detail when described from different viewpoints (e.g. types of user or external interface), but this presents a difficulty, because informal scenarios cannot easily be translated from one viewpoint to another with consistency and assurance.This paper describes (1) a language for describing scenarios in which simple action traces are embellished to include typed frames based on a simple case grammar of actions, and (2) a procedure for translating a frame-based scenario from one viewpoint into another, and (3) integration method of scenarios described from different viewpoints. We illustrate them with examples of program chair's job.
Complete Parallelization of Computations: Integration of Data Partitioning and Functional Parallelism for Dynamic Data Structures
Authors: Dwip Banerjee, James C. Browne
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents a parallel programming system which (i) supports complete parallelization of array-oriented computations through a coherent integration of data partitioning parallelization and functional decomposition based parallelization and (ii) implements a declarative representation of operations over distributed dynamic arrays. The conceptual framework for this integration is a generalized dependence graph model of parallel computation. The properties of the programming system are illustrated by an example: a red/black parallel solver for linear systems.
An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
Authors: Hong Q. Ding, Robert D. Ferraro
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitioner first partitions element centroids using a recursive inertial bisection algorithm. Elements and nodes then migrate according to the partitioned centroids, using a data request communication template for unpredictable incoming messages. Our scalable implementation is contrasted to a non-scalable implementation which is a straightforward parallelization of a sequential partitioner. The algorithms adopted in the partitioner scale logarithmically, as confirmed by actual timing measurements on the Intel Delta on up to 512 processors for scaled size problems.
Group Protocol for Distributed Replicated Objects
Authors: Tomoya Enokido, Hiroaki Higaki, Makoto Takizawa
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

In group protocols, larger computation and communication are consumed to causally order all messages transmitted in the network. Transactions in clients manipulate objects in servers by sending read and write requests to the servers. In this paper, we define significant messages, which are to be ordered at the application level, by using a conflicting relation among the transactions. We newly propose an object vector to causally order only the significant messages. The scheme of the object vector is invariant in the change of the group membership. We also show a TBCO (transaction-based causally ordered) protocol adopting the object vector, by which the number of messages to be causally ordered are reduced.
Simulation of Correlated Intensity SAR Images
Authors: Oscar H. Bustos, Ana Georgina Flesia, Alejandro César Frery
Venue: Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (1999)

The precise knowledge of the statistical properties of synthetic aperture radar (SAR) images plays a central role in their processing and analysis. These properties can be used for discriminating different types of land use, for classifying targets and for performing the assessment of algorithms and strategies throughout the use of stochastic simulation. These images seldom exhibit the well known and tractable Gaussian distribution. In this paper methods for SAR image simulation under the Gamma-distributed and correlated model are reviewed. One of these methods is carefully assessed and extended: that based on introducing correlation by means of a convolution mask applied to fields of Gaussian white noise. Results of Gamma- and K-distributed simulated images are shown.
A Pattern-Based Approach to Structural Design Composition
Authors: Paulo S. C. Alencar, Donald D. Cowan, Jing Dong, Carlos José Pereira de Lucena
Venue: 23rd International Computer Software and Applications Conference (1999)

This paper describes an approach to component-based software engineering based on a formal description of design patterns. The architectural design information, captured by design patterns, is made explicit and represented in a declarative way, being packaged into tangible artifacts as building block design components in the development process. These design component descriptions can be instantiated, adapted, assembled, implemented, and maintained. Furthermore, we can use these representations to reason about properties related to the combination of design components. We illustrate the utility of our approach through a case study involving various design patterns.
Hierarchical Face Modeling and Fast 3D Facial Expression Synthesis
Authors: Yu Zhang, Edmond C. Prakash, Eric Sung
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper presents a new hierarchical facial model that conforms to the human anatomy for realistic and fast 3D facial expression synthesis. The facial model has a skin/muscle/skull structure. The deformable skin model uses a kind of nonlinear springs to directly simulate the nonlinear visco-elastic behavior of soft tissue, and a new kind of edge repulsion springs is developed to prevent model collapse. The incorporation of the skull extends the scope of facial motion and facilitates facial muscle construction. The construction of facial muscles is achieved by using an efficient muscle mapping approach that ensures different muscles to be located at the anatomically correct positions. For computational efficiency, we devise an adaptive simulation algorithm which uses either a semi-implicit integration scheme or a quasi-static solver to compute the relaxation by traversing the designed data structures in a breadth-first order. The algorithm runs in real-time and has successfully synthesized realistic facial expressions.
ToolManager: A Tool for Management of CASE Tools
Authors: Sandro Ronaldo Bezerra Oliveira, Alexandre Marcos Lins de Vasconcelos, Ana Cristina Rouiller
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper presents ToolManager, a tool for management of CASE tools during the development of a specific software project. The aim of this tool is to support part of an automated process for the planning, management and use of CASE tools during the executionof activities defined in a software project plan. This plan is managed by an environment for automated software projects management, called ProjectSpace. This paper discuss the conception of ToolManager, the specification of its functions, and the description of its main features.
A Register Allocation Technique Using Register Existence Graph
Authors: Akira Koseki, Yoshiaki Fukazawa, Hideaki Komatsu
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Optimizing compilation is very important for generating code sequences in order to utilize the characteristics of processor architectures. One of the most essential optimization techniques is register allocation. In register allocation that takes account of instruction-level parallelism, anti-dependences generated when the same register is allocated to different variables, and spill code generated when the number of registers is insufficient should be handled in such a way that the parallelism in a program is not lost. In our method, we realized register allocation using a new data structure called the register existence graph, in which the parallelism in a program is well expressed.
Multimedia Tools and Applications in the Development of a Large Complex Network System
Authors: Sourav Bhattacharya, Srihari Palangala, Siva Perraju Tolety
Venue: 23rd International Computer Software and Applications Conference (1999)

This paper demonstrates the capability and use of integrating multimedia tools and events in the life-cycle development of large, complex networks. Network Engineering (NE), detailed by the authors previous research, defines process steps for the requirement specification, design, evaluation, testing, layout and maintenance of computer networks. This paper shows that the integration of multimedia in the process steps for NE results in better networks being designed.The paper details a multimedia based simulation executed on the network prototype, prior to submitting the designed network to a more rigorous simulation software, like OPNET (OPtimized Network Engineering Tools). The tool detailed in this paper allows the user to specify events during the network simulation. Events are user defined conditions that can identify and alert the user regarding abnormal behavior of the network system. The key ideas presented in this paper include the usage of multimedia in the NE process, and the role of user-defined events in identifying design aspects of the network.
A Better ATPG Algorithm and Its Design Principles
Authors: Li-C. Wang, M. Ray Mercer, Thomas W. Williams
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The traditional goal of an ATPG algorithm is to achieve a high fault coverage by producing a small number of tests. However, since usually a high fault coverage does not imply a high defect coverage, such an objective can mislead us to overtrust an ATPG method which is optimal for faults but inefficient for defects. This paper presents several new principles to design an ATPG algorithm for solve this problem. The new principles direct an ATPG algorithm to improve its efficiency and reliability for detecting the non-target defects through the target faults. Theory and experiments will be presented to demonstrate the superiority of the new principles and the new test generation algorithm.
Application of Hazard Analysis to Software Quality Modelling
Authors: Hong Zhu, Yanlong Zhang, Qingning Huo, Sue Greenwood
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Quality is a fundamental concept in software and information system development. It is also a complex and elusive concept. A large number of quality models have been developed for understanding, measuring and predicting qualities of software and information systems. It has been recognised that quality models should be constructed in accordance to the specific features of the application domain. This paper proposes a systematic method for constructing quality models of information systems. A diagrammatic notation is devised to represent quality models that enclose application specific features. Techniques of hazard analysis for the development and deployment of safety related systems are adapted for deriving quality models from system architectural designs. The method is illustrated by a part of web-based information systems.
Geometric mesh partitioning: implementation and experiments
Authors: John R. Gilbert, Gary L. Miller, Shang-Hua Teng
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of "well-shaped" finite element meshes have good separators. The geometric method is quite simple to implement: we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection.
The Gold Text Indexing Engine
Authors: Daniel Barbará, Sharad Mehrotra, Padmavathi Vallabhaneni
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The proliferation of electronic communication including computer mail, faxes, voice mail, and net news has led to a variety of disjoint applications and usage paradigms that forces users to deal with multiple different user interfaces and access related information arriving over the different communication media separately. To enable users to cope with the overload of information arriving over heterogeneous communication media, we have developed the Gold document handling system that allows users to access all of these forms of communication at once, or to intermix them. The Gold system provides users with an integrated way to send and recieve messages using different media, efficiently store the messages, retrieve the messages based on their contents, and to access a variety of other sources of useful information. At the center of the Gold document handling system is the Gold Text Indexing Engine (GTIE) that provides a full text index over the documents. The paper describes our implementation of GTIE and the concurrency control protocols to ensure consistency of the index in the presence of concurrent operations.
Normalization Techniques of Handwritten Numerals for Gabor Filters
Authors: M. Watanabe, Yoshihiko Hamamoto, T. Yasuda, Shingo Tomita
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

When recognizing handwritten characters, normalization of characters has been usually done prior to feature extraction. Some authors point out that improvement of normalization increases the recognition rate. Thus, normalization techniques must be carefully examined. We have proposed a Gabor filter-based handwritten character recognition system. Our main interest is to select the best normalization technique for Gabor filters. We conduct comparative experiments and show that position, slant, and thickness normalization is best, with regard to minimizing the error.
DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks
Authors: Pedro López, Juan Miguel Martínez, José Duato
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Deadlock avoidance and recovery techniques are alternatives to deal with the interconnection network deadlock problem. Both techniques allow fully adaptive routing on some set of resources while providing dedicated resources to escape from deadlock. They mainly differ in the way they supply escape paths and when those paths are used. As the escape paths only provide limited bandwidth to escape from deadlocks, both techniques suffer from severe performance degradation when the network is close to saturation. On the other hand, deadlock recovery is based on the assumption that deadlocks are rare. Several studies show that deadlocks are more prone when the network is close to or beyond saturation.In this paper we propose a new mechanism that prevents network saturation by dynamically adjusting message injection limitation into the network. As a consequence, this mechanism will avoid the performance degradation problem that typically occurs in both deadlock avoidance and recovery techniques, making fully adaptive feasible. Also, it will guarantee that the frequency of deadlock is really negligible, allowing the use of simple low-cost recovery strategies.
The Impact of Data Placement on Memory Management for Multi-Server OODBMS
Authors: Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We demonstrate the close relationship between data placement and memory management for symmetric multi-server OODBMS. We propose and investigate memory management algorithms for two data placement strategies, namely declustering and clustering. Through a detailed simulation, we show that by declustering the data most of the benefits of complex global memory management algorithms are realized by simple algorithms. In contrast we show that when data is clustered, the simple algorithms perform poorly.
Incremental methods for FSM traversal
Authors: Gitanjali Swamy, Robert K. Brayton, Vigyan Singhal
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Computing the set of reachable states of a finite state machine, is an important component of many problems in the synthesis and formal verification of digital systems. The process of design is usually iterative, and the designer may modify and recompute information many times, and reachability is called each time the designer modifies the system because current methods for reachability analysis are not incremental. Unfortunately, the representation of the reachable states that is currently used in synthesis and verification, is inherently non updatable (O. Coudert and J.C. Madre, 1990). We solve this problem by presenting alternate ways to represent the reachable set, and incremental algorithms that can update the new representation each time the designer changes the system. The incremental algorithms use the reachable set computed at a previous iteration, and information about the changes to the system to update it, rather than compute the reachable set from the beginning. This results in computational savings, as demonstrated by the results.
A fast distributed optimal routing algorithm for multicommodity large data networks
Authors: Garng M. Huang, Shan Zhu
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

A a new distributed algorithm is investigated for optimal routing problems of large data network with multicommodities. The existing algorithms for general network topology have parallel time complexity of at least O(M/spl Phi//sup 2/) using all the nodes of the network as processors. Our algorithm takes O(m/spl Phi//sup 2/) time units using the same number of processors if some mild network conditions are met. Here, /spl Phi/ is the diameter of the network; M is the number of commodities; m is a positive number usually much smaller than M and is a function of the pattern of all the OD pairs including the locations of each origin node and destination node, and the flow demand of each OD pair. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation tool and the results show that our algorithm is much faster than the general algorithms.
Minimizing communication overhead for matrix inversion algorithms on hypercubes
Authors: Xiaodong Wang, Vwani P. Roychowdhury
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We propose novel parallel Gauss-Jordan inversion algorithms (with or without partial pivoting) under different data partitioning strategies. The machine model we assume is a MIMD hypercube, using asynchronous message passing, with the software supporting user specified interrupt handling. These algorithms achieve almost optimal overlapping of communication delays by computation, leading to a minimization of communication overhead. Furthermore, it is shown that the optimal data layout for our algorithms is different from that for hypercubes that do not overlap communication and computation. Rigorous analytical and numerical performance analysis of our parallel algorithms are presented as well.
Interaction-Driven Definition of e-Business Processes
Authors: Christian Zirpins, Giacomo Piccinelli
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Business-to-business interaction (B2Bi) is the next step for corporate IT [1]. Business relationships become increasingly dynamic, and new requirements emerge for data and process management. Standardisation initiatives are successfully targeting business ontology [4]. Still, business agility mainly depends on the flexibility of the business processes of a company. In the B2B space, traditional approaches to process modelling and management are inadequate.Today more than ever, traditional workflow management is crucial for the internal effectiveness of a company. Internal efficiency is a prerequisite for external agility. From both a technical and a business perspective, internal workflow management relies on specificassumptions in terms of resources involved in the process, as well as the process itself [2]. Level of control, availability, reliability, and cost stability are parameters that traditional process models and technology can almost take for granted. A single authority ruling on the processdefinition and the total control over process execution are also basic concepts for internal workflows. From a business perspective, a big upfront investment is put in the complete definition of process specifications. A different conceptual framework is required for thedefinition and management of e-business processes [3, 5]. The intrinsic capability to adapt to rapidly changing business requirements becomes crucial.The line of research explored in this paper derives from an approach to process modelling and management that explicitly targets the peculiarities and dynamics of B2Bi. In the model we propose, the upfront specification of the interaction logic of a company can be limited to partially specified processes and basic interaction rules. Specific information is then gathered from the observation of actual instances of business interaction, and used to refine and extend the initial model. In addition to the enforcement of explicit business requirement, the goal is to capture and leverage implicit operational knowledge.In the following sections, we present an overview of the methodology we are currently experimenting with for the inference of complex processes from business interaction flows. For our initial experiments, we focus on business messages compliant with the RosettaNet standard [4].