ppxscal/embedding_network huggingface dataset:
Integrating Virtual and Augmented Realities in an Outdoor Application
Authors: Wayne Piekarski, Bernard Gunther, Bruce Thomas
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

This paper explores interconnecting outdoor AR systems with a VR system to achieve collaboration in both domains simultaneously. We envisage multiple mobile users of wearable AR systems interacting with a stationary VR facility via a wireless network. An application in simulated combat training is described, where the AR users are soldiers with wearable computers, and the VR system is located at a command and control centre. For soldiers, AR provides enhanced information about the battlefield environment, which may include the positions and attributes of simulated entities for the purpose of training outdoors at low cost. At the same time a complete picture of the battlefield, including real and simulated troops and vehicles, is available via the VR system. As soldiers move about, their GPS and digital compass hardware provide the remote VR user and other AR users with the means totrack their position in real-time. We describe a working system based on our modular Tinmith-II wearable computer, which interacts with a combat simulator to create a synthetic battle environment for safe training and monitoring.
Qualitative reasoning. Proceedings of the 11th International Workshop on Qualitative Reasoning
Authors: Liliana Ironi
Venue:  (1997)

This volume contains the proceedings of the Eleventh International Workshop on Qualitative Reasoning about Physical Systems, held at Cortona, June 3-6, 1997. It collects papers dealing with both new methods to supplement conventional modeling of incompletely specified system and their potential application to real-world problem. EMAIL:: ian@microian.ian.pv.cnr.it
Using BPNNs in selecting a suitable type of foundation
Authors: H. K. Amin, K. M. El Zahaby, M. A. Taha, A. S. Bazaraa
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

In this paper, ANNs are used as tools to find a suitable foundation type among isolated, strip, raft or piled foundations, for a given site with known characteristics.The "Brainmaker", a commercially available neural network simulator, has been used in the training of a supervised BPNN model. The training is accomplished using 114 projects.A comparative study has been accomplished to test the effect of the learning rates and the number of neurons on the number of misclassified projects.A BPNN is thus built and is available for subsequent use by geotechnical engineers to select a suitable foundation type. Moreover, any additional data will help enhance this built network.
Efficient solution of symmetric eigenvalue problems using multigridpreconditioners in the locally optimal block conjugate gradient method
Authors: A. Knyazev, K. Neymeyr
Venue:  (2001)

We present a short survey of multigrid--based solvers for symmetric eigenvalue problems. We concentrate our attention on ``of the shelf'''' and ``black box'''' methods, which should allow solving eigenvalue problems with minimal, or no, effort on the part of the developer, taking advantage of already existing algorithms and software. We consider a class of such methods, where the multigrid only appears as a black-box tool of constructing the preconditioner of the stiffness matrix, and the base iterative algorithm is one of well-known of-the-shelf preconditioned gradient methods such as the locally optimal block preconditioned conjugate gradient method. We review some known theoretical results for preconditioned gradient methods that guarantee the optimal, with respect to the grid size, convergence speed. Finally, we present results of numerical tests, which demonstrate practical effectiveness of our approach for the locally optimal block conjugate gradient method preconditioned by the standard V-cycle multigrid applied to the stiffness matrix.
Multimedia authoring, development environments, and digital video editing.
Authors: Fillia Makedon, James Matthews, Charles B. Owen, Samuel A. Rebelsky
Venue:  (2001)

Multimedia systems integrate text, audio, video, graphics, and other media and allow them to be utilized in a combined and interactive manner. Using this exciting and rapidly developing technology, multimedia applications can provide extensive benefits in a variety of arenas, including research, education, medicine, and commerce. While there are many commercial multimedia development packages, the easy and fast creation of a useful, full-featured multimedia document is not yet a straightforward task. This paper addresses issues in the development of multimedia documents, ranging from user-interface tools that manipulate multimedia documents to multimedia communication technologies such as compression, digital video editing and information retrieval. It outlines the basic steps in the multimedia authoring process and some of the requirements that need to be met by multimedia development environments. It also presents the role of video, an essential component of multimedia systems and the role of programming in digital video editing. A model is described for remote access of distributed video. The paper concludes with a discussion of future research directions and new uses of multimedia documents.
The impact of address allocation and routing on the structure and implementation of routing tables
Authors: Harsha Narayan, Ramesh Govindan, George Varghese
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

