ppxscal/embedding_network huggingface dataset:
Model-Based Architecture for the Intranet
Authors: Hirotaka Hara, Takahide Matsutsuka, Nobuyuki Kanaya, Takao Ookubo, Sanya Uehara
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

In this paper, we propose a system called CEE (Cooperative Environment for Enterprise-computing) which is based on a new architecture for the Intranet. CEE works based on the enterprise model which consists of the organization, business function/process conforming to IDEF0, and resources such as persons and documents. CEE integrates enterprise information and applications based on the enterprise model and enable the following functions on the WWW: 1) CEE automatically generates and maintains WWW pages and links according to business objects in the enterprise model. 2) CEE manages documents linked to the enterprise model and provides check-in/out and version control functions. 3) CEE promotes concurrent engineering by providing notification on the creation or modification of the output document of a process to the succeeding processes. 4) CEE provides document-based project management on the IDEF0 chart in addition to traditional time-based project management on the Gantt chart.
A Constant-Factor Approximation Algorithm for the Multicommodity
Authors: Amit Kumar, Anupam Gupta, Tim Roughgarden
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity buy-at-bulk network design in which there are two ways to install capacity on any given edge. Capacity can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufficient capacity on edges so that a prescribed amount of flow can be sent simultaneously from each source to the corresponding sink.Recent work on buy-at-bulk network design has concentrated on the special case where all sinks are identical; existing constant-factor approximation algorithms for this special case make crucial use of the assumption that all commodities ship flow to the same sink vertex and do not obviously extend to the multicommodity rent-or-buy problem. Prior to our work, the best heuristics for the multicommodity rent-or-buy problem achieved only logarithmic performance guarantees and relied on the machinery of relaxed metrical task systems or of metric embeddings. By contrast, we solve the network design problem directly via a novel primal-dual algorithm.
Clock controller design in SuperSPARC II microprocessor
Authors: H. Hao, K. Bhabuthmal
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper describes the SuperSPARC II clock controller. This controller allows the internal clock to be disabled during the chip's normal operation. Then any number of internal clock pulses can be issued in a controlled fashion. The clock can return to the free running mode after being disabled. All clock control is done in a way that produces no glitches on the internal clock signal The clock controller can be accessed through the IEEE 1149.1 interface, making it useful at the chip level and at the module or system level.
Association Rules and Non-Classical Logics
Authors: Tetsuya Murai, Michinori Nakata, Yoshiharu Sato
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Implication of association rules is compared with material implication and conditional in standard conditional models for conditional logic. Then, association rules are shown to be translated into probability-based graded conditionals. Further co-occurrence as the basis for confidence of association rules is examined and then evidence-based confidence is newly introduced.
MADSS: A Multi-Agent Based Distributed Scripting System
Authors: Jim-Min Lin, Zeng-Wei Hong, Guo-Ming Fang
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

One important advantage of software integration is to construct a project without platform and machine boundary. In this study, we are going to propose a scripting mechanism to integrate UNIX tools and other software under non-UNIX systems into a new system. Based on our scripting mechanism, we assumed UNIX experts as the system users. A UNIX expert would be adaptive on this study, because the scripting language extended from a UNIX shell. In order to demonstrate this study, we will then propose a Multi-Agent Distributed Scripting System(MADSS). MADSS provides a fast and a convenient way for a UNIX expert to combine the heterogeneous software distributed on a network environment. A multi-agent system was employed to be an operational environment of this study. The agents in our system could perform the distributed scripts written by UNIX users through several proposed control flows, for examples parallel, circular trip, and forth_and_back.
Autonomous Decentralized Database System for Assurance in Heterogeneous e-Business
Authors: Carlos Perez Leguizamo, Shohei Kato, Kenji Hirai, Kinji Mori
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Due to the advancement in the Information Technology, different kind of companies with heterogeneous needs have had the necessity to cooperate among them to get more benefit in a continuos changing market. That is heterogeneous e-business. In order to cope with such kind of e-business, a platform which can effectively realize heterogeneous needs, real time, flexibility and fault-tolerance is needed.This paper focuses on the database field that is indispensable for the e-business. Thus, it proposes Autonomous Decentralized Database System, which is composed of two techniques. In the first one, the concept of Allowable Volume (AV) is introduced, while in the second one, a Mobile Agent (MA) that adjusts the AV of each site is shown. Since the MA is always moving among the sites, and each site can always negotiate AV with the MA autonomously, the system can realize assurance. Furthermore, the effectiveness of the proposed system is shown by simulation.
A Performance Evaluation of Load Balancing Techniques for Join Operations on Multicomputer Database Systems
Authors: Kien A. Hua, Wallapak Tavanapong, Honesty C. Young
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

