ppxscal/embedding_network huggingface dataset:
Information retrieval, information structure, and information agents
Authors: Daniela Rus, Devika Subramanian
Venue:  (1996)

This paper presents a customizable architecture for software agents that capture and access information in large, heterogeneous, distributed electronic repositories. The key idea is to exploit underlying structure at various levels of granularity to build high-level indices with task-specific interpretations. Information agents construct such indices and are configured as a network of reusable modules called structure detectors and segmenters. We illustrate our architecture with the design and implementation of smart information filters in two contexts: retrieving stock market data from Internet newsgroups, and retrieving technical reports from Internet ftp sites.
Graphical Fisheye Views
Authors: Manojit Sarkar, Marc H. Brown
Venue:  (1993)

A fisheye camera lens is a very wide angle lens that magnifies nearby objects while shrinking distant objects. It is a valuable tool for seeing both "local detail" and "global context" simultaneously. This paper describes a system for viewing and browsing graphs using a software analog of a fisheye lens. We first show how to implement such a view using solely geometric transformations. We then describe a more general transformation that allows global information about the graph to affect the view. Our general transformation is a fundamental extension to previous research in fisheye views.
Transient handover blocking probabilities in road covering cellular mobile networks
Authors: Richard J. Boucherie, Jan van der Wal
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper investigates handover and fresh call blocking probabilities for subscribers moving along a road in a traffic jam passing through consecutive cells of a wireless network. It is observed and theoretically motivated that the handover blocking probabilities show a sharp peak in the initial part of a traffic jam roughly at the moment when the traffic jam starts covering a new cell. The theoretical motivation relates handover blocking probabilities to blocking probabilities in the M/D/C/C queue with time-varying arrival rates. We provide a numerically efficient recursion for these blocking probabilities.
Constructing Accessible Websites
Authors: Jim Thatcher, Cynthia Waddell
Venue:  (2003)

:Accessibility is about making a website accessible to those with aural, visual or physical disabilities - or rather, constructing websites that don't exclude these people from accessing the content or services being provided.The purpose of this book is to enable web professionals to create and retrofit accessible websites quickly and easily. It includes discussion of the technologies and techniques that are used to access websites, and the legal stipulations and precedents that exist in the US and around the world. The main body of the book is devoted to the business of making websites and their content accessible: testing techniques, web development tools, and advanced techniques. The book concludes with a quick reference checklist for creating accessible websites. This is a practical book with lots of step-by-step examples, supported with a Section 508 checklist enabling developers to refer to the book as they work as well as a complete list of accessibility testing and approval sites. What's great about this book? It will teach you how to make your content accessible to people with disabilities Explains in detail how to test sites for accessibility issues It teaches you how to use a wide range of accessibility tools effectively You'll learn how to make your web site fully section 508 compliant Includes a detailed coverage of accessibility law, and is full of practical examples Includes tutorial on accessible authoring with Flash MX
Multimedia transport in multihop dynamic packet radio networks
Authors: C. R. Lin, M. Gerla
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The paper presents a distributed architecture which relies on code division access scheme for multimedia transport in a wireless mobile radio network without a fixed infrastructure. The proposed multicluster architecture has the capability of rapid deployment and dynamic reconfiguration. Without the need of base stations, this architecture can operate in areas without a wired back-bone infrastructure. The presented architecture has two main advantages. First, this architecture can provide spatial reuse of the bandwidth due to node clustering. Second, computer simulation reveals that our cluster structure is robust in the face of topological changes due to node motion, node failure, and/or new node addition. In all, this architecture provides a stable infrastructure for the integration of different types of traffic in a dynamic radio network
A Systolic Array for the Linear-Time Solution of Toeplitz Systems of Equations
Authors: Richard P. Brent, Franklin T. Luk
Venue:  (1982)

