ppxscal/embedding_network huggingface dataset:
pRAM: the probabilistic RAM neural processor
Authors: Trevor G. Clarkson
Venue: Hardware implementation of intelligent systems (2001)

The pRAM has been implemented as a VLSI processor incorporating 256 neurons with on-chip learning. Several such processors may be connected to form larger networks. The pRAM was originally conceived to model the noisy release of neurotransmitter vesicles in synaptic connections. In a network, it forms n-tuples and may operate as a noisy lookup table with generalization. The reinforcement training used is also biologically realistic and has a scope ranging from a single neuron to the whole network, the architecture being user defined.
Cisco CCNA Certification Box, 1st edition
Authors: Syngress Media Inc.
Venue:  (1999)

:A total of 800 questions are reviewed by a panel of CCIEs, including 500 of the tough scenario-based questions. A companion CD-ROM contains "Test Yourself" software with links back into the text for further review. 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
Time Marching Multilevel Techniques for Evolutionary Dissipative Problems
Authors: B. Costa, L. Dettori, D. Gottlieb, R. Temam
Venue: SIAM Journal on Scientific Computing (2001)

In this article we use a pseudospectral Fourier discretization in conjunction with a multilevel splitting of high and low modes to solve dissipative partial differential equations. We develop unconditionally stable explicit techniques for the temporal integration of the linear terms and apply them to the high modes equation, improving the overall temporal stability of the multilevel method and resulting in a competitive fully explicit numerical scheme for nonlinear problems. In the cases where the linear term determines the time step restriction, numerical experiments with the Burgers equation in one and two dimensions showed substantial CPU cost reduction when comparing the resulting method with the standard spectral collocation associated with regular temporal integration schemes.
Architectural Drawing and Light Construction, 6th edition
Authors: Joel F. John Muller, James G. Fausett, Philip A. Grau, James G. Fousch
Venue:  (2001)

:Using clear, concise explanations and numerous illustrations, this book introduces the basics of architectural design and practice along with construction documentation and practice. This book provides the most current information on architecture and construction including modern residential planning, environmental considerations, computer-aided design and drafting, building codes, and lettering. For architects and other construction professionals who want a thorough treatment of the basics of architecture.
Software, performance, or engineering?
Authors: Daniel A. Menascé
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

This paper discusses why Software Engineering (SE) methods often fail to produce software systems that meet their performance requirements. Five issues are raised: lack of required scientific principles and models in SE, lack of education in performance, IT workforce shortage, single-user and small database mindsets.
Teach Yourself NetScape Communicator Visually, 1st edition
Authors: Ruth Maran
Venue:  (1997)

:Navigator 4, the centerpiece of the new Communicator suite, is the most exciting software release from Netscape since the company's first Web browser burst onto the scene just a few short years ago. Now, with Teach Yourself Netscape Navigator 4 VISUALLY, you'll be up and running right away with all of Communicator's powerful features. Like all the books in the best-selling Teach Yourself VISUALLY series, Teach Yourself Netscape Navigator 4 VISUALLY doesn't just explain how to use a program, it shows you. Thanks to illustrations by renowned maranGraphics, you see exactly where to click, what to type, and what to drag-and-drop. Turn to Teach Yourself Netscape Navigator 4 VISUALLY for step-by-step coverage of topics such as What the Internet is and what's special about the World Wide Web portion of the Internet How to install and set up your Netscape Communicator software What the Professional edition of Netscape Communicator has to offer What a URL is and how to enter it into Navigator so that you can browse a Web site How to select a hypertext link to go from one page or site to another How to bookmark a page so you can visit it again (and how to organize all those bookmarks as they begin to accumulate) How to browse pages containing sound, animation, virtual reality, and other special kinds of material How to exchange e-mail with anyone, anywhere -- and how to filter out unsolicited e-mail ("spam") automatically How to participate in discussion groups Plus, Teach Yourself Netscape Navigator 4 VISUALLY even shows you how touse Communicator's Composer feature to create and publish your own Web pages, as well as how to take advantage of Netscape Conference to chat, exchange files, and whiteboard with Internet users anywhere in the world.
Network caching strategies for reservation-based multimedia services on high-speed networks
Authors: Bharadwaj Veeravalli, Eu Min Yew
Venue: Data Knowledge Engineering (2002)

