ppxscal/embedding_network huggingface dataset:
The Evolution of Wired Life: From the Alphabet to the Soul-Catcher Chip--How Information Technolgies Change Our World, 1st edition
Authors: Charles Jonscher
Venue:  (1999)

:Critically acclaimed author Charles Jonscher examines the computer revolution in the context of the development of new information technologies throughout human history. From the invention of the first alphabet 3,700 years ago to the printing press to the World Wide Web, Jonscher shows how these communication developments have changed society while also highlighting their limits, and answers popular questions about our latest technological journey. He emphasizes a vital point: no other calculating machine can match the creative power of the human mind. As he writes: "Even with the development of virtual-reality systems, the notion of a large-scale substitution for live contact with real people and tangible goods is to underestimate greatly the subtlety and sensitivity of the human sensory process.". 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
Automatic Recovery from Disk Failure in Continuous-Media Servers
Authors: Jack Y. B. Lee, John C. S. Lui
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Continuous-media (CM) servers have been around for some years. Apart from server capacity, another important issue in the deployment of CM servers is reliability. This study investigates rebuild algorithms for automatically rebuilding data stored in a failed disk into a spare disk. Specifically, a block-based rebuild algorithm is studied with the rebuild time and buffer requirement modeled. A buffer-sharing scheme is then proposed to eliminate the additional buffers needed by the rebuild process. To further improve rebuild performance, a track-based rebuild algorithm that rebuilds lost data in tracks is proposed and analyzed. Results show that track-based rebuild, while it substantially outperforms block-based rebuild, requires significantly more buffers (17-135 percent more) even with buffer sharing. To tackle this problem, a novel pipelined rebuild algorithm is proposed to take advantage of the sequential property of track retrievals to pipeline the reading and writing processes. This pipelined rebuild algorithm achieves the same rebuild performance as track-based rebuild, but reduces the extra buffer requirement to insignificant levels (0.7-1.9 percent). Numerical results computed using models of five commercial disk drives demonstrate that automatic rebuild of a failed disk can be done in a reasonable amount of time, even at relatively high server utilization (e.g., less than 1.5 hours at 90 percent utilization).
Understanding Human Sexuality, 8th edition
Authors: Janet Shibley Hyde, John D. DeLamater
Venue:  (2002)

:Understanding Human Sexuality has always been a leader in the field,from the first edition in 1970 through the fifth edition in 1994. It is the "classic" that new books try to beat. It combines a readable,engaging style that appeals to students from diverse backgrounds,with exceptionally careful scholarship. Most human sexuality courses,especially those in psychologcial and social materials,as well as information about sexual health. This text is broad-based and comprehensive to meet this need. The book has always given solid coverage to the social sciences. Its multidisciplinary character has been strengthened with the addition of John DeLamater,a social psychologist and Professor of Sociology,as a co-author.
The determination of the interface-state density distribution from the capacitance-frequency measurements in Au/n-Si Schottky barrier diodes
Authors: E. Ayyildiz
Venue: Journal of Electronic Materials (2002)

The Au/n-Si Schottky barrier diodes (SBDs) with 200-µm (sample D200) and 400-µm (sample D400) bulk thicknesses have been fabricated. The ideality factor and the barrier height have been calculated from the forward-bias current-voltage (I-V) characteristics of D200 and D400 SBDs. The energy distribution of the interface states and relaxation time are found from the capacitance-frequency (C-f) characteristics. The density of interface state and relaxation times have a (nearly constant) slow exponential rise with bias in the range of Ec -0.77 and Ec -0.47 eV from the midgap toward the bottom of the conductance band. Furthermore, the energy distribution of the interface states obtained from C-f characteristics has been compared with that obtained from the forward-bias I-V characteristics.
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
Authors: Vincent Bouchitté, Ioan Todinca
Venue: SIAM Journal on Computing (2002)

We use the notion of potential maximal clique to characterize the maximal cliques appearing in minimal triangulations of a graph. We show that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. We prove that for all classes of graphs for which polynomial algorithms computing the treewidth and the minimum fill-in exist, we can list their potential maximal cliques in polynomial time. Our approach unifies these algorithms. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs for which the treewidth and the minimum fill-in problems were open.
Approximation Algorithms for Single-Source Unsplittable Flow
Authors: Stavros G. Kolliopoulos, Clifford Stein
Venue: SIAM Journal on Computing (2002)

