ppxscal/embedding_network huggingface dataset:
Dynamic quorum policy for maximizing throughput in limited information multiparty MAC
Authors: Prasanna Chaporkar, Saswati Sarkar, Rahul Shetty
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In multiparty MAC, a sender needs to transmit each packet to a set of receivers within its transmission range. Bandwidth efficiency of wireless multiparty MAC can be improved substantially by exploiting the fact that several receivers can be reached at the MAC layer by a single transmission. Multiparty communication, however, requires new design paradigms since systematic design techniques that have been used effectively in unicast and wireline multicast do not apply. For example, a transmission policy that maximizes the stability region of the network need not maximize the network throughput. Therefore, the objective is to design a policy that maximizes the system throughput subject to maintaining stability. We present a sufficient condition that can be used to establish the throughput optimality of a stable transmission policy. We subsequently design a distributed adaptive stable policy that allows a sender to decide when to transmit using simple computations. The computations are based only on limited information about current transmissions in the sender's neighborhood. Even though the proposed policy does not use any network statistics, it attains the same throughput as an optimal offline stable policy that uses in its decision process past, present, and even future network states. We prove the throughpOut optimality of this policy using the sufficient condition and the large deviation results. We present a MAC protocol for acquiring the local information necessary for executing this policy, and implement it in ns-2. The performance evaluations demonstrate that the optimal policy significantly outperforms the existing multiparty schemes in ad hoc networks.
Time of searching for similar binary vectors in associative memory
Authors: A. A. Frolov, D. Husek, D. A. Rachkovskii
Venue: Cybernetics and Systems Analysis (2006)

Times of searching for similar binary vectors in neural-net and traditional associative memories are investigated and compared. The neural-net approach is demonstrated to surpass the traditional ones even if it is implemented on a serial computer when the entropy of a space of signals is of order of several hundreds and the number of stored vectors is vastly larger than the entropy.
Residual iteration and accurate polynomial evaluation for shape-interrogation applications
Authors: C. M. Hoffmann, G. Park, J.-R. Simard, N. F. Stewart
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Surface interrogation and intersection depend crucially on good root-finding algorithms, which in turn depend on accurate polynomial evaluation. Conventional algorithms for evaluation typically encounter difficulties near multiple roots, or roots that are very close, and this may lead to gross errors in the geometric computation, or even catastrophic failure. In this paper we study the cost and accuracy of several approaches to polynomial evaluation, explaining the reasons for non-convergence of certain methods, and supporting our subsequent conclusions with the results of benchmarking experiments.
Direct LIGA service for prototyping: status report
Authors: B. Loechel, J. Goettert, Y. M. Desta
Venue: Microsystem Technologies (2006)

Since the early 1990s a variety of applications ranging from precision metallic, ceramic, or polymeric parts to complex devices for micro-fluidic and micro-optic applications have been discussed with the assumption that LIGA can either make a significant contribution or is the sole technology able to make these products. The question today is, have individual LIGA groups or even the entire LIGA community achieved this goal? Despite major investments, a lot of hard work from many students and researchers, and some promising &#x201c;prototypes&#x201d;, a true mass product made by direct LIGA, i.e., using X-ray lithography and electroplating, has still not entered the market. This paper will briefly present the current status of direct-LIGA technology and discuss some examples of commercialization efforts as well as prospects for high-volume production.
Creating a Presentation in Microsoft Office PowerPoint 2007 for Windows: Visual QuickProject Guide
Authors: Tom Negrino
Venue:  (2007)

If you want to make a great presentation fast but don't want to get bogged down in the details, then you need a Visual QuickProject Guide! You don't need to know every feature-you just want to know how to get your project done. Full-color illustrations show you how to perform each step of your project from start to finish. Low priced-why pay for more than you need? Microsoft PowerPoint is nearly ubiquitous in today's world--from business to schools to clubs to organizations, PowerPoint presentations are everywhere you turn. To learn to create the best-looking presentations--the ones that stand out in terms of content and visual appeal--fast, readers need Creating a Presentation in Microsoft Office PowerPoint 2007: Visual QuickProject Guide. PowerPoint presenter extraordinaire Tom Negrino steps readers through a single, basic presentation. He begins with an overview of the redesigned Office interface and highlights the tools readers will use as they create their project. From there, readers begin writing their presentation, gathering images and sound files, choosing a design, working with text, and adding graphics and slide effects and transitions. From there they learn about presenting and sharing their presentations with the world. Readers will learn how to use the attractive new themes in PowerPoint and so much more. In the end, they will have a professional-looking and visually appealing presentation they can use anywhere! Each book in the Visual QuickProject Guide series now has a companion website featuring sample project files--making it even easier for users to work through each project as they read through the book.
Social contraction and belief negotiation
Authors: Richard Booth
Venue: Information Fusion (2006)

