ppxscal/embedding_network huggingface dataset:
Efficient Garbage Collection Schemes for Causal Message Logging with Independent Checkpointing
Authors: Jinho Ahn, Sung-Gi Min, Chong-Sun Hwang, Heonchang Yu
Venue: The Journal of Supercomputing (2002)

This paper presents three garbage collection schemes for causal message logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its volatile storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. Additionally, it supports faster output commit than traditional schemes. The second scheme enables each process to remove a part of log information in the storage if more empty space is required. It reduces the number of processes participating in the garbage collection by using the size of the log information of each process. The third scheme is a hybrid scheme having the advantages of the two proposed schemes. Simulation results show that the third scheme significantly reduces the garbage collection overhead compared with the traditional schemes regardless of specific communication patterns of distributed applications.
MCSE Proxy Server 2 Exam Cram, 1st edition
Authors: David Johnson, James Michael Stewart, Andy Ruth
Venue:  (1998)

:Includes sections on proven test-taking strategies, warnings on trick questions, time-saving study tips, multiple-part question strategies, and shortcuts. Includes practice exam questions arranged in a similar format to the ones found on the actual exam. Provides all of the necessary overviews, concepts, and Microsoft networking terminology to help potential test takers get up to speed as quickly as possible. Written by a team of leading trainers and certification experts. Jam packed with test-taking tips and strategies as well as numerous technical insights on topics such as Internet protocols, Windows sockets, Secure Sockets Layer (SSL), user authentication techniques, Remote Access Server, server caching, and Proxy Server customization and tuning. Serves as the perfect complement to all study guides and training materials for Exam #70-088:Implementing and Supporting Proxy Server 2. Includes resource sections at the end of each chapter to help the reader make use of the best study aids available. Provides a special Cram Sheet with tips, acronyms, and memory joggers for a quick review just prior to taking the exam. Guarantees long shelf life because tests for future versions are not made available until roughly 90-120 days after the release of the software.
CGNR Is an Error Reducing Algorithm
Authors: Chunguang Li
Venue: SIAM Journal on Scientific Computing (2000)

The CGNR algorithm is a robust algorithm solving large nonsymmetric linear systems. In this short note, we show that the norm of the error vector of CGNR approximation decreases monotonically during its iteration. Few iterative algorithms have this error reducing property. The result indicates that the simple CGNR algorithm is still a potential one in practical use.
An Introduction to Programming and Object Oriented Design Using Java, 1st edition
Authors: Jaime Nino, F. Hosch
Venue:  (2000)

:The emphasis throughout this book is on problem modeling using fundamental software engineering principles and concepts. Although Java is introduced and used throughout the text, this is not a text about Java. Rather, Java is used as a tool to present the concepts. The UML is used, very informally, for denoting objects, object relationships, and system dynamics.
Resident Evil 2: Official Strategy Guide
Authors: Anthony James, Anthony Lynch, Kip Ward
Venue:  (1998)

:The nightmare begins again . . . and this time with the dual shock controller activated! Take Leon and Claire to the edge of darkness with Resident Evil 2: Prima's Official Strategy Guide. Inside you will find a complete walkthrough, detailed maps of all levels, essential item locations, deadly weapon secrets, and lethal strategies for defeating every gruesome creature.
From the editor
Authors: Don Marti
Venue: Linux Journal (2002)

Hey, Embedded Developers! Buy This Magazine!
Uni-transitional Watson-Crick DOL systems
Authors: Arto Salomaa
Venue: Theoretical Computer Science (2002)

The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: "bad" words obtained through a generative process are replaced by their complementary ones. This idea seems particularly suitable for Lindenmayer systems. D0L systems augmented with a specific complementarity transition, Watson-Crick D0L systems, have turned out to be a most interesting model and have already been extensively studied. A language is generated by a Watson-Crick D0L system as a sequence of words. Consequently, the systems can be applied also to compute functions in a natural way. In the present paper, attention is focused on uni-transitional systems, where at most one complementarity transition takes place in the generated sequence. In spite of their seeming simplicity, uni-transitional systems represent a vast extension of ordinary D0L systems. This becomes apparent in their capacity of defining functions. Quite remarkably, all basic decision problems for uni-transitional systems are algorithmically equivalent among themselves, as well as equivalent to a celebrated open problem. We investigate also a simpler case of systems with regular triggers, as well as pose some open problems.
Specification, verification, and synthesis of concurrency control components
Authors: Tuba Yavuz-Kahveci, Tevfik Bultan
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

