ppxscal/embedding_network huggingface dataset:
Creating Motion Graphics with After Effects: The Essentials, Vol. 1, 2 edition
Authors: Trish Meyer, Chris Meyer
Venue:  (2002)

: "I can't think of anyone more qualified to show you how to get the most out of After Effects than Trish and Chris Meyer." -- Steve Kilisky, Senior Product Manager, Adobe After Effects "In a sequel that surpasses the original, Trish and Chris Meyer expand Creating Motion Graphics with excellent coverage of the new features in After Effects 5.5. A 'must' in any motion graphic designer's toolbox." -- Steve Tiborcz, Adobe After Effects Quality Engineering Trish and Chris Meyer share ten-plus years of real-world production experience in the critically acclaimed Creating Motion Graphics with After Effects. Learn how the program works and get firsthand experience with the features these award-winning artists use. This full-color guide is packed with visual examples, and the accompanying CD-ROM is loaded with projects that encourage you to practice their techniques. In this thoroughly revised second edition, Creating Motion Graphics has been divided into two volumes. Volume 1: The Essentials is for all users of the version 5.5 Standard bundle. It covers the core concepts and tools you need to tackle virtually every job, including keyframe animation, masking, mattes, and plug-in effects. Totally new chapters demystify the new Parenting and 3D Space features, and a fresh introductory tutorial ensures that even the newest user can immediately start enjoying this powerful tool. Topics include: Mastering complex animation through keyframe and velocity control Blending imagery using masks, mattes, and modes Building groups and hierarchies through parenting and nested comps Thorough coverage of 3D layers, cameras, and lights Includes a CD-ROM with a tryout version of Adobe After Effects 5.5 (Mac or Windows) as well as hundreds of movies, stills, objects, and audio clips, free plug-ins, and keyframe assistants from Boris FX, Walker Effects, Digital Film Tools, The Foundry, Digital Anarchy, and DigiEffects and inspirational footage from Artbeats, Digital Vision, and EyeWire. Trish and Chris Meyer are the creative forces behind CyberMotion, an award-winning motion graphics studio in Los Angeles. They have created imagery for NBC, ABC, HBO, Fox, TLC, New Line, and Paramount - plus corporations ranging from Apple to Xerox. Their studio was one of the original development sites for After Effects.
A distributed transaction processing facility for the MMS specification
Authors: Y. Dakroury, J. P. Elloy
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The manufacturing message specification (MMS) is an application service element of the manufacturing automation protocol (MAP) standardized by ISO to support messaging communication to and from programmable devices in a computer integrated manufacturing (CIM) environment. Although this MMS standard is designed to function in a distributed environment, its specification does not include a support to execute distributed transactions while these ones are mandatory for the CIM applications to support the manufacturing operations implemented by the distributed devices. We propose a distributed transaction processing facility that permits the organization of a distributed manufacturing process in terms of a set of MMS services encapsulated together to perform the manufacturing task. The facility is supported by the transaction processing (TP) standard, designed by the ISO, to guarantee the correct behavior of the distributed MMS transactions. This guarantee is based on the satisfaction of the atomicity, consistency, isolation, and durability (ACID) properties defined by the ISO.
ASP.NET Components Toolkit, 1 edition
Authors: Daniel Cazzulino, Saurabh Nandu, Matthew Macdonald, David Gottlieb, Robin Dewson
Venue:  (2002)

