ppxscal/embedding_network huggingface dataset:
PC Annoyances, Second Edition
Authors: Steve Bass
Venue:  (2005)

In every PC user's life, there's a point when desperate measures must be taken. Some push their PC off a pier or chuck it into a landfill. Others turn their former computing ally into a planter box. But don't give up on your PC yet--help is at hand. This easy to read, accessible book from PC World expert Steve Bass covers the waterfront of PC gripes and gremlins, with fixes for everything from Windows glitches to browsers that won't browse. Each fix is served up in bite-sized portions for quick reading--and even quicker fixing. A revised version of its best-selling predecessor, the 2nd edition offers 50 additional pages and over 120 new fixed annoyances. This reader-friendly book tackles problems related to a wide-ranging number of topics: Windows--King of Annoyances! learn how to kick Windows in the rear, overcome glitches, take charge of the interface, live with the dreaded Service Pack 2Hardware--wake up your DSL, tame your notebook, silence your PC's fan, work wonders with your scanner, and save paperEmail--from Outlook to Eudora! Defeat spam, avoid mailing list hassles, send big files, manage foldersMicrosoft Office--learn workarounds for Word, Excel, and PowerPoint that help you back up the unbackable and automate data entryInternet--shake up IE, stop Flash, outsmart defaults, control Favorites, add the Google toolbar to Netscape Plus, you get access to more than one hundred utilities that will help you squash bugs, enhance your email, untangle a system snarl, and much more. If your PC has ever annoyed you (do we see several billion raised hands?), PC Annoyances is for you. With the flip of a page or two, you can fix that faux pas and have your PC purring again.
Eliminating remote message passing in optimistic simulation
Authors: David W. Bauer,  Jr., Christopher D. Carothers
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper introduces an algorithm for parallel simulation capable of executing the critical path without a priori knowledge of the model being executed. This algorithm is founded on the observation that each initial event in a model causes a stream of events to be generated for execution. By focusing on the parallelization of event streams, rather than logical processes, we have created a new simulation engine optimized for large scale models (i.e., models with 1 million LPs or more).
Temporal filtering system to reduce the risk of spoiling a user's enjoyment
Authors: Satoshi Nakamura, Katsumi Tanaka
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

This paper proposes a temporal filtering system called the Anti-Spoiler system. The system changes filters dynamically based on user-specified preferences and the user's timetable. The system then blocks contents that would spoil the user's enjoyment of a previously unwatched content. The system analyzes a user-requested Web content, and then uses filters to prevent portions of the content being displayed that might spoil user's enjoyment. For example, the system hides the final score of football from the Web content before watching it on TV.
Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Authors: Judith Bishop, Derrick Kourie
Venue: SAICSIT; Vol. 204 (2006)

This is the 21st Annual conference of South Africa's Institute of Computer Scientists and Information Technologists. Each year the conference chair chooses a theme for the conference, and this year "Serviceoriented Software and Systems" aptly sums up a driving direction in research in South Africa today. We live in a country where small businesses and the 2nd economy are seen as a means to economic growth. To foster both of these through IT research is both the Institute's aim and challenge.Paper submission and entry were handled by the conference system, Paperdyne. 61 submissions were received and 29 full papers were chosen (48%). The referring was stringent, involving three and sometimes more referees per paper from an internationally representative programme committee, plus an online discussion to select the top papers, and a second round of checking that the referees' comments had been adhered to. This system of checks and balances seems to be working well now. We thank everyone who participated in the process --- the 43 members of the IPC and the 146 authors. In particular, thanks are due to Dirk Peters of the University of Leipzig, who ran the Paperdyne system with such technical efficiency and user-friendly support. For a separate track, posters were solicited mainly from students, and we 10 were accepted. Thanks to Vreda Pieterse for ably organising the posters.One aspect of refereeing which is still in the shake down phase is conflicts of interest. Not all referees realised the importance of stating their conflicts, resulting in emergency reviews having to be sought at the last minute. We hope that next year will go better. Simply put, a conflict exists with any author who is a close friend, family member, colleague, student, supervisor or industrial collaborator.SAICSIT traditionally has excellent keynote addesses, and this year we excel ourselves, with Professor Kurt Geihs from the University of Kassel, Germany speaking on why robotos should play soccer, and Professor Sundeep Sahay from Oslo addressing us Unpacking and Addressing Heterogeneity. For audience participation, we have two panel sessions run by Trish Alexander on opportunities for scholarly exchange and Judith Bishop on when practice becomes principles. On the afternoon of the last day, SAICSIT is followed by the IFIP WG 13.1 Workshop on HCI Education. The SAICSIT AGM and an IFIP cocktail party (by invitation), round off the professional programme.
IBM Workplace Collaborative Learning 2.6
Venue:  (2006)

