ppxscal/embedding_network huggingface dataset:
iMovie 3 for Mac OS X (Visual QuickStart Guide)
Authors: Jeff Carlson
Venue:  (2003)

Crammed with new features--but lacking any documentation to speak of--iMovie 3 is a tool just waiting to be tapped, and this Visual QuickStart Guide provides the key. If you're already familiar with Apple's video editing software, you'll welcome the easy-to-find coverage of all of iMovie's new features--including seamless integration with other iLife applications, added visual effects, powerful new audio controls and effects, chapter markers, and instant DVD export. If you're using iMovie for the first time, the accessible, step-by-step format will have you making movies in no time. Using hundreds of screen shots (all updated to reflect iMovie 3's new interface) and tips gleaned from personal experience, noted Mac author Jeff Carlson covers all the bases here--from shooting and capturing footage, viewing clips, and working in the iMovie timeline to using special effects and transitions and adding sound, music, titles, and narration. New in this edition is a chapter focusing on working with still images, thorough coverage of interoperability between the other iLife applications, a valuable troubleshooting section, and much more.
On the road to recovery: restoring data after disasters
Authors: Kimberly Keeton, Dirk Beyer, Ernesto Brau, Arif Merchant, Cipriano Santos, Alex Zhang
Venue: ACM SIGOPS Operating Systems Review (2006)

Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under considerable pressure to recover quickly, so they lack time to make good scheduling decisions. They schedule recovery based on rules of thumb, or on pre-determined orders that might not be best for the failure occurrence. With multiple workloads and recovery techniques, the number of possibilities is large, so the decision process is not trivial.This paper makes several contributions to the area of data recovery scheduling. First, we formalize the description of potential recovery processes by defining recovery graphs. Recovery graphs explicitly capture alternative approaches for recovering workloads, including their recovery tasks, operational states, timing information and precedence relationships. Second, we formulate the data recovery scheduling problem as an optimization problem, where the goal is to find the schedule that minimizes the financial penalties due to downtime, data loss and vulnerability to subsequent failures. Third, we present several methods for finding optimal or near-optimal solutions, including priority-based, randomized and genetic algorithm-guided ad hoc heuristics. We quantitatively evaluate these methods using realistic storage system designs and workloads, and compare the quality of the algorithms' solutions to optimal solutions provided by a math programming formulation and to the solutions from a simple heuristic that emulates the choices made by human administrators. We find that our heuristics' solutions improve on the administrator heuristic's solutions, often approaching or achieving optimality.
Discrete event models: getting the semantics right
Authors: Edward A. Lee
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Discrete event models are systems where components interact via timed events. Although there are many languages and simulators with discrete-event semantics (VHDL, OpNet Modeler, ns2, etc.), there is not widespread agreement on the precise semantics. This talk examines a formal foundation for discrete-event systems that clarifies interesting corner cases, where events are simultaneous, ordered or unordered, and where Zeno conditions arise. It introduces analytical tools for studying such cases, lends insight into parallel and distributed execution of discrete-event models, and suggests a unified semantics that is efficient and clean.
IBM System I Security Guide for IBM I5/Os Version 5 Release 4
Venue:  (2006)

The IBM System i family, with its operating system IBM i5/OS, is considered one of the most secure systems in the industry. From the beginning, security was designed as an integral part of the system. The System i platform provides a rich set of security features and services that pertain to the goals of authentication, authorization, integrity, confidentiality, and auditing. However, if an IBM Client does not know that a service, such as a virtual private network (VPN) or hardware cryptographic support, exists on the system, they will not use it. In addition, there are more and more security auditors and consultants who are in charge of implementing corporate security policies in an organization. In many cases, they are not familiar with the System i platform, but need to understand the security services that are available. This IBM Redbook guides you through the native security features that are available on the System i platform. This book is intended for security auditors and consultants, IBM System Specialists, Business Partners, and Clients to help you answer first-level questions concerning the security features that are available on the System i platform. 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
Performance evaluation of a DVB-H enabled mobile device system model
Authors: Lukas Pustina, Simon Schwarzer, Michael Gerharz, Peter Martini, Volker Deichmann
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

In this experience report, we present experiences we have gained in applying performance engineering techniques during the design of a DVB-H enabled handheld device. The modelling methodology we applied uses UML 2.0 to model the system following a strict separation of architectural and behavioural aspects of the systems. From sequence diagrams and composite structure diagrams, a queueing network is generated for the analysis of the system performance. The configuration of the hardware resources and the resource demands is done using the standard SPT-profile. We describe our implementation and its seamless integration into a UML 2.0 CASE tool. Finally, the paper outlines lessons learnt during the design process which may be used to enhance the methodology.
IBM Certification Study Guide - Aix 5L Installation and System Recovery
Venue:  (2002)