There has been a wealth of research in the area of parallel join algorithms. Among them, hash-based algorithms are particularly suitable for shared-nothing database systems. The effectiveness of these techniques depends on the uniformity in the distribution of the join attribute values. When this condition is not met, a severe fluctuation may occur among the bucket sizes, causing uneven workload for the processing nodes. Many parallel join algorithms with load balancing capability have been proposed to address this problem. Among them, the sampling and incremental approaches have been shown to provide an improvement over the more conventional methods. The comparison between these two approaches, however, has not been investigated. In this paper, we improve these techniques and implement them on an nCUBE/2 parallel computer to compare their performance. Our study indicates that the sampling technique is the better approach.
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking
Authors: Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition /spl Pi/ of an n-element set S subject to the usual operations Find, Union, Backtrack and Restore as well as the new operations SetUnion, MultiUnion. The SetUnion operation as a special case of the commonly known Union operation aimed to unify two pre-specified set-names, while MultiUnion operation deals with a batch of Union operations. A new data structure, called k-Parallel Union Find (or, k-PUF) trees, is introduced to represent a disjoint set in /spl Pi/. The structure is defined for a wide range for the parameter k, but the more interesting results are achieved for k=log n/log log n. In this case, using the k-PUF trees, both SetUnion and Restore operations are performed in constant parallel time requiring optimal work O(k). This constant-time performance is not achievable parallelizing the existing data structures. Moreover, using p=O(k) processors, MultiUnion for a batch of p operations is performed in O(k) time, requiring optimal work O(pk).
A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network
Authors: Arun K. Jagota
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We present a near-optimal algorithm for gossiping in a d-dimensional mesh interconnection network (for arbitrary d/spl ges/2) of busses, under the assumptions that a processor may send/receive simultaneously on all its ports, and message transmission takes unit time regardless of length. For d
Learning Automatic Acquisition of Subcategorization Frames Using Bayesian Inference and Support Vector Machines
Authors: Manolis Maragoudakis, K. Kermanidis, Nikos Fakotakis, George K. Kokkinakis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Learning Bayesian Belief Network (BBN) from corpora and Support Vector Machines (SVM) have been applied to the automatic acquisition of verb subcategorization frames for Modern Greek.We are incorporating minimal linguistic resources, i.e. basic morphological tagging and phrase chunking, to demonstrate that verb subcategorization, which is of great significance for developing robust natural language human computer interaction systems, could be achieved using large corpora, without having any general-purpose syntactic parser at all.
Generic Methodologies for Deadlock-Free Routing
Authors: Hyunmin Park, Dharma P. Agrawal
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several subdigraphs, it simplifies and generalizes the development of both static and adaptive deadlock-free routing algorithms for arbitrary network topologies. We show that our methodology can be applied to store-and-forward and virtual cut-through routings as well. Keywords: Adaptive Routing, Channels, Deadlock-free Routing Algorithm, Hypercube, Mesh, Store-and-Forward, Subdigraph, Torus, Virtual Channel, Virtual Cut-through, Wormhole
Distributed and Concurrent Processing of Business Object Documents in Support of e-Enterprise Integration
Authors: Stanley Y. W. Su, Youzhong Liu, Jie Meng, Minsoo Lee, Herman Lam
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

