ppxscal/embedding_network huggingface dataset:
IBM System I5, I5, and Iseries Systems Builder IBM I5/Os Version 5 Release 4 - January 2006
Venue:  (2006)

Attention: Before reviewing this publication you should first review IBM Redbooks® Technote TIPS0637 - Where to Find Today and Yesterday's System i Technical Marketing Deliverables Welcome to the thirteenth formal edition of the world-renown System Builder. This IBM System i5, IBM eServer i5, and iSeries System Builder, SG24-2155, offers you a comprehensive guide to the IBM System i5, IBM eServer i5, and iSeries processor hardware, related hardware, and System i software marketed by IBM representatives since the introduction of the AS/400e servers in 1996. This technical IBM Redbook describes the newest members of the System i product line, the IBM System i5 Models 520, 550, 570 and 595, as well as the IBM eServer i5 Models 520, 550, 570, and 595, and the iSeries Models 800, 810, 825, 870, and Model 890. This redbook has been updated to include changes to the software offerings with the latest release of i5/OS software, IBM i5/OS Version 5 Release 4. This book is written for use by IBM System Specialists, Marketing Representatives, Business Partners, and clients. Use this System Builder for detailed System i information and configuration rules. Refer to the companion guide IBM System i5 Handbook, SG24-7486, as a reference for the latest marketing messages on today's models and software, and IBM eServer iSeries Migration: A Guide to Upgrades and Migrations to POWER TechnologyFont, SG24-7200 , for migration considerations. Placement rules are further described in PCI and PCI-X Placement Rules for IBM System i5, eServer i5, and iSeries servers with i5/OS V5R4 and V5R3, REDP-4011 . Readers who require the latest System i information need to refer to the IBM Redbooks® publication IBM System i Overview: Models 515, 525, 570, 595, and More, REDP-5052. This contains a superset of the system builder type information provided in SG24-2155-12. There are no plans to update SG24-2155. See TIPS0637 for the REDP-4011 version of PCI and PCI-X Placement Rules content that corresponds to REDP-5052 content. 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
Rapid and brief communication: The solutions of equation-based noise detector for an adaptive median filter
Authors: Shi-Qiang Yuan, Yong-Hong Tan
Venue: Pattern Recognition (2006)

Techniques of noise detection have been widely applied in impulse noise reduction. However, the phenomenon of pixel misclassification is very obvious in high noise density. In order to improve pixel identification, in this paper, the new noise detector is proposed. Based on solutions of equations, an estimated block of every 8x8 block of a noise image is generated. Then, according to relationships between these noise blocks and their estimated blocks, corrupted and uncorrupted pixels are identified. During image filtering, a noise-detection-based adaptive median algorithm is presented. Experimental results show that the proposed filter can well reduce the impulse noise and preserve more details of original images.
Information Theoretic Deformable Registration Using Local Image Information
Authors: Bilge Karaçali
Venue: International Journal of Computer Vision (2007)

We present a deformable registration algorithm for multi-modality images based on information theoretic similarity measures at the scale of individual image voxels. We derive analytical expressions for the mutual information, the joint entropy, and the sum of marginal entropies of two images over a small neighborhood in terms of image gradients. Using these expressions, we formulate image registration algorithms maximizing local similarity over the whole image domain in an energy minimization framework. This strategy produces highly elastic image alignment as the registration is driven by voxel similarities between the images, the algorithms are easily implementable using the closed-form expressions for the derivative of the optimization function with respect to the deformation, and avoid estimation of joint and marginal probability densities governing the image intensities essential to conventional information theoretic image registration methods.
Inpainting Highlights Using Color Line Projection
Authors: Joung Wook Park, Kwan Heng Lee
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper we propose a novel method to inpaint highlights and to remove the specularity in the image with specular objects by the color line projection. Color line projection is the method that a color with a surface reflection component is projected near the diffuse color line by following the direction of the specular color line. We use two captured images using different exposure time so that the clue of the original color in a highlight area is searched from two images since the color at the highlight region is distorted and saturated to the illumination color. In the first step of the proposed procedure, the region corresponding to the highlight is generated and the clue of the original highlight color is acquired. In the next step, the color line is generated by the restricted region growing method around the highlight region, and the color line is divided into the diffuse color line and the specular color line. In the final step, pixels near the specular color line are projected onto near the diffuse color line by the color line projection, in which the modified random function is applied to realistically inpaint the highlight. One of advantages in our method is to find the highlight region and the clue of the original color of the highlight with ease. It also efficiently estimates the surface reflection component which is utilized to remove specularity and to inpaint the highlight. The proposed method performs the highlight inpainting and the specular removal simultaneously once the color line is generated. In addition, color line projection with the modified random function can make the result more realistic. We show experimental results from the real images and make a synthesis of the real image and the image modified by the proposed method.
Show Me QuickBooks 2006 (Show Me)
Authors: Gail Perry
Venue:  (2005)