An intelligent agent may receive information about its environment from several different sources. How should the agent merge these items of information into a single, consistent piece? Taking our lead from the contraction+expansion approach to belief revision, we envisage a two-stage approach to this problem. The first stage consists of weakening the individual pieces of information into a form in which they can be consistently added together. The second, trivial, stage then consists of simply adding together the information thus obtained. This paper is devoted mainly to the first stage of this process, which we call social contraction. We consider both a postulational and a procedural approach to social contraction. The latter builds on the author's framework of belief negotiation models. With the help of Spohn-type rankings we provide two possible instantiations of this extended framework. This leads to two interesting concrete families of social contraction functions.
I-SERIES MICROSOFT OFFICE XP VOL I ENHANCED W/ STUDENT CD, 1 edition
Authors: Stephen Haag
Venue:  (2003)

The I-Series Applications textbooks strongly emphasize that students learn and master applications skills by being actively engaged- by doing. These texts have been written with clear, error-free, and unambiguous steps to accomplish tasks that lead to a finished document, worksheet or database table. The authors made the decision that teaching “how” to accomplish some task is not enough for complete understanding and mastery. Prior to introducing steps, the authors discuss why the steps students are about to experience are important and what role the steps play in the overall plan for creating a document, workbook or database.Table of contentsComputing Concepts: The BasicsWindows BasicsCommon MS Office XP FeaturesInternet EssentialsWord: Chapter 1: Working with a DocumentSession 1.1 Starting WordSession 1.2 Working with Text and Creating a DocumentSession 1.3 Filing DocumentsSession 1.4 Working with an Existing Document Chapter 2: Formatting and Editing a DocumentSession 2.1 Formatting TextSession 2.2 Editing a DocumentSession 2.3 Formatting a Document Chapter 3: Formatting Longer DocumentsSession 3.1 Formatting TextSession 3.2 Formatting a DocumentSession 3.3 Applying Columns to Existing Text Chapter 4: Using Tables and GraphicsSession 4.1 TablesSession 4.2 Using GraphicsExcel:Chapter 1: Creating Worksheets for Decision MakersSession 1.1 Getting StartedSession 1.2 Entering Data, Saving Workbooks, & Printing WorksheetsChapter 2: Planning and Creating a WorksheetSession 2.1 Writing Formulas, Using Functions and Copying & Moving Cell ContentsSession 2.2 Formatting Cells, Print Setup, and PrintingChapter 3 Formatting a WorksheetSession 3.1 Aligning Data and Applying Character FormatsSession 3.2 Advanced Formatting Chapter 4: Creating ChartsSession 4.1 Creating an Excel ChartSession 4.2 Modifying and Improving a ChartAccess:Chapter 1: Understanding Relational DatabasesSession 1.1 Introducing Relational DatabasesSession 1.2 Introducing Microsoft AccessChapter 2: Maintaining Your DatabaseChapter CaseSession 2.1 Maintaining Access Data Session 2.2 Designing and Building a DatabaseChapter 3: Introducing Queries, Filters, Forms, & ReportsSession 3.1 Selecting and Organizing DataSession 3.2 Selecting and Calculating with QueriesSession 3.3 Building Simple Forms & ReportsChapter 4: Compound Queries and Database Utilities Session 4.1 Using Queries to Analyze DataSession 4.2 Modifying Table DefinitionsSession 4.2 Repairing, Backing Up, & Converting a DatabasePowerpoint:Chapter 1: Presentation BasicsSession 1.1 Introduction to Presentation GraphicsSession 1.2 Creating a New PresentationChapter 2: Organizing Your PresentationSession 2.1 PrintingSession 2.2 Outlining IdeasChapter 3: Refining Your PresentationSession 3.1 Adding and Modifying ObjectsSession 3.2 Standardizing Presentations Chapter 4: Enhancing Your Presentation with Graphics Chapter CaseSession 4.1 Effectively Using ArtSession 4.2 Adding Other Graphic Elements
PC Mods for the Evil Genius, 1 edition
Authors: Jim Aspinwall
Venue:  (2006)

