ppxscal/embedding_network huggingface dataset:
CubeExplorer: online exploration of data cubes
Authors: Jiawei Han, Jianyong Wang, Guozhu Dong, Jian Pei, Ke Wang
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Data cube enables fast online analysis of large data repositories which is attractive in many applications. Although there are several kinds of available cube-based OLAP products, users may still encounter challenges on effectiveness and efficiency in the exploration of large data cubes due to the huge computation space as well as the huge observation space in a data cube. CubeExplorer is an integrated environment for online exploration of data cubes. It integrates our newly developed techniques on iceberg cube computation [2], cube-based feature extraction, and gradient analysis [1], and makes cube exploration effective and efficient. In this demo, we will show the features of CubeExplorer, especially its power and flexibility at exploring and mining of large databases.
MCSE TestPrep: Windows NT Server 4 Enterprise, 1st edition
Authors: Jay Forlini, Emmett Dulaney, Brian Komar
Venue:  (1997)

:The MCSE TestPrep series is a unique way of preparing for MCSE exams. The book is divided into 9 chapters. Each chapter covers a different exam objective. Each objective is further broken down into manageable sections. The information will be presented in a brief, outline format and will include an abundance of tables, figures, screen shots, and lists. Following each section will be a series of review questions, exercises, and answer explanations. Two complete practice exams and a glossary will be located at the end of the book.Includes only the ESSENTIAL information needed organized like the successful Test Prep tools created by ARCO.PRACTICE, PRACTICE, PRACTICE rather than read pages of text everything written in concise chunks.Learn insider tips and notes from a distinguished team of MCSEs and Microsoft Certified Trainers.
Networking CS: beyond the first course
Authors: Joseph D. Sloan, Andy Lopez, Randy K. Smith, Dick Mowe
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

We face a need for undergraduate instruction in networking and telecommunications. The Computing Research Association has identified both web-specialists and network-designers as being among the seven occupations where there is a clearly established shortage of professionals [2]. Even with the recent softening of the economy, individuals in the networking and telecommunications field are highly sought after as attested to by surveys such as RHIConsulting's&reg; recent survey of 1400 CIOs nationwide [4]. It is imperative to ask how these individuals will be educated.Historically, telecommunications has been hardware oriented. Consequently, it has been in the domain of Electrical Engineering. The ongoing convergence of communications and computing, however, has drastically shifted the focus of telecommunications and considerably broadened the field. Many of the new areas of telecommunications will not fit neatly into old categories. Some are much closer to Computer Science than Electrical Engineering.Schools wishing to address this need must begin by deciding what should be taught. For two-year schools, the ACM has issued guidelines for several programs [1]. For four-year institutions, the curriculum remains an open question. The primary guidelines for four-year institutions are the dated 1991 Computing Curricula [5] and the emerging Computing Curricula 2001 Computer Science [3]. As the goal of these documents is to define the core needs of the CS discipline, understandably, neither goes beyond outlining an introductory course in networking. Schools interesting in educating professionals in networking and telecommunications will need to go beyond this first course. A key question would seem, then, in teaching networking, what should be taught beyond the first course?Our panel presents three quite different positions---that the basic need can be met with a single well-designed course, that a few advanced courses will meet the need, and that a collection of courses constituting a minor is called for.
Enhancing support and learning services for instructors and students who engage in course-related multimedia and web projects
Authors: Sheree Kornkven, Nancy Lilleberg
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

In this paper, we describe a project called SPONGE that was initiated by IT staff at NDSU in response to a growing need for enhanced support and learning services for instructors and their students who engage in multimedia and Web projects. Until SPONGE, instructors and students received project assistance from three separate IT service areas: the Technology Learning Center, the Service Center/Multimedia Area, and Custom Media Services. IT staff identified the need for a communication "bridge" and a "learning link" between the instructors and the three service areas for project planning and developing/coordinating support and learning services. IT staff proposed an initiative that would require some reorganizing. The plan called for hiring Media Assistants, student employees who would possess skills in multimedia and/or Web technologies and graphic design. Instructors would be invited to meet each semester with IT service providers to plan projects, identify needs, and coordinate support. A SPONGE Web site would provide resources for students, instructors, and IT service providers. Positive outcomes of the SPONGE initiative include: improved communication between IT service providers, instructors, and students; better utilization of existing services; proactive project planning; and enhanced multimedia and Web development support and learning opportunities. This plan was funded by student technology fees in Spring 2002.
Tensor Methods for Equality Constrained Optimization
Authors: Dan Feng, Robert B. Schnabel
Venue: SIAM Journal on Optimization (1996)