This IBM Redbook features a collection of knowledge gained from IBM and SAP system experts who work with customers that use SAP applications on the IBM System i platform with i5/OS. It is written to assist SAP basis consultants and other IT professionals with the implementation of a total business solution, consisting of System i servers, i5/OS Version 5 Release 4 (V5R4), DB2 UDB for i5/OS database, and SAP products. The ideas in this book apply to the entire spectrum of business solutions within the mySAP Business Suite. These solutions share SAP NetWeaver, the common technical application platform that includes the SAP Web Application Server and SAP Business Information Warehouse. The first part of this book features an overview of SAP applications and landscape options for i5/OS followed by a discussion of SAP and i5/OS implementation and infrastructure. Then, we provide information about operational topics such as administration, printing, and how to avoid problems. After that, there is a detailed discussion about availability and backup and recovery and a section dedicated to performance topics. The book ends with an examination of the different ways that you can exchange data between your SAP applications and other applications. 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
On relational possibilistic clustering
Authors: Miquel De Cáceres, Francesc Oliva, Xavier Font
Venue: Pattern Recognition (2006)

This paper initially describes the relational counterpart of possibilistic c-means (PCM) algorithm, called relational PCM (or RPCM). RPCM is then improved to better handle arbitrary dissimilarity data. First, a re-scaling of the PCM membership function is proposed in order to obtain zero membership values when the distance to prototype equals the maximum value allowed in bounded dissimilarity measures. Second, a heuristic method of reference distance initialisation is provided which diminishes the known PCM tendency of producing coincident clusters. Finally, RPCM improved with our initialisation strategy is tested on both synthetic and real data sets with satisfactory results.
Supporting Efficient Record Linkage for Large Data Sets Using Mapping Techniques
Authors: Chen Li, Liang Jin, Sharad Mehrotra
Venue: World Wide Web (2006)

This paper describes an efficient approach to record linkage. Given two lists of records, the record-linkage problem consists of determining all pairs that are similar to each other, where the overall similarity between two records is defined based on domain-specific similarities over individual attributes. The record-linkage problem arises naturally in the context of data cleansing that usually precedes data analysis and mining. Since the scalability issue of record linkage was addressed in [21], the repertoire of database techniques dealing with multidimensional data sets has significantly increased. Specifically, many effective and efficient approaches for distance-preserving transforms and similarity joins have been developed. Based on these advances, we explore a novel approach to record linkage. For each attribute of records, we first map values to a multidimensional Euclidean space that preserves domain-specific similarity. Many mapping algorithms can be applied, and we use the Fastmap approach [16] as an example. Given the merging rule that defines when two records are similar based on their attribute-level similarities, a set of attributes are chosen along which the merge will proceed. A multidimensional similarity join over the chosen attributes is used to find similar pairs of records. Our extensive experiments using real data sets show that our solution has very good efficiency and recall.
Adobe Photoshop CS2 On Demand
Authors: Andy Anderson, Steve Johnson
Venue:  (2005)

Photoshop can be an intimidating and time-consuming program to learn. Wouldn't you rather spend your time learning by doing rather than reading? Adobe Photoshop CS 2 On Demand features step-by-step instructions with accompanying visuals so that you spend more time learning and less time reading. The in-depth, wide-ranging coverage will enable you to get the most out of Photoshop CS 2 and included tool, such as: File browser Brush special effects Photo retouching Enhanced web output features Healing brushStudying for the Adobe Certified Exam for Photoshop? This tutorial also includes exam objectives throughout its pages. You will become a master of Photoshop CS 2 with the help of Adobe Photoshop CS 2 On Demand.
Rapid and brief communication: Learning the kernel parameters in kernel minimum distance classifier
Authors: Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou
Venue: Pattern Recognition (2006)

Choosing appropriate values for kernel parameters is one of the key problems in many kernel-based methods because the values of these parameters have significant impact on the performances of these methods. In this paper, a novel approach is proposed to learn the kernel parameters in kernel minimum distance (KMD) classifier, where the values of the kernel parameters are computed through optimizing an objective function designed for measuring the classification reliability of KMD. Experiments on both artificial and real-world datasets show that the proposed approach works well on learning kernel parameters of KMD.
Development of precision transfer technology of atmospheric hot embossing by ultrasonic vibration
Authors: Harutaka Mekaru, Osamu Nakamura, Osamu Maruyama, Ryutaro Maeda, Tadashi Hattori
Venue: Microsystem Technologies (2006)

