ppxscal/embedding_network huggingface dataset:
Digital image watermarking capacity and detection error rate
Authors: Fan Zhang, Xinhong Zhang, Hongbin Zhang
Venue: Pattern Recognition Letters (2007)

An adaptive watermarking capacity analysis in the spatial domain and wavelet domain is proposed. The relationship between the watermarking capacity and the watermark detection error rate is also discussed. The research of watermark detection error rate will help us finding the ways to embed more watermark messages while keeping an acceptable detection error rate, and it is useful for the design of the general algorithms of watermarking and detection. The watermarking system is analyzed based on the channel capacity and error rate of the communication system, and the relation between the detection error rate with the capacity and payload capacity is derived. According to the experimental results, the detection error rate of watermark is mainly influenced by the watermark average energy and the watermarking capacity. The error rate rises with the increase of watermarking capacity. When the channel coding is used, the watermarking error rate drops with the decrease of the payload capacity of watermarking.
Addressing hazards in wireless sensor and actor networks
Authors: Ramanuja Vedantham, Zhenyun Zhuang, Raghupathy Sivakumar
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2006)

In wireless sensor and actor networks (WSANs), sensors monitor the environment based on which the sink issues commands to actors to act on the environment. In order to provide tight coupling between sensing and acting, an effective coordination mechanism is required among sensors and actors. In this context, we identify the problem of "hazards", which is the out-of-order execution of commands and queries due to lack of coordination between sensors and actors. We identify three hazards and show with an example application, the undesirable consequences of these hazards. We also outline the basic design needed to address this problem efficiently.
SVD-matching using SIFT features
Authors: Elisabetta Delponte, Francesco Isgrò, Francesca Odone, Alessandro Verri
Venue: Graphical Models (2006)

The paper tackles the problem of feature points matching between pair of images of the same scene. This is a key problem in computer vision. The method we discuss here is a version of the SVD-matching proposed by Scott and Longuet-Higgins and later modified by Pilu, that we elaborate in order to cope with large scale variations. To this end we add to the feature detection phase a keypoint descriptor that is robust to large scale and view-point changes. Furthermore, we include this descriptor in the equations of the proximity matrix that is central to the SVD-matching. At the same time we remove from the proximity matrix all the information about the point locations in the image, that is the source of mismatches when the amount of scene variation increases. The main contribution of this work is in showing that this compact and easy algorithm can be used for severe scene variations. We present experimental evidence of the improved performance with respect to the previous versions of the algorithm.
Euler operators for stratified objects with incomplete boundaries
Authors: Abel J. P. Gomes
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Stratified objects such as those found in geometry-based systems (e.g. CAD systems and animation systems) can be stepwise constructed and manipulated through Euler operators. The operators proposed in this paper extend prior operators (e.g. the Euler-Masuda operators) provided that they can process n-dimensional stratified subanalytic objects with incomplete boundaries. The subanalytic objects form the biggest closed family of geometric objects defined by analytic functions. Basically, such operators are attachment, detachment, subdivision, and coaslescence operations without a prescribed order, providing the user with significant freedom in the design and programming of geometric applications.
A constrained optimization algorithm for total energy minimization in electronic structure calculations
Authors: Chao Yang, Juan C. Meza, Lin-Wang Wang
Venue: Journal of Computational Physics (2006)

A new direct constrained optimization algorithm for minimizing the Kohn-Sham (KS) total energy functional is presented in this paper. The key ingredients of this algorithm involve projecting the total energy functional into a sequence of subspaces of small dimensions and seeking the minimizer of total energy functional within each subspace. The minimizer of a subspace energy functional not only provides a search direction along which the KS total energy functional decreases but also gives an optimal "step-length" to move along this search direction. Numerical examples are provided to demonstrate that this new direct constrained optimization algorithm can be more efficient than the self-consistent field (SCF) iteration.
iPod & iTunes Hacks
Authors: Hadley Stern
Venue:  (2004)