This paper introduces tensor methods for nonlinear equality constrained optimization problems. These are general purpose methods intended especially for problems where the constraint gradient matrix at the solution is rank deficient or ill conditioned. The new methods are adapted from the standard successive quadratic programming method by augmenting the linear model of the constraints with a simple second-order term. The second-order term is selected so that the model of the constraints interpolates constraint function values from one or more previous iterations, as well as the current constraint function value and gradients. Similar to tensor methods for nonlinear equations, the tensor methods for constrained optimization require no more function and derivative evaluations, and hardly more storage or arithmetic per iteration, than the standard SQP methods. Test results indicate that the tensor methods are more efficient than SQP methods on singular and nonsingular nonlinear equality constrained optimization problems, with a particularly large advantage on singular problems.
Problem Solving and Program Design ADA, 2nd edition
Authors: Michael B. Feldman, Elliot B. Koffman
Venue:  (1995)

:Students with little or no prior programming experience will begin to explore programming in this powerful, yet flexible language ideal for large-scale software system development. Adopted as a standard by the ISO and the ANSI, Ada 95 is the first fully object-oriented programming language to be internationally standardized. While presenting a balanced mixture of modern programming concepts and Ada 95 language capabilities, this text provides a solid programming foundation. Highlights: Emphasizes "object thinking" by introducing object-based and object-oriented programming concepts throughout the book; presents encapsulated designs from the beginning to stress the importance of reusability of function, packages, and procedures; introduces control structures, data structures, and system (encapsulation) structures in parallel throughout the book; presents [about 200] complete, compilable, executable programs followed immediately by sample output; and helps students build on concepts with a continuing project, "spider graphics," recurring throughout the book.
Sams Teach Yourself Palm Programming in 24 Hours with Cdrom, 1st edition
Authors: Gavin Maxwell, Brad Jones, Matt Purcell
Venue:  (1999)

:Sams Teach Yourself Palm Programming in 24 Hours is a step-by-step tutorial that teaches you how to create fully functioning Palm applications using a variety of end-user and development tools. A variety of methods requiring different levels of programming are covered. Learn several different methods for customizing your Palm or Palm-compatible PDA. Topics include: Understanding the Palm OS Architecture, Event-Driven Programming, Palm User Interfaces, Desktop verses Conduit, Managing Memory and Storing Data, Programming with Satellite Forms, Programming with PenDragon, Programming CbasPad, Programming with CodeWarrior, and the Palm OS API.
Review of Data Structures and Algorithms in Java (2nd ed): Michael T Goodrich and Roberto Tamassia
Authors: Hassan Masum
Venue: ACM SIGACT News (2001)

Data Structures is a first book on algorithms and data structures, using an object- oriented approach. The target audience for the book is a second-year CS class introducing fundamental data structures and their associated algorithms. This second edition of the book has been corrected and revised, and is a substantial improvement over the first edition. A companion web site contains useful ancillary tools, including an excellent set of slides.Despite several minor errors and some questionable stylistic choices, I found this version of the book to be well-written. The problem sets are large, interesting, and thought-stimulating. In several places connections are drawn between the algorithm being discussed and important contemporary real-world problems (e.g. search engines, DNA sequence comparison, garbage collection), which students usually appreciate.
Getting access to what goes on in people's heads?: reflections on the think-aloud technique
Authors: Janni Nielsen, Torkil Clemmensen, Carsten Yssing
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

One of the basic usability testing techniques the HCI community draws on, and which stands out as unique, is thinking aloud. We introduce the many names, uses and modifications of the classical think aloud technique, and ask the rhetorical question: What do researchers think they get when they ask people to think aloud? We answer it by discussing the classical work of Ericsson and Simon(1984), in particular their distinction between vocalisation, verbalisation and retrospective reports and the relation to short term memory. Reintroducing the psychological perspective and the focus on higher order cognitive processes, we argue that access to subjective experience is possible in terms of introspection and describe a technique that invites the user to become a participant in the analysis of his or her own cognitive processes. We suggest that use of think aloud has as a prerequisite explicit descriptions of design, test procedure and framework for analysis. We point out, however, that if the aim is to get access to human thinking, HCI research may benefit from experimental research.
Differential Equations with Mathematica, 1st edition
Authors: Ronald L. Lipsman, Kevin R. Coombes
Venue:  (1994)

:Designed to supplement an ordinary differential equations textbook, this book focuses on the features of Mathematica that are useful for analyzing differential equations to deepen the reader's understanding.
Graph-theoretic procedures for dimension identification
Authors: María R. Brito, Adolfo J. Quiroz, J. E. Yukich
Venue: Journal of Multivariate Analysis (2002)

