ppxscal/embedding_network huggingface dataset:
Ada/Mindstorms 1.0 User's Guide and Reference Manual
Authors: Barry Fagin
Venue: ACM SIGAda Ada Letters (2000)

Ada/Mindstorms 1.0 is an Ada interface to the Lego RCX "brick", included as part of the Lego Mindstorms Robotics Invention System. Programs are written with an Ada compiler, translated into Dave Baum's Not Quite C langauge (NQC), then recompiled and downloaded through the Mindstorms IR transmitter to the RCX.Ada/Mindstorms 1.0 is distributed with the USAFA AdaGIDE Windows Ada compiler. This document assumes that you have obtained and installed AdaGIDE. If you are using another Ada compiler, see Appendix A. We also assume working knowledge of Ada. If you haven't used Ada before, we recommend learning the basics first before reading further, http://www.adahome.com/Discover/Introduction.html is a good place to start. We also assume a general familiarity with the Lego Mindstorms Robotics Invention System and the RCX.To use Ada/Mindstorms 1.0, you need a PC running Windows and a Windows Ada compiler. To download Ada/Mindstorms programs to an RCX and test them, you need:1 Dave Baum's NQC system installed on your PC. It's available from http://www.enteract.com/-dbaum/nqc/index.html. If you're using AdaGIDE, the file nqc.exe executable needs to be in c:\gnatpro\bin so that AdaGIDE can find it. Otherwise it can be anywhere convenient.2 A Lego RCX brick pre-loaded with Mindstorms firmware.3 A Lego I/R transmitter hooked up to your PC's serial port. These come standard with the Lego Mindstorms Robotics Invention System.If you have already purchased a Lego Mindstorms Robotics Invention System, you don't need the CD/ROM and software that come with the it. Ada/Mindstorms is a separate programming environment, replacing the Mindstorms graphical programming tools with an Ada interface.
Banjo-Tooie
Authors: Prima Temp Authors, Mario De Govia, Donato Tica, Justin Berthelsen, Brandon Smith
Venue:  (2000)

:Banjo is back with his red-feathered sidekick, Kazooie, for the much-anticipated 3D action-adventure sequel, Banjo-Tooie. Right from the start, this second adventure for the plucky pair is jammed to the gills with more of everything! Banjo-Tooie: Prima's Official Strategy Guide shows players the way with:Awesome 3D maps of all nine worldsFun strategies for all minigames and puzzlesDetails of all transformations and movesMultiplayer strategiesSecrets for defeating all bosses, including the resurrected GruntildaIn-depth map guide for each world showing all jiggies, jinjos, Pages, and more
The Internet for Physicians, 2nd edition
Authors: Roger Perry Smith, Margaret J. Edwards
Venue:  (1999)

:In conversational, concise language with a dose of good humor, the authors describe how the Internet is of use to the physician in practice, how to best employ its various tools, and what hardware and software is required to log on. Building on the first edition, the second edition provides comprehensive coverage of Internet basics for the beginner while also addressing more advanced issues in several all-new chapters.
On a method for solving an integral equation in the displacement contact problem
Authors: M. A. Abdou, A. A. Badr
Venue: Applied Mathematics and Computation (2002)

In this paper, the solution, in a series form, of the integral equation of the mixed type in the space L(Ω) × C[0,T] is obtained, where Ω= {(x,y,z):-∞ > x,y > ∞,-∞ > z > 0} and the time t ∈ [0, T], 0 ≤ t ≤ T > ∞. The existence and the uniqueness of the solution of the integral equation is considered. The solution of the integral equation in a series form is obtained and the convergence is discussed.
Episturmian words and episturmian morphisms
Authors: Jacques Justin, Giuseppe Pirillo
Venue: Theoretical Computer Science (2002)

Infinite episturmian words are a generalization of Sturmian words which includes the Arnoux-Rauzy sequences. We continue their study and that of episturmian morphisms, begun previously, in relation with the action of the shift operator. Palindromic and periodic factors of these words are described. We consider, in particular, the case where these words are generated by morphisms and introduce then a notion of intercept generalizing that of Sturmian words. Finally, we prove that the frequencies of the factors in a strong sense do exist for all episturmian words.
Advanced Domino 5 Web Programming with Cdrom
Authors: Rose M. Kelleher, Thomas Jones
Venue:  (1998)

:Master Domino's capabilities and overcome its limitations; apply forms, views, and navigators; interface Domino with Java, relational databases, and CGI environment variables; add HTML passthrough, special-purpose forms, and agents; help users perform complex queries; program cookies, anchors, frames, and other finishing touches; and use thoroughly tested samples, examples, and expert quick tips. Perfect for Domino web developers, including the most demanding and experienced professionals.
E-Commerce: Business. Technology. Society., 1st edition
Authors: Kenneth C. Laudon, Carol Guercio Traver
Venue:  (2001)

