ppxscal/embedding_network huggingface dataset:
ENO-Wavelet Transforms for Piecewise Smooth Functions
Authors: Tony F. Chan, H. M. Zhou
Venue: SIAM Journal on Numerical Analysis (2002)

We have designed an adaptive essentially nonoscillatory (ENO)-wavelet transform for approximating discontinuous functions without oscillations near the discontinuities. Our approach is to apply the main idea from ENO schemes for numerical shock capturing to standard wavelet transforms. The crucial point is that the wavelet coefficients are computed without differencing function values across jumps. However, we accomplish this in a different way than in the standard ENO schemes. Whereas in the standard ENO schemes the stencils are adaptively chosen, in the ENO-wavelet transforms we adaptively change the function and use the same uniform stencils. The ENO-wavelet transform retains the essential properties and advantages of standard wavelet transforms such as concentrating the energy to the low frequencies, obtaining maximum accuracy, maintained up to the discontinuities, and having a multiresolution framework and fast algorithms, all without any edge artifacts. We have obtained a rigorous approximation error bound which shows that the error in the ENO-wavelet approximation depends only on the size of the derivative of the function away from the discontinuities. We will show some numerical examples to illustrate this error estimate.
"The snatcher catcher": an interactive refrigerator
Authors: Jonas Lundberg, Aseel Ibrahim, David Jönsson, Sinna Lindquist, Pernilla Qvarfordt
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

In order to provoke a debate about the use of new technology, the Snatcher Catcher, an intrusive interactive refrigerator that keeps record of the items in it, was created. In this paper we present the fridge, and how we used it in a provocative installation. The results showed that the audience was provoked, and that few people wanted to have the fridge in their surroundings.
Quick Course in PowerPoint 4 for Windows
Authors: Joyce Cox, Polly Urban
Venue:  (1997)

:Focusing on PowerPoint 4 for Windows, this is one of a series of computer-training books for people with busy schedules.
Dynkin Games via Dirichlet Forms and Singular Control of One-Dimensional Diffusions
Authors: Masatoshi Fukushima, Michael Taksar
Venue: SIAM Journal on Control and Optimization (2002)

We consider a zero-sum game of optimal stopping in which each of the opponents has the right to stop a one-dimensional diffusion process. There are two types of costs. The first is accumulated continuously at the rate H(Xt), where Xt is the current position of the process. The second is a cost associated with the stopping of the process. It is given by the function f1(x) for the first player and the function f2(x) for the second player, where x is the position of the process when the stopping option is exercised. We study the solution of the free boundary problem associated with this game via Dirichlet forms on the appropriate functional space. Integrating the value function of the game, we get a solution to another free boundary problem which yields the optimal return function for a singular stochastic control problem.
Modern Database Management, 4th edition
Authors: Fred R. McFadden
Venue:  (1998)

