ppxscal/embedding_network huggingface dataset:
Forests and Pyramids: Using Image Hierarchies to Understand Landsat Images
Authors: Ezio Catanzariti, Alan K. Mackworth
Venue:  (1978)

Computer-based Landsat image interpretation has neglected the spatial organization of the image in favour of the spectral and temporal organization. A brief survey of techniques that exploit spatial information, including multistage sampling, is given. Semantically-guided region-merging methods have been used successfully but they require sophisticated and expensive list processing facilities. Similar semantic and spatial sensitivity can be introduced by exploiting a pyramidal, hierarchical representation of the image advocated by Kelly, Tanimoto and Levine. The image pyramid is constructed bottom-up with the original image as the base. Each level is a reduced resolution version of the level below, constructed by averaging the signatures of adjacent pixels at the lower level. By classifying pixels at the higher levels one is efficiently classifying semantically uniform regions in the original image. If, however, a region''s signature lies in the spectral overlap of two or more classes its subregions will have to be considered for classification. Several refinements of this technique, including the use of semantically-based region splitting and merging techniques at each level of the pyramid, are described. .br These techniques are used to classify forest cover types on Vancouver Island in a Landsat image. The results of several initial experiments indicate that, compared to a baseline of a traditional supervised maximum-likelihood classifier, the cost of maintaining the pyramid is balanced by the vast reduction in the number of pixel classifications. The spatial homogeneity or readability of the segmented image, as measured by the number of regions, is improved by a factor of three while the accuracy of the classification is unaffected or slightly improved. When the region splitting and merging techniques are applied at each level of the imaqe pyramid the accuracy and the readability of the final segmentation both increase markedly. It is thereby demonstrated that these pyramidal techniques offer many of the advantages of the semantically-driven region-merging approach in a more flexible and efficient fashion. Indeed the two approaches have been combined to achieve substantial benefits for Landsat image interpretation.
Adding Value to the Software Development Process: A Study in Independent Verification and Validation
Authors: Arthur James D., Groener Markus K., Hayhurst Kelly J., Holloway C. Michael
Venue:  (1998)

Independent Verification and Validation (IV&V) is best viewed as an overlay process supporting a software development effort. While the touted benefits of a properly managed IV&V activity are many, they specifically emphasize: (a) early fault detection, (b) reduced time to remove faults, and (c) a more robust end-product. This paper outlines a study funded by NASA-Langley Research Center to examine an existing IV&V methodology, and to confirm (or refute) the touted beneficial claims. In the study two distinct development groups are established, with only one having an IV&V contingent. Both groups are tasked to produce a software product using the same set of requirements. Within each phase of the development effort, fault detection and fault removal data are recorded. An analysis of that data reveals that the group having the IV&V contingent: (a) detected errors earlier in the software development process, and (b) on the average, required significantly less time to remove those faults. Moreover, a test for operational correctness further reveals that the system developed by the group having the IV&V component was substantially more robust than the one produced by the other development group. A statistical analysis of our results is also provided to establish significance.
REINAS: REAL-TIME ENVIRONMENTAL INFORMATION NETWORK AND ANALYSIS SYSTEM: PHASE III - SYSTEMS DESIGN
Authors: P. E. Mantey, D. D.E. Long, J. J. Garcia-Luna, A. T. Pang, H. G. Kolsky, B. R. Gritton, W. A. Nuss
Venue:  (1994)

REINAS is a continuing engineering research and development program with the goal of designing, developing and testing an operational prototype system for data acquisition, data management, and visualization. This system is to support the real-time utilization of advanced instrumentation in environmental science. Advances in continuous time measurements and improved spatial resolution allow the monitoring and understanding environmental phenomena in much greater detail than has previously been possible. The system is also designed to support the retrospective use of integrated environmental data sets. The project is a multi-year effort of the Baskin Center for Computer Engineering and Information Sciences of the University of California, Santa Cruz, in cooperation with environmental scientists from the Naval Postgraduate School (NPS), Monterey Bay Aquarium Research Institute (MBARI), and the Center for Ocean Analysis and Prediction (NOAA/COAP). This report documents the Third Phase of REINAS and describes the actual System Design of the project as it is being implemented. During the last half of 1993 the detailed requirements of the proposed users for the system were sharpened, selections of the technologies being used in the prototype system were made, and detailed architectures of REINAS and its subsystems for data collection, data management, processing, and visualization were worked out. The evaluations of the key components of the system is also a continuing task. Several new instruments and potential users not included in Phase II were studied. The objective of this document is to provide project participants and reviewers with the System Design of REINAS as it enters the prototype implementation phase. It spells out the technologies to be applied, and the plans for implementing the project goals. The REINAS system has been designed for regional real-time environmental monitoring and analysis. REINAS is a modern system, compatible with the Internet, for conducting interactive real-time coastal air/ocean science. The database design of REINAS is independent of specific database technology and is designed to support operational scientific needs throughput the entire scientific data life-cycle.
Min Cuts Without Path Packing
Authors: Paul A. Tucker, T. C. Hu, M. T. Shing
Venue:  (1999)