The recent growth in the size of the routing table has led to an interest in quantitatively understanding both the causes (eg multihoming) as well as the effects (eg impact on router lookup implementations) of such routing table growth. In this paper, we describe a new model called ARAM that defines the structure of routing tables of any given size. Unlike simpler empirical models that work backwards from effects (eg current prefix length distributions), ARAM approximately models the causes of table growth (allocation by registries, assignment by ISPs, multihoming and load balancing). We show that ARAM models with high fidelity three abstract measures (prefix distribution, prefix depth, and number of nodes in the tree) of the shape of the prefix tree --- as validated against 20 snapshots of backbone routing tables from 1997 to the present. We then use ARAM for evaluating the scalability of IP lookup schemes, and studying the effects of multihoming and load balancing on their scaling behavior. Our results indicate that algorithmic solutions based on multibit tries will provide more prefixes per chip than TCAMs (as table sizes scale toward a million) unless TCAMs can be engineered to use 8 transistors per cell. By contrast, many of today's SRAM-based TCAMs use 14-16 transistors per cell.
Prefiguring Cyberculture: An Intellectual History
Authors: Darren Tofts, Alessio Cavallaro
Venue:  (2003)

:The vast social apparatus of the computer network has aligned people with technology in unprecedented ways. The intimacy of the human-computer interface has made it impossible to distinguish technology from the social and cultural business of being human. Cyberculture is the broader name given to this process of becoming through technological means. This book shows that cyberculture has been a long time coming.In Prefiguring Cyberculture, media critics and theorists, philosophers, and historians of science explore the antecedents of such aspects of contemporary technological culture as the Internet, the World Wide Web, artificial intelligence, genetic engineering, virtual reality, and the cyborg. The contributors examine key texts that anticipate cybercultural practice and theory, including Plato's "Simile of the Cave"; the Renaissance Ars Memoria; Descartes's Meditations (on the mind-body split); Mary Shelley's Frankenstein; Alan Turing's Computing Machinery and Intelligence; Philip K. Dick's Man, Android, and Machine; William Gibson's Neuromancer; and Arthur C. Clarke's Profiles of the Future. In the final section, a number of cyberculture artists explore how cybercultural themes have been taken up and critiqued in the electronic arts.This book is not for sale in Australia and New Zealand
Coloring with Defects
Authors: Lenore Cowen, Esther Jesurum
Venue:  (1995)