:Reacting to the current business environment, Modern Database Management, 6/e addresses current issues in the market, such as Internet, data warehousing and object-orientation. While sufficient technical explanations are given, the book instructs from a business perspective, allowing readers to understand the role of database management within a business. Chapter topics cover the database environment and development process, modeling data in the organization, advanced data modeling, logical database design and the relational model, physical database design and performance, SQL, advanced SQL, the client/server environment, the Internet environment, data warehousing, data and database administration, distributed databases, object-oriented data modeling, and object-oriented database development.
NT Server 4 in the Enterprise (#70-068)
Authors: Jeffrey Williams, Linthic, David Johnson
Venue:  (1998)

:MCSE NT Server 4 in the Enterprise Exam Prep was created to help networking professionals gain knowledge that directly applies to the certification exam for NT Server 4 in the Enterprise. Together, the book and companion CD-ROM provide a new way to study and prepare for a certification exam. The book covers all topics necessary to successfully pass the NT Server 4 in the Enterprise exam, including OSI models, network hardware and topology, data transmissions and network protocols, network and Internet names, remote access and security, and hardware and protocols. A comprehensive Exam Prep Study Guide for Exam #70-068: Implementing and Supporting Microsoft Windows NT Server 4 in the Enterprise and, when used with the companion NT SErver 4 Exam Cram, provides a complete interactive learning system. Features real-world examples, interactive activities, and over 100 hands-on projects that reinforce key concepts and help prepare for the exam. Content developed by Course Technology, a publisher specializing in technical content development for adult education. Has the official Microsoft Certified Professional Approved Study Guide logo, which indicates approval by Microsoft, to give the book that competitive edge. Two complete interactive practice exams are featured in a unique Exam Prep simulation environment, allowing readers to test their skills and knowledge and help build confidence before taking the actual exam. Unlike competing products, the exam questions are based on the content of the book to reinforce concepts and their applications.
Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8
Authors: Kalle Ranto
Venue: SIAM Journal on Discrete Mathematics (2002)

We construct several new families of simple 3-designs from codewords of the $\mathbf Z_4$-Goethals codes. These designs have parameters $3$-$(2^m,8,\lambda)$ with odd $m\ge 5$. The smallest design has $\lambda=14(2^m-8)/3$, and the others are corollaries of this and some previously known designs. In the existence proofs we analyze the low-weight codewords and count the number of solutions to certain systems of equations over finite fields.
Remote Access for Cisco Networks, 1st edition
Authors: Bill Burton, William Burton
Venue:  (2000)

:Build your remote connectivity know-how The ability to connect remotely through a Cisco Network is changing the way networking professionals do their jobs. Remote Access for Cisco Networks,by Bill Burton,CCIE,is the first complete guide to using Cisco networks remotely,from hardware to the IOS. It's a practical hands-on tool with troubleshooting tips and techniques in every chapter. It's invaluable,too,for mastering the skill required in the CCIE Lab Exam and CCNP exam. You get a full understanding of routing protocol interactions,distance vector,and advanced protocols. Plus. . . directions for configuring asynchronous modems with Cisco routers. . . establishing backup circuits for permanent connections. . . and optimizing traffic flow on WAN interfaces *insight into security and remote connectivity with PPP (Point to Point Protocol) The complete guide to designing,implementing,and monitoring remote access systems in Cisco&reg; networks! Remote connectivity is a central component in the Cisco internetworking operating system (IOS) and router hardware. This important capability is drastically changing the way network professionals do their jobs,and it's also an important part of the CCIE Certification Exam. If you need to get up and running with this technology,then this book is for you. It provides all the essential information for understanding and implementing remote connectivityinvaluable information that the Cisco documentation just doesn't cover. Coverage includes&#58 Remote connectivity with all the permanent access connections (frame relay,X. 25 connections,and back-up connections) Bandwidth on demand Troubleshooting tipsand techniques throughout every chapter Cisco lab objectives for developing remote access skills to pass the CCIE exam and meet certification requirements All network administrators and anyone who needs to learn about remote connectivity to pass the CCIE exam will find this to be their one-stop source for mastering this explosive technology.
Robust Control via Sequential Semidefinite Programming
Authors: B. Fares, D. Noll, P. Apkarian
Venue: SIAM Journal on Control and Optimization (2001)

This paper discusses nonlinear optimization techniques in robust control synthesis, with special emphasis on design problems which may be cast as minimizing a linear objective function under linear matrix inequality (LMI) constraints in tandem with nonlinear matrix equality constraints. The latter type of constraints renders the design numerically and algorithmically difficult. We solve the optimization problem via sequential semidefinite programming (SSDP), a technique which expands on sequential quadratic programming (SQP) known in nonlinear optimization. Global and fast local convergence properties of SSDP are similar to those of SQP, and SSDP is conveniently implemented with available semidefinite programming (SDP) solvers. Using two test examples, we compare SSDP to the augmented Lagrangian method, another classical scheme in nonlinear optimization, and to an approach using concave optimization.
Using Technology Classroom, 4th edition
Authors: Gary G. Bitter, Melissa E. Pierson
Venue:  (1998)

:/* 3247L-1, Bitter, Gary G., Using Technology in the Classroom, 5/e */ Using Technology in the Classroom highlights the essential topics related to technology in education. Completely re-vamped and updated, this book includes the most current information on the use of technology in the classroom: online educational resources, the latest in educational software, electronic communication, creating Web-based instruction, emerging technology, as well as how to utilize each of these elements and implement a technology based curriculum. Educational Website addresses, screen captures, Internet activities, resources, and applications all provide clear and comprehensive information to equip readers with the basic tools needed for understanding and integrating technology into education. For educators wanting to incorporate technology in the classroom.
Capture of an intruder by mobile agents
Authors: Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

Consider a team of mobile software agents deployed to capture a (possibly hostile) intruder in a network. All agents, including the intruder move along the network links; the intruder could be arbitrarily fast, and aware of the positions of all the agents. The problem is to design the agents' strategy for capturing the intruder. The main efficiency parameter is the size of the team. This is an instance of the well known graph-searching problem whose many variants have been extensively studied in the literature. In all existing solutions, and in all the variants of the problem, it is assumed that agents can be removed from their current location and placed in another network site arbitrarily and at any time. As a consequence, the existing optimal strategies cannot be employed in situations for which agents cannot access the network at any point, or cannot "jump" across the network, or cannot reach an arbitrary point of the network via an internal travel through insecure zones. This motivates the contiguous search problem in which agents cannot be removed from the network, and clear links must form a connected sub-network at any time, providing safety of movements. This new problem is NP-complete in general. We study it for tree networks, and we consider its more general version, the weighted case, which arises naturally when considering networks whose nodes and links are of different nature and thus require a different number of agents to be explored. We give a linear-time algorithm that computes, for any tree $T$, the minimum number of agents to capture the intruder, and the corresponding search strategy. Beside its optimality in time, our algorithm is naturally distributed: if $T$ is a processor-network, then the minimal search strategy for $T$ can be computed by $T$ in a decentralized manner, using a linear number of messages.
WordPerfect 6.0, Easy Reference Guide
Authors: Rick Sullivan
Venue:  (1994)

:Our popular Easy Reference Guides are easy-to-use manuals with operating commands for learners who are already familiar with the software. They're pocket-sized and software-specific with functions arranged in alphabetical order for easy reference.
Observations on game server discovery mechanisms
Authors: Tristan Henderson
Venue: Proceedings of the 1st workshop on Network and system support for games (2002)

Networked First Person Shooter (FPS) games are amongst the most popular multiuser applications on the Internet today. At any given time, there are thousands of servers available to a potential player. We describe and analyse the existing mechanisms for locating these game servers. The mechanisms are found to be inefficient and do not scale well. We propose and describe a distributed peer-to-peer server discovery mechanism. This is a work in progress.
Vulnerabilities in similarity search based systems
Authors: Ali Saman Tosun, Hakan Ferhatosmanoglu
Venue: Proceedings of the eleventh international conference on Information and knowledge management (2002)

Similarity based queries are common in several modern database applications, such as multimedia, scientific, and biomedical databases. In most of these systems, database responds with the tuple with the closest match according to some metric. In this paper we investigate some important security issues related to similarity search in databases. We investigate the vulnerability of such systems against users who try to copy the database by sending automated queries. We analyze two models for similarity search, namely reply model and score model. Reply model responds with the tuple with best match and score model responds with only the score of similarity search. For these models we analyze possible ways of attacks and strategies that can be used to detect attacks. Our analysis shows that in score model it is much easier to plug the vulnerabilities than in reply model. Sophisticated attacks can easily be used in reply model and the database is limited in capability to prevent such attacks.
Thresholds: Revisit the Strings Versus Clouds Debate for the Internet Architecture, Part II: QoS, Control, Management, and TCP
Authors: Wei K. Tsai, Mahadevan Iyer, Jordi Ros
Venue: Journal of Network and Systems Management (2002)

The clouds (IP) versus strings (connection-oriented) debate over the Internet architecture is reexamined. Controllability and observability are shown to be the key to the performance (QoS) of the networks. The clouds architecture treats the network as a black box, making it uncontrollable and unobservable&semi; in contrast, the strings architecture was designed to be a controllable and observable structure. In network management, the need for centralized management and control to obtain efficiency and optimal performance argues for strings architecture. Finally, TCP is shown to be unscalable in performance because of its poor observability and controllability.
A report on the use of HyperTalk in CS1 within a liberal arts setting
Authors: Michael Goldweber
Venue: ACM SIGCSE Bulletin (1999)

The choice of which formal (programming) language to use in CS1 has occupied or preoccupied computer science educators for some time now. Some have even dubbed the debate as the "language wars." We do not intend for this report to be is another salvo in this war. Instead, we wish to report on why one institution has decided on an unconventional choice--HyperTalk--and the successful results obtained from using it in CS1 for the past five semesters.
Using speakeasy for ad hoc peer-to-peer collaboration
Authors: W. Keith Edwards, Mark W. Newman, Jana Z. Sedivy, Trevor F. Smith, Dirk Balfanz, D. K. Smetters, H. Chi Wong, Shahram Izadi
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Peer-to-peer systems appear promising in terms of their ability to support ad hoc, spontaneous collaboration. However, current peer-to-peer systems suffer from several deficiencies that diminish their ability to support this domain, such as inflexibility in terms of discovery protocols, network usage, and data transports. We have developed the Speakeasy framework, which addresses these issues, and supports these types of applications. We show how Speakeasy addresses the shortcomings of current peer-to-peer systems, and describe a demonstration application, called Casca, that supports ad hoc peer-to-peer collaboration by taking advantages of the mechanisms provided by Speakeasy.
Program verification based on denotation semantics
Authors: Wolfgang Polak
Venue: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1981)