The Internet and distributed object technologies have made it possible for different business enterprises to draw upon the best of their resources for conducting joint business as a virtual e-enterprise (VEE). To enable virtual e-enterprises, the integration of legacy applications and the modeling and enactment of concurrent business processes are necessary. The authors combine the features of the messaging approach and the distributed object approach to system integration. Business Object Documents (BOD) are used for transmitting business operations and data among application systems. Message transmission is supported by two underlying communication infrastructures: CORBA and Java RMI. The separation of messaging from communication infrastructure allows the underlying infrastructure to be changed without impacting application systems. Also, business processes are modeled as sequences or network structures of BOD transmissions. The process models are replicated at all sites and used by an extended information infrastructure to enable distributed, concurrent enactment of processes.
Applying a Flexible OODBMS-IRS-Coupling for Structured Document Handling
Authors: Marc Volz, Karl Aberer, Klemens Böhm
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In document management systems it is desirable to provide content-based access to documents going beyond regular expression search in addition to access based on structural characteristics or associated attributes. We present a new approach for coupling OODBMSs (Object Oriented Database Management Systems) and IRSs (Information Retrieval Systems) that provides enhanced flexibility and functionality as compared to coupling approaches reported from the literature. Our approach allows to decide freely to which document collections, that are used as retrieval context, document objects belong, which text contents they provide for retrieval and how they derive their associated retrieval values, either directly from the retrieval machine or from the values of related objects. Especially, we show how in this approach different strategies can be applied to hierarchically structured documents, possibly avoiding redundancy and IRS or OODBMS peculiarities. Content-based and structural queries can be freely combined within the OODBMS query language.
Separability, Expressiveness, and Decidability in the Ambient Logic
Authors: Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data.We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subsets of it, MA_{IF} and MA_{IF}^{syn}, respectively defined by imposing a semantic and a syntactic constraint on process prefixes.The main contributions include: coinductive and inductive operational characterisations of =L; an axiomatisation of =L on MA_{IF}^{syn}; the construction of characteristic formulas for the processes in MA_{IF} with respect to =L; the decidability of =L on MA_{IF} and on MA_{IF}^{syn}, and its undecidability on MA.
High-radix SRT division with speculation of quotient digits
Authors: Tzu-Hsi Pan, Hyon-Sok Kay, Youngsun Chun, Chin-Long Wey
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The complexity of quotient-digit selection process can be reduced significantly by using a look-up table, referred to as quotient-digit selection table (QST). However, the huge table size limits such approach for small-radix implementation. This paper presents an alternative quotient decision process to reduce the table size. Instead of finding the exact quotient digit, a speculated quotient digit is estimated. The speculated quotient digit is used to update the possible partial remainders while the speculated quotient digit is corrected. The process includes two steps: determination of speculated quotient digit and quotient-digit correction. Thus instead of using a huge QST table, two smaller tables are employed. Result shows that the proposed approach significantly reduces the size of the original QST.
Program Understanding and Maintenance with the CANTO Environment
Authors: Giuliano Antoniol, Roberto Fiutem, G. Lutteri, Paolo Tonella, S. Zanfei, Ettore Merlo
Venue: Proceedings of the International Conference on Software Maintenance (1997)

