ppxscal/embedding_network huggingface dataset:
Performance engineering in industry: current practices and adoption challenges
Authors: Ahmed E. Hassan, Parminder Flora
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

This panel session discusses performance engineering practices in industry. Presentations in the session will explore the use of lightweight techniques and approaches in order to permit the cost effective and rapid adoption of performance modeling research by large industrial software systems.
Dude, You Can Do It! How to Build a Sweeet PC
Authors: Darrel Creacy, Carlito Vicencio
Venue:  (2005)

Whether you're frustrated with current PC offerings (and their inflated prices) or are simply looking for a cool project to take on, building a computer from the ground up using off-the-shelf parts can offer significant advantages. In these pages, computer dudes Darrel Wayne Creacy and Carlito Vicencio outline those advantages and then show you how to build the computer of your dreams. The pair begins by explaining what components make up a PC and what you need to think about when selecting those components, before helping you determine your needs and suggesting various configurations to fit those uses. Breaking the process down into its simplest terms, the authors provide component lists for a number of different PC setups: for students, home users, multimedia/home-theater enthusiasts, high-end graphic/video/audio producers, and more. Using plain language and plenty of visual and instructional aids--photos, illustrations, diagrams, step-by-step directions, and more--the authors ensure that even someone (like you!) who knows nothing about technology can build the perfect PC! On a more personal note, the authors are donating a percentage of their income from this book to the Breast Cancer Research Foundationï¾to thank all the women in their lives who have supported them and battled the disease. For more information about BCRF, please visit http://www.bcrfcure.org/.
Interpreting Kullback-Leibler divergence with the Neyman-Pearson lemma
Authors: Shinto Eguchi, John Copas
Venue: Journal of Multivariate Analysis (2006)

Kullback-Leibler divergence and the Neyman-Pearson lemma are two fundamental concepts in statistics. Both are about likelihood ratios: Kullback-Leibler divergence is the expected log-likelihood ratio, and the Neyman-Pearson lemma is about error rates of likelihood ratio tests. Exploring this connection gives another statistical interpretation of the Kullback-Leibler divergence in terms of the loss of power of the likelihood ratio test when the wrong distribution is used for one of the hypotheses. In this interpretation, the standard non-negativity property of the Kullback-Leibler divergence is essentially a restatement of the optimal property of likelihood ratios established by the Neyman-Pearson lemma. The asymmetry of Kullback-Leibler divergence is overviewed in information geometry.
TOPP---the OpenMS proteomics pipeline
Authors: Oliver Kohlbacher, Knut Reinert, Clemens Gröpl, Eva Lange, Nico Pfeifer, Ole Schulz-Trieglaff, Marc Sturm
Venue: Bioinformatics (2007)

Motivation: Experimental techniques in proteomics have seen rapid development over the last few years. Volume and complexity of the data have both been growing at a similar rate. Accordingly, data management and analysis are one of the major challenges in proteomics. Flexible algorithms are required to handle changing experimental setups and to assist in developing and validating new methods. In order to facilitate these studies, it would be desirable to have a flexible 'toolbox' of versatile and user-friendly applications allowing for rapid construction of computational workflows in proteomics. Results: We describe a set of tools for proteomics data analysis---TOPP, The OpenMS Proteomics Pipeline. TOPP provides a set of computational tools which can be easily combined into analysis pipelines even by non-experts and can be used in proteomics workflows. These applications range from useful utilities (file format conversion, peak picking) over wrapper applications for known applications (e.g. Mascot) to completely new algorithmic techniques for data reduction and data analysis. We anticipate that TOPP will greatly facilitate rapid prototyping of proteomics data evaluation pipelines. As such, we describe the basic concepts and the current abilities of TOPP and illustrate these concepts in the context of two example applications: the identification of peptides from a raw dataset through database search and the complex analysis of a standard addition experiment for the absolute quantitation of biomarkers. The latter example demonstrates TOPP's ability to construct flexible analysis pipelines in support of complex experimental setups. Availability: The TOPP components are available as open-source software under the lesser GNU public license (LGPL). Source code is available from the project website at www.OpenMS.de Contact: oliver.kohlbacher@uni-tuebingen.de
Webbots, Spiders, and Screen Scrapers
Authors: Michael Schrenk, Michael Shrenk
Venue:  (2007)