Show Me QuickBooks 2006ï¾ will help youï¾ learn visually how to perform tasks usingï¾ QuickBooks 2006.ï¾ The step-by-step tasks lend themselves to easy learning and thorough comprehension.ï¾ You willï¾ able to find answers to yourquestions quickly with this user-friendly method of training. Each task includes a screen-by-screen visual accompanied by a concise text description that makes performing everyday tasks quick and simple. 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
Architecting a reliable CMP switch architecture
Authors: Kypros Constantinides, Stephen Plaza, Jason Blome, Valeria Bertacco, Scott Mahlke, Todd Austin, Bin Zhang, Michael Orshansky
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

As silicon technologies move into the nanometer regime, transistor reliability is expected to wane as devices become subject to extreme process variation, particle-induced transient errors, and transistor wear-out. Unless these challenges are addressed, computer vendors can expect low yields and short mean-times-to-failure. In this article, we examine the challenges of designing complex computing systems in the presence of transient and permanent faults. We select one small aspect of a typical chip multiprocessor (CMP) system to study in detail, a single CMP router switch. Our goal is to design a BulletProof CMP switch architecture capable of tolerating significant levels of various types of defects. We first assess the vulnerability of the CMP switch to transient faults. To better understand the impact of these faults, we evaluate our CMP switch designs using circuit-level timing on detailed physical layouts. Our infrastructure represents a new level of fidelity in architectural-level fault analysis, as we can accurately track faults as they occur, noting whether they manifest or not, because of masking in the circuits, logic, or architecture. Our experimental results are quite illuminating. We find that transient faults, because of their fleeting nature, are of little concern for our CMP switch, even within large switch fabrics with fast clocks. Next, we develop a unified model of permanent faults, based on the time-tested bathtub curve. Using this convenient abstraction, we analyze the reliability versus area tradeoff across a wide spectrum of CMP switch designs, ranging from unprotected designs to fully protected designs with on-line repair and recovery capabilities. Protection is considered at multiple levels from the entire system down through arbitrary partitions of the design. We find that designs are attainable that can tolerate a larger number of defects with less overhead than na&iuml;ve triple-modular redundancy, using domain-specific techniques, such as end-to-end error detection, resource sparing, automatic circuit decomposition, and iterative diagnosis and reconfiguration.
DisLoP&colon; a research project on Disjunctive Logic Programming
Authors: Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä
Venue: AI Communications (1997)

This paper gives a brief high&dash;level description of what has been done in the Disjunctive Logic Programming&dash;project (funded by Deutsche Forschungs&dash;Gemeinschaft), undertaken by the University of Koblenz, Germany since July 1995. Presented are the main ideas, the implemented systems and how to access them, and the relevant papers are cited. This paper also serves as a brief survey of the current status of disjunctive logic programming by highlighting important developments and provides enough pointers for further reading.
Now You Know Treo
Authors: Patrick Ames, David Moloney
Venue:  (2004)

Even a smartphone needs a smart user to take advantage of all of its brilliance-especially when that phone is as jam-packed with features as the Treo. To master all of the Treo's phone, email, Internet, photographic, and organizational capabilities, you need this pocket-sized guide! As the only Treo guide authorized by its maker (palmOne), this one goes way beyond the manual to demonstrate the tricks and techniques that aren't divulged anywhere else. With Treo in your hand and this guide at your side, you can work as you read, mastering one topic quickly and then moving on to the next. Each tip or technique takes just minutes to complete, which means you can use what you learn immediately and watch your skills improve every time you pick up your handheld. Use this guide just as you do your Treo itself-when you need it, to do precisely what you want with your smartest of tools!
Leakage Analysis of DPA Countermeasures at the Logic Level
Authors: Minoru Saeki, Daisuke Suzuki, Tetsuya Ichikawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

In this paper, we propose new models for directly evaluating DPA leakage from logic information in CMOS circuits. These models are based on the transition probability for each gate, and are naturally applicable to various actual devices for simulating power analysis. Furthermore, we demonstrate the weakness of previously known hardware countermeasures for both our model and FPGA and suggest secure conditions for the hardware countermeasure.
MutualBoost learning for selecting Gabor features for face recognition
Authors: Linlin Shen, Li Bai
Venue: Pattern Recognition Letters (2006)