In the single-source unsplittable flow problem, we are given a network G, a source vertex s, and k commodities with sinks ti and real-valued demands $\rho_i,$ $1\leq i \leq k.$ We seek to route the demand $\rho_i$ of each commodity i along a single s-ti flow path so that the total flow routed across any edge e is bounded by the edge capacity ue. The conceptual difficulty of this NP-hard problem arises from combining packing constraints due to the existence of capacities with path selection in a graph of arbitrary topology. In this paper we give a generic framework, which yields approximation algorithms that are simpler than those previously known and achieve significant improvements upon the approximation ratios. Our framework, with appropriate subroutines, applies to all optimization versions previously considered and, unlike previous work, treats in a unified manner directed and undirected graphs. We provide extensions of our algorithms which yield the best possible approximation guarantees for restricted sets of demand values and an associated scheduling problem.
Sams Teach Yourself Visual Basic 6 in 24 Hours, 2nd edition
Authors: Greg M. Perry, Sanjaya Hettihewa
Venue:  (1998)

:The niche of this book is that it not only focuses on the topic at hand but it also provides a battery of tools/skills that will take the user at a higher level and help him/her realize the skills without waiting to read another book on some other topic they need to know if they wanted to implement it in real life. It is a self contained, stand alone book. Follows the step-by-step approach of the Sams' Teach Yourself series and gives the reader a quick, concise introduction to this programming language. It will explain the basics of Visual Basic through task-oriented examples and a hands on approach. Topics covered include: Basics of Visual Basic development Creating and using ActiveX controls Database programming Internet programming Basics of Object Oriented Programming (OOP) with Visual BasicDelivers on the promise of explaining application development with Visual Basic in a short amount of time.This title focuses on the most important aspects of programming in Visual Basic teaching the reader only what they need to know with no fluff.The first edition, Teach Yourself Visual Basic 5 in 24 Hours, is a proven best-seller that is still selling well.
Neural Computation and Self-Organizing Maps; An Introduction, 1st edition
Authors: Helge Ritter, Thomas Martinetz, Klaus Schulten
Venue:  (1992)

:This is a comprehensive introduction to neural networks and neural information processing. It also describes the most important models of neural networks and how they contribute to our understanding of information and organization processes in the brain.
On a particular class of minihypers and its applications: II. Improvements for q square
Authors: P. Govaerts, L. Storme
Venue: Journal of Combinatorial Theory Series A (2002)

A particular class of minihypers was studied previously by the authors (in press, Des. Codes Cryptogr.). For q square, this paper improves the results of that work, under the assumption that no weights occur in the minihyper. Using the link between these minihypers and maximal partial s-spreads of PG(N, q), (s+1)| (N+1), the findings on minihypers translate immediately into results on the extendability of partial s-spreads with small positive deficiency. Other applications of this characterisation of minihypers are given by P. Govaerts et al. (in press, European J. Combin.).
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
Authors: Rémy Malgouyres, Malika More
Venue: Theoretical Computer Science (2002)

We study the computational complexity of some well-known problems of 2D digital topology. We prove that all considered problems (including reachability in 2D binary images, connectivity, lower homotopy and symmetric homotopy) are in LogSpace. We prove that reachability in 2D binary images and some other problems are NC1-hard. Finally, we prove that most of the considered problems are not in AC0.
Special Edition Using C#
Venue:  (2001)

:Visual C#.NET is a completely new language engineered by Microsoft to encompass the strengths and fix the problems of C, C++, and Visual Basic. Special Edition Using Visual C#.NET will provide a comprehensive training and reference resource to readers. The book includes extensive information on C# and how it works with the NGWS runtime environment, Visual C++.NET, Java, Jscript, Visual Basic.NET, ADO+, ASP.NET plus much more. As part of the Special Edition Using series, the book is a comprehensive training guide with multiple programming examples and projects as well as a complete reference to C# and its intricacies. Because it is a book written for IT professionals and students, special emphasis is put on troubleshooting, debugging, and hands-on learning. The authors of SE Using Visual C#.NET come to Que from NIIT, a global, multifaceted organization based in India specializing in software development, education, training and e-business solutions. NIIT has the world's largest educational multimedia software development facility with a team of over 700 instructional design professionals and provides computer training at 1,970 learning centers in 26 different countries including the United States. NIIT has received many awards for their excellence in training and programming including the "Best Training Award" from Microsoft. 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, Computability, and Density
Authors: Rod G. Downey, Denis R. Hirschfeldt, André Nies
Venue: SIAM Journal on Computing (2002)

