ppxscal/embedding_network huggingface dataset:
Critical approach to 3D virtual realities for group work
Authors: Samuli Pekkola
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

Collaborative virtual environments (CVEs) have been studied extensively during the past few years. In this paper, the concept of virtual reality (VR), and its value for group work are critically examined. To ground the discussions, experiences from a virtual reality project, from 3D chats, and from present CVE applications are analysed in the light of human communication. It is argued that the value of virtual reality is often overemphasised and overrated in the group work context, especially when conce rning desktop virtual realities and generic groupwork without an explicitly defined task or purpose. The main problem with VR is its self-centricity and inadequate support for shared real-life related objects.
Interpolation Theory and Quantum Cohomology
Authors: M. S. Ravi
Venue: SIAM Journal on Control and Optimization (2000)

We show that the quantum cohomology ring of the Grassmannian can be used to find the minimal degree of the solution to various interpolation problems involving matrices of rational functions. We also use computations in the quantum cohomology ring to formalize the notion of linearity in this context and distinguish between linear problems such as matrix and tangential interpolation and nonlinear problems such as pole placement.
Multimedia Video-Based Surveillance Systems: Requirements, Issues and Solutions
Authors: Gian Luca Foresti, Petri Mahonen, Carlo S. Regazzoni
Venue:  (2000)

:Multimedia surveillance systems is an emerging field that includes signal and image processing, communications, and computer vision. Multimedia Video-Based Surveillance Systems: Requirements, Issues and Solutions, combines the most recent research results from these areas for use by engineers and end-users involved in the design of surveillance systems in the fields of transportation and services. The book covers emerging surveillance requirements, including new digital sensors for real-time acquisition of surveillance data, low-level image processing algorithms, and event detection methods. It also discusses problems related to knowledge representation in surveillance systems, wireless and wired multimedia networks, and a new generation of surveillance communication tools. Timely information is presented on digital watermarking, broadband multimedia transmission, legal use of surveillance systems, performance evaluation criteria, and other new and emerging topics, along with applications for transports and pedestrian monitoring. The information contained in Multimedia Video-Based Surveillance Systems: Requirements, Issues and Solutions, bridges the distance between present practice and research findings, and the book is an indispensable reference tool for professional engineers.
On-Line Load Balancing in a Hierarchical Server Topology
Authors: Amotz Bar-Noy, Ari Freund
Venue: SIAM Journal on Computing (2002)

In a hierarchical server environment jobs are to be assigned in an on-line fashion to a collection of servers which form a hierarchy of capability: each job requests a specific server meeting its needs, but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server it is assigned to. The goal is to find a competitive assignment in which the maximum total load on a server is minimized.We consider the linear hierarchy in which the servers are totally ordered in terms of their capabilities. We investigate several variants of the problem. In the unweighted (as opposed to weighted) problem all jobs have unit weight. In the fractional (as opposed to integral) model a job may be assigned to several servers, each receiving some fraction of its weight. Finally, temporary (as opposed to permanent) jobs may depart after being active for some finite duration of time. We show an optimal e-competitive algorithm for the unweighted integral permanent model. The same algorithm is (e+1)-competitive in the weighted case. Its fractional version is e-competitive even if temporary jobs are allowed. For the integral model with temporary jobs we show an algorithm which is 4-competitive in the unweighted case and 5-competitive in the weighted case. We show a lower bound of e for the unweighted case (both integral and fractional). This bound is valid even with respect to randomized algorithms. We also show a lower bound of 3 for the unweighted integral model when temporary jobs are allowed.We generalize the problem and consider hierarchies in which the servers form a tree. In the tree hierarchy, any job assignable to a node is also assignable to the node's ancestors. We show a deterministic algorithm which is 4-competitive in the unweighted case and 5-competitive in the weighted case, where only permanent jobs are allowed. Randomizing this algorithm improves its competitiveness to e and e+1, respectively. We also show an $\Omega(\sqrt{n})$ lower bound when temporary jobs are allowed.
AIS
Authors: Niels Bjorn Andersen
Venue: ACM SIGMIS Database (1996)

In an old song from the resistance movement in Denmark during the Second World War, one of the key lines is "for the old trees falling, there will be new trees growing up."
E-Therapy: Case Studies, Guiding Principles, and the Clinical Potential of the Internet
Authors: Robert C. Hsiung
Venue:  (2002)

:An exploration of the use of electronic communication in mental health. This book provides real-life examples of new mental health services: Ask-the-Expert Web sites, virtual support groups, office-based therapy plus e-mail, and even 100-percent-electronic treatment in which therapists and patients never meet in person. Guiding principles educate current and prospective providers, consumers, and administrators of such services.Author Biography: Robert C Hsiung lives in Chicago. 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
Dino Crisis
Authors: Brady Games
Venue:  (1999)

