ppxscal/embedding_network huggingface dataset:
Creating and preserving locality of java applications at allocation and garbage collection times
Authors: Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew Appel, Jaswinder Pal Singh
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

The growing gap between processor and memory speeds is motivating the need for optimization strategies that improve data locality. A major challenge is to devise techniques suitable for pointer-intensive applications. This paper presents two techniques aimed at improving the memory behavior of pointer-intensive applications with dynamic memory allocation, such as those written in Java. First, we present an allocation time object placement technique based on the recently introduced notion of prolific (frequently instantiated) types. We attempt to co-locate, at allocation time, objects of prolific types that are connected via object references. Then, we present a novel locality based graph traversal technique. The benefits of this technique, when applied to garbage collection (GC), are twofold: (i) it improves the performance of GC due to better locality during a heap traversal and (ii) it restructures surviving objects in a way that enhances locality. On multiprocessors, this technique can further reduce overhead due to synchronization and false sharing. The experimental results, on a well-known suite of Java benchmarks (SPECjvm98 [26], SPECjbb2000 [27], and jOlden [4]), from an implementation of these techniques in the Jikes RVM [1], are very encouraging. The object co-allocation technique improves application performance by up to 21% (10% on average) in the Jikes RVM configured with a non-copying mark-and-sweep collector. The locality-based traversal technique reduces GC times by up to 20% (10% on average) and improves the performance of applications by up to 14% (6% on average) in the Jikes RVM configured with a copying semi-space collector. Both techniques combined can improve application performance by up to 22% (10% on average) in the Jikes RVM configured with a non-copying mark-and-sweep collector.
Using Microsoft Excel 97: Clear. Concise. Dependable.
Authors: Laura Monsen, Conrad Carlberg
Venue:  (1997)

:Using Microsoft Excel 97 provides extensive information on how to best integrate Excel documents across the Office suite, how to post such documents to the Web and how to most efficiently work with these documents across a network. Fundamental elements of spreadsheet design covered, including working with formulas, entering/editing data and creating templates. Additional information to make spreadsheet more dynamic (i.e. more efficient), including customizing with VBA, using maps and charts to visualize/analyze data and working with pivot tables. Timely coverage of newer topics/enhanced functionality of Excel increases ability of book to fill market-sensitive needs. Comprehensive index, subject aliases and complete cross-referencing insures readers will find the best, most applicable information to help complete their tasks. Casual/accomplished Excel 97 users who need help building flexible solutions with core and enhanced tools either at work or at home.Provides extensive information on how to best integrate Excel documents across the Office suite, how to post such documents to the Web and how to most efficiently work with these documents across a networkCovers fundamental elements of spreadsheet design, including working with formulas, entering/editing data and creating templatesFeatures additional information to make spreadsheets more dynamic (i.e. more efficient), including customizing with VBA, using maps and charts to visualize/analyze data and working with pivot tables
Project Gotham: Prima's Official Strategy Guide
Authors: Mark Cohen
Venue:  (2001)

:Project Gotham is the future generation racing game where fun and reward come from focusing on speed and high risks. Prima's Official Strategy Guide features all the strategies needed to win the race! With over 200 circuits, gamers need this crucial guide to compete. Challenge your friends to split-screen racing or customize your car and hit the streets in 4 unique cities. 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
Randomness and Recursive Enumerability
Authors: Antonín Kucera, T. Slaman
Venue: SIAM Journal on Computing (2002)

One recursively enumerable real $\alpha$ dominates another one $\beta$ if there are nondecreasing recursive sequences of rational numbers $(a[n]:n\in\omega)$ approximating $\alpha$ and $(b[n]:n\in\omega)$ approximating $\beta$ and a positive constant C such that for all n, $C(\alpha-a[n])\geq(\beta-b[n])$. See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin's Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350--359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the $\Omega$-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350--359]. Second, we show that the sets in a universal Martin-Löf test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Löf test.
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
Authors: F. Sharifi Mokhtarian, J. L. Goffin
Venue: SIAM Journal on Optimization (1998)

A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated by adding a new cut through a test point. Each test point is an approximate analytic center of the intersection of a containing polytope and a level set of the nonlinear objective function. We establish the complexity of the algorithm. Our complexity estimate is given in terms of the problem dimension, the desired accuracy of an approximate solution, and other parameters that depend on the geometry of a specific instance of the problem.
Official Riven the Sequel to Mystery: Hints and Solutions
Authors: Bill H. Keith, Nina Keith
Venue:  (1997)