UNIQUE YOUR PC WITH SUPER TWEAKS! If you yearn for the coolest, most crazed 'puter around, PC Mods for the Evil Genius is the key to the kingdom! This book shows you how to supercharge your PC-and create a jaw-dropping system that cannot be purchased off any shelf, anywhere! You get complete, easy-to-follow plans, clear diagrams and schematics, and lists of parts and tools, so you know what's needed before you begin. PC Mods for the Evil Genius gives you: Illustrated instructions and plans for amazing projects presented in sufficient detail to be built even by newcomers Loads of projects simple enough for beginners-but intense enough to impress even your most savvy friends Tips to add high-end features easily and economically Frustration-factor removal-needed parts and tools are listed, along with sources-and how to get everything you need at the cheapest prices possible TRANSFORM YOUR COMPUTER FROM AN ORDINARY CRUISER INTO A PC MUSCLE CAR! PC Mods for the Evil Genius equips you with complete plans, instructions, parts lists, and sources for projects that let you: Jazz up your PC with a right-now case, custom lights, and other cool options Transform your PC into a TV Add TiVo capabilities and create your own PVR (personal video recorder) Archive your private videos Create mobile entertainment and navigation systems Let your friends and family track your travels with Google Earth Check and share your local weather conditions Make your 'puter help detect alien lifeforms in space Link you PC to a supercomputer chain unraveling the mysteries of DNA Phone almost anyone, anywhere in the world and talk to them live with your PC (and no phone charges) Put a live video feed of yourself (or anything else) onto the Web 24 hours a day Secure your PC biometrically Keep intruders out of your I/O ports And much, much more! Table of contentsDedicationAbout the AuthorPrefaceAcknowledgmentsIntroductionChapter 1: The Green PCChapter 2: PC Control PanelChapter 3: The Ultra-Mod PCChapter 4: Motherboard UpgradeChapter 5: Build Your Own Power ProtectionChapter 6: Secure Your WiFiChapter 7: Dynamic Picture FrameChapter 8: Mobile EntertainmentChapter 9: Mobile NavigationChapter 10: Mobile InternetChapter 11: Share Your Trip With APRSChapter 12: Let Others Track Your Trip by GoogleChapter 13: PC Weather StationChapter 14: I Want My PC TVChapter 15: Sling Video All AroundChapter 16: Voice-Over-IP With SkypeChapter 17: Security WebcamChapter 18: Contributing to Science ExplorationsChapter 19: Keep In SyncChapter 20: Securing Your ComputerGlossaryIndex 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
Metacomputing with mobile agents
Authors: Paraskevas Evripidou, George Samaras
Venue: International Journal of Parallel Programming (2006)

In this paper we present Parallel Computing with Mobile Agents (PaCMAn), a mobile agent based Metacomputer that enables its users to utilize idle resources on the internet to tackle computational problems that could not be handled efficiently with their own resources. The PaCMAn launches multiple mobile agents that cooperate and communicate to solve problems in parallel. Each agent supports the basic communication and synchronization tasks of the classical parallel worker assuming the role of a process in a parallel processing application. Application tasks, however, are assigned dynamically to the PaCMAn's mobile agents via TaskHandlers. TaskHandlers are Java objects capable of implementing particular tasks of the application. The PaCMAn consists of three major components: Broker, Server and Client. A server machine has to be explicitly registered in order to take part in the PaCMAn Metacomputer. A number of brokers keep track of the available resources. In the PaCMAn system both server and client machines can be located anywhere in the Internet. The clients select the servers that they will utilize based on the specific resource requirements. We have developed and tested prototype systems with several applications. These prototypes provide proof of concept of our proposed Metacomputing philosophy. Furthermore they have demonstrated that PaCMAn provides parallel efficiency. We also demonstrate that the PaCMAn Metacomputer can be used as the computational engine for the creation of sophisticated Pervasive Services anywhere anytime.
An adaptive procedure for estimating coherent risk measures based on generalized scenarios
Authors: Vadim Lesnevski, Barry L. Nelson, Jeremy Staum
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Coherent risk measures based on generalized scenarios can be viewed as estimating the maximum expected value from among a collection of simulated "systems." We present a procedure for generating a fixed-width confidence interval for this coherent risk measure. The procedure improves upon previous methods by being reliably efficient for simulation of generalized scenarios and portfolios with heterogeneous characteristics.
Using natural class hierarchies in multi-class visual classification
Authors: Ilkka Autio
Venue: Pattern Recognition (2006)

We address the problem of computationally efficient visual classification of objects, and propose a system for solving multi-class problems in domains that have inherent hierarchic structure, such as subclass-superclass-relationships based on visual similarity. Class relationships are used at runtime to select the computationally simplest feature space that allows classification at high level of confidence for each example view. Classification accuracies can then be further improved using rank-order voting over multiple views. Our experimental results show that our system compares favorably to previously published results using a demanding benchmark. The results support the hypothesis that class hierarchies based on visual similarities are feasible and useful in controlling the accuracy vs. speed tradeoffs in classification.
Network neighborhood analysis with the multi-node topological overlap measure
Authors: Ai Li, Steve Horvath
Venue: Bioinformatics (2007)

Motivation: The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. Results: The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. Availability: An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/). Contact: shorvath@mednet.ucla.edu Supplementary information: Supplementary material is available at Bioinformatics online.
Minimum distance classification rules for high dimensional data
Authors: Muni S. Srivastava
Venue: Journal of Multivariate Analysis (2006)

