ppxscal/embedding_network huggingface dataset:
Ranking and selection procedures for simulation
Authors: Kirk C. Benson, David Goldsman, Amy R. Pritchett
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We present sequential ranking and selection statistical procedures that determine the best simulated model configuration among competing alternatives. The best in this context denotes the largest expected value of a given performance metric. In order to run the procedures efficiently, we give algorithms using batched observations, which under certain conditions, exhibit the characteristics necessary for the appropriate application of ranking and selection procedures. We present empirical results that indicate that the sequential procedures are quite parsimonious, in terms of the number of required observations.
Adobe Bridge Official JavaScript Reference
Venue:  (2005)

While creative professionals spend much of their time working on illustrations, photo-editing, and laying out pages, many parts of their jobs are anything BUT creative. Too often, they spend their time doing repetitive, time-wasting tasks such as placing and replacing images, correcting errors in text, cutting and pasting, and preparing files for printing. Yet virtually every repetitive or time-consuming task that creative professionals have to do in the Adobe Creative Suite can be streamlined with the help of a script. Adobe Bridge is the new navigational center built into Adobe Creative Suite 2 software, giving users instant access to their Adobe Creative Suite project files, applications, and settings. And like all of Adobe Creative Suite 2's components, Adobe Bridge has built-in JavaScript support.Now available in print for the first time, this scripting reference provides the information experienced JavaScript users need to create scripts for Adobe Bridge, whether you're looking to create a custom file browsing view, need to export metadataï¾ from selected thumbnails automatically, or want to create custom navigational bars or dialog boxes that help streamline your company's production workflow. If you're familiar with JavaScript,, C and C++ programming, and the Adobe Creative Suite, this reference will show you how to use the scripting API to extend and manipulate Adobe Bridge. 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
Windows Server 2003 Active Directory Design And Implementation: Creating, Migrating, And Merging Networks
Authors: John Savill
Venue:  (2004)

Written by an experienced Active Directory designer and implementor, this book walks you through the concepts of the Active Directory, and the design issues associated with various business environments, outlining strategies, principles and best-practice for creating the design, before leading you through the implementation step-by-step. A well thought-out Active Directory provides a solid foundation for other services which will lower support costs and allow companies to centrally manage their environment. You should look at the Active Directory as your first step in moving to a centrally managed, highly integrated IT environment that supports efficient and effective delivery of business capabilities. Once the appropriate technical infrastructure is in place, it is vital to leverage that infrastructure to create an enterprise-class application infrastructure.While the basics of the Active Directory are straightforward, to get the most from it requires careful planning and a thorough understanding of what can be accomplished. For any environment there are a number of core stages in the Active Directory implementation; the 3 Ds: discovery, design, and deployment. In this unique book, we take a broad range of environment types and work through these stages; suggesting an Active Directory design specific to that environment, and how to implement it; at each stage providing clear instructions so the decisions are clearly understood and the best-practice principles will be maintained throughout your system's lifetime. There are many books on using, administering, or even deploying Active Directory, but this is the only book that exists to relate the crucial design aspects to your target environment, and show you to implement this design.This book covers discovery, design and deployment stages of Active Directory implementation in the following scenarios:· A small, single location company with fairly basic needs and a basic Windows NT 4.0 domain· A larger company with multiple regional areas which are currently facilitated by multiple NT 4.0 domains· A retail-type business with very different drivers and requirements from that of a standard business, based on Windows 2000 Active Directory· Merging and restructuring the Active Directory infrastructure of two financial institutionsThis book is for Windows network administrators, analysts, or architects, with a grasp of the basic operations of Active Directory, and are looking for a book that goes beyond rudimentary operations. However, all of the concepts are explained from the ground up, and the book can be read by network design and administration professionals with no prior Active Directory knowledge. 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
Simulating multiplexed SNP discovery rates using base-specific cleavage and mass spectrometry
Authors: Sebastian Böcker
Venue: Bioinformatics (2007)

