ppxscal/embedding_network huggingface dataset:
Windows Visualization Programming with C/C++: 3d Visualization, Simulation, and Virtual Reality, 1st edition
Authors: Lee A. Adams
Venue:  (1993)

:Lee Adams, one of today's foremost authorities on animation programming, provides easy-to-follow tutorials for six sample applications. Over 600K of free source code on disk.Supports: QuickC for Windows, Turbo C++ for Windows, Borland C++, Watcom C, Microsoft C/C++, and Visual C++. 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
Osborne's NetWare 5 Administration Answers!
Authors: Billie Pierce, Mark Pierce
Venue:  (1999)

:Get this valuable, reader-friendly book and you'll get over 500 answers to all of your basic and advanced NetWare 5 questions, as well as hot tips and sound advice from Certified Novell Engineers Billie Pierce and Mark Pierce. You'll get full coverage of all the new NetWare 5 features such as Z.E.N.works, Novell Storage Services (NSS), Novell Distributed Print Services (NDPS), and much more.
Uml and the Unified Process: Practical Object-Oriented Analysis and Design, 1st edition
Authors: Jim Arlow, Ila Neustadt
Venue:  (2002)

:An accessible, practical guide to essentials of both UML and the Unified Process, aimed at the OO designer or analyst. This book is based around the author's training courses and gives the reader a quick, focused tour through the Object Oriented Analysis and Design process. It introduces and explains the need-to-know concepts and key elements of both UML (Unified Modelling Language) and the Unified Process. It will get the reader up to speed on successful techniques that he can immediately apply and use  the emphasis is on tips and tricks that really are useful from the point of view of the OO analyst and designer. The structure of the book aims to give the reader as clear and uncomplicated a guide as possible. It takes the reader through an introduction to UML, an introduction to the UP, then covers the basics of software Requirements and Use Case modelling. The key aspects of the analysis and design stages are covered in step-by-step detail, finishing off with implementation.
Wired for wireless: extending your network and expanding your reach
Authors: Nathan L. Shane Byrer, Renee M. Jackson
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

In this paper, we will review the planning, creation and use of wireless technology in campus initiatives based on our campus wireless implementations and partnership at Indiana University - Purdue University Indianapolis (IUPUI). We will review experience gained and share tips to making large wireless projects successful.
Batch data warehouse maintenance in dynamic environments
Authors: Bin Liu, Songting Chen, Elke A. Rundensteiner
Venue: Proceedings of the eleventh international conference on Information and knowledge management (2002)

Data warehouse view maintenance is an important issue due to the growing use of warehouse technology for information integration and data analysis. Given the dynamic nature of modern distributed environments, both data updates and schema changes are likely to occur in different data sources. In applications that the real-time refreshment of data warehouse extent under source changes is not critical, the source updates are usually maintained in a batch fashion to reduce the maintenance overhead. However, most prior work can only deal with batch source data updates. In this paper, we provide a solution strategy that is capable of batching both source data updates and schema changes. We propose techniques to first preprocess the initial source updates to summarize delta changes for each source. We then design a view adaptation algorithm to adapt the warehouse view under these delta changes. We have implemented our solutions and incorporated into an existing data warehouse prototype system. The experimental studies demonstrate excellent performance achievable by our batch techniques.
Portability and Performance for Parallel Processing
Authors: A. J. Hey, J. Ferrante
Venue:  (1994)

:A portable high-performance program cannot be oblivious to the machine on which it runs. And yet unless software portability increases, parallel processing will remain too expensive to deliver its performance promises. Portability of software and performance of hardware and communication are the significant indicators of the success of parallelism in computing. And these two indicators are often in conflict. Bringing together in one volume different approaches to solving this tension will give insights to developers on both sides of the software/hardware divide, and provides a critical debate for those measuring, modelling and investing in high performance technology.
Survey and Review
Authors: Nick Trefethen
Venue: SIAM Review (2002)