Developed specifically for the purpose of preparing for AIX certification Makes an excellent companion to classroom education For experienced AIX professionals This IBM Redbook is designed as a study guide for professionals wishing to prepare for the AIX 5L Installation and System Recovery certification exam as a selected course of study in order to achieve the IBM eServer Certified Advanced Technical Expert - pSeries and AIX 5L certification. This redbook is designed to provide a combination of theory and practical experience needed for a general understanding of the subject matter. It also provides sample questions that will help in the evaluation of personal progress and provide familiarity with the types of questions that will be encountered in the exam. This publication does not replace practical experience, nor is it designed to be a stand-alone guide for any subject. Instead, it is an effective tool that, when combined with education activities and experience, can be a very useful preparation guide for the exam. Whether you are planning to take the AIX 5L Installation and System Recovery certification exam, or you just want to validate your AIX skills, this redbook is for you. This publication was updated to include the new content included in Test 223, which was based on AIX 5L Version 5.1. 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
Design considerations for microprogramming languages
Authors: Gregory R. Lloyd, Andries van Dam
Venue: ACM SIGMICRO Newsletter (1974)

The growing acceptance of user-microprogrammable computers indicates that microprogramming, as a discipline, will require development of user-oriented microprogramming support. A number of approaches (definition of sophisticated target machines, microcode assemblers, and higher level microprogramming languages) have been proposed. The issues involved in choosing support tools include the range of proposed applications, hardware parallelism (horizental or minimally encoded control vs. vertically encoded control) and constraints on performance. After reviewing some of these tradeoffs, design considerations for higher level microprogramming languages are considered. One of the most important design decisions is fixing the level of the language, defined on a continuum from symbolic assemblers, through general purpose programming languages such as PL/I. A tailored language concept is defined and illustrated, using as an example a microprogramming language for a horizontally encoded microprogrammable computer currently under development.
Re-using traditional animation: methods for semi-automatic segmentation and inbetweening
Authors: Christina N. de Juan, Bobby Bodenheimer
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

A large body of traditional animation exists that contains characters with poses, expressions, and appeal not easily achievable with modern 3D techniques. To create new uses for this body of animation, this paper presents components of a system that can help incorporate the animation into re-usable libraries. In particular, we discuss two semi-automatic techniques that allow the re-use of traditional animation. First, support vector machines are used to segment cartoon images from their backgrounds for incorporation into an image library, for such applications as re-sequencing. Second, a radial basis function implicit surface modeling technique and a fast non-rigid elastic registration algorithm provide inbetween contours and textures given two key images of traditional animation. Our system is fast, model-free, and requires minimal animator intervention.
Agents applied in health care: Guest-editorial
Authors: Antonio Moreno
Venue: AI Communications (2003)

In the last five years many research groups have applied agent technology to tackle problems in the health care domain. In the 15th European Conference on Artificial Intelligence (ECAI-2002), held in July 2002 in Lyon, there was a specialised workshop on this topic, in which 9 papers were accepted. This special issue contains extended versions of a selection of the papers presented at the workshop.
GABRIEL: Gis Activity-Based tRavel sImuLator. Activity Scheduling in the Presence of Real-Time Information
Authors: Mei-Po Kwan, Irene Casas
Venue: Geoinformatica (2006)

A series of travel simulators have been developed in the past two decades under the Intelligent Transportation Systems (ITS) umbrella. They have addressed issues such as reactions to advisory radio and variable message signs, use of navigation systems, route diversion, and mode choice. The objective of this paper is to present the design and implementation of a different kind of travel simulator. GABRIEL (Gis Activity-Based tRavel sImuLator) has as a foundation the activity-based approach and makes use of geographic information systems (GIS) as a development environment. The simulation scenario consists of a commute trip where two activities take place. En-route to the first destination, congestion occurs and subjects are requested to take action based on a set of alternatives. The simulator provides re-routing, destination substitution, dynamic geographic information and real-time information to aid users in their decision-making process. As a result it helps subjects in developing their ability to adapt given a particular scenario and allow researchers in understanding trip making, activity rescheduling, and the decision-making process from a comprehensive perspective.
Content-Based Complexity Reduction Methods for MPEG-2 to H.264 Transcoding
Authors: Shen Li, Lingfeng Li, Takeshi Ikenaga, Shunichi Ishiwata, Masataka Matsui, Satoshi Goto
Venue: IEICE - Transactions on Information and Systems (2007)