This paper describes an improved boosting algorithm, the MutualBoost algorithm, and its application in developing a fast and robust Gabor feature based face recognition system. The algorithm uses mutual information to eliminate redundancy among Gabor features selected using the AdaBoost algorithm. Selected Gabor features are then subjected to Generalized Discriminant Analysis (GDA) for class separability enhancement before being used for face recognition. Compared with one of the top performers in the 2004 face verification competition, our method demonstrates clear advantages in classification accuracy, memory and computation. The method has been tested on the whole FERET database using the FERET evaluation protocol. Significant improvement in performance is observed. For example, existing Gabor based methods use a huge number of Gabor features, our method needs only hundreds of Gabor features to achieve very high classification accuracy. Due to substantially reduced feature dimension, memory and computation costs are reduced significantly - only 4s are needed to recognize 200 face images.
Hierarchical rule generalisation for speaker identification in fiction books
Authors: Kevin Glass, Shaun Bangay
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

This paper presents a hierarchical pattern matching and generalisation technique which is applied to the problem of locating the correct speaker of quoted speech found in fiction books. Patterns from a training set are generalised to create a small number of rules, which can be used to identify items of interest within the text. The pattern matching technique is applied to finding the Speech-Verb, Actor and Speaker of quotes found in fiction books. The technique performs well over the training data, resulting in rule-sets many times smaller than the training set, but providing very high accuracy. While the rule-set generalised from one book is less effective when applied to different books than an approach based on hand coded heuristics, performance is comparable when testing on data closely related to the training set.
Effective System Management Using the IBM Hardware Management Console for Pseries (IBM Redbooks)
Authors: Keigo Matsubara
Venue:  (2003)

Using service-related functions on the HMC Planning and implementing a secure network Exploiting HMC commands The IBM Hardware Management Console for pSeries (HMC) is a tool used for administration and management of IBM eServer pSeries servers. It was first announced in late 2001 with the IBM eServer pSeries 690 Model 681, the first partitioning-capable pSeries server model, and has been supporting the other partitioning-capable pSeries server models in conjunction with several software release level updates. The major function provided by the HMC is partitioning management, which is well covered well by several other publications. This IBM Redbook, designed to be used as a deskside reference for systems administrators who manage partitioning-capable pSeries servers using the HMC, is meant to complement these other publications by covering the following topics: - Configuring the HMC - Managing software levels on the HMC - Secure remote GUI access to the HMC - Secure networking in a partitioned environment - Service functions on the HMC In addition, this book covers the basic usage of the HMC graphical user interface. New HMC commands, available with the HMC software Release 3, Version 2, are detailed in Chapter 9, HMC command line interface and Chapter 10, Advanced HMC command examples. 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
TCP-LP: low-priority service via end-point congestion control
Authors: Aleksandar Kuzmanovic, Edward W. Knightly
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Service prioritization among different traffic classes is an important goal for the Internet. Conventional approaches to solving this problem consider the existing best-effort class as the low-priority class, and attempt to develop mechanisms that provide "better-than-best-effort" service. In this paper, we explore the opposite approach, and devise a new distributed algorithm to realize a low-priority service (as compared to the existing best effort) from the network endpoints. To this end, we develop TCP Low Priority (TCP-LP), a distributed algorithm whose goal is to utilize only the excess network bandwidth as compared to the "fair share" of bandwidth as targeted by TCP. The key mechanisms unique to TCP-LP congestion control are the use of one-way packet delays for early congestion indications and a TCP-transparent congestion avoidance policy. The results of our simulation and Internet experiments show that: 1) TCP-LP is largely non-intrusive to TCP traffic; 2) both single and aggregate TCP-LP flows are able to successfully utilize excess network bandwidth; moreover, multiple TCP-LP flows share excess bandwidth fairly; 3) substantial amounts of excess bandwidth are available to the low-priority class, even in the presence of "greedy" TCP flows; 4) the response times of web connections in the best-effort class decrease by up to 90% when long-lived bulk data transfers use TCP-LP rather than TCP; 5) despite their low-priority nature, TCP-LP flows are able to utilize significant amounts of available bandwidth in a wide-area network environment.
Practical taint-based protection using demand emulation
Authors: Alex Ho, Michael Fetterman, Christopher Clark, Andrew Warfield, Steven Hand
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

Many software attacks are based on injecting malicious code into a target host. This paper demonstrates the use of a well-known technique, data tainting, to track data received from the network as it propagates through a system and to prevent its execution. Unlike past approaches to taint tracking, which track tainted data by running the system completely in an emulator or simulator, resulting in considerable execution overhead, our work demonstrates the ability to dynamically switch a running system between virtualized and emulated execution. Using this technique, we are able to explore hardware support for taint-based protection that is deployable in real-world situations, as emulation is only used when tainted data is being processed by the CPU. By modifying the CPU, memory, and I/O devices to support taint tracking and protection, we guarantee that data received from the network may not be executed, even if it is written to, and later read from disk. We demonstrate near native speeds for workloads where little taint data is present.
Photoshop CS2: Up To Speed
Authors: Ben Willmore
Venue:  (2005)