Run-time errors in concurrent programs are generally due to the wrong usage of synchronization primitives such as monitors. Conventional validation techniques such as testing become ineffective for concurrent programs since the state space increases exponentially with the number of concurrent processes. In this paper, we propose an approach in which 1) the concurrency control component of a concurrent program is formally specified, 2) it is verified automatically using model checking, and 3) the code for concurrency control component is automatically generated. We use monitors as the synchronization primitive to control access to a shared resource by multipleconcurrent processes. Since our approach decouples the concurrency control component from the rest of the implementation it is scalable. We demonstrate the usefulness of our approach by applying it to a case study on Airport Ground Traffic Control.We use the Action Language to specify the concurrency control component of a system. Action Language is a specification language for reactive software systems. It is supported by an infinite-state model checker that can verify systems with boolean, enumerated and udbounded integer variables. Our code generation tool automatically translates the verified Action Language specification into a Java monitor. Our translation algorithm employs symbolic manipulation techniques and the specific notification pattern to generate an optimized monitor class by eliminating the context switch overhead introduced as a result of unnecessary thread notification. Using counting abstraction, we show that we can automatically verify the monitor specifications for arbitrary number of threads.
Location-based notification as a general-purpose service
Authors: Jonathan P. Munson, Vineet K. Gupta
Venue: Proceedings of the 2nd international workshop on Mobile commerce (2002)

An often-discussed mobile commerce application is proximity-based coupon delivery. In a typical scenario a merchant is notified when a valued customer is within some distance of a retail outlet, upon which the customer is delivered a coupon or some notice of a special promotion. We believe that this basic mechanism of location-based notification has application far beyond commercial promotion, and is also of interest for tourism, traffic information, public service, and public safety. Furthermore, we believe that a general-purpose location-based notification service that can serve all these applications would be highly useful. However, as we will show, current architectures deployed by wireless carriers to service location-aware applications cannot handle the load of positioning requests implied by such a general-purpose service. We motivate the need for such a service, discuss the limitations of current architectures for providing location information, and detail the requirements for an architecture which would make such a service possible.
MCSE NT Server 4 in the Enterprise Exam Cram Personal Trainer with Cdrom, 3rd edition
Authors: Ed Tittel, Hudson, Stewart
Venue:  (2000)

:The Exam Cram Personal Trainer is a personalized, interactive self-paced training course based on the best-selling Exam Cram test preparation guides. The Exam Cram Personal Trainer System package includes a CD-based personalized practice test engine with nearly 300 test questions covering multiple test types, two hours of audio review, the entire Exam Cram text in HTML format, a 16-page comprehensive User Guide, and MCSE NT Server 4 in the Enterprise Exam Cram, 3rd Edition. The Exam Cram Personal Trainer System is packaged in a sturdy, attractive slipcase.
Object Oriented Software Technologies in Telecommunications: From Theory to Practice
Authors: Fabrizio Zizza, Thomas C. Magedanz, Iakovos Venieris
Venue:  (2000)

:Object-oriented (OO) technology is an integral part of computer communications and multimedia service provisioning. Covering all areas related to OO programming in telecommunications applications, this book offers both theoretical and practical aspects of OO technology. Readers will find comprehensive coverage is included on broadband, intelligent networks, and machine independent code.
Current-Mode Multiplier/Divider Circuits Based on the MOS Translinear Principle
Authors: Antonio J. López-Martín, Alfonso Carlosena
Venue: Analog Integrated Circuits and Signal Processing (2001)

In this paper, novel current-mode analog multiplier/divider circuits based on a pair of voltage-translinear loops are presented, featuring simplicity, precision and wide dynamic range. They are suitable for standard CMOS fabrication and can be successfully employed in a wide range of analog signal processing applications. Two versions, based on stacked and up-down voltage-translinear loops, respectively, are described. Experimental results are provided in order to verify their correct operation.
Mode Jumping In The Von K&aacute;rm&aacute;n Equations
Authors: C.-S. Chien, S.-Y. Gong, Z. Mei
Venue: SIAM Journal on Scientific Computing (2000)