Some people are content to use their iPod simply to play music. Some people want to do much more. Those people, and you know who you are,aren't satisfied until they get under the hood and tap every iPod trick available to them. They want to explore and experiment, create shortcuts, and unearth cool and unexpected things to do with their iPod that have never even occurred to their friends. Maybe they want to use their iPod to read email. Maybe they want to use it as a voice recorder, or a device to store their digital photos. Maybe they want to use iTunes visuals as a screensaver, use Java to expand iTunes functionally, or use a cheap Linux box as a server and access MP3 tunes. Or, maybe they just want to paint their iPod a custom color. For those people who want to get more much more out of their iPod iPod and iTunes Hacks is brimming with undocumented tips, tricks, and trade secrets for getting the very most from your iPod. This guide takes curious and clever iPod owners beyond the obvious with 100 ingenious hacks that will delight, entertain, and add astonishing power to the iPod and iTunes experience. 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
The I-Series MS Windows XP Complete, 1 edition
Authors: Stephen Haag, James T Perry, Barrie Sosinsky, Efren Estevez, James Perry
Venue:  (2002)

The I-Series Applications textbooks strongly emphasize that Students learn and master applications skills by being actively engaged- by doing. These texts have been written with clear, error-free, and unambiguous steps to accomplish tasks that lead to a finished document, worksheet or database table. The authors made the decision that teaching “how” to accomplish some task is not enough for complete understanding and mastery. Prior to introducing steps, the authors discuss why the steps students are about to experience are important and what role the steps play in the overall plan for creating a document, workbook or database. Table of contentsChapter 1: Windows XP Professional BasicsChapter 2: Word Processing and Basic File ManagementChapter 3: Customizing Your Work EnvironmentChapter 4: Managing Disks and StorageChapter 5: Printer ManagementChapter 6: MultimediaChapter 7: Exploring the InternetChapter 8: Network ServicesChapter 9: SecurityChapter 10: Inter-Application CommunicationChapter 11: Troubleshooting and System MaintenanceChapter 12: Installing and Updating Windows XP Professional
MCSE 70-293 Exam Cram: Planning and Maintaining a Windows Server 2003 Network Infrastructure (2nd Edition) (Exam Cram)
Authors: Diana Huggins, Jason Zandri
Venue:  (2006)

MCSA/MCSE 70-293 Exam Cram, Second Edition is the perfect study guide if you needï¾ help passing the 70-293 exam. Among exam objectives, you must learn to use remote desktop for administration, manage IIS 6.0, revive a failed server, choose between forest and domain functional levels, and configure software update services. This new edition covers all these topics, includes two full practice exams, and has been updated against Microsoft's official courseware (MOC) that corresponds to this exam.MCSA/MCSE 70-293 Exam Cram, Second Editionï¾ is perfect for you if you need a refresher on important concepts as well as a guide to exam topics and objectives. You'll get test-taking strategies, time-saving study tips, a CD-ROM testing engine, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else.
Simulation-based routing protocol performance analysis: a case study
Authors: Talal M. Jaafar, George F. Riley, Dheeraj Reddy, Dana Blair
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In this paper we evaluate the Enhanced Interior Gateway Routing Protocol (EIGRP) via packet simulations. EIGRP, an intra-domain routing protocol developed by Cisco, is mainly based on the Diffusing Update Algorithm (DUAL) which computes shortest paths distributedly without creating routing-table loops or incurring counting-to-infinity problem. Previous studies showed EIGRP's ability to adapt quickly to routing changes in medium-scale networks. In our research, we developed a detailed simulation model of EIGRP (publicly available), and we used it to evaluate EIGRP performance under a very dynamic network. Our results showed that EIGRP converges faster than a single TCP timeout in most cases. The simulated network was a composite of wired and wireless hosts, and the results hold for both types of media. In addition, the study showed a feasible approach for seamless mobility and continuous connectivity for users of mobile wireless devices as they move within an Autonomous System (AS).
Graph evolution: Densification and shrinking diameters
Authors: Jure Leskovec, Jon Kleinberg, Christos Faloutsos
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2007)