A theory of partial correctness proofs is formulated in Scott's logic computable junctions. This theory allows mechanical construction of verification condition solely on the basis of a denotational language definition. Extensionally these conditions, the resulting proofs, and the required program augmentation are similar to those of Hoare style proofs; conventional input, output, and invariant assertions in a first order assertion language are required. The theory applies to almost any sequential language defined by a continuation semantics; for example, there are no restrictions on aliasing or side-effects. Aspects of "static semantics",such as type and declaration constraints, which are expressed in the denotational definition are validated as part of the verification condition generation process.
Symmetric Paraunitary Matrix Extension and Parametrization of Symmetric Orthogonal Multifilter Banks
Authors: Qingtang Jiang
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

This paper is devoted to a study of symmetric paraunitary matrix extensions. The problem for a given compactly supported orthonormal scaling vector with some symmetric property, to construct a corresponding multiwavelet which also has the symmetric property, is equivalent to the symmetric paraunitary extension of a given matrix. In this paper we study symmetric paraunitary extensions of two types of matrices which correspond to two different cases for the symmetry of the scaling vector: the components of the scaling vector have or don't have the same symmetric center. In this paper we also discuss parametrizations of symmetric orthogonal multifilter banks.
Distributed simulation of asynchronous hardware: the program driven synchronization protocol
Authors: Georgios K. Theodoropoulos
Venue: Journal of Parallel and Distributed Computing (2002)