The coexistence of MPEG-2 and its powerful successor H.264/AVC has created a huge need for MPEG-2/H.264 video transcoding. However, a traditional transcoder where an MPEG-2 decoder is simply cascaded to an H.264 encoder requires huge computational power due to the adoption of a complicated rate-distortion based mode decision process in H.264. This paper proposes a 2-D Sobel filter based motion vector domain method and a DCT domain method to measure macroblock complexity and realize content-based H.264 candidate mode decision. A new local edge based fast INTRA prediction mode decision method is also adopted to boost the encoding efficiency. Simulation results confirm that with the proposed methods the computational burden of a traditional transcoder can be reduced by 20% ∼ 30% with only a negligible bit-rate increase for a wide range of video sequences.
On integration of interface design methods: Can debates be resolved?
Authors: Y. Lin, W. J. Zhang, R. J. Koubek, Ronald R. Mourant
Venue: Interacting with Computers (2006)

There have been many debates on how to design the human-computer interface (HCI). Often, one can find that different views in a debate are simply because these views are attached to different aspects which embody the same thing. In other words, prior to giving an effective judgment of a debate, one needs to establish an understanding of the 'total' aspects of a thing the debate is about. Following this line of thinking, in this paper, we propose an understanding of the 'total' aspects of designing HCI, which is called the total interface design framework. We then judge several debates under this framework with the purpose of exemplifying the judgment process for any other debate related to designing HCI. At the end, the debates used for exemplifying our judgment process can be resolved. The effectiveness of the total interface design framework for integrating the different HCI approaches is also demonstrated.
Further experiments in the formulation of integer programming problems
Authors: J. M. Wilson
Venue: Issue 18 (February 1975) (1975)

Interest has been shown recently in different approaches to formulating integer programming problems. In the paper of Williams [1] five different types of problems are considered and each is formulated in two different ways. The first of these problems will be considered here, a Market Share problem, and this will be formulated in two additional ways. The two additional formulations are in fact general methods of formulating certain types of problems in (0-1) variables and so can be used on other models.
Computational aspects of mining maximal frequent patterns
Authors: Guizhen Yang
Venue: Theoretical Computer Science (2006)

In this paper we study the complexity-theoretic aspects of mining maximal frequent patterns, from the perspective of counting the number of all distinct solutions. We present the first formal proof that the problem of counting the number of maximal frequent itemsets in a database of transactions, given an arbitrary support threshold, is #P-complete, thereby providing theoretical evidence that the problem of mining maximal frequent itemsets is NP-hard. We also extend our complexity analysis to other similar data mining problems that deal with complex data structures, such as sequences, trees, and graphs. We investigate several variants of these mining problems in which the patterns of interest are subsequences, subtrees, or subgraphs, and show that the associated problems of counting the number of maximal frequent patterns are all either #P-complete or #P-hard.
Word 2007 for Starters: The Missing Manual
Authors: Chris Grover
Venue:  (2007)

Fast-paced and easy to read, this concise book teaches you the basics of Word 2007 so you can start using the program right away. Not only will you learn how to work with Word's most useful features to create documents, format and edit text, share the results and more, you'll also discover how to go beyond basic documents to handle graphics, create page layouts, and use forms and tables. The new Word is radically different from previous versions, but with this convenient book, you can breeze through the new user interface and its timesaving features in no time with: Clear explanationsStep-by-step instructionsLots of illustrationsLarger typePlenty of friendly advice Word is used primarily for word processing, but there's more to this powerful program than meets the eye. It also offers a staggering array of advanced features that were once found only in page layout programs and graphics software. Many of these features are hidden among Word's cluttered menus, and even the pros can't find them all. For Word 2007, Microsoft redesigned the user interface completely, adding a tabbed toolbar that makes every feature easy to locate.Unfortunately, Microsoft's documentation is as poor as ever, so even if you find the features you need, you still may not know what to do with them. Word 2007 for Starters: The Missing Manual helps you master Word's redesigned user interface and gives you exactly what you need to create unique, attractive and effective documents.
A quantitative analysis of aspects in the eCos kernel
Authors: Daniel Lohmann, Fabian Scheler, Reinhard Tartler, Olaf Spinczyk, Wolfgang Schröder-Preikschat
Venue: ACM SIGOPS Operating Systems Review (2006)