ï¾ As the first major Photoshop update since Adobe revamped its product line in 2003, this is the release you've been waiting for-and this is the guide that will get you up to speed on it fastest! Rather than sift through hundreds of pages detailing every last Photoshop feature and function, you can go directly to the new features that interest you most and get the explanations you desire in classic Ben Willmore style-intuitive, crystal clear, and in-depth. By focusing on a single topic-what's new in this version-the award-winningï¾ author provides precisely what experienced Photoshop users like yourself have been clamoring for, in exactly the depth you demand. Including just enough information about older features to make the new ones understandable, Ben shows you not only which buttons to push but why.
Quicken 2006 for Starters: The Missing Manual
Authors: Bonnie Biafore
Venue:  (2005)

Intuit's Quicken is one of today's most popular and convenient ways to keep track of personal finances, and Quicken 2006 For Starters: The Missing Manual is the indispensable guide to using the program to simplify your finances and make the most of your money. Whether you're new to electronic banking or just new to Quicken, this refreshingly funny and sensible book zeroes in on exactly what you need to get into Quicken fast. It teaches you how do such essential things as: balance your checkbook on your computer, keep tabs on your spending, create and manage a budget, monitor and pay bills on time, determine more ways to save and stick to your savings plan, manage loans and maximize investments, make tax preparation easier (even find hidden tax deductions!), and much more. Financial-software writer and personal finance expert Bonnie Biafore delivers clear explanations and step-by-step instructions for the Quicken features you need, as well as relevant advice and plenty of real-world examples. Beginners will appreciate Biafore's clear guidance on how to set up Quicken to streamline their money management tasks. Power users will benefit from her insightful tips, tricks, and shortcuts for working around Quicken's idiosyncrasies and saving even more time and money. The book is designed to help you get up to speed fast. Biafore steps you through the basics of Quicken. Then, as you become a more efficient and sophisticated Quicken user, she helps you take advantage of the program's little-known but powerful features. And throughout the book, she offers invaluable money-management principles. You'll be generating useful reports and graphs with ease; ensuring accuracy and consistency among all your accounts; and planning, saving, and controlling your finances like never before. The book that gives you exactly what you need, Quicken 2006 For Starters: The Missing Manual helps you quickly make the most of Quicken 2006.
A computer support tool for the early stages of architectural design
Authors: Dzmitry Aliakseyeu, Jean-Bernard Martens, Matthias Rauterberg
Venue: Interacting with Computers (2006)

Even in the current computer age, there are still many important application areas, such as early architectural design, where traditional tools like sketching on paper continue to be preferred by many professionals over computer-based tools. There is a growing awareness that there are often very good grounds for this preference. Hence, instead of trying to replace such traditional ways of working, it is now often considered more opportune to try and preserve the strengths of these traditional ways of working, while at the same time improving them by providing access to new media. This is one of the main objectives of the augmented reality approach that we adopt here. In this paper, we specifically discuss the realization of a tool for early architectural design on an existing augmented reality system, called the Visual Interaction Platform. We describe the development process, the resulting tool and its performance for elementary tasks such as positioning and overdrawing. We also identify directions for future research and applications.
Situated nonmonotonic temporal reasoning with BABY&dash;SIT
Authors: Erkan Tın, Varol Akman
Venue: AI Communications (1997)

After a review of situation theory and previous attempts at &lsquo;computational&rsquo; situation theory, we present a new programming environment, BABY&dash;SIT, which is based on situation theory. We then demonstrate how problems requiring formal temporal reasoning can be solved in this framework. Specifically, the Yale Shooting Problem, which is commonly regarded as a canonical problem for nonmonotonic temporal reasoning, is implemented in BABY&dash;SIT using Yoav Shoham&rsquo;s causal theories.
Instruction fetch techniques using program equivalence
Authors: Douglas E. Eastwood
Venue: ACM SIGMICRO Newsletter (1974)

This paper discusses potential techniques for the dynamic generation of instructions in the instruction fetch unit of a processor. The chief advantage is the increased effective bandwidth in transfer of compressed program information from memory to the processor unit, which allows higher processor speed for a given memory access rate. The method is independent of cache memory techniques, although aimed at the same problem, and could be combined with use of a cache memory to obtain still more speedup of processor execution. The paper is largely at a conceptual level; work is planned to obtain data to facilitate design and simulation of a prototype machine.