ppxscal/embedding_network huggingface dataset:
Hotspot Networks: WI-Fi for Public Access Locations
Authors: Daniel Minoli
Venue:  (2002)

:Hotspot Networks: Wi-Fi for Public Access LocationsThe Hotspots RebellionHotspots: killer app of 802.11. That's what the media say. These open-to-the-public wireless networks, showing up in hotels, airports, Starbucks, and even parks, have captured a lot of headlines. The Seattle Times calls hotspots the guerrilla revolution of wireless computing. ABC-TV news says hotpots threaten major carriers' cell networks. If you want to investigate this revolution, Hotspot Networks provides the technical support.HOTSPOT HOTSHOTNeed-to-know information on a fast-emerging technology from one of the top voices in networkingthat's what this detailed guide for network engineers and developers gives you. With Hotspot Networks, you can position yourself to promote, design, configure, implement, install, or develop service applications in a hot new market. With in-depth advice, Dan Minoli helps you* Deliver wireless Internet and telecom that's 40 times faster and one-tenth the cost of conventional networks* Get up to speed quickly on enabling technologies, components, and design options* Hear the lowdown on key players and products on track to market* Build the background you need in wi-fi* Walk around technical obstacles that tripped others* Find solutions to security problems* Overcome operating glitches* Develop broadband service apps for hotspot networks* Rate startups vs. established providersFirst-to-marketthis book captures the lead in technical coverage of hotspot networks. It's an enabling technology that lets you take the lead in delivering the hottest new wireless application toemerge in years.
Interactive skeleton techniques for enhancing motion dynamics in key frame animation
Authors: N. Burtnyk, M. Wein
Venue: ACM SIGGRAPH Computer Graphics (1976)

A significant increase in the capability for controlling motion dynamics in key frame animation is achieved through skeleton control. This technique allows an animator to develop a complex motion sequence by animating a stick figure representation of an image. This control sequence is then used to drive an image sequence through the same movement. The simplicity of the stick figure image encourages a high level of interaction during the design stage. Its compatibility with the basic key frame animation technique permits skeleton control to be applied selectively to only those components of a composite image sequence that require enhancement.
Microsoft Excel 2000 Illustrated Advanced Edition, 1st edition
Authors: Tara O'Keefe, Barbara Clemens
Venue:  (1999)

:Through instructor-led or self-paced step-by-step instruction, individuals learn how to perform "what if" analysis, create PivotTables, exchange Excel data with other programs, control worksheet properties and calculations, and program with Excel.
Computer Dictionary for Beginners
Authors: Anna Claybourne
Venue:  (1996)

:This book is a guide to computer jargon-the words and phrases used to describe computers and everything related to them. This book is the ideal handbook to help you find your way through the technological maze and hit the information superhighway.
Delivering Web Reference Services to Young People
Authors: Walter Minkel, Roxanne Hsu Feldman
Venue:  (1998)

:Delivering Web Reference Services to Young People helps with advice on what the Web does well for young people and what it does poorly; which Web skills are developmentally appropriate by age group; when to use search engines and when to use subject directories; how using your good old library catalog skills can, with a little bending, make you a whizzy searcher; why most young people, even the Net heads, are poor searchers; how to evaluate the sites you find on the Web; and how to gather the good sites into a subject directory or "webliography" for student, teacher, or library use.
Economic development via the net in Oceania
Authors: Stanley W. Johnston, Gerald A. Acquaah-Gaisie
Venue: Selected papers from the second Australian Institute conference on Computer ethics (2000)

The Internet is permeating our lives because of its power. This brings obvious social and economic value. Less obvious are the social and economic hurts.The Net's reach is global, but Net access is far from global; and as the IT caravan rolls on, stragglers slip further behind. However, the Net is a cheap power just made for isolated people, and thus it offers access to an unprecedented equality of opportunity. Women have equal access. But the already poor do not. Equity here raises questions of human rights, ethics, the professional standing of the computer industry, good business, and development aid.So the Net can both amplify and bridge the divide between rich and poor. Wealth is a function of relative purchasing power, which itself is a complex product of money and also of how we use it. Left to itself therefore IT makes some people poorer and adds new social tensions.This paper seeks programs which use the Net as a spearhead to bridge social and economic gaps across the Pacific Islands. It outlines some possibilities and issues, points of UN leadership and UN weaknesses, the major stakeholders, and local priorities. Antipodean Estonia has taken two great steps --- a computer for every twenty pupils, and a guarantee of Net access to every citizen. That is a model for isolated South Pacific islands.
Least-Squares Galerkin Methods for Parabolic Problems II: The Fully Discrete Case and Adaptive Algorithms
Authors: Mohammad Majidi, Gerhard Starke
Venue: SIAM Journal on Numerical Analysis (2001)