Motivation: Single Nucleotide Polymorphisms (SNPs) are believed to contribute strongly to the genetic variability in living beings, and SNP and mutation discovery are of great interest in today's Life Sciences. A comparatively new method to discover such polymorphisms is based on base-specific cleavage, where resulting cleavage products are analyzed by mass spectrometry (MS). One particular advantage of this method is the possibility of multiplexing the biochemical reactions, i.e. examining multiple genomic regions in parallel. Simulations can help estimating the performance of a method for polymorphism discovery, and allow us to evaluate the influence of method parameters on the discovery rate, and also to investigate whether the method is well suited for a certain genomic region. Results: We show how to efficiently conduct such simulations for polymorphism discovery using base-specific cleavage and MS. Simulating multiplexed polymorphism discovery leads us to the problem of uniformly drawing a multiplex. Given a multiset of natural numbers we want to uniformly draw a subset of fixed cardinality so that the elements sum up to some fixed total length. We show how to enumerate multiplex layouts using dynamic programming, which allows us to uniformly draw a multiplex. Contact: boecker@minet.uni-jena.de
Distances with neighbourhood sequences in cubic and triangular grids
Authors: Benedek Nagy
Venue: Pattern Recognition Letters (2007)

In this paper we compute distances with neighbourhood sequences in the cubic and in the triangular grids. First we give a formula which computes the distance with arbitrary neighbourhood sequence in the three-dimensional digital space. After this, using the injection of the triangular grid to the cubic grid, we modify the formula for Z^3 to the triangular plane. The distances in the triangular grid have some properties which are not present on the square and cubic grids. It may be non-symmetric, and it is possible that the distance depends on the ordering of elements of the initial part of the neighbourhood sequence. The distance depends on the ordering of the initial part (up to the kth element) of the neighbourhood sequence if and only if there is a permutation of these elements such that the distance (up to value k) is non-symmetric using the elements in this new order. This dependence means somehow more flexibility of the distances based on neighbourhood sequences on the triangular grid than in Z^n.
Real World Adobe Photoshop CS2 (Real World)
Authors: Bruce Fraser, David Blatner
Venue:  (2005)

Fooling around with Photoshop to create interesting composite artwork is all well and good. But if you rely on Photoshop to meet tough production challenges in a fast-paced professional environment, fooling around won't cut it! You need results, and you need them now: This book delivers! In this copiously illustrated volume, best-selling authors David Blatner and Bruce Fraser offer scads of hands-on production techniques as well as clear explanations of the concepts that drive them, so that you can get the best results possible on your own Photoshop CS2 projects. You'll learn about managing color, getting great scans, correcting tones and colors, and more. You also find complete coverage of all of Photoshop CS2's newest features: integration with Adobe Bridge; Vanishing Point; super-tight integration with the rest of Adobe's Creative Suite 2; and more. Throughout, the emphasis is on efficiency: the time-saving tips and professional shortcuts that will allow you to work faster, smarter, and more creatively with Photoshop CS2.
Pattern classification in DNA microarray data of multiple tumor types
Authors: Tsun-Chen Lin, Ru-Sheng Liu, Chien-Yu Chen, Ya-Ting Chao, Shu-Yuan Chen
Venue: Pattern Recognition (2006)

In this paper, we propose a genetic algorithm with silhouette statistics as discriminant function (GASS) for gene selection and pattern recognition. The proposed method evaluates gene expression patterns for discriminating heterogeneous cancers. Distance metrics and classification rules have also been analyzed to design a GASS with high classification accuracy. Moreover, the proposed method is compared to previously published methods. Various experimental results show that our method is effective for classifying the NCI60, the GCM and the SRBCTs datasets. Moreover, GASS outperforms other existing methods in both the leave-one-out cross validations and the independent test for novel data.
Programming Atlas
Authors: Christian Wenz
Venue:  (2006)

Learn how to deliver richer, more interactive web experiences to your users using ASP.NET Atlas, Microsoft's new framework for building Ajax-savvy web sites. Web developers of all persuasions have embraced the Ajax suite of technologies (JavaScript, HTTP, XML and more) as a way to implement pages that are faster, livelier and more desktop-like in their behavior. Now Atlas brings the power of Ajax to ASP.NET 2.0 developers with controls, script libraries and server support that delivers engaging results without the pain that writing complex JavaScript can entail. Better yet, Atlas web pages are standards based and even run cross-browser.Programming Atlas is not just another "drag and drop" ASP.NET 2.0 book, but dives into the technologies that make it work. You'll begin with a tour of the technologies most often associated with Ajax, from JavaScript and XMLHttpRequest to JSON and the DOM. With the fundamentals in place, author JavaScript expert Christian Wenz unpacks the Atlas framework and shows you how to put its tools to work. You'll learn to:Understand the architecture of Atlas and the role played by server conrols, such as ScriptManager and UpdatePanelUse core Atlas controls and extenders to build more interactive pages with text fields that autocomplete, user input that is validated, controls that can be dragged and dropped, and much moreBind, display, and update data without causing the entire page to refresh and use the Atlas web services bridge to consume third-party services beyond the domain of your applicationIncorporate Microsoft Virtual Earth into an application, use Atlas with Web Parts, and create a Windows Live GadgetUse Atlas with PHP and explore other non-Microsoft Ajax tools for ASP.NET
Neural Signatures: Multiple Coding in Spiking&#x2013;bursting Cells
Authors: Roberto Latorre, Francisco B. Rodr&#x00ed;guez, Pablo Varona
Venue: Biological Cybernetics (2006)