:BradyGames-Dino Crisis: Official Strategy Guide gives you everything you need to rescue Dr. Kirk. Comprehensive Tactics  All-inclusive, step-by-step strategy guides you through every crisis, helps you solve every puzzle. Detailed Area Maps  Room-by-toom diagrams show you where to go, pinpoint crucial items, weapons, and upgrades. Expert Training  Complete gameplay tips show you how to attack and defend against every dinosaur, when to use each weapons how to mix items, and more! Complete Secrets and Bonuses Coverage  Reveals all hiddne game modes, alternate uniforms and weapons, every plot branch and game ending, and more!
Pattern Search Algorithms for Mixed Variable Programming
Authors: Charles Audet, J. E. Dennis,  Jr.
Venue: SIAM Journal on Optimization (2000)

Many engineering optimization problems involve a special kind of discrete variable that can be represented by a number, but this representation has no significance. Such variables arise when a decision involves some situation like a choice from an unordered list of categories. This has two implications: The standard approach of solving problems with continuous relaxations of discrete variables is not available, and the notion of local optimality must be defined through a user-specified set of neighboring points. We present a class of direct search algorithms to provide limit points that satisfy some appropriate necessary conditions for local optimality for such problems. We give a more expensive version of the algorithm that guarantees additional necessary optimality conditions. A small example illustrates the differences between the two versions. A real thermal insulation system design problem illustrates the efficacy of the user controls for this class of algorithms.
Formal-Language-Constrained Path Problems
Authors: Chris Barrett, Riko Jacob, Madhav Marathe
Venue: SIAM Journal on Computing (2000)

Given an alphabet $\Sigma$, a (directed) graph G whose edges are weighted and $\Sigma$-labeled, and a formal language $L\subseteq\Sigma^*$, the formal-language-constrained shortest/simple path problem consists of finding a shortest (simple) path p in G complying with the additional constraint that l(p) \in L$. Here l(p) denotes the unique word obtained by concatenating the $\Sigma$-labels of the edges along the path p. The main contributions of this paper include the following: We show that the formal-language-constrained shortest path problem is solvable efficiently in polynomial time when L is restricted to be a context-free language (CFL). When L is specified as a regular language we provide algorithms with improved space and time bounds. In contrast, we show that the problem of finding a simple path between a source and a given destination is NP-hard, even when L is restricted to fixed simple regular languages and to very simple classes of graphs (e.g., complete grids). For the class of treewidth-bounded graphs, we show that (i) the problem of finding a regular-language-constrained simple path between source and destination is solvable in polynomial time and (ii) the extension to finding CFL-constrained simple paths is NP-complete. Our results extend the previous results in [SIAM J. Comput., 24 (1995), pp. 1235--1258; Proceedings of the 76th Annual Meeting of the Transportation Research Board, 1997; and Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems, 1990, pp. 230--242]. Several additional extensions and applications of our results in the context of transportation problems are presented. For instance, as a corollary of our results, we obtain a polynomial-time algorithm for the best k-similar path problem studied in Proceedings of the 76th Annual Meeting of the Transportation Reasearch Board, 1997]. The previous best algorithm was given by [ Proceedings of the 76th Annual Meeting of the Transportation Research Board, 1997] and takes exponential time in the worst case.
Business and Economics of Linux and Open Source
Authors: M. Fink
Venue:  (2002)

The manager's guide to using Linux and open source for competitive advantage.Using Linux and open source technologies, thousands of enterprises are cutting costs, gaining flexibility, and discovering powerful new sources of business value. Now, there's an objective, realistic manager's guide to using Linux and open source technology for competitive advantage. Martin Fink helps you get past both the hypesters and the naysayers, so you can accurately assess the benefits, costs, and risks of open source in your organization. Writing strictly from the manager's viewpoint, Fink covers every step of the Linux and open source project lifecycle, and every crucial issue, from licensing to collaborating with the open source community of developers. Coverage includes: Assessing the costs, benefits, and risks of pursuing Linux and open source initiatives Open source licensing: avoiding the minefields Managing Linux and open source projects within your company Assessing the size, breadth, and capabilities of the open source community Building strong, positive, synergistic relationships with external open source communities The crucial role of Linux standards Integration, development, deployment, migration, coexistence, support, and training Understanding the difference between the Linux kernel and the Linux operating system Understanding and choosing Linux distributions How the open source paradigm impacts commercial software developers Open source business models: what it takes to make a profit from open source technology Applying the open source development methodology in a corporate setting "A thought-provoking analysis of the role of open source software in the corporate environment. A must-read guide for managers considering how open source can help their organization."-Tim O'Reilly, O'Reilly and Associates, Inc.
Compressing SQL workloads
Authors: Surajit Chaudhuri, Ashish Kumar Gupta, Vivek Narasayya
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importance of leveraging workloads. Often these tasks are presented with large workloads, i.e., a set of SQL DML statements, as input. A key factor affecting the scalability of such tasks is the size of the workload. In this paper, we present the novel problem of workload compression which helps improve the scalability of such tasks. We present a principled solution to this challenging problem. Our solution is broadly applicable to a variety of workload-driven tasks, while allowing for incorporation of task specific knowledge. We have implemented this solution and our experiments illustrate its effectiveness in the context of two workload-driven tasks: index selection and approximate query processing.
SQL Server 7 Administration Study Guide: Covers Exam 70-028 with Cdrom, 1st edition
Authors: Lance Mortensen, Rick Sawtell
Venue:  (1999)