In this second part of our series on least-squares Galerkin methods for parabolic initial-boundary value problems we study the full discretization in time and space. These methods are based on the minimization of a least-squares functional for an equivalent first-order system over space and time with respect to suitable discrete spaces. Based on the analysis of the semi-discretization in time carried out in the first part, we construct a posteriori error estimators for the approximation error components associated with time and space. For the space discretization error we use a hierarchical basis estimator with respect to the functional minimization problem. We prove a strengthened Cauchy--Schwarz inequality between coarse and hierarchical surplus space and a bound on the condition number of the auxiliary problem, both uniform in the mesh-size h and the time-step $\tau$ implying efficiency and reliability of the error estimator. This allows for an adaptive strategy for both the time-step size and the spatial triangulation, keeping a proper balance between these two components. Numerical experiments illustrate the performance of the resulting adaptive schemes in time and space.
Mortal Kombat Mythologies: Official Game Secrets
Authors: Prima Publishing, Simon Hill
Venue:  (1997)

:This guide provides you with detailed maps, locations of secret items, walkthroughs of every level, and secrets to unlocking all combos, special attacks, and fatalities.
Lectures in Multisensor Data Fusion and Target Tracking, 1st edition
Authors: David Hall
Venue:  (2001)

:This dynamic new CD features a self-contained short course suitable for self-instruction or a classroom setting. Based on a popular data fusion course taught Dr. David Hall, an internationally recognized expert, this resource starts with introductory material and brings you to the leading-edge of multisensor data fusion and target tracking work currently underway. Comprising 10 learning modules, this unique software includes:  An introduction to data fusion and target tracking  Systems engineering for data fusion  Examples of data fusion systems  An overview of sensor technology and single sensor processing  Target tracking and attribute fusion  Target identity estimation  Sensor management and control  Automated reasoning systems for situation and threat assessment  The role of man/human-in-the-loop  An assessment of the state of the art Multisensor Data Fusion and Target Tracking provides examples of systems currently in use for both military and non-military purposes, and it surveys the similarities and differences between the applications for these two systems. Also, you get an excellent overview of sensor technology and single sensor processing, and an introduction to pattern recognition methods, such as neural networks, cluster analysis, and probabilistic methods (including Bayesian and Dempster-Shafer methods). The role of human perceptions and reasoning in the development of data fusion and target tracking systems is discussed, and you get a thorough introduction to automated reasoning systems for situation and threat assessment, including expert systems, fuzzy logic, template methods, andcase-based reasoning. Concluding with an overview of the state of the art, the CD includes over 350 viewgraphs, extensive explanatory text, references, lists of related websites, and an online electronic dictionary of 650 key terms and acronyms, training objectives, test questions, and class projects.
Wireless Location in CDMA Cellular Radio Systems
Authors: James J. Caffery
Venue:  (1999)

:Wireless Location in CDMA Cellular Radio Systems investigates methods for wireless location in CDMA networks and analyzes their performances. Techniques for measuring location parameters (AoAs, ToAs, etc.) are presented along with algorithms for calculating position from those parameters. Several impairments to accurate location are covered and analyzed including multipath propagation, non-line-of-sight propagation, and multiple-access interference. Many of the topics in this book are also applicable to FDMA- and TDMA-based communication networks.
Student technology fellows program: teaching teachers the technology
Authors: Allan R. Jones
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Universities are facing a dearth of technology-trained persons to assist with the increased use of technology in the classroom or for course delivery. Several programs have been tried in South Dakota to alleviate this pending crisis. There have been faculty awards for teaching with technology, technical training through internal reinvestments, and peer mentorships, to mention a few. These incentives and training have resulted in a large number of faculty exploring new skills in the classroom. They now desire development of web sites for courses, addition of multimedia to augment lectures, and on-line activities using simulations and other devices to enhance the knowledge of their students. These demands and changes in curriculum to accommodate new technologies have severely strained the support organizations of the campuses. To meet this need of increased technical support of faculty in the curriculum, a program involving Student Technology Fellows was created. The specific mission was, and is, to assist faculty in integrating technology into their teaching. The FY2000 Governor's Budget Request for this challenging program was approved and the South Dakota legislature appropriated to the Board of Regents sufficient funds to establish a technology fellowship for students at each of the state's six public institutions of higher learning. The project was inaugurated for the Fall 2000 semester.
Microsoft Outlook 2000 - Illustrated Essentials, 1st edition
Authors: Goding Swanson, Jeff Goding
Venue:  (1999)