In this paper, we address the problem of minimizing the cost of transferring a multimedia document or a file requested by a set of users geographically separated on a network of nodes. Following the information caching[1] paradigm introduced in the literature for video-on-reservation scheme [3], we present polynomial-time optimal caching strategies that minimize the total monetary cost of all the service requests by the users on a high speed network of arbitrary topology. We consider a scenario in which a large pool of customers from one or more remote sites on a network demand a document, situated at some site, for their use. We also assume that the users can request the document at different time instants. This process of distributing the requested document incurs communication costs due to the use of communication resources and caching costs of the document at some server sites before it is delivered to the users at their desired time instances. We assume that the size of the document is very small and incurs no communication delays while transferring from one node to another. We consider a generalized version of the problem considering an arbitrary network topology where personalized service agents, manage and control the distribution of the requested document among the users. For a high speed network, we show that a single copy of the requested document is sufficient to serve all the user requests in an optimal manner. As an extension we present a discussion on the case when there are multiple requests at the same instant in time. Using the strategies proposed, the network service providers can decide when, where, and for how long the requested documents must be cached at vantage sites to obtain an optimal solution. Illustrative examples are provided to ease the understanding.
Making IT happen - at Indiana University
Authors: Diane Jung, Charles Rondot
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Opportunities to enhance students' educations through use of information technology are often missed because students are unaware that the services and resources exist.At Indiana University a unified and rich array of technology is available to our over 100,000 students on our eight campuses. Even so, the annual technology user survey, distributed randomly to a subset of the University community, demonstrates that we need to do much more to increase awareness about information technology tools available."Making IT Happen," an annual campaign to enhance information technology awareness was initiated to address this need. The event takes place across all Indiana University campuses. The design and planning of the event is done by the Communications and Planning Office which is affiliated with the Office of the Vice President for Information Technology. Staff based in both Bloomington and Indianapolis teamed up to brainstorm a blueprint for the event. This effort has resulted in a unified execution and in minimized planning time on the part of the regional campuses.This paper describes the processes we went through to arrive at our current model which is both flexible enough to leverage unique strengths yet unified to work on all of the Indiana University campuses.
Solidworks for AutoCAD Users, 2nd edition
Authors: David Murray, Gregory Jankowski
Venue:  (1999)

:By zeroing in on the fundamental differences between AutoCAD® and SolidWorks, this book is intended to assist design engineers in making a rapid transition from 2D (AutoCAD Release 14) to a 3D (SolidWorks 99) design environment. Now fully updated based on SolidWorks 99 - one of the hottest Windows-native, 3D, parametric modeling applications available - this handy reference includes sample design sessions, command and function cross-references, discussions on data interchangeability, and more. New material is also included on important SolidWorks 99 additions and enhancements, including: 3D dynamic sketching, layering, design table and BOM improvements, "smart mates," creation of linear and circular patterns in Sketch mode, plus "unrolling" conical sheetmetal models for viewing.
Incorporating energy efficient data structures into modular software implementations for internet-based embedded systems
Authors: E. G. Daylight, T. Fermentel, C. Ykman-Couvreur F. Catthoor
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

In current day software design of Internet applications, a lot of attention is paid to the reusability and extensibility of the design. However, due to an increased participation of embedded, hand-held devices in Internet activity, migrating code on the Internet has to be designed and implemented well in terms of energy consumption, execution speed, and on-chip memory space consumption. These parameters should be treated equally with respect to other more common design criteria. This paper introduces tradeoffs between energy consumption and on-chip memory space consumption during the implementation phase of such a system. The content-aware knowledge of the designer is exploited during the implementation so that energy efficient data structures are implemented in a relatively easy way. We also show that optimizing for energy consumption is not necessarily the same as optimizing for execution speed (or vice versa).Gains in energy consumption and/or execution speed are presented for only a relatively small overhead in on-chip memory space consumption. Depending on the behaviour of the adjacent software modules (of the module under investigation) on the one hand, and some general platform related criteria on the other hand, we show that non-trivial data structure implementations can lead to a better matching of the software onto the platform.
Home Automation Basics: Practical Applications Using Visual Basic 6
Authors: Thomas E. Leonik
Venue:  (2000)

