ppxscal/embedding_network huggingface dataset:
Continuations, functions and jumps
Authors: Hayo Thielecke
Venue: ACM SIGACT News (1999)

Practically all programming languages have some form of control structure or jumping. The more advanced forms of control structure tend to resemble function calls, so much so that they are usually not even described as jumps. Consider for example the library function exit in C. Its use is much like a function, in that it may be called with an argument; but the whole point of exit is of course that its behaviour is utterly non-functional, in that it jumps out of arbitrarily many surrounding blocks and pending function calls. Such a "non-returning function" or "jump with arguments" is an example of a continuation in the sense which we are interested in here.On the other hand, a simple but fundamental idea in compiling is that a function call is broken down into two jumps: one from the caller to the callee for the call itself, and another jump back from the callee to the caller upon returning. (The return statement in C is in fact listed among the "jump statements" [5].) This is most obvious for void-accepting and -returning functions, but it generalizes to other functions as well, if one is willing to understand "jump" in the broader sense of jump with arguments, i.e. continuation.In this view, then, continuations are everywhere. Continuations have been used in many different settings, in which they appear in different guises, ranging from mathematical functions to machine addresses. Rather than confine ourselves to a definition of what a continuation is, we will focus on continuation-passing style (CPS), as it brings out the commonalities. The CPS transform compresses a great deal of insight into three little equations in &lambda;-calculus. Making sense of it intuitively, however, requires some background knowledge and a certain fluency. The purpose of this article, therefore, is to help the reader uncompress the CPS transform by way of a rational reconstruction from jumps.In the sequel, we will attempt to illustrate the correspondence between continuations and jumps (even in the guise of the abhorred goto). The intent is partly historical, to retrace some of the analysis of jumps that led to the discoveries of continuations. At the same time, the language of choice for many researchers during the (pre)history of continuations, ALGOL 60, is not so different from today's mainstream languages (i.e. C); we hope that occasional snippets of C may be more easily accessible to many readers than a functional language would be. So in each of the four sections (Sections 2-5 below) that make up the body of this paper, some C code will be used to give a naive but concrete example of the issue under consideration, before generalizing to a more abstract setting.
The O'Leary Series: PowerPoint 2002- Introductory, 1 edition
Authors: Timothy J. O'Leary, Linda O'Leary
Venue:  (2001)

SERIES TAGLINE: The O’Leary Series is the true step-by step way to develop computer application skills. Its design emphasizes the step-by step visual approach with screen captures for every concept. Table of contents Tutorial 1: Creating A Presentation Tutorial 2: Modifying And Refining A Presentation Working Together: Copying, Embedding, and Linking between Applications Tutorial 3: Using Advanced Presentation Features Tutorial 4: Creating a Presentation for a Kiosk and the Web Working Together: Reviewing, Embedding, and Broadcasting a Presentation
A Finite Difference Scheme for Elliptic Equations with Rough Coefficients Using a Cartesian Grid Nonconforming to Interfaces
Authors: Shari Moskow, Vladimir Druskin, Tarek Habashy, Ping Lee, Sofia Davydycheva
Venue: SIAM Journal on Numerical Analysis (1999)

We consider the problem of calculating a potential function in a two-dimensional inhomogeneous medium which varies locally in only one direction. We propose a staggered finite difference scheme on a regular Cartesian grid with a special cell averaging. This averaging allows for the change in conductivity to be in any direction with respect to the grid and does not require the grid to be small compared to the layering. We give a convergence result and numerical experiments which suggest that the new averaging works as well as the standard homogenization with thin conductive nonconformal sheets and exhibits better accuracy for resistive sheets.
On Narrow Hexagonal Graphs with a 3-Homogeneous Suborbit
Authors: Manley Perkel, Cheryl E. Praeger, Richard Weiss
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

A connected graph of girth i>m &ge; 3 is called a polygonal graph if it contains a set of i>m-gons such that every path of length two is contained in a unique element of the set. In this paper we investigate polygonal graphs of girth 6 or more having automorphism groups which are transitive on the vertices and such that the vertex stabilizers are 3-homogeneous on adjacent vertices. We previously showed that the study of such graphs divides naturally into a number of substantial subcases. Here we analyze one of these cases and characterize the i>k-valent polygonal graphs of girth 6 which have automorphism groups transitive on vertices, which preserve the set of special hexagons, and which have a suborbit of size i>k &minus; 1 at distance three from a given vertex.
Application integration: deep dive into metadata
Authors: David S. Linthicum
Venue: Software Magazine (2002)