This report presents research into a fundamentally new approach to finding all pairwise minimum cuts in a network that can utilize optimality conditions other than those characterized by Mengers theorem or the max-flow min-cut theorem. The focus is on vertex degree domination, rather than construction of saturating paths. We have not been able to show a polynomial-time, deterministic algorithm of this kind, but the investigation has yielded many new insights into the structure of minimum cuts in a network and heuristics for discovering them.
Importance Ordering for Real-Time Depth of Field
Authors: Paul Fearing
Venue:  (1996)

Depth of field (DOF) is an important component of real photography. As such, it is a valuable addition to the library of techniques used in photorealistic rendering. Several methods have been proposed for implementing DOF effects. Unfortunately, all existing methods require a great deal of computation. This prohibitive cost has precluded DOF effects from being used with any great regularity. This paper introduces a new way of computing DOF that is particularly effective for sequences of related frames (animations). It computes the most noticeable DOF effects first, and works on areas of lesser importance only if there is enough time. Areas that do not change between frames are not computed. All pixels in the image are assigned an importance value. This importance gives priority to pixels that have recently changed in color, depth, or degree of focus. Changes originate from object and light animation, or from variation in the camera''s position or focus. Image pixels are then recomputed in order of importance. At any point, the computation can be interrupted and the results displayed. Varying the interruption point allows a smooth tradeoff between image accuracy and result speed. If enough time is provided, the algorithm generates the exact solution. Practically, this algorithm avoids the continual recomputing of large numbers of unchanging pixels. This can provide order-of-magnitude speedups in many common animation situations. This increase in speed brings DOF effects into the realm of real-time graphics. 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
Procedure for Evaluating Human-Computer Interface Development Tools
Authors: Deborah Hix
Venue:  (1990)

Human-computer interface development tools are interactive systems that support production and execution of the human-computer interface. With their recent proliferation, evaluations and comparisons are constantly done, but without a formal, structured approach. Addressing these problems is difficult, largely because of the relative newness of such tools, because of the many different kinds of systems that are called UIMS, and because of their inherent complexity. These tools are complex because human-computer interfaces, which produce tools, are complex.
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia
Venue: Conference on Hypertext and Hypermedia (2003)

Welcome to Nottingham and to Hypertext'03, the 14th Annual Hypertext & Hypermedia Conference! We are delighted to welcome you to this premier international conference. Nottingham is an ancient city, close to the centre of England. It is probably best-known for its association with the legendary Robin Hood, but there is more to Nottingham than 13th century legends. It was home to both Lord Byron and D.H. Lawrence, and you can still visit the stately home of Byron and the tiny miner's cottage where Lawrence grew up. Nottingham is also where the industrial revolution started - the first steam-powered mills were built here in the 18th century, and this has left the town with a rich legacy of early industrial architecture.Some of our social events have a historical theme. We will be arranging a historic ghost walk, and visits to ancient pubs - including "Ye Olde Trip To Jerusalem", that claims to be over 800 years old and is built in caves under the ruins of Nottingham castle. There is a local story that crusaders used to stop here for an ale on their way to the holy lands. The conference also has a civic reception that is hosted by the current-day Sheriff of Nottingham (who, thankfully, rarely wields a sword!).As with all conferences, we have many people who have generously given us their time and effort to make this conference a reality. Most importantly, our two program chairs, Lynda Hardman and Les Carr, have worked immensely hard to produce the all-important program of academic presentations. They headed up an impressive and diverse team of experienced hypertext researchers who all helped bring you the excellent program in this volume of proceedings.
Agency and Autonomy: A Formal Framework
Authors: Michael Luck, Mark d''Inverno
Venue:  (1995)

With the recent rapid growth of interest in Multi-Agent Systems, both in artificial intelligence and software engineering has come an associated difficulty concerning basic terms and concepts. In particular, the terms agency and autonomy are used with increasing frequency to denote different notions with different connotations. In this paper we lay the foundations for a principled theory of agency and autonomy, and specify the relationship between them. Using the Z specification language, we describe a three-tiered hierarchy comprising objects, agents and autonomous agents where agents are viewed as objects with goals, and autonomous agents are agents with motivations.
Parallel Program Analysis on Workstation Clusters: Speedup profiling and Latency Hiding
Authors: Roberto Togneri
Venue:  (1996)