We study numerical approximations of bifurcating solution curves of the von K&aacute;rm&aacute;n equations with simply supported and clamped boundary conditions, respectively. Of special interest here is the splitting of a double bifurcation point into two simple bifurcation points, and the tracing of the associated secondary solution branches, which corresponds to the phenomenon of mode jumping in the buckling of a rectangular plate. A continuation-unsymmetric Lanczos algorithm is utilized for curve-tracking. Our numerical results verify the theoretical prediction of Schaeffer and Golubitsky, namely, mode jumping occurs when the boundary is partially clamped, but not if it is merely simply supported.
Current trends in computer science graduate admissions: a survey of the top 108 programs
Authors: S. Travis Nielsen, Douglas M. Campbell
Venue: ACM SIGCSE Bulletin (1999)

This article addresses some questions students have when completing applications to maximize their chances for admission to graduate school. We conducted a survey of the admissions process among the top computer science programs. Our study shows how admission committees weigh different sections of an application and overall trends of admission. The results are of interest to both applicants and computer science graduate faculty.
Computing Symmetric Rank-Revealing Decompositions via Triangular Factorization
Authors: Per Christian Hansen, Plamen Y. Yalamov
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

We present a family of algorithms for computing symmetric rank-revealing VSV decompositions based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonal matrix whose columns span approximations to the numerical range and null space. We show that for semidefinite matrices the VSV decomposition should be computed via the ULV decomposition, while for indefinite matrices it must be computed via a URV-like decomposition that involves hypernormal rotations.
Practical Pram Programming
Authors: Jorg Keller, Christopher Kessler, Jesper Larsson Traeff
Venue:  (2000)

:Although PRAM (Parallel Random Access Memory) is a well-known topic in parallel computing, its practical application has rarely been explored. This groundbreaking work changes all that. Written by world experts on this technology, it explains how to use PRAM to design algorithms for parallel computers and includes a number of PRAM implementations. Readers can also use the book as a self-study guide to parallel programming in general.
Wireless Network Evolution: 2G to 3G, 1st edition
Authors: Vijay Kumar Garg
Venue:  (2001)

:3G networks: architecture, planning, migration, management, and optimization. Network architectures, planning, management, and optimization 3G air interfaces: UTRA/W-CDMA and cdma2000 3G data services: UTRA/W-CDMA, cdma2000, GPRS, and EDGE Evolutionary paths for 2G networks WLL, WAP, and more New 3G systems will trigger an explosion in wireless Internet and data applications by delivering far higher data rates than have ever been possible in wireless systems before. In Wireless Network Evolution: 2G to 3G, renowned wireless expert Vijay K. Garg covers key 3G standard and every technical issue associated with planning, management, and optimization of 3G systems. Garg reviews the fundamental principles underlying existing 2G systems, then offers specific, practical guidance on migration to 3G. Coverage includes: 3G standards activities 3G European and North American systems 3G data services for UTRA/W-CDMA, cdma2000, GPRS, and EDGE networks Wireless Application Protocol (WAP) and 3G systems Major 3G enhancements for WLL applications New RF optimization techniques for 3G systems Wireless Network Evolution: 2G to 3G will be an invaluable resource for every practicing telecommunications engineer and technical decision maker involved in 3G planning, deployment, or management.
Improving program slicing with dynamic points-to data
Authors: Markus Mock, Darren C. Atkinson, Craig Chambers, Susan J. Eggers
Venue: Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering (2002)

Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise pointer analyses have been suggested as one cause of this problem. In this paper, we use dynamic points-to data, which represents optimal or optimistic pointer information, to obtain a bound on the best case slice size improvement that can be achieved with improved pointer precision. Our experiments show that slice size can be reduced significantly for programs that make frequent use of calls through function pointers because for them the dynamic pointer data results in a considerably smaller call graph, which leads to fewer data dependences. Programs without or with only few calls through function pointers, however, show only insignificant improvement. We identified Amdahl's law as the reason for this behavior: C programs appear to have a large fraction of direct data dependences so that reducing spurious dependences via pointers is only of limited benefit. Consequently, to make slicing useful in general for such programs, improvements beyond better pointer analyses will be necessary. On the other hand, since we show that collecting dynamic function pointer information can be performed with little overhead (average slowdown of 10% for our benchmarks), dynamic pointer information may be a practical approach to making slicing of programs with frequent function pointer use more successful in reality.
Wavelet Least Squares Methods for Boundary Value Problems
Authors: Wolfgang Dahmen, Angela Kunoth, Reinhold Schneider
Venue: SIAM Journal on Numerical Analysis (2001)

