ppxscal/embedding_network huggingface dataset:
50 Fast Final Cut Express Techniques
Authors: Tim Meehan
Venue:  (2003)

:"If you are looking to maximize Final Cut Express, you wont find a better guide than Tim Meehan."Dan Jahn, President, The Raven GroupWhether creating dynamite digital videos is your profession or just your obsession, Final Cut Express can enhance your projects. In this richly illustrated volume, computer graphics pro Tim Meehan shows you step by step how to use 50 terrific techniques to add that extra dimension of style and pizzazz. Youll learn them quickly, apply them easily, and discover youre amazedand delightedby the results you can achieve.Your guide to amazing results with Final Cut ExpressSave time and gain focus with storyboards and shot listsCapture viewers attention with creative use of colors, special effects, and size deceptionsEnhance your video pictures with film-grain simulations, contrast correction, and soft-focus effects Add polish with rolling credits and professional titling techniquesImprove communication with time and speed effects, superimposition, and text tricksCreate "wow" with whimsical people and animals, matte windows in objects, doorways to the unknown, and moreCD-ROM includes demonstrations of the techniques explained in the book, full resolution video clips from Artbeats, and more *Presents 50 fast, easy, and powerful effects that creative professionals and amateurs alike can achieve almost instantly with Apple's hot new Final Cut Express video editing software * Proven step-by-step format, lavishly illustrated with "before" and "after" scenes from professional clips * Includes masking techniques, creative use of colors and special effects, professional titling and rolling credit techniques, size deceptions, film-grain simulations, and much more * Features in-depth discussions of features and techniques that help readers make the necessary adjustments for their own videos * Reasonably priced Final Cut Express software is sophisticated enough for the professional, yet basic enough for the editing beginner or hobbyist * CD-ROM is packed with all video clips from the book and valuable utilitiesAuthor Biography: Tim Meehan is a computer graphics professional who conducts classes, demonstrations, and workshops on a variety of digital video products. He is a longtime member of the Apple Consultants Network, and has served Apple Computer in various consulting and promotional capacities since 1984. 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
Designing Trading Agents for an Artificial Market with a Multi-Objective Genetic Algorithm
Authors: Rikiya Fukumoto, Hajime Kita
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Artificial market (AM) is study of market economy through agent-based simulation.In AM, toconstruct agents having trading strategies with adequate rationality and variety is an intrinsic requirement.Difference of preference to return and risk among agents will be one candidate reason of variety of the trading strategies.In this paper, problem of constructing trading agent is considered as a two-objective optimization problem of minimizing risk and maximizing return, and is approached to by multi-objective genetic algorithm (MOGA).As for the artificial market environment, the U-Mart system proposed for a test bed of interdisciplinary study is used.Agents are evaluated in the U-Mart with other agents having simple and fixed strategies, and evolved with the MOGA.Computer simulation shows various agents having non-dominated trading strategies can be obtained by the proposed approach.
Equilibrium selection in alternating-offers bargaining models -- the evolutionary computing approach
Authors: D. D.B. Bragt, E. H. Gerding, J. A. L Poutre
Venue:  (2000)

A systematic validation of evolutionary techniques in the field of bargaining is presented. For this purpose, the dynamic and equilibrium-selecting behavior of a multi-agent system consisting of adaptive bargaining agents is investigated. The agents'' bargaining strategies are updated by an evolutionary algorithm (EA), an innovative computational method to simulate collective learnin g in societies of boundedly-rational agents. Negotiations between the agents are governed by the well-known ``alternating-offers" protocol. Using this protocol, the influence of various important factors (like the finite length of the game, time preferences, exogenous breakdown, and risk aversiveness) is investigated. We show that game theory can be used successfully to interpret the equilibrium-selecting behavior observed in computational experiments with adaptive bargaining agents. Agreement between theory and experiment is especially good when the agents experience an intermediate time pressure. Deviations from classical game theory are, however, observed in several experiments. Violent nonlinear oscillations may for instance occur in the single-stage ultimatum game. We demonstrate that the specific evolutionary model governing agent selection is an important factor under these conditions. In multiple-stage games, the evolving agents do not always fully perceive and exploit the finite horizon of the game (even when time pressure is weak). This effect can be attributed to the boundedly-rational behavior of the adapting agents. Furthermore, when the agents discount their payoffs at a different rate, the agent with the largest discount factor is not able to exploit his bargaining power completely, being under pressure by his impatient opponent to reach an early agreement. Negotiations over multiple issues, a particularly important aspect of electronic trading, are studied in a companion paper \cite{Gerding:00}. We are currently investigating the behavior of more complex and powerful bargaining agents.
Distributed Recovery with K-Optimistic Logging
Authors: Yi-Min Wang, Om P. Damani, Vijay K. Garg
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service downtime. Most industrial applications have chosen pessimistic logging because it allows fast and localized recovery. The price that they must pay, however, is the higher failure-free overhead. In this paper, we introduce the concept of K-optimistic logging where K is the degree of optimism that can be used to fine-tune the tradeoff between failure-free overhead and recovery efficiency. Traditional pessimistic logging and optimistic logging then become the two extremes in the entire spectrum spanned by K-optimistic logging. Our approach is to prove that only dependencies on those states that may be lost upon a failure need to be tracked on-line, and so transitive dependency tracking can be performed with a variable-size vector. The size of the vector piggybacked on a message then indicates the number of processes whose failures may revoke the message, and K corresponds to the system-imposed upper bound on the vector size.
Building Holonic Control Systems with Function Blocks
Authors: Martyn Fletcher
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

