ppxscal/embedding_network huggingface dataset:
Efficient cache placement in multi-hop wireless networks
Authors: Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana Chiasserini, Ramesh R. Rao
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In this paper, we address the problem of efficient cache placement in multi-hop wireless networks. We consider a network comprising a server with an interface to the wired network, and other nodes requiring access to the information stored at the server. In order to reduce access latency in such a communication environment, an effective strategy is caching the server information at some of the nodes distributed across the network. Caching, however, can imply a considerable overhead cost; for instance, disseminating information incurs additional energy as well as bandwidth burden. Since wireless systems are plagued by scarcity of available energy and bandwidth, we need to design caching strategies that optimally trade-off between overhead cost and access latency. We pose our problem as an integer linear program. We show that this problem is the same as a special case of the connected facility location problem, which is known to be NP-hard. We devise a polynomial time algorithm which provides a suboptimal solution. The proposed algorithm applies to any arbitrary network topology and can be implemented in a distributed and asynchronous manner. In the case of a tree topology, our algorithm gives the optimal solution. In the case of an arbitrary topology, it finds a feasible solution with an objective function value within a factor of 6 of the optimal value. This performance is very close to the best approximate solution known today, which is obtained in a centralized manner. We compare the performance of our algorithm against three candidate cache placement schemes, and show via extensive simulation that our algorithm consistently outperforms these alternative schemes.
REDS: a reconfigurable dispatching system
Authors: Gianpaolo Cugola, Gian Pietro Picco
Venue: Proceedings of the 6th international workshop on Software engineering and middleware (2006)

We present a new publish-subscribe middleware called REDS (REconfigurable Dispatching System) designed to tolerate dynamic reconfigurations of the dispatching infrastructure, like those occurring in scenarios characterized by fluid topologies as in mobile and peer-to-peer networks. We illustrate the modular architecture of REDS, which enables programmers to change the internal configuration of the middleware to suit the deployment scenario, focusing on the aspects concerned with the dynamic reconfiguration of the dispatching network.
Adobe Illustrator CS2 Classroom in a Book
Venue:  (2005)

How often have you wished you had access to the team behind your favorite software--in this case, Adobe Illustrator--so that you could really pick their brains about all of its coolest features? With this book, you do. In these pages, the Adobe Creative Team gives you a guided tour of the graphics powerhouse, Adobe Illustrator CS2. Best of all, it does so at your pace. Whether your beautifully designed graphics end up in print, the Web, broadcast video, or even cell phone displays, this book shows you how to get them there--easily, elegantly, and efficiently. You'll find step-by-step, project-based lessons in all of Illustrator's key features, including those that are new to CS2: Live Trace, Illustrator's powerful bitmap-to-vector tracing tool; Live Paint, a revolutionary paint tool that lets you apply color to vector graphics intuitively and easily; the new Control Palette, which makes tools easier to locate and select, the Adobe Bridge file browser, tighter integration with Photoshop CS2, and more. Each chapter contains a project that builds on your growing knowledge of the program, while the companion CD includes all the files you need to complete the book's lessons. 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
Upgrading Visual Basic 6.0 Applications to Visual Basic .NET and Visual Basic 2005 (Patterns & Practices)
Authors: Ed Robinson, Michael Bond
Venue:  (2006)

Expert guidance for upgrading Visual Basic 6.0 applications to Visual Basic .NET and Visual Basic 2005.
Now You Know Tungsten E
Authors: Rick Overton, David Hayward
Venue:  (2004)

You've just discovered what 2 million other users already know: That the best-selling Tungsten E is the coolest, most affordable ($200) color electronic organizer on the market! Here to reveal all of its secrets is a pint-sized guide that's as smart and sleek as the device itself. As the only source authorized by the device's creators (palmOne), this handy guide from a pair of PC Magazine editors comes jam-packed with all kinds of new things you can do on your Tungsten E that aren't disclosed in the PDF manuals. Each tip or technique takes just minutes to complete, which means you master one topic quickly and easily, and then move on to the next. A bold, bright design with lay-flat binding makes it easy (and essential) to practice your new skills as you read-your Tungsten E in one hand and this guide at your side. Includes complete coverage of the newest palmOne handhelds, which offer bright color, loads of power and storage, and extensive feature sets.
Efficient computation of radial moment functions using symmetrical property
Authors: Chong-Yaw Wee, Raveendran Paramesran
Venue: Pattern Recognition (2006)

