ppxscal/embedding_network huggingface dataset:
Developing Extensions for Macromedia Dreamweaver 8
Authors: Anne Sandstrom, Bob Berry
Venue:  (2005)

Powerful development and design tools require thorough and authoritative technical advice and documentation. When it comes to Macromedia Dreamweaver, no one is more authoritative than Macromedia's own development and writing teams. Now their official documentation is available to you in printed book form. As you work, keep this guide by your side for ready access to valuable information on using Dreamweaver. We've designed it so that it's easy to annotate as you progress.ï¾ This book describes how to customize the Dreamweaver user interface to suit your working style, and to build Dreamweaver extensions to add functionality. It explains how each type of extension works and describes the application programming interface (API) functions that Dreamweaver calls in order to implement its various objects, menus, floating panels, server behaviors, and so on, providing a simple example for each type. The book also describes the utility API and the JavaScript API, which let you perform various supporting tasks when developing Dreamweaver extensions. In Developing Extensions for Macromedia Dreamweaver 8, learn how to: ·ï¾ ï¾ ï¾ Create an extension that streamlines site development by providing a new Property inspector, panel, or dialog box to perform tasks Dreamweaver users encounter frequently ·ï¾ ï¾ ï¾ Rearrange the objects in the Insert bar, create new tabs to reorganize the objects, and add new objects ·ï¾ ï¾ ï¾ Change the names of menu items, add new commands to menus, and remove existing commands from menus ·ï¾ ï¾ ï¾ Change browser profiles and create new ones ·ï¾ ï¾ ï¾ Change the way third-party tags (including ASP and JSP tags) appear in the Document window's Design view ·ï¾ ï¾ ï¾ Customize various Dreamweaver elements, including default documents, page designs, dialog boxes, workspace layouts, and the Code view toolbar Includes the following books in the Macromedia online documentation: · Extending Dreamweaver · Dreamweaver API Reference
Speaker verification using speaker- and test-dependent fast score normalization
Authors: Daniel Ramos-Castro, Julian Fierrez-Aguilar, Joaquin Gonzalez-Rodriguez, Javier Ortega-Garcia
Venue: Pattern Recognition Letters (2007)

A novel score normalization scheme for speaker verification is presented. The proposed technique is based on the widely used test-normalization method (Tnorm), which compensates test-dependent variability using a fixed cohort of impostors. The new procedure selects a speaker-dependent subset of impostor models from the fixed cohort using a distance-based criterion. Selection of the sub-cohort is made using a distance measure based on a fast approximation of the Kullback-Leibler (KL) divergence for Gaussian mixture models (GMM). The proposed technique has been called KL-Tnorm, and outperforms Tnorm in computational efficiency. Experimental results using NIST 2005 Speaker Recognition Evaluation protocol also show a stable performance improvement of our method on standard speaker recognition systems.
Special Edition Using Microsoft(R) Office Access 2007 (Special Edition Using)
Authors: Roger Jennings
Venue:  (2007)