Nearly ten years after its first presentation and five years after its first application to operating systems, the suitability of Aspect-Oriented Programming (AOP) for the development of operating system kernels is still highly in dispute. While the AOP advocacy emphasizes the benefits of AOP towards better configurability and maintainability of system software, most kernel developers express a sound skepticism regarding the thereby induced runtime and memory costs: Operating system kernels have to be lean and efficient.We have analyzed the runtime and memory costs of aspects in general, on the level of &mu;-benchmarks, and by refactoring and extending the eCos operating system kernel using AspectC++, an AOP extension to the C++ language. Our results show that most AOP features do not induce a intrinsic overhead and that the actual overhead induced by AspectC++ is very low. We have also analyzed a test case with significant aspect-related costs. This example shows how the structure of the underlying kernel can have a negative impact on aspect implementations and how these costs can be avoided by an aspect-aware design.Based on this analysis, our conclusion is that AOP is suitable for the development of operating system kernels and other kinds of highly efficient infrastructure software.
Code development and computation testing on network problems
Authors: Fred Glover, Darwin Klingman
Venue: Issue 16 (April 1974) (1974)

Since 1970 we have been jointly working with systems analysts in order to develop new techniques which are computationally efficient for solving network problems. Our first step in this direction was to elaborate on Johnson's "triple-label method" [9] by providing a method for characterizing successive basis trees with minimal relabeling. This procedure, which is called the augmented predecessor index (API) method [5], additionally indicates the most efficient way to co-ordinate the activities of finding the representation of the come-in arc (basis equivalent path), pricing-out the basis, and updating the basis labels. The API method has been a major contributor to the improvements in the computational efficiency of solution algorithms. Its use was a factor underlying the efficiency attained by the special purpose primal simplex transportation code of Glover, Karney, and Klingman [6]. In addition, the procedure was incorporated into the Srinivasan -- Thompson accelerated primal transportation code [14] and succeeded in cutting the solution times of that algorithm by more than half.
An exercise in basis inversion
Authors: Wm. Orchard-Hays
Venue: Issue 15 (November 1973) (1973)

At the NATO conference on Large Scale Decomposition in Cambridge, England, July 1972, it appeared to me that few people knew how matrix inversion is really done in standard MP systems with product form. So I concocted an example and used part of my talk time to run through it. Several people appreciated this and Mike Grigoridis suggested I should put it in the Newsletter. He also wanted it for his own use. My apology to him for the long delay in organizing and typing it, but here it is. 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
TPTP, CASC and the development of a semantically guided theorem prover
Authors: Kahlil Hodgson John Slaney
Venue: AI Communications (2002)

The first-order theorem prover SCOTT has been through a series of versions over some ten years. The successive provers, while retaining the same underlying technology, have used radically different algorithms and shown wide differences of behaviour. The development process has depended heavily on experiments with problems from the TPTP library and has been sharpened by participation in CASC each year since 1997. In the present paper, we outline some of the difficulties inherent in designing and refining a theorem prover as complex as SCOTT, and explain our experimental methodology. While SCOTT is not one of the systems which have been highly optimised for CASC, it does help to illustrate the influence of both CASC and the TPTP library on contemporary theorem proving research.
Peer sharing behaviour in the eDonkey network, and implications for the design of server-less file sharing systems
Authors: S. B. Handurukande, A.-M. Kermarrec, F. Le Fessant, L. Massoulié, S. Patarin
Venue: ACM SIGOPS Operating Systems Review (2006)

In this paper we present an empirical study of a workload gathered by crawling the eDonkey network --- a dominant peer-to-peer file sharing system --- for over 50 days.We first confirm the presence of some known features, in particular the prevalence of free-riding and the Zipf-like distribution of file popularity. We also analyze the evolution of document popularity.We then provide an in-depth analysis of several clustering properties of such workloads. We measure the geographical clustering of peers offering a given file. We find that most files are offered mostly by peers of a single country, although popular files don't have such a clear home country.We then analyze the overlap between contents offered by different peers. We find that peer contents are highly clustered according to several metrics of interest.We propose to leverage this property by allowing peers to search for content without server support, by querying suitably identified semantic neighbours. We find via trace-driven simulations that this approach is generally effective, and is even more effective for rare files. If we further allow peers to query both their semantic neighbours, and in turn their neighbours' neighbours, we attain hit rates as high as over 55% for neighbour lists of size 20.