ppxscal/embedding_network huggingface dataset:
Supporting Web Development in the OPEN Process: Additional Tasks
Authors: Brendan Haire, Brian Henderson-Sellers, David Lowe
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

To support commercial-strength web development, it is as important to utilize a process as it is in regular, non-web information systems development. We evaluate the efficacy of an established OO/CBD development process (OPEN), in web development and propose new and amended Activities and Tasks that should be included in OPEN to fully support the new demands of website construction and the delivery of business value on the web. Sixteen new Tasks are identified together with one new Activity. Four subtasks of particular relevance to the interface based on Usage Centered Design are also advocated.
Confidence computation improvement in an optical field reading system
Authors: Arrigo Benedetti, Zsolt Miklós Kovács-Vajna
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An expression in closed form is derived for the recognition error vs. rejection rate of optical character or word recognition systems. This expression allows to define a lower bound for the error rate of any recognition system employing a rejection process based on the definition of a confidence threshold. This relation has also proved to be useful to make a quantitative comparison between two confidence computation methods implemented in a system for reading USA Census '90 hand-written forms. The newly proposed method is based upon a confidence model integrating single-character confidence levels, digram statistics and other information from the dictionary matching phase. At a 50% rejection rate, the field error rate calculated using the new confidence computation algorithm decreased from 47.7% to 44.6%, which represents a considerable improvement, given a theoretical lower bound of 40.8% on the error rate.
Impacts of Download Size to Client-Server Applications being Migrated to the Internet
Authors: Sui-ky Ringo Ling, Vu Nguyen Tran
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Companies are moving their distributed desktop applications to the Web to take advantage of its huge user based and easy accessibility. Many focus on the issue of portability, and choose platform independent languages, such as Java to implement their applications. While the issue of Java to implement their applications. While the issue of portability is important, there are other problems and issues in migrating a distributed object application to the Web. In this paper, we use our experience of migrating a Javal|CORBA desktop application to the Web to present the problems of download size, browser security, incompatibility of virtual machines and Web-based protocol. In particular, we point out the importance of download size and how it can affect the distribution of software components within the architecture of a web application.
Active Database Management of Global Data Integrity Constraints in Heterogeneous Database Environments
Authors: Lyman Do, Pamela Drew
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Today, enterprises maintain many disparate information sources over which complex business applications are expected. The informal and ad hoc characteristics of these environments make the information very prone to inconsistency. Yet, the flexibility of application execution given to different parts of an organization is desirable. This paper introduces a new mechanism in which the execution of asynchronous, pre-existing, yet related, applications can be harnessed. A multidatabase framework that supports the concurrent execution of these heterogeneous, distributed applications is presented. Using this framework, we introduce an intuitive conceptual model and algorithm for the enforcement of interdatabase constraints based on active database technology.
Using the Compiler to Improve Cache Replacement Decisions
Authors: Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with LRU replacement policies to combine fast access with relatively low miss rates. To improve replacement decisions in set-associative caches, we develop a new set of compiler algorithms that predict which data will and will not be reused and provide these hints to the architecture.We prove that the hints either match or improve hit rates over LRU. We describe a practical one-bit cache-line tag implementation of our algorithm, called evict-me. On a cache replacement, the architecture will replace a line for which the evict-me bit is set, or if none is set, it will use the LRU bits. We implement our compiler analysis and its output in the Scale compiler. On a variety of scientific programs, using the evict-me algorithm in both the level 1and 2 caches improves simulated cycle times by up to 34% over the LRU policy by increasing hit rates. In addition, a combination of simple hardware prefetching and evict-me works together to further improve performance.
Transaction Management for a Distributed Object Storage System WAKASHI - Design, Implementation and Performance
Authors: Ge Yu, Kunihiko Kaneko, Guangyi Bai, Akifumi Makinouchi
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

