ppxscal/embedding_network huggingface dataset:
Intraprocedural Static Slicing of Binary Executables
Authors: Cristina Cifuentes, Antoine Fraboulet
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Program slicing is a technique for determining the set of statements of a program that potentially affect the value of a variable at some point in the program. Intra and interprocedural slicing of high-level languages has greatly been studied in the literature; both static and dynamic techniques have been used to aid in the debugging, maintenance, parallelization, program integration, and dataflow testing of programs. In this paper we explain how to apply conventional intraprocedural static analysis to binary executables, for the purposes of static analysis of machine-code and assembly code, such as debugging code and determining the instructions that affect an indexed jump or an indirect call on a register. This analysis is useful in the decoding of machine instructions phase of reverse engineering tools of binary executables, such as binary translators, disassemblers, binary profilers and binary debuggers.
Games and conditionals
Authors: Horacio Arló-Costa, Cristina Bicchieri
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

In a 1995 paper, Aumann [4] gave a proof of the claim that, in a game of perfect information, rational players who have common knowledge of their mutual rationality must play the backwards induction solution. Binmore [6] has been quite vocal in his opposition to Aumann's claims. What would a player do, he asks, if she were to observe a deviation from the backwards induction equilibrium path? The question is not idle, since it is a good policy for any player - before committing herself to a course of action -- to investigate all the available alternatives and the likely consequences for each of them. This, by the way, is no counterfactual reasoning, as some game theorists have argued. A counterfactual must have a contrary-to-fact event as an antecedent, as when we say 'Had Cleopatra's nose been shorter, Anthony would have been the first Roman emperor'. Now, we know her nose was long, and that Anthony fell madly in love with her, went to war against Rome and lost to Augustus, who then became the first emperor.
A Hypergraph Based Clustering Algorithm for Spatial Data Sets
Authors: Jong-Sheng Cherng, Mei-Jung Lo
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Clustering is a discovery process in data mining an can be used to group together the objects of a database into meaningful subclasses which serve as the foundation for other data analysis techniques.In this paper, we focus on dealing with a set of spatial data. For the spatial data, the clustering problem becomes that of finding the densely populate regions of the space and thus grouping these regions into clusters such that the intracluster similarity is maximized and theintercluster similarity is minimized. We develop a novel hierarchical clustering algorithm that uses a hypergraph to represent a set of spatial data. This hypergraph is initially constructed from the Delaunay triangulation graph of the data set and can correctly capture the relationships among sets of data points. Two phases are developed for the proposed clustering algorithm to find the clusters in the data set.We evaluate our hierarchical clustering algorithm with some spatial data sets in which contain clusters of different sizes, shapes, densities, and noise. Experimental results on these data sets are very encouraging.
Cashmere-VLM: Remote Memory Paging for Software Distributed Shared Memory
Authors: Sandhya Dwarkadas, Robert Stets, Nikolaos Hardavellas, Leonidas I. Kontothanassis, Rishiyur S. Nikhil
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Software distributed shared memory (DSM) systems have successfully provided the illusion of shared memory on distributed memory machines. However, most software DSM systems use the main memory of each machine as a level in a cache hierarchy, replicating copies of shared data in local memory. Since computer memories tend to be much larger than caches, DSM systems have largely ignored memory capacity issues, assuming there is always enough space in main memory in which to replicate data. Applications that access data that exceeds the capacity available in local memory will page to disk, resulting in reduced performance. We have developed a software DSM system based on Cashmere that takes advantage of system-wide memory resources in order to reduce or eliminate paging overhead. Experimental results on a 4-node, 16-processor AlphaServer system demonstrate the improvement in performance using the enhanced software DSM system for applications with large data sets.
Using Dynamically Created Decision-Making Organizations (Holarchies) to Plan, Commit, and Execute Control Tasks in a Chilled Water System
Authors: Francisco P. Maturana, Pavel Tichý, Raymond Staron, Petr Slechta
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