:Did the mailman come today or not? How many times did the kids run in and out today? How long does the air conditioner usually run? So many questions-all of which can be answered with a monitoring system as part of an automated home. In Home Automation Basics, Thomas E. Leonik, P.E. shows you how to utilize Visual Basic 6 in a home-monitoring system. Some day soon, all the functions of your home will be automated by a Programmable Logic Controller (PLC), the backbone of all industrial controls in the world. Trailblazing toward that new era, Leonik demonstrates just how easy it is to establish ground-level communications with a PLC through Visual Basic. Visual Basic 6 is a flexible programming language that operates through Microsoft(r) Windows. With the help of a companion CD-ROM, Home Automation Basics guides you through the programming and installation portions of this project, giving you the ability to monitor a variety of functions in your home or office, including: Front doorbell Door open/closed status Water-pump usage HVAC usage Mailbox status Temperature Water pressure 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
Embedding a Tcl web server into APL
Authors: Tilman P. Otto
Venue: Proceedings of the 2001 conference on APL: an arrays odyssey (2001)

Tcl stands for Tool Command Language. It is a script language, but unlike the well-known perl, it is also an extensible interpreter that is designed to be easily embedded into other applications. The Tcl source code is available from the Internet and the package can be used freely even in commercial applications. In addition to its condensed notation and simple syntax, APL's strength is its powerful array handling capacity. Tcl is based on string handling and very strong on gluing different pieces of software together. It is especially the many available Tcl extensions for GUI, network, database, HTML and XML support, which make the combination of APL and Tcl very attractive.With the implementation of a few new APL system commands into the APL2C system, it is possible to create one or several Tcl interpreters from within APL. As each of the Tcl interpreters runs on its own thread, a synchronization mechanism is provided for the communication between APL and Tcl. As an example, a Tcl web server with an APL backbone has been realized to demonstrate the power of the combination between APL and Tcl.
Discovering AutoCAD 2002, 1st edition
Authors: Mark Dix, Paul Riley
Venue:  (2002)

:Get Active with Discovering AutoCAD 2002. Mark Dix and Paul Riley use a hands-on, activity-based, introductory tutoriual to teach new features and the new flavor of AutoCAD 2002. Users of Discovering AutoCAD 2002 don't just use this book as a reference, they actively create drawings as they flip pages. The new edition now features its own website that includes supplemental drawing projects, WWW activities, and self-scoring quizzes.
Anisotropic diffusion of surfaces and functions on surfaces
Authors: Chandrajit L. Bajaj, Guoliang Xu
Venue: ACM Transactions on Graphics (TOG) (2003)

We present a unified anisotropic geometric diffusion PDE model for smoothing (fairing) out noise both in triangulated two-manifold surface meshes in IR3 and functions defined on these surface meshes, while enhancing curve features on both by careful choice of an anisotropic diffusion tensor. We combine the C1 limit representation of Loop's subdivision for triangular surface meshes and vector functions on the surface mesh with the established diffusion model to arrive at a discretized version of the diffusion problem in the spatial direction. The time direction discretization then leads to a sparse linear system of equations. Iteratively solving the sparse linear system yields a sequence of faired (smoothed) meshes as well as faired functions.
Transformations on Regular Nondominated Coteries and Their Applications
Authors: Kazuhisa Makino, Tiko Kameda
Venue: SIAM Journal on Discrete Mathematics (2001)

A coterie under an underlying set U is a family of subsets of U such that every pair of subsets has at least one element in common, but neither is a subset of the other. A coterie C under U is said to be nondominated (ND) if there is no other coterie D under U such that, for every $Q \in C$, there exists $Q' \in D$ satisfying $Q' \subseteq Q$.We introduce the operation $\sigma$ which transforms a ND coterie to another ND coterie. A regular coterie is a natural generalization of a vote-assignable coterie. We show that any regular ND coterie C can be transformed to any other regular ND coterie D by judiciously applying the $\sigma$ operation to C at most |C|+|D|-2 times. As another application of the $\sigma$ operation, we present an incrementally polynomial-time algorithm for generating all regular ND coteries. We then introduce the concept of a g-regular functional as a generalization of availability. We show how to construct an optimum coterie C with respect to a g-regular functional in O(n3|C|) time, where n =|U|. Finally, we discuss the structures of optimum coteries with respect to a g-regular functional.
Client/Server Survival Guide with OS/2
Authors: Robert Orfali, Daniel Harkey
Venue:  (1993)

:A complete guide to client/server computing and the revolutionary changes occurring within the client/server paradigm. Orfali and Harkey give you the lowdown on the current crop of operating systems including OS/2, Windows NT, Windows 3.X, UNIX and NetWare. They also take a close look at communication stacks, distributed computing environments and messaging middleware from top manufacturers and go beyond the hype to provide a reality check on the database service, TP Monitor, groupware and distributed object models of client/servers. Finally, they offer invaluable information on designing, building, deploying and managing client/server applications.
Neural Networks and Genome Informatics
Authors: Catherine H. Wu, Jerry W. McLarty
Venue:  (2000)