:Part of the Illustrated Series, this concise text offers a quick, visual, step-by-step approach for learning the basics of e-mail using Microsoft Outlook 2000.
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
Authors: Hanno Lefmann, Niels Schmitt
Venue: SIAM Journal on Computing (2002)

Heilbronn conjectured that among arbitrary n points in the two-dimensional unit square [0,1]2, there must be three points which form a triangle of area O(1/n2). This conjecture was disproved by a nonconstructive argument of Komlós, Pintz, and Szemerédi [J. London Math. Soc., 25 (1982), pp. 13--24], who showed that for every n there exists a configuration of n points in the unit square [0,1]2 where all triangles have area $\Omega({\log n}/{n^2})$. Here we will consider a three-dimensional analogue of this problem and show how to find deterministically in polynomial time n points in the unit cube [0,1]3 such that the volume of every tetrahedron among these n points is $\Omega(\log n/n^3)$.
Visualization of symmetry in graphs
Authors: Seok-Hee Hong
Venue: Selected papers from the Pan-Sydney workshop on Visualisation - Volume 2 (2000)

Information can be modeled as graphs. Graph Drawing aims to construct geometric representations of graphs in two and three dimensions. Symmetry is one of the most important measures for good drawing. Further, symmetry is closely related to human understanding. We describe some methods for visualizing symmetries in graphs.
Very realistic graphics for visualising archaeological site reconstructions
Authors: Alan Chalmers
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

Recent developments in computer graphics are providing powerful tools for modelling multidimensional aspects of data gathered by archaeologists. Computer graphics techniques can now be used to reconstruct and visualise features of a site which may otherwise be difficult to appreciate. This new perspective may enhance our understanding of the environments in which our ancestors lived. However, if we are to avoid misleading impressions of a site then we need to be able to evaluate the "realism" of the resultant reconstructions.This paper investigates the problems associated with reconstructing archaeological and heritage sites on computer.
A Generalization of Zubov's Method to Perturbed Systems
Authors: Fabio Camilli, Lars Grüne, Fabian Wirth
Venue: SIAM Journal on Control and Optimization (2001)

A generalization of Zubov's theorem on representing the domain of attraction via the solution of a suitable partial differential equation is presented for the case of perturbed systems with a singular fixed point. For the construction it is necessary to consider solutions in the viscosity sense. As a consequence, maximal robust Lyapunov functions can be characterized as viscosity solutions.
Estimating facial pose using shape-from-shading
Authors: Kwang Nam Choi, Philip L. Worthington, Edwin R. Hancock
Venue: Pattern Recognition Letters (2002)

This paper reports the application of a recently developed shape-from-shading technique to estimate facial pose. The shape-from-shading algorithm uses a new geometric technique for solving the image irradiance equation together with curvature consistency constraints. Orientation histograms extracted from the the needle-maps delivered by the new shape-from-shading algorithm are used to estimate facial pose. We present a simple model of how the histogram bin-contents transform under rotation of the head. The parameters of this model are the head pose angles. We estimate pose by searching for the rotation angles which maximise the correlation between transformed histograms. A sensitivity analysis reveals that the methods can deliver pose estimates that are accurate within a few degrees.
Using Microsoft Site Server: Special Edition
Authors: Barry S. Wadman, Stephen Peront
Venue:  (1997)

:Learn how to build innovative, personalized online stores with Microsoft Site Server quickly and efficiently See how to use Active Server Pages to build your online store on the fly, and learn how to update your store dynamically by reacting to purchase or shopping decisions Take advantage of Site Server s real-time merchandising capabilities through remote administration, up-to-the-minute traffic analysis, and instant online promotions Understand how to integrate existing or third-party plug-ins, like inventory and tax packages Learn how to take advantage of Microsoft Wallet and tie your Commerce application to Internet Explorer Get an in-depth review of the four sample stores, and learn how to quickly and easily customize them to get on the web fast See how to implement the Buy Now Wizard on other web sites to draw traffic and interest to your commerce site Learn how to integrate Site Server with Windows NT 4, SQL Server 6.5 and Internet Information Server 3.0 Learn how to use Microsoft Visual InterDev to create your commerce siteLearn the secrets of Site Server from Barry Wadman, who Datamation magazine called the world-class expert on Site Server (Datamation, 4/97)Get behind the scenes with the person who built the Microsoft showcase malls Build your electronic commerce site In one day with Special Edition Using Microsoft Site Server
MCSD Solution Architectures
Authors: New Riders Publishing, Eeraj J. Qaisar
Venue:  (1999)

