ppxscal/embedding_network huggingface dataset:
Maximum Likelihood Estimation of Mixture Densities for Binned and Truncated Multivariate Data
Authors: Igor V. Cadez, Padhraic Smyth, Geoff J. McLachlan, Christine E. McLaren
Venue: Machine Learning (2002)

Binning and truncation of data are common in data analysis and machine learning. This paper addresses the problem of fitting mixture densities to multivariate binned and truncated data. The EM approach proposed by McLachlan and Jones (Biometrics, 44: 2, 571&ndash;578, 1988) for the univariate case is generalized to multivariate measurements. The multivariate solution requires the evaluation of multidimensional integrals over each bin at each iteration of the EM procedure. Naive implementation of the procedure can lead to computationally inefficient results. To reduce the computational cost a number of straightforward numerical techniques are proposed. Results on simulated data indicate that the proposed methods can achieve significant computational gains with no loss in the accuracy of the final parameter estimates. Furthermore, experimental results suggest that with a sufficient number of bins and data points it is possible to estimate the true underlying density almost as well as if the data were not binned. The paper concludes with a brief description of an application of this approach to diagnosis of iron deficiency anemia, in the context of binned and truncated bivariate measurements of volume and hemoglobin concentration from an individual's red blood cells.
Designing for Scalability with Microsoft Windows DNA, 1st edition
Authors: Sten Sundblad, Per Sundblad
Venue:  (2000)

:Microsoft® Windows® DNA is Microsofts platform for building and deploying Web-based applications. Designing for Scalability with Microsoft Windows DNA describes major technologies associated with using the DNA model to develop scalable enterprise applications. The book shows how to use Microsoft tools such as the Visual Basic® development system and the Windows 2000 operating system with Windows DNA to reduce your time to market, secure great performance and scalability, and assure development success. It includes a complete overview of Windows DNA; an introduction to Extensible Markup Language (XML), Microsoft Transaction Server (MTS), and COM+ and related Web technologies; plus practical code examples. This book shows you how to: Develop component-based applications to manage user, business, and data services. Create components on the server side using web classes and on the client side using Dynamic HTML (DHTML). Use the Microsoft Transaction Server component-based transaction processing system to develop, deploy, and manage high-performing, scalable, robust server applications.
NT Server Administrator's Bible, 1st edition
Authors: Kenneth Gregg, Robert Cowart, Doug Sheresh
Venue:  (1999)

:Updated to cover the most recent Service Pack 4, this "bible" provides an in-depth look at every aspect of Windows NT. Written from the insider perspective of a former member of the NT product group, the book steps through every aspect of installing, configuring, managing, and optimizing an NT network.
Kinetics of intermetallic formation at Sn-37Pb/Cu interface during reflow soldering
Authors: Jong-Hyun Lee, Yong-Seog Kim
Venue: Journal of Electronic Materials (2002)

The kinetics of the intermetallic layer formation at Sn-37wt.%Pb solder/Cu pad interface during reflow soldering were studied. The growth kinetics were analyzed theoretically by assuming that the mass flux of Cu through channels between scalloplike grains primarily contributes to the growth. Rate-controlling steps considered for the mass flux were the Cu dissolution from the bottom of the channels, diffusion through the channel, and the formation reaction of the intermetallic layer. These results indicated that a transition in the growth rate observed around 120-150 sec of reflow time may be associated with transition of the rate-controlling step from the Cu dissolution to the Cu diffusion through the channel.
Building Services Engineering, 3rd edition
Authors: David V. Chadderton
Venue:  (2000)

:This book is a versatile, user friendly tool for design calculations. It deals with spreadsheet use, thermal transmittance, building heat loss and heat gain, combustion analysis, fan selection, air duct design, water pipe sizing, lumen lighting design, and electricalcable sizing, all at a suitable level for practical design work. The spreadsheet applications provided with the book allow the user to inspect everything that the program undertakes. Parts of the worksheets can be copied to other cells in order to expand the size of each worksheet. Experienced spreadsheet operators can edit the cells to change the way in which data and calculations are used, and with guidance from the explanatory notes, build their own applications. 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
On the expressive power of temporal concurrent constraint programming languages
Authors: Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia
Venue: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming (2002)

The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that: (1) recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and viceversa. (2) replication can be encoded into parameterless recursive procedures with static scoping, and viceversa. (3) the languages from (1) are strictly more expressive than the languages from (2). Furthermore, we show that behavioral equivalence is undecidable for the languages from (1), but decidable for the languages from (2). The undecidability result holds even if the process variables take values from a fixed finite domain.
The management of applications for reconfigurable computing using an operating system
Authors: Grant Wigley, David Kearney
Venue: Proceedings of the seventh Asia-Pacific conference on Computer systems architecture (2002)