:B> E-Commerce: Concepts and Issues provides an overview of the current and next generations of e-commerce. The book emphasizes the three major driving forces behind e-commerce: technology change, business development, and social controversies. Each of these driving forces is represented in every chapter, and together they provide a coherent conceptual framework for understanding e-commerce. The result is sophisticated conceptual treatment of a very diverse subject that is aimed specifically at readers interested in business concepts, IS/IT developments, and computer science applications. It is written by an author team with extensive teaching, writing, and business experience. This book offers in-depth coverage of concepts in technology, the Internet, economics, marketing, IS/IT, accounting, privacy, intellectual property, equity, and governance. Its unifying conceptual framework built around the themes of business, technology, and society helps readers make sense out of the development of this field. The book presents numerous real-world examples in every chapter. An attractive full-color design is also featured. This book is aimed specifically at readers interested in business concepts, IS/IT developments, and computer science applications of e-commerce.
Practical Data Analysis Volume 1, 2nd edition
Authors: Peter G. Bryant, Smith Bryant
Venue:  (1998)

:Practical Data Analysis: Case Studies in Business Statistics is a collection of 75 class tested case studies for use in introductory business statistics and general statistics. All cases are drawn from real situations in a broad range of business,economic,and social science settings and include small and large data sets for analysis by students. The philosophy behind the package is to let the cases and data drive or supplement the course. Doing so provides three important opportunities for students and instructors: useful computing experience,hands-on activity,which is more motivating than the traditional course format,and a sense of realism about the use of statistics.
Implicit instead of the explicit copy command
Authors: F. H. D. van Batenburg
Venue: ACM SIGAPL APL Quote Quad (1985)

If one prefers to include all required programs together in one workspace, the necessary programs could, as usual, be retrieved from other workspaces by the explicit copy command and stored together in the same workspace. However, there are a number of reasons why one would like to have some necessary programs or variables residing in their original workspace. Therefore a useful enhancement in order to use those objects in their original position would be the implicit copy where a qualified name is used in the header. This qualified name is the pure name preceded by its workspace library reference. The result should be the creation of a temporary local environment, followed by a copy of that object from the referred workspace.
Dual contouring of hermite data
Authors: Tao Ju, Frank Losasso, Scott Schaefer, Joe Warren
Venue: ACM Transactions on Graphics (TOG) (2002)