:This next generation Training Guide has been developed to help you study and retain the essential knowledge you need to pass the Solution Architectures exam. We know your study time is valuable, and we have made every effort to make the most of it by presenting clear, accurate, and thorough information. We have designed the book to reflect the latest innovations in testing--case study-based exams. The case study- training in this book will prepare you for Exam 70-100's unique and challenging format. When creating this next generation Training Guide, our goal was to raise the bar on how MCSD content is written, developed, and presented. From the objective explanations and study strategies to the practice exams and test-taking tips, this Training Guide will thoroughly prepare you for exam success.
Inside MacIntosh: Overview, 2nd edition
Authors: Apple Computer Inc.
Venue:  (1992)

:This is the first book that people who are unfamiliar with Macintosh technology should read. It gives an overview of Macintosh programming fundamentals and a roadmap to the New Inside Macintosh library. This book also covers various programming tools and languages, compatibility guidelines, and an overview of considerations for worldwide software development.
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
Authors: T. C. Edwin Cheng, Mikhail Y. Kovalyov, Bertrand M.-T. Lin
Venue: SIAM Journal on Optimization (1997)

We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on a single machine. A constant machine set-up time is required before the first job of each batch is processed. A schedule specifies the sequence of batches, where each batch comprises a sequence of jobs. The batch delivery time is defined as the completion time of the last job in a batch. The earliness of a job is defined as the difference between the delivery time of the batch to which it belongs and the job completion time. The objective is to find a number B of batches and a schedule so as to minimize the sum of the total weighted job earliness and mean batch delivery time. The problem is shown to be strongly NP-hard. It remains strongly $NP$-hard if the set-up time is zero and $B\le U$ for any variable $U\ge 2$ or if $B\ge U$ for any constant $U\ge 2$. The problem is proved to be ordinary NP-hard even if the set-up time is zero and $B\le 2$. For the case $B\le U$, a dynamic programming algorithm is presented, which is pseudopolynomial for any constant $U\ge 2$. Algorithms with O(n¹) running times are derived for the cases when all weights are equal or all processing times are equal. For the general problem, a family of heuristics is suggested. Computational experiments on the proposed heuristic algorithm are conducted. The results suggest that the heuristics are effective in generating near-optimal solutions quickly.
Texture and reflection in computer generated images
Authors: James F. Blinn, Martin E. Newell
Venue: Proceedings of the 3rd annual conference on Computer graphics and interactive techniques (1976)

In 1974 Ed Catmull developed a new algorithm for rendering images of bivariate surface patches. This paper describes extensions of this algorithm in the areas of texture simulation and lighting models.The parametrization of a patch defines a coordinate system which is used as a key for mapping patterns onto the surface. The parametric values within each picture element are input to a pattern definition function. A weighted average of the values of this function over the picture element scales the intensity of that picture element. By suitably defining the pattern function, various surfaces textures can be simulated. The shape and size of this weighting function is chosen using digital signal processing theory.The other problem addressed here concerns lighting models. The patch rendering algorithm allows accurate computation of the surface.
SQL Unleashed: From Knowledge to Mastery, 2nd edition
Authors: Sakhr Youness, Pierre Boutquin
Venue:  (1999)

:SQL Unleashed, Second Edition, covers ANSII SQL and how to implement them with several major relational database platforms used on a day-to-day basis. SQL Unleashed focuses on more intermediate to advanced topics and the latest trends forthcoming in SQL. Designed to be used as both a reference and implementation tool, this book serves as a practical, pragmatic guide to day-to-day SQL programming and provide the most efficient solutions for getting the job done. Topics include database design and data definition, data manipulation, data selection, more advanced, QL implementations, the future of SQL, and vendor SQL extensions.
ORT: a communication library for orthogonal processor groups
Authors: Thomas Rauber, Robert Reilein, Gudula Rünger
Venue: Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) (2001)

Many implementations on message-passing machines can benefit from an exploitation of mixed task and data parallelism. A suitable parallel programming model is a group-SPMD model, which requires a structuring of the processors into subsets and a partition of the program into multi-processor tasks. In this paper, we introduce a library support for the specification of message-passing programs in a group-SPMD style allowing different partitions in a single program. We describe the functionality and the implementation of the library functions and illustrate the library programming style with example programs. The examples show that the runtime on distributed memory machines can be considerably reduced by using the library.
Cellular Mobile Radio: Designing Systems for Capacity Optimization, 1st edition
Authors: Husni Hammuda
Venue:  (1997)

:Most radio systems have become so popular that the available frequency bands are able to meet only a fraction of the demand. This book gives practical solutions for optimizing efficiency of mobile radio cells.
A goal-driven approach to enterprise component identification and specification
Authors: Keith Levi, Ali Arsanjani
Venue: Communications of the ACM (2002)

Mapping a business architecture to a component-based software architecture.