As the number of system gates available on reconfigurable platforms increase beyond 10 million, the issue of the management of these resources and their sharing among many applications and users will become more of a concern. This paper identifies the fundamental services that must be provided by an operating system for reconfigurable computing and describes a prototype implementation. The paper defines a contract between the application designer and the operating system whereby the application is defined as a task graph whose nodes are pre-placed and routed modules and whose edges define the data flow dependencies between the nodes. After loading by the operating system, the task graph node modules are grouped into partitions that occupy contiguous area on the FPGA surface. The implementation features new versions of algorithms for the allocation of area to tasks, the partitioning of an application to fit selected allocated areas and the placement and routing inside partitions. All the algorithms have small deterministic and bounded run times with near linear time complexity making them suitable to run in between time slices or at the initial loading stage of applications. Tests on the prototype with benchmark examples show that it is a feasible and that fragmentation of the area of the FPGA among many users is manageable.
Server-Based Java Programming
Venue:  (1999)

:Server-based Java Programming has an enterprise focus. It doesn't concentrate on one single technology. Instead, it demonstrates the power of using Java on the server and contains supporting evidence in the form of working examples. Server-based Java Programming covers the latest technologies, including: Java Servlets The Java Web server JNDI It also covers more established technologies that are relevant to successful server application development, including JDBC RMI CORBA Enterprise JavaBeans Since its perspective is enterprise development with Java, it won't teach you how to do audio or animation. However, it will explain transaction processing, distributed objects, and business application development.
On the suitability of dead reckoning schemes for games
Authors: Lothar Pantel, Lars C. Wolf
Venue: Proceedings of the 1st workshop on Network and system support for games (2002)

A major problem of network-based multiplayer games (and other distributed virtual environments) is caused by the network transmission delay. This delay leads to inconsistency and other problems. Dead reckoning is often used to reduce the effects of network induced delays and losses by applying prediction means. The quality of the prediction and, hence, the consistency of the distributed game, depends on the difference between the real and the predicted position of some objects. In this paper we discuss prediction methods for games and study their usefulness in regard to different game types (genre) like Sport, 3D-Action and racing games. Using implementations, the methods are evaluated experimentally.
Component-based derivation of a parallel stiff ODE solver implemented in a cluster of computers
Authors: Jose M. Mantas Ruiz, Julio Ortega Lopera, Jose A. Carrillo de la Plata
Venue: International Journal of Parallel Programming (2002)

A component-based methodological approach to derive distributed implementations of parallel ODE solvers is proposed. The proposal is based on the incorporation of explicit constructs for performance polymorphism into a methodology to derive group parallel programs of numerical methods from SPMD modules. These constructs enable the structuring of the derivation process into clearly defined steps, each one associated with a different type of optimization. The approach makes possible to obtain a flexible tuning of a parallel ODE solver for several execution contexts and applications. Following this methodological approach, a relevant parallel numerical scheme for solving stiff ODES has been optimized and implemented on a PC cluster. This numerical scheme is obtained from a Radau IIA Implicit Runge-Kutta method and exhibits a high degree of potential parallelism. Several numerical experiments have been performed by using several test problems with different structural characteristics. These experiments show satisfactory speedup results.
LAN Primer: The Definitive Guide to Networking Fundamentals, 2nd edition
Authors: Greg Nunemacher
Venue:  (1992)

:Learn the fundamentals of local area networks with this thorough, easy-to-understand guide. It's been updated to include expanded coverage of internetworking, plus sections on wide-area networking and enterprise-wide computing. 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
Wednesday, April 17th Luncheon Keynote
Authors: Timothy J. Muris
Venue: Proceedings of the 12th annual conference on Computers, freedom and privacy (2002)

Timothy J. Muris was sworn in June 4, 2001 as Chairman of the Federal Trade Commission. President George W. Bush named Muris, a Republican, on April 26, 2001 and he was confirmed by the Senate on May 25, 2001. Muris, 51, is the Commission's 55th Chairman. Muris has held three previous positions at the Commission: Assistant Director of the Planning Office (1974-1976), Director of the Bureau of Consumer Protection (1981-1983), and Director of the Bureau of Competition (1983-1985). After leaving the FTC in 1985, Muris served with the Executive Office of the President, Office of Management and Budget for three years, and afterward as Of Counsel with the law firm of Collier, Shannon, Rill Scott (1992-2000) and Howrey, Simon, Arnold White (2000-2001). Muris joined George Mason University School of Law as a Foundation Professor in 1988 and was interim dean of the law school from 1996 to 1997. Muris graduated with high honors from San Diego State University in 1971 and received his J.D. from UCLA in 1974. He was awarded Order of the Coif and was associate editor of the UCLA Law Review. A member of the American Bar Association's Antitrust Section, Muris has written widely on antitrust, consumer protection, regulatory, and budget issues. In 1981, he served as the Deputy Counsel to the Presidential Task Force on Regulatory Relief.
Teacher's Complete and Easy Guide to the Internet
Authors: Ann Heide, Linda Stilborne
Venue:  (1997)