UNDERSTANDING THE METADATA for an application integration problem domain is key to its success. Yet application integration and metadata management, to date, have not been well defined as complementary concepts. However, considering the dynamics of a typical application integration problem domain, such as the requirement to track application semantics and message schemas, there is a clear opportunity for application integration and metadata management to coexist. At least within requirements definitions, metadata should already take center stage.
Mathematica Navigator: Graphics and Methods of Applied Mathematics
Authors: Heikki Ruskeepaa
Venue:  (1999)

:Mathematica Navigator is designed to provide readers with a general introduction to the use of Mathematica, with emphasis on graphics, methods of applied mathematics, and programming. This book is useful both as a tutorial and as a handbook. No previous experience with Mathematica is required. Coverage also includes advanced material and material not easily found elsewhere. This book will be a valuable resource for both beginners and experienced users.
Heidegger, Authenticity, and Modernity
Authors: Mark Wrathall, Jeff Malpas
Venue:  (2000)

:For more than a quarter of a century, Hubert L. Dreyfus has been the leading voice in American philosophy for the continuing relevance of phenomenology, particularly as developed by Edmund Husserl, Martin Heidegger, and Maurice Merleau-Ponty. Dreyfus has influenced a generation of students and a wide range of colleagues, and these volumes are an excellent representation of the extent and depth of that influence. In keeping with Dreyfus's openness to others' ideas, many of the essays in this volume take the form of arguments with various of his positions. The essays focus on the dialogue with the continental philosophical tradition, in particular the work of Heidegger, that has played a foundational role in Dreyfus's thinking. The sections are Philosophy and Authenticity; Modernity, Self, and the World; and Heideggerian Encounters. The book concludes with Dreyfus's responses to the essays. Contributors: William D. Blattner, Taylor Carman, David R. Cerbone, Dagfinn F&oslash;llesdal, Charles Guignon, Michel Haar, Beatrice Han, Alastair Hannay, John Haugeland, Randall Havas, Jeff Malpas, Mark Okrent, Richard Rorty, Julian Young, Michael E. Zimmerman.
Low latency photon mapping using block hashing
Authors: Vincent C. H. Ma, Michael D. McCool
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2002)

For hardware accelerated rendering, photon mapping is especially useful for simulating caustic lighting effects on non-Lambertian surfaces. However, an efficient hardware algorithm for the computation of the k nearest neighbours to a sample point is required.Existing algorithms are often based on recursive spatial subdivision techniques, such askd-trees. However, hardware implementation of a tree-based algorithm would have a high latency, or would require a large cache to avoid this latency on average.We present a neighbourhood-preserving hashing algorithm that is low-latency and has sub-linear access time. This algorithm is more amenable to fine-scale parallelism than tree-based recursive spatial subdivision, and maps well onto coherent block-oriented pipelined memory access. These properties make the algorithm suitable for implementation using future programmable fragment shaders with only one stage of dependent texturing.
A computerized causal forecasting system using genetic algorithms in supply chain management
Authors: Bongju Jeong, Ho-Sang Jung, Nam-Kyu Park
Venue: Journal of Systems and Software (2002)

Forecasting activities are widely performed in the various areas of supply chains for predicting important supply chain management (SCM) measurements such as demand volume in order management, product quality in manufacturing processes, capacity usage in production management, traffic costs in transportation management, and so on. This paper presents a computerized system for implementing the forecasting activities required in SCM. For building a generic forecasting model applicable to SCM, a linear causal forecasting model is proposed and its coefficients are efficiently determined using the proposed genetic algorithms (GA), canonical GA and guided GA (GGA). Compared to canonical GA, GGA adopts a fitness function with penalty operators and uses population diversity index (PDI) to overcome premature convergence of the algorithm. The results obtained from two case studies show that the proposed GGA provides the best forecasting accuracy and greatly outperforms the regression analysis and canonical GA methods. A computerized system was developed to implement the forecasting functions and is successfully running in real glass manufacturing lines.
inAspect™: interfacing Java and VSIPL
Authors: V. Shah, A. Skjellum, N. Younan, T. Alford, D. Whitcomb, A. Watkins
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

