ppxscal/embedding_network huggingface dataset:
Palm OS Programming
Authors: Glenn Bachmann
Venue:  (2002)

:The PalmOS is the most widely-distributed operating system for handheld computers, with tens of millions of devices in use worldwide. Palm has a thriving developer community, with over 350,000 registered developers and countless hobbyist developers. The new edition of PalmOS Programming introduces the many updates to the PalmOS operating system in the past 24 months, including wirelss, color, and the Visor devices. In addition, this book looks forward at the next generation of Palm development and the new OS 5 slated for release in late 2002. 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
Technology-driven and model-driven approaches to group decision support: focus, research philosophy, and key concepts
Authors: Alec Morton, Fran Ackermann, Valerie Belton
Venue: European Journal of Information Systems (2003)

There are (at least) two distinct traditions within group decision support: what we will call the 'Technology-driven' tradition, which originates in the Information Systems discipline, and what we will call the 'Model-driven' tradition, which originates in OR/MS. Although proponents of the two traditions share many of the same objectives, in the past there has been little communication between the two groups. In this paper, we describe the basic distinction between the two traditions in terms of two primary themes: research focus (i.e., what the researchers find of interest) and research philosophy and methodology (i.e., how researchers go about studying their chosen subject matter); and we trace these implications of these differences through the key concepts of each tradition. We conclude by arguing that there are many opportunities for synergy between the two traditions.
Intransitive collineation groups of ovals fixing a triangle
Authors: Angela Aguglia, Arrigo Bonisoli
Venue: Journal of Combinatorial Theory Series A (2003)

We investigate collineation groups of a finite projective plane of odd order fixing an oval and having two orbits on it, one of which is assumed to be primitive. The situation in which there exists a fixed triangle off the oval is considered in detail. Our main result is the following. Theorem. Let π be a finite projective plane of odd order n containing an oval Ω. If a collineation group G of π satisfies the properties: (a) G fixes Ω and the action of G on Ω yields precisely two orbits Ω1 and Ω2, (b) G has even order and a faithful primitive action on Ω2, (c) G fixes neither points nor lines but fixes a triangle ABC in which the points A, B, C are not on the oval Ω, then n ∈ {7, 9, 27}, the orbit Ω2 has length 4 and G acts naturally on Ω2 as A4 or S4.Each order n ∈ {7, 9, 27} does furnish at least one example for the above situation; the determination of the planes and the groups which do occur is complete for n = 7, 9; the determination of the planes is still incomplete for n = 27.
Macromedia Flash MX: Creating Dynamic Applications
Authors: Michael Grundvig, Scott Smith, Eric Dolecki, Jobe Makar, Max Oshman
Venue:  (2002)

:If you're in the business of programming or developing online applications with Macromedia Flash, you've probably had moments when you wished you could turn to the real experts for advice on integrating server-side technologies. Now you can. Macromedia Flash MX: Creating Dynamic Applications showcases how both state-of-the-art and well-established server-side technologies coupled with Flash MX can deliver powerful dynamic applications. Utilizing the enhanced programming and integration capabilities of Flash MX, this book provides the theory behind the powerhouse code used to process, integrate, and display dynamic data. It focuses on tried-and-true middleware languages such as Java and ColdFusion, as well as newcomer ASP.NET, for integrating server-side data with Flash MX. Readers will get an "under the hood" look of the full-source code used to develop a number of inspirational and practical online applications, including an entire Hotmail-style email system using Flash as a front end, an online poll, a message board, a multiuser avatar chat, a multiplayer game, and an instant messenger. By providing all the source code for the applications in Java, ColdFusion, and ASP.NET, Macromedia Flash MX: Creating Dynamic Applications is sure to be sound advice for any professional programmer who uses Flash or advanced Flash developer.
MCSE Self-Paced Training Kit: Microsoft Windows 2000 Core Requirements, Second Edition, Exams 70-210, 70-215, 70-216, 70-217, 2 edition
Venue:  (2002)

:Four kits in one! Get self-paced, from-the-source information and practice with the skills measured by the core exams for the Microsoft Certified Systems Engineer (MCSE) certification on Windows 2000-all in one box. Covering core Exams 70-210, 70-215, 70-216, and 70-217, these official Microsoft study guides deliver in-depth training in hands-on, learn-by-doing format. Each book also contains 200+ pages of exam-preparation material, along with a testing tool to help assess what you know and where to focus your studies-before taking the actual exams. Work at your own pace through the skill-building lessons and exercises. As you gain practical experience administering the Windows 2000-based desktop, server, and network environments, you're also preparing for MCSE certification. The set includes four Microsoft study guides in print and on CD-ROM; exam preparation, including objective-by-objective review; test-readiness tools; Microsoft Encyclopedia of Networking, Second Edition," eBook; and a 120-day evaluation version of Windows 2000 Server software.
Game on: The History and Culture of Video Games
Authors: Lucien King
Venue:  (2002)