:The Second Edition of this award-winning guide to the Internet features extensive revisions and updates including free CD ROM with every copy containing a wide range of curriculum-related sites and the award-winning Opera Web browser; how to use Internet technologies like streaming audio, off-line browsers, browser plug-ins as well as older resources like FTP and telnet; important new educational sites and updated site addresses from the First Edition; classroom activities for all levels; and ways to make Web searching and Web development easy.
Parallelizing the Data Cube
Authors: Frank Dehne, Todd Eavis, Susanne Hambrusch, Andrew Rau-Chaplin
Venue: Distributed and Parallel Databases (2002)

This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one for top-down and one for bottom-up cube algorithms. Both partitioning strategies assign subcubes to individual processors in such a way that the loads assigned to the processors are balanced. Our methods reduce inter processor communication overhead by partitioning the load in advance instead of computing each individual group-by in parallel. Our partitioning strategies create a small number of coarse tasks. This allows for sharing of prefixes and sort orders between different group-by computations. Our methods enable code reuse by permitting the use of existing sequential (external memory) data cube algorithms for the subcube computations on each processor. This supports the transfer of optimized sequential data cube code to a parallel setting.The bottom-up partitioning strategy balances the number of single attribute external memory sorts made by each processor. The top-down strategy partitions a weighted tree in which weights reflect algorithm specific cost measures like estimated group-by sizes. Both partitioning approaches can be implemented on any shared disk type parallel machine composed of p processors connected via an interconnection fabric and with access to a shared parallel disk array.We have implemented our parallel top-down data cube construction method in C++ with the MPI message passing library for communication and the LEDA library for the required graph algorithms. We tested our code on an eight processor cluster, using a variety of different data sets with a range of sizes, dimensions, density, and skew. Comparison tests were performed on a SunFire 6800. The tests show that our partitioning strategies generate a close to optimal load balance between processors. The actual run times observed show an optimal speedup of p.
Customizing and Upgrading Linux,2nd Edition, 2nd edition
Authors: Linda McKinnon, Al McKinnon
Venue:  (2002)

:In order to fulfill Linux's promise of delivering speed, efficiency, and reliability to a network, you must be able to properly customize and perform upgrades on this operating system. Updated to reflect all the recent changes to the core Linux kernel up through version 2.4, this new edition of the McKinnons' popular book gets you quickly up to speed on everything you need to know to customize and upgrade your Linux systems. Following the highly successful approach that the McKinnons have refined during their years as professional trainers, this accessible guide takes you step-by-step through the decisions and procedures required to customize Linux and make use of the many available upgrades.
MARC: Keystone for Library Automation
Authors: Sally H. McCallum
Venue: IEEE Annals of the History of Computing (2002)

Libraries' most central and costly activity-cataloging material and maintaining the catalogs providing end-user access-had requirements that defied efficient automation until the mid-1960s, when the Library of Congress developed the MARC format for data records. The format became the foundation for automated systems for libraries that took data sharing to new levels and enabled exploitation of future computer developments to create today's online catalog environment.
Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study
Authors: Helen C. Purchase, Matthew McGill, Linda Colpoys, David Carrington
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

Many existing automatic graph layout algorithms are unrelated to any particular semantic domain. Designers of such algorithms tend to conform to layout aesthetics, and claim that by doing so, the resultant diagram is easy to understand. Few algorithms are designed for a specific domain, and there is no guarantee that the aesthetics used for generic layout algorithms will be useful for the visualisation of domain-specific diagrams (for example, visual programs, or entity-relationship diagrams). This paper describes a study which aimed to identify the most important aesthetics for the automatic layout of UML class diagrams from a human comprehension point of view. The results suggest that for specific domains, the actual semantics of the given graph may need to be considered before an appropriate graph drawing can be produced.
Copyright and Innovation: the P2P Experience
Authors: Peter Menell, Fred von Lohmann, Sarah Deutsch, frank Hausmann, Mark Litvack
Venue: Proceedings of the 12th annual conference on Computers, freedom and privacy (2002)