The Internet is bigger and better than what a mere browser allows. Webbots, Spiders, and Screen Scrapers is for programmers and businesspeople who want to take full advantage of the vast resources available on the Web. There's no reason to let browsers limit your online experience-especially when you can easily automate online tasks to suit your individual needs. Learn how to write webbots and spiders that do all this and more: Programmatically download entire websites Effectively parse data from web pages Manage cookies Decode encrypted files Automate form submissions Send and receive email Send SMS alerts to your cell phone Unlock password-protected websites Automatically bid in online auctions Exchange data with FTP and NNTP servers Sample projects using standard code libraries reinforce these new skills. You'll learn how to create your own webbots and spiders that track online prices, aggregate different data sources into a single web page, and archive the online data you just can't live without. You'll learn inside information from an experienced webbot developer on how and when to write stealthy webbots that mimic human behavior, tips for developing fault-tolerant designs, and various methods for launching and scheduling webbots. You'll also get advice on how to write webbots and spiders that respect website owner property rights, plus techniques for shielding websites from unwanted robots. As a bonus, visit the author's website to test your webbots on sample target pages, and to download the scripts and code libraries used in the book. Some tasks are just too tedious-or too important!- to leave to humans. Once you've automated your online life, you'll never let a browser limit the way you use the Internet again.
Approximating fluid schedules in crossbar packet-switches and Banyan networks
Authors: Michael Rosenblum, Constantine Caramanis, Michel X. Goemans, Vahid Tarokh
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of transmissions in which only whole packets are sent. We prove worst-case bounds on the additional buffer use, which we call backlog, that results from using such an approximation.We first consider the N × N, input queued, crossbar switch. Our main result is an online packet-scheduling algorithm using no speedup that guarantees backlog at most (N+1)2/4 packets at each input port and each output port. Upper bounds on worst-case backlog have been proved for the case of constant fluid schedules, such as the N2-2N+2 bound of Chang, Chen, and Huang (INFOCOM, 2000). Our main result for the crossbar switch is the first, to our knowledge, to bound backlog in terms of switch size N for arbitrary, time-varying fluid schedules, without using speedup.Our main result for Banyan networks is an exact characterization of the speedup required to maintain bounded backlog, in terms of polytopes derived from the network topology.
On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
Authors: Jianer Chen, Fenghui Zhang
Venue: Theoretical Computer Science (2006)

The field of supply chain management has been growing at a rapid pace in recent years, both as a research area and as a practical discipline. In this paper, we study the computational complexity of product covering problems in 3-tier supply chain models, and present natural complete problems for the classes W[3] and W[4] in parameterized complexity theory. This seems the first group of natural complete problems for higher levels in the parameterized intractability hierarchy (i.e., the W-hierarchy), and the first precise complexity characterizations of certain optimization problems in the research of supply chain management. Our results also derive strong computational lower bounds and inapproximability for these optimization problems.
An Integrative Modelling Approach for Simulation and Analysis of Adaptive Agents
Authors: Tibor Bosse, Catholijn M. Jonker, Jan Treur
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

To simulate adaptive agents with abilities matching those of their real-world counterparts, a natural approach is to incorporate adaptation mechanisms such as classical conditioning into agent-based simulation. Existing models for adaptation mechanisms are usually based on quantitative methods such as DST. In contrast, agent-based simulation is usually based on qualitative, logical languages. To bridge this gap, this paper puts forward an integrative approach to simulate and analyse the conditioning process of an adaptive agent, which integrates quantitative and qualitative aspects within one temporal specification language. The approach comprises (1) simulation of adaptation mechanisms in an executable language, (2) automated analysis of dynamic properties against simulation traces, and (3) verification of representation relations for internal agent states against simulation traces. Furthermore, the approach addresses the issue of realism of intermediate states in a simulated conditioning process.
Notes from industry
Authors: Stanley Habib
Venue: ACM SIGMICRO Newsletter (1973)

OCEANPORT, N.J., SEPT. 25, 1973 -- A 16-bit minicomputer priced at under $2,000.00 in quantities and a 32-bit minicomputer priced at under $6,000.00 in quantities, were introduced today by Interdata, Inc.
Microprogramming for the hardware engineer
Authors: John R. Mick
Venue: ACM SIGMICRO Newsletter (1976)

With the advent of the Am2901 four-bit microprocessor slice and the Am2909 bipolar microprogram sequencer, the design engineer can upgrade the performance of existing systems or implement new systems taking advantage of the latest state-of-the-art technology in Low-Power Schottky integrated circuits. These devices, however, utilize a new concept in machine design not familiar to many design engineers. This technique is called microprogramming. 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
Special Edition Using Adobe Creative Suite 2 (Special Edition Using)
Authors: Michael Smick
Venue:  (2005)

Get acquainted with Adobe CS2 with the help of the ultimate comprehensive reference guide, Special Edition Using Adobe Creative Suite 2. Not only does it include material that covers the new product release, the author and team of contributors also covers how to use the individual products and how to integrate them so that you can use the Suite in an effective manner. The entire Suite is covered, including tools that aren't as well-documented. Youll find coverage of: Photoshop Illustrator InDesign GoLive Acrobat Designer Version Cue Bridge Stock PhotoWith Special Edition Using Adobe Creative Suite 2, you will easily master Adobe Creative Suite 2. 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
Microsoft Expression Web: Visual QuickStart Guide
Authors: Nolan Hester
Venue:  (2007)