Recent experiments have revealed the existence of neural signatures in the activity of individual cells of the pyloric central pattern generator (CPG) of crustacean. The neural signatures consist of cell-specific spike timings in the bursting activity of the neurons. The role of these intraburst neural fingerprints is still unclear. It has been reported previously that some muscles can reflect small changes in the spike timings of the neurons that innervate them. However, it is unclear to what extent neural signatures contribute to the command message that the muscles receive from the motoneurons. It is also unknown whether the signatures have any functional meaning for the neurons that belong to the same CPG or to other interconnected CPGs. In this paper, we use realistic neural models to study the ability of single cells and small circuits to recognize individual neural signatures. We show that model cells and circuits can respond distinctly to the incoming neural fingerprints in addition to the properties of the slow depolarizing waves. Our results suggest that neural signatures can be a general mechanism of spiking&#x2013;bursting cells to implement multicoding.
Real-time outdoor video surveillance with robust foreground extraction and object tracking via multi-state transition management
Authors: Bangjun Lei, Li-Qun Xu
Venue: Pattern Recognition Letters (2006)

In this paper we present an effective and flexible real-time video analysis system aiming at a wide range of outdoor surveillance and monitoring scenarios, in which robust detection and tracking objects of interest (pedestrians and/or vehicles) are essential to detecting events and understanding scene changes. The approaches employed address properly the challenges found in typical outdoor scenes such as localised and global lighting changes, variations in object size and views, occlusions, and complex object motion and so on. The contributions include use of an effective two-layer shadow removal scheme based on brightness distortion in different colour channels, blob-based object tracking and occlusion handling via multi-state transition management. The system works equally well on highly compressed (JPEG+MPEG-4) video streams as well as raw video data; in the former case, it achieves about 18 frames per second with software MPEG-4 decoder in a modern PC. And the real-time constraint renders most complex tracking algorithms less attractive.
Modeling network intrusion detection alerts for correlation
Authors: Jingmin Zhou, Mark Heckman, Brennen Reynolds, Adam Carlson, Matt Bishop
Venue: ACM Transactions on Information and System Security (TISSEC) (2007)

Signature-based network intrusion-detection systems (NIDSs) often report a massive number of simple alerts of low-level security-related events. Many of these alerts are logically involved in a single multi-stage intrusion incident and a security officer often wants to analyze the complete incident instead of each individual simple alert. This paper proposes a well-structured model that abstracts the logical relation between the alerts in order to support automatic correlation of those alerts involved in the same intrusion. The basic building block of the model is a logical formula called a capability. We use capability to abstract consistently and precisely all levels of accesses obtained by the attacker in each step of a multistage intrusion. We then derive inference rules to define logical relations between different capabilities. Based on the model and the inference rules, we have developed several novel alert correlation algorithms and implemented a prototype alert correlator. The experimental results of the correlator using several intrusion datasets demonstrate that the approach is effective in both alert fusion and alert correlation and has the ability to correlate alerts of complex multistage intrusions. In several instances, the alert correlator successfully correlated more than two thousand Snort alerts involved in massive scanning incidents. It also helped us find two multistage intrusions that were missed in auditing by the security officers.
Using queries for distributed monitoring and forensics
Authors: Atul Singh, Petros Maniatis, Timothy Roscoe, Peter Druschel
Venue: ACM SIGOPS Operating Systems Review (2006)

Distributed systems are hard to build, profile, debug, and test. Monitoring a distributed system - to detect and analyze bugs, test for regressions, identify fault-tolerance problems or security compromises - can be difficult and error-prone. In this paper we argue that declarative development of distributed systems is well suited to tackle these tasks. We present an application logging, monitoring, and debugging facility that we have built on top of the P2 system, comprising an introspection model, an execution tracing component, and a distributed query processor. We use this facility to demonstrate a range of on-line distributed diagnosis tools that range from simple, local state assertions to sophisticated global property detectors on consistent snapshots. These tools are small, simple, and can be deployed piecemeal on-line at any point during a system's life cycle. Our evaluation suggests that the overhead of our approach to improving and monitoring running distributed systems continuously is well in tune with its benefits.
Certificateless signature: a new security model and an improved generic construction
Authors: Bessie C. Hu, Duncan S. Wong, Zhenfeng Zhang, Xiaotie Deng
Venue: Designs, Codes and Cryptography (2007)

