ppxscal/embedding_network huggingface dataset:
Apple Pro Training Series: Shake 3
Authors: Marco Paolini
Venue:  (2003)

Talk about making an impact: Appleï¾¿s Shake compositing and visual effects software has been used in every Academy Award-winning film for visual effects since its debut. Itï¾¿s no wonder then that trained Shake artists are in high demandï¾¿and thereï¾¿s nowhere better to begin getting that training than with this comprehensive Apple-approved guide (which includes a free 30-day trial version of the $4,000-plus software).Using step-by-step, hands-on instruction, Hollywood effects wizard Marco Paolini takes you through Shakeï¾¿s interface and features, including its color correction tools, tracking and stabilization capabilities, integrated procedural paint and rotoscoping tools, and more. As with the other titles in the Apple Pro Training Series, each chapter in this Apple-authorized guide represents a complete lessonï¾¿with a project to complete, a review section, and bonus exercises to reinforce the lessons. The accompanying DVD includes all of the lesson files needed to complete the bookï¾¿s projects. You can work through the book from cover to cover to get an entire course or you can go straight to the lessons that interest you most. Either way, youï¾¿ll find the coverage you need to confront even the most daunting compositing and effects tasks with Shake. 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
VLSI implementation of an energy-aware wake-up detector for an acoustic surveillance sensor network
Authors: David H. Goldberg, Andreas G. Andreou, Pedro Julián, Philippe O. Pouliquen, Laurence Riddle, Rich Rosasco
Venue: ACM Transactions on Sensor Networks (TOSN) (2006)

We present a low-power VLSI wake-up detector for a sensor network that uses acoustic signals to localize ground-based vehicles. The detection criterion is the degree of low-frequency periodicity in the acoustic signal, and the periodicity is computed from the &ldquo;bumpiness&rdquo; of the autocorrelation of a one-bit version of the signal. We then describe a CMOS ASIC that implements the periodicity estimation algorithm. The ASIC is fully functional and its core consumes 835 nanowatts. It was integrated into an acoustic enclosure and deployed in field tests with synthesized sounds and ground-based vehicles.
Debugging user
Authors: Glenna James
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

That systems and programs are debugged (often) no one will quibble with. But what about our user manuals? Though we write with the pens of men, angels and miricle minis and produce not clarity, we are damned. How are we to know when we haven't been "perfectly clear"? 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
Nonuniform sampling for global optimization of kinetic rate constants in biological pathways
Authors: Steven H. Kleinstein, Dean Bottino, Anna Georgieva, Ramesh Sarangapani, G. Scott Lett
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Global optimization has proven to be a powerful tool for solving parameter estimation problems in biological applications, such as the estimation of kinetic rate constants in pathway models. These optimization algorithms sometimes suffer from slow convergence, stagnation or misconvergence to a non-optimal local minimum. Here we show that a nonuniform sampling method (implemented by running the optimization in a transformed space) can improve convergence and robustness for evolutionary-type algorithms, specifically Differential Evolution and Evolutionary Strategies. Results are shown from two case studies exemplifying the common problems of stagnation and misconvergence.
Rapid and brief communication: Efficient edge-based object tracking
Authors: Guopu Zhu, Qingshuang Zeng, Changhong Wang
Venue: Pattern Recognition (2006)

Object tracking has been widely applied to video surveillance, robot localization and human-computer interaction. In this paper, an edge-based tracking algorithm is proposed. We extract the feature points by efficiently utilizing the image edges in the object region. Then the parameter vector of the object's motion model is estimated based on minimizing the sum-of-squared differences between the reference feature points in the reference frame and the observed feature points in the tracking sequence frame. The experiments show that the edge-based tracking algorithm proposed by us can track object efficiently under uniform and varying illumination conditions.
An efficient image authentication method based on Hamming code
Authors: Chi-Shiang Chan, Chin-Chen Chang
Venue: Pattern Recognition (2007)

Image authentication has come through a history of several years. However, up to the present time, most mainstream image authentication schemes are still unable to detect burst bit errors. Moreover, the capability of recovering tampered pixels in detail (complex) areas has not been very satisfactory either. In this paper, we offer to combine the Hamming code technique, Torus automorphism and bit rotation technique to do tamper proofing. According to our experimental results, our new hybrid method can effectively eliminate burst bit errors, and our recovered pixels in detail areas can actually gain very high clarity. The results show that our scheme is quite a practical method, which is quite able to detect and recover tampered areas.
Optimistic-conservative synchronization in distributed factory simulation
Authors: Sheng Xu, Leon F. McGinnis
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Distributed simulation is attractive for modeling complicated manufacturing systems having many tools and products, such as a semiconductor wafer fabrication line. However, conservative synchronization approaches can introduce excessive overhead in execution, and result in little parallelism, which can eliminate the speedup promised by distributed simulation. Our experiences in building a distributed simulation model for 300mm wafer fab using the High Level Architecture (HLA) shows that using model specific information in a novel adaptation of conservative synchronization can achieve very significant reduction in model execution time. This paper defines the time-chop problem for which this adaptation is effective, and formally develops our optimistic-conservative synchronization scheme.
cJ: enhancing java with safe type conditions
Authors: Shan Shan Huang, David Zook, Yannis Smaragdakis
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