During maintenance activities, the availability of integrated conceptual views that present software at different levels of abstraction, from software architecture to control and data flow relations at code level, is fundamental to understand and modify legacy systems. This paper presents CANTO, a comprehensive program understanding and maintenance environment which integrates fine grained information with architectural views extracted from source code, giving the user control on what is being computed by analyses. The capabilities and usefulness of CANTO are illustrated with reference to a real understanding and maintenance task.
Knowledge-Based Self-Support System for Corporate Users
Authors: Franck Noël, Kemal A. Delic
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Today's corporations use complex IT systems fabrics to control and manage their businesses, maintain linkages with clients and customers and synchronize their operations with suppliers and partners. In doing so, corporate employees have to master their IT environment. User support automation, which is defined as the process of discovery of user self-support chores, is introduced here to address the issue of the TCO (Total Cost of Ownership) reduction. This paper will briefly describe our experiences gained during deployment of the pilot self-support system within Hewlett-Packard Corporation.
NAOS Protyotype - Version 2.2
Authors: Christine Collet, Thierry Coupaye, Luc Fayolle, Claudia Roncancio
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Summary form only given. The Native Active Object System (NAOS) incorporates an active behavior within the object-oriented database management system O/sub 2/. NAOS rules are event-condition-action (EGA) rules belonging to an O/sub 2/ database schema. The authors focus on user and temporal event detection as well as composite event detection.
The Evolution of a Massively Parallel Vision System for Real-Time Automotive Image Processing
Authors: Alberto Broggi
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents the first prototype of the PAPRICA massively parallel system which is integrated on the MOB-LAB experimental land vehicle for real-time vision-based road markings detection. Its main bottlenecks are highlighted and its evolution toward a linear array is discussed. This system has been enhanced with a simple but powerful interprocessor communication network for the exchange of information among processors not directly connected, which allows an extremely efficient implementation of the road markings detection algorithm as well as other morphological applications.
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
Authors: Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Duplication based scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target system. We classify DBS algorithms into two categories according to the task duplication method used. We then present our new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. Our simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with equal or less time complexity. We analytically obtain the boundary condition for the worst case behavior of the proposed algorithm and also prove that the algorithm generates an optimal schedule for a tree structured input directed acyclic graph.
Parallel Algorithms Using Unreliable Broadcasts
Authors: John Matthews, Charles U. Martel
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Parallel computing on networks of workstations (NOWs) allows effective use of existing hardware and software. NOWs are often connected using a broadcast medium such as an Ethernet, so it is natural to use broadcast as a communication primitive. However, existing parallel programs usually rely on point-to-point protocols for performing broadcasts since native broadcast schemes (UDP broadcast) do not guarantee delivery. Thus the potential of the broadcast medium is lost. Instead of making the broadcast reliable, we design algorithms which use an Unreliable Broadcast. Our algorithms are correct regardless of the reliability of the broadcast, but are more efficient the higher the reliability. We provide experimental results which show that UDP broadcasts are quite reliable in practice and can be used to design efficient Minimum Spanning Tree and Load Balancing algorithms for NOWs.
SYNAPSE-1: a high-speed general purpose parallel neurocomputer system
Authors: Ulrich Ramacher, Wolfgang Raab, J. A. U. Hachmann, J. Beichter, N. Brüls, Matthias Wesseling, E. Sicheneder, J. Gläß, A. Wurz, Reinhard Männer
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The paper describes the general purpose neurocomputer SYNAPSE-1 which has been developed in cooperation between Siemens Munich and the University of Mannheim. This system contains one of the most powerful processors available for neural algorithms, the neuro signal processor MA16. The prototype system executes a test algorithm 8000 times as fast as a Sparc-2 workstation. This processing speed has been achieved by using a system architecture which is optimally adapted to the general structure of neural algorithms. It is a systolic array of MA16 processors embedded in a multiprocessor system of general purpose microprocessors.
Design of Multimedia Storage Systems for On-Demand Playback
Authors: Yen-Jen Oyang, Meng-Huang Lee, Chun-Hung Wen, Chih-Yuan Cheng
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

This paper presents a comprehensive procedure to design multimedia storage systems for on-demand playback. The design stresses effective utilization of disk bandwidth with minimal data buffer to minimize overall system costs. The design procedure is most distinctive in the following two aspects: it bases on a tight upper bound of the lumped disk seek time for the Scan disk scheduling algorithm to achieve effective utilization of disk bandwidth; it starts with a general two-level hierarchical disk array structure to derive the optimal configuration for specific requirements.
Parallel Synthetic Aperture Radar Processing on Workstation Networks
Authors: Peter G. Meisl, Mabo Robert Ito, Ian G. Cumming
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Synthetic Aperture Radar (SAR) signal processing poses a significant challenge due to its very large computation and data storage requirements. This paper presents the computational requirements of a typical high resolution satellite SAR data processing scenario. A classification of approaches to partitioning the SAR problem for parallel processing is given. The suitability of Networks of Workstations (NOW) for SAR processing is analyzed for a number of partitioning approaches. The network throughputs required to support SAR processing on NOW are derived. SAR processing is found to demand extremely high network throughput that is difficult to achieve with today's technology.