How do real graphs evolve over time&quest; What are normal growth patterns in social, technological, and information networks&quest; Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network or in a very small number of snapshots; these include heavy tails for in- and out-degree distributions, communities, small-world phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time. Here we study a wide range of real graphs, and we observe some surprising phenomena. First, most of these graphs densify over time with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time in contrast to the conventional wisdom that such distance parameters should increase slowly as a function of the number of nodes (like O(log n) or O(log(log n)). Existing graph generation models do not exhibit these types of behavior even at a qualitative level. We provide a new graph generator, based on a forest fire spreading process that has a simple, intuitive justification, requires very few parameters (like the flammability of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. We also notice that the forest fire model exhibits a sharp transition between sparse graphs and graphs that are densifying. Graphs with decreasing distance between the nodes are generated around this transition point. Last, we analyze the connection between the temporal evolution of the degree distribution and densification of a graph. We find that the two are fundamentally related. We also observe that real networks exhibit this type of relation between densification and the degree distribution.
Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
Authors: M. Lozano, J. M. Sotoca, J. S. Sánchez, F. Pla, E. Pkalska, R. P. W. Duin
Venue: Pattern Recognition (2006)

Prototype-based classification relies on the distances between the examples to be classified and carefully chosen prototypes. A small set of prototypes is of interest to keep the computational complexity low, while maintaining high classification accuracy. An experimental study of some old and new prototype optimisation techniques is presented, in which the prototypes are either selected or generated from the given data. These condensing techniques are evaluated on real data, represented in vector spaces, by comparing their resulting reduction rates and classification performance. Usually the determination of prototypes is studied in relation with the nearest neighbour rule. We will show that the use of more general dissimilarity-based classifiers can be more beneficial. An important point in our study is that the adaptive condensing schemes here discussed allow the user to choose the number of prototypes freely according to the needs. If such techniques are combined with linear dissimilarity-based classifiers, they provide the best trade-off of small condensed sets and high classification accuracy.
Apple Pro Training Series: DVD Studio Pro 4 (Apple Pro Training)
Authors: Martin Sitter, Adrian Ramseier
Venue:  (2005)

Now the best-selling book on DVD Studio Pro is even better. Fully updated for DVD Studio Pro 4 and with complete coverage of the new version of Compressor, the industrial-strength encoder that dramatically speeds up encoding of MPEG-2 and H.264 HD DVD video, this self-paced guide is the fastest way to learn to author professional, interactive DVDs. Master trainers Martin Sitter and Adrian Ramseier begin with the basics of DVD authoring and take you all the way through DVD Studio Pro's powerful advanced features. Each chapter presents a complete lesson on an aspect of DVD creation, with hands-on projects for you to complete as you go. All the files are included on the accompanying DVD. After learning how to storyboard a DVD and plan its interactions, you'll set chapter markers, build still, layered, and motion menus, and add subtitles and Web links. You'll also learn sophisticated techniques for juggling multiple audio tracks and camera angles, creating custom transitions, building advanced overlays, and scripting. By the end of the book, you'll have created four full DVDs. The Apple Pro Training Series is both a self-paced learning tool and the official curriculum of the Apple Pro Training and Certification Program. Upon completing the course material in this book, you can become a certified Apple Pro b taking the certification exam at an Apple Authorized Training Center. To find an Authorized Training Center near you, go to www.apple.com/software/pro/training.
The Macintosh iLife 06
Authors: Jim Heid
Venue:  (2006)

The definitive iLife reference, completely updated and revised. The Macintosh iLife '06 is the ultimate iLife learning experience, a lavishly illustrated handbook packed with easy-to-follow instructions, essential technical background, and tips for iLife users of all levels. · Shop 'til you drop at the iTunes Music Store · Take your iPod beyond music-watch videos, view photos, store contacts and calendars, and more · Improve your photography and video-shooting techniques · Create spectacular slide shows, photo books, calendars, and greeting cards · Refine your photos to perfection with iPhoto 6 · Share photos via email, Web albums, and cutting-edge photocasts · Explore the latest video formats with iMovie HD · Record and arrange your own music with GarageBand · Create and publish your own Web sites, blogs, and podcasts · Preserve the past: digitize old records, photos, and movies Each two-page spread is a self-contained tutorial or set of tips. Everything you need is at your fingertips, and every page is updated for iLife '06. The Web site: Get updates, tips, and much more at this book's companion Web site, www.macilife.com. Jim Heid is one of the most admired writers and instructors in the Mac community. A contributing editor of Macworld magazine since 1984, he has been using and teaching each of the programs in the iLife suite since its debut.
Matching users' diverse social scripts with resonating humanized features to create a polite interface
Authors: Jeng-Yi Tzeng
Venue: International Journal of Human-Computer Studies (2006)

The mental scripts that prescribe the way people interact with other people or with computers are experientially characterized and context sensitive. For this reason, CASA research should be more sensitive to the divergent nature of social scripts, through which people respond to human features on interfaces and through which they treat computers as social actors. Using politeness as an example, this study first investigated people's politeness orientations, and then their perceptions of websites containing error pages with messages featuring three different politeness strategies. Two hundred thirty-four senior high school students participated in this three (politeness orientations) by three (error messages) by two (frustration levels)-factorial experiment. Three-way ANOVAs and simple main effects analyses showed that people with different politeness orientations do respond differently to messages with different politeness strategies and different levels of associated frustration. This study shows that more research effort should be focused on whether and how the CASA phenomenon manifests itself in different computer-use situations and/or with different people.
Forward node-selecting queries over trees
Authors: Dan Olteanu
Venue: ACM Transactions on Database Systems (TODS) (2007)

Node-selecting queries over trees lie at the core of several important XML languages for the web, such as the node-selection language XPath, the query language XQuery, and the transformation language XSLT. The main syntactic constructs of such queries are the backward predicates, for example, ancestor and preceding, and the forward predicates, for example, descendant and following. Forward predicates are included in the depth-first, left-to-right preorder relation associated with the input tree, whereas backward predicates are included in the inverse of this preorder relation. This work is devoted to an expressiveness study of node-selecting queries with proven theoretical and practical applicability, especially in the field of query evaluation against XML streams. The main question it answers positively is whether, for each input query with forward and backward predicates, there exists an equivalent forward-only output query. This question is then positively answered for input and output queries of varying structural complexity, using LOGLIN and PSPACE reductions. Various existing applications based on the results of this work are reported, including query optimization and streamed evaluation.
.Mac with iWeb, Second Edition (Visual QuickStart Guide)
Authors: David Reynolds
Venue:  (2006)

Need to learn what's new in .Mac fast? Try a Visual QuickStart! This best-selling reference's visual format and step-by-step, task-based instructions will have you up and running with .Mac in no time. In this completely updated edition of our best-selling guide to .Mac leading software application expert David Reynolds uses crystal-clear instructions and friendly prose to introduce you everything that's new. Filled with step-by-step, task-based instructions and loads of visual aids, this book explains how to publish your photos, movies, podcasts and blogs on the internet with iWeb; share your photo albums in iPhoto as a photocast; access your files from anywhere with iDisk; keep all your Macs in sync with another with .Mac sync; and more! 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
MCSA/MCSE 70-294 Exam Cram: Planning, Implementing, and Maintaining a Microsoft Windows Server 2003 Active Directory Infrastructure (2nd Edition) (Exam Cram 2)
Authors: Will Willis, David Watts
Venue:  (2006)

MCSA/MCSE 70-294 Exam Cram, Second Edition is the #1-selling quick-study guide to help you pass the 70-294 exam from Microsoft, which is one of the four core exams in the MCSE 2003 and MCSA 2003 certification programs.ï¾ This new edition covers all exam objectives, including how to implement and manage an active directory service forest and domain structure, plan effective user and group administration policies, configure user environments, and troubleshoot active directory.ï¾ It alsoï¾ incorporates two full practice exams, and has been updated against Microsoft's official courseware (MOC) that corresponds to this exam, as well as changes made to Windows Server 2003 R2.ï¾ Test-taking strategies, time-saving study tips, a special Cram Sheet, tips, acronyms, and memory joggers not available anywhere else comes with this, and all, Exam Cram books.
Fast online pointer analysis
Authors: Martin Hirzel, Daniel Von Dincklage, Amer Diwan, Michael Hind
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

Pointer analysis benefits many useful clients, such as compiler optimizations and bug finding tools. Unfortunately, common programming language features such as dynamic loading, reflection, and foreign language interfaces, make pointer analysis difficult. This article describes how to deal with these features by performing pointer analysis online during program execution. For example, dynamic loading may load code that is not available for analysis before the program starts. Only an online analysis can analyze such code, and thus support clients that optimize or find bugs in it. This article identifies all problems in performing Andersen's pointer analysis for the full Java language, presents solutions to these problems, and uses a full implementation of the solutions in a Java virtual machine for validation and performance evaluation. Our analysis is fast: On average over our benchmark suite, if the analysis recomputes points-to results upon each program change, most analysis pauses take under 0.1 seconds, and add up to 64.5 seconds.
Soundness of the simply typed lambda calculus in ACL2
Authors: Sol Swords, William R. Cook
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and efficiently reason about complex recursively-defined expressions, define arbitrary induction schemes including mutual inductions over several objects and inductions over derivations, and reason about variable bindings with minimal overhead. We introduce a method for performing these proofs in ACL2, including a macro which automates the process of defining functions and theorems to facilitate reasoning about recursive data types. To illustrate this method, we present a proof in ACL2 of the soundness of the simply typed &lambda;-calculus.