ppxscal/embedding_network huggingface dataset:
Efficient importance sampling for reduced form models in credit risk
Authors: Achal Bassamboo, Sachin Jain
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In this paper we study the problem of estimating probability of large losses in the framework of doubly stochastic credit risk models. We derive a logarithmic asymptote for the probability of interest in a specific asymptotic regime and propose an asymptotically optimal importance sampling algorithm for efficiently estimating the same. The numerical results in the last section corroborate our theoretical findings.
Motion for Mac OS X (Visual QuickStart Guide)
Authors: Mark Spencer
Venue:  (2004)

Offering never-before-seen features like the ability to preview multiple HD videos in real time and Behaviors-based animations plus a price hundreds of dollars below its big-name competitor, Apple's brand-new Motion software is one tool you won't want to live without. This task-based guide delivers all the practical, fun, visual instructions you need to start taking advantage of it immediately. In typical to-the-point Visual QuickStart style, this volume shows you how to start using Motion's many exciting features immediately to create jaw-dropping effects of your own. In short order, you'll learn how to create multilayer composites, stylized title animation, DVD motion menus, and more. You'll also learn about particle dynamics and Behaviors as well how to create dozens of effects using Motion's filters and transformations. If you create motion graphics for film, TV, video, or DVDs--as a filmmaker, designer, DVD producer, or anyone else involved with video-you'll want this guide!
Rapid and brief communication: Center-based nearest neighbor classifier
Authors: Qing-Bin Gao, Zheng-Zhi Wang
Venue: Pattern Recognition (2007)

In this paper, a novel center-based nearest neighbor (CNN) classifier is proposed to deal with the pattern classification problems. Unlike nearest feature line (NFL) method, CNN considers the line passing through a sample point with known label and the center of the sample class. This line is called the center-based line (CL). These lines seem to have more capacity of representation for sample classes than the original samples and thus can capture more information. Similar to NFL, CNN is based on the nearest distance from an unknown sample point to a certain CL for classification. As a result, the computation time of CNN can be shortened dramatically with less accuracy decrease when compared with NFL. The performance of CNN is demonstrated in one simulation experiment from computational biology and high classification accuracy has been achieved in the leave-one-out test. The comparisons with nearest neighbor (NN) classifier and NFL classifier indicate that this novel classifier achieves competitive performance.
The new features of Fortran 2000
Authors: John Reid
Venue: ACM SIGPLAN Fortran Forum (2002)

