ppxscal/embedding_network huggingface dataset:
Measuring Distance between Program Features
Authors: W. Eric Wong, Swapna S. Gokhale, Joseph R. Horgan
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In this paper we present a metric to determine the distance between the features of a software system. Such a measurement can elucidate how features of the system being examined are close to each other. We first use an execution slice-based technique to identify a set of code (basic blocks in our case) that is used to implement each feature. Then, depending on whether the execution frequency of each block is considered during the construction of such sets of code, a static as well as a dynamic distance is computed for each pair of features. These two types of distance differ in that the former computes the distance between two features only by how these features are implemented in the system, while the latter also takes into account how each feature is executed based on a user's operational profile. In other words, the static distance quantitatively gives the closeness of two features from the systemimplementation point of view, whereas the dynamic distance presents such closeness from the users' execution point of view. To illustrate the use of our metric, we report a case study on a Symbolic Hierarchical Automated Reliability and Performance Evaluator (SHARPE). The results of our study suggest that the distance metric discussed in this paper can provide a good measurement, in a quantitative way, of how close two program features are. Such information can also serve as a good start to understanding how a modification made to one feature is likely to affect other features.
Using XML to Integrate Existing Software Systems into the Web
Authors: Harry M. Sneed
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The eXtensible Markup Language ¿ XML ¿ is not only a language for communication between humans and the web, it is also a language for communication between programs. Rather than passing parameters, programs can pass documents from one to another, containing not only pure data, but control information as well. Even legacy programs written in ancient languages such as COBOL and PL/I can be adapted by means ofinterface reengineering to process and to generate XML documents.
Implementation and Evaluation of an Automatic Personal Workflow Extraction Method
Authors: Akira Abeta, Ken'ichi Kakizaki
Venue: 23rd International Computer Software and Applications Conference (1999)

We report the implementation and evaluation of a method to automatically extract a workflow during a user's ordinary use of a personal information management system (PIM). Our method accumulates the target event and time of the user's operations such as registrations and references. In order to organize related work events, our method extracts relations between events by calculating frequency of a user's sequential reference using a balloon-help-function and connects related work events based on the relations. Furthermore, we improve the accuracy of our organizing method by introducing a function that offers the user the list of the events related to his target event in order to encourage the user to make sequential references to related work events. We have constructed a prototype PIM and tested it with 6 users. We confirmed that our method could make groups of related work events and display them as connected graphs with relations shown. We discuss the efficiency of sharing this extracted workflow using sample graphs.
A CMOS wave-pipelined image processor for real-time morphology
Authors: Ram K. Krishnamurthy, Ramalingam Sridhar
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents the implementation of a high-speed morphological image processor using CMOS wave-pipelining. A modular and expandable architecture, based on wave-pipelined transmission gate logic, has been developed for gray-scale and binary morphological operators. Using this architecture, 3/spl times/3 (2-dimensional) structuring element binary dilation and erosion units, and a two-stage morphological skeleton transform filter have been implemented in CMOS 1.2 /spl mu/m technology. The operating frequency is 333 MHz, which exceeds the speeds reported in literature for this functionality. Simulation results indicate a speed-up of 4-5 compared to non-pipelined processor implementations. The wave-pipelined implementation also offers a significant reduction in latency and hardware complexity compared to regular pipelined architectures.
Two-phase Multicast in Wormhole-Switched Bidirectional Multistage Banyan Networks
Authors: W. Kwon, Boseob Kwon, Jae-Hyun Park, Hyunsoo Yoon
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout $2^m$ where $m$ is the minimum integer satisfying $2^m \geq \sqrt{N}$($N$ is a network size).
Organization, Information System and Distribution Modeling: An Integrated Approach
Authors: Antonio Rito da Silva, Teresa Gonçalves, Francisco Assis Rosa, Arne-Jørgen Berre, Jan Øyvind Aagedal
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

