ppxscal/embedding_network huggingface dataset:
Adobe Encore DVD In the Studio (O'Reilly Digital Studio)
Authors: Douglas Dixon
Venue:  (2004)

If you're looking for an easy and stimulating way to master Adobe Encore DVD and fine-tune your moviemaking skills at the same time, look no further than Adobe Encore DVD: In the Studio. This full-color tutorial will help you push the limits of Adobe Encore DVD by helping you to create highly imaginative designs and projects. Designed primarily for Adobe Creative Suite developers, particularly those using Adobe Premiere and AfterEffects, as well as filmmakers who wish to transfer their projects to DVDs, the book combines practical learning materials and project-based lessons. But Adobe Encore DVD: In the Studio is not your average tutorial. The book draws on the experience of author Doug Dixon--an expert on Adobe Encore DVD, the author of other books on DVD development, and a core member of the product's alpha and beta programs. Well-versed in both the use and design of Adobe Encore DVD, Dixon imbues this O'Reilly Media digital book with the unique perspective of an insider who really knows his pixels. Adobe Encore DVD: In the Studio discusses the protocols involved with DVD files and file systems; pixel aspect ratio issues; common gotchas using both still and motion media; and a plethora of tips and tricks to using dynamic buttons. You'll get up to speed on importing from Photoshop and AfterEffects, making motion video menus available, and looping video and audio. You'll also learn about adding multilingual menus and subtitles, encoding rules, scripting, and even placing Easter eggs in a DVD! By studying this comprehensive, hands-on tutorial, you will be able to quickly and efficiently develop professional-looking DVDs studded with special effects worthy of a Hollywood studio.
A MATLAB-Based Code Generator for Parallel Sparse Matrix Computations Utilizing PSBLAS
Authors: Taiji Sasaoka, Hideyuki Kawabata, Toshiaki Kitamura
Venue: IEICE - Transactions on Information and Systems (2007)

Parallel programs for distributed memory machines are not easy to create and maintain, especially when they involve sparse matrix computations. In this paper, we propose a program translation system for generating parallel sparse matrix computation codes utilizing PSBLAS. The purpose of the development of the system is to offer the user a convenient way to construct parallel sparse code based on PSBLAS. The system is build up on the idea of bridging the gap between the easy-to-read program representations and highly-tuned parallel executables based on existing parallel sparse matrix computation libraries. The system accepts a MATLAB program with annotations and generates subroutines for an SPMD-style parallel program which runs on distributed-memory machines. Experimental results on parallel machines show that the prototype of our system can generate fairly efficient PSBLAS codes for simple applications such as CG and Bi-CGSTAB programs.
Collaborative design: Managing task interdependencies and multiple perspectives
Authors: Françoise Détienne
Venue: Interacting with Computers (2006)

This paper focuses on two characteristics of collaborative design with respect to cooperative work: the importance of work interdependencies linked to the nature of design problems; and the fundamental function of design cooperative work arrangement, which is the confrontation and combination of perspectives. These two intrinsic characteristics of the design work stress specific cooperative processes: coordination processes in order to manage task interdependencies, establishment of common ground and negotiation mechanisms in order to manage the integration of multiple perspectives in design.
A robust eye detection method using combined binary edge and intensity information
Authors: Jiatao Song, Zheru Chi, Jilin Liu
Venue: Pattern Recognition (2006)

In this paper, a new eye detection method is presented. The method consists of three steps: (1) extraction of binary edge images (BEIs) from the grayscale face image based on multi-resolution wavelet transform, (2) extraction of eye regions and segments from BEIs and (3) eye localization based on light dots and intensity information. In the paper, an improved face region extraction algorithm and a light dots detection algorithm are proposed for better eye detection performance. Also a multi-level eye detection scheme is adopted. Experimental results show that a correct eye detection rate of 98.7% can be achieved on 150 Bern images with variations in views and gaze directions and 96.6% can be achieved on 564 AR images with different facial expressions and lighting conditions.
Hands-On Oracle Database 10g Express Edition for Linux, 1 edition
Authors: Steve Bobrowski
Venue:  (2006)

The fastest way to get up and running on Oracle Database XETake full advantage of all the powerful features available in Oracle Database 10g Express Edition with help from this easy-to-follow Oracle Press guide. Hands-On Oracle Database 10g Express Edition for Linux shows you, step by step, how to set up, administer, tune, troubleshoot, and secure a robust database system. You will also learn to use PL/SQL and Oracle Application Express to build custom database applications. Get started today with the Oracle database that's free to develop, deploy, and distribute.Table of contentsPart I: Getting StartedChapter 1: Introduction to Databases and OracleChapter 2: Install and Start Using Oracle Database 10g Express EditionPart II: Fundamentals of Application DevelopmentChapter 3: Access Database Data with SQLChapter 4: Code Database Access Programs with PL/SQLChapter 5: Build a Basic Relational SchemaChapter 6: Build an Application with Oracle Application ExpressPart III: Database AdministrationChapter 7: Secure Database AccessChapter 8: Manage Database SpaceChapter 9: Protect Your Oracle XE DatabaseChapter 10: Tune Application and Database Instance PerformanceIndex 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
Microsoft .NET Compact Framework Kick Start
Authors: Erik Rubin, Ronnie Yates
Venue:  (2003)

Bridges the gap between .NET and .NET Compact Framework development. The Compact Framework brings familiar .NET development to mobile devices. This technology enables millions of Microsoft programmers to develop Windows CE applications. Written by two Microsoft Compact Framework team members.
Applying simulation in a supply chain transformation case
Authors: Hongwei Ding, Changrui Ren, Wei Wang, Jin Dong
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Supply chain transformation is an emerging service area in the market which aims at helping clients improve their operational efficiency and reduce costs. As a generic technique for the analysis of complex and dynamic systems, simulation could play an important role in this field. This paper presents a case study showing how simulation could be the key enablement for a supply chain transformation project. A methodology and tool developed by IBM China Research Lab has been applied in this joint project with a world-class supplier of home improvement tools. By applying simulation, the client is provided an insightful view about their business processes and inventory allocation strategy, which serves as the basis for the transformation implementation. Financial results show that simulation has addressed the key issues and provided the client accountable evaluation results for decision-making.
Digital factory: simulation enhancing the product and production engineering process
Authors: Wolfgang Kühn
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The digital factory concept offers an integrated approach to enhance the product and production engineering processes and simulation is a key technology within this concept. Different types of simulation, such as discrete event or 3D-motion simulation can be applied in virtual models on various planning levels and stages to improve the product and process planning on all levels. The focus and key factor is the integration of the various planning and simulation processes. In an advanced stage simulation technology can be applied in the digital factory concept to enhance the operative production planning and control as an integrated process from the top level to the factory floor control.
Geometric, variational integrators for computer animation
Authors: L. Kharevych, Weiwei Yang, Y. Tong, E. Kanso, J. E. Marsden, P. Schröder, M. Desbrun
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present a general-purpose numerical scheme for time integration of Lagrangian dynamical systems---an important computational tool at the core of most physics-based animation techniques. Several features make this particular time integrator highly desirable for computer animation: it numerically preserves important invariants, such as linear and angular momenta; the symplectic nature of the integrator also guarantees a correct energy behavior, even when dissipation and external forces are added; holonomic constraints can also be enforced quite simply; finally, our simple methodology allows for the design of high-order accurate schemes if needed. Two key properties set the method apart from earlier approaches. First, the nonlinear equations that must be solved during an update step are replaced by a minimization of a novel functional, speeding up time stepping by more than a factor of two in practice. Second, the formulation introduces additional variables that provide key flexibility in the implementation of the method. These properties are achieved using a discrete form of a general variational principle called the Pontryagin-Hamilton principle, expressing time integration in a geometric manner. We demonstrate the applicability of our integrators to the simulation of non-linear elasticity with implementation details.
Formulation of transportation problems
Authors: C. A. Haverly
Venue: Issue 11 (March 1972) (1972)

Algorithm developers commonly work in terms of equations and inequalities or matrices. Much of the literature is expressed in these terms. However, formulators commonly formulate models in terms of activities and constraints on the activities. 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
Variation-aware routing for FPGAs
Authors: Satish Sivaswamy, Kia Bazargan
Venue: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays (2007)

Chip design in the nanometer regime is becoming increasingly difficult due to process variations. ASIC designers have adopted statistical optimization techniques to mitigate the effects of variations. The FPGA community on the other hand, has only recently started focussing on the effects of variations. This paper presents a comparative study of the impact of variations on designs mapped to FPGAs and ASICs to get a measure of the severity of the problem in both the FPGA and ASIC domains. We also propose a variation aware router that reduces the yield loss by 7.61X, or the circuit delay by 3.95% for the same yield for the MCNC benchmarks.
An integrated approach to federated identity and privilege management in open systems
Authors: Rafae Bhatti, Elisa Bertino, Arif Ghafoor
Venue: Communications of the ACM (2007)

Online partnerships depend on federations of not only user identities but also of user entitlements across organizational boundaries.
Fast k-nearest-neighbor search based on projection and triangular inequality
Authors: Jim Z. C. Lai, Yi-Ching Liaw, Julie Liu
Venue: Pattern Recognition (2007)

In this paper, a novel algorithm for finding k points that are closest to a query point is presented. Some inequalities are used to delete impossible data points and reduce distance computations. Our algorithm makes use of a data point's feature to reject unlikely candidates for a query point and can eliminate many of the unlikely data points, which cannot be rejected by other available algorithms. Experimental results show that our algorithm is superior to other methods in terms of computing time and the number of distance calculations in most cases and is more remarkable, if a larger data set with higher dimension is used. Compared with available approaches, our method can reduce the computing time and number of distance calculations significantly.
Designing for programming as joint performances among groups of children
Authors: Ylva Fernaeus, Jakob Tholander
Venue: Interacting with Computers (2006)

Research on computer programming usually views the interactions as mostly cognitively based, with focus on concepts such as memory, perception and conceptual understanding. However, the current trend towards embodied and social perspectives on interaction provides an alternative way of looking at interactive processes, instead emphasising aspects such as social and physical performance with and around technology. We have explored a range of activities and tools that explicitly address these aspects in programming, with a specific focus on children's making of own computer games and simulations. We exemplify this work through three different situations where tools and activities are used by children as recourses for building of interactive systems, while at the same time allowing for bodily action in negotiation of design ideas. We discuss how situations like these may provide directions for new technologies for programming as well as methodological developments in the area of interaction design.
Ontological framework based on contextual mediation for collaborative information retrieval
Authors: Jason J. Jung
Venue: Information Retrieval (2007)

On the heterogeneous web information spaces, users have been suffering from efficiently searching for relevant information. This paper proposes a mediator agent system to estimate the semantics of unknown web spaces by learning the fragments gathered during the users' focused crawling. This process is organized as the following three tasks; (i) gathering semantic information about web spaces from personal agents while focused crawling in unknown spaces, (ii) reorganizing the information by using ontology alignment algorithm, and (iii) providing relevant semantic information to personal agents right before focused crawling. It makes the personal agent possible to recognize the corresponding user's behaviors in semantically heterogeneous spaces and predict his searching contexts. For the experiments, we implemented comparison-shopping system with heterogeneous web spaces. As a result, our proposed method efficiently supported the users, and then, network traffic was also reduced.
Counter-intuitive throughput behaviors in networks under end-to-end control
Authors: Ao Tang, Jiantao Wang, Steven H. Low
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

It has been shown that as long as traffic sources adapt their rates to aggregate congestion measure in their paths, they implicitly maximize certain utility. In this paper we study some counter-intuitive throughput behaviors in such networks, pertaining to whether a fair allocation is always inefficient and whether increasing capacity always raises aggregate throughput. A bandwidth allocation policy can be defined in terms of a class of utility functions parameterized by a scalar α that can be interpreted as a quantitative measure of fairness. An allocation is fair if α is large and efficient if aggregate throughput is large. All examples in the literature suggest that a fair allocation is necessarily inefficient. We characterize exactly the tradeoff between fairness and throughput in general networks. The characterization allows us both to produce the first counter-example and trivially explain all the previous supporting examples. Surprisingly, our counter-example has the property that a fairer allocation is always more efficient. In particular it implies that maxmin fairness can achieve a higher throughput than proportional fairness. Intuitively, we might expect that increasing link capacities always raises aggregate throughput. We show that not only can throughput be reduced when some link increases its capacity, more strikingly, it can also be reduced when all links increase their capacities by the same amount. If all links increase their capacities proportionally, however, throughput will indeed increase. These examples demonstrate the intricate interactions among sources in a network setting that are missing in a single-link topology.
Moving to InDesign: Use What You Know About QuarkXPress and PageMaker to Get Up to Speed in InDesign Fast!
Authors: David Blatner, Christopher Smith, Steve Werner
Venue:  (2004)

Costs less. Does more. Is easier to use: If this is the conclusion you've reached when comparing InDesign CS with its two long-time rivals (QuarkXPress and PageMaker), you're ready to make the switch. This guide shows you how! Throughout this compact guide, the focus is on leveraging your skill in the other leading desktop publishing packages to get up to speed fast in the new leading publishing package! As the perfect companion to the more comprehensive Real World InDesign CS, this tightly focused guide details the most common tasks and techniques you need to know to get your job done in InDesign CS. Clear, concise instructions enhanced by plenty of screen shots and sample layouts show you how to create and navigate documents, import and style text and objects, manage long projects, work with color, and more. Youï¾¿ll also find good coverage of all of InDesign's newest and most unique features: the Story Editor, a Separation Preview palette, nested styles, the Package for GoLive command, and more.
Three-machine flowshop with two operations per job to minimize makespan
Authors: Ling-Huey Su, Cheng-Te Lin
Venue: Computers and Industrial Engineering (2006)

This work studies three variants of a three-machine flowshop problem with two operations per job to minimize make-span (F3/o = 2/Cmax). A set of n jobs are classified into three mutually exclusive families A,B and C. The familiesA,B and C are defined as the set of jobs that is scheduled in machine sequence (M1, M2), (M1, M3) and (M1, M3), respectively, where (Mx, My) specifies the machine sequence for the job that is processed first on Mx, and then on My. Specifically, jobs with the same route (machine sequence) are classified into the same family. Three variants of F3/o = 2/Cmax are studied. First, F3/ GT, no-idle, o = 2/Cmax, in which both machine no-idle and GT restrictions are considered. The GT assumption requires that all jobs in the same family are processed contiguously on the machine and the machine no-idle assumption requires that all machines work continuously without idle time. Second, the problem F3/GT, o = 2/Cmax, in which the machine no-idle restriction in the first variant is relaxed, is considered. Third, the problem F3/no-idle, o = 2/Cmax with the GT assumption in the first variant relaxed is considered. Based on the dominance conditions developed, the optimal solution is polynomially derived for each variant. These results may narrow down the gap between easy and hard cases of the general problem.
Privacy Enhanced Mobile Authentication
Authors: G. M. Køien
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we investigate location- and identity privacy issues related to the access procedures. The investigation includes subscriber identity management, mobility management at the link layer and the security setup (authentication and key agreement) procedures. The paper also presents a Privacy Enhanced Mobile Authentication and Key Agreement (PEMAKA) protocol that illustrates the concepts and demonstrates that future mobile systems can provide both improved access security and enhanced subscriber privacy.
Photoshop Elements 5: The Missing Manual
Authors: Barbara Brundage
Venue:  (2006)

Anyone still think that Adobe Photoshop Elements is a toy version of the real thing? As the most popular photo-editing program on the market, Photoshop Elements not only has Photoshop's marvelous powers, but also has capabilities the mothership lacks. Each new version includes more tools designed specifically for today's consumer digital photo enthusiasts. The latest edition, Photoshop Elements 5, solidifies the reputation of this superb and inexpensive product with new scrapbook features, a link to online photo services, and many other improvements. In fact, there's so much to Photoshop Elements that it can be quite confusing at times. That's precisely why our Missing Manuals are the bestselling books on the topic. Adobe provides a pamphlet and some help files; our book, now in its fifth edition, carefully explains every feature the program has to offer (something no other book has done) by putting each one into a clear, easy-to-understand context. Photoshop Elements 5: The Missing Manual covers the Windows version of Adobe's workhorse and gives you the low down on a host of new features:Learn to create multiple page documents, custom photo layouts with frames, and highly customized layouts for scrapbook projectsMaster the new editor for Layer Styles, which lets you customize individual layers in a photo"Attach" your photos to areas of a Yahoo! Map so your friends and family can see the pictures you took in specific placesAuthor Barbara Brundage also introduces you to a new sophisticated tool called "Curves" to adjust the color and contrast in your photos, and shows you how to burn multi-session CDs and DVDs. As always, she lets you know which features work well, which don't, and why -- all with a bit of wit and good humor. Although the book progresses from simple to complex tasks, you can easily jump around to learn specific techniques, such as creating photomontages (composites), restoring old photos, preparing images for the Web, and archiving. More than a dozen downloadable images let you practice using the editing tools right away!
Ant colony algorithm for the shortest loop design problem
Authors: Kourosh Eshghi, Morteza Kazemi
Venue: Computers and Industrial Engineering (2006)

In this paper, a new algorithm for solving the shortest loop design problem is presented. The shortest loop design problem is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. In this paper, first it is shown that this problem can be represented as a graph model. The properties of the presented model enable us to design a meta-heuristic based on ant colony system algorithm for solving the shortest loop design problem. Computational results show the efficiency of our algorithm in compare to the other techniques.
The role of composition and aggregation in modeling macromolecular regulatory networks
Authors: Clifford A. Shaffer, Ranjit Randhawa, John J. Tyson
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Today's macromolecular regulatory network models are small compared to the amount of information known about a particular cellular pathway, in part because current modeling languages and tools are unable to handle significantly larger models. Thus, most pathway modeling work today focuses on building small models of individual pathways since they are easy to construct and manage. The hope is someday to put these pieces together to create a more complete picture of the underlying molecular machinery. While efforts to make large models benefit from reusing existing components, unfortunately, there currently exists little tool or representational support for combining or composing models. We have identified four distinct modeling processes related to model composition: fusion, composition, aggregation, and flattening. We present concrete proposals for implementing all four processes in the context of the Systems Biology Markup Language (SBML).