cJ is an extension of Java that allows supertypes, fields, and methods of a class or interface to be provided only under some static subtyping condition. For instance, a cJ generic class, C<P>, may provide a member method m only when the type provided for parameter P is a subtype of a specific type Q.From a practical standpoint, cJ adds to generic Java classes and interfaces the ability to express case-specific code. Unlike conditional compilation techniques (e.g., the C/C++ "#ifdef" construct) cJ is statically type safe and maintains the modular type-checking properties of Java generic classes: a cJ generic class can be checked independently of the code that uses it. Just like regular Java, checking a cJ class implies that all uses are safe, under the contract for type parameters specified in the class's signature.As a specific application, cJ addresses the well-known shortcomings of the Java Collections Framework (JCF). JCF data structures often throw run-time errors when an "optional" method is called upon an object that does not support it. Within the constraints of standard Java, the authors of the JCF had to either sacrifice static type safety or suffer a combinatorial explosion of the number of types involved. cJ avoids both problems, maintaining both static safety and conciseness.
ppk on JavaScript, 1/e (VOICES)
Authors: Peter-Paul Koch
Venue:  (2006)

Whether you're an old-school scripter who needs to modernize your JavaScripting skills or a standards-aware Web developer who needs best practices and code examples, you'll welcome this guide from a JavaScript master.Other JavaScript books use example scripts that have little bearing on real-world Web development and are useful only in the chapter at hand. In contrast, Peter-Paul Koch's book uses eight real-world scripts he created for real-world clients in order to earn real-world money. That means the scripts are guaranteed to do something useful (and sellable!) that enhances the usability of the page they're used on.The book's example scripts include one that sorts a data table according to the user's search queries, a form validation script, a script that shows form fields only when the user needs them, a drop-down menu, and a data retrieval script that uses simple Ajax and shows the data in an animation.After an overview of JavaScript's purpose, Peter-Paul provides theoretical chapters on the context (jobs for JavaScript, CSS vs. JavaScript), the browsers (debugging, the arcana of the browser string), and script preparation. Then follow practical chapters on Core, BOM, Events, DOM, CSS Modification, and Data Retrieval, all of which are explained through a combination of theoretical instruction and the taking apart of the relevant sections of the example scripts. 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
Twisted Network Programming Essentials
Authors: Abe Fettig
Venue:  (2005)

Twisted Network Programming Essentials from O'Reilly is a task-oriented look at this new open source, Python-based technology. The book begins with recommendations for various plug-ins and add-ons to enhance the basic package as installed. It then details Twisted's collection simple network protocols, and helper utilities. The book also includes projects that let you try out the Twisted framework for yourself. For example, you'll find examples of using Twisted to build web services applications using the REST architecture, using XML-RPC, and using SOAP. Written for developers who want to start building applications using Twisted, this comprehensive guide presents examples of the most common tasks you'll face when building network applications. It also helps you understand the key concepts and design patterns used in Twisted applications. Here are just some of the topics discussed in Twisted Network Programming Essentials: Installing Twisted How to make TCP connections How to use Twisted to work with the Web Twisted's authentication framework Usenet and SSH clients and servers Along the way, each lesson is supported by thorough notes and explanations to make absolutely certain you're up to speed with this leading-edge Python technology.
Abcs of Z/Os System Programming
Venue:  (2006)