We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1975] and studied by Calude, Hertling, Khoussainov, and Wang [Theoret. Comput. Sci., 255 (2001), pp. 125--149], Calude [Theoret. Comput. Sci., 271 (2002), pp. 3--14], Kucera and Slaman [SIAM J. Comput., 31 (2002), pp. 199--211], and Downey, Hirschfeldt, and LaForte [Mathematical Foundations of Computer Science 2001, Springer-Verlag, Berlin, 2001, pp. 316--327], among others. This measure is called domination or Solovay reducibility and is defined by saying that $\alpha$ dominates $\beta$ if there are a constant c and a partial computable function $\varphi$ such that for all positive rationals $qIn this paper we are concerned with structural properties of the degree structure generated by Solovay reducibility. We answer a natural question in this area of investigation by proving the density of the Solovay degrees. We also provide a new characterization of the random computably enumerable reals in terms of splittings in the Solovay degrees. Specifically, we show that the Solovay degrees of computably enumerable reals are dense, that any incomplete Solovay degree splits over any lesser degree, and that the join of any two incomplete Solovay degrees is incomplete, so that the complete Solovay degree does not split at all. The methodology is of some technical interest, since it includes a priority argument in which the injuries are themselves controlled by randomness considerations.
Saturated Perceptrons for Maximum Margin and Minimum Misclassification Error
Authors: Jesús Cid-Sueiro, José L. Sancho-Gómez
Venue: Neural Processing Letters (2001)

This Letter discusses the application of gradient-based methods to train a single layer perceptron subject to the constraint that the saturation degree of the sigmoid activation function (measured as its maximum slope in the sample space) is fixed to a given value. From a theoretical standpoint, we show that, if the training set is not linearly separable, the minimization of an Lp error norm provides an approximation to the minimum error classifier, provided that the perceptron is highly saturated. Moreover, if data are linearly separable, the perceptron approximates the maximum margin classifier
The pLab project: an extensible architecture for physically-based simulations
Authors: Tom Van Laerhoven, Frank Van Reeth
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

Pluggable architectures have become a popular means of creating extensible applications. Traditional plugins however are mostly fixed, single-purpose extensions that have only limited capabilities. We present a framework that allows the building of pluggable applications in which the plugins mainly deliver flexible building blocks or components that are put in place using an XML document. This way, the XML document actually serves as a blueprint of the component layout, instantiating the behavior of an application. The framework is to be used in combination with the ongoing research in the domain of physically-based modeling and simulation.
Using Visual Basic 6
Authors: Bob Reselman, Eric A. Smith, Richard A. Peasley
Venue:  (1998)

:Using Visual Basic X is broken into four sections. Part One is Visual basic and its Integrated Development Environment. Part Two takes the reader through the concepts and practices that are applicable not only to Visual basic programming, but other programming environments as well. Part Three teaches programming tools and techniques Part Four introduces the advanced features including database programming, ActiveX controls, and objects oriented programming.This book will teach readers Visual Basic X quickly and easily. It will focus on the most important aspects of programming in VB.Just as Visual Basic has the power and versatility to suit the needs of any programmer, this title will be a valuable resource for beginning and intermediate programmers.New and unique "also known as" indexing technique makes Using Visual Basic X the fastest method of finding information about Visual Basic
"Kilauea": parallel global illumination renderer
Authors: Toshi Kato, Jun Saito
Venue: Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization (2002)

'Kilauea' is a revolutionary parallel renderer developed at Square USA. The goal of the R&D effort was to create a renderer which can compute global illumination on extremely complex scenes by using affordable PC cluster. This paper reports Kilauea's parallel processing methodology, implementation issues, and parallel performance.
Networked surfaces: a new concept in mobile networking
Authors: James Scott, Frank Hoffmann, Mike Addlesee, Glenford Mapp, Andy Hopper
Venue: Mobile Networks and Applications (2002)

Networked Surfaces are surfaces which provide networking to specially augmented objects when these objects are physically placed on top of the surface. When an object (e.g., a notebook computer) connects, a handshaking protocol assigns functions such as data or power transmission to the various conducting paths that are established. This paper describes the position occupied by this concept in the world of networking, presents an overview of the technology used in its realisation, describes the current prototype implementation, and outlines the implications in the fields of Ubiquitous and Sentient Computing.
Sams Teach Yourself Visual J++ 6 in 21 Days, 1st edition
Authors: Rick Leinecker
Venue:  (1998)

:In just 21 days, you'll have all the skills you need to create Java applications with Visual J++. With this complete tutorial, you'll master the basics and then move on the more advanced features and concepts of Java and Visual J++. This book is designed for the way you learn. Go chapter by chapter through the step-by-step lessons or just choose those lessons that interest you the most.
Locating all the zeros of an analytic function in one complex variable
Authors: Michael Dellnitz, Oliver Schütze, Qinghua Zheng
Venue: Journal of Computational and Applied Mathematics (2002)

Based on the argument principle, we propose an adaptive multilevel subdivision algorithm for the computation of all the zeros of an analytic function f : C --> C within a bounded domain. We illustrate the reliability of this method by several numerical examples.
Cybershock: Surviving Hackers, Phreakers, Identity Thieves, Internet Terrorists, and Weapons of Mass Disruption
Authors: Winn Schwartau
Venue:  (2000)