Parallel programming on workstation clusters is subject to many factors and problems which determine the potential success or failure of any individual implementation. The most obvious problems are the difficulty in developing parallel algorithms and the high communication latency which may render such algorithms inefficient. In an attempt to address some of these issues we propose a strategy for estimating the potential speedup of parallel program based on computation and communication profiling. We show that our proposed strategy yields accurate estimates of the speedup. We also propose a complete communication model so that the speedup can be estimated under different programming inputs and show that moderately accurate estimates can be obtained. High communication latency is the major problem with workstation cluster computing. We attempt to examine this problem from the system level point of view and experimentally show that latency hiding can allow almost full utilisation of the CPU resource even though individual programs may suffer from high communication latencies. Availability: Restricted, until further notice. Please consult techreps/tr95-02.ps.gz for equivalent work or contact author for preprints.
Automatic Generation of Interactive Applications
Authors: Emanuel G. Noik
Venue:  (1990)

As user interfaces become more powerful and easier to use, they are often harder to design and implement. This has created a great demand for tools which help programmers create interactive applications. While existing interface tools simplify interface creation, they typically focus only on the interface, do not provide facilities for simplifying application generation, and are too low-level. We have developed a tool which automatically generates complete interactive applications from a high-level description of the application''s semantics. We argue that our system provides a very simple yet powerful environment for application development. Key advantages include: ease of use, separation of interface and application, interface and machine independence, more comprehensive programming aids, and greater potential for software reusability. While we tend to focus on the practical motivations for using such a tool, we conclude that this approach should form the basis of an important category of interface tools and deserves further study.
PROXIMITY CONTENT-ADDRESSABLE MEMORY:AN EFFICIENT EXTENSION TO k-NEAREST NEIGHBORS SEARCH (M.S. Thesis)
Authors: James D Roberts
Venue:  (1990)

This thesis presents the development of *proximity content addressable memory (PCAM)*, an extension to nearest neighbors search for high dimensional parameter spaces with variable weighting. In PCAM, the parameter space is mapped to Boolean space by a family of matching and magnitude comparison functions. A weighted distance is computed. Three methods were developed, the first two being software algorithms for conventional processors, and the third a hardware implementation. The first algorithm preprocesses the query into a look-up table, whereas the second preprocesses the data points into an inverted index. The latter is preferable when indexing is sparse or the queries contain few attributes. The hardware implementation represents several extensions to prior *content addressable memory (CAM)* systems and uses a modified tree architecture. A survey was unable to identify any software algorithms asymptotically better than exhaustive search for high-dimensional spaces with variable distance weighting. All the PCAM implementations have time and space linear in the number of data points and dimension of the parameter space, excluding read out. The PCAM algorithms equal the performance of the best k-nearest neighbors algorithms surveyed. For an example database, a 10 to 100 times speed up over linear search is achieved. A hardware system with fewer than 100 processing elements is projected to provide one to two orders of magnitude acceleration for personal computers and workstations. Systems with thousands of processing elements appear feasible. If one hardware processing element is available for each data point, time O(1) and space O(N) can be achieved, excluding read out time. A CMOS VLSI chip containing 8 processing elements and the associated response resolver network has recently been completed. Applications where PCAM may provide constant factor or asymptotically better space-time performance include information retrieval based on similarity, computer aided VLSI and circuit board design, and pattern matching and classfication in the presence of noisy, erroneous, or incomplete data. Efficient recall based on content and similarity may also prove important in the development of intelligent systems. 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
Creation of a Prolog Fact Base from the Collins English Dictionary
Authors: Robert C. Wohlwend, Edward A. Fox
Venue:  (1988)

Machine readable dictionaries may be invaluable components of future in-formation retrieval systems. The Virginia Tech department of Computer Science is fortunate to have available for research purposes machine readable versions of the Collins English Dictionary (CED) [HANK 79] and of the Oxford Advanced Learners Dictionary of Current English (OALDCE) [HORN 74] among others. McIllroy [MCIL 84] and Mitton [MIlT 85] have put forth separate efforts in cleaning up the OALDCE. The CED is only available in its original typesetting form, and it required a great deal of effort and patience to transform this into a relational lexicon. A number of recent efforts have been made to generate relational lexicons from dictionaries (e.g., [AHLS 81], [AHLS 83], [AHLS 85], [WHIT 83], [EVEN 78] ). The lexicon that will be discussed in this paper consists of a large set of relations in the form of PROLOG facts. This knowledge base will become a very important entity in the analysis and retrieval sub-systems of the CODER project [FOXE 86].
Informatik-Controlling - Stand der Forschung
Authors: Madeleine Suter
Venue:  (1995)