<>This book offers you comprehensive, information on using the new version of Access. Not only updated for the latest version, new chapters have been added on application automation with Access macros and collaboration with Microsoft SharePoint Team Server, both of which are hot topics.ï¾ All chapters are updated for the transition from Jet to the new Access database engine. Detailed, step-by-step instructions with icons guide you throughï¾ Access through table design, data addition, importing data from external sources, query design and execution, and designing data entry forms and printed reports.FMIntroductionI Getting Acquainted with Access 20071 Access 2007 for Access 200x Users: What's New2 Building Simple Tracking Applications3 Navigating the New Access User InterfaceII Learning the Fundamentals of AccessDatabases4 Exploring Relational Database Theory and Practice5 Working with Access Databases and Tables6 Entering, Editing, and Validating Access Table Data7 Sorting, Finding, and Filtering Data8 Linking, Importing, and Exporting DataIII Transforming Data with Queries andPivotTables9 Designing Queries for Access Databases10 Understanding Access Operators and Expressions11 Creating Multitable and Crosstab Queries12 Working with PivotTable and PivotChart Views13 Creating and Updating Access Tables with ActionQueriesIV Designing Forms and Reports14 Creating and Using Basic Access Forms15 Designing Custom Multitable Forms16 Working with Simple Reports and Mailing Labels17 Preparing Advanced Reports18 Adding Graphs, PivotCharts, and PivotTablesV Moving to Networked Multiuser Applications19 Linking Access Front Ends to Access andClient/Server Tables20 Exploring Access Data Projects and SQLServer 200521 Moving from Access Queries to Transact-SQL22 Upsizing Access Applications to Access DataProjectsVI Collaborating with Access Data23 Importing and Exporting Web Pages24 Integrating with XML and InfoPath 200725 Collaborating with Windows SharePoint ServicesVII Programming and Converting AccessApplications26 Automating Access Applications with Macros 200727 Learning Visual Basic for Applications28 Handling Events with VBA and Macros29 Programming Combo and List Boxes30 Understanding Data Access Objects, OLE DB,and ADO31 Upgrading 200X Applications to Access 2007VIII AppendixA GlossaryIndex
Assessing facial beauty through proportion analysis by image processing and supervised learning
Authors: Hatice Gunes, Massimo Piccardi
Venue: International Journal of Human-Computer Studies (2006)

Perception of universal facial beauty has long been debated amongst psychologists and anthropologists. In this paper, we perform experiments to evaluate the extent of universal beauty by surveying a number of diverse human referees to grade a collection of female facial images. Results obtained show that there exists a strong central tendency in the human grades, thus exhibiting agreement on beauty assessment. We then trained an automated classifier using the average human grades as the ground truth and used it to classify an independent test set of facial images. The high accuracy achieved proves that this classifier can be used as a general, automated tool for objective classification of female facial beauty. Potential applications exist in the entertainment industry, cosmetic industry, virtual media, and plastic surgery.
Convergence Performance Analyses of Fast Data-Reusing Normalized Least Mean Squared Algorithm
Authors: Heng-Chou Chen, Oscal T.-C. Chen
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

As hardware platforms increase in computation capability, multiple filter coefficient adaptations between two neighboring input signals can be realized to achieve a high convergence rate. This study explores the data-reusing scheme based on the Normalized Least Mean Squared (NLMS) algorithm. Moreover, the impacts of the reusing times and input signal vector's variance to the convergence rate and misadjustment of an adaptive filter are theoretically derived and analyzed. A large number of reusing times was found to raise the convergence rate but also increase misadjustament, while a high variance of an input vector was found to lower misadjustment and expedite the convergence rate. To reduce computational complexity of the data-reusing scheme, this study develops the Fast Data-Reusing NLMS (FDRNLMS) algorithm. The proposed FDRNLMS requires minimal computation for the adaptation scaling factor, and only requires two more multiplication operations than NLMS in calculating each filter output. Additionally, the computation complexity of this FDRNLMS is independent of the number of reusing times. Therefore, the FDRNLMS proposed herein is superior to the NLMS and Least Mean Squared (LMS) algorithms using conventional data-reusing schemes which have computation complexity proportional to the number of reusing times.
Adobe Audition 1.5 for Windows (Visual QuickStart Guide)
Authors: Jeff Partyka
Venue:  (2004)