This paper is concerned with algorithms and complexity results for defective coloring, where a defective (k,d)-coloring is a k coloring of the vertices of a graph such that each vertex is adjacent to at most d-self-colored neighbors. First, (2,d) coloring is shown NP-complete for d <= 1, even for planar graphs, and (3,1) coloring is also shown NP-complete for planar graphs (while there exists a quadratic algorithm to (3,2)-color any planar graph). A reduction from ordinary vertex coloring then shows (X,d) coloring NP-complete for any X <= 3, d <= 0, as well as hardness of approximation results. Second, a generalization of Delta + 1 coloring defects is explored for graphs of maximum degree Delta. Based on a theorem of Lovasz, we obtain an O(Delta E) algorithm to (k, \1floor (Delta/k \rfloor) color any graph; this yields an O(E) algorithm to (2,1)-color 3-regular graphs, and (3,2)-color 6-regular graphs. The generalization of Delta + 1 coloring is used in turn to generalize the polynomial-time approximate 3- and k-coloring algorithms of Widgerson and Karger-Motwani-Sudan to allow defects. For approximate 3-coloring, we obtain an O(Delta E) time algorithm to $(\lceil({8n \over d})^{.5}\rceil,d)$ color, and a polynomial time algorithm to $(O((\frac{n} {d})^{.387}), d)$ color any 3-colorable graph.
Assessment of True Worst Case Circuit Performance Under Interconnect Parameter Variations
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The complicated manufacturing processes dictate that process variations are unavoidable in today's VLSI products. Unlike device variations, which can be captured by worst/best case corner points, the effects of interconnect variations are context-dependent, which makes it difficult to capture the true worst-case timing performance. This paper discusses an efficient method to explore the extreme values of performance metrics and the specific parameters that will create these extreme performances. The described approach is based on a iterative search technique which facilitates its proper search direction by calculating an explicit analytical approximation model.
Deploying an agent-based architecture for the management of community care
Authors: Martin D. Beer, Richard Hill, Andrew Sixsmith
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes a project designed to show how a global multi-agent architecture can be used to support care in the community. Services in this area are notoriously difficult to coordinate with the direct and indirect involvement of a large number of independent, autonomous agencies, each of which has its own priorities and aspirations. Also, by the very nature of the services provided the caring community is highly mobile and distributed making the collection and dissemination of information extremely difficult. The Integrated Community Care (INCA) project has been designed to show how multi-agent technology can be used to address some of these issues.
Analyzing the Effectiveness of Extended Boolean Models in Information Retrieval
Authors: Joon H Lee
Venue:  (1995)

Many extended Boolean models such as fuzzy set, $p$-norm, et al. have been proposed in the information retrieval literature to support ranking facility for the Boolean retrieval system. They can be explained within the same framework, and each extended Boolean model is characterized by evaluation formulas for AND and OR operations. A variety of operators have been also developed in the area of fuzzy set theory for AND and OR operations, and can be used in extended Boolean models. In this paper we analyze the behavioral aspects of various operators for AND and OR operations, and address important properties in terms of retrieval effectiveness. Our analyses show that the four properties, namely single operand dependency, negative compensation, double operand dependency and unequal importance decrease retrieval effectiveness in some circumstances. This suggests that the two properties, namely positive compensation and equal importance might help retrieval effectiveness. We also provide the experimental results that coincide with our analyses.
Existence Theorems for Scheduling to Meet Two Objectives
Authors: April M. Rasala
Venue:  (1999)

We will look at the existence of schedules which are simultaneously near-optimal for two criteria. First, we will present some techniques for proving existence theorems, in a very general setting, for bicriterion scheduling problems. We will then use these techniques to prove existence theorems for a large class of problems. We will consider the relationship between objective functions based on completion time, flow time, lateness and the number of on-time jobs. We will also present negative results first for the problem of simultaneously minimizing the maximum flow time and average weighted flow time and second for minimizing the maximum flow time and simultaneously maximizing the number of on-time jobs. In some cases we will also present lower bounds and algorithms that approach our bicriterion existence theorems. Finally we will improve upon our general existence results in one more specific environment.
Managing Open Source Projects: A Wiley Tech Brief
Authors: Jan Sandred
Venue:  (2002)

:The only guide to managing and integrating the open source modelWith the phenomenal success of Linux, companies are taking open source business solutions much more seriously than ever before. This book helps to satisfy the growing demand for guidance on how to manage open source enterprise development projects. Expert Jan Sandred explores the open source philosophy, describes current software tools for managing open source projects, and provides expert guidance on how to organize and manage open source projects using the Internet as a collaboration tool. With the help of several fascinating and instructive case studies, Sandred explores practical concerns such as building, motivating, and managing virtual teams; structuring tasks and meeting deadlines; establishing trust; project management software tools; maintaining project security; and more. 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
Distributed ML: Abstractions for Efficient and Fault-Tolerant Programming
Authors: Clifford D Krumvieda
Venue:  (1993)

Despite the availability, inherent parallelism, and potential fault tolerance of networked workstations and microcomputers, most programmers do not write distributed code. Those that do are often overwhelmed by the asynchrony, concurrency, and tricky failure behaviour inherent in such systems. In this thesis, we describe the design and implementation of a new programming language called Distributed ML. Distributed ML provides a programming construct called a port group that hides the sources of complexity listed above and can be implemented efficiently. Port groups are intermachine multicast channels which provide membership and failure information to application programmers. Although inherently asynchronous, port groups guarantee the delivery of data sent through them and can order such data in several different ways, thereby providing many of the assurances of synchronous communication. Port groups are general-purpose communication abstractions that can be used to transfer information between machines, between processes on the same machine, and between threads within the same process. In this thesis, we demonstrate that efficient distributed programs-even highly available and fault-tolerant distributed programs-can be quickly developed, easily reasoned about, and properly coded in a well-designed high level programming language. First, we provide an implementation and description of port groups in the context of the Concurrent ML concurrent programming language, which is a superset of the Standard ML general-purpose programming language. Second, we introduce a formal theory for relating the membership and ordering properties of port groups. Finally, we argue that our implementation matches the formal specification. 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
A Distributed Algorithm Solving CSPs with a Low Communication Cost
Authors: Nicolas Prcovic
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We present a new distributed algorithm which finds all solutions of Constraint Satisfaction Problems. Based on the Backtrack algorithm, it spreads subtrees of the search tree over processes running in parallel. The work is equitably shared among the processes while the communication cost remains low. We show that the speedup of the resolution is asymptotically linear as the number of variables increases.
NBQ: Neighbor-State Based Queuing for Adaptive Bandwidth Sharing
Authors: Yosuke Tamura, Yoshito Tobe, Hideyuki Tokuda
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

In this paper, we propose the Neighbor-state Based Queuing (NBQ) for improving the performance of flows sharing link bandwidth under various transfer protocols. Each router with NBQ informs the next upstream router of its link status. According to the received status, NBQ dynamically sets the packet discard ratio of the non-adaptive flows. NBQ reduces the wasted non-adaptive flows and provides available bandwidth for the adaptive flows. We have demonstrated dramatic improvements of adaptive flow's throughput using our scheme through simulations.
Agile Documentation: A Pattern Guide to Producing Lightweight Documents for Software Projects
Authors: Andreas Ruping
Venue:  (2003)

:Software documentation forms the basis for all communication relating to a software project. To be truly effective and usable, it should be based on what needs to be known. Producing just-enough documentation is a skill that enhances the productivity of a project team. The development of less cumbersome documentation has given rise to agile software development processes (such as eXtreme Programming, Crystal, etc.), which are designed to create successful software systems faster. Agile Documentation is a short, highly readable, and accessible guide to the new sleeker world of agile software development processes.
Towards a computerized Arabic Braille environment
Authors: AbdulMalik S. Al-Salman, Hend S. Al-Khalifa
Venue: Software&mdash;Practice Experience (2003)

People with visual disabilities face many difficulties and barriers when using computers and the Internet. Such people need the help of IT developers to create adaptive technologies that facilitate their interaction with the computers and Internet.This paper presents the design and implementation of an Arabic Braille environment (ABE). The paper also exposes to the reader the ABE's functionality and unique features. The ABE is designed to facilitate Arabic-speaking visually impaired people interaction with computers, as well as helping sighted users to communicate with the visually impaired.
Development of a Pumping System Decision Support Tool Based on Artificial Intelligence
Authors: P. W. Ilott, A. J. Griffiths
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

A framework for the development of a pumping system decision support tool based on artificial intelligence techniques has been investigated Pump fault detection and diagnosis are key requirements of the decision support tool. Artificial Neural Networks (ANNs) were proposed for condition monitoring data interpretation utilizing quantitative performance data. In the analysis, the Cumulative Sum (Cusum) charting procedure was successful in incipient fault identification. Various pre-processing techniques were investigated to obtain maximum diagnostic information despite the inherent problems of real industrial data. The orthonormal technique highlighted good generalization ability in fast machine learning time. ANNs were successful for accurate, incipient diagnosis of pumping machinery fault conditions based on real industrial data corresponding to historical pump faults.
Multiscale estimation of vector field anisotropy application to texture characterization
Authors: C. Germain, J. P. Da Costa, O. Lavialle, P. Baylou
Venue: Signal Processing (2003)

This paper deals with the characterization of the anisotropy of textured images. It is well known that either the dominant direction or the texture anisotropy strongly depends on the scale used for the observation. In this paper we propose a new operator for the estimation of the dominant direction, the directional mean vector (DMV), which can be computed at any observation scale. Then, we present a new indicator for the estimation of the DMV field anisotropy. This indicator, called Iso, is computed at a given observation scale. Iso is based on the computation of the DMV field local differences. It is shown that the evolution of Iso versus the observation scale gives a curve which simultaneously characterizes the anisotropy of the texture and the size of the textural patterns. In order to establish this property, we build a specific texture model which allows to assess an analytical expression for Iso. Finally, Iso is applied to the characterization of various images including synthetic textures, Brodatz textures and composite material images.
Reconstruction of Patterns from Noisy Inputs Using Morphological Associative Memories
Authors: Gerhard X. Ritter, Gonzalo Urcid, Laurentiu Iancu
Venue: Journal of Mathematical Imaging and Vision (2003)

Morphological neural networks are based on a new paradigm for neural computing. Instead of adding the products of neural values and corresponding synaptic weights, the basic neural computation in a morphological neuron takes the maximum or minimum of the sums of neural values and their corresponding synaptic weights. By taking the maximum (or minimum) of sums instead of the sum of products, morphological neuron computation is nonlinear before thresholding. As a consequence, the properties of morphological neural networks are drastically different than those of traditional neural network models. In this paper we restrict our attention to morphological associative memories. After a brief review of morphological neural computing and a short discussion about the properties of morphological associative memories, we present new methodologies and associated theorems for retrieving complete stored patterns from noisy or incomplete patterns using morphological associative memories. These methodologies are derived from the notions of morphological independence, strong independence, minimal representations of patterns vectors, and kernels. Several examples are provided in order to illuminate these novel concepts.
How to Do Everything with PhotoShop Elements 2, 2 edition
Authors: David N. Plotkin
Venue:  (2002)

:Use the latest version of Photoshop Elements and this easy-to-understand book to create professional-quality images for print and the Web from your very own digital and scanned images. This guide will show you how to take advantage of the flexible tools and versatile output options so you can be more creative than you ever imagined!