:"The well-insulated public has not yet had the opportunity to learn what hackers and hacking are really all about: they don't understand the full scope of hacking and how profoundly it's changing all of our lives," says author Winn Schwartau. Written for the layperson, Schwartau takes the reader from the basics (What is hacking? Who hacks?); through actual hacking tools and techniques; to corporate, law enforcement, and military hacking policies; to how to become a successful antihacker. It provides balanced viewpoints through words and images from the principal figures in the hacking and antihacking worlds: corporate security experts, lawyers, judges, security-conscious military and government officers, and hackers and phreakers themselves.
Beginning Programming for Dummies, 2nd edition
Authors: Wallace Wang, Wally Wang
Venue:  (2001)

:Your fun and easy guide to BASIC programming and beyond! Liberty BASIC, REALbasic, Perl, and more on CD-ROM Includes overviews of HTML, Java applets, JavaScript, and Python Find out just how easy it is to write computer programs Want to start programming but don't know where to start? Don't worry! With loads of examples and a dash of humor, author Wallace Wang demystifies programming concepts, shows you how to write cool Windows programs in Liberty BASCI, and introduces you to some of today's hottest programming languages. Discover how to: *Get up to speed on programming fundamentals *Write and debug Liberty BASIC programs *Work with graphics, sounds, and data structure *Get a handle on Web programming All this on the bonus CD-ROM Liberty BASIC and other shareware: *TrueBasic, Pocket C, PC Native Oberon, and other demos *Python and Perl open source software *Plus sample code from the book and a bonus chapter, "Programming in Python" *System Requirements: PC running Windows 95 or later, Windows NT4 or later; Power Macintosh running System 7.6 or later; See the About the CD Appendix for details and complete system requirements. Get smart! *Register to win cool prizes *Browse exclusive articles and excerpts *Get a free Dummmies DailyTM e-mail newsletter *Chat with authors and preview other books *Talk to us, ask questions, get answers
Guide to Programming Logic and Design - Comprehensive
Authors: Joyce Farrell
Venue:  (1999)

:This title is a language-independent introduction to programming logic. It provides users with a structural approach to problem-solving in any language
Professional XML Web Services, 1st edition
Authors: Wrox Author Team, Chris Dix, Rajesh Chawla, Vivek Chopra, Tony Hong, Francis Norton, Ogbuji
Venue:  (2001)

:Web Services are self-describing, modular applications. The Web Services architecture can be thought of as a wrapper for the application code. This wrapper provides standardized means of: describing the Web Service and what it does; publishing it to a registry, so that it can easily be located; and exposing an interface, so that the service can be invoked - all in a machine-readable format. What is particularly compelling about Web Services is that they can be accessed by any client that understands XML, regardless of the platform, language, or object model. This book provides a snapshot of the current state of these rapidly evolving technologies, beginning by detailing the main protocols that underpin the Web Services model (SOAP, WSDL, and UDDI), and then putting this theory to practical use in a wide array of popular toolkits, platforms, and development environments. The technologies presented in this book provide the foundations of Web Services computing, which is set to revolutionize Distributed Computing, as we know it. This book covers: The architecture of Web Services - past, present, and future Detailed explanation of SOAP 1.1 An overview of SOAP 1.2 IBM Web Services Toolkit and Microsoft SOAP toolkit 2.0 Other SOAP implementations in Perl, C++, and PHP Java Web Services with Apache SOAP WSDL 1.1, UDDI 1.0, and 2.0 Creating and deploying Web Services using .Net Building Web Services using Python Applying security at both transport and application levels
Publish Yourself on CD-ROM: Mastering CDs for Multimedia
Authors: Fabrizio Caffarelli, Deirdre Straughan
Venue:  (1992)

:Book/CD package takes designers step-by-step through CD-ROM creation, from data preparation to premastering through mastering to Gold CD, for a variety of formats and technologies. Explains hardware, software, and existing CD-Creations Sys
Ibis: an efficient Java-based grid programming environment
Authors: Rob V. van Nieuwpoort, Jason Maassen, Rutger Hofman, Thilo Kielmann, Henri E. Bal
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

In computational grids, performance-hungry applications need to simultaneously tap the computational power of multiple, dynamically available sites. The crux of designing grid programming environments stems exactly from the dynamic availability of compute cycles: grid programming environments (a) need to be portable to run on as many sites as possible, (b) they need to be flexible to cope with different network protocols and dynamically changing groups of compute nodes, while (c) they need to provide efficient (local) communication that enables high-performance computing in the first place.