A multi-agent architecture to automate complex industrial systems is described. The multi-agent system is created with artificial social behaviors to enable cooperation among the agents. Agents organize their respective views about the system to react to changes and to discover system capabilities. We explore the implications of using agent technology in the design and operation of a Chilled Water System. Our aim is to contribute with a set of guidelines on how to build autonomous agents for industrial automation.
A Knowledge-Based Image Understanding Environment for Document Processing
Authors: Ying Li, Marc Lalonde, Eric Reiher, Jean-Francois Rizand, Chong Zhu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The CRIM Image Mining Environment (CIME) is an image understanding environment integrated with knowledge engineering technologies. The image understanding technology developed for CIME supports recognition tasks such as symbol recognition, contour line recognition, and general image processing operations. CIME is composed of an Object Model Description Language (OMDL) which allows for the semantic description of knowledge about objects and their context, an inference engine which performs image understanding based on the model descriptions in OMDL to achieve the recognition of complex objects, and a task builder which allows for the acquisition of image understanding knowledge and helps the application designer to build strategies for solving application problems through knowledge reuse.
Can Trace-Driven Simulators Accurately Predict Superscalar Performance?
Authors: Bryan Black, Andrew S. Huang, Mikko H. Lipasti, John Paul Shen
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

There are four crucial issues associated with performance simulators: simulator retargetability, simulator validation, simulation speed and simulation accuracy. This paper documents our experiences in developing performance simulators and our recent findings in using these simulators. We are concerned with all four of the crucial issues. Our first-generation tool, VMW, focused on achieving retargetability. Our second-generation tool, MW, significantly improved simulation speed. Recently we validated a PowerPC 604 simulator model, generated using MW, against an actual PowerPC 604 hardware system. We also present results on simulating extremely long traces on our PowerPC 620 model and highlight potential inaccuracies that can result from trace sampling. As processor complexity continues to increase at a rapid rate and microarchitectures continue to become more speculative, it is not clear whether the trace-driven paradigm of performance simulation can continue to effectively predict actual machine performance.
Object Related Plus: A Practical Tool for Developing Enhanced Object Databases
Authors: Bryon K. Ehlmann, Gregory A. Riccardi
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Object Relater Plus is a practical tool currently being used for research and development of enhanced object databases (ODBs). The tool, which is a prototype Object Database Management System (ODBMS), provides two languages that are compatible with the ODMG-93 ODBMS standard yet enhance it in some significant ways. The Object Database Definition Language (ODDL) allows object relationships to be better defined and supported; provides for the specification and separation of external, conceptual, and internal views; and facilitates the implementation of domain specific ODB extensions. The Object Database Manipulation Language (ODML) augments ODDL by providing a C++ interface for database creation, access, and manipulation based on an ODDL specification. In this paper we give an overview of Object Relater Plus, emphasizing its salient features. We also briefly discuss its architecture and implementation and its use in developing scientific databases.
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
Authors: Miroslaw Kutylowski, Tomasz Wierzbicki
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

PADDED-SORTING is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, padded-sorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of sorting. We analyze time complexity of these problems on CREW and EREW PRAMs (deterministic and randomized) and get tight lower und upper bounds depending on the size of free space. We extend our lower bounds to approximate compaction and compression.Some of the algorithms presented are very rare examples of randomized EREW PRAMs that are much faster than their deterministic counterparts.
Handheld Use in K-12: A Descriptive Account
Authors: Michael Curtis, Kathleen Luchini, William Bobrowsky, Chris Quintana, Elliot Soloway
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper describes ways handheld computers have been used by students at four different Michigan schools. Regardless of age or environment, our experience has shown that the primary, and most powerful uses of handheld computers have not been for organizationalpurposes. While students do take advantage of the organizational abilities, handhelds are most often used as tools to aid in research, alternatives to paper-based tasks, group collaboration activities, and much more. In addition to describing student tasks, this paper provides a context as to how much time handheld computers are being used in each classroom. This framework of time use and task use provides a better understanding of what aclassroom with handheld computers might look like.
Optimization Rules for Programming with Collective Operations
Authors: Sergei Gorlatch, Christoph Wedler, Christian Lengauer
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a formal framework for reasoning about collective operations; (2) a set of optimization rules which save communications by fusing several collective operations into one; (3) performance estimates, which guide the application of optimization rules depending on the machine characteristics; (4) a simple case study with machine experiments.
A Distributed Multimedia Component Architecture
Authors: Dan G. Waddington, Geoff Coulson
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