In this article, the problem of classifying a new observation vector into one of the two known groups Πi, i = 1, 2, distributed as multivariate normal with common covariance matrix is considered. The total number of observation vectors from the two groups is, however, less than the dimension of the observation vectors. A sample-squared distance between the two groups, using Moore-Penrose inverse, is introduced. A classification rule based on the minimum distance is proposed to classify an observation vector into two or several groups. An expression for the error of misclassification when there are only two groups is derived for large p and n = O(pδ), 0 < δ < 1.
A TCAM-based distributed parallel IP lookup scheme and performance analysis
Authors: Kai Zheng, Chengchen Hu, Hongbin Lu, Bin Liu
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Using ternary content addressable memory (TCAM) for high-speed IP address lookup has been gaining popularity due to its deterministic high performance. However, restricted by the slow improvement of memory accessing speed, the route lookup engines for next-generation terabit routers demand exploiting parallelism among multiple TCAM chips. Traditional parallel methods always incur excessive redundancy and high power consumption. We propose in this paper an original TCAM-based IP lookup scheme that achieves both ultra-high lookup throughput and optimal utilization of the memory while being power-efficient. In our multi-chip scheme, we devise a load-balanced TCAM table construction algorithm together with an adaptive load balancing mechanism. The power efficiency is well controlled by decreasing the number of TCAM entries triggered in each lookup operation. Using four 133 MHz TCAM chips and given 25% more TCAM entries than the original route table, the proposed scheme achieves a lookup throughput of up to 533 MPPS while remains simple for ASIC implementation.
A mini-computer configuration for CAI: a systems engineering view
Authors: Louis S. Adler
Venue: ACM SIGARCH Computer Architecture News (1973)

Computer assisted instruction (CAI) has not impacted the educational world with the degree of success which early proponents predicted. Although CAI has proven to be a more efficient learning tool than common traditional methods in specific instances, the overall success of such systems has been sporadic. There is no question that a well-designed and correctly implemented CAI system can be highly effective; however, several important factors must be overcome to guarantee a reasonable amount of success. These are:&bull; Overcoming the present high cost of hardware while still providing a reliable system having acceptable display capability.&bull; Developing a software real-time operating system which guarantees fast response times.&bull; Authoring high quality courseware.
Microsoft Office 2003: The Complete Reference, 2 edition
Authors: Jennifer Ackerman Kettell, Guy Hart-Davis, Curt Simmons, Jennifer Kettell
Venue:  (2003)

Master all the new features in Office 2003 such as file security, XML integration, working with the Tablet PC, OneNote, InfoPath, and many more. This comprehensive resource provides extensive coverage of Word, Outlook, Excel, PowerPoint, Publisher, and FrontPage and explains how to fully integrate all the programs to work together seamlessly.Table of contents Part I: Common Office 2003 Elements 1: Getting to Know Office 2003 2: Customizing the Office Environment 3: Managing Files in Office 4: Text Tools 5: Drawing and Graphics Tools Part II: Word Processing 6: Word 7: Editing Text 8: Document Formatting 9: Reusable Formatting with Styles and Templates 10: Tables and Columns 11: Advanced Page Layout in Word 12: Automating Information with Fields 13: Managing Long Documents 14: Mail Merge, Labels, and Envelopes Part III: Spreadsheets 15: Excel 16: Formatting Worksheets and Restricting Data 17: Calculating with Formulas and Functions 18: Viewing and Manipulating Data with Charts and PivotTables 19: Creating Excel Databases Part IV: Presentations 20: PowerPoint 21: Creating and Editing Slides 22: Adding Graphics, Multimedia, and Special Effects to Slides 23: Showing Your PowerPoint Presentations Part V: Schedule and Contact Management 24: Outlook 25: Outlook E-mail 26: Outlook Calendar and Task Lists 27: Managing Contacts and Taking Notes 28: Scheduling and Planning with Others Part VI: Databases 29: Databases in Access 30: Defining and Developing Tables 31: Creating Queries 32: Forms and Reports 33: Building a Database Application Part VII: Web and Print Layout 34: Designing Pages and Sites in FrontPage 35: Advanced Management Features and Web Site Publishing 36: Creating Publications in Publisher 37: Publishing Documents in Publisher Part VIII: Integration and Collaboration 38: Using Office Applications Together 39: Using Office on the Web 40: Collaboration Using Office Tools and SharePoint Team Services Part IX: Macros and Visual Basic for Applications 41: Creating and Using Office Macros 42: Using Visual Basic for Applications with Office 43: Putting VBA and Macros to Work Part X: Appendixes A: Keyboard Shortcuts B: XML: The Underpinnings of Office 2003
Easy Web Design
Authors: Mary Millhollon, Jeff Castrina, Leslie Lothamer
Venue:  (2006)

Demystify Web design! With this colorful, hands-on guide that includes easy-to-follow projects and expert advice from the professionals.