In today's global marketplace, people want highly-customised products to satisfy their individual requirements. However traditional manufacturing technology is not geared towards high-mix, low-volume manufacturing. Holonic Manufacturing Systems (HMS) is a new paradigm whose goal is to bridge this divide. HMS offers a migration path so manufacturing enterprises can continuously reconfigure themselves to manufacture a larger variety of products in smaller batch sizes, and do this profitably. Research into holonic manufacturing systems has established that such flexibility can be realized through a dynamically reconfigurable control system. A suitable metaphor for implementing the holonic control system is the emerging IEC function block standard. The paper describes how function blocks can be used to build such holonic control systems.
Applying the OpenMORE Assessment Program for IP Cores
Authors: Jean-Pierre Gukguen, Pierre Bricaud
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The intellectual property (IP) industry is moving into its second generation of reusable IP and is beginning to reflect a maturity of business and technology that will drive IP to become the productivity enhancement everyone expects.
Issues of software standardization in the industrial area of quality and dependability
Authors: T. Natsume
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

It is well known that there are two groups for the international software standardization body in the area of quality and dependability, that is ISO/SC2/TC176/WG5 Quality system and quality management for software application and IEC/TC56/WG10 Software Aspects for Dependability. WG 5 developed ISO 9000-3 as a complementary document for ISO 9001 in 1991. However this is not perfectly acceptable for the worldwide industry due to its narrow applications. WG10 is still developing the dependability area guidelines which address the barriers to development such as rapid progress of software industries, system aspects, limitation of application for various software products, rapid change from industrial fundamental innovation and traditional industry for product views. Here current software industrial progress and issues for international standardization by such technical and industrial environment are discussed to help seek common understanding and mutual recognition and to try to offer some proposals for the issues raised. The discussions in the paper are based on the author's experience through the service as a national committee member of IEC/TC56 and WG10, and also ISO/SC2/TC176 and WG15 (Japanese WG to WC5).
A user centred approach to measure a web site's appeal using the ropertory grid technique
Authors: Reiner Wessler, Martin Ortlieb
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

This session presents a case study of the use of the Repertory Grid Technique that has proven to be a powerful method to evaluate web sites from a user perspective.
Recognition of Trademarks with Spatial Statistics and Neural Learning
Authors: Tuan D. Pham
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper presents a new approach for extracting spatial features of images based on the theory of regionalized variables. These features can be used for automatic recognition of trademark or logo images using a neural network. Initial results have shown that the approach is invariant to geometrical rotation and robust to noise.
Transportable Information Agents
Authors: Robert S. Gray, Daniela Rus, David Kotz
Venue:  (1996)