This paper is concerned with least squares methods for the numerical solution of operator equations. Our primary focus is the discussion of the following conceptual issues: the selection of appropriate least squares functionals, their numerical evaluation in the special light of recent developments of wavelet methods, and a natural way of preconditioning the resulting systems of linear equations.We describe first a general format of variational problems that are well-posed in a certain natural topology. In order to illustrate the scope of these problems we identify several special cases such as second order elliptic boundary value problems, their formulation as a first order system, transmission problems, the system of Stokes equations, or more general saddle point problems. Particular emphasis is placed on the separate treatment of essential nonhomogeneous boundary conditions. We propose a unified treatment based on wavelet expansions. In particular, we exploit the fact that weighted sequence norms of wavelet coefficients are equivalent to relevant function norms arising in the least squares context. This provides access to "difficult" norms, efficient preconditioners and, in the case of first order systems, optimal L2 error estimates.
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
Authors: Alfred Auslender, Marc Teboulle
Venue: SIAM Journal on Optimization (1999)

We consider a new class of multiplier interior point methods for solving variational inequality problems with maximal monotone operators and explicit convex constraint inequalities. Developing a simple Lagrangian duality scheme which is combined with the recent logarithmic-quadratic proximal (LQP) theory introduced by the authors, we derive three algorithms for solving the variational inequality (VI) problem. This provides a natural extension of the methods of multipliers used in convex optimization and leads to smooth interior point multiplier algorithms. We prove primal, dual, and primal-dual convergence under very mild assumptions, eliminating all the usual assumptions used until now in the literature for related algorithms. Applications to complementarity problems are also discussed.
Rhetoric of present single-sourcing methodologies
Authors: Dave Clark
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

In this paper, I detail what Bill Hart-Davidson describes as the "anxiety" that many technical communicators have about implementations of single source documentation. Specifically, I briefly explore what I see as some of the key potential rhetorical problems with single sourcing, in part by drawing on real-world examples gathered from conversations with and shadowing of technical communicators in their workplaces. I address the following potential objections that we need to handle in pragmatic and/or theoretical terms in order to claim for ourselves the kind of theoretical approach that will best suit our professional goals as well as those of our user populations:Single Sourcing Can Privilege Organizational Needs Over Enduser NeedsSingle Sourcing Can Limit Perceptions and Potential of Technical CommunicatorsSingle Sourcing Can Contribute to Under-Theorizing.
Advances in Telecommunications Networks, 1st edition
Authors: William S. Lee, Derrick C. Brown
Venue:  (1995)

:This book gives you an overview of recent advances in long distance telecommunications and provides an informed outlook on its future evolution. It traces the development of networks from analog to all-digital configurations, describes digital cross-connect systems and their numerous uses, and describes synchronous networks and the use of SONET rings to achieve self-healing networks.
Object-Oriented Macromedia Flash MX
Authors: William Drol
Venue:  (2002)

:Object-Oriented Macromedia Flash MX teaches object-oriented programming skills using Flash MX ActionScript. It assumes no previous programming experience and encourages Flash users who normally avoid ActionScript. Author William Drol develops a series of related applications using numerous step-by-step instructions and demonstrates the importance of good planning, documentation, and clean coding. Flash MX is the most powerful and widely used client software for the Web, and it's the only one that runs on virtually every browser on every platform. As such, it is the ideal platform for sophisticated Web applications, especially when paired with XML. Sophisticated applications demand a solid understanding of object-oriented programming techniques, regardless of the language and platform used. This may be the only Flash book entirely devoted to object-oriented programming. This book is for readers who want to do more than load and publish the pre-built Flash MX templates, who want to make sure their work is reusable, who want to learn solid programming techniques and, above all, who want to build the next generation of Web-based applications. By the time they finish Object-Oriented Macromedia Flash MX, readers will be able to develop highly reusable applications and services that leverage the dynamic features in Flash MX ActionScript. About the Author William Drol entered Macromedia Flash development with a varied background in object-oriented programming and graphic design. His first experience with Macromedia was the admittedly quirky, but OOP-based Macromedia Director and Lingo. Today, there are many reasons to be excited about Flash MX and the hugely improved version of ActionScript. Drol looks forward to integrating Flash MX with Web services, and he pursues other technologies such as XML, XSLT, and his current favorite, Microsoft C#.