The ABCs of z/OS System Programming is an 11-volume collection that provides an introduction to the z/OS operating system and the hardware architecture. Whether you are a beginner or an experienced system programmer, the ABCs collection provides the information that you need to start your research into z/OS and related subjects. If you would like to become more familiar with z/OS in your current environment, or if you are evaluating platforms to consolidate your e-business applications, the ABCs collection will serve as a powerful technical tool. This IBM Redbook describes the functions of the Infoprint® Server. It will help you install, tailor, configure, and use the z/OS Version 1 Release 7 version of Infoprint Server. Topics covered in this volume are the following: Chapter 1. Infoprint Server Chapter 2. UNIX® System Services overview Chapter 3. Infoprint Server customization Chapter 4. Print Interface Chapter 5. IP PrintWay™ Chapter 6. NetSpool™ Chapter 7. Infoprint Central Chapter 8. User interfaces to Infoprint Server The contents of the volumes are as follows: Volume 1: Introduction to z/OS and storage concepts, TSO/E, ISPF, JCL, SDSF, and z/OS delivery and installation Volume 2: z/OS implementation and daily maintenance, defining subsystems, JES2 and JES3, LPA, LNKLST, authorized libraries, SMP/E, Language Environment Volume 3: Introduction to DFSMS, data set basics storage management hardware and software, catalogs, and DFSMStvs Volume 4: Communication Server, TCP/IP, and VTAM Volume 5: Base and Parallel Sysplex, System Logger, Resource Recovery Services (RRS), global resource serialization (GRS), z/OS system operations, automatic restart management (ARM), Geographically Dispersed Parallel Sysplex (GDPS) Volume 6: Introduction to security, RACF, Digital certificates and PKI, Kerberos, cryptography, zSeries firewall technologies, LDAP, and Enterprise identity mapping (EIM) Volume 7: Printing in a z/OS environment, Infoprint Server and Infoprint Central Volume 8: An introduction to z/OS problem diagnosis Volume 9: z/OS UNIX System Services Volume 10: Introduction to z/Architecture, zSeries processor design, zSeries connectivity, LPAR concepts, HCD, and HMC Volume 11: Capacity planning, performance management, WLM, RMF, and SMF 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
Efficient and Tailored Resource Management for the P2P Web Caching
Authors: Kyungbaek Kim, Daeyeon Park
Venue: IEICE - Transactions on Information and Systems (2007)

While web proxy caching is a widely deployed technique, the performance of a proxy cache is limited by the local storage. Some studies have addressed this limitation by using the residual resources of clients via a p2p method and have achieved a very high hit rate. However, these approaches treat web objects as homogeneous objects and there is no consideration of various web characteristics. Consequently, the byte hit rate of the system is limited, external bandwidth is wasted, and perceived user latency is increased. The present paper suggests an efficient p2p based web caching technique that manages objects with different policies so as to exploit the characteristics of web objects, such as size and temporal locality. Small objects are stored alone whereas large objects are stored by dividing them into numerous small blocks, which are distributed in clients. On a proxy cache, header blocks of large objects take the place of objects themselves and smaller objects are cached. This technique increases the hit rate. Unlike a web cache, which evicts large objects as soon as possible in the case where clients fulfill the role of backup storage, large objects are given higher priority than small objects in the proposed approach. This maximizes the effect of hits for large objects and thereby increases the byte hit rate. Furthermore, we construct simple latency models for various p2p based web caching systems and analyze the effects of the proposed policies on these systems. We then examine the performances of the efficient policies via a trace driven simulation. The results demonstrate that the proposed techniques effectively enhance web cache performance, including hit rate, byte hit rate, and response time.
g-Elements, finite buildings and higher Cohen-Macaulay connectivity
Authors: Ed Swartz
Venue: Journal of Combinatorial Theory Series A (2006)

Chari proved that if Δ is a (d - 1)-dimensional simplicial complex with a convex ear decomposition, then h0 ≤ ... ≤ h⌊d/2⌋ [M.K. Chari, Two decompositions in topological combinatorics with applications to matroid complexes, Trans. Amer. Math. Soc. 349 (1997) 3925-3943]. Nyman and Swartz raised the problem of whether or not the corresponding g-vector is an M-vector [K. Nyman, E. Swartz, Inequalities for h- and flag h-vectors of geometric lattices, Discrete Comput. Geom. 32 (2004) 533-548]. This is proved to be true by showing that the set of pairs (ω, Θ), where Θ is a l.s.o.p. for k[Δ], the face ring of Δ, and ω is a g-element for k[Δ]/Θ, is nonempty whenever the characteristic of k is zero.Finite buildings have a convex ear decomposition. These decompositions point to inequalities on the flag h-vector of such spaces similar in spirit to those examined in [K. Nyman, E. Swartz, Inequalities for h- and flag h-vectors of geometric lattices, Discrete Comput. Geom. 32 (2004) 533-548] for order complexes of geometric lattices. This also leads to connections between higher Cohen-Macaulay connectivity and conditions which insure that h0 < ... < hi for a predetermined i.
Novell's ZENworks for Servers 3 Administrator's Handbook
Authors: Brad Dayley
Venue:  (2003)

Novell ZENworks for Servers (ZENworks stands for Zero Effort Networking) is the cross-platform solution for server content and configuration management. It provides server consistency across Windows, Linux, Solaris and NetWare platforms, enables intelligent network automation, and increases management efficiency so everything works together as on Net. As a result, organizations get a stable server environment and significantly reduce networking costs.Novellï¾¿s ZENworks for Server 3 Administratorï¾¿s Handbook guides the reader through the potential rough spots. It explains how ZENworks for Server 3 functions and affects NetWare, Windows, Linux and/or Solaris networks.
Experimental study for the comparison of classifier combination methods
Authors: S. Y. Sohn, H. W. Shin
Venue: Pattern Recognition (2007)