This paper presents the transaction management in a high performance distributed object storage system WAKASHI. Unlike other systems that use centralized client/server architecture and offer conventional buffer management for distributed persistent object management, WAKASHI is based on symmetric peer-peer architecture and employs memory-mapping and distributed shared virtual memory techniques. Several novel techniques on transaction management for WAKASHI are developed. First, a multi-threaded transaction manager offers ``multi-threaded connection'' so that data control and transaction operations can be performed in parallel manner. Secondly, a concurrency control mechanism supports transparent page-level locks to reduce the complexity of user programs and locking overhead. Thirdly, a ``compact commit'' method is proposed to minimize the communication cost by reducing the amount of data and the number of connections. Fourthly, a redo-only recovery method is implemented by ``shadowed cache'' method to minimize the logging cost, and to allow fast recovery and system restart. Moreover, the system offers ``hierarchical'' control to support nested transactions. A performance evaluation by the OO7 benchmark is presented, as well.
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
Authors: Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Gerla
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW) is a sender side only modification to improve TCP performance particularly over heterogeneous networks. The key idea of TCPW is to use rate estimation methods to set the congestion window and slow start threshold after a packet loss. When packet losses are not only due to buffer overflow, but random errors as well, TCPW estimation methods have beenshown to provide significant performance improvement. The earliest estimation method, called Bandwidth Estimation (BE), however, may result in over-estimation under certain circumstances, and thus may be unfriendly toward non-TCPW traffic. TCPW CRB (Combined Rate and Bandwidth estimation) and TCPW ABSE (Adaptive Bandwidth Share Estimation), have been later introduced to address this concern. The schemes provide better control of the tradeoffs among efficiency, friendliness, and implementation complexity. CRB may slightlysacrifice the efficiency gain to ensure friendliness. ABSE adaptivity mechanisms are more sophisticated and provide both better efficiency and friendliness. In this paper, we summarize ABSE, which adapts to congestion level, as well as round drip time, and other network dynamics, thus providing enhanced and robust performance under various network conditions. Extensive experiments show that TCPW ABSE is able to enhance TCP performance significantly over "large leaky pipes", while maintaining friendliness toward TCP NewReno. In this paper we show that TCPW ABSE is robust to packet and ACK compression due to cross traffic on forward and backward paths. We also show that ABSE is robust tobuffer size variations, which are inevitable in today's networks.
Using Rule Sets to Maximize ROC Performance
Authors: Tom Fawcett
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Rules are commonly use for classification because they are modular, intelligible and easy to learn. Existing work in classification rule learning assumes the goal is to produce categorical classifications to maximize classification accuracy. Recent work in machine learning has pointed out the limitations of classification accuracy: when class distributions are skewed, or error costs are unequal, an accuracy maximizing rule set can perform poorly. Amore flexible use of a rule set is to produce instance scores indicating the likelihood that an instance belongs to a given class. With such an ability, we can apply rulesets effectively whendistributions are skewed or error costs are unequal. This paper empirically investigates different strategies for evaluating rule sets when the goal is to maximize the scoring (ROC)performance.
Old Movie Restoration using Opening by Surface
Authors: Silvio Jamil Ferzoli Guimaraes, Arnaldo De Albuquerque Araújo, Gustavo Cerqueira
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

Because of their storage conditions, old movies may present different defect types of different shapes and sizes. We propose a method for old movie restoration using opening by surface which eliminates image information by area attribute, independent of the shape of its components.
Early Experiences on Promoting Explicit Separation of Details to Improve Software Processes Reusability
Authors: Rodrigo Quites Reis, Carla Alessandra Lima Reis, Heribert Schlebbe, Daltro José Nunes
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper discusses the experience on using a multiple perspective approach to promote the reuse of software process models. The proposed paradigm relies on the definition of a set of independently defined dimensions that constitute the building blocks for process model composition. An algebraically specified model was used to derive a Java-based prototype, which was used to evaluate its feasibility with standard literature-described and domain-specific process examples. The results are discussed and highlight needs for future research in this topic.
Theorem proving: not an esoteric diversion, but the unifying framework for industrial verification
Authors: David A. Cyrluk, M. K. Srivas
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The effectiveness of hardware verification techniques has increased markedly in the past decade. As hardware verification techniques become increasingly powerful the idea of transitioning verification technology to industry can be taken seriously. Nevertheless, powerful decision procedures that can completely automate the verification of certain types of hardware, whether they are BDD based model-checkers or automatic microprocessor verification tools, cannot be adequate on their own for industrial hardware verification. However, a high-level, general-purpose theorem prover with specific capabilities can provide an overall framework in which these tools can be embedded and in which they can then be effectively used for industrial hardware verification.
Caching processor general registers
Authors: Robert Yung, Neil C. Wilhelm
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