Certificateless cryptography involves a Key Generation Center (KGC) which issues a partial key to a user and the user also independently generates an additional public/secret key pair in such a way that the KGC who knows only the partial key but not the additional secret key is not able to do any cryptographic operation on behalf of the user; and a third party who replaces the public/secret key pair but does not know the partial key cannot do any cryptographic operation as the user either. We call this attack launched by the third party as the key replacement attack. In ACISP 2004, Yum and Lee proposed a generic construction of digital signature schemes under the framework of certificateless cryptography. In this paper, we show that their generic construction is insecure against key replacement attack. In particular, we give some concrete examples to show that the security requirements of some building blocks they specified are insufficient to support some of their security claims. We then propose a modification of their scheme and show its security in a new and simplified security model. We show that our simplified definition and adversarial model not only capture all the distinct features of certificateless signature but are also more versatile when compared with all the comparable ones. We believe that the model itself is of independent interest.A conventional certificateless signature scheme only achieves Girault's Level 2 security. For achieving Level 3 security, that a conventional signature scheme in Public Key Infrastructure does, we propose an extension to our definition of certificateless signature scheme and introduce an additional security model for this extension. We show that our generic construction satisfies Level 3 security after some appropriate and simple modification.
Personalized DVB-H Service Discovery Beyond 3G
Authors: Michael Petersen
Venue: Wireless Personal Communications: An International Journal (2007)

In converged mobile broadcast and cellular services, the ability to choose among hundreds of digital broadcast streams and browsing a multitude of IP based content, will necessitate integration of advanced user interfaces capable of personalized service discovery. Next generation mobile terminals should be capable of not only displaying available services in the ESG electronic service guide but dynamically filter the content according to user preferences. This article explores possibilities for personalizing service discovery by matching semantic descriptions of media according to user-centric preferences submitted through the 3G return channel. Architectural design components are identified to filter content based on XML transformation of TV-Anytime metadata and additional elements are proposed to extend the existing data models with rich semantics based on RDF syntax and OWL ontology description logics.
Adobe Photoshop CS2 Official JavaScript Reference
Venue:  (2005)

Do you spend too much time doing repetitive production tasks such as placing and replacing images, resizing them, dragging them from one document to another, and preparing images for printing instead of being creative? Do you use Adobe Photoshop CS2 and have some experience with scripting? You're in luck. Since Adobe Creative Suite 2 was created with built-in support for scripting, virtually every repetitive or time-consuming task that creative professionals have to do in the Adobe Creative Suite can be streamlined with the help of a script. This book describes how to use JavaScript to manipulate and extend Adobe Photoshop within Adobe Creative Suite 2, and provides reference information for the JavaScript objects, properties, and functions defined by Adobe's applications. Now available in print for the first time, this scripting reference provides the information experienced JavaScript users need to create custom scripts for Photoshop, whether you're looking to automate Camera Raw options and settings, automatically resize and export large batches of images into your page-layout application, or want to automatically add metadata, like a copyright notice, to selected image files. These are just a few examples of how you can use Photoshop CS2's built-in scripting capabilities to save you from hours of repetitive tasks. 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
Mining constraint violations
Authors: Stefano Ceri, Francesco Di Giunta, Pier Luca Lanzi
Venue: ACM Transactions on Database Systems (TODS) (2007)

In this article, we introduce pesudoconstraints, a novel data mining pattern aimed at identifying rare events in databases. At first, we formally define pesudoconstraints using a probabilistic model and provide a statistical test to identify pesudoconstraints in a database. Then, we focus on a specific class of pesudoconstraints, named cycle pesudoconstraints, which often occur in databases. We define cycle pesudoconstraints in the context of the ER model and present an automatic method for detecting cycle pesudoconstraints from a relational database. Finally, we present an experiment to show cycle pesudoconstraints &ldquo;at work&rdquo; on real data.
Symbol-mapping
Authors: Lee Erman, Drew McDermott
Venue: Issue 53 (August 1975) (1975)

The technical topic for this issue is symbol-mapping, introduced in the April, 1975 issue (No. 51, pp. 4-5) by Drew McDermott.