:Here is the book you need to prepare for Exam 70-028, Administering Microsoft SQL Server 7.0. This Microsoft Certified Professional Approved Study Guide provides full coverage of every exam objective - all the information you need to know; hundreds of challenging review questions, both in the book and on the CD; and practical information on applying SQL concepts and techniques in the real world.
Relationships between possibility measures and nested random sets
Authors: Enrique Miranda, In&#x00E9;s Couso Pedro Gil
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

Different authors have observed some relationships between consonant random sets and possibility measures, specially for finite universes. In this paper, we go deeply into this matter and propose several possible definitions for the concept of consonant random set. Three of these conditions are equivalent for finite universes. In that case, the random set considered is associated to a possibility measure if and only if any of them is satisfied. However, in a general context, none of the six definitions here proposed is sufficient for a random set to induce a possibility measure. Moreover, only one of them seems to be necessary.
Integer Isotone Optimization
Authors: Ming-Hong Liu, Vasant A. Ubhaya
Venue: SIAM Journal on Optimization (1997)

Consider the following integer isotone optimization problem. Given an $n$-vector $x$ find an $n$-vector $y$ with integer components so as to minimize $\max\{w_j|x_j - y_j| : 1 \leq j \leq n\}$ subject to $y_1 \leq y_2 \leq \cdots \leq y_n$, where each weight $w_j > 0$. In this article, the dual of this problem is defined, a strong duality theorem is established, and the set of all optimal solutions is shown to be all monotonic integer vectors lying in a vector interval. In addition, algorithms are obtained for computation of optimal solutions having the worst-case time complexity $O(n^2)$, when $w_j$ are arbitrary, and $O(n)$, when $w_j = 1$ for all $j$. The problem considered is of isotonic regression type and has practical applications, for example, to estimation and curve fitting. It is also of independent mathematical interest. The problem and the results can be easily extended to a partially ordered set.
The ABC's of Architectural and Interior Design Drafting Using AutoCAD, 1st edition
Authors: Tony Cook, Robin H. Prater
Venue:  (2000)

:Some of the features of this text include: Step-by-step instructions for drafting and AutoCAD® commands Numerous illustrations of materials, projects, and examples Chapter-ending review questions and exercises Detailed drawing assignments Tips, reminders, and examples
The Education of an Illustrator
Authors: Steven Heller, Marshall Arisman
Venue:  (2000)

From the Book:The process of drawing can unlock the entire creative process for an artist. As children, we all used drawing to relate to the world around us. We were not trying to make art. We were trying to make sense out of the world we were experiencing. We told stories in pictures. . . . The vocabulary of the illustrator has to be expanded into authorship. (Marshall Arisman, from the introduction)
Genesis: a system for large-scale parallel network simulation
Authors: Boleslaw K. Szymanski, Adnan Saifee, Anand Sastry, Yu Liu, Kiran Madnani
Venue: Proceedings of the sixteenth workshop on Parallel and distributed simulation (2002)

We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and concurrently with the others over the same simulation time interval. At the end of each interval, packet delays and drop rates for each inter-domain flow are exchanged between domain simulators. The simulators iterate over the same time interval until the exchanged information converges to a constant value within the prescribed precision. After convergence, all the domain simulators progress to the next time interval. This approach allows the parallelization with infrequent synchronization.The biggest challenge for this method is to ensure iteration convergence for protocols, such as TCP, that adjust source rate to the current network conditions. The main contribution of this paper is to demonstrate that by judicious design of the domain processing and information exchange, the proposed approach efficiently parallelizes network simulation with TCP flows.
Virtual archaeology: VR based knowledge management and marketing in archaeology first results --- nexts steps
Authors: Steffen Kirchner, Peter Jablonka
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