The aim of this paper is to summarize the new features in the draft Fortran 2000 standard (J3 2002). We take as our starting point Fortran 95 plus the two official extensions (Cohen 2001, Reid 2001) that have been published as Type 2 Technical Reports. These provide features for1. Allocatable dummy arguments and type components, and2. Support for the five exceptions of the IEEE Floating Point Standard (IEEE 1989) and for other features of this Standard.There is a firm commitment to include the features of these TRs in Fortran 2000, apart from changes that follow from errors and omissions found during implementation. Therefore, these features are not open to comment and are not described here. For an informal description, see chapters 12 and 13 of Metcalf and Reid (1999).Fortran 2000 is a major extension of Fortran 95. This contrasts with Fortran 95, which was a minor extension of Fortran 90. The major changes concei'n the two TR items, object orientation, and interfacing with C. Allocatable arrays are very important for optimization - after all, good execution speed is Fortran's forte. Exception handling is needed to write robust code. Object orientation provides an effective way to separate programming into independent tasks and to build upon existing codes; we describe these features in Section 1. Interfacing with C is needed for access to the all the hardware features and to allow C programmers to call efficient Fortran codes; we describe these features in Section 4. There are also many less major enhancements, described in Sections 2 and 3.
Photoshop Fine Art Effects Cookbook: 62 Easy-To-Follow Recipes for Creating the Classic Styles of Great Artists & Photographers (O'Reilly Digital Studio)
Authors: John Beardsworth
Venue:  (2006)

How would you like to create your own impressionist landscape, a van Gogh still life, or a surrealist Salvador Dali dream world? Or perhaps a classic Ansel Adams photograph of Yosemite or an authentic-looking 19th century Daguerrotype? You can do all of that and more with Photoshop Fine Art Effects Cookbook. The book tells you all you need to know to turn your original digital photographs into images that mimic the styles of great photographers and painters. From advice on how to develop an eye for appropriate subject matter to 62 detailed recipes that demonstrate exactly how to create an "original" van Gogh, Vermeer, Edward Weston, or Andy Warhol (among others), this book is an authentic guide to understanding and simulating the work of great artists-and a whole lot of fun. Analyzing the styles of great artists: format, composition, angles of view, color palettes, and image textures Shooting for digital manipulation, working non-destructively, making your own brushes and patterns Creating Daguerrotypes, cyanotypes, stop-motion photographs, cross-processed images, Polaroid transfers, and infrared effects Mimicking photographic styles from the pre-Raphaelites and the Naturalists to Jerry Uelsmann and David Hockney Exploring painting and printmaking techniques from Rembrandt to Warhol: Dutch portraits, 18th century landscape painting, Japanese woodblocks, Impressionism, Pointillism, Fauvism, Art Nouveau, Cubism, Futurism, Surrealism, and Pop Art Packed with step-by-step instructions, an inspirational selection of full-color digital imagery, and authoritative information and advice, Photoshop Fine Art Effects Cookbook is the ultimate guide to creating convincing digital masterpieces in the styles of many of the world's greatest artists. 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
Music retrieval: a tutorial and review
Authors: Nicola Orio
Venue: Foundations and Trends in Information Retrieval (2006)

The increasing availability of music in digital format needs to be matched by the development of tools for music accessing, filtering, classification, and retrieval. The research area of Music Information Retrieval (MIR) covers many of these aspects. The aim of this paper is to present an overview of this vast and new field. A number of issues, which are peculiar to the music language, are described--including forms, formats, and dimensions of music--together with the typologies of users and their information needs. To fulfil these needs a number of approaches are discussed, from direct search to information filtering and clustering of music documents. An overview of the techniques for music processing, which are commonly exploited in many approaches, is also presented. Evaluation and comparisons of the approaches on a common benchmark are other important issues. To this end, a description of the initial efforts and evaluation campaigns for MIR is provided.
ACTLS properties and Bounded Model Checking
Authors: Bożena Woźna
Venue: Fundamenta Informaticae (2004)

The main contribution of the paper consists in showing that the bounded model checking (BMC) method is feasible for ACTLS* (the universal fragment of CTLS*) which subsumes both ACTL and LTL. The extension to ACTLS^* is obtained by redefining the function returning the sufficient number of executions over which an ACTLS* formula is checked, and then combining the two known translations to SAT for ACTL and LTL formulas. The proposed translation of ACTLS* formulas is essentially different from the existing translations of both ACTL and LTL formulas. Moreover, the formal treatment is the basis for the implementation of the technique in the symbolic model checker &radic;erics.
Using Thinkvantage Technologies: Creating And Deploying Client Systems
Authors: Lucas Biggers
Venue:  (2005)

ThinkVantage Technologies bring your PCs one step closer to being self-configured, self-optimizing, self-protecting, or self-healing, to help save you time and money throughout the life of your systems. In short, ThinkVantage Technologies let you focus your attention on your business, rather than on your computer. ThinkVantage Technologies are software tools designed to help customers drive down IT support costs (in particular, the cost of a PC in managing and supporting systems after its initial purchase), increase security, and decrease the complexity of today's IT infrastructure. This IBM Redbook will help you install, tailor, and configure the ThinkVantage Technologies on Lenovo/IBM and third party desktops and mobiles. ThinkVantage Technologies covered in the book include: - ImageUltra Builder V3.0 - System Migration Assistant V5.0 - Secure Data Disposal V1.3 - Access Connections V3.81 - Active Protection System V1.33b This is Volume 1 of a two-volume set of ThinkVantage Technologies Redbooks. It describes how to create and deploy client systems. The second volume is Using ThinkVantage Technologies Volume 2: Maintaining and Recovering Client Systems, SG24-7107. 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
Problems on mathematical safes on graphs
Authors: G. A. Donets, Bin Zhang
Venue: Cybernetics and Systems Analysis (2006)

For given two sets of locks, the corresponding problems on mathematical safes are formulated on graphs. In the first set, all the locks have the same number of sates and, in the second set, any pair of locks can consist of different numbers of sates. A number of conditions are obtained under which there exist solutions to these problems for safes specified on directed or undirected single graphs such as a path, a chain, a cycle, and a star.
Least square-based finite volumes for solving the advection-diffusion of contaminants in porous media
Authors: Enrico Bertolazzi, Gianmarco Manzini
Venue: Applied Numerical Mathematics (2004)

A second-order cell-centered finite-volume method is proposed to solve the steady advection-diffusion equation for contaminant transport in porous media. This method is based on a linear least square reconstruction that maintains the approximate cell-average values. The reconstruction is combined with an appropriate slope limiter to prevent the formation of spurious oscillations in the convection-dominated case. The theoretical convergence rate is investigated on a boundary layer problem, and the preliminar results show that the method is promising in the numerical simulation of more complex groundwater flow problems.
An Introduction to IMS(TM): Your Complete Guide to IBM's Information Management System
Authors: Dean Meltz, Rick Long, Mark Harrington, Robert Hain, Geoff Nicholls
Venue:  (2004)

The Only Up-to-the-Minute Guide to IMS Version 9--Straight from IBM IMS Experts Introduces IMS, one of the world's premiere software products Thoroughly covers key IMS functions, from security to Java support For both new and experienced IMS administrators, programmers, architects, and managers Prerequisite reading for IBM IMS Mastery Certificate ProgramIMS serves more than 95 percent of Fortune 1000 companies, manages 15,000,000 gigabytes of production data, and supports more than two hundred million users per day. The brand-new IBM IMS Version 9 is not just the world's #1 platform for very large online transaction processing: it integrates with Web application server technology to enable tomorrow's most powerful Web-based applications. Now, for the first time in many years, there's a completely up-to-date guide to understanding IMS in your business environment.An Introduction to IMS covers Installing and configuring IMS Version 9 Understanding and implementing the IMS hierarchical database model Understanding and working with the IMS Transaction Manager Mastering core application programming concepts, including program structure and IMS control blocks Taking advantage of IMS 9 Java programming enhancements Working with the IMS Master Terminal Administering IMS: system definition, customization, logging, security, operations, and more Running IMS in a Parallel Sysplex(r) environmentWhether you've spent a career running IMS or you are encountering IMS for the first time, this book delivers the insights and skills you need to succeed--as an application designer, developer, or administrator.
Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers
Authors: Azzedine Boukerche, Alba Cristina Magalhaes Alves De Melo
Venue: Journal of Experimental Algorithmics (JEA) (2007)

Distributed shared memory (DSM) creates an abstraction of a physical shared memory that parallel programmers can access. Most recent software DSM systems provide relaxed-memory models that guarantee consistency only at synchronization operations, such as locks and barriers. As the main goal of DSM systems is to provide support for long-term computation-intensive applications, checkpointing and recovery mechanisms are highly desirable. This article presents and evaluates the integration of a coordinated checkpointing mechanism to the barrier primitive that is usually provided with many DSM systems. Our results on some popular benchmarks and a real parallel application show that the overhead introduced during the failure-free execution is often small.
Interoperating simulations of automatic material handling systems and manufacturing processes
Authors: Boon Ping Gan, Lai Peng Chan, Stephen John Turner
Venue: Proceedings of the 38th conference on Winter simulation (2006)

To perform a high fidelity simulation study on a 300 mm wafer fabrication plant, modeling of the manufacturing process (MP) alone is not sufficient. Inclusion of the automated material handling system (AMHS) model is necessary due to the high degree of factory automation. There isn't, however, a single tool that is capable of modeling both the AMHS and MP with sufficient accuracy and granularity. A commercial simulation package such as AutoMod is usually used to model the AMHS while AutoSched AP is usually used to model the MP. These packages can be integrated using the supplied interoperation module but flexibility in optimizing the execution performance for different simulation models is lacking. In this paper, we present an approach to interoperation based on the High Level Architecture standard. We note that the typical characteristics of disparity in the models' time granularity and frequent model interactions are the obstacle to good execution performance.
Additive form of the inverse
Authors: C. A. Haverly
Venue: Issue 12 (June 1972) (1972)

The product form of the inverse is invariably used in the current mathematical programming systems. However, the inverse can also be represented in an additive form and the additive form has some very interesting properties. Among these is a delightful symmetry by which it's as easy to update a row as a column (the product form works well only in updating columns). In fact, it's easy to update single matrix elements. 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
A design of experiments approach to readiness risk analysis
Authors: Keebom Kang, Kenneth H. Doerr, Susan M. Sanchez
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We develop a simulation model to aid in identifying and evaluating promising alternatives to achieve improvements in weapon system-level availability when services for system components are outsourced. Two outcomes are valued: improvements in average operational availability for the weapon system, and reductions in the probability that operational availability of the weapon system falls below a given planning threshold (readiness risk). In practice, these outcomes must be obtained through performance-based agreements with logistics providers. The size of the state space, and the non-linear and stochastic nature of the outcomes, precludes the use of optimization approaches. Instead, we use designed experiments to evaluate simulation scenarios in an intelligent way. This is an efficient approach that enables us to assess average readiness and readiness risk outcomes of the alternatives, as well as to identify the components and logistics factors with the greatest impact on operational availability.
Network Security Fundamentals
Authors: Gert DeLaet, Gert Schauwers
Venue:  (2004)

Companies have long been struggling with threats from the hacking community. Keeping pace with the rapid evolution of security technology and the growing complexity of threats is a challenge even in the best of times. The increased focus on security has sent IT managers and engineers scrambling to acquire the proper expertise to implement complex, multilayered solutions.Network Security Fundamentals introduces the topic of network security in an easy-to-understand and comprehensive manner. This book is designed to provide a fundamental understanding of the various components of a network security architecture and to demonstrate how each component can be implemented to achieve best results. The book uses straightforward language to introduce topics and to show the features, mechanics, and functionality of various network security devices. A series of case studies helps illuminate concepts and shows how you can apply the concepts to solve real-world problems.Divided into four parts, Network Security Fundamentals takes you on a tour of all the essential technologies and modern defenses at your disposal to help you maintain network uptime and data integrity. Part I covers the basics, introducing terms and concepts and laying the foundation of a solid security structure. The discussion focuses on weaknesses and vulnerabilities along with an overview of the traditional defenses used to thwart attacks. Part II examines two components of security-cryptography and security policies. Part III looks at the various security components. Separate chapters cover web security, router security, firewalls, intrusion detection systems (IDS), remote access security, virtual private networks (VPN), Public Key Infrastructure (PKI), wireless security, and logging and auditing. Each chapter in this section is a self-contained tutorial, allowing you to skip to those topics of greatest interest or primary concern. Part IV includes several reference appendixes, including the Cisco SAFE Blueprint, NSA guidelines, and SANS policies.Whether you are looking for an introduction to network security principles and practices or a security configuration reference, this book provides you with the invaluable insight you need to protect valuable company resources.
Tashkent: uniting durability with transaction ordering for high-performance scalable database replication
Authors: Sameh Elnikety, Steven Dropsho, Fernando Pedone
Venue: ACM SIGOPS Operating Systems Review (2006)

In stand-alone databases, the functions of ordering the transaction commits and making the effects of transactions durable are performed in one single action, namely the writing of the commit record to disk. For efficiency many of these writes are grouped into a single disk operation. In replicated databases in which all replicas agree on the commit order of update transactions, these two functions are typically separated. Specifically, the replication middleware determines the global commit order, while the database replicas make the transactions durable.The contribution of this paper is to demonstrate that this separation causes a significant scalability bottleneck. It forces some of the commit records to be written to disk serially, where in a standalone system they could have been grouped together in a single disk write. Two solutions are possible: (1) move durability from the database to the replication middleware, or (2) keep durability in the database and pass the global commit order from the replication middleware to the database.We implement these two solutions. Tashkent-MW is a pure middleware solution that combines durability and ordering in the middleware, and treats an unmodified database as a black box. In Tashkent-API, we modify the database API so that the middleware can specify the commit order to the database, thus, combining ordering and durability inside the database. We compare both Tashkent systems to an otherwise identical replicated system, called Base, in which ordering and durability remain separated. Under high update transaction loads both Tashkent systems greatly outperform Base in throughput and response time.
Apple Pro Training Series: Xsan Quick-Reference Guide (Apple Pro Training)
Venue:  (2005)

Apple's exciting new enterprise-class file system offers high-speed access to centralized shared data. This handy booklet provides invaluable setup, configuration, and troubleshooting tips. Designed as a reference, you'll find clear explanations of everything from multiple-seat topologies to working with Xsan Admin software, plus useful illustrations and schematic diagrams. A must for every Xsan installation. 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
Composition of complex optimal multi-character motions
Authors: C. Karen Liu, Aaron Hertzmann, Zoran Popović
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

This paper presents a physics-based method for creating complex multi-character motions from short single-character sequences. We represent multi-character motion synthesis as a spacetime optimization problem where constraints represent the desired character interactions. We extend standard spacetime optimization with a novel timewarp parameterization in order to jointly optimize the motion and the interaction constraints. In addition, we present an optimization algorithm based on block coordinate descent and continuations that can be used to solve large problems multiple characters usually generate. This framework allows us to synthesize multi-character motion drastically different from the input motion. Consequently, a small set of input motion dataset is sufficient to express a wide variety of multi-character motions.