:This book is a comprehensive reference in the field of neural networks and genome informatics. The tutorial of neural network foundations introduces basic neural network technology and terminology. This is followed by an in-depth discussion of special system designs for building neural networks for genome informatics, and broad reviews and evaluations of current state-of-the-art methods in the field. This book concludes with a description of open research problems and future research directions.
Hierarchical multiresolution reconstruction of shell surfaces
Authors: Chandrajit L. Bajaj, Guoliang Xu, Robert J. Holt, Arun N. Netravali
Venue: Computer Aided Geometric Design (2002)

We present an adaptive, hierarchical Hh-multiresolution reconstruction algorithm to model shell surface objects from a matched pair of triangulated surfaces. Shell surfaces are an interval of contours of trivariate functions with prismatic support. In the H-direction, a hierarchical representation of the scaffold is constructed. For any adaptively extracted scaffold from the hierarchy, a sequence of functions in the h-direction (regularly subdivided mesh) is constructed so that their contours approximate the input shell to within a given error ε. The shell surfaces can be made to capture sharp curve creases on the shell while being C1 smooth everywhere else. Using an interval of iso-contours of smooth trivariate spline functions, rather than a pair of inner and outer surface splines, one avoids the need for interference checks between the inner and outer surface boundaries.
On Formal Models in Investigating Critical Velocities (Illustrated by Lorentz's Transformations)
Authors: P. V. Vasilik, A. I. Provotar
Venue: Cybernetics and Systems Analysis (2002)

A new model is proposed for investigation of relations between the coordinates of an object that moves relative to one coordinate system and is motionless relative to another one. Within the framework of this model, the interpretation of the so-called relativistic consequences of the Lorentz transformation laws differs radically from the well-known one.
Constructive, Deterministic Implementation of Shared Memory on Meshes
Authors: Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
Venue: SIAM Journal on Computing (2000)

This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. At the core of the simulation is a hierarchical memory organization scheme (HMOS), which governs the distribution of the shared variables, each replicated into multiple copies, among the memory modules, through a cascade of bipartite graphs. Based on the expansion properties of such graphs, we devise a protocol that accesses any n-tuple of shared variables in worst-case time $O(n^{1/2+\eta})$, for any constant $\eta > 0$, using $O(1/\eta^{1.59})$ copies per variable, or in worst-case time O(n1/2 log n), using O(log1.59 n) copies per variable. In both cases the access time is close to the natural $O(\sqrt{n})$ lower bound imposed by the network diameter. A key feature of the scheme is that it can be made fully constructive when m is not too large, thus providing in this case the first efficient, constructive, deterministic scheme in the literature for bounded-degree processor networks. For larger memory sizes, the scheme relies solely on a nonconstructive graph of weak expansion. Finally, the scheme can be efficiently ported to other architectures, as long as they exhibit certain structural properties. In the paper we discuss the porting to multidimensional meshes and to the pruned butterfly, an area-universal network which is a variant of the fat-tree.
Unavoidable sets of words of uniform length
Authors: C. J. Saker, P. M. Higgins
Venue: Information and Computation (2002)

A set of words X over a finite alphabet A is said to be unavoidable if all but finitely many words in A have a factor in X. We examine the problem of calculating the cardinality of minimal unavoidable sets of words of uniform length; we correct an error in [8], state a conjecture offering a formula for the minimum size of these so called <I>n</I>-good sets for all values of <I>n</I>, and show that the conjecture is correct in an infinite number of cases.
Neural Networks Applications, 1st edition
Authors: Patrick K. Simpson
Venue:  (1997)

:This volume builds on and continues the excellent coverage of the subject established in the first volume with a special focus on cutting-edge applications. This book provides practicing engineers with a snapshot of the latest applications, supported by the most recent developments in neural networks theory and technology. You'll find state-of-the-art coverage of applications in: control, power systems, medical systems, information processing, signal processing manufacturing, production and inspection, vehicular technology, and more! 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
ANSI C Programming
Authors: Steven C. Lawlor
Venue:  (1995)

:This text offers a logical, building-block approach to mastering ANSI C. Each concept is presented singly and completely before moving on to the next, assuring a steady progression of learning. Nuts 'n' Bolts features throughout explain the mechanical underpinnings of the language. Execution Charts trace example program execution line by line, variable by variable, with explanations for each line. An innovative but intuitive treatment of pointers guides students past this rough spot. There are numerous examples in the text, and three levels of exercises at the end of each chapter. 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