You've waited a long time for the missing link in Adobe's digital home-studio lineup. Now, with the introduction of the brand-new Audition music creation software, it's finally here-if only you could figure out how to use it! Because Audition started life as CoolEdit (before Adobe purchased the program from Syntrillium Software), its distinctive interface has little in common with Adobe's other content creation stand-bys Premiere and After Effects. Not to worry. This no-nonsense, task-based guide uses step-by-step instructions and a boatload of visual aids to turn the key on Audition's interface, so that you can begin using the software immediately to create and polish audio tracks for your film, video, and DVD projects. You'll quickly get up to speed on all of Audition's audio recording, mixing, analyzing, looping, and editing capabilities, so that by the end of the day, you'll know everything you need to about its noise reduction and audio restoration features, sophisticated spectrum and phase-analysis tools, extensive sound-editing capabilities, and more.
Analyzing static and temporal properties of simulation models
Authors: Mamadou Kaba Traoré
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper shows how a simulation model can be specified so that its static and temporal properties can be formally analyzed. The approach adopted is based on the integration of Formal Methods (FMs) and the DEVS paradigm. FMs are known to allow symbolic manipulation and reasoning, while DEVS is known as being a well-establish Modeling and Simulation (M&S) framework. Combining them makes it possible to develop rigorous proofs of the properties of simulation models as regard to design and use requirements. This paper focuses on the so-called atomic specification. Static aspects of the model are captured with the Z formalism, while dynamic aspects are expressed in first order logic. The specification is supported by the Z/EVES tool. A case study is exhibited.
Update operations on 3D simplicial decompositions of non-manifold objects
Authors: Leila De Floriani, Annie Hui
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

We address the problem of updating non-manifold mixed-dimensional objects, described by three-dimensional simplicial complexes embedded in 3D Euclidean space. We consider two local update operations, edge collapse and vertex split, which are the most common operations performed for simplifying a simplicial complex. We examine the effect of such operations on a 3D simplicial complex, and we describe algorithms for edge collapse and vertex split on a compact representation of a 3D simplicial complex, that we call the Non-Manifold Indexed data structure with Adjacencies (NMIA). We also discuss how to encode the information needed for performing a vertex split and an edge collapse on a 3D simplicial complex. The encoding of such information together with the algorithms for updating the NMIA data structure form the basis for defining progressive as well as multi-resolution representations for objects described by 3D simplicial complexes and for extracting variable-resolution object descriptions.
A computational method for ranking L products of parameters
Authors: Hea-Jung Kim
Venue: Computational Statistics (2006)

Research on multiple comparison ranking up to now has focused mainly on the comparison of preference in several objects (or items). This article presents a multiple comparison ranking procedure for comparing several scalar functions of parameters. A preference probability matrix for the procedure is introduced and its condition for warranting an optimal comparison ranking is studied. By using a Bayesian Monte Carlo method, we develop simulation-based procedure to estimate the matrix and obtain the optimal ranking via a row-sum scores method. The procedure is shown to be straightforward to specify distributionally and to implement computationally, with output readily adapted for required inference summaries. Necessary theory and illustrative examples are provided.
A variant of the hypergraph removal lemma
Authors: Terence Tao
Venue: Journal of Combinatorial Theory Series A (2006)

Recent work of Gowers [T. Gowers, A new proof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001) 465-588] and Nagle, Rödl, Schacht, and Skokan [B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Applications of the regularity lemma for uniform hypergraphs, preprint] has established a hypergraph removal lemma, which in turn implies some results of Szemerédi [E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975) 299-345], and Furstenberg and Katznelson [H. Furstenberg, Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Anal. Math. 34 (1978) 275-291] concerning one-dimensional and multidimensional arithmetic progressions, respectively. In this paper we shall give a self-contained proof of this hypergraph removal lemma. In fact we prove a slight strengthening of the result, which we will use in a subsequent paper [T. Tao, The Gaussian primes contain arbitrarily shaped constellations, preprint] to establish (among other things) infinitely many constellations of a prescribed shape in the Gaussian primes.
Micro-specific design flow for tool-based microtechnologies
Authors: Albert Albers, Norbert Burkardt, Tobias Deigendesch, Jochen Marz
Venue: Microsystem Technologies (2006)