:With this guide, you can help Atrus find Catherine in RIVEN: The Sequel to MYST.Uses popular hints and solutions approach to puzzle-solvingIncludes walkthroughs of each world, plus detailed maps
Instruction selection using binate covering for code size optimization
Authors: Stan Liao, Srinivas Devadas, Kurt Keutzer, Steve Tjiang
Venue: Readings in hardware/software co-design (2001)

We address the problem of instruction selection in code generation for embedded DSP microprocessors. Such processers have highly irregular data-paths, and conventional code generation methods typically result in inefficient code. Instruction selection can be formulated as directed acyclic graph (DAG) covering. Conventional methods for instruction selection use heuristics that break up the DAG into a forest of trees and then cover them independently. This breakup can result in suboptimal solutions for the original DAG. Alternatively, the DAG covering problem can be formulated as a binate covering problem, and solved exactly or heuristically using branch-and-bound methods. We show that optimal instruction selection on a DAG in the case of accumulator-based architectures requires a partial scheduling of nodes in the DAG, and we augment the binate covering formulation to minimize spills and reloads. We show how the irregular data transfer costs of typical DSP data-paths can be modeled in the binate covering formulation.
Stable Approximation and Interpolation with C1 Quartic Bivariate Splines
Authors: Oleg Davydov, Larry L. Schumaker
Venue: SIAM Journal on Numerical Analysis (2001)

We show how two recent algorithms for computing C1 quartic interpolating splines can be stabilized to ensure that, for smooth functions, they provide full approximation power with approximation constants depending only on the smallest angle in the triangulation [C. K. Chui and D. Hong, Math. Comp., 65 (1996), pp. 85--98; C. K. Chui and D. Hong, SIAM J. Numer. Anal., 34 (1997), pp. 1472--1482; D. Hong, Approximation Theory VIII, Vol.1: Approximation and Interpolation, C. K. Chui and L. L. Schumaker, eds., World Scientific, Singapore, 1995, pp. 249--256].
Analysis and Design of Integrated Circuit Antenna Modules, 1st edition
Authors: K. C. Gupta, Peter S. Hall
Venue:  (1999)

:With communications technologies rapidly expanding, the traditional separation of electronic circuits and antenna systems design is no longer feasible. This book covers various design approaches applicable to integrated circuit-antenna modules with the goal of placing the antenna, transmitter, and receiver all on a single chip. It emphasizes analysis and design involving the integration of circuit functions with radiating elements and addresses trends in systems miniaturization.
Professional Crystal Reports for Visual Studio .NET
Authors: David G. McAmis, Bill Sempf
Venue:  (2002)

:Virtually all applications need to present data to users, but any work beyond basic formatting - charts or conditional formatting, for example - can be very complex to program manually. Crystal Reports is one of the world's leading software packages for creating interactive reports, and it provides developers with an array of tools for creating rich reports that can be published on the Web or integrated within applications. Versions of Crystal Reports have been included with Visual Studio since 1993 but the latest version, Crystal Reports .NET, is now integrated more closely than ever before with Visual Studio .NET. This book provides a detailed guide to the functionality provided with Crystal Reports .NET and shows you how to integrate reports into your .NET applications. This book covers: Crystal Reports .NET overview Report integration for Windows and Web-based applications Creating XML report web services Working with .NET data, formulas, and logic The reports engine Distributing your application This book is aimed mainly at readers who have some experience with Crystal Reports and want a comprehensive guide to the functionality included with Crystal Reports .NET, but it will also be valuable to programmers who are getting their first taste of Crystal Reports through the Visual Studio .NET development environment.
Retransmission schemes for streaming internet multimedia: evaluation model and performance analysis
Authors: Dmitri Loguinov, Hayder Radha
Venue: ACM SIGCOMM Computer Communication Review (2002)

This paper presents a trace-driven simulation study of two classes of retransmission timeout (RTO) estimators in the context of real-time streaming over the Internet. We explore the viability of employing retransmission timeouts in NACK-based (i.e., rate-based) streaming applications to support multiple retransmission attempts per lost packet. The first part of our simulation is based on trace data collected during a number of real-time streaming tests between dialup clients in all 50 states in the U.S. (including 653 major U.S. cities) and a backbone video server. The second part of the study is based on streaming tests over DSL and ISDN access links. First, we define a generic performance measure for assessing the accuracy of hypothetical RTO estimators based on the samples of the round-trip delay (RTT) recorded in the trace data. Second, using this performance measure, we evaluate the class of TCP-like estimators and find the optimal estimator given our performance measure. Third, we introduce a new class of estimators based on delay jitter and show that they significantly outperform TCP-like estimators in NACK-based applications with low-frequency RTT sampling. Finally, we show that high-frequency sampling of the RTT completely changes the situation and makes the class of TCP-like estimators as accurate as the class of delay-jitter estimators.
A Semi-Lagrangian Semi-Implicit Numerical Method for Models of the Urine Concentrating Mechanism
Authors: Anita T. Layton, Harold E. Layton
Venue: SIAM Journal on Scientific Computing (2001)