Synchronous VLSI design is approaching a critical point, with clock distribution becoming an increasingly costly and complicated issue and power consumption rapidly emerging as a major concern. Hence, recently, there has been a resurgence of interest in asynchronous digital design techniques which promise to liberate digital design from the inherent problems of synchronous systems. This activity has revealed a need for modelling and simulation techniques suitable for the asynchronous design style. The concurrent process algebra Communication Sequential Processes (CSP) and its executable counterpart, occam, are increasingly advocated as particularly suitable for this purpose. However, the parallel distributed semantics of CSP and occam introduce synchronization problems in the model. This paper presents the Program Driven Synchronization Protocol, which seeks to address causality and synchronization problems and enforce temporal coherency in distributed CSP/ occam models of asynchronous hardware systems.
Microsoft Office 2000 User Manual, 1st edition
Authors: Simply Written,  Inc., Simply Writen Inc.
Venue:  (1999)

:Get the manual that you should have gotten when you purchased Office 2000! This clear, to-the-point reference title takes you through Office in an easily understandable way and teaches you how to use each of the Office 2000 applications. Expert instructors have assembled a manual that makes sense for normal Office 2000 users, with complete coverage of all "user oriented" features. Office 2000 User Manual doesn't try to cover the vast amount of complex, detailed information that is only of interest to application developers. This nearly pure reference title quickly shows you what each relevant part of Office 2000 is, what it does, and how to use it successfully.
Programming for Technology Students Using Visual Basic
Authors: Peter Spasov
Venue:  (1998)

:Visual Basic is a powerful, industry-standard language used to develop a wide range of applications. Business and industry use it for developing stand-alone programs, front ends to large-scale database systems, Internet interactivity (VB Script), office automation enhancements (such as Microsoft Office), and other types of software. The fundamentals of programming require understanding various elements such as statements, variables, data types, and. expressions. However, a programmer also needs to understand a bigger picture: to analyze, design, document, and test the program under development. In addition, analytical and troubleshooting skills are critical. This book covers each of these key activities in program development, emphasizing the problem solving and programming concepts fundamental to all programming tasks. If you have never programmed before, or have limited programming experience, this book is for you. Programming for Technology Students Using Visual Basic can help you master the fundamentals required to create programs. With the use of a fictitious small manufacturing company, the author provides a unique case study approach to add interest and context for programming in the real world. New features to this edition include: Integrated hands-on exercises throughout each chapter. An updated design, using color to emphasize important topics and useful information. A Microsoft Visual Basic 6.0 Working Model CD. Additional troubleshooting sections and many new and updated diagrams. Instructors who are using this book for a course may obtainthe accompanying Instructor's Manual (ISBN 0-13-041208-2) free of charge.
Sams Teach Yourself Dynamic HTML in a Week, 1st edition
Authors: Bruce Campbell, Rick Darnell, Derrick Woolworth
Venue:  (1997)

:Detailed instructions on how to use Dynamic HTML and Web scripting languages to create Web pages and Web applications that change in response to user actions.
Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
Authors: I. H. Sloan, F. Y. Kuo, S. Joe
Venue: SIAM Journal on Numerical Analysis (2002)

Shifted rank-1 lattice rules, a special class of quasi-Monte Carlo methods, have recently been proposed by the present authors for the integration of functions belonging to certain "weighted" Sobolev spaces. The shifts in these rules were generated in a deterministic manner. In contrast, in this paper we generate these shifts randomly. This allows probabilistic estimates for the error in a given integral. It also reduces the number of operations required to find the generating vectors for the underlying lattice rules component-by-component. The rules thus constructed achieve a worst-case strong tractability error bound in an average or probabilistic sense.