:ASP.NET offers developers an exciting architecture for building web sites from modular components. Using server controls, ASP.NET developers can easily incorporate pre-built chunks of functionality into their sites. They can also develop their own controls, and build in design-time support to make it easier for other developers to reuse their code.The ASP.NET Solutions Toolkit is a collection of reusable ASP.NET components, all designed to serve two purposes. First, they can all be used, as they are or with minor modifications, to add exciting features to your own ASP.NET web sites. Second, each component's design and implementation is discussed, revealing tips and tricks you can apply when developing your own controls.
Supporting Dynamic Space-sharing on Non-dedicated Clusters of Workstations
Authors: Abdur Chowdhury, Lisa D. Nicklas, Sanjeev K. Setia, Elizabeth L. White
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Clusters of workstations are increasingly being viewed as a cost-effective alternative to parallel supercomputers. However, resource management and scheduling on workstations clusters is complicated by the fact that the number of idle workstations available for executing parallel applications is constantly fluctuating. In this paper, we present a case for scheduling parallel applications on non-dedicated workstation clusters using dynamic space-sharing, a policy under which the number of processors allocated to an application can be changed during its execution. We describe an approach that uses application-level checkpointing and data repartitioning for supporting dynamic space-sharing and for handling the dynamic reconfiguration triggered when failure or owner activity is detected on a workstation being used by a parallel application. The performance advantages of dynamic space-sharing are quantified through a simulation study, and experimental results are presented for the overhead of dynamic reconfiguration of a grid-oriented data parallel application using our approach.
Evolving Object Oriented Design to Improve Code Traceability
Authors: G. Antoniol, A. Potrich, P. Tonella, R. Fiutem
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Traceability is a key issue to ensure consistency among software artifacts of subsequent phases of the development cycle. However, few works have so far addressed the theme of tracing object oriented design into its implementation and evolving it.This paper presents an approach to checking the compliance of OO design with respect to source code and support its evolution. The process works on design artifacts expressed in the OMT notation and accepts C++ source code. It recovers an ``as is'' design from the code, compares recovered design with the actual design and helps the user to deal with inconsistencies.The recovery process exploits the edit distance computation and the maximum match algorithm to determine traceability links between design and code. The output is a similarity measure associated to each matched class, plus a set of unmatched classes. A graphic display of the design with different colors associated to different levels of match is provided as a support to update the design and improve its traceability to the code.
Debugging shared memory parallel programs using record/replay
Authors: Michiel Ronsse, Mark Christiaens, Koen De Bosschere
Venue: Future Generation Computer Systems (2003)

This paper presents a debugging aid for parallel program developers. The tool presented enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs running on multiprocessor systems with shared memory. The solution proposed consists of a combination of record/replay with automatic on-the-fly data race detection. This combination enables us to limit the record phase to the more efficient recording of the synchronization operations, and checking for data races (using intrusive methods) during a replayed execution. As the record phase is highly efficient, there is no need to switch it off, hereby eliminating the possibility of Heisenbugs because tracing can be left on all the time.
Explicit filtering of building blocks for genetic algorithms
Authors: Cees H.M. Kemenade
Venue:  (1996)

Genetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic algorithms reveals some interesting insights, and we discuss how the filtering algorithm can be used to build a powerful hybrid genetic algorithm.
Maximum likelihood estimation for the bombing model
Authors: Marie Lieshout, E. W. Zwet
Venue:  (2000)

Perhaps the best known example of a random set is the Boolean model. It is the union of `grains'' such as discs, squares or triangles which are placed at the points of a Poisson point process. The Poisson points are called the `germs''. We are interested in estimating the intensity, say lambda, of the Poisson process from a sample of a Boolean model of discs (the bombing model). A natural estimate is the number of germs in the observation region divided by the area of that region. Unfortunately, we do not observe the presence of a given germ when its associated disc is completely covered by other discs. On the other hand, we observe the exact location of a germ when we observe any part of its associated disc''s boundary. We demonstrate how to apply Coupling From The Past to sample from the conditional distribution, given the data, of the unobserved germs. Such samples allow us to approximate the maximum likelihood estimator of the intensity. We discuss and compare two methods to do so. The first method is based on a Monte Carlo approximation of the likelihood function. The second is a stochastic version of the EM algorithm.
Posit spaces: a performative model of e-commerce
Authors: Peter McBurney, Simon Parsons
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on speech act theory, in which e-commerce exchanges are promises of future commercial actions, whose real-world meanings are constructed jointly and incrementally. We then define a computational model for this theory, called Posit Spaces, along with the syntax and semantics for an agent interaction protocol, the Posit Spaces Protocol or PSP. This protocol enables participants in a multi-agent commercial interaction to propose, accept, modify and revoke joint commitments. Our work integrates three strands of prior research: the theory of Tuple Spaces in distributed computation; formal dialogue games from argumentation theory; and the study of commitments in multi-agent systems.
Storia del costituirsi di un modo mentale. La prospettiva rinascimentale
Authors: Renzo L. Beltrame
Venue:  (1997)