:Video games have come a long way since the first ever computer game, Spacewar, was developed at MIT in 1962 using technology developed to further man's attempts at space travel. In the last ten years games have developed rapidly to become one of the most profitable entertainment sectors in the world, giving rise to a billion dollar creative industry. The technical capabilities of game design have made a remarkable simulation of reality possible. The influence of video games is so pervasive that game characters, such as Lara Croft of Tomb Raider, have become cultural icons. Games have also influenced music and film. The first animated movie based on a game, Final Fantasy: The Spirits Within, recently set a new standard for computer graphics animation using characters that are almost indistinguishable from human actors.Game On examines the world of video games from a global perspective. Highly illustrated throughout, the book is structured around key themes, ranging from characters in games to future technical developments. It will appeal to readers of all ages and backgrounds, both those who play and those involved in the production of games. 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
Specifying useful error bounds for geometry tools: an intersector exemplar
Authors: C. Mow, Thomas J. Peters, Neil F. Stewart
Venue: Computer Aided Geometric Design (2003)

The problem of geometric robustness is pervasive within CAGD. One aspect is to permit convenient user specification of error bounds, so as to ensure the usefulness of geometric models. Often, a useful specification requires an additional interface between the user and the geometric tool. As intersections of spline surface patches are fundamental within CAGD, we present a relation between model space and parameter space error bounds for an intersection algorithm as an exemplar of the additional interface needed for practical geometric tools. In particular, we consider the approximation of the intersection curve between two trimmed-surface patches. The Grandine-Klein intersector produces an approximation that is accurate to within a user-specified error bound, where that error bound is specified in parameter space. However, the end user is typically unaware of the details of this parametric domain, so selection of a parametric space error bound often relies upon heuristics. In this note our goal is to demonstrate how a user-specified error bound is made usable in practice through the straightforward application of the mathematical relation between model-space and parameter-space error bounds. The conversion of the model-space tolerance into a parameter-space tolerance is captured in a pre-processing interface to the intersection algorithm. The software implemented has proven to be reliable, efficient and user-friendly. It is based upon an elementary error analysis, which is also presented.
Influence of the Dynamic Page Aggregation on the Speedup of Nautilus DSM System
Authors: Mario Donato Marino, Geraldo Lino de Campos
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper introduces the dynamic aggregation of pages in Nautilus, which main features are: lock-based scope consistency, multithreaded and page-based DSM system. The dynamic aggregation consists in considering a larger granularity's unit than a page, in a page-based DSM system. The first results show that this technique can improve the Nautilus's speedup up to 29%. The benchmarks evaluated in this study are SOR (from Rice University), LU and Water N-Squared (both from SPLASH-2).
New Webmaster's Guide to Dreamweaver 4
Authors: Jason Gerend, Stephen L. Nelson
Venue:  (2002)

:Designed specifically for busy professionals, this guide to Dreamweaver 4 breaks down the work of designing, building, and managing a Web site into seven distinct and fast-paced steps. Background information on the Internet, the Web, and different approaches to Web publishing is provided, as is a detailed discussion of the foundational work-such as registering for a domain and finding and setting up a Web hosting service-that needs to be done before the process of building a site begins. Further steps investigate collecting and organizing site content; setting up an initial structure; creating pages by combining text, images, and hyperlinks; refining and polishing pages; and testing, deploying, and marketing the site.Author Biography: Jason Gerend is a freelance technical writer and is a contributing editor of Microsoft Windows 2000 Server Administrator's Companion and FrontPage 2000 at a Glance. He lives in Bellingham, Washington. Stephen L. Nelson is the author of QuickBooks 2000 for Dummies, Effective Executive's Guide to Project 2000, and Quicken 2000 for Windows for Dummies. His books on using computers in business have sold more than three million copies. He lives in Seattle, Washington.
Relationships Among Some Conservative Discretization Methods
Authors: T. F. Russell
Venue:  (1999)