Design of systems and components being produced with tool-based microtechnologies is strongly driven by technology. Thus, there are multitechnological influences from production, materials or micro-specific effects, which restrictively affect design and have to be considered. Under special regard of these peculiarities and in context with live cycle stages of tool-based microtechnological products, a design flow is presented. This incorporates a new design model, called sickle model visualizing the specific aspects when designing products of tool-based microtechnology. In order to support the design process, design rules are used to transfer knowledge from subsequent and adjacent life cycle stages to the current design stage.
Analysis and design of self-balancing production line
Authors: Daisuke Hirotani, Myreshka Myreshka, Katsumi Morikawa, Katsuhiko Takahashi
Venue: Computers and Industrial Engineering (2006)

In a "self-balancing production line", each worker is assigned work dynamically. In previous research, maximum production rates can be achieved if the workers are arranged in sequence from slowest to fastest [Bartholdi, J.J., & Eisenstein, D.D. (1996). A production line that balances itself, Operations Research, 44(1), 21-34]. However, the conditions are extremely limited, and it is necessary to conduct further research with three or more workers to find the maximum production rate. In this paper, we examine other less restrictive conditions that can achieve the same self-balancing effect, and furthermore, characteristics of this line are analyzed by deriving the imbalance condition and analyzing the influence of initial position. In addition, a method for designing a self-balancing line based on our results is proposed.
Moment equations and Hermite expansion for nonlinear stochastic differential equations with application to stock price models
Authors: Hermann Singer
Venue: Computational Statistics (2006)

Exact moment equations for nonlinear Itô processes are derived. Taylor expansion of the drift and diffusion coefficients around the first conditional moment gives a hierarchy of coupled moment equations which can be closed by truncation or a Gaussian assumption. The state transition density is expanded into a Hermite orthogonal series with leading Gaussian term and the Fourier coefficients are expressed in terms of the moments. The resulting approximate likelihood is maximized by using a quasi Newton algorithm with BFGS secant updates. A simulation study for the CEV stock price model compares the several approximate likelihood estimators with the Euler approximation and the exact ML estimator (Feller, in Ann Math 54: 173---182, 1951).
Designing patterns for profile HMM search
Authors: Yanni Sun, Jeremy Buhler
Venue: Bioinformatics (2007)

Motivation: Profile HMMs are a powerful tool for modeling conserved motifs in proteins. These models are widely used by search tools to classify new protein sequences into families based on domain architecture. However, the proliferation of known motifs and new proteomic sequence data poses a computational challenge for search, requiring days of CPU time to annotate an organism's proteome. Results: We use PROSITE-like patterns as a filter to speed up the comparison between protein sequence and profile HMM. A set of patterns is designed starting from the HMM, and only sequences matching one of these patterns are compared to the HMM by full dynamic programming. We give an algorithm to design patterns with maximal sensitivity subject to a bound on the false positive rate. Experiments show that our patterns typically retain at least 90% of the sensitivity of the source HMM while accelerating search by an order of magnitude. Availability: Contact the first author at the address below. Contact: yanni@cse.wustl.edu
How the Internet Works (8th Edition) (How It Works)
Authors: Preston Gralla
Venue:  (2006)

Simple, clear explanations walk you through every technologyDetailed explanations walk you through the technology.The Internet has changed the world... and, with everything from blogs to podcasts, Internet phones to video, it's still changing the world. Now, it's easy to understand how it all works! This book's big, brilliant, full-color illustrations and clear explanations make it all incredibly simple!DISCOVER HOW THE INTERNET REALLY WORKS... IT'S AMAZINGLY EASY!This new edition has been completely updated for today's hottest Internet technologies, Web connections, hardware, communications and entertainment services, and much more!·ï¾ ï¾ ï¾ See how the Internet can deliver any kind of information, anywhere: web pages, email, music, video, phone calls, and more!·ï¾ ï¾ ï¾ Understand the most exciting new Internet technologies, from blogs and podcasting to wikis and BitTorrent·ï¾ ï¾ ï¾ Discover how your connection to the Internet works... wireless, cable modem, DSL, even cellphones·ï¾ ï¾ ï¾ Go behind the scenes with today's most sophisticated websites, applications, and services·ï¾ ï¾ ï¾ Protect yourself from the latest Internet dangers, including phishing, web surveillance, and wireless hackingï¾ Preston Gralla is the award-winning author of more than 30 books, including How the Internet Works, Complete Idiot's Guide to Internet Privacy and Security, Complete Idiot's Guide to Protecting Your Child Online, and How Wireless Works. He has writtenfrequently about security issues, computer technology, the Internet, and has been a columnist for many magazines, websitesand newspapers.
Microsoft SQL Server(TM) 2005 Reporting Services Step by Step (Step by Step (Microsoft))
Authors: Stacia Misner
Venue:  (2006)