We have designed and implemented autonomous software agents. Autonomous software agents navigate independently through a heterogeneous network. They are capable of sensing the network configuration, monitoring software conditions, and interacting with other agents. Autonomous agents are implemented as transportable programs, e.g., programs that are capable of suspending execution, moving to a different machine, and starting from where they left off. We illustrate the intelligent behavior of autonomous agents in the context of distributed information-gathering tasks.
From neurons to consciousness
Authors: D. Doval
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper outlines a possible model for human intelligence, based on the fact that the act of understanding can be explained, at best, as an act of pure intuition, impossible to explain in itself. Based on the model, we discuss how learning could be accomplished by such a system, and how knowledge could be transferred between generations. The model uses clusters of neural networks to achieve its goal. The proposed model uses a genetic algorithm closely coupled to the memory neural cluster to achieve creativity and to generate original responses. Other issues, such as possible internal representation models, are also discussed. As the model is certainly intensive in terms of computing-power and memory, and several components remain to be clearly defined, a reduced model is proposed. We define a system that can only handle one type of input (voice) that will learn a limited number of procedures. This reduced system would provide a basis to test the actual feasibility of the model and its possibilities, as well as different subsystem implementations.
A Preference-Based Approach to Inheritance
Authors: Lynn A Stein
Venue:  (1990)

Existing theories of nonmonotonic inheritance are generally either computationally feasible or semantically well-founded, but not both. We present four approaches to inheritance reasoning: \begin{itemize} \item a Touretzky-style path-based theory \item a model-theoretic semantics \item a polynomial-time inference algorithm \item a reason-maintenance labeling scheme \end{itemize} and demonstrate that these four approaches yield equivalent results. The underlying framework further provides a unified theory of inheritance suitable for principled analysis of existing inheritance systems (rather than {\em ad hoc} comparison on specific examples).
Three-dimensional state of stress in stable tearing of thin wall structures
Authors: D. Tran
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In ductile thin wall structure, there is an area that has not been well explored is how to assess the soundness of a structure when the loading is a combination of fatigue loading with intermittent over-loadings which may cause considerable yet stable crack growth. This so called " dynamic stable tearing" has been well recognized in aerospace engineering, where the presence of controlled cracks and overloading in the service life of a structure is accepted. Stable tearing is also observed in fracture toughness test of ductile material using quasi-static monotonically increasing load. This form of crack tunnelling should be distinguished from dynamic stable tearing due to fluctuating load, even though fractography examination reveals similar dimples indicating void coalescence. This paper looks at the three dimensional state of stress of considerable plasticity in the vicinity of a curve crack in a centred crack tension specimen (CCT) made of ductile material by finite element modelling (FEM). The FEM model takes into account the extensive non-linear plasticity of deformation and the profile of the curve crack. It is found that the increasing remote stress and depth of the curve crack influence parameters that control the initiation and propagation of stable tearing cracks in apparently opposite direction.
Disk Allocation for Fast Range and Nearest-Neighbor Queries
Authors: Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi
Venue: Distributed and Parallel Databases (2003)

As databases increasingly integrate non-textual multimedia information it is becoming necessary to support efficient similarity searching in addition to range searching. Range and nearest-neighbor (similarity) queries are the most important class of queries for multimedia and multi-dimensional databases. Due to the large sizes of the datasets involved, I/O is a critical factor limiting performance. The use of parallel I/O through declustering of the data is a promising approach to improve performance. Consequently several research efforts have addressed the problem of declustering multidimensional data for optimizing range and partial match queries. Very limited work has been done for similarity queries, and the problem of declustering for combined range and similarity queries has not been addressed in the literature. Consider a dataset of images where the following metadata for each image is also stored: date on which the picture was taken, longitude and latitude of the site of the picture. An example of a combined query is: Given a target image, find the 5 most similar images taken within 3 months of the target image and located within 2 degrees of longitude and latitude of the target image. In order to answer this query, it is necessary to conduct a range search on the date, longitude and latitude values and a similarity search on the image content.In this paper, we develop new declustering schemes that provide good declustering for similarity searching. In addition, we show that the new schemes have very good performance for range queries as well as combination queries. The new schemes are based upon the Cyclic declustering schemes which were developed for range and partial match queries. The Cyclic schemes not only provide superior performance to earlier schemes, but are also very robust and consistent with respect to query types and variations in system parameters.
An Extensible and Scalable Content Adaptation Pipeline Architecture to Support Heterogeneous Clients
Authors: Thomas Phan, George Zorpas, Rajive Bagrodia
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

The importance of middleware and content adaptation has previously been demonstrated for pervasive use of Web-based applications. In this paper we propose a modular, extensible, and scalable middleware component called the Content Adaptation Pipeline that performs content adaptation on arbitrarily complex data types not limited to text and graphic images. Furthermore, the architecture can be used as part of many client-server applications, not just Web browsers. In our work we leverage the XML language as a uniform means to describe all the elements in our architecture, including the client device and user profiles, the data characteristics, the transcoding operations performed on the data, and the resultant adapted data. We illustrate the flexibility of our architecture to support new data types and adaptationoperations by first showing its use with data from a real-world medical application and then extending its capabilities to handle animated graphics and also real-time streaming RTP data. Finally, we demonstrate scalability in our architecture by executing the Content Adaptation Pipeline over a distributed set of servers running an efficient protocol.
Parametrizable cameras for 3D computational steering
Authors: Jurriaan D. Mulder, Jarke J. Wijk
Venue:  (1997)