Get a jump start on using this brand-new Web creation tool from Microsoft. Built from the ground up using current Web standards, Expression Web make it easy to create pages that look good in all browsers. Mirroring the program's focus on standards, the book shows you how to use Cascading Style Sheets to build consistent, easy to navigateï¾ designs. CSS newcomers will welcome the plain-spoken approach to a sometimes intimidating topic. Old hands at CSS will find plenty of tips on using Expression Web's many style tools, which are some of the best available in any Web creation program.ï¾ Packed with more than 600 screenshots, the book goes beyond crafting good-looking single pages. Instead, it shows you how to use templates to generate whole sites with uniform, yet creative, layouts that can be reconfigured with the click of a button. You'll also learn how to give sites extra polish with interactive behaviors and forms.ï¾ Microsoft Expression Web: Visual Quickstart Guide contains exactly what you need to get started building standards-compliant Web sites using this powerful tool.
TCP/IP Protocol Suite, 3 edition
Authors: Behrouz A. Forouzan
Venue:  (2005)

Networking technologies have become an integral part of everyday life, which has led to a dramatic increase in the number of professions where it is important to understand network technologies. TCP/IP Protocol Suite teaches students and professionals, with no prior knowledge of TCP/IP, everything they need to know about the subject. This comprehensive book uses hundreds of figures to make technical concepts easy to grasp, as well as many examples, which help tie the material to the real-world. The second edition of TCP/IP Protocol Suite has been fully updated to include all of the recent technology changes in the field. Many new chapters have been added such as one on Mobile IP, Multimedia and Internet, Network Security, and IP over ATM. Additionally, out-of-date material has been overhauled to reflect recent changes in technology.Table of contents1 Introduction2 The OSI Model and the TCP/IP Protocol Suite3 Underlying Technologies4 IP Addresses: Classful Addressing5 IP Addresses: Classless Addressing6 Delivery, Forwarding, and Routing of IP Packets7 ARP and RARP8 Internet Protocol (IP)9 Internet Control Message Protocol (ICMP)10 Internet Group Management Protocol (IGMP)11 User Datagram Protocol (UDP)12 Transmission Control Protocol (TCP)13 Stream Control Transmission Protocol (SCTP)14 Unicast Routing Protocols (RIP, OSPF, and BGP)15 Multicasting and Multicast Routing Protocols16 Host Configuration: BOOTP and DHCP17 Domain Name System (DNS)18 Remote Login: TELNET19 File Transfer: FTP and TFTP20 Electronic Mail: SMTP, POP, and IMAP21 Network Management: SNMP22 World Wide Web: HTTP23 IP over ATM24 Mobile IP25 Multimedia26 Private Networks, Virtual Private Networks, and Network Address Translation27 Next Generation: IPv6 and ICMPv628 Network SecurityAppendix A ASCII CodeAppendix B Numbering SystemsAppendix C ChecksumAppendix D Error DetectionAppendix E Project 802Appendix F Contact AddressesAppendix G RFCsAppendix H UDP and TCP Ports
A control word model for detecting conflicts between microoperations
Authors: Ted Lewis, Bruce Shriver
Venue: ACM SIGMICRO Newsletter (1975)

The compilation and optimization of a microprogram for a computer with a horizontal control word format is highly machine dependent. The compilation phase involves the detection of parallelism in a sequence of source statements followed by a mapping into a sequence of micro-operations. The optimization phase involves combining these microoperations to form microinstructions in an optimal manner. One of the important subprocesses of the optimization phase is determining whether or not two or more microoperations can be executed concurrently.
Class-specific feature polynomial classifier for pattern classification and its application to handwritten numeral recognition
Authors: Cheng-Lin Liu, Hiroshi Sako
Venue: Pattern Recognition (2006)

The polynomial classifier (PC) that takes the binomial terms of reduced subspace features as inputs has shown superior performance to multilayer neural networks in pattern classification. In this paper, we propose a class-specific feature polynomial classifier (CFPC) that extracts class-specific features from class-specific subspaces, unlike the ordinary PC that uses a class-independent subspace. The CFPC can be viewed as a hybrid of ordinary PC and projection distance method. The class-specific features better separate one class from the others, and the incorporation of class-specific projection distance further improves the separability. The connecting weights of CFPC are efficiently learned class-by-class to minimize the mean square error on training samples. To justify the promise of CFPC, we have conducted experiments of handwritten digit recognition and numeral string recognition on the NIST Special Database 19 (SD19). The digit recognition task was also benchmarked on two standard databases USPS and MNIST. The results show that the performance of CFPC is superior to that of ordinary PC, and is competitive with support vector classifiers (SVCs).
Effects of reward expectancy on sequential eye movements in monkeys
Authors: Jeong-woo Sohn, Daeyeol Lee
Venue: Neural Networks (2006)