We succeeded to transfer a precise micro-pattern combining with an ultrasonic vibration in an atmospheric hot embossing on the almost same condition as a vacuum hot embossing. This paper reports the effect of the ultrasonic vibration that was verified experimentally. In the conventional method, a metallic mold and a plastic sheet are heated more than the glass transition temperature of the plastic, and the softened plastic is flowed into the pattern only by applying a load. On the other hand, a longitudinal ultrasonic vibration is added in the molding process of an ultrasonic-vibration hot embossing. The synergy effect of the load and the ultrasonic vibration enables flowing of the plastic into a more precise pattern of the metallic mold. The longitudinal wave generated by an ultrasonic vibration system of the frequency 15&#x00a0;kHz and output 900&#x00a0;W. A pattern of the Ni mold used in the experiment was a pyramid hole in which a peak was cut and sidewalls were rounded. Entrance lengths of pyramids were from 100 to 530&#x00a0;&#x03bc;m and its all of the depth were 260&#x00a0;&#x03bc;m. A polycarbonate was chosen with a replication material. Compared with the condition that the ultrasonic vibration was not used, a contact force and a contact time could be reduced to about 1/3 and 1/12, respectively.
Approximating the problem, not the solution: An alternative view of point set matching
Authors: Tibério S. Caetano, Terry Caelli
Venue: Pattern Recognition (2006)