Relationships among various mass-conservative discretization techniques for equations of the type $-\nabla\cdot{\bf K}\nabla p = q$ on distorted logically rectangular meshes are discussed. The case of heterogeneous, anisotropic ${\bf K}$ is important for applications to subsurface porous me\-dia, in particular the groundwater flow equation and the pressure\linebreak equation of petroleum reservoir simulation. Some methods are based on {\bf K} itself, others on {\bf K}$^{-1}$. Within one of these groups, mass lumping and quadrature can be keys to understanding connections between methods; incomplete inversion of the mass matrix is useful in relating one group to the other. 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
Learning and Evaluating Visual Features for Pose Estimation
Authors: Robert Sim, Gregory Dudek
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We present a method for learning a set of visual landmarks which are useful for pose estimation. The landmark learning mechanism is designed to be applicable to a wide range of environments, and generalized for different approaches to computing a pose estimate. Initially, each landmark is detected as a local extreme of a measure of distinctiveness and represented by a principal components encoding which is exploited for matching. Attributes of the observed landmarks can be parameterized using a generic parameterization method and then evaluated in terms of their utility for pose estimation. We present experimental evidence that demonstrates the utility of the method.
Creation of a Noh Mask Using a 3D Computer Graphics Technique
Venue: Proceedings of the International Conference on Information Visualisation (2000)

To examine how computer technology can produce delicate, audience-inspiring presentations like ¿Noh¿, we attempted to create a Noh mask (Ko-omote) using a 3D computer graphics technique, by only referring to a carved wooden mask. It was possible to detect several characteristics of the mask's structure in the creation process. Rendering images showed the possibility that such a specific structure is closely related to effects of subtle facial expression changes. In order to bring effect that is more diverse to audiences, we also attempted to create a computer animation combining the mask model with story, movement, and background images. This paper suggests the possibility of acquiring profound experiences with the perception and expression of ¿face¿ for both viewers and creators by using a computer graphics technique.
Debugging Parallel Programs Using Incomplete Information
Authors: Simon Huband, Chris McDonald
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Many parallel programs employ regular topological structures to support their computation. This topological information is exploitable in the debugging process. Communications not normally part of a topology, ones that are either missing or unexpected, are immediately recognizable. Furthermore, animations used to assist the debugging may be enhanced by arranging representations of the executing tasks with reference to the program's topology.However, direct topology support is lacking in many environments, including workstation clusters, where popular language extensions such as the Parallel Virtual Machine (PVM) and the Message Passing Interface (MPI) are common. Programmers are required to implement topology support themselves. Moreover, debugger support that exploits topological information is lacking; without explicit knowledge, determining a program's topology is difficult.This paper presents a methodology to identify program topologies using only standard trace facilities. This methodology uses the concept of distance between graphs. To demonstrate the feasibility of the approach, several generic algorithms are implemented, and results on five different types of topologies reported.
Optimized Group Rekey for Group Communications Systems
Authors: Ohad Rodeh, Ken Birman, Danny Dolev
Venue:  (1999)

In this paper we describe an efficient algorithm for the management of group keys. Our algorithm is based on a protocol for secure IP-multicast and is used to manage group-keys in group-communications systems. Unlike prior work, based on centralized key-servers, our solution is completely distributed and fault-tolerant, and its performance is comparable to the centralized solution.
Convergence of Nested Iterative Methods for Linear Systems
Authors: J P Lanzkron
Venue:  (1993)

We consider the solution of algebraic linear systems of the form $Ax=b$, where $A$ is a matrix and $x$ and $b$ are vectors. Relaxation methods for solving this problem are defined by splitting the matrix $A$ as $A=M-N$, and solving the system $Mx_{k+1} = b + Nx_k$ at each step $k$, from some initial guess $x_0$. Generally $M$ is choosen to be easily invertible. We will consider the situation where $M$ is not necessarily easy to invert. This situation might arise in block Gauss-Seidel where the diagonal blocks become very large. In this case we will consider solving the $Mv=g$ system by an iterative method. We call this a nested iterative method. Define the outer splitting as $A = (D-L)-U$ and the inner splitting as $D=F-G$. If the outer splitting is a {\em convergent regular composite splitting} (CRCS) and the inner splitting is {\em weak regular} then the overall iteration is convergent. Under those same conditions increasing the number of inner iterations does not decrease the convergence rate of the iterative method. The iteration matrices for the inner iteration with $i$ and $j$ inner iterations are different. It is well known that compositions of convergent matrices need not be convergent. We show that if the outer splitting is a CRCS and the inner splitting is regular then the number of inner iterations can be changed at every outer iteration while preserving convergence. It is well known that relaxation methods can be computed using the residual. This recurrence is necessary in practice since the residual is used to determine convergence of the solution, and explicit computation of the residual is an expensive process. We show how to extend the recurrence to nested iterative methods. We give some heuristic methods for choosing the number of inner iterations. We show that iterative methods are useful for certain problems in device simulation and circuit simulation. We also consider issues of parallel implementation of our nested solver. We have implemented our nested solver on a 42 node BBN Butterfly, obtaining near linear speedup. We attained good speedup over the best sequential algorithm.
A Parallel Method for Discrete-Time Optimal Control Problems
Authors: Daniel Ralph
Venue:  (1993)