The applications of radial moment functions such as orthogonal Zernike and pseudo-Zernike moments in real-world have been limited by the computational complexity of their radial polynomials. The common approaches used in reducing the computational complexity include the application of recurrence relations between successive radial polynomials and coefficients. In this paper, a novel approach is proposed to further reduce the computation complexity of Zernike and pseudo-Zernike polynomials based on the symmetrical property of radial polynomials. By using this symmetrical property, the real-valued radial polynomials computation is reduced to about one-eighth of the full set polynomials while the computation of the exponential angle values is reduced by half. This technique can be integrated with existing fast computation methods to further improve the computation speed. Besides significant reduction in computation complexity, it also provides vast reduction in memory storage.
Non-uniform bounds for short asymptotic expansions in the CLT for balls in a Hilbert space
Authors: S. A. Bogatyrev, F. Götze, V. V. Ulyanov
Venue: Journal of Multivariate Analysis (2006)

We consider short asymptotic expansions for the probability of a sum of i.i.d, random elements to hit a ball in a Hilbert space H. The error bound for the expansion is of order O(n-1). It depends on the first 12 eigenvalues of the covariance operator only. Moreover, the bound is non-uniform, i.e. the accuracy of the approximation becomes better as the distance between a boundary of the ball and the origin in H grows.
Efficient nonlinear finite element modeling of slab on steel stringer bridges
Authors: Karl E. Barth, Haiyong Wu
Venue: Finite Elements in Analysis and Design (2006)

This paper conducts three-dimensional (3D), nonlinear finite element analyses (FEA) to predict ultimate load behavior of slab on steel stringer bridge superstructures. This is accomplished using the commercial finite element package ABAQUS to efficiently capture the behavior of such bridges; comprehensive details of the modeling procedure are presented herein. Two composite steel girders fabricated from high performance steel (HPS) and one four-span continuous composite steel bridge tested to failure have been used to validate the proposed FEA models. These FEA results indicate excellent agreement with the experimental data.
Predicting fingerprint biometrics performance from a small gallery
Authors: Rong Wang, Bir Bhanu
Venue: Pattern Recognition Letters (2007)

Predicting the performance of a biometrics is an important problem in a real-world application. In this paper, we present a binomial model to predict both the fingerprint verification and identification performance. The match and non-match scores are computed, using the number of corresponding triangles as the match metric, between the query and gallery fingerprints. The triangles are formed using the minutiae features. The match score and non-match score in a binomial prediction model are used to predict the performance on large (relative to the size of the gallery) populations from a small gallery. We apply the model to the entire NIST-4 database and show the results for both the fingerprint verification and the identification.
Algorithms for pure Nash equilibria in weighted congestion games
Authors: Panagiota N. Panagopoulou, Paul G. Spirakis
Venue: Journal of Experimental Algorithmics (JEA) (2007)

In large-scale or evolving networks, such as the Internet, there is no authority possible to enforce a centralized traffic management. In such situations, game theory, and especially the concepts of Nash equilibria and congestion games [Rosenthal 1973] are a suitable framework for analyzing the equilibrium effects of selfish routes selection to network delays. We focus here on single-commodity networks where selfish users select paths to route their loads (represented by arbitrary integer weights). We assume that individual link delays are equal to the total load of the link. We then focus on the algorithm suggested in Fotakis et al. [2005], i.e., a potential-based method for finding pure Nash equilibria in such networks. A superficial analysis of this algorithm gives an upper bound on its time, which is polynomial in n (the number of users) and the sum of their weights W. This bound can be exponential in n when some weights are exponential. We provide strong experimental evidence that this algorithm actually converges to a pure Nash equilibrium in polynomial time. More specifically, our experimental findings suggest that the running time is a polynomial function of n and log W. In addition, we propose an initial allocation of users to paths that dramatically accelerates this algorithm, compared to an arbitrary initial allocation. A by-product of our research is the discovery of a weighted potential function when link delays are exponential to their loads. This asserts the existence of pure Nash equilibria for these delay functions and extends the result of Fotakis et al. [2005].
Design of a logic element for implementing an asynchronous FPGA
Authors: Scott C. Smith
Venue: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays (2007)

A reconfigurable logic element (LE) is developed for use in constructing a NULL Convention Logic (NCL) FPGA. It can be configured as any of the 27 fundamental NCL gates, including resettable and inverting variations, and can utilize embedded registration for gates with three or fewer inputs. The developed LE is compared with a previous NCL LE, showing that the one developed herein yields a more area efficient NCL circuit implementation. The NCL FPGA logic element is simulated at the transistor level using the 1.8V, 180nm TSMC CMOS process.
Symplectic spread-based generalized Kerdock codes
Authors: S. González, C. Martínez, I. F. Rúa
Venue: Designs, Codes and Cryptography (2007)