A new framework is required for the consistent and coordinated construction and configuration of multimedia components across heterogeneous distributed object environments. This paper presents a Distributed Multimedia Component Architecture which extends beyond the current well developed distributed object models, such as the Common Object Request Broker Architecture (CORBA) and the Microsoft Distributed Component Object Model (DCOM) models, to support additional mechanisms and abstractions for continuous media stream interactions aimed particularly at distributed multimedia applications. This framework additionally includes distributed resource management and dynamic Quality of Service (QoS) monitoring and adaptation in order to support the implementation of complex distributed multimedia applications over heterogeneous networks and end-systems. The Multimedia Component Architecture (MCA) presented is being used as the middleware component of a comprehensive Resource Management Architecture for Distributed Applications.
A Cost-Based Replacement Algorithm for Object Buffers
Authors: Chong-Mok Park, Kyu-Young Whang, Jeong-Joon Lee, Il-Yeol Song
Venue: 24th International Computer Software and Applications Conference (2000)

Many object-oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed-length pages simply assume that the cost incurred by operating a buffer is proportional to the number of buffer faults. However, this assumption no longer holds in an object buffer where objects are of variable-lengths and the cost of replacing an object varies for each object. In this paper, we propose a cost-based replacement algorithm for object buffers. The proposed algorithm replaces the objects that have minimum costs per unit time and unit space. The cost model extends the previous page-based one to include the replacement costs and the sizes of objects. The performance tests show that the proposed algorithm is almost always superior to the LRU-2 algorithm and, when significant replacement cost is involved, is more than twice as fast.
The effect of interface complexity on program error density
Authors: Ryouei Takahashi, Yukihiro Nakamura
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

The paper explains how to evaluate software maintainability by considering the effects of interfaced complexities between modified and unmodified parts. When software is maintained, designers develop software, considering not only functions of modified parts but also those of unmodified parts by reading specifications or source codes. So, not only does the volume and complexity of the unmodified and modified parts, but also the interfaced complexities between, them greatly affect the occurrence of software errors. The modified part consists of several subsystems, each of which is composed of several functionally related routines. The unmodified part also consists of several routines. A routine corresponds to a function of C-coding. We experimentally show by regression and discriminant analyses that the quality of each routine tends to decrease as the reuse-ratio increases. The optimal threshold of reuse-ratio is selected by applying AIC (Akaihe Information Criterion) procedures to discriminant analysis for software quality classification. We can reasonably separate routines into two parts, one modified in which most software errors occur and the other unmodified in which few errors occur. The interfaced complexities measured by the extended cyclomatic number between each sub system of the modified part and the unmodified part greatly affect the number of errors and error density. By applying regression analysis to medium size software, we have shown that 40% of variance of error density are represented by interfaced complexities among each subsystem of the modified part and the unmodified part.
Using Character Shape Coding for Information Retrieval
Authors: Alan F. Smeaton, A. Lawrence Spitz
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In conventional information retrieval the task of finding users' search terms in a document is simple. When the document is not available in machine-readable format, optical character recognition (OCR) can usually be performed. We have developed a technique for performing information retrieval on document images in such a manner that the accuracy has great utility. The method makes generalisations about the images of characters, then performs classification of these and agglomerates the resulting character shape codes into word tokens based on character shape coding. These are sufficiently specific in their representation of the underlying words to allow reasonable performance of retrieval. Using a collection of over 250 Mbytes of document texts and queries with known relevance assessments, we present a series of experiments to determine how various parameters in the retrieval strategy affect retrieval performance and we obtain a surprisingly good results.
Integration of hand-written address interpretation technology into the United States Postal Service Remote Computer Reader system
Authors: Sargur N. Srihari, Edward J. Kuebert
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Hand-written address interpretation (HWAI) technology has been recently incorporated into the processing of letter mail by the US Postal Service. The Remote Bar Coding System, which is an image management system for assigning bar codes to mail that has not been fully processed by postal OCR equipment, has been retrofitted with a Remote Computer Reader (RCR), into which the HWAI technology is integrated. A description of the HWAI technology, including its algorithms for the control structure, recognizers and databases, is provided. Its performance on more than a million hand-written mail-pieces in a field deployment of the integrated RCR-HWAI system is indicated. Future enhancements for a nationwide deployment of the system are indicated.
Dynamic Processor Scheduling with Client Resources for Fast Multi-Resolution WWW Image Browsing
Authors: Daniel Andresen, Tao Yang, David Watson, Athanassios S. Poulakidas
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