Discrete-time optimal control (DTOC) problems are potentially large, highly structured optimization problems. In such a problem, there are N+1 stages, or time steps; corresponding to time step i are a vector of control variables ui and a vector of state variables xi. When N is large relative to the dimension of each ui and xi, efficient methods for unconstrained DTOC problems have long been known. We propose a parallel method for unconstrained DTOC problems via stagewise decomposition: given J < 1 processors and I1 = 1 > I2 > ... > IJ+1 = N + 1, J subproblems are formed by grouping stages 1 to I2 1, I2 to I3 1, and so on. The subproblems are independent but for separator variables, ,..., , which are treated specially to retain the quadratic local convergence typical of serial DTOC algorithms. Computational examples using the Intel iPSC/860 hypercube are given.
PCs for Dummies, 9 edition
Authors: Dan Gookin
Venue:  (2003)

:Throw out those dense, mind-numbing, jargon-filled computer manuals and grab yourself a copy of PC's For Dummies, 6th EDITION, your all-in-one guide that is packed with all the tried-and-true advice and special tricks that you can expect from all-time best-selling author Dan Gookin. In his familiar, fun, and easy-to-follow fashion, Gookin guides you through the wonderful world of PCs with a minimum of technobabble and a maximum of hardware smarts and software savvy. Find out what lurks inside a PC and sort your way through chips, cards, cables, and connections The Dummies Way. You don't have to be a geek to get the most bang for your computing buck PC's For Dummies, 6th Edition, is the ideal reference for first-time PC users. From putting your PC together to finding quick answers and sage advice on installing new hardware and software, surfing the Internet and sending e-mail, or troubleshooting your PC problems, you can feel confident-and get your work done-in no time at all.
An EMI-Noise Analysis on LSI Design with Impedance Estimation
Authors: Hiroyuki Tsujikawa
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The EMI noise of LSI has become more significant factor for the LSI's reliability. The result of a transistor-level simulator wasn't compared with measurement enough and it needs the final layout. This paper shows an EMI-noise analysis method at the early stage of the LSI's design. The spectrum of the power supply current and the frequency response of the LSI's estimated impedance are merged analytically at high speed. The current can be calculated at high speed by a gate level simulator with a triangle model. The experimental results show that our method has a high accuracy that is correlated with measurement results. Furthermore, the estimation method of the LSI's impedance enables the EMI noise prediction at the early stage of LSI's designs. The information obtained from our method can also help designers to improve the LSI and electronic systems' design quality.
On the Convergence of a Dual-Primal Substructuring Method
Authors: Jan Mandel, Radek Tezaur
Venue:  (2000)

In the Dual-Primal FETI method, introduced by Farhat et al. (1999), the domain is decomposed into non-overlapping subdomains, but the degrees of freedom on crosspoints remain common to all subdomains adjacent to the crosspoint. The continuity of the remaining degrees of freedom on subdomain interfaces is enforced by Lagrange multipliers and all degrees of freedom are eliminated. The resulting dual problem is solved by preconditioned conjugate gradients. We give an algebraic bound on the condition number, assuming only a single inequality in discrete norms, and use the algebraic bound to show that the condition number is bounded by $C(1+\log^2(H/h))$ for both second and fourth order elliptic selfadjoint problems discretized by conforming finite elements, as well as for a wide class of finite elements for the Reissner-Mindlin plate model.
Maintenance at ABB (I): Software Problem Administration Processes (The State of Practice)
Authors: Mira Kajko-Mattsson
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

In large software organisations, a maintenance process is seldom monolithic. Instead, it is a complex family of various processes collaborating with each other, where each process executes a clearly defined task. In this paper, we present a comparative study of maintenance processes utilised by two ABB organisations, namely ABB Automation Products AB, and ABB Robotics AB. These processes administer the management of software problems. Thus, this study could be regarded as a report on the state of maintenance practice at the very present moment.
Efficient annotated terms
Authors: Mark Brand, Hayco A. Jong, Paul Klint, Pieter A. Olivier
Venue:  (2000)

How do distributed applications exchange tree-like data structures? We introduce the abstract data type of Annotated Terms (ATerms) and discuss their design, implementation and application. A comprehensive procedural interface enables creation and manipulation of ATerms in C or Java. The ATerm implementation is based on maximal subterm sharing and automatic garbage collection. A binary exchange format for the concise representation of ATerms (sharing preserved) allows the fast exchange of ATerms between applications. In a typical application---parse trees which contain considerable redundant information---less than 2 bytes are needed to represent a node in memory, and less than 2 bits are needed to represent it in binary format. The implementation of ATerms scales up to the manipulation of ATerms in the giga-byte range.