We consider the problem of identifying the dimension in which a sample of data points lives, when only their interpoint distances are known. We study as a random variable the average "reach" of vertices in the k-nearest-neighbors graph associated to the interpoint distance matrix, and we show how this variable can be used to accurately (from a probabilistic viewpoint) identify the unknown dimension at low computational cost. We discuss results that serve as the theoretical foundation for the methodology proposed. We illustrate how our method can help in dimension reduction procedures.
Just the Tips, Man for Microsoft Word 2000
Authors: Bob Flisser, Wendy Richardson
Venue:  (2001)

:Want to get faster on the computer? Save time at work? Impress your boss, your friends, and maybe even your kids? Then you want Just the tips, man for Microsoft Word 2000, the desktop flip book that teaches you over 500 hundred of the shortest cuts and the neatest tricks that none of those heavier, more expensive manuals dare to cover. You'll get easy tips, cool tips, and even tough tips, and you'll have fun in the process. It's the first in a series of titles from Nerdy Books aimed at saving you time and making you more efficient on the computer.
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
Authors: Elijah Polak, Liqun Qi, Defeng Sun
Venue: SIAM Journal on Optimization (2000)

We present two second-order algorithms, one for solving a class of finite generalized min-max problems and one for solving semi-infinite generalized min-max problems. Our algorithms make use of optimality functions based on second-order approximations to the cost function and of corresponding search direction functions. Under reasonable assumptions we prove that both of these algorithms converge Q-superlinearly, with rate at least 3/2.This paper is a continuation of [E. Polak, L. Qi, and D. Sun, Comput. Optim. Appl., 13 (1999), pp. 137--161].
Neural Smithing: Supervised Learning in Feedforward Artificial Neural Networks
Authors: Russell D. Reed, Robert J. Marks
Venue:  (1998)

:Artificial neural networks are nonlinear mapping systems whose structure is loosely based on principles observed in the nervous systems of humans and animals. The basic idea is that massive systems of simple units linked together in appropriate ways can generate many complex and interesting behaviors. This book focuses on the subset of feedforward artificial neural networks called multilayer perceptions (MLP). These are the most widely used neural networks, with applications as diverse as finance (forecasting), manufacturing (process control), and science (speech and image recognition). This book presents an extensive and practical overview of almost every aspect of MLP methodology, progressing from an initial discussion of what MLPs are and how they might be used to an in-depth examination of technical factors affecting performance. The book can be used as a tool kit by readers interested in applying networks to specific problems, yet it also presents theory and references outlining the last ten years of MLP research.
PowerPoint 2000!: I Didn't Know You Could Do That... with Cdrom
Authors: Michael Miller
Venue:  (2000)

:PowerPoint is the de facto standard for presentation software in virtually every office in corporate America. This latest offering in the best-selling I Didn't Know You Could Do That series is for all PowerPoint 2000 users who want to make their presentations stand out from the crowd. This is the only book completely focused on the instruction, advice, tips, and secrets that help to turn average presentations into great presentations. The CD is jam-packed with valuable templates, plug-ins, and toolsusers can say goodbye to the boring, out-of-the-box, generic designs and effects and start creating presentations that impress. 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
A new hybrid broadcast scheduling algorithm for asymmetric communication systems
Authors: Yufei Guo, M. Cristina Pinotti, Sajal K. Das
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2001)

It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient individually. We propose a novel hybrid scheduling algorithm which uses both pull- and push-based schemes. In our approach, data items are divided, by a suitable cut-off point, into two disjoint sets: one consisting of more-popular items and the other of less-popular items. The items in the former set are broadcast by a push-based schedule, while those in the latter set by a pull-based schedule. A cut-off point is said to be optimal when it minimizes the expected access time in the system. The optimal cut-off point is derived analytically and validated by simulation experiments. Results show that the proposed hybrid push- and pull-based scheduling performs always better than a pure push-based scheduling and improves on the expected access time of an existing hybrid scheduling scheme.
SQL Server 2000 Stored Procedure Programming
Authors: Dejan Sunderic, Tom Woodhead
Venue:  (2002)