In this paper, we compare the performances of classifier combination methods (bagging, modified random subspace method, classifier selection, parametric fusion) to logistic regression in consideration of various characteristics of input data. Four factors used to simulate the logistic model are: (a) combination function among input variables, (b) correlation between input variables, (c) variance of observation, and (d) training data set size. In view of typically unknown combination function among input variables, we use a Taguchi design to improve the practicality of our study results by letting it as an uncontrollable factor. Our experimental study results indicate the following: when training set size is large, performances of logistic regression and bagging are not significantly different. However, when training set size is small, the performance of logistic regression is worse than bagging. When training data set size is small and correlation is strong, both modified random subspace method and bagging perform better than the other three methods. When correlation is weak and variance is small, both parametric fusion and classifier selection algorithm appear to be the worst at our disappointment.
Illinois Bell Telephone: payroll/personnel system function requirements standard
Authors: Herbert W. Wolf
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1975)

I am currently involved in developing and programming a new Payroll/Personnel System for Illinois Bell Telephone. I would be interested in comments from the members of SICDOC about the following EDP Function Requirements Standard. 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
Oriented strands: dynamics of stiff multi-body system
Authors: Sunil Hadap
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

The simulation of strand like primitives modeled as dynamics of serial branched multi-body chain, albeit a potential reduced coordinate formulation, gives rise to stiff and highly non-linear differential equations. We introduce a recursive, linear time and fully implicit method to solve the stiff dynamical problem arising from such a multi-body system. We augment the merits of the proposed scheme by means of analytical constraints and an elaborate collision response model. We finally discuss a versatile simulation system based on the strand primitive for character dynamics and visual effects. We demonstrate dynamics of ears, braid, long/curly hair and foliage.
Pattern classification by concurrently determined piecewise linear and convex discriminant functions
Authors: Hong Seo Ryoo
Venue: Computers and Industrial Engineering (2006)

This paper develops a new methodology for pattern classification by concurrently determined k piecewise linear and convex discriminant functions. Toward the end, we design a new l1-norm distance metric for measuring misclassification errors and use it to develop a mixed 0-1 integer and linear program (MILP) for the k piecewise linear and convex separation of data. The proposed model is meritorious in that it considers the synergy as well as the individual role of the k hyperplanes in constructing a decision surface and exploits the advances in theory and algorithms and the advent of powerful softwares for MILP for its solution. With artificially created data, we illustrate pros and cons of pattern classification by the proposed methodology. With six benchmark classification datasets, we demonstrate that the proposed approach is effective and competitive with well-established learning methods. In summary, the classifiers constructed by the proposed approach obtain the best prediction rates on three of the six datasets and the second best records for two of the remaining three datasets.
Shortest circuits with given homotopy in a constellation
Authors: Dominique Michelucci, Marc Neveu
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

A polynomial method is described for computing the shortest circuit with a prescribed homotopy on a surface. The surface is not described by a mesh but by a constellation: a set of sampling points. Points close enough (their distance is less than a prescribed threshold) are linked with an edge: the induced graph is not a triangulation but still permits to compute homologic and homotopic properties. Advantages of constellations over meshes are their simplicity and robustness.
Handwritten Bangla numeral recognition system and its application to postal automation
Authors: Ying Wen, Yue Lu, Pengfei Shi
Venue: Pattern Recognition (2007)

A recognition system for handwritten Bangla numerals and its application to automatic letter sorting machine for Bangladesh Post is presented. The system consists of preprocessing, feature extraction, recognition and integration. Based on the theories of principal component analysis (PCA), two novel approaches are proposed for recognizing handwritten Bangla numerals. One is the image reconstruction recognition approach, and the other is the direction feature extraction approach combined with PCA and SVM. By examining the handwritten Bangla numeral data captured from real Bangladesh letters, the experimental results show that our proposed approaches are effective. To meet performance requirements of automatic letter sorting machine, we integrate the results of the two proposed approaches with one conventional PCA approach. It has been found that the recognition result achieved by the integrated system is more reliable than that by one method alone. The average recognition rate, error rate and reliability achieved by the integrated system are 95.05%, 0.93% and 99.03%, respectively. Experiments demonstrate that the integrated system also meets speed requirement.
Nordsieck representation of two-step Runge-Kutta methods for ordinary differential equations
Authors: Z. Bartoszewski, Z. Jackiewicz
Venue: Applied Numerical Mathematics (2005)

We describe a new representation of explicit two-step Runge-Kutta methods for ordinary differential equations. This representation makes it possible for the accurate and reliable estimation of local discretization error and facilitates the efficient implementation of these methods in a variable stepsize environment.