Looking at the perception of archaeology within our society, and the development of new technologies, we discover that we are faced both with new challenges and new opportunities. Ideally, our own research from excavation and documentation to analysis and publication, and a popular presentation of it, could somehow be combined within one consistent workflow, using technology tailored to meet the purpose. Given the limits of resources and know-how in academic archaeology --- even at Troy --- such ideas are mostly bound to remain science-fiction. How can we archaeologists actually be enabled to meet the challenge and make the best of new opportunities a new millenium has to offer?The general aim of the project "Virtual Archaeology" is the introduction of fundamentally changed working methods in archaeology with the aid of the most modern technologies, not only in the area of primary data acquisition but also in data processing and editing for scientific purposes and for the presentation of archaeological knowledge to a broad general public.
MCSD Visual Basic 6: Core Requirements : Exams 70-176, 70-175, 70-100, 1st edition
Authors: Ben Ezzell, Michael Lee
Venue:  (1999)

:Exam Preparation from the Experts  Your Key to Better Job OpportunitiesThe ultimate preparation for the Visual Basic 6 Core Requirements exams, these Microsoft Certified Professional Approved Study Guides provideFull coverage of every exam objective  all the information you need to knowHundreds of challenging review questions, in the book and on the CDHands-on exercises that let you apply the concepts you've learned
The Insider's Guide to Mental Health Resources Online, 1st edition
Authors: John M. Grohol
Venue:  (2002)

:From online mental health pioneer John M. Grohol, the 2002/2003 edition of this acclaimed guide helps busy professionals take full advantage of Internet and World Wide Web resources in psychology, psychiatry, and related areas such as self-help and patient education. The book explains and evaluates the full range of search tools, newsgroups, and databasesincluding MEDLINE and PsychINFOand describes hundreds of specific mental health sites. Easy to use and chock-full of the latest information, the 2002/2003 edition features up-to-the-minute reviews and critical ratings, current Web site and e-mail addresses, and coverage of over 40 new resources. Users learn how and where to go online to find treatment information; use Web-based assessment tools; locate reliable advocacy and support groups; obtain articles and books; pursue distance learning opportunities; get listed in online directories; find job postings; conduct grant searches; and much more. Online Updates: A special Web site provides ongoing updates to the information contained in this edition, keeping readers current on important resources.
Cellular-functional modeling of heterogeneous objects
Authors: Valery Adzhiev, Elena Kartasheva, Tosiyasu Kunii, Alexander Pasko, Benjamin Schmitt
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

The paper presents an approach to modeling heterogeneous objects as multidimensional point sets with multiple attributes (hypervolumes). A theoretical framework is based on a hybrid model of hypervolumes combining a cellular representation and a constructive representation using real-valued functions. This model allows for independent but unifying representation of geometry and attributes, and makes it possible to represent dimensionally non-homogeneous entities and their cellular decompositions. Hypervolume model components such as objects, operations and relations are introduced and outlined. The framework's inherent multidimensionality allowing, in particular, to deal naturally with time dependence promises to model complex dynamic objects composed of different materials with constructive building of their geometry and attributes. Attributes given at each point can represent properties of arbitrary nature (material, photometric, physical, statistical, etc.). To demonstrate a particular application of the proposed framework, we present an example of multimaterial modeling - a multilayer geological structure with cavities and wells. Another example illustrating the treatment of attributes other than material distributions is concerned with time-dependent adaptive mesh generation where function representation is used to describe object geometry and density of elements in the cellular model of the mesh. The examples have been implemented by using a specialized modeling language and software tools being developed by the authors.
System study of a dial-up text reading service for the blind
Authors: John H. Munson
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper describes a recent feasibility study of a system concept that could allow blind persons access on demand to the printed page. A portable, user-controlled scanner, based on the Optacon direct-translation reading aid, would collect image information from any printed text for presentation to a computer and optical character recognition unit, remotely connected via dial-up telephone lines. The OCR unit would recognize the letters of the text, the computer would assemble them into words and phrases, and intelligible speech would be returned to the user. The study indicated that such a system was feasible, or close to feasible, within the state of the art in the pertinent areas of development and that its cost might not be exorbitant in comparison with existing services for the blind.
Inside Adobe PhotoShop 3: With Cdrom, 2nd edition
Authors: Gary David Bouton, Barbara Mancuso Bouton
Venue:  (1994)

:Written for the intermediate computer user and graphic arts professional, this tutorial and reference explains image types, acquisition techniques, and scanning methods. This book also discusses the tools, filters, and techniques used to create eye-catching special effects.Includes 16 full-color pages that illustrate what users can create with PhotoshopShows readers how to use Photoshop with other applications such as CorelDRAW!, Pixar Typestry, and Fractal Design PainterCD-ROM contains stock photos, textures, and shareware to help the reader complete the book's exercises