Kerdock codes (Kerdock, Inform Control 20:182---187, 1972) are a well-known family of non-linear binary codes with good parameters admitting a linear presentation in terms of codes over the ring $${\mathbb{Z}_{4}}$$ (see Nechaev, Diskret Mat 1:123---139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301---319, 1994). These codes have been generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436---480, 1997) a symplectic construction of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent. On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the finite field F of q = 2 l elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q 2 and characteristic 22. The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.
Windows Forensics and Incident Recovery (The Addison-Wesley Microsoft Technology Series)
Authors: Harlan Carvey
Venue:  (2004)

The first book to focus on forensics and incident recovery in a Windows environment Teaches through case studies and real world-examples Companion CD contains unique tools developed by the authors Covers Windows Server 2003, Windows 2000, Windows NT, and Windows XPIf you're responsible for protecting Windows systems, firewalls and anti-virus aren't enough. You also need to master incident response, recovery, and auditing. Leading Windows security expert and instructor Harlan Carvey offers a start-to-finish guide to the subject: everything administrators must know to recognize and respond to virtually any attack.Drawing on his widely acclaimed course, Carvey uses real-world examples to cover every significant incident response, recovery, and forensics technique. He delivers a complete incident response toolset that combines today's best open source and freeware tools, his own exclusive software and scripts, and step-by-step instructions for using them. This book's tools and techniques apply to every current and professional version of Windows: NT, 2000, XP, and Windows Server 2003. Coverage includes: Developing a practical methodology for responding to potential attacks Preparing your systems to prevent and detect incidents Recognizing the signatures of an attack-in time to act Uncovering attacks that evade detection by Event Viewer, Task Manager, and other Windows GUI tools Using the Forensic Server Project to automate data collection during live investigations Analyzing live forensics data in order to determine what occurred
Quick Time for Java: A Developer's Notebook
Authors: Chris Adamson
Venue:  (2005)

Java developers who need to add audio, video, or interactive media creation and playback to their applications find that QuickTime Java is a powerful toolkit, but one that's not easy to get into. This book offers the first real look at this important software with an informal, code-intensive style that lets impatient early adopters focus on learning by doing. You get just the functionality you need.
Final report of the GSPC state-of-the-art subcommittee
Authors: R. H. Ewald, R. Fryer
Venue: ACM SIGGRAPH Computer Graphics (1978)

This paper presents the final report of the ACM/SIGGRAPH Graphics Standards Planning Committee (GSPC) State-of-the-Art Subcommittee. This group's charter was to compare existing vector-oriented graphics packages to determine their similarities and differences. Eight graphics packages and the GSPC "Core System" were selected for review.
Adaptive fusion and co-operative training for classifier ensembles
Authors: Nayer M. Wanas, Rozita A. Dara, Mohamed S. Kamel
Venue: Pattern Recognition (2006)

In this paper, architectures and methods of decision aggregation in classifier ensembles are investigated. Typically, ensembles are designed in such a way that each classifier is trained independently and the decision fusion is performed as a post-process module. In this study, however, we are interested in making the fusion a more adaptive process. We first propose a new architecture that utilizes the features of a problem to guide the decision fusion process. By using both the features and classifiers outputs, the recognition strengths and weaknesses of the different classifiers are identified. This information is used to improve overall generalization capability of the system. Furthermore, we propose a co-operative training algorithm that allows the final classification to determine whether further training should be carried out on the components of the architecture. The performance of the proposed architecture is assessed by testing it on several benchmark problems. The new architecture shows improvement over existing aggregation techniques. Moreover, the proposed co-operative training algorithm provides a means to limit the users' intervention, and maintains a level of accuracy that is competitive to that of most other approaches.
Moving to Ubuntu Linux
Authors: Marcel Gagné
Venue:  (2006)

Discover Ubuntu, Today's Hottest LinuxEveryone's talking about Ubuntu-it's not just 100% free, it's the most useful, practical desktop Linux ever! Now, Linux expert Marcel Gagné reveals Ubuntu's amazing power and helps you migrate from Windows faster than you ever thought possible.Moving to Ubuntu Linux will teach you how to do virtually anything with Ubuntu-write documents, create spreadsheets, surf the Web, use email, listen to music, watch movies, and play games. Install Ubuntu fast, with easy, step-by-step instructions Take control, with the GNOME desktop environment and Nautilus file manager Browse the Internet using Firefox, the powerful browser that's quickly replacing Microsoft Internet Explorer Find and install all the software you'll ever need, with Ubuntu's powerful Synaptic package manager Send email, track contacts, create calendars, and manage all your personal information with Evolution Organize digital photos, rip music, burn and play CDs, watch movies, create graphics, and more Discover the world of Linux games, and learn how to run Windows games on your Ubuntu PC Set up an efficient, convenient network for your home or small business Customize your desktop so it's perfectly comfortable and totally efficient 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
The Digital Photography Book
Authors: Scott Kelby
Venue:  (2006)