This paper introduces an object-oriented approach to the integrated modeling of Organizations, and their Information Systems in a Distributed context. The approach is based on the OOram role modeling methodology concepts and tool. In the proposed approach organization modeling is done at the enterprise level of abstraction and both reverse and forward engineering are consistently supported. Distribution is modeled, at both the organization and information system levels of abstraction, in an integrated way. Traceability is supported between all models.
Logical Structure Recognition of Scientific Bibliographic References
Authors: Francois Parmentier, Abdel Belaid
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, we are presenting an approach for the logical structure recognition of bibliographic references. The objective is to produce, for each reference (given in a display format, as postscript), structured data containing the hierarchy of fields recognized. As a result of variation among bibliographic references (in order and typographic format of fields, or writing style of the author, for example), we need a robust and tolerant system architecture. Thus, recognition is performed by a concept-oriented system that uses a model automatically built from a reference database. This model represents the reference fields and includes statistics on the occurrence of their terms. Recognition is achieved by a step-by-step activation of the more pertinent concepts. Each activated concept causes the execution of an appropriate searching agent. This architecture is robust and non-deterministic, allowing a solution even in difficult cases.
Linearity in Process Languages
Authors: Mikkel Nygaard, Glynn Winskel
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation.
Shuffle Memory System
Authors: Kichul Kim
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first memory system that receives MxN inputs in row major order while providing MxN outputs in column major order using only MxN memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Uniform Indexing Scheme for Object-Oriented Databases
Authors: Ehud Gudes
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The performance of Object-oriented databases (OODB) is a critical factor hindering their current use. Several indexing schemes have been proposed in the literature for enhancing OODB performance and they are briefly reviewed here. In this paper a new and uniform indexing scheme is proposed. This scheme is based on a single B-tree and combines both the hierarchical and nested indexing schemes \cite{Bertino,Kim}. The uniformity of this scheme enables compact and optimized code dealing with a large range of queries on the one hand, and flexibility in adding and removing indexed paths on the other hand. The performance of the scheme is about the same as existing schemes for single-class, exact match or range queries, and much better for multi-class and other complex queries and update.
Performance of Collision Avoidance Protocols in Single-Channel Ad Hoc Networks
Authors: Yu Wang, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

This paper presents the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed according to a two-dimensional Poisson distribution. We show that the sender-initiated collision-avoidance scheme performs much better than the ideal CSMA scheme with separate channel for acknowledgments. More importantly, we show that the collision-avoidance scheme can accommodate much fewer competing nodes within a region in network infested with hidden terminals than in those cases without hidden terminals or with just a few, if reasonable throughput is to be maintained. Simulations of the popular IEEE 802.11 MAC protocol show that it cannot ensure collision-free transmission of data packets and thus throughput can degrade well below what is predicted by the analysis of a correct collision avoidance protocol. Based on these results, a number of improvements are proposed for the IEEE 802.11 MAC protocol.
System-Level Issues and Approaches in Software Development
Authors: Stephanie Farbman White
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Computer-based systems affect virtually everything we do. Computer-based systems (CBS) are those for which behavior is, to a substantial degree, determined controlled by computers. Such systems include telephone and communication, airline reservation, electronic banking and commerce, process control and computer integrated manufacturing, avionics and aerospace, transportation (automotive, train, ship, traffic), medical instruments, microprocessor controlled domestic equipment, and a wide variety of military applications. These applications involve (a) large systems information and knowledge, (b) distributed and possibly embedded computer and communication components, (c) humans, (d) organizations and (e) system andorganization environments. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Optimizing Error-Reject Trade off in Recognition Systems
Authors: Nikolai Gorski
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes an approach to design decision making modules in recognition systems. The input of a decision maker is a list of possible alternative decisions ordered according to their scores. The decision making task is interpreted as distinguishing "good" lists, where the correct decision has the best score and is on the top of the list, from all other lists. This is a two-class recognition problem, to solve which we define a feature set and use a neural network recognizer. The neural network estimates a posteriori probabilities of classes, so it is possible to make optimal (Bayes) decisions by comparing the probability of "good" list class with a single threshold.By changing this threshold and measuring error / rejection rate on a test set, one can estimate the error-reject trade off of the designed decision maker. Implementation of the approach in the A2iA bank check recognition system as well as experimental results are presented.
Maximizing Speedup through Self-Tuning of Processor Allocation
Authors: Thu D. Nguyen, Raj Vaswani, John Zahorjan
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of processor allocations is important because many parallel applications exhibit peak speedups at allocations that are data or time dependent. We propose the use of a runtime system that: (a) dynamically measures job efficiencies at different allocations, (b) uses these measurements to calculate speedups, and (c) automatically adjusts a job's processor allocation to maximize its speedup. Using a set of 10 applications that includes both hand-coded parallel programs and compiler-parallelized sequential programs, we show that our runtime system can reliably determine dynamic allocations that match the best possible static allocation, and that it has the potential to find dynamic allocations that outperform any static allocation.
Steps Toward a Theory of Coordination for Intelligent Agent Societies
Authors: Peter S. Heck
Venue: 23rd International Computer Software and Applications Conference (1999)