Desirability of an action, often referred to as utility or value, is determined by various factors, such as the probability and timing of expected reward. We investigated how performance of monkeys in an oculomotor serial reaction time task is influenced by multiple motivational factors. The animals produced a series of visually-guided eye movements, while the sequence of target locations and the location of the rewarded target were systematically manipulated. The results show that error rates as well as saccade latencies were consistently influenced by the number of remaining movements necessary to obtain a reward. In addition, when the animal produced multiple saccades before fixating a given target, the first saccade tended to be directed towards the rewarded location, suggesting that saccades to rewarded location and visual target might be programmed concurrently. These results show that monkeys can utilize information about the required sequence of movements to update their subjective values.
A method to compute distance between two categorical values of same attribute in unsupervised learning for categorical data set
Authors: Amir Ahmad, Lipika Dey
Venue: Pattern Recognition Letters (2007)

Computation of similarity between categorical data objects in unsupervised learning is an important data mining problem. We propose a method to compute distance between two attribute values of same attribute for unsupervised learning. This approach is based on the fact that similarity of two attribute values is dependent on their relationship with other attributes. Computational cost of this method is linear with respect to number of data objects in data set. To see the effectiveness of our proposed distance measure, we use proposed distance measure with K-mode clustering algorithm to cluster various categorical data sets. Significant improvement in clustering accuracy is observed as compared to clustering results obtained using traditional K-mode clustering algorithm.
DV Filmmaking: From Start to Finish (O'Reilly Digital Studio)
Authors: Ian David Aronson
Venue:  (2006)

Thanks to the digital revolution, film artists now have a spectacular array of powerful, new, inexpensive tools for creative expression through digital film. The once powerful studios can no longer stifle an artist's creativity. With the power of the Internet, film artists are finding once unimaginable ways to distribute their creations worldwide. DV Filmmaking: From Start to Finish covers all aspects of the new digital video frontier, for amateurs and professionals alike--from the nuts and bolts of timecode and aspect ratio; to framing, lighting, and sound recording; as well as editing, special effects creation, and distribution. The book is written for filmmakers at varying experience levels--taking an integrated approach to media production, and emphasizing the ways different aspects of the process work together to create a vital work of digital art: Hands-on detailed examination of the artistic aspects of film and video production Extensive examples use comprehensive step-by-step exercises for advanced editing techniques Scenes from successful films illustrate techniques used by professionals Includes a collection of professionally shot video clips, so the user can read and follow along with sets of structured exercises Develops a highly refined repertoire of advanced skills in editing, effects creation, title design, and more Inspires advanced readers to work with the included clips on their own and experiment with new ideas Written for both Mac and PC users and covers advanced uses of both Final Cut Pro and Adobe After Effects Written in an engaging, accessible style, DV Filmmaking provides a solid foundation of tremendous value to a beginner, while addressing the fine points of filmmaking with a level of sophistication, detail, and insight that even the most worldly director or educator can appreciate. The author draws upon his years of experience teaching at the college and graduate level, his extensive professional background as a media producer, and his unmistakable love of cinema to create a text that's not only easy to learn from, but also fun to read. 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 Effect of Faults on Network Expansion
Authors: Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
Venue: Theory of Computing Systems (2006)

We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i.e., linear-sized) connected component with approximately the same expansion as the original fault-free network. We use a pruning technique that culls away those parts of the faulty network that have poor expansion. The faults may occur at random or be caused by an adversary. Our techniques apply in either case. In the adversarial setting we prove that for every network with expansion $\alpha,$ a large connected component with basically the same expansion as the original network exists for up to a constant times $\alpha \cdot n$ faults. We show this result is tight in the sense that every graph G of size n and uniform expansion $\alpha(\cdot)$ can be broken into components of size o(n) with $\omega(\alpha(n) \cdot n)$ faults. Unlike the adversarial case, the expansion of a graph gives a very weak bound on its resilience to random faults. While it is the case, as before, that there are networks of uniform expansion $\Omega(1/{\rm log}\, n)$ that are not resilient against a fault probability of a constant times $1/{\log}\, n,$ it is also observed that there are networks of uniform expansion $O(1/\sqrt{n})$ that are resilient against a constant fault probability. Thus, we introduce a different parameter, called the span of a graph, which gives us a more precise handle on the maximum fault probability. We use the span to show the first known results for the effect of random faults on the expansion of d-dimensional meshes.