The solution of an (n+1)x(n+1) Toeplitz system of linear equations on a one-dimensional systolic architecture is studied. Our implementation of an algorithm due to Bareiss is shown to require only $O(n)$ time and $O(n)$ storage, i.e. constant storage per systolic processor. Key words and phrases: Systolic arrays, Toeplitz matrices, linear equations, Bareiss algorithm, VLSI.
Usability of Associated GIS and VRML Urban Models
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper appraises the role of Virtual reality modelling language (VRML) based 3D computer based Urban and Heritage models in assisting professional collaboration on common tasks and engaging the participation of the general public in decision making. The University of the West of England (UWE) have created such models of both a significant area of central Bristol and for the Tower of London. The model and associated information can be interactively viewed through low-cost WWW browsers and updated on-line. The model is held to be a useful analogue for linking available information in more accessible form. Use of an underlying Geographic Information System (GIS) allows other information to be readily associated with elements within the models. The costs of creation and ownership of traditional and Digital Models are compared with those of GIS generated models. Developments are discussed to improve and ease collaborative creation and use of such models.
A Conjunctive Canonical Expansion of Multiple-Valued Functions
Authors: Elena Dubrova, Petra Färm
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A generalization of McMillan's conjunctive expansion of Booleanfunctions to the case of multiple-valued input binary-valued output functions ispresented. It is based on the operation of generalized cofactor, defined byemploying a new distance measure on truth assignments, called m-valued weighteddistance. Using our result, Boolean multiple-output functions can be expandeddirectly by treating the output part as a single multiple-valued variable. Suchan approach might allow a better utilization of the common subparts fordifferent outputs compared to the output-by-output Boolean expansion.
QDT (Quickdraw Terminal) Disks
Authors: Mark Sherman
Venue:  (1986)

This disk set consists of one disk containing a running version of QDT over a serial line, one disk containing a running version of QDT over Apple Talk (using KSP), and one disk containing the Lisa Pascal sources for creating QDT (either version).
Estimates of the Total Absolute Error of a Numerical Solution of Volterra Integral Equations of the Second Kind
Authors: Abram Zhuzhunashvili, Viktor Ivanov, Yuri Tvalodze
Venue:  (1997)

A total absolute error of approximate solution of volterra integral equations of the second kind is considered. The error is not greater than the sum of errors of three kinds: inherent error, error because of inaccuracy of numerical algorithms and round-off error. The number of basic operations that are necessary for realization of these methods is estimated.
Formal Methods Applied to Secure Network Engineering
Authors: Shiu-Kai Chin, John Faust, Joseph Giordano
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Security properties such as privacy, authentication, and integrity are of increasing importance to networked systems. Systems with security requirements typically must operate with a high degree of confidence, i.e. they must be highly assured. We show how the message structure of Privacy Enhanced Mail (PEM) and the operations on PEM structures have the desired implementation-independent security properties. The verification of an integrity checking function is shown in detail. Higher-order logic and the HOL theorem-prover are used to precisely relate security properties to implementation specifications.
Classical Proofs as Programs: How, What and Why
Authors: Chetan R. Murthy
Venue:  (1991)

We recapitulate Friedman''s conservative extension result of(suitable) classical over constructive systems for $\Pi_{2}^{0}$sentences, viewing it in two lights: as a translation of programs from an almost-functional language (with $\cal C$) back to its functional core, and as a translation of a constructive logic for a functional language to a classical logic for an almost-functional language. We investigate the computational properties of the translation and of classical proofs and characterize the classical proofs which give constructions in concrete, computational terms, rather than logical terms. We characterize different versions of Friedman''s translation as translating slightly different almost-functional languages to a functional language, thus giving a general method for arriving at a sound reduction semantics for an almost-functional language with a mixture of eager and lazy constructors and destructors, as well as integers, pairs, unions, etc. Finally, we describe how to use classical reasoning in a disciplined manner in giving classical (yet constructivizable) proofs of sentences of greater complexity than $\Pi_{2}^{0}$. This direction offers the possibility of applying classical reasoning to more general programming problems.
Fractal Blackboard Framework
Authors: Michael Naaman, Ayal Zaks
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