This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (i.e; exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. Using a new, numerically stable representation for quadratic error functions, we develop an octree-based method for simplifying contours produced by this method. We next extend our contouring method to these simpli&pound;ed octrees. This new method imposes no constraints on the octree (such as being a restricted octree) and requires no "crack patching". We conclude with a simple test for preserving the topology of the contour during simplification.
Advantage Series: Office XP Vol I, 1st edition
Authors: Sarah E. Hutchinson-Clifford, Glen Coulthard
Venue:  (2001)

:The Advantage Series presents the Feature-Method-Practice approach to computer software applications to today's technology and business students. This series implements an efficient and effective learning model,which enhances critical thinking skills and provides students and faculty with complete application coverage.
Optimal Control of the Sterilization of Prepackaged Food
Authors: D. Kleis, E. W. Sachs
Venue: SIAM Journal on Optimization (1999)

To model the process of sterilization by heating in the food industry, we derive an optimal control problem with state and control constraints governed by a nonlinear heat equation. A discretized form of the problem can then be expressed as a large-scale continuous optimization problem and solved by a special sequential quadratic programming method. The model provides useful insights---for example, when maximizing the retention of vitamins, the computed optimal control differs from the one typically used in industry---and can be generalized.
Statistical Image Object Recognition using Mixture Densities
Authors: Jörg Dahmen, Daniel Keysers, Hermann Ney, Mark Oliver Güld
Venue: Journal of Mathematical Imaging and Vision (2001)

In this paper, we present a mixture density based approach to invariant image object recognition. To allow for a reliable estimation of the mixture parameters, the dimensionality of the feature space is optionally reduced by applying a robust variant of linear discriminant analysis. Invariance to affine transformations is achieved by incorporating invariant distance measures such as tangent distance. We propose an approach to estimating covariance matrices with respect to image variabilities as well as a new approach to combined classification, called the virtual test sample method. Application of the proposed classifier to the well known US Postal Service handwritten digits recognition task (USPS) yields an excellent error rate of 2.2%. We also propose a simple, but effective approach to compensate for local image transformations, which significantly increases the performance of tangent distance on a database of 1,617 medical radiographs taken from clinical daily routine.
Mod-PERL Pocket Reference: Extending Apache
Authors: Andrew Ford
Venue:  (2000)

:mod_perl integrates the complete Perl interpreter with the Apache web server. With mod_perl, programmers can take existing Perl CGI scripts and plug them in, usually without making any source code changes. The scripts will run exactly as before but many times faster. In addition, mod_perl offers a Perl interface to the Apache API, allowing full access to Apache internals, so that programmers can control every aspect of the Apache server. mod_perl Pocket Reference is a concise, conveniently formatted reference to all mod_perl features used in day-to-day mod_perl programming. This small book covers functions as well as configuration directives that help maximize the effectiveness of the mod_perl Apache module.
Loop-free snakes for highly irregular object shapes
Authors: Lilian Ji, Hong Yan
Venue: Pattern Recognition Letters (2002)

'Snakes' are an effective approach to image segmentation. However, self-looping is a common problem that can cause segmentation failure of snakes in the recovery of highly irregular object shapes, such as in long tube-like shapes, sharp corners or deep concave/convex shapes. This paper introduces the notion of loop-free snakes that can quickly and effectively remove all self-loops during their evolution, consistently deforming and conforming to complicated shapes of target objects. The proposed snakes are less sensitive to their initial contour condition, are resilient to their inconsistent parameter settings in a Certain degree and require low computing cost in terms of both computation time and storage. Experiments are conducted to segment real images with encouraging results.
More Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition
Authors: Jesse L. Barlow
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

Bidiagonal reduction is the preliminary stage for the fastest stable algorithms for computing the singular value decomposition (SVD) now available. However, the best-known error bounds on bidiagonal reduction methods on any matrix are of the form \[ A + \delta A = UBV^T , \] \[ \|\delta A\|_2 \leq \varepsilon_M f(m,n) \|A\|_2, \] where B is bidiagonal, U and V are orthogonal, $\varepsilon_M$ is machine precision, and f(m,n) is a modestly growing function of the dimensions of A.A preprocessing technique analyzed by Higham [Linear Algebra Appl., 309 (2000), pp. 153--174] uses orthogonal factorization with column pivoting to obtain the factorization \[ A=Q \left( \begin{array}{c} C^T \\ 0 \end{array} \right) P^T, \] where Q is orthogonal, C is lower triangular, and P is permutation matrix. Bidiagonal reduction is applied to the resulting matrix C.To do that reduction, a new Givens-based bidiagonalization algorithm is proposed that produces a bidiagonal matrix B that satisfies $C + \delta C = U (B + \delta B ) V^T$ where $\delta B$ is bounded componentwise and $\delta C$ satisfies a columnwise bound (based upon the growth of the lower right corner of C) with U and V orthogonal to nearly working precision. Once we have that reduction, there is a good menu of algorithms that obtain the singular values of the bidiagonal matrix B to relative accuracy, thus obtaining an SVD of C that can be much more accurate than that obtained from standard bidiagonal reduction procedures. The additional operations required over the standard bidiagonal reduction algorithm of Golub and Kahan [J. Soc. Indust. Appl. Math. Ser. B Numer. Anal., 2 (1965), pp. 205--224] are those for using Givens rotations instead of Householder transformations to compute the matrix V, and 2n3/3 flops to compute column norms.
Stochastic properties of the random waypoint mobility model: epoch length, direction distribution, and cell change rate
Authors: Christian Bettstetter, Hannes Hartenstein, Xavier Pérez-Costa
Venue: Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems (2002)

The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. In this paper, we present analytical derivations of some fundamental stochastic properties of this model with respect to: (a) the length and duration of a movement epoch, (b) the chosen direction angle at the beginning of a movement epoch, and (c) the cell change rate of the random waypoint mobility model when used within the context of cellular networks. Our results and methods can be used to compare the random waypoint model with other mobility models. The results on the movement epoch duration as well as on the cell change rate enable us to make a statement about the 'degree of mobility' of a certain simulation scenario. The direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.
An Atlas of Edge-Reversal Dynamics, 1st edition
Authors: Valmir C. Barbosa
Venue:  (2000)

:An atlas of edge-reversal dynamics is the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal), a powerful distributed mechanism for scheduling agents in a computer system. The study of SER draws on strong motivation from several areas of application, and reveals very clearly the emergence of complex dynamic behavior from very simple transition rules. As such, SER provides the opportunity for the study of complex graph dynamics that can be applied to computer science, optimization, artificial intelligence, networks of automata, and other complex systems." "Readership: An atlas of edge-reversal dynamics provides an outstanding reference for researchers and graduate students in graph theory, discrete mathematics, and complex systems.
Model Generation in Electronic Design
Authors: Jean-Michel Berge
Venue:  (1995)