Mathematical models of the urine concentrating mechanism consist of large systems of coupled differential equations. The numerical methods that have usually been used to solve the steady-state formulation of these equations involve implicit Newton-type solvers that are limited by numerical instability attributed to transient flow reversal. Dynamic numerical methods, which solve the dynamic formulation of the equations by means of a direction-sensitive time integration until a steady state is reached, are stable in the presence of transient flow reversal. However, when an explicit, Eulerian-based dynamic method is used, prohibitively small time steps may be required owing to the CFL condition and the stiffness of the problem. In this report, we describe a semi-Lagrangian semi-implicit (SLSI) method for solving the system of hyperbolic partial differential equations that arises in the dynamic formulation. The semi-Lagrangian scheme advances the solution in time by integrating backward along flow trajectories, thus allowing large time steps while maintaining stability. The semi-implicit approach controls stiffness by averaging transtubular transport terms in time along flow trajectories. For sufficiently refined spatial grids, the SLSI method computes stable and accurate solutions with substantially reduced computation costs.
PHP Pocket Reference
Authors: Rasmus Lerdorf
Venue:  (2000)

From the Book:PHP is a server-side, HTML-embedded, cross-platform scripting language--quite a mouthful. In simpler terms, PHP provides a way for you to put instructions in your HTML files to create dynamic content. These instructions are read and parsed by the web server; they never actually make it to the browser that is displaying the page. The web server replaces your PHP code with the content that the code was written to produce. PHP can be configured to run either as a server module or as a standalone CGI script. At the time of this writing, the server-module version is only production-ready for the Apache web server on Unix systems. The CGI version runs with all web servers on both Unix and Windows 95/98/NT. On the Windows platform (as of PHP Version 4), the server module is being developed to work with ISAPI, NSAPI, and WSAPI, which means the server module will eventually work with Microsoft's IIS, Netscape's Enterprise Server, and O'Reilly's WebSite. See http://www.php.net for availability details. The PHP language itself borrows concepts from other common languages, such as C and Perl. If you have some experience with one of these languages, you should feel right at home with PHP. In addition to the core language, PHP provides a wide variety of functions that support everything from array manipulation to regular expression support. Database connectivity is one popular use for PHP. PHP supports a large number of databases natively and many others are accessible through PHP's ODBC functions. Through this database connectivity, it is possible, for example, to take a company's database of products and write a web interface to it using PHP. This book provides an overview of thecore PHP language and contains summaries of all the functions available in PHP. The material covers PHP 3.0.
Sokoban: a system object case study
Authors: Robert Biddle, James Noble, Ewan Tempero
Venue: Proceedings of the Fortieth International Conference on Tools Pacific: Objects for internet, mobile and embedded applications (2002)

This report presents a case study applying the Distribution of System Responsibilities (DSR) object-oriented design technique. DSR provides a starting point for an object-oriented design by directly manipulating the requirements for that application. The case study applies DSR to the development of a small application, the game Sokoban. The case study provides evidence that DSR does allow object-oriented designs to be created, that it allows reasonable designs to be created, and that any object-oriented design can be created by it.
On the Iterative Criterion for Generalized Diagonally Dominant Matrices
Authors: Lei Li
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

An iterative method for identifying generalized diagonally dominant matrices\break (GDDMs, or H-matrices) was given in [B. Li et al., Linear Algebra Appl., 271 (1998), pp. 179--190], where the method is divergent when the matrix is not a GDDM. In this paper, we present an improved version. The new method is always convergent and needs fewer iterations than the earlier one. Some interesting features of the new method are presented. Spectral radii of nonnegative matrices with a constant diagonal entry also can be computed by our method.
Easy Excel 5 for Windows, 2nd edition
Authors: Trudi Reisner
Venue:  (1993)

:This is the updated version of our popular full-color beginner's guide to the best-selling spreadsheet Windows program-Excel!Easy-to-follow examples build user confidence and increase productivityIncludes a new task section with numerous spreadsheet samples to give novices that extra edge in learning difficult formatsFull-color format makes the book easy to use and enhances understanding of the application
Web based analysis
Authors: Michael P. Carroll, Christopher M. Hawkins
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

