ppxscal/embedding_network huggingface dataset:
An "in the limit" View
Authors: Larry J. Dalton
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The continuum of systems, based on consequences of failure, range from the completely benign , as in video games, to the extreme, "in the limit" case of nuclear weapons. As a function of consequences, we must apply engineering skill during all phases of system creation to 1) provide for intrinsic surety and 2) allow for systems that yield sufficiently to intellectually based analysis.
An Evolutionary Neuro-Fuzzy Approach to Recognize On-Line Arabic Handwriting
Authors: Adel M. Alimi
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper we describe a system that recognizes on-line Arabic cursive handwriting. In this system, a genetic algorithm is used to select the best combination of characters recognized by a fuzzy neural network. The handwritten words used in this system are modelled by a theory of movement generation. Based on this motor theory, the features extracted from each character are the neuro-physiological and biomechanical parameters of the equation describing the curvilinear velocity of the script. The evolutionary approach proposed here permits the recognition of cursive handwriting with a segmentation procedure allowing overlapped strokes having neuro-physiological meaning.
Good Enough versus High Assurance Software Testing and Evaluation Methods
Authors: William E. Howden
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Good enough evaluation methods are reviewed, including low volume statistical testing. High assurance software is viewed as requiring high volume statistical testing, or analysis methods that prove that a program has certain desired properties. The weaknesses of some previous high assurance strategies are discussed, and a new approach called pattern directed testing and analysis is described. In this approach, design patterns are used to give high assurance for critical, generic properties, and good enough assurance for problem dependent system functionality.
Learning Intersections and Thresholds of Halfspaces
Authors: Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning intersections and thresholds of halfspaces. Our uniform distribution learning algorithms involve a novel non-geometric approach to learning halfspaces;we use Fourier techniques together with a careful analysis of the noise sensitivity of functions of halfspaces. Our algorithms for learning under any distribution use techniques from real approximation theory to construct low degree polynomial threshold functions.
An Advanced I/O Architecture for Supporting Mixed Workloads in an Active Data Warehouse Environment
Authors: Stephen Brobst, Mark Morris
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Active Data Warehouse environments for advanced decision support demand extreme service levels in the area of performance delivery. An Active Data Warehouse environment,however, has very different I/O patterns than a purely traditional data warehouse implementation. An Active Data Warehouse must be designed to support a mixed workload consisting of tactical and strategic decision support queries with highly variable I/O patterns. In this paper we will present a solution for increasing the performance of mixed workloads through use of cylinder reads and optimized block sizes. Tradeoffs in implementation strategies and performance implications will be discussed along with future areas of research.
Effect of Object Orientation on Maintainability of Software
Authors: G. Aditya Kiran, S. Haripriya, Pankaj Jalote
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Maintenance is the set of activities performed after the installation of software. It is well known that over the life of a software, the maintenance costs can far exc eed the development cost. In this work, we describe an experimental study ab out the effect of object orientation on maintenance. In particular, we focus on how object orientation fares in maintainability when compared to software designed using function oriented appr oaches. For the experiment, a testbed was prepared which consiste dof three problems, for each of which, the requir ement specification, a C implementation, and a C++ implementation of an object oriented design, were available. Various maintenance exercises were performed on the the two versions of the projects and different metrics collected. In these experiments, object oriented software generally fared better for maintainability.
Constructing Bayesian-network models of software testing and maintenance uncertainties
Authors: Hadar Ziv, Debra J. Richardson
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The lifetime of many software systems is surprisingly long, often far exceeding initial plans and expectations. During software evolution and maintenance, developers and managers frequently gain or lose confidence in software artifacts, especially when existing uncertainties are relieved or new ones are encountered. Fluctuations in developers' confidences may in turn affect process actions or decisions, e.g. in determining the impact of change, whether regression testing is needed or when to stop testing. We present an approach that allows developers' confidences or "beliefs" regarding software components to be modeled and updated directly. This approach is part of an overall strategy that calls for explicit modeling of software uncertainties using the technique called Bayesian belief networks. Initially, we present several kinds of software uncertainty and how they may be modeled. This is followed by introducing Bayesian belief networks and how they may be used to either confirm, evaluate or predict software uncertainties. We discuss our experiences in constructing Bayesian-network models for an existing software system under development at Beckman Instruments. Once constructed, these models may be used by developers and managers in future software understanding, evolution and maintenance activities. We also list several factors that may affect confidence as identified in conjunction with the Beckman study. Finally, we describe the design and implementation of a Java program that allows software systems and associated beliefs to be modeled explicitly.
COWL: Copy-On-Write for Logic Programs
Authors: Vítor Santos Costa
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programming systems would like to exploit maximum parallelism for existing and novel applications, ideally by supporting both and-parallelism and or-parallelism. Unfortunately, the combination of both forms of parallelism is a hard problem, and available proposals cannot match the efficiency of, say, or-parallel only systems.We propose a novel approach to And/Or Parallelism in logic programs. Our initial observation is that stack copying, the most popular technique in or-parallel systems, does not work well with And/Or systems because memory management is much more complex. Copying is also a significant problem in operating systems where the copy-on-write (COW) has been developed to address the problem. We demonstrate that this technique can also be applied to And/Or systems, and present both shared memory and distributed shared memory designs.
SEQ: A Model for Sequence Databases
Authors: Praveen Seshadri, Miron Livny, Raghu Ramakrishnan
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