What do these algorithms have in common? Conjugate gradients for Ax= b. Fast multipole methods for N-body interactions. Multigrid iteration for a discrete Poisson equation. Interior point methods for linear programming. The answer is that they are all infinite algorithms for finite problems. We could solve (1) by Gaussian elimination, (2) by adding up the pairwise forces, (3) by nested dissection, or (4) by the simplex method, and in each case we would get the exact answer, apart from rounding errors, in a finite number of steps. But it may be quicker to use methods that take an infinite number of steps! These algorithms are approximate and iterative, but they converge so fast that they are often the best way to solve large-scale problems if you want "only," say, 15 digits of accuracy. (1)--(4) and their relatives have changed scientific computing profoundly since the 1970s and 1980s. The following article by Forsgren, Gill, and Wright has its roots in (4). But once you depart from finite algorithms and embrace iteration, the finiteness of the underlying problem loses its importance: you gain robustness as well as speed. Suddenly linear programming is not so different from nonlinear, and the subject of this article is the huge subject of interior methods for nonlinear optimization that has blossomed since Karmarkar proposed his famous algorithm in 1984. The move to fast continuous algorithms has other aspects. Computer scientists have found that although a discrete combinatorial problem may be NP-hard if you want an exact solution, near-optimal solutions may be computable via continuous algorithms such as those reviewed here. The problem of finding large cuts in graphs, for example, can be solved in polynomial time if you'll settle for a cut that might be 13% smaller than the largest possible. Thus interior methods are playing a role in drawing together discrete and continuous applied mathematicians. SIAM Review draws mathematicians together too, and it has been a privilege to serve as Section Editor for four years. In January, I will be succeeded in this post by Randy LeVeque of the University of Washington.
Inferring domain-domain interactions from protein-protein interactions
Authors: Minghua Deng, Shipra Mehta, Fengzhu Sun, Ting Chen
Venue: Proceedings of the sixth annual international conference on Computational biology (2002)