Most of today's Web based solutions in the CAD/CAE arena are focused on the design and manufacturing part of the equation. As such, they are very focused on data security, sharing, and visualization. The processing of the data is still seen as mainly a desktop/client function. Analysis provides an opportunity to expand the role of the Web from a role of data sharing to one of distributed data processing. For analysis, data visualization is not a static function. Analysis runs can produce enormous results files that will burden even the fastest Web connections. Servers need to process this data into useable form for client requests. Also the Web provides an excellent distributed processing environment, which is crucial for design studies such as simple parametric studies, Design of Experiments (DOE), optimization, and probabilistic studies. Finally, the Web provides an excellent environment for team analysis.
Windows 98 6 in 1, 1st edition
Authors: Jane Calabria, Dorothy Burke
Venue:  (1997)

:The 6-in-1 is a task oriented tutorial/reference that allows the reader to quickly find a specific task and follow step-by-step instructions on how to achieve that task.Quick, hands-on, task-oriented approach provides readers with a very easy to use and very effective method of solving Windows 98 related problemsThe 6-in-1 series offers tremendous value with more useful content in value priced packageUsers get exactly the answers they need in a fast, how-to format that makes learning and using new software easier than ever before
Least Squares for the Perturbed Stokes Equations and the Reissner--Mindlin Plate
Authors: Zhiqiang Cai
Venue: SIAM Journal on Numerical Analysis (2000)

In this paper, we develop two least-squares approaches for the solution of the Stokes equations perturbed by a Laplacian term. (Such perturbed Stokes equations arise from finite element approximations of the Reissner--Mindlin plate.) Both are two-stage algorithms that solve first for the curls of the rotation of the fibers and the solenoidal part of the shear strain, then for the rotation itself (if desired). One approach uses L2 norms and the other approach uses H-1 norms to define the least-squares functionals. It is shown that the H-1 norm approach, under general assumptions, and the L2 norm approach, under certain H2 regularity assumptions, admit optimal performance for standard finite element discretization and either standard multigrid solution methods or preconditioners. These methods do not degrade when the perturbed parameter (the plate thickness) approaches zero. We also develop a three-stage least-squares method for the Reissner--Mindlin plate, which first solves for the curls of the rotation and the shear strain, next for the rotation itself, and then for the transverse displacement.
Managing NFS and NIS, 2nd edition
Authors: Hal Stern
Venue:  (2001)

:Managing NFS and NIS is for system administrators who need to set up or manage a network filesystem installation. NFS (Network Filesystem) is probably running at any site that has two or more UNIX systems. NIS (Network Information System) is a distributed database used to manage a network of computers. The only practical book devoted entirely to these subjects, this guide is a "must-have" for anyone interested in UNIX networking.
The Minimization Problem for Boolean Formulas
Authors: Edith Hemaspaandra, Gerd Wechsung
Venue: SIAM Journal on Computing (2002)

More than a quarter of a century ago, the question of the complexity of determining whether a given Boolean formula is minimal motivated Meyer and Stockmeyer to define the polynomial hierarchy. This problem (in the standard formalized version---that of Garey and Johnson) has been known for decades to be coNP-hard and in NPNP, and yet no one had even been able to establish (many-one) NP-hardness. In this paper, we show that and more: The problem in fact is (many-one) hard for parallel access to NP.
Reviewing Practices in Collaborative Writing
Authors: Hee-Cheol (Ezra) Kim, Kerstin Severinson Eklundh
Venue: Computer Supported Cooperative Work (2001)

This paper presents an interview study in which 11 academics as interviewees participated for the purpose of revealing common collaborative writing practices, with particular focus on reviewing documents. First, we present the findings obtained concerning the issues of co-operating strategies underlying the reviewing process, how people revise their documents and comment on them, what they use the previous revision history for, and to what extent current technology is used in the reviewing process. Second, we also discuss aspects of the design of collaborative writing tools.
Ada 95, Quality and Style: Guidelines for Professional Programmers, 1st edition
Authors: Kent A. Johnson
Venue:  (1998)

:The purpose of the Ada 95 Quality and Style Guidelines is to help computer professionals produce better Ada programs by identifying a set of stylistic guidelines that will directly impact the quality of their Ada 95 programs. The style guide is divided into chapters that map to the major decisions a programmer addresses when creating high-quality, reliable, reusable, and portable Ada software. Each chapter is divided into guidelines, using a format that supports wide usage because its contents are both prescriptive and tailorable. Many of the guidelines and examples included are specific enough to be adopted as corporate or project programming standards.