Your hands-on, practical guide to Microsoft® SQL Server™ 2005 Reporting Services. Get started using Business Intelligence tools that simplify data analysis and reporting with this popular, learn-by-doing tutorial. Includes a companion CD.
Phylogenetic trees in ACL2
Authors: Warren A. Hunt,  Jr., Serita M. Nelesen
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve the production and analysis of phylogenetic trees. We present our system for phylogenetic tree manipulation, TASPI, which was designed to allow the specification and verification of various tree operations, while giving good execution performance. The first aspect of TASPI is a new format for storing and manipulating phylogenetic trees that significantly reduces storage requirements while continuing to allow the trees to be used as input to post-tree analysis. We also prove the correspondence of this format to another tree format. In addition, we give a consensus algorithm with verified guards that is faster by an order of magnitude than standard phylogenetic analysis tools.
A static aspect language for checking design rules
Authors: Clint Morgan, Kris De Volder, Eric Wohlstadter
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain classes of errors.Design rules often crosscut program structure and enforcing them is emerging as an important application domain for Aspect Oriented Programming. For many interesting design rules, current general purpose AOP languages lack the expressiveness to characterize them statically and enforce them at compile time.We have developed a domain specific language called Program Description Logic (PDL). PDL allows succinct declarative definitions of programmatic structures which correspond to design rule violations. PDL is based on a fully static and expressive pointcut language. PDL pointcuts allow characterizing a wide range of design rules without sacrificing static verification.We evaluate PDL by comparing it to FxCop, an industrial strength tool for checking design rules.
Adobe Acrobat 7 Tips and Tricks: The 150 Best
Authors: Donna L. Baker
Venue:  (2005)

Sure, you know how to read PDFs with it, but do you know how to add comments to documents or embed 3D objects in your PDFs or establish document-level security settings? With its staggering array of document-enhancing features and supported formats, Adobe Acrobat 7 offers a world of functionality just waiting to be tapped--which means that figuring out how to do just one specific task with it can be somewhat daunting. In these pages, veteran author Donna Baker solves that problem by presenting each Acrobat task as a stand-alone unit. If, for example, you want to find out how to search for a word or a phrase in a PDF file, you can do just that--at the same time picking up a couple of tips about refining your searches. Organized in three major sections--Input, Output, and Internal Acrobat Processes--this self-contained guide is all you need to get going fast with Acrobat 7. ï¾
Solaris to Linux Migration: A Guide for System Administrators
Authors: Chuck Davis, William Dy, Mark Brown
Venue:  (2006)

The goal of this IBM Redbook is to provide a technical reference for IT systems administrators in organizations that are considering a migration from Solaris to Linux-based systems. We present a systems administrator view of the technical differences and methods necessary to complete a successful migration to Linux-based systems, including coverage of how those differences translate to two major Linux distributions: Red Hat Enterprise Linux and SUSE Linux Enterprise Server. The book is designed primarily to be a reference work for the experienced Solaris 8 or 9 system administrator who will need to begin working with Linux. It should serve as a guide for system administrators that need a concise technical reference for facilitating the transition to Linux. The book also provides details about how to leverage the additional industry-leading technologies in IBM eServer xSeries servers, IBM POWER technology-based systems (iSeries/pSeries), and IBM eServer zSeries systems that make them very powerful and flexible platforms for hosting Linux-based solutions.