A command and control application developed at IET has recently gone a major architectural change, to use a blackboard framework. As opposed to many blackboard-based applications, in which the blackboard model is used to model only the top level of the application, we developed a blackboard framework that is fractal-like: the blackboard paradigm serves as the abstraction for all levels, recursively. We have also achieved maximal separation among the different blackboard-based elements at the various levels. This implies having small disconnected components which are flexible and reusable, and which together form the application. In this paper we present our fractal blackboard framework, and discuss interesting issues related to its design and usage.
Optimal aggregation algorithms for middleware
Authors: Ronald Fagin, Amnon Lotem, Moni Naor
Venue: Journal of Computer and System Sciences (2003)

Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). Each object is assigned an overall grade, that is obtained by combining the attribute grades using a fixed monotone aggregation function, or combining rule, such as min or average. To determine the top k objects, that is, k objects with the highest overall grades, the naive algorithm must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm ("Fagin's Algorithm", or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably simple algorithm ("the threshold algorithm", or TA) that is optimal in a much stronger sense than FA. We show that TA is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability worst-case sense, but over every database. Unlike FA, which requires large buffers (whose size may grow unboundedly as the database size grows), TA requires only a small, constant-size buffer. TA allows early stopping, which yields, in a precise sense, an approximate version of the top k answers. We distinguish two types of access: sorted access (where the middleware system obtains the grade of an object in some sorted list by proceeding through the list sequentially from the top), and random access (where the middleware system requests the grade of object in a list, and obtains it in one step). We consider the scenarios where random access is either impossible, or expensive relative to sorted access, and provide algorithms that are essentially optimal for these cases as well.
A Scalable Video Rate Camera Interface
Authors: Jon A. Webb, Thomas Warfel, Sing B Kang
Venue:  (1994)

We survey the state of the art in high-speed interfaces for video input to high performance computers and note the difficulty of providing video at rates appropriate to modern parallel computers. Most interfaces that have been developed to date are not scalable, required extensive hardware development, and impose a full frame time delay between the moment the camera captures video and the moment it is available for processing. We propose a solution, based on a simple interface we have developed, which has been integrated into the iWarp parallel computer developed by Carnegie Mellon University and Intel Corporation. The interface takes advantage of iWarp''s systolic capabilities, does not impose any frame buffer delay time, was simple to design, and is readily scalable to provide up to 32 camera ports, from all of which data can be captured at full video rate, on a system that fits in a 19" 6U rack. We have applied the system to multibaseline stereo vision, and provide performance figures.
Multigrain Parallel Processing for JPEG Encoding on a Single Chip Multiprocessor
Authors: Takeshi Kodaka, Keiji Kimura, Hironori Kasahara
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

With the recent increase of multimedia contents using JPEG and MPEG, low cost, low power consumption and high performance processors for multimedia application have been expected. Particularly, single chip multiprocessor architecture having simple processor cores that will attain good scalability and cost effectiveness is attracting much attention. To exploit full performance of single chip multiprocessor architecture, multigrain parallel processing, which exploits coarse grain task parallelism, loop parallelism and instruction level parallelism, is attractive. This paper describes a multigrain parallel processing scheme for the JPEG encoding on a single chip multiprocessor and its performance. The evaluation shows an OSCAR type single chip multiprocessor having four single-issue simple processor cores gave us 3.59 times speed-up against sequential execution time.
A Pre-Simulation Measure of D.C. Design-for-Testability Fault Diagnosis Quality
Authors: Matthew Worsman, Mike W. T. Wong, Y. S. Lee
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Equivalent faults inhibit fault diagnosis by producing indistinguishable test metric measurements. Removal of conditions causing the equivalence in response exhibited by such faults is necessary if fault diagnosis quality is to be improved. As Design-for-Testability methodology aims to deliver a degree of fault diagnosis substantially greater than that obtainable testing unassisted by on-chip test specific hardware, designing a Design-for-Testability scheme with minimal fault equivalence is an issue to be addressed. Presented is a set of simple and inexpensive tests, applied pre-simulation, for identifying catastrophic resistive component faults that cause numerically equivalent D.C. test node responses. Using a biquadratic notch filter modified with a novel Design-for-Testability scheme, we demonstrate that equivalent fault information is a useful initial measure for assessing the potential increase in fault diagnosis quality obtainable with a Design-for-Testability scheme.
Self-Organization and Information Effect in Financial Market
Authors: Hiwon Yoon, Takahiko Tanahashi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper proposes Self-organization model for Bid-Ask spread transition in market.Inmarket microstructure theory, Bid-Ask spread has been explained as the result from overallmarket players¿ intention.We focus on Bid-Ask spread transition after market opening andtoward to closing, and interpret it caused by information effect.Our approach is based onmodeling methodology for viscoelastic material, that can consider memory effect byinformation for market system. Under the modeling process, we suggest 2 parameters thatrelated to sensitivity effect and relaxation time effect of information into market.Lastly weshow the model explain Bid-Ask spread transition in Japanese equity market empirically.
Impact of Lexicon Completeness on City Name Recognition
Authors: M. Shridhar, F. Kimura, Bart Truijen, Gilles F. Houle
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Significant progress has been achieved in recognition of handwritten words during the past five years. Cursive recognition is currently used in real-Iive systems for applications such as check, giro, generic form, and address processing. Common to these applications is the use of lexicon. This paper addresses the issues of lexicon completeness and its impact on accuracy (rejection and error rates). It has been documented in several address recognition studies thatrecognition accuracy falls off as the size of the lexicon increases. However, the error-rejection performance of word recognition, when the available lexicon is only partially complete has not been thoroughly analyzed.
On-line Admission Control and Job Scheduling with Preemption
Authors: Garay Juan, Naor Joseph, Yener B\"ulent, Zhao Peng
Venue:  (2001)

This paper studies the effect of preemption on the throughput of a single ``communication channel'''' where requests arrive with a given processing time and slack. The problem is to decide which requests to serve so as to maximize the channel''s utilization. This simple model captures many situations, both at the application (e.g., delivery of video) as well as at the network/transmission levels (e.g., scheduling of jobs at a switch). The problem is on-line in nature, and thus we use competitive analysis for measuring the performance of our scheduling algorithms. We consider two modes of operation: with and without commitment, and derive upper and lower bounds for each case. Since the competitive analysis is based on the worst-case scenario, the average-case performance of the on-line algorithms are examined by a simulation study.
Correctness Proofs of APAL Programs
Authors: Jan F. Prins
Venue:  (1986)

Here is a short sketch of issues involved in the construction of correctness proofs for Array Processor machine language (APAL) programs, and an example of such a correctness proof. We are interested in the feasibility of applying formal methods to determine that a given section of APAL code correctly implements a construct that is part of some high-level programming notation like GIBBS. This investigation is based on implementation correctness criteria given in [2], using a predicate transformer characterization of programming language semantics. The approach accommodates separate semantics for the highand low-level programming notations, but, to be effective, requires that their denotations overlap. For now, the issue of partial implementations, which are correct only on some restricted domain of operation, is ignored. Ultimately these are the more interesting and efficient implementations, but the extension is independent of the program examined here. The principal technical difficulty will be the annotation and verification of the APAL code, since it is not a standard structured programming language. The presence of unrestricted jumps and branches makes the composition of the correctness proof more difficult: it is not a simple function of the parts. Furthermore, the machine carries out a number of simultaneous operations that present no problem in themselves, but require careful modeling to capture their mutual effect on the machine state. 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
Media-Independent Watermarking Classification and the Need for Combining Digital Video and Audio Watermarking for Media Authentication
Authors: Jana Dittmann, Anirban Mukherjee, Martin Steinebach
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In the past five years, watermarking has become a major topic to solve authentication problems and copyright protection as major security demands in digital marketplaces. A wide variety of watermarking techniques has been proposed in the literature. Most techniques are developed for still images; currently the research community enforces also approaches for other multimedia data like video, audio and 3D models.In our paper, we summarize the main watermarking parameters and introduce a media independent classification scheme. Our classification scheme is based on the application areas. We show the important parameters and possible attacks. Based on our proposed classification the quality of the watermarking techniques can be evaluated. Furthermore, we address the need for combining digital video and audio watermarking for media authentication.
WearTrack: A Self-Referenced Head and Hand Tracker for Wearable Computers and Portable VR
Authors: Eric Foxlin, Michael Harrington
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper presents a new tracking technique which is essentially ¿sourceless¿ in that it can be used anywhere with no set-up, yet it enables a much wider range of virtual environment-style navigation and interaction techniques than does a simple head-orientation tracker. The new system is based on the very simple idea of combining a sourceless head orientation tracker with a head-worn tracking device that tracks a hand-mounted 3D beacon relative to the head. Because the seen graphical representation of the pointer accurately matches the felt hand position despite any errors in the orientation tracker, the system encourages use of intuitive interaction techniques, which exploit proprioception. We describe a prototype of the tracking system, and discuss and demonstrate its application in a portable VR system and in a wearable computer user interface.