In this paper, we discuss the origin, design, performance, and directions of the inAspect high-performance signal and image processing package for Java. The Vector Signal and Image Processing (VSIPL) community provides a standardized API (Application Programmer Interface) for high-performance signal and image processing plus linear algebra with a C emphasis and object-based design framework. Java programmers need high performance and/or portable APIs for this broad base of functionality as well. InAspect addresses PDA's, embedded Java boards, workstations, and servers, with emphasis on embedded systems at present. Efforts include supporting integer precisions and utilizing CORDIC algorithms, both aimed at added relevance for limited-performance environments, such as present-day PDAs.
Document clustering with cluster refinement and model selection capabilities
Authors: Xin Liu, Yihong Gong, Wei Xu, Shenghuo Zhu
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clusters in the document corpus (i.e. the model selection capability). To accurately cluster the given document corpus, we employ a richer feature set to represent each document, and use the Gaussian Mixture Model (GMM) together with the Expectation-Maximization (EM) algorithm to conduct an initial document clustering. From this initial result, we identify a set of discriminative featuresfor each cluster, and refine the initially obtained document clusters by voting on the cluster label of each document using this discriminative feature set. This self-refinement process of discriminative feature identification and cluster label voting is iteratively applied until the convergence of document clusters. On the other hand, the model selection capability is achieved by introducing randomness in the cluster initialization stage, and then discovering a value C for the number of clusters N by which running the document clustering process for a fixed number of times yields sufficiently similar results. Performance evaluations exhibit clear superiority of the proposed method with its improved document clustering and model selection accuracies. The evaluations also demonstrate how each feature as well as the cluster refinement process contribute to the document clustering accuracy.
Instant AutoCAD: Mechanical Desktop 4.0, 1st edition
Authors: Stephen J. Ethier, Christine A. Ethier
Venue:  (2000)

:This tutorial/CD-ROM package gives readers the information and hands-on practical experience they need to work knowledgeably and efficiently with Mechanical Desktop--a 3D, feature-based, parametric modeler that enables users to create models of 3D parts from 2D sketches, and using these parts, to create detail drawings and assemblies. (Mechanical Desktop is fully integrated and makes use of the AutoCAD graphic interface.) Hundreds of figures illustrate the various processes needed to move from a 2D sketch to a fully annotated drawing using a 3D solid model as the base. Concise theory is given for each new process; followed by a practical application. An accompanying CD-ROM contains numerous exercises, models, and drawings. Design Fundamentals. Part Creation. Part Editing. Part Drawing. Assembly Creation. Assembly Drawing. For anyone who wants a quick, hands-on introduction to Mechanical Desktop.
Microsoft Office XP Developer's Guide
Venue:  (2001)

:Exploit powerfully enhanced programmability in Microsoft Office XP with authoratative information straight from the Microsoft Office development team. This hardcore programming reference comes packed with practical, roll-up-your-sleeves resources to help you maximize your productivity with development tools for Microsoft Office, including the Microsoft Visual Basic 6.0 and Microsoft Visual C++ development systems. This guide includes coverage of Workflow Solutions for MIcrosoft SQL Server and MIcrosoft Exchange, offering both design and coding examples, plus API-level coding examples. It also covers enhanced support in Microsoft Office XP for Web-enabled information sharing and XML. 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
Security Complete
Authors: Eric Bell
Venue:  (2001)

:Security Complete is a one-of-a-kind book - valuable both for its broad content and its low price. The book contains the essentials you need to know about securing your environment - from protecting yourself against Trojan horses to auditing your Linux system. With Security Complete, you'll learn all about security basics including how much security you need, how to protect yourself at home, and how to ward off Internet pirates and hackers. The book also takes you into various operating systems including Windows 2000, Linux, and NetWare, showing you the tips and tricks to securing each one. Get up to speed on firewalls, remote access solutions, and Virtual Private Networks, and soon you'll be able to ensure the security of your home and business network. Security Complete introduces you to the work of some of Sybex's finest authors, so you'll know where to go to learn even more about protecting your valuable assets.
Lotus 1-2-3 Release 4 for Windows
Authors: DDC Publishing
Venue:  (1994)

:The DDC Quick Reference Guide for Lotus 1-2-3 Release 4 for Windows will save you hours searching through technical manuals for keystrokes and mouse actions. Lotus 1-2-3 Release 4 for Windows tasks may be accessed in several ways: * Using the mouse for the main menu * Using the mouse for Smarticons * Using keystrokes for the main menu * Using 'Classic keystrokes' (the traditional method used in earlier Lotus 1-2-3 releases) Tasks are listed in alphabetical order, and the template featured on the back cover provides a fast reference to Lotus 1-2-3 Release 4 for Windows 'Classic keystrokes.' 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
Error Estimates for Linear Compartmental Systems
Authors: Rupert Lasser, Sebastian Walcher
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