This work discusses the issue of approximation in point set matching. In general, one may have two classes of approximations when tackling a matching problem: (1) an algorithmic approximation which consists in using suboptimal procedures to infer the assignment, and (2), a representational approximation which involves a simplified and suboptimal model for the original data. Matching techniques have typically relied on the first approach by retaining the complete model and using suboptimal techniques to solve it. In this paper, we show how a technique based on using exact inference in simple Graphical Models, an instance of the second class, can significantly outperform instances of techniques from the first class. We experimentally compare this method with well-known Spectral and Relaxation methods, which are exemplars of the first class. We have performed experiments with synthetic and real-world data sets which reveal significant performance improvement in a wide operating range.
Priority queueing systems: from probability generating functions to tail probabilities
Authors: Tom Maertens, Joris Walraevens, Herwig Bruneel
Venue: Queueing Systems: Theory and Applications (2007)

Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to invert probability generating functions, since most important distributions in discrete-time queueing systems can be determined in the form of probability generating functions. In this paper, we calculate the tail probabilities of two particular random variables in discrete-time priority queueing systems, by means of the dominant singularity approximation. We show that obtaining these tail probabilities can be a complex task, and that the obtained tail probabilities are not necessarily exponential (as in most `traditional' queueing systems). Further, we show the impact and significance of the various system parameters on the type of tail behavior. Finally, we compare our approximation results with simulations.
Stability and homotopy of a subset of the medial axis
Authors: F. Chazal, A. Lieutier
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Medial Axis is known to be unstable for non smooth objects. For an open set O, we define the Weak Feature Size, wfs, minimum distance between Oc and the critical points of the function distance to Oc. We introduce the "Lambda-Medial Axis" of O, M&lambda;, a subset of the Medial Axis of O which captures the Homotopy type of O when &lambda; < wfs. We show that, at least for some "regular" values of &lambda;, M&lambda; remains stable under Hausdorff distance perturbations of Oc.
Windows XP: A Comprehensive Approach, Student Edition, 1 edition
Venue:  (2002)

Windows XP is the latest addition to the Glencoe Comprehensive Approach Series. Like the series' other top-selling programs, it offers exceptional, step-by-step instruction to help students master Windows XP.Table of contentsUNIT 1: WINDOWS XP BASICSLesson 1: The Windows XP Desktop and the MouseLesson 2: Working with Application ControlsLesson 3: Working with WindowsUNIT 2: FILE MANAGEMENTLesson 4: Using My ComputerLesson 5: File Management Using My ComputerLesson 6: File Management Using Windows Explorer UNIT 3: CUSTOMIZING WINDOWS XPLesson 7: Customizing the DesktopLesson 8: Using the Control PanelLesson 9: Configuring Accessibility OptionsUNIT 4: MAINTAINING WINDOWS XPLesson 10: Managing Applications and Windows ComponentsLesson 11: Maintaining the Hard Drives 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
Modeling spatially correlated data in sensor networks
Authors: Apoorva Jindal, Konstantinos Psounis
Venue: ACM Transactions on Sensor Networks (TOSN) (2006)

The physical phenomena monitored by sensor networks, for example, forest temperature or water contamination, usually yield sensed data that are strongly correlated in space. With this in mind, researchers have designed a large number of sensor network protocols and algorithms that attempt to exploit such correlations.There is an increasing need to synthetically generate large traces of spatially correlated data representing a wide range of conditions to carefully study the performance of these algorithms. Further, a mathematical model for generating synthetic traces would provide guidelines for designing more efficient algorithms. These reasons motivate us to obtain a simple and accurate model of spatially correlated sensor network data.The proposed model is Markovian in nature and can capture correlation in data irrespective of the node density, the number of source nodes, or the topology. We describe a rigorous mathematical procedure and a simple practical method to extract the model parameters from real traces. We also show how to efficiently generate synthetic traces on a given topology using these parameters. The correctness of the model is verified by statistically comparing synthetic and real data. Further, the model is validated by comparing the performance of algorithms whose behavior depends on the degree of spatial correlation in data, under real and synthetic traces. The real traces are obtained from remote sensing data, publicly available sensor data, and sensor networks that we deploy. We show that the proposed model is more general and accurate than the commonly used jointly Gaussian model. Finally, we create tools that can be easily used by researchers to synthetically generate traces of any size and degree of correlation.
A polytope method for estimating factor main effects efficiently
Authors: Bruce E. Ankenman, Russell C. H. Cheng, Susan M. Lewis
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Consider the problem of identifying important factors influencing a response in a simulation experiment where the number of factors is large. When the direction of the effect of factors is known, the method of sequential bifurcation is effective for quickly removing non-influential factors. Though good, the method is not fully efficient in that not all the information available is fully utilized. We present a method based on a polytope construction that makes use of all available information and which is therefore more efficient. In this paper we focus on the deterministic case to highlight its theoretical foundation. The method can however be extended to the stochastic case. Numerical examples are given comparing the new method with sequential bifurcation showing its improved performance.
A simulation analysis of multicasting in delay tolerant networks
Authors: Muhammad Abdulla, Robert Simon
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Delay tolerant networks (DTNs) are a class of systems that experience frequent and long-duration partitions. As in all distributed systems, DTN multicasting is a desirable feature for applications where some form of group communication is needed. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN multicasting protocols. In this paper, we examine multicasting in DTNs. Unlike earlier work we assume no knowledge of node connectivity or mobility patterns. We propose the use of both single-copy and multi-copy routing DTN routing algorithms. We also explore the use of gossiping and core nodes in DTNs to decrease the number of redundant messages while maintaining high message delivery ratios. We have performed extensive evaluations of our proposed methods. Our results show that with careful protocol parameter selection it is possible to achieve high delivery rates for various system scenarios.
Fingerprint enhancement using STFT analysis
Authors: Sharat Chikkerur, Alexander N. Cartwright, Venu Govindaraju
Venue: Pattern Recognition (2007)

Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is still an open problem. Extracting features out of poor quality prints is the most challenging problem faced in this area. This paper introduces a new approach for fingerprint enhancement based on short time Fourier transform (STFT) Analysis. STFT is a well-known technique in signal processing to analyze non-stationary signals. Here we extend its application to 2D fingerprint images. The algorithm simultaneously estimates all the intrinsic properties of the fingerprints such as the foreground region mask, local ridge orientation and local ridge frequency. Furthermore we propose a probabilistic approach of robustly estimating these parameters. We experimentally compare the proposed approach to other filtering approaches in literature and show that our technique performs favorably.
Enterprise Security Architecture Using IBM Tivoli Security Solutions
Venue:  (2006)

This IBM Redbooks publication reviews the overall Tivoli Enterprise Security Architecture. It focuses on the integration of audit and compliance, access control, identity management, and federation throughout extensive e-business enterprise implementations. The available security product diversity in the marketplace challenges everyone in charge of designing single secure solutions or an overall enterprise security architecture. With Access Manager, Identity Manager, Federated Identity Manager, Security Compliance Manager, Security Operations Manager, Directory Server, and Directory Integrator, Tivoli offers a complete set of products designed to address these challenges. This book describes the major logical and physical components of each of the Tivoli products. It also depicts several e-business scenarios with different security challenges and requirements. By matching the desired Tivoli security product criteria, this publication describes the appropriate security implementations that meet the targeted requirements. This book is a valuable resource for security officers, administrators, and architects who want to understand and implement enterprise security following architectural guidelines. 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
Microprogram design at the processor level
Authors: Graham Wood
Venue: ACM SIGMICRO Newsletter (1979)

This paper presents a method for separating the design and implementation phases of microprogram development. The microprogram is written in terms of register transfer level micro-operations and the microinstruction format is specified by means of a field-based representation schema. The micro-operations are automatically mapped into the micro-orders of the format and packed together into microinstruction words to yield a microprogram in the defined format.