This paper investigates various aspects of coordination in intelligent agent societies and makes progress toward a theory of coordination for such societies. A representative simulation model of an intelligent agent society, called the P-System, has been established to run systematically designed experiments. By running the P-System under different configurations, important descriptors of the structure and functioning of intelligent agent societies have been inferred, providing insight into the fundamental issues of coordination.
Conceptual Modeling of Complex Systems Using an RM-ODP Based Ontology
Authors: Alain Wegmann, Andrey Naumenko
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The development of business and information systems requires a significant amount of modeling. The current modeling languages and tools have difficulties supporting the modeling of systems spanning through multiple organizational levels. The use of inadequate modeling abstractions is one of the important causes for these difficulties. This paper proposes an ontology that defines the concepts needed for object-oriented modeling and gives a graphical example. The ontology is based on RM-ODP and relies on Constructivism and System Theory. The proposed ontology allows the definition of development methods, modeling languages and tools that are applicable to complex systems. This can lead to significant productivity improvements in the business and software development communities.
Efficient Yet Accurate Clustering
Authors: Manoranjan Dash, Kian-Lee Tan, Huan Liu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we show that most hierarchical agglomerativeclustering (HAC)algorithms follow a 90-10 rule where roughly 90%iterations from the beginning merge cluster pairs with dissimilarity less than 10%of the maximumdissimilarity. We propose two algorithms - 2-phase andnested - based on partially overlapping partitioning (POP).To handle high-dimensional data efficiently, we propose a tree structure particularly suitable for POP. Extensive experimentsshow that the proposed algorithms reduce the time andmemory requirement of existing HAC algorithms significantly without compromising in accuracy.
The Experience of Using Java-Based Message-Oriented Middleware to Build a Distributed Training Simulator
Authors: Hsin-Ta Chiao, Chun-Han Lin, Kai-Chih Liang, Shyan-Ming Yuan
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper presents a prototype of a distributed training simulator for a surface-to-air missile system. Since the system requirement enforces us to choose open standard platform, and we think that Java is matured enough to offer acceptable performance and reliability, we decide to implement it by Java. Basically, this training simulator is a distributed interactive application, and lots of messages are exchanged within it. For the performance reason, we use an IP-multicast-based JMS implementation as the communication infrastructure for delivering time-critical events. In this paper, we present how to exploiting the capability of the JMS publish/subscribe paradigm to implement this training simulator. Besides, we also perform a set of experiments to test and verify whether the training simulator can meet the system requirement. We think the experience of this paper is a good case study of using Java and message-oriented middleware to build message-intensive distributed systems.
Power from Random Strings
Authors: Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under probabilistic and non-uniform reductions. These sets are provably not complete under the usual many-one reductions.Let RK; RKt; RKS;RKT be the sets of strings x having complexity at least {{\left| x \right|} \mathord{\left/ {\vphantom {{\left| x \right|} 2}} \right. \kern-\nulldelimiterspace} 2}, according to the usual Kolmogorov complexity measure K, Levin's time-bounded Kolmogorov complexity Kt [27], a space-bounded Kolmogorov measure KS, and the time-bounded Kolmogorov complexity measure KT that was introduced in [4], respectively.Our main results are:1. RKS and RKt are complete for PSPACE and EXP, respectively, under P/poly-truth-table reductions.2. EXP = NPRKt.3. PSPACE = ZPP^{R_{ks} }\subseteq P^{R_k }.4. The Discrete Log, Factoring, and several lattice problems are solvable in BPPRKT.
A Network-Based Platform for Multi-Application Smart Cards
Authors: Ryutaro Toji, Yoshinori Wada, Shinichi Hirata, Katsuhiko Suzuki
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Our Network-based IC card environment "NICE" is a platform for multi-application smart card operation and management. It is designed for multiple business entities scattered over an open network and enables cooperative operation and management of multi-application smart card and card applications. NICE flexibly supports various business models based on a well-defined role model including some new agent roles that are expected to emerge in the near future. Most of the card operations can be performed securely through the Internet by establishing an asymmetric cryptography-based security protection framework. It also provides an access control method for card-server communications that is helpful in preventing malicious card usage and achieving easy and efficient card management. The first version of NICE was completed in March 2001, and we confirmed the feasibility of card and card application management using NICE.
I3: A Petri-Net Based Specification Method for Architectural Components
Authors: Carl K. Chang, Seongwoon Kim
Venue: 23rd International Computer Software and Applications Conference (1999)

As a research based on technology integration, I3 (pronounced "I cube") is an executable architectural component description language based on Colored Petri-Net semantics with the style and understandability of SADT. I3 describes architectural components hierarchically in three levels. First, interface net declares services to be provided to other components. Next, interconnection net specifies the services to be acquired from other components. Finally, interoperation net describes the operational behavior of a component. Through its unique interconnection mechanism, I3 facilitates the software architect in building an architectural model and formalizing the architectural topology and behavior of each software component as well as the entire system. Implementation of I3 can be made CORBA-compliant.
Neural Analysis of Mobile Radio Access Network
Authors: Kimmo Raivio, Olli Simula, Jaana Laiho
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The Self-Organizing Map (SOM) is an efficient tool for visualization and clustering of multidimensional data. It transforms the input vectors on two-dimensional grid of prototype vectors and orders them. The ordered prototype vectors are easier to visualize and explore than the original data. Mobile networks produce a huge amount of spatio-temporaldata. The data consists of parameters of base stations (BS)and quality information of calls. There are two alternatives in starting the data analysis. We can build either a general one-cell-model trained using state vectors from all cells, or a model of the network using state vectors with parameters from all mobile cells. In both methods,further analysis is needed to understand the reasons for various operational states of the entire network.