We present and discuss error estimates for nonautonomous linear compartmental systems. The estimates are based on Kamke's comparison theorem for cooperative differential equations.
A State-of-the-Art Survey on Software Merging
Authors: T. Mens
Venue: IEEE Transactions on Software Engineering (2002)

Software merging is an essential aspect of the maintenance and evolution of large-scale software systems. This paper provides a comprehensive survey and analysis of available merge approaches. Over the years, a wide variety of different merge techniques has been proposed. While initial techniques were purely based on textual merging, more powerful approaches also take the syntax and semantics of the software into account. There is a tendency towards operation-based merging because of its increased expressiveness. Another tendency is to try to define merge techniques that are as general, accurate, scalable, and customizable as possible, so that they can be used in any phase in the software life-cycle and detect as many conflicts as possible. After comparing the possible merge techniques, we suggest a number of important open problems and future research directions.
Networks, 1st edition
Authors: Timothy Ramteke
Venue:  (1993)

:Tim Ramteke has spent years developing this modern introduction to voice and data networks. He has combined current industry standards with the courses he teaches in advanced electronic communications technology. The result is this insightful text. Divided into four separate parts, the book provides a sound foundation in the subject and a complete assessment of state-of-the-art networking technologies. Part 1 provides the groundwork for studying networks: from telecommunications to digital signals and transmission facilities and services. Part II introduces voice networking from signals and switching to voice processing and on to virtual networks. Part III covers data networking with Wide Area Networks (WANs): from SNA to X.25, and SS7 to ISDN. Part IV covers data networking with Local Area Networks (LANs): from LANs to Novell's NetWare, and Interconnecting LANs to TCP/IP. Each chapter covers every topic so completely that each chapter can stand alone, and each one was reviewed by industry experts and academics for currency and accuracy. The text organization and the discrete nature of the chapters allow for maximum flexibility. Topics can be studied in sequence, or chosen to fit individual needs. In addition, each chapter concludes with a set of practical problems that provide a real-world grasp of the material.
Web Wisdom; How to Evaluate and Create Information Quality on the Webb, 1st edition
Authors: Janet E. Alexander, Marsha A. Tate
Venue:  (1999)

:Here is the essential reference for anyone needing to evaluate or establish information quality on the World Wide Web. Web Wisdom: How to Evaluate and Create Information Quality on the Web addresses the key concerns of Web users and Web page authors regarding reliable and useful information on the Internet. Authors Janet E. Alexander and Marsha Ann Tate introduce critical Web evaluation principles and present the theoretical background necessary to evaluate and create quality information on the Web. They include easy-to-use checklists for step-by-step quality evaluations of virtually any Web site. Alexander and Tate also address important issues related to information on the Web, such as understanding the ways that advertising and sponsorship may effect the quality of information found on the Web.
Making statistics a full partner in mathematical sciences programs
Authors: Barbara A. Wainwright, Robert M. Tardiff, Homer W. Austin
Venue: PRIMUS: problems, resources, and issues in mathematics undergraduate studies (2002)

We have developed an introductory course that exposes mathematical sciences majors to a full range of issues that most practicing statisticians may face including data acquisition, design of experiments, use of theory, and formal writing.This new course developed for mathematics majors not only requires the use of the computer in and out of the classroom for demonstrations and assignments, but also has a two hour computer laboratory once a week.In this paper, we provide a summary of the labs, and share student perspectives on the course. This laboratory-based course can easily be transported to other locations.
Programming Language Concepts, 3rd edition
Authors: Carlo Ghezzi, Mehdi Jazayeri
Venue:  (1997)

:The revision of a popular, text/reference guide analyzes and evaluates the important concepts found in current programming languages based on how the language supports software development. Revisions include a consideration of more languages, new chapters on declarative programming and formal semantics, expanded coverage of object oriented programming and operational semantics, a more thorough discussion of programming environments, as well as more examples, explanations, and exercises. Improves the reader's ability to appreciate and evaluate programming languages. Identifies the important concepts in programming languages and reviews their strengths and limitations.
Windows NT Power Tools, 1st edition
Authors: Geoffrey T. Leblond
Venue:  (1993)

:Book/disk package available exclusively from RH. The definitive guide and power toolkit to customizing, enhancing, and fine-tuning Windows NT.