We present a method for the definition of multiple views in 3D interfaces for computational steering. The method uses the concept of a point-based parametrizable camera object. This concept enables a user to create and configure multiple views on his custom 3D interface in an intuitive graphical manner. Each view can be coupled to objects present in the interface, parametrized to (simulation) data, or adjusted through direct manipulation or user defined camera controls. Although our focus is on 3D interfaces for computational steering, we think that the concept is valuable for many other 3D graphics applications as well.
Evaluation of Gradient Descent Learning Algorithms with an Adaptive Local Rate Technique for Hierarchical Feed Forward Architectures
Authors: F. Diotalevi, M. Valle, D. D. Caviglia
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Gradient descent learning algorithms (namely Back Propagation and Weight Perturbation) can significantly increase their classification performances adopting a local and adaptive learning rate management approach. In this paper, we present the results of the comparison of the classification performance of the two algorithms in a tough application: quality control analysis in steel industry. The feed forward network is hierarchically organized (i.e. tree of Multi Layer Perceptrons). The comparison has been performed starting from the same operating conditions (i.e. network topology, stopping criterion, etc): the results show that the probability of correct classification is significantly better for the Weight Perturbation algorithm.
Fault Tolerant Insertion and Verification: A Case Study
Authors: Alberto Manzone, Diego De Costantini
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

The particular circuit structures that allow the building of a Fault Tolerant (FT) circuit have been extensively studied in the past, but currently there is a lack of CAD support in the design and evaluation of FT circuits. The aim of the AMATISTA European project (IST project 11762) is to develop a set of tools devoted to the design of FT digital circuits. The toolset is composed of: an automatic insertion tool and a simulation tool to validate the FT design.This paper is a case study describing how this set of FTI (Fault Tolerant Insertion) and FTV (Fault Tolerant Verification) tools have been used to increase the reliability in a typical automotive application.
CTL Model-Checking over Logics with Non-Classical Negations
Authors: Marsha Chechik, Wendy MacCaull
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In earlier work [9], we defined CTL model-checking overfinite-valued logics with De Morgan negation. In this paper,we extend this work to logics with intuitionistic, Galoisand minimal negations, calling the resulting language\chiCTL. We define \chiCTL operators and show that they canbe computed using fixpoints. We further discuss how to extendour existing multi-valued model-checker \chiChek [8] toreasoning over these logics.
Detecting global stride locality in value streams
Authors: Huiyang Zhou, Jill Flanagan, Thomas M. Conte
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

Value prediction exploits localities in value streams. Previous research focused on exploiting two types of value localities, computational and context-based, in the local value history, which is the value sequence produced by the same instruction that is being predicted. Besides the local value history, value locality also exists in the global value history, which is the value sequence produced by all dynamic instructions according to their execution order. In this paper, a new type value locality, the computational locality in the global value history is studied. A novel prediction scheme, called the gDiff predictor, is designed to exploit one special and most common case of this computational model, the stridebased computation, in the global value history. Such a scheme provides a general framework to exploit global stride locality in any value stream. Experiments show that there exists very strong stride type of locality in global value sequences. Ideally, the gDiff predictor can achieve 73% prediction accuracy for all value producing instructions without any hybrid scheme, much higher than local stride and local context prediction schemes. However, the capability of realistically exploiting locality in global value history is greatly challenged by the value delay issue, i.e., the correlated value may not be available when the prediction is being made. We study the value delay issue in an out-of-order (OOO) execution pipeline model and propose a new hybrid scheme to maximize the exploitation of the global stride locality. This new hybrid scheme shows 91% prediction accuracy and 64% coverage for all value producing instructions. We also show that the global stride locality detected by gDiff in load address streams provides strong capabilities in predicting load addresses (coverage 63% and accuracy 86%) and in predicting addresses of missing loads (33% coverage and 53% accuracy).
Increasing Availability in Partitioned Database Systems
Authors: Dale Skeen, David D. Wright
Venue:  (1983)

NO SUPPLIED