VLIW, multi-context, or windowed-register architectures may require one hundred or more processor registers. It can be difficult to design a register file with so many registers that meets processor cycle time requirements. We propose to resolve this problem by taking advantage of register values that are bypassed within a processor's pipeline, and supplementing the bypassed values with values supplied by a small register cache. If the register cache is sufficiently small then it can be designed to meet a fast target cycle time. We call this combination of bypassing and register caching the register scoreboard and cache. We develop a simple performance model and show by simulations that it can be effective for windowed-register architectures.
Design, Implementation and Evaluation of SCORE (a System for COntent based REtrieval of Pictures)
Authors: Y. Alp Aslandogan, Chuck Thier, Clement T. Yu, Chengwen Liu, Krishnakumar R. Nair
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We make use of a refined E-R model to represent the contents of pictures. We propose remedies to handle mismatches which may arise due to differences in perception of picture contents. An iconic user interface for visual query construction is presented. A naive user can specify his/her intention without learning a query language. A function which computes the similarity between a picture and a user's description is provided. Pictures which are sufficiently close to the user description, as measured by the similarity function, are retrieved. We present the results of a user-friendliness experiment to evaluate the user interface as well as retrieval effectiveness. Encouraging retrieval results and valuable lessons are obtained.
DNA computations can have global memory
Authors: Richard J. Lipton
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Ever since Adleman's seminal paper (1994) there has been a flood of ideas on how one could use DNA to compute. There have been many papers on using DNA to solve various computational problems. At the top-most level all these papers use DNA in the same way. Each strand of DNA encodes the state of a processor. Each processor operates independently: there is no communication from one processor to another. Processors each search their own part of a large space. The papers differ in the details of how they encode the state into the DNA. They all, however, perform independent searches. Our new result is that we can allow, for the first time, global memory. That is, we show that the individual DNA strands can communication with each other. This changes everything. The point is that DNA can do much more general parallel computations than previously realized. The class of computations that allow global memory are much more powerful than independent searches. For example, one of the main ways to search large spaces is the so called "branch-and-bound" method. In this method the search in one part of the space is "pruned" by values found in other parts of the space. Previously, it was not possible to even imagine how DNA computations could do this: now we know how. Our method is based on the same bio-technology operations that we have used previously. We use no new bio-operations. Thus, our addition of global memory to DNA computations has all the promise and difficulties that previous DNA computations had. The key is that we use nothing new: we just exploit the power of the existing methods in a new way.
Approximating Parametric Curves with Strip Trees using Affine Arithmetic
Authors: Luiz Henrique de Figueiredo, Jorge Stolfi, Luiz Velho
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We show how to use affine arithmetic to represent a parametric curve with a strip tree. The required bounding rectangles for pieces of the curve are computed by exploiting the linear correlation information given by affine arithmetic. As an application, we show how to compute approximate distance fields for parametric curves.
Memory efficient skeletonization of utility maps
Authors: Albert M. Vossepoel, Klamer Schutte, Carl F. P. Delanghe
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An algorithm is presented that allows one to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what is considered as a small component. Next, the skeleton parts are connected again at the middle of the overlap zones. Some examples are given for efficient memory utilization in tiling an A0 size map into a predefined number of tiles or into tiles of a predefined (square) size. The algorithm is also suited for a parallel implementation of skeletonization.
Security Enhancement for the "Simple Authentication Key Agreement Algorithm"
Authors: Iuon-Chang Lin, Chin-Chen Chang, Min-Shiang Hwang
Venue: 24th International Computer Software and Applications Conference (2000)