In this paper we concern with the birth of modern perspective (by Brunelleschi, in Florence, around the first quarter of the XV century), and with its first geometrical formalization by Leon Battista Alberti (De Pictura, 1435-1436). We try to outline the possible genesis of Brunelleschi''s perspective, and how its author could have drawn it. Then we outline the elements that lead to perceive a perspective as a tridimensional space, and how Brunelleschi and Alberti have managed them. Finally, we outline the characters of the Alberti''s geometrical formalization of the Brunelleschi''s perspective. TEL:: +39 050 593 288 EMAIL:: Renzo.Beltrame@cnuce.cnr.it
Bringing technology to market
Authors: Ubiquity staff
Venue: Ubiquity (2003)

Henry Chesbrough on open innovation, erosion factors, and multiple paths to market
Parallelization of Scheduling Algorithms
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization, of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP a1gorith.m. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms. static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP a1gorith.m. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms. 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
Achieving physical data independence in hypermedia databases
Authors: T. Pruckler, M. Schrefl
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

As a large amount of hypermedia data is collected the question of storing these data in hypermedia databases arises. One of the problems encountered is how to separate applications from the data so that the same data can be used by many applications and changes to data organization have-besides execution-time-no effect on applications. In conventional databases this problem is solved by the concept of physical data independence. We argue that the concept of physical data independence can be applied beneficially to hypermedia databases, too. So far, while the demand for physical data independence has been voiced in a number of papers, only partial solutions have been proposed. We describe the part of a hypermedia database management system which deals with physical data independence and show how an existing database management system can be extended in this direction. In particular; we present a DataBlade for Ilustra, extending Illustra with physical data independence for images.
A Compositional Approach for Designing Multifunction Time-Dependent Protocols
Authors: Jun-Cheol Park, Raymond E. Miller
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

We propose a framework based on the model of timed extended finite state machines for building communication protocols which perform several functions, where each function corresponds to a component protocol. For parallel composition, we specify a conjunctive relation which requires that the execution of events in two component protocols be synchronized. We also propose a predicate strengthening technique to refine the composite composite protocol in a stepwise manner while preserving the invariants of the component protocols. For sequential composition, we present a set of constraints, alternating, ordering and disabling, on the actions of the component protocols, and give sufficient conditions for the composite protocol to retain the safety properties such as freedom from unspecified receptions and freedom from deadlocks. Our sufficient conditions are weaker than those given in previous works.
Power Grid Modeling Technique for Hierarchical Power Network Analysis
Authors: Han Young Koh
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents a novel power grid modeling technique that can be used in hierarchical power network analysis of multi-million gate designs. The RC network of the power grid of a macro block is extracted and reduced by an AWE-based algorithm. The resulting model replaces the macro blocks during the top level power network analysis, thus greatly reduces both memory and CPU time usage. Our experiments show that more than 90% of R's and C's in the original power network can be reduced with less than 10% loss in accuracy. Furthermore, the CPU time required for the power network analysis of full-chip designs is reduced by 10 to 100 times.
Building and Scheduling Parallel Adaptive Applications in Heterogeneous Environments
Authors: D. Kebbal, E. G. Talbi, J. M. Geib
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this paper, we present a dynamic approach for constructing and scheduling parallel adaptive applications in heterogeneous multi-user environments (Networks of Workstations). Parallel adaptive applications have the property of varying their parallelism degree following the load fluctuation of the underlying environment. Our tool provides a programming facility that allows the application construction to avoid managing these complex problems and an allocation module responsible for running and scheduling application tasks. The allocation module handles also all problems related to the dynamic character of the application so that the user may not know at any time whether his application executes on one or dozens of workstations. The allocation module is completed by a scheduler which tries to make good mapping decisions and to adjust the mapping when the application reconfigures dynamically. The scheduling approach based on the dependency graphs model tries to minimize the execution time of the application by decreasing the parallelism loss situations in which some nodes allocated to the application are waiting for the work availability which must be generated by some slow nodes. This can be achieved by analyzing dynamically the depgraph structure and using the heterogeneity aspect. Encouraging results were obtained from experiments conducted on a parallel version of the Gaussian elimination application which is not well adapted to our environment. The advantages of our tool are mainly: the adaptive aspect which allows the parallel application to exploit idle cycles in a cluster of workstations and the programming facility which decreases the parallel programming complexity.
A relevant property of approximation spaces
Authors: Silvia Bertoluzza
Venue:  (1997)