This paper presents the SEQ model which is the basis for a system to manage various kinds of sequence data. The model separates the data from the ordering information, and includes operators based on two distinct abstractions of a sequence. The main contributions of the SEQ model are: (a) it can deal with different types of sequence data, (b) it supports an expressive range of sequence queries, (c) it draws from many of the diverse existing approaches to modeling sequence data.
Concurrent SSA Form in the Presence of Mutual Exclusion
Authors: Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper we propose new analysis and optimization techniques for compiling explicitly parallel programs that use mutual exclusion synchronization. We introduce the CSSAME form, an extension of the Concurrent Static Single Assignment (CSSA) form that incorporates mutual exclusion into a data flow framework for explicitly parallel programs. We show how this analysis can improve the effectiveness of constant propagation in a parallel program. We also modify a dead-code elimination algorithm to work on explicitly parallel programs. Finally, we introduce lock independent code motion, a new optimization technique that attempts to minimize the size of critical sections in the program.
Informatics and Distributed Representation; Taking Issue with Disembodied Realism
Authors: Antony Bryant
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

My paper offers a critique of some of the key assumptions that are prevalent in research and related work in informatics. Many of these have had constraining effect on conceptual progress in the field, and particularly in areas that seek to include cognition. I sall deal with therationalist and realist assumptions, and what has been termed the functionalist view of representation.
From Acquisition to Modelisation of a Form Base to Retrieve Information
Authors: Sebastien Diana, Éric Trupin, F. Jouzel, Yves Lecourtier, Jacques Labiche
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This article deals with the description of a module for information structure extraction. This module is applied to forms which are used by the CAF, the French national family allowance Department -Caisse d'Allocations Familiales-. The aim of this module is to create a base of information structures - models - defining their forms and their content so as to be able to treat them automatically. The module deals with the various stages of form treatment, from acquisition to modelisation. It is composed by 3 different stages. The first corresponds to low-level processing -i.e., binarisation, skew correction-. The second extracts the informative features contained in the forms. The last one organises the different features to obtain form modelisation thanks to a hierarchical structuration. The creation of this base of information structures will be used for a second module for type form identification based on the comparison of these information structures.
Ubiquitous Internet Access Control: The PAPI System
Authors: Diego R. López, Rodrigo Castro-Rojo
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