The weaknesses of the simple authenticated key agreement (SAKA) protocol were shown by Sun. The weaknesses include (1) it cannot detect a masquerade, (2) it cannot withstand the dictionary attack, and (3) it cannot provide perfect forward secrecy. In this paper, we will improve the SAKA algorithm to overcome these weaknesses. Besides, we will show that the improved scheme is more simple and secure than the original one.
Designing a Curious Negotiator
Authors: John K. Debenham, Simeon J. Simoff
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In negotiation the exchange of contextual information is as important as the exchange of specific offers. The curious negotiator is a multiagent system with three types of agent. Two negotiation agents, each representing an individual, develop consecutive offers, supported byinformation, whilst requesting information from its opponent. A mediator agent, with experience of prior negotiations, suggests how the negotiation may develop. A failed negotiation is a missed opportunity. An observer agent analyses failures looking for new opportunities. The integration of negotiation theory and data mining enables the curious negotiator to discover and exploit negotiation opportunities. Trials will be conducted in electronic business.
Design and Analysis of Fault-Tolerant Star Networks
Authors: Chungti Liang, Sourav Bhattacharya, Jack Tan
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The star graph has been proposed as an attractive alternative to the hypercube offering a lower degree, a smaller diameter, and a smaller distance for a similar number of nodes. In this paper, we investigate the fault-tolerant design for the Star interconnection networks using modules called fault tolerant building blocks (FTBBs). Each FTBB module contains several primary and few spare nodes. The spare nodes within each FTBB can replace the primary nodes when a failure occurs. If each spare node within an FTBB can replace any primary node we ascribe the situation to it full spare utilization. We propose fault tolerant Star networks constructed from smaller FTBBs with full spare utilization and a fault-tolerant routing scheme to reconfigure the system when a failure occurs.
Mining the Web for Knowledge with Sub-Optimal Mining Algorithm
Authors: Stuart H. Rubin, Marion G. Ceruti, Lydia C. Shen
Venue: 24th International Computer Software and Applications Conference (2000)

The Web provides a forum in which AI systems can be demonstrated and compared. This paper addresses a fuzzy method for context-sensitive textual matching. We are investigating two key approaches. Knowledge on the Web must be retrieved and structured to facilitate mining operations. Case-based filtering allows the algorithm to adapt dynamically to changes in content or efficiency of expression. Our approach is to design sub-optimal mining algorithms that sacrifice completeness for speed, tractability and breadth of coverage. The mined knowledge is fed back to serve as a heuristic filter.
Integer and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh
Authors: Jerry L. Trahan, Chun-ming Lu, Ramachandran Vaidyanathan
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents the following results for matrix-vector multiplication on the reconfigurable mesh (R-Mesh). Multiplication of an N \times N matrix and an N \times 1 vector (each element of which is an integer of w bits) can be performed in O(\log w) time on a two-dimensional O\left(N\frac{w}{\log w}{\log^2 N}\right) \times O\left(N\frac{w}{\log w}{\log^2 N}\right) R-Mesh or a three-dimensional N\times N\times\left(\frac{w}{\log w}\log^2N\right) R-Mesh; in both cases, inputs and outputs are stored as w-bit integers. A natural extension of this problem is for floating point inputs; floating point numbers have not been handled before on any reconfigurable bus-based model. Matrix-vector multiplication with floating point inputs can be performed in O\left(\max\{\log\log N,\log w\}\right) time on an \mbox{N \times N \times \max\left\{\sqrt{\frac{N}{\log\log N}},\frac{w}{\log w} \log^{2} N\right\} } three-dimensional R-Mesh, with the inputs and outputs stored as w-bit floating point numbers.
Games on Graphs and Sequentially Realizable Functionals
Authors: Martin Hyland, Andrea Schalk
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic setting for sequential algorithms. However, we show that with a natural exponential we obtain a model for PCF essentially equivalent to the sequential algorithms model. We briefly consider a more extensional setting and the prospects for a better understanding of the Longley Conjecture.
Program C Editor through Voice Input
Authors: Masahiro Yamamoto
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In the current speaker-independent speech recognition, it is impossible to attain the high recognition ratio for the general purpose applications. However, it is possible to obtain reasonable recognition ratio for specific applications. Programming language has the specific syntaxes and vocabularies specified by the language specification based on this characteristics, C program editor by voice input is implemented.