We prove a super approximation result for a wide class of approximations spaces (including finite elements and wavelet type spaces). In particular such property, also referred at as the discrete commutator property holds, provided that a projector operator exists, who acts "locally". Such property is used in getting estimates through localization techniques. EMAIL:: ian@microian.ian.pv.cnr.it
Rational Expansions for the Computation of the Complex Error Function (Revised 2/94)
Authors: J. A. C. Weideman
Venue:  (1993)

This abstract contains mathematical symbols that may become distorted in ASCII text. We present rational expansions for computing the complex error function w(z)= e^-z^2 erfc(-iz). These expansions have the following attractive properties: (1) They can be evaluated using a polynomial evaluation routine such as Horner''s method, (2) the polynomial coefficients can be computed once and for all by a single FFT, and (3) high accuracy is achieved uniformly in the complex plane with only a small number of terms. Comparisons reveal that in some parts of the complex plane certain competitors may be more efficient. However, the difference in efficiency is never great, and our new algorithms are simpler than existing ones: a complete program takes eight lines of Matlab code.
A faster-than relation for asynchronous processes
Authors: Vogler Gerald Luettgen and Walter
Venue:  (2001)

This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous processes with respect to their worst-case timing behavior. The studies are conducted for a conservative extension of the process algebra CCS, called TACS, which permits the specification of maximal time bounds of actions. TACS complements work in plain process algebras which compares asynchronous processes with respect to their functional reactive behavior only, and in timed process algebras which focus on analyzing synchronous processes. The most unusual contribution of this paper is in showing that the proposed faster-than preorder coincides with two other and at least equally appealing preorders, one of which considers the absolute times at which actions occur in system runs. The paper also develops the semantic theory of TACS: it characterizes the largest precongruence contained in the faster-than preorder. A small example relating two implementations of a simple storage system testifies to the practical utility of the new theory. 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
On the approximation of Maxwell''s eigenproblem in general 2D domains
Authors: Daniele Boffi, Marco Farina, Lucia Gastaldi
Venue:  (1999)

In this paper we review some finite element methods to approximate the eigenvalues of Maxwell equations. The numerical schemes we are going to consider are based on two different variational formulations. Our aim is to compare the performances of the methods depending on the shape of the domain. We shall see that the nodal elements can give good results only using the penalized formulation and only if the domain is a convex or smooth polygon. In the case of domains with reentrant corners it turns out that the edge elements are efficient. Moreover we propose two new non standard finite elements in order to deal with the penalized formulation in presence of reentrant corners: the nonconforming nodal elements and the biquadratic elements with projection. EMAIL:: boffi@dimat.unipv.it KEYWORDS:: Fem, penalty method, nodal-edge elements, nonconforming elements, projection procedure
Increasing the Reliability of Three-Tier Applications
Authors: W. Zhao, L. E. Moser, P. M. Melliar-Smith
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

In this paper we describe an infrastructure that provides increased reliability for three-tier applications, transparently, using commercial off-the-shelf application servers and database systems. In this infrastructure the application servers are actively replicated to protect the business logic processing.Replicating the transaction coordinator renders the two-phase commit protocol non-blocking and, thus, avoids potentially long service disruptions caused bycoordinator failure.A thin interpositioning library provides lient-side automatic failureover,so that clients know the outcome of their requests.The interaction between the application servers and the database servers is handled through replicated gateways that prevent duplicate requests from reaching the database servers.Aborted transactions, caused by process or ommunication faults, are automatically retried on the client's behalf.
Exploiting an enterprise model during systems' requirements capture and analysis
Authors: R. E. M. Champion, T. T. Moores
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The paper presents a framework for the inclusion of enterprise information in the development of a software requirements specification (SRS). An enterprise model is described which includes organisational, as well as business process components. The mission of an enterprise will determine a number of business objectives, which are translated into quantifiable goals under constraints imposed by the business environment. These goals specify targets for the associated business processes, and are critical in constraining and scoping the requirements for information systems. By ensuring the consistency of these requirements statements against the enterprise objectives, the process of iterative construction of an SRS is enhanced. Further, the impact of changes in customer requirements, both during and after the requirements engineering phase of software development may be assessed with greater reliability. The feasibility of the approach is illustrated with examples.