PAPI is a system for providing access control to restricted information resources across the Internet. The authentication mechanisms are designed to be as flexible as possible, allowing each organization to use its own authentication schema, keeping user privacy, and offering information providers data enough for statistics. Access control mechanisms are transparent to the user and compatible with the most commonly employed Web browsers and any operating system. Since PAPI uses standard HTTP procedures, PAPI authentication and access control does not require any specific hardware or software, thus providing users with ubiquitous access to any resource they have right to.
The Andon System: Designing a CSCW Environment in a Lean Organization
Authors: André M. da Silva, Maria Cecília Calani Baranauskas
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Andon is a system to support collaborative work in a lean manufacturing organization. The design of Andon is part of a study aimed at exploring the multiple disciplines involved in CSCW (computer-supported cooperative work). Its development is an attempt to use participatory practices and a proposed lifecycle model to overcome the difficulties that arise during the development of CSCW applications. This paper presents and discusses the design process of Andon.
Pausible Clocking: A First Step Toward Heterogeneous Systems
Authors: Kenneth Y. Yun, Ryan P. Donohue
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper describes a novel communication scheme, which is guaranteed to be free of synchronization failures, amongst multiple synchronous modules operating independently. In this scheme, communication between every pair of modules is done through an asynchronous FIFO channel; communication between a module and the FIFO is done using a request/acknowledge handshaking. Synchronization of handshaking signals to the local module clock is done in an unconventional way -- the local clock built out of a ring oscillator is paused or stretched, if necessary, to ensure that the handshaking signal satisfies setup and hold time constraints with respect to the local clock. We constructed a test bed consisting of two synchronous modules with pausible clocking control and an asynchronous FIFO on a MOSIS 1.2um CMOS chip. The resulting system functions reliably up to the local clock frequency of 220MHz (according to SPICE simulation) -- the maximum clock rate is limited by the ring oscillator, not the pausible clocking control. Preliminary test results indicate that the fabricated chips operate correctly as simulated.
Mining Weak Rules
Authors: Huan Liu, Hongjun Lu
Venue: 23rd International Computer Software and Applications Conference (1999)

Finding patterns from data sets is a fundamental task of data mining. If we categorize all patterns into strong, weak, and random, conventional data mining techniques are designed only to find strong patterns, which hold for numerous objects and are usually consistent with the expectations of experts.In this paper, we address the problem of finding weak patterns (i.e., reliable exceptions) from databases. They are valid for a small number of objects. A simple approach is proposed which uses deviation analysis to identify interesting exceptions and explore reliable ones. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.
Anchor Text Mining for Translation of Web Queries
Authors: Wen-Hsiang Lu, Lee-Feng Chien, Hsi-Jian Lee
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper presents an approach to automatically extracting translations of Web query terms through mining of Web anchor texts and link structures. One of the existing difficulties in cross-language information retrieval (CLIR)and Web search is the lack of the appropriate translations of new terminology and proper names. Such a difficult problem can be effectively alleviated by our proposed approach, and the resource of anchor texts in the Web is proven a valuable corpus for this kind of term translation.
Program Understanding Using Program Slivers&mdash;An Experience Report
Authors: A. Gupta
Venue: Proceedings of the International Conference on Software Maintenance (1997)

A large amount of legacy software is written in languages such as FORTRAN and COBOL. Hard-copy and inline documentation for this software is often inadequate to perform maintenance or re-implementation. These tasks are further hampered by legacy structures and programming style such as the use of "goto". This paper describes our experience using simple pattern matching tools to obtain "slivers" from legacy Process Information Systems. These slivers provided information that assisted in recovering program design. These slivers also helped in identifying segments which could cause problems with two-digit year fields at the turn of the century. 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
Statistical generalization: theory and applications
Authors: Benjamin W. Wah, Arthur Ieumwananonthachai, Shu Yao, Ting Yu
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