:Model Generation in Electronic Design describes many of the activities currently taking place in the electronic modeling domain. This volume covers a wide-range of model application, research use and disciplines all of which will be of interest to users, vendors, model producers and researchers. Model Generation in Electronic Design begins by describing a model generator to create component models. After this introduction the volume focuses on ASIC design and ASIC library generation. This includes chapters on the requirements for developing an ASIC library, a case study of using VITAL to create an ASIC library and the analysis and description of the accuracy required in modeling interconnections in ASIC design. Other chapters describe the development of thermal models for electronic devices, the development of a set of model packages for VHDL floating point operations, a technique for model validation and verification and a tool for model encryption. Model Generation in Electronic Design is the essential update for technical managers, designers, and researchers working in electronic design.
Visual Basic Shell Programming
Authors: J.P. P. Hamilton
Venue:  (2000)

:While Visual Basic provides an outstanding set of resources for rapidly developing standalone applications,it lacks the resources that allow you to integrate that application or its data files with the Windows shell by adding such features as customized context menu handlers, per instance icons (such as a data file icon that's based on the contents of the file), or customized property sheets. Typically, these shell extensions that closely integrate an application with the Windows shell are written in C++, and all of the available documentation focuses on using C++ to create shell extensions. Even C++ programmers, however, have difficulty doing so, in view of the woefully inadequate state of the documentation. Very few programmers know that writing shell extensions is not tied to a single language or development environment, and that Visual Basic is an excellent tool for creating shell extensions that more closely tie an application to the Windows shell. That, however, is precisely the focus of Visual Basic Shell Programming: to show you how to take advantage of shell services to develop the shell extensions that allow you to closely integrate your application with the Windows shell, and to provide the basic documentation that you need to accomplish this. Each major type of shell extension is covered, including: Context menu handlers that can add items to the popup menu that appears when the user right clicks a file. Icon handlers for displaying per instance icons that, like the standard Recycle Bin icon, vary depending on some condition Property sheet pages, which appear when the user selects the Properties option from a file's context menu. InfoTip handlers, which display tooltips, or "info" tips for a file object on a per instance basis. In showing how to integrate your applications with the Windows shell by building shell extensions, author J.P. Hamilton also provides a concrete tutorial on COM programming with Visual Basic. While developing your own shell extensions, you'll encounter a number of advanced VB concepts and techniques: Pointers. Since VB tends to hides pointers from the programmer, Hamilton shows how to take advantage of the undocumented VarPtr, StrPtr, and ObjPtr functions, as well as the Win32 RtlMoveMemory function. Using class identifiers (CLSIDs) from Visual Basic. VTable modification, which allows you to override the fact that Visual Basic prevents you from controlling the HRESULT (or status code) returned by a call to a COM method. Visual Basic Shell Programming ventures where none have gone before by showing you how to develop shell extensions while providing an advanced treatment of COM programming with Visual Basic.
Publisher 2000 Fast & Easy, 1st edition
Authors: Diane Koers, Paul Marchesseault
Venue:  (1999)

:Relax. Learning Microsoft Publisher 2000 is now a breeze. You're holding a book dedicated to one simple idea: To help you accomplish your tasks as quickly and easily as possible. No need to wade through endless pages of boring text. With Prima Tech's bestselling fast & easy series, you simply look and learn.
Client/Server Computing for Dummies, 3rd edition
Authors: Doug Lowe, David Helda
Venue:  (1998)

:What is client/server computing, and do we still need it? How will intranets, the Internet, and network PCs affect the future of this important corporate computing model? Get answers to these and many other questions in Client/Server Computing For Dummies, 2nd Edition. You'll find friendly explanations of client/server technology, what it can do for your company, and how you can adapt it for corporate intranets and World Wide Web surfing. Inside, find helpful advice on how to Discover what client/server computing can do for you with updates on the latest client/server development tools Understand important networking basics Demystify the jargon and get up to speed on ERDs, groupware, OOP, and Java Identify the fundamental components of client/server systems, such as client computers, server computers, graphical user interfaces, and local area networks Save money by controlling the hidden costs of client/server computing Recognize the role of standard query language (SQL) and relational databases in client/server computing Envision changes in client/server computing brought about by intranets, network computers, and Java Uncover a complete manager's guide to maintaining client/server systems Plus, Doug's Top Ten Lists: Ten client/server commandments Ten client/server acronyms decoded Ten client/server standards
Web classification using support vector machine
Authors: Aixin Sun, Ee-Peng Lim, Wee-Keong Ng
Venue: Proceedings of the 4th international workshop on Web information and data management (2002)

In web classification, web pages from one or more web sites are assigned to pre-defined categories according to their content. Since web pages are more than just plain text documents, web classification methods have to consider using other context features of web pages, such as hyperlinks and HTML tags. In this paper, we propose the use of Support Vector Machine (SVM) classifiers to classify web pages using both their text and context feature sets. We have experimented our web classification method on the WebKB data set. Compared with earlier Foil-Pilfs method on the same data set, our method has been shown to perform very well. We have also shown that the use of context features especially hyperlinks can improve the classification performance significantly.