:"Tired of pubs and Northwind? Tired of books that just lie there? This book will engage you interactively with its sample Asset tracking database and end-of-chapter exercises. You'll learn by doing. "Karen Watterson,Editor,Pinnacle Publishing's SQL Server Professional"Finally! This book dedicated to T-SQL Stored Procedure development is long overdue. . . a must have for the developer who is serious about creating powerful and scalable SQL Server 2000 architectures. "Ed Musters,Chief Technology Officer,Sage Information Consultants,Inc. Design,deploy,and manage stored procedures in enterprise data applications SQL Server 2000 Stored Procedure Programming shows you how to use Transact-SQL to design,debug,and manage custom stored procedures,functions,and triggers. You'll learn to manage SQL Server resources using new features of Enterprise Manager,Query analyzer,Visual Basic,and Visual Studio,implement robust error handling,and establish the professional habits you need to become an expert SQL Server developer. This guide contains simple explanations for developers who are just starting to work with stored procedures and advanced recommendations and techniques for experienced DBAs. SQL Server stored procedures and advanced recommendations and techniques for experienced DBAs. SQL Server experts provide concise explanations,design recommendations,many examples,and a real-world case study. Design user-defined,system,temporary,global temporary,extended,remote,and nested stored proceduresAdopt tips and tricks using identity,timestamp,sql_variant,uniqueidentifier,optimistic locking,dynamically constructed queries,temporary tables,andcursorsWrite code to interact with COM,mai,executables,the Registry,jobs,and securityManage application securityLocate and fix semantic errors using TSQL Debugger in Query Analyzer,Visual Basic,or Visual Studio,and using manual debugging techniquesCreate user-defined,table-valued,and in-line functionsDesign instead-of triggers and after triggersManage transactions and locksDevelop dynamic,Web-based applications using SQL Server's XML capabilities
Towards heterogeneous agent teams
Authors: Milind Tambe, David V. Pynadath
Venue: Mutli-agents systems and applications (2001)

Agent integration architectures enable a heterogeneous, distributed set of agents to work together to address problems of greater complexity than those addressed by the individual agents themselves. Unfortunately, integrating software agents and humans to perform real-world tasks in a large-scale system remains difficult, especially due to two key challenges: ensuring robust execution in the face of a dynamic environment and providing abstract task specifications without all the low-level coordination details. To address these challenges, our Teamcore project provides the integration architecture with general-purpose teamwork coordination capabilities. We make each agent team-ready by providing it with a proxy capable of general teamwork reasoning. Thus, a key novelty and strength of our framework is that powerful teamwork capabilities are built into its foundations by providing the proxies themselves with a teamwork model called STEAM. While STEAM has earlier been demonstrated in domains involving homogeneous agent teams, its use in Teamcore proxies illustrates that teamwork models may also be applied in domains involving heterogeneous agents. Given STEAM, the Teamcore proxies addresses the first agent integration challenge, robust execution, by automatically generating the required coordination actions for the agents they represent. We can also exploit the proxies' reusable general teamwork knowledge to address the second agent integration challenge. Through team-oriented programming, a developer specifies a hierarchical organization and its goals and plans, abstracting away from coordination details. Our integration architecture enables teamwork among agents with no coordination capabilities, and it establishes and automates consistent teamwork among agents with some coordination capabilities. We illustrate how the Teamcore architecture successfully addressed the challenges of agent integration in two application domains: simulated rehearsal of a military evacuation mission and facilitation of human collaboration.
Microsoft Host Integration Server 2000 Resource Kit
Authors: William Harding
Venue:  (2000)

:Simplify integration of heterogenous systems with essential reference materials, tools, and utilities. Integrating systems from different vendors can be complicated. Microsoft Host Integration Server 2000 Resource Kit simplifies the process and reduces deployment time by delivering up-to-date information and software tools for anyone who needs to integrate disparate systems. The RESOURCE KIT provides comprehensive documentation of Microsoft Host Integration Server 2000 features and inside information-direct from the product development team-on how to fully take advantage of this server's capabilities. It also brings together a wealth of technical information and tools to simplify integration of the Microsoft Windows' 2000 operating system with disparate applications, data, and networks from a variety of vendors. Get up to speed with all the details you need on these topics: Product overview: Learn about Host Integration Server 2000 features and technologies for application, data, and network integration. Planning: Discover basic planning issues, how to select services and hardware, models for deployment, and architectural and server roles to consider. Deployment and management: Find out how to deploy and manage SNA Services, COM Transaction Integrator (COMTI) for application integration, the Microsoft Message Queuing (MSMQ) and MQSeries bridge, data integration services (OLE DB Providers and ODBC Drivers), 3270 and 5250 terminal emulation and connectivity, advanced program-to-program communication (APPC) protocol applications, and host printing. Performance-tuning and optimization: Familiarize yourself with strategies for getting the best performance out of all major Host Integration Server 2000 services and features. Troubleshooting: See how to verify and resolve problems with server-to-mainframe communications, access to specific applications, and peer-to-peer, server-to-server, and client-to-host communications problems using the trace utility. Other resources: Get complete listings of Host Integration Server 2000 error messages, configuration worksheets, and special setup considerations.