The P2P lawsuits are piling up: Napster, Scour, Aimster, Morpheus. Although the rhetoric is about piracy, the litigation is about technology. In every P2P case to date, copyright owners have targeted the technologists, instead of the end-users doing the infringing. What does this mean for the peer-to-peer industry, and what lessons should be drawn by other technology innovators? Are we entering a world where technologists will be held liable for the activities of their end-users?
Computers for integrative instruction in bioengineering labs
Authors: Norman Chonacky, Mitchell Litt
Venue: Computing in Science and Engineering (2001)

The authors review the work of two biomedical engineering departments that use computers in their laboratory courses to integrate labs into the broader curricula. The review is set in the context of other related developments in current BME research practices and educational reform work occurring nationally.
Teach Yourself Word 97 Visually, 1st edition
Authors: Ruth Maran
Venue:  (1997)

:Instead of simply telling you about Word 97s dynamic new features, graphics specialists Ruth Maran and Kelleigh Wing show you with Teach Yourself Word 97 VISUALLY, part of IDG Books best-selling 3-D Visual series. With 600 full-color illustrations and over 300 full-color pages, this book offers a concise, user-friendly approach to understanding and mastering Microsoft Word 97. Teach Yourself Word 97 VISUALLY explains text formatting, the graphic interface, smart editing, time-saving features, mail merging, and Word and the Internet. Each chapter is full of detailed illustrations that show you where to click, where to scroll, what to choose, and how to successfully execute Word 97 tasks. Whats more, Teach Yourself Word 97 VISUALLY includes tip boxes with answers to frequently asked questions and a detailed introductory chapter on getting started.
Cookies
Authors: Simon St Laurent, Simon st Laurent
Venue:  (1998)

:Suppose you had the only cookies in town? That's what this book gives you. Cookies is the only book to focus on this important programming tool that helps users keep track of where they are in a Web site. This book gives developers and content providers every crumb of information they need about cookies! Cookies' Unique Ingredients: details that developers need to create cookies with maximum functionality; tools,techniques,and standards for both Netscape and Explorer; Cookies and Java-when,how,and whether to use them; help in anticipating and meeting new standards; simulated cookies for browsers that can't handle or refuse cookies; alternative to cookies,including Open-Profiling Standard,digital signatures,and proposed security models; site architecture considerations; facilitating electronic commerce with cookies; cookies,responsibility,and privacy.
Handbook of Walkthroughs, Inspections, and Technical Reviews: Evaluating Programs, Projects, and Products, 3rd edition
Authors: Daniel P. Freedman, Gerald M. Weinberg
Venue:  (2000)

:To err is indeed human, and reviews have proved to be the most cost-effective method in use for error detection and removal. In this highly acclaimed third edition, you'll learn exactly how to implement reviews for all sorts of product and software development. The book spells out procedures to conduct walkthroughs (or peer-group reviews), inspections, and technical reviews, with extensive checklists for each type of material reviewed (including specification, design, and code reviews). Using a lively question-and-answer format, this complete reference also describes ways to avoid problems that often accompany the review process. By implementing reviews, you can spot and eliminate defects at the source  before your customers find them.
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms
Authors: Noga Alon, Benny Sudakov, Uri Zwick
Venue: SIAM Journal on Discrete Mathematics (2002)

Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques. Are the bounds obtained in this way tight? This problem was considered before by Karloff [SIAM J. Comput., 29 (1999), pp. 336--350] and by Alon and Sudakov [ Combin. Probab. Comput., 9 (2000), pp. 1--12]. Here we further extend their results and show, for the first time, that the local analyses of the Goemans and Williamson MAX CUT algorithm, as well as its extension by Zwick, are tight for every possible relative size of the maximum cut in the sense that the expected value of the solutions obtained by the algorithms may be as small as the analyses ensure. We also obtain similar results for a related problem. Our approach is quite general and could possibly be applied to some additional problems and algorithms.
Management Information Systems, 2nd edition
Authors: Robert A. Schultheis, Mary Sumner, Douglas Brian Bock
Venue:  (1992)

:MIS courses are offered in schools of business either at the undergraduate level in the junior/senior year,or at the MBA level.
Kolmogorov complexity conditional to large integers
Authors: Nikolai K. Vereshchagin
Venue: Theoretical Computer Science (2002)

The main result of the paper states that the following two values coincide for any string x: limsupnK(x|n) and the minimum length of a program that producesx given all sufficiently large integers. Previously it was known that the latter value is equal to the Kolmogorov complexity of x relativized by 0. (All equalities hold up to a constant additive term.)