Bestandesaufnahme der aktuellen Forschung zum Informatik-Controlling. Informatik-Controlling wird definiert als Sammelbegriff fuer Controlling- Aktivitaeten im Bereich des Informationsmanagements. Das Ziel des Informatik-Controllings ist die Sicherstellung von Effektivitaet und Effizienz der betrieblichen Informationsverarbeitung. 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
Analysis of Binary Adjustment Algorithms in Fair Heterogeneous Networks
Authors: Sergey Gorinsky, Harrick Vin
Venue:  (2001)

Many congestion control schemes rely on binary notifications of congestion from the network: on detecting network congestion, they reduce transmission rates; and on receiving a signal indicating no congestion, they increase transmission rates. For conventional networks with First-In First-Out (FIFO) scheduling of packets, the effectiveness of such algorithms has been evaluated with respect to their responsiveness, smoothness, and fairness properties. Recently, it has been argued that it is possible to design high-speed network routers that can guarantee fair allocation of link capacities and buffers. In networks that employ such routers, fairness is ensured by the routers, thereby making responsiveness and smoothness the two main criteria for evaluating and selecting a binary adjustment algorithm. In this paper, we consider binary adjustment algorithms with four increase policies proposed in the literature: multiplicative increase (MI), additive increase (AI), inverse-square-root increase (ISI), and inverse increase (II). We analyze these algorithms in fair heterogeneous networks. We find that the multiplicative increase policy, which is considered inappropriate for conventional networks due to its fairness property, provides superior performance over the other policies in fair networks.
A system for data change propagation in heterogeneous information systems
Authors: Carmen Constantinescu, Uwe Heinkel, Ralf Rantzau, Bernhard Mitschang
Venue: Enterprise information systems IV (2003)

Today, it is common that enterprises manage several mostly heterogeneous information systems to supply their production and business processes with data. There is a need to exchange data between the information systems while preserving system autonomy. Hence, an integration approach that relies on a single global enterprise data schema is ruled out. This is also due to the widespread usage of legacy systems. We propose a system, called Propagation Manager, which manages dependencies between data objects stored in different information systems. A script specifying complex data transformations and other sophisticated activities, like the execution of external programs, is associated with each dependency. For example, an object update in a source system can trigger data transformations of the given source data for each destination system that depends on the object. Our system is implemented using current XML technologies. We present the architecture and processing model of our system and demonstrate the benefit of our approach by illustrating an extensive example scenario.
Seeing Things
Authors: R. G. Wilson, H. Knutsson
Venue:  (1994)

This paper is concerned with the problem of attaching meaningful symbols to aspects of the visible environment in machine and biological vision. It begins with a review of some of the arguments commonly used to support either the ''symbolic'' or the ''behaviourist'' approach to vision. Having explored these avenues without arriving at a satisfactory conclusion, we then present a novel argument, which starts from the question : given a functional description of a vision system, when could it be said to support a symbolic interpretation? We argue that to attach symbols to a system, its behaviour must exhibit certain well defined regularities in its response to its visual input and these are best described in terms of invariance and equivariance to transformations which act in the world and induce corresponding changes of the vision system state. This approach is illustrated with a brief exploration of the problem of identifying and acquiring visual representations having these symmetry properties, which also highlights the advantages of using an ''active'' model of vision.
J-Inner Matrix Functions, Interpolation and Inverse Problems for Canonical Systems, III: More on th Inverse Monodromy Problem
Authors: D. Z. Arov, H. Dym
Venue:  (1999)

This paper is a continuation of our study of the inverse monodromy problem for canonical systems of integral and differential equations which appeared in a recent issue of this journal. That paper established a parametrization of the set of all solutions to the inverse monodromy for canonical integral systems in terms of two continuous chains of matrix valued inner functions in the special case that the monodromy matrix was strongly regular (and the signature matrix J was not definite). The correspondence between the chains and the solutions of this monodromy problem is one to one and onto. In this paper we study the solutions of this inverse problem for several different classes of chains which are specified by imposing assorted growth conditions and symmetries on the monodromy matrix and/or the matrizant (i.e., the fundamental solution) of the underlying equation. These external conditions serve to either fix or limit the class of admissible chains without computing them explicitly. This is useful because typically the chains are not easily accessible.