Scott Kelby, the man who changed the "digital darkroom" forever with his groundbreaking, #1 bestselling, award-winning book The Photoshop Book for Digital Photographers, now tackles the most important side of digital photography--how to take pro-quality shots using the same tricks today's top digital pros use (and it's easier than you'd think). This entire book is written with a brilliant premise, and here's how Scott describes it: "If you and I were out on a shoot, and you asked me, 'Hey, how do I get this flower to be in focus, but I want the background out of focus?' I wouldn't stand there and give you a lecture about aperture, exposure, and depth of field. In real life, I'd just say, 'Get out your telephoto lens, set your f/stop to f/2.8, focus on the flower, and fire away.' You d say, 'OK,' and you'd get the shot. That's what this book is all about. A book of you and I shooting, and I answer the questions, give you advice, and share the secrets I've learned just like I would with a friend, without all the technical explanations and without all the techno-photo-speak." This isn't a book of theory-it isn't full of confusing jargon and detailed concepts: this is a book of which button to push, which setting to use, when to use them, and nearly two hundred of the most closely guarded photographic "tricks of the trade" to get you shooting dramatically better-looking, sharper, more colorful, more professional-looking photos with your digital camera every time you press the shutter button. Here's another thing that makes this book different: each page covers just one trick, just one single concept that makes your photography better. Every time you turn the page, you'll learn another pro setting, another pro tool, another pro trick to transform your work from snapshots into gallery prints. There's never been a book like it, and if you're tired of taking shots that look "OK," and if you're tired of looking in photography magazines and thinking, "Why don't my shots look like that?" then this is the book for you.
Building a Monitoring Infrastructure with Nagios
Authors: David Josephsen
Venue:  (2007)

Build real-world, end-to-end network monitoring solutions with NagiosThis is the definitive guide to building low-cost, enterprise-strength monitoring infrastructures with Nagios, the world's leading open source monitoring tool. Network monitoring specialist David Josephsen goes far beyond the basics, demonstrating how to use third-party tools and plug-ins to solve the specific problems in your unique environment. Josephsen introduces Nagios “from the ground up,” showing how to plan for success and leverage today's most valuable monitoring best practices. Then, using practical examples, real directives, and working code, Josephsen presents detailed monitoring solutions for Windows, Unix, Linux, network equipment, and other platforms and devices. You'll find thorough discussions of advanced topics, including the use of data visualization to solve complex monitoring problems. This is also the first Nagios book with comprehensive coverage of using Nagios Event Broker to transform and extend Nagios. Understand how Nagios works, in depth: the host and service paradigm, plug-ins, scheduling, and notification Configure Nagios successfully: config files, templates, timeperiods, contacts, hosts, services, escalations, dependencies, and more Streamline deployment with scripting templates, automated discovery, and Nagios GUI tools Use plug-ins and tools to systematically monitor the devices and platforms you need to monitor, the way you need to monitor them Establish front-ends, visual dashboards, and management interfaces with MRTG and RRDTool Build new C-based Nagios Event Broker (NEB) modules, one step at a time Contains easy-to-understand code listings in Unix shell, C, and PerlIf you're responsible for systems monitoring infrastructure in any organization, large or small, this book will help you achieve the results you wantï¾right from the start.David Josephsen is Senior Systems Engineer at DBG, Inc., where he maintains a collection of geographically dispersed server farms. He has more than a decade of hands-on experience with Unix systems, routers, firewalls, and load balancers in support of complex, high-volume networks. Josephsen's certifications include CISSP, CCNA, CCDA, and MCSE. His co-authored work on Bayesian spam filtering earned a Best Paper award at USENIX LISA 2004. He has been published in both ;login and Sysadmin magazines on topics relating to security, systems monitoring, and spam mitigation.Introduction CHAPTER 1 Best Practices CHAPTER 2 Theory of Operations CHAPTER 3 Installing Nagios CHAPTER 4 Configuring Nagios CHAPTER 5 Bootstrapping the Configs CHAPTER 6 Watching CHAPTER 7 Visualization CHAPTER 8 Nagios Event Broker Interface APPENDIX A Configure Options APPENDIX B nagios.cfg and cgi.cfg APPENDIX C Command-Line Options Index
Evaluating the social and cultural implications of the internet
Authors: Philip Brey
Venue: ACM SIGCAS Computers and Society (2005)

Since the internet's breakthrough as a mass medium, it has become a topic of discussion because of its implications for society. At one extreme, one finds those who only see great benefits and consider the Internet a tool for freedom, commerce, connectivity, and other societal benefits. At the other extreme, one finds those who lament the harms and disadvantages of the Internet, and who consider it a grave danger to existing social structures and institutions, to culture, morality and human relations. In between one finds the majority, those who recognize both benefits and harms in the Internet as it currently exists and who recognize its usefulness while worrying about some of its negative impacts.