Protein-protein interactions are important events in cellular and biochemical processes within a cell. Several researchers have undertaken the task of analyzing protein-protein interactions covering all genes of an organism by using yeast two-hybrid assays. Protein-protein interactions involve physical interactions between protein domains. Therefore, understanding protein interactions at the domain level gives a global view of the protein interaction network, and possibly extends functions of proteins. In this study, we present a Maximum Likelihood approach to infer domain-domain interactions from the 5719 yeast protein-protein interactions obtained in the high throughput two-hybrid experiments by Uetz et al., 2000 and Ito et al., 2001. The accuracies of our predictions are measured at the protein level. Our study includes the following three results: (1) using the inferred domain-domain interactions, we predict interactions between proteins and achieve 39.0% specificity and 79.7% sensitivity; (2) our predicted protein-protein interactions have a significant overlap with the MIPS(http://mips.gfs.de) protein-protein interactions obtained by methods other than the two-hybrid systems; and (3) the mean correlation coefficient of the gene expression profiles for our predicted interacting pairs is significantly higher than that for random pairs as well as that of interacting pairs in Uetz's and Ito's experimental data. Our method has shown robustness in analyzing incomplete data sets and dealing with various experimental errors. We find several novel protein-protein interactions such as RPS0A interacting with APG17 and TAF40 interacting with SPT3, which are consistent with the functions of the proteins.
Understanding the Virtual Organization, 1st edition
Authors: Bob Norton, Cathy Smith
Venue:  (1998)

:Here is an overview of emerging management techniques that create the virtual organization. Case studies and models highlight specific approaches for different kinds of business. Topics include:the internet, video conferencing, e-mail, and their possibilitiesstructuring a virtual organization and managing its personnelredefining job tasks to fit the office of tomorrowthe benefits and problems of the virtual office.
Finite element analysis of contaminant transport in groundwater
Authors: Tony W. H. Sheu, Y. H. Chen
Venue: Applied Mathematics and Computation (2002)

In this paper, we focus on the development of a finite element model for predicting the contaminant concentration governed by the advective dispersive equation. In this study, we take into account the first-order degradation of the contaminant to realistically model the transport phenomenon in groundwater. To solve the resulting unsteady advection-diffusion equation with production, a finite element model is constructed, which employs a quadratic basis function to approximate the contaminant concentration. The development of a weighted residuals finite element model involves constructing a biased test function to retain the scheme stability for wide ranges of values of the physical coefficients. In the process of constructing the Petrov-Galerkin finite element model for stability reasons, it is desirable to obtain an acceptable degree of accuracy. The method used to retain stability without loss of accuracy is to approximate the differential equation within the semi-discretization framework. After discretizing the time derivative term using the Euler time-stepping scheme, the resulting ordinary differential equation, which involves only the spatial derivative terms, is solved using the nodally exact finite element model. For better control of the user's specified time step and mesh size, full analysis of the discretization scheme is conducted. In this study, both modified equation analysis and Fourier stability analysis are employed to better understand the proposed semi-discretized Petrov-Galerkin finite element model. Validation of the newly proposed model is accomplished through analysis of the results obtained tbr several test problems. Some of them are amenable to analytic solutions. The rate of convergence of the employed finite element model then can be obtained.
CD-I Designers Guide
Authors: Signe Hoffos
Venue:  (1992)

:Aware that the Compact Disc Interactive will be one of the major forces of the 90s,this text is essential reading to understand and appreciate the technology. The information included in this text will provide specific production skills so that CD-I becomes a tool at your disposal. Starting with an overview of basic concepts such as interactivity,multimedia and compact disc,this text contains the most up-to-date information on the developing topic of CD-I. It gradually progresses to a detailed explanation of the specific technical skills required to produce CD-I programmes.
Haptics-based volumetric modeling using dynamic spline-based implicit functions
Authors: Jing Hua, Hong Qin
Venue: Proceedings of the 2002 IEEE symposium on Volume visualization and graphics (2002)

This paper systematically presents a novel haptics-based volumetric modeling framework, which is founded upon volumetric implicit functions and powerful physics-based modeling. The volumetric implicit functions incorporate hierarchical B-splines, CSG-based functional composition, and knot insertion to facilitate multiresolution editing and level of details (LODs) control. Our dynamic volumes are semi-algebraic sets of implicit functions and are governed by the principle of dynamics, hence responding to sculpting forces in a natural and predictive manner. The versatility of our volumetric modeling affords users to easily modify both the geometry and the topology of modeled objects, while the inherent physical properties can offer an intuitive mechanism for direct manipulation. Moreover, we augment our modeling environment with a natural haptic interface, in order to take advantage of the additional realism associated with 3D haptic interaction. Coupling physics and haptics with implicit functions can realize all the potentials exhibited by volumetric modeling, physics-based modeling, and haptic interface. Furthermore, in order to directly manipulate existing volumetric datasets as well as point clouds, we develop a hierarchical fitting algorithm to reconstruct and represent discrete datasets using our continuous implicit functions, which permit users to further design and edit those 3D models in real-time using a large variety of haptic toolkits and visualize their interactive deformation at arbitrary resolution.
Field of application
Venue: ACM SIGAPL APL Quote Quad (1983)

This International Standard applies to all programs and implementations that publicly claim conformance with it. This clause sets forth minimal requirements for behaviour and documentation for programs and implementations that claim to conform to this standard. 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
Fitting Equations to Data: Computer Analysis of Multifactor Data, 2nd edition
Authors: Cuthbert Daniel, Fred S. Wood
Venue:  (1999)

:Helps any serious data analyst with a computer to recognize the strengths and limitations of data, to test the assumptions implicit in the least squares methods used to fit the data, to select appropriate forms of the variables, to judge which combinations of variables are most influential, and to state the conditions under which the fitted equations are applicable. This edition includes numerous extensions and new devices such as component and component-plus-residual plots, cross verification with a second sample, and an index of required x-precision; also, the search for better subset equations is enlarged to cover 262,144 alternatives. The methods described have been applied in agricultural, environmental, management, marketing, medical, physical, and social sciences. Mathematics is kept to the level of college algebra.
Performance and Fault Management
Authors: Paul L. Maggiora, Elliott, Phelps, Gabrielle Della-Bescat, Thompson
Venue:  (2000)

:A comprehensive guide for designing and implementing effective strategies for network performance and managementDesign and implement performance and fault monitoring that will measure and report the effectiveness of your Cisco networkGenerate reports and alerts that provide network information and statusLearn to navigate Cisco's documentation and MIBs to determine which elements of a specific technology you should manageStudy the key aspects of systems and VLAN management of Cisco devicesDiscover best practices and related configurations for implementing network management on Cisco routers and switchesPerformance and Fault Management is a comprehensive guide to designing and implementing effective strategies for monitoring performance levels and correctng problems in Cisco networks. It provides an overview of router and LAN switch operations to help you understand how to manage such devices, as well as guidance on the essential MIBs, traps, syslog messages, and show commands for managing Cisco routers and switches.Written by a team of network management experts, this book details how to implement the practice of network management through documentation, process reviews, and network baselining. It explains various management commands, data, protocols, and resources in Cisco routers and switches. With this book, you will discover how to achieve optimum performance and fault management results on your Cisco network.
Interactive modeling system for bridges
Authors: S. Shore, J. L. Wilson, G. A. Semsarzadeh
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

The modeling system described in this paper was developed in conjunction with computer program called STACRB that was developed in the CURT research project at the University of Pennsylvania. In essence, the static behavior of horizontally curved and straight aligned bridge structures.The modeling system communicates with the user through a problem oriented language. The commands in this language allow the user to define the parameters that characterize the structure, modify an already completed for a structure. The commands are entered in free format and are executed interpretively, thus allowing the user to communicate with the system in a conversational mode. The user may also enter the command on punched cards and execute the routine as a non-conversational batch job. The modeling system can be used to either control the analysis or operate independently from it. In the former case, the modeling system synthesizes the structure, then calls on the STACRB program to analyze it. When the analysis is completed, the control is returned to the modeling system to interpret the results of the analysis according to the commands supplied by the user. In the latter case, the results from the modeling procedure alone are punched onto cards which may subsequently be inputted to the analysis routine.The modeling system also includes facilities for graphical displays of components of the designed structure such as structure geometry and element discretization or results of analysis such as nodal deflections, reactions and element stresses. The displays may be produced either on the line printer for conversational purposes or on a CALCOMP plotter.The overall increased efficiency introduced by the modeling system in the analysis/design cycle of a bridge structure is quite significant.
Large scale optimization and the relaxation method
Authors: Michael Held, Richard M. Karp, Philip Wolfe
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

An algorithm is given for the maximization of any function of many variables which may be described as the envelope of a family of linear functions. It is shown how the large-scale problems of linear programming to which various decomposition schemes apply can be posed in this way. Computational experience with some of these problems is reviewed.
Securing applications on Linux with PAM
Authors: Savio Fernandes, K. L. M. Reddy
Venue: Linux Journal (2002)

Make your new authentication technology work with Linux applications or add standards-based authentication to your new application.
Typed interpretations of extensible objects
Authors: Viviana Bono, Michele Bugliesi, Silvia Crafa
Venue: ACM Transactions on Computational Logic (TOCL) (2002)

Finding typed encodings of object-oriented into procedural or functional programming sheds light on the theoretical foundations of object-oriented languages and their specific typing constructs and techniques. This article describes a type preserving and computationally adequate interpretation of a full-fledged object calculus that supports message passing and constructs for object update and extension. The target theory is a higher-order &lambda;-calculus with records and recursive folds/unfolds, polymorphic and recursive types, and subtyping. The interpretation specializes to calculi of nonextensible objects, and validates the expected subtypin
Open runtime platform: flexibility with performance using interfaces
Authors: Michal Cierniak, Brian T. Lewis, James M. Stichnoth
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

According to conventional wisdom, interfaces provide flexibility at the cost of performance. Most high-performance Java virtual machines today tightly integrate their core virtual machines with their just-in-time compilers and garbage collectors to get the best performance. The Open Runtime Platform (ORP) is unusual in that it reconciles high performance with the extensive use of well-defined interfaces between its components. ORP was developed to support experiments in dynamic compilation, garbage collection, synchronization, and other technologies. To achieve this, two key interfaces were designed: one for garbage collection and another for just-in-time compilation. This paper describes some interesting features of these interfaces and discusses lessons learned in their use. One lesson we learned was to selectively expose small but frequently accessed data structures in our interfaces; this improves performance while minimizing the number of interface crossings.
Introduction to MATLAB 6, 1st edition
Authors: Delores M. Etter, David Kuncicky, Doug Hull
Venue:  (2001)

:Part of ESourcePrentice Hall's Engineering Source, this book provides a complete, flexible introduction to MATLAB 6. Featuring over 25 modules and growing, the ESource series provides a comprehensive resource of essential engineering topics. An Introduction to Engineering Problem Solving; Matlab Environment; Matlab Functions; Matrix Computations; Symbolic Mathematics; Numerical Techniques. For any Engineer or Computer Scientist interested in a brief introduction to a subject.
Maximum Windows 2000 Security
Authors: Anonymous, Chris Amaris
Venue:  (2001)

:Maximum Windows 2000 Security is designed for system administrators, managers, and Windows 2000 users who need to protect their Windows 2000 servers and workstations from unauthorized intrusions and other external threats to their system's integrity. Written by an experienced hacker and a team of security experts -- people who know which systems are vulnerable and how crackers get into them -- this unique guide to Windows 2000 security identifies existing and potential security holes and faults, and then describes how to go about fixing them. Anonymous is an experienced computer hacker who was convicted of a series of financial crimes after developing a technique to circumvent bank security in automatic teller machine systems. He now works as a writer, trainer, Internet and Unix site manager, and security consultant, and he is the author of the controversial bestseller, Maximum Security.
A Gradient Method Approach to Optimization-Based Multidisciplinary Simulations and Nonoverlapping Domain Decomposition Algorithms
Authors: Qiang Du, Max D. Gunzburger
Venue: SIAM Journal on Numerical Analysis (2000)

It has been shown recently that optimization-based nonoverlapping domain decomposition algorithms are connected to many well-known algorithms. Using a gradient-type iterative strategy for the optimization problem, we present further discussion on how to develop various algorithms that can integrate subdomain solvers into a solver for the problem in the whole domain. In particular, the algorithms we discuss can be used to develop efficient solvers of multidisciplinary problems which are constructed using existing subdomain solvers without the need for making changes in the latter.