WWW-based Internet information service has grown enormously during the last few years, and major performance bottlenecks have been caused by WWW server and Internet bandwidth inadequacies. Utilizing client-site computing power and also multi-processor support at the server site can substantially improve the system response time. In this paper, we examine the use of scheduling techniques in monitoring and adapting to workload variation at client and server sites for supporting fast WWW image browsing. We provide both analytic and experimental results to identify the impact of system loads and network bandwidth on response times and demonstrate the effectiveness of our scheduling strategy.
Empirical Software Simulation for COTS Glue Code Development and Integration
Authors: Jongmoon Baik, Nancy S. Eickelmann, Chris Abts
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

The use of COTS (Commercial-Off-The-Shelf) components for a system development has been a growing trend in the software engineering community during the past decade. However, the engineering of COTS-based systems involves significant technical risks. A good indicator of the as yet unresolved difficulties in COTS-based system developments is the relatively poor understanding frequently regarding the processes associated with development of the "glue code" used to integrate COTS components into the system, as well as with the other integration activities. The main objective of this paper is to understand how the glue code development process and the COTS component integration process affect each other and how they affect development effort and schedule throughout the development life cycle, based on given parameters via software simulation that provides a method for checking the understanding of the real world process and thus help people produce better results in the future.
Specifying and Verifying Temporal Behavior of High Assurance Systems Using Reachability Tree Logic
Authors: Stephen J. H. Yang, Sam Lin, Jonathan Lee, William C. Chu
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

This paper presents our reachability tree logic (RTL) and its integration with time Petri nets to specify and verify the temporal behavior of high assurance systems. In addition, we will demonstrate how to reduce the complexity of model-checking algorithm by using the reachability tree. We have implemented a specification and verification toolkit called as NCUPN (National Central University Petri Nets toolkit) using Java. NCUPN is now available on the Internet via http://140.115.50.137.
Are We At Last Seeing Global Movements Towards Software Engineering Professionalism?
Authors: J. Barrie Thompson
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

At compsac2000 a panel session entitled "Is the Harmonisation of Professional Standards for Software Engineers Feasible? Or Even Welcome?" was held to discuss and evaluate, within a Software Engineering context, a document entitled the "Harmonization of Professional Standards" that had been produced under the auspices of IFIP (International Federation for Information Processing) [1]. The overall feeling at that session was that there were significant constraints and problems regarding the professionalism of the Software Engineering at that time (reported in [2]). In this 2002 session the panellists will be invited to consider developments that have taken place over the last two years and address the question "Are We At Last Seeing Global Movements Towards Software Engineering Professionalism?" In particular the panellists will be directed to consider the following:1. The development and publication of a Software Engineering Code of Ethics and Professional Practice (The SEEPP project [3]).2. The development and publication of the trials version of The Guide to the Software Engineering Body of Knowledge (The SWEBOK project [4]).3. Activities associated with the further consideration and evaluation of IFIP's Harmonization of Professional Standards document. [2].4. The work associated with the production of the Software Engineering Volume for Computing Curriculum 2001 [5].5. IEEE Computer Society's Certified Software Development Professional Program [5].The panelist planned to look into the future and provide us with:the USA view,the European view,the Asian view,the IEEE-CS view, andthe computer ethics view.
Emulation verification of the Motorola 68060
Authors: Jainendra Kumar, Noel R. Strader, Jeff Freeman, Michael Miller
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Large-scale hardware logic emulation using software configurable hardware provides a new means to significantly improve verification of complex integrated circuits such as today's advanced microprocessors. The essence of hardware logic emulation is the provision of a hardware prototype of the circuit being designed. Such a hardware prototype can execute both pseudo-random verification vectors and software application programs up to six orders-of-magnitude faster than conventional software logic simulators. Trillions of verification vectors can be run on the emulation model for verification in only a few weeks compared to the prior best practice of running only billions of verification vectors in many months. Application of hardware logic emulation requires a sound design methodology with an HDL model (RTL or at least gate-level), an unlimited source of vectors or software applications intended to exercise the design in a target system.