In this paper, we discuss a new approach to generalize heuristic methods (HMs) to new test cases of an application, and conditions under which such generalization is possible. Generalization is difficult when performance values of HMs are characterized by multiple statistical distributions across subsets of test cases of an application. We define a new measure called probability of win and propose three methods to evaluate it: interval analysis, maximum likelihood estimate, and Bayesian analysis. We show experimental results on new HMs found for blind equalization and branch-and-bound search.
Comparing and Combining Read Miss Clustering and Software Prefetching
Authors: Vijay S. Pai, Sarita V. Adve
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: A recent latency tolerance technique, read miss clustering, restructures code to send demand miss references in parallel to the underlying memory system. An alternate, widely-used latency tolerance technique is software prefetching, which initiates data fetches ahead of expected demand miss references by a certain distance. Since both techniques seem to target the same types of latencies and use the same system resources, it is unclear which technique is superior or if both can be combined. This paper shows that these two techniques are actually mutually beneficial, each helping to overcome limitations of the other. We perform our study for uniprocessor and multiprocessor configurations, in simulation and on a real machine (Convex Exemplar). Compared to prefetching alone (the state-of-the-art implemented in systems today), the combination of the two techniques reduces execution time an average of 21% across all cases studied in simulation and an average of 16% for 5 out of 10 cases on the Exemplar. The combination sees execution time reductions relative to clustering alone averaging 15% for 6 out of 11 cases in simulation and 20% for 6 out of 10 cases on the Exemplar.
Run-time support for asynchronous parallel computations
Authors: Guillermo A. Alvarez, Marcelo O. Fernández, Ragelio A. Alvez, Sylvia Rodriguez, Julio A. Sánchez Avalos, Jorge L. C. Sanz
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In this peeper we describe DREAM, a distributed environment that provides run-time support for parallel computations on asynchronous multiprocessors. The system supports global distributed arrays as collections of subarrays in the local memories of the intervening processors. Nodes allocate and deallocate array portions dynamically, and access external array sections without the intervention of the user programming in the remote node. Remote accesses can be performed while the program continues its execution, thus overlapping communication and computation. This feature allows the user to implement dynamic communication patterns by accessing external array elements on demand without incurring a heavy performance penalty. DREAM also vectorizes requests into larger network messages for efficiency. We report performance results for an application running on top of a prototype of the system, showing good scalability and masking the network latency with computation.
Preference Based Task Allocation in Holonic Manufacturing
Authors: S. Misbah Deen, Rashid Jayousi
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper presents an agent-based preference model for task allocation in Holonic Manufacturing Systems (HMS). In such systems agents/holons interact to assemble products, using preferences on things like assemblers, end times and so on. We show how to derive a preference-based solution in presence of contention where awarding preferences to the solution of one task can only be done by removing preferences from that of another task. The model can trade preferences in a "fairly competitive" market, enforce timely termination and produce a "reasonable" solution that satisfies the preferences. We have implemented the preference model using a manufacturing example under Java. In this paper we present the results obtained from this implementation.
Organizational Memories as Electronic Discussion By-Products
Authors: Natalia A. Romero, José A. Pino, Luis A. Guerrero
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

An approach to develop organizational memory systems is presented. It is based on the re-use of computer-supported discussions held as meeting preparations. The discussions are rich in informal knowledge, which is basic for a good organizational memory. The presentation is illustrated with a brief introduction to OMUSISCO, a software system based on this approach. OMUSISCO uses SISCO meeting preparation discussions as its information source. A thesaurus is built to help users access knowledge. The system was tested with simple discussions, but it should scale up well in real situations.
Prefetching from Broadcast Disks
Authors: Swarup Acharya, Michael J. Franklin, Stanley B. Zdonik
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Broadcast Disks have been proposed as a means to efficiently deliver data to clients in ``asymmetric'' environments where the available bandwidth from the server to the clients greatly exceeds the bandwidth in the opposite direction. A previous study investigated the use of cost-based caching to improve performance when clients access the broadcast in a demand-driven manner [. achas 95 .]. Such demand-driven access however, does not fully exploit the dissemination-based nature of the broadcast, which is particularly conducive to client {\em prefetching}. With a Broadcast Disk, pages continually flow past the clients so that, in contrast to traditional environments, prefetching can be performed without placing additional load on shared resources. We argue for the use of a simple prefetch heuristic called \PT{} and show that \PT{} balances the cache residency time of a data item with its bandwidth allocation. Because of this tradeoff, \PT{} is very tolerant of variations in the broadcast program. We describe an implementable approximation for \PT{} and examine its sensitivity to access probability estimation errors. The results show that the technique is effective even when the probability estimation is substantially different from the actual values.