ppxscal/embedding_network huggingface dataset:
DVD Studio Pro: The Complete Guide to DVD Authoring with Macintosh, 1 edition
Authors: Bruce Nazarian
Venue:  (2003)

:The Apple Macintosh G4 combined with the Superdrive has revolutionized DVD Authoring by reducing the previously high cost barrier-to-entry and making the authoring process much easier. DVD Studio Pro (DVDSP), Apple's flagship DVD Authoring application suite, provides a complete DVD solution, at an extremely affordable cost. Since its introduction in January 2001, Apple has sold over 500,000 Mac G4s with Superdrive, and over 2 million copies of DVD-Recordable software.There still isn't much published on this fast growing area: this will be an authoritative tutorial on using every feature of DVDSP, allowing users to unleash the program's full power. 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
Unification of Replication and Transaction Processing in Three-Tier Architectures
Authors: W. Zhao, L. E. Moser, P. M. Melliar-Smith
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

In this paper we describe a software infrastructure that unifies replication and transaction processing in three-tier architectures and, thus, provides high availability and fault tolerance for enterprise applications. The infrastructure is based on the Fault Tolerant CORBA and CORBA Object Transaction Service standards, and works with commercial-off-the-shelf application servers and database systems.The infrastructure replicates the application servers to protect the business logic processing. In addition, it replicates the transaction coordinator, which renders the two-phasecommit protocol non-blocking and, thus, avoids potentially long service disruptions caused by coordinator failure. The infrastructure handles the interactions between the application servers and the database servers through replicated gateways that prevent duplicate requests fromreaching the database servers. The infrastructure implements client-side automatic failover mechanisms, which guarantees that clients know the outcome of the requests that they have made. The infrastructure starts the transactions at the application servers, and retries aborted transactions, caused by process or communication failures, automatically on the behalf of the clients.
Acting Optimally in Partially Observable Stochastic Domains
Authors: Anthony R. Cassandra, Leslie P Kaelbling, Michael L. Littman
Venue:  (1994)

In this paper, we describe the partially observable Markov decision process ({\sc pomdp}) approach to finding optimal or near-optimal control strategies for partially observable stochastic environments, given a complete model of the environment. The {\sc pomdp} approach was originally developed in the operations research community and provides a formal basis for planning problems that have been of interest to the AI community. We found the existing algorithms for computing optimal control strategies to be highly computationally inefficient and have developed a new algorithm that is empirically more efficient. We sketch this algorithm and present preliminary results on several small problems that illustrate important properties of the {\sc pomdp} approach.
The GA Approach to the Eigenvalue Placement of an LQ Optimal System
Authors: Naghmeh Mansouri, Hamid Khaloozadeh
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this paper, a new genetic approach is presented which places the closed loop eigenvalues of a Linear Quadratic (LQ) optimal system in desired stable location by choice of suitable weighting matrices. The location of the closed-loop eigenvalues of an LQ optimal system is determined by the choice of positive definite symmetric weighting matrices Q and R. The problem is then to find the best weighting matrices to locate the closed-loop eigenvalues close to the desired closed-loop eigenvalues as much as possible. This work employs GeneticAlgorithm (GA) to find the proper weighting matrices. The solution (in this case Q and R matrices) is encoded as a chromosome. A computer simulation is given to illustrate the result.
Relation between Fault Tolerance and Reconfiguration in Cellular Systems
Authors: Lukas Sekanina, Vladimir Drabek
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

Recently, hardware researchers have promptly begun to investigate alternative computational principles to the conventional ones. The main signs of these principles are inspiration in biology and their direct hardware implementation. Evolvable hardware, cellular computing or embryonic electronics are the most important examples. This paper describes different approaches to configuration, reconfiguration and fault tolerance implementation of two-dimensional cellular system. Simplicity of the cell, vast parallelism, and the connection locality are considered as the design restrictions.
Evolution of on-line process fragments families
Authors: A. B. Kaba, J.-C. Derniame
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Online product families and their development processes are reusable and evolutive when they are fragmented enough. These fragments are useful if they are meaningfully interconnected. In a cooperative development process, the process entities are regularly updated from several locations. Moreover, the fragments can be differently interpreted, depending on the usage context and the adopted point of view. This paper addresses the access and transient update mechanisms for a family of configurable and evolutionary process fragments.
Ranking Primitive Recursions: the Low Grzegorczyk Classes Revisited
Authors: Stephen J. Bellantoni
Venue:  (1996)

Traditional results in subrecursion theory are integrated with the recent work in ``predicative recursion'''' by defining a simple ranking $\rho$ of all primitive recursive functions. The hierarchy defined by this ranking coincides with the Grzegorczyk hierarchy at and above the linear-space level. Thus, the result is like an extension of the Schwichtenberg/M\"uller theorems. A natural series of classes is also obtained down to the first level when primitive recursion is replaced by recursion on notation. This paper is a companion to the author''s work showing how to use a suitable definition of proof rank to define weak subsystems of arithmetic containing unbounded inductions.
The fast wavelet X-ray transform
Authors: Rob A. Zuidwijk, Paul M. Zeeuw
Venue:  (1999)

The wavelet X-ray transform computes one-dimensional wavelet transforms along lines in Euclidian space in order to perform a directional time-scale analysis of functions in several variables. A fast algorithm is proposed which executes this transformation starting with values given on a cartesian grid that represent the underlying function. The algorithm involves a rotation step and wavelet analysis/synthesis steps. The number of computations required is of the same order as the number of data involved. The analysis/synthesis steps are executed by the pyramid algorithm which is known to have this computational advantage. The rotation step makes use of a wavelet interpolation scheme. The order of computations is limited here due to the localization of the wavelets. The rotation step is executed in an optimal way by means of quasi-interpolation methods using (bi-)orthogonal wavelets.
A Behavioral Model of Web Traffic
Authors: Hyoung-Kee Choi, John O. Limb
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

The growing importance of Web traffic on the Internet makes it important that we have accurate traffic models in order to plan and provision. In this paper we present a Web traffic model designed to assist in the evaluation and engineering of shared communications networks. Because the model is behavioral we can extrapolate the model to assess the effect of changes in protocols, the network or user behavior. The increasing complexity of Web traffic has required that we base our model on the notion of a Web-request, rather a Web page. A Web-request results in the retrieval of information that might consist of one or more Web pages. The parameters of our model are derived from extensive traces of Web traffic. Web-requests are identified by analyzing not just the TCP header in the trace but also the HTTP headers. The effect of Web caching is incorporated into the model. The model is evaluated by comparing independent statistics from the model and from the trace. The reasons for differences between the model and the traces are given.
Synchronous Consensus for Dependent Process Failures
Authors: Flavio P. Junqueira, Keith Marzullo
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present a new abstraction to replace the t of n assumptionused in designing fault-tolerant algorithms. Thisabstraction models dependent process failures yet it is assimple to use as the t of n assumption. To illustrate this abstraction,we consider Consensus for synchronous systemswith both crash and arbitrary process failures. By consideringfailure correlations, we are able to reduce latency andenable the solution of Consensus for system configurationsin which it is not possible when forced to use algorithmsdesigned under the t of n assumption. We show that, ingeneral, the number of rounds required in the worst casewhen assuming crash failures is different from the numberof rounds required when assuming arbitrary failures. Thisis in contrast with the traditional result under the t of nassumption.
Design of the APIC: A high performance ATM host-network interface chip
Authors: Z. D. Dittia, J. R. , . Cox Jr, G. M. Parulkar
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

We present the design of a high performance ATM host-network interface for multimedia workstations and servers. At Washington University, as part of an ARPA-sponsored gigabit local ATM testbed, we are building a prototype of this interface that can support a sustained aggregate bidirectional data rate of 2.4 Gbps. The centerpiece of our interface design is a custom chip called the APIC (ATM port interconnect controller). Multiple such chips can be interconnected to yield a desk-area network (DAN) which would serve as a high speed I/O interconnect for the host computer. This paper details the internal design of the APIC chip, and outlines some of its key features. Noteworthy among these are: connection caching, transmit pacing, cell batching, remote control, and support for AAL-0, AAL-5, multipoint, and loopback connections. We have chosen to defer to a later paper the details pertaining to several other features which provide support for zero-copy, improved interrupt handling, direct control of the chip from user-space, and efficient buffering and demultiplexing.
A Hybrid (logic+I/sub DDQ/) Testing Strategy Using An Iterative Bridging Fault Filtering Scheme
Authors: Tzuhao Chen, I. N. Hajj
Venue: Proceedings of the 1997 IEEE International Workshop on IDDQ Testing (IDDQ '97) (1997)

In this paper we propose a new hybrid (logic+I/sub DDQ/) testing strategy for efficient bridging fault (BF) detection. In our strategy, logic and I/sub DDQ/ testings are applied in sequence so that BFs that can be detected by the logic testing need not be targeted by the I/sub DDQ/ testing. The logic test generation is done via an iterative BF filtering in which fault coverage is maximized through test set augmentation. As a result only a small number of BFs need to be targeted by the I/sub DDQ/ test generator. Experiments show that this approach is capable of reaching very high BF coverage with a composite (logic+I/sub DDQ/) test set with very few I/sub DDQ/ vectors.
Simultaneous Demand-Driven Data-Flow and Call Graph Analysis
Authors: Gagan Agrawal
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Recently, there has been much interest in performing demand-driven data-flow analysis in software development environments. Demand-driven analysis techniques compute data-flow fact(s) for a particular program point, rather than computing data-flow information for the entire program.The existing work in this area, however, assumes that the {\em static call graph} is available for the entire program. Constructing exhaustive call graphs can be extremely time and space inefficient for large object-oriented programs. Therefore, it is desirable to compute the call graph information on a demand basis as well. In this paper, we present an algorithm for demand-driven construction of reaching definitions, which also performs call graph analysis on a demand basis.
A Definitional Approach to the Combination of Functional and Relational Programming
Authors: Martin Aronsson
Venue:  (1991)

We show how the programming language GCLA can be used to naturally express both relational and functional programs in an integrated framework. We give a short introduction to GCLA, and to the theory of partial inductive definitions on which GCLA is based. GCLA is best regarded as a logic programming language, but instead of saying that the query follows from the program in some a priori given logic, we say that the program defines the logic in which the query is proved. We then demonstrate how to implement both relational and functional programs as well as a combination of them in GCLA. 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
Modelling of accordion effect in corrugated steel web with concrete flanges
Authors: L. Huang, H. Hikosaka, K. Komine
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Prestressed concrete girders with corrugated steel webs are one of the promising concrete-steel hybrid structures applied to highway bridges. Prestress can be efficiently introduced into the concrete flanges due to the so-called "accordion effect" of the corrugated web. In this paper, a simple approach is presented to account for three-dimensional phenomena of the accordion effect using link-type elements within a two-dimensional finite element model. The vertical links are given a very high stiffness to fully transmit vertical shear force, whereas the horizontal link stiffness is given a value calculated from the out-of-plane bending of a folded plate forming each trapezoidal corrugation. Viability of the approach is demonstrated through comparison of experimental and numerical results for a large-scale specimen of a prestressed concrete beam with corrugated steel web.
A Design for Inter-Operable Secure Object Stores (ISOS)
Authors: Carl Lagoze, Robert McGrath, Ed Overly, Nancy Yeager
Venue:  (1995)

We describe a distributed object-based design for repositories in a digital library infrastructure. This design for Inter-operable Secure Object Stores, ISOS, defines the interfaces to secure repositories that inter-operate with each other, clients, and other services in the infrastructure. We define the interfaces to ISOS as class definitions in a distributed object system. We also define an extension to CORBA security that is used by repositories to secure access to themselves and their contained objects.
Speech-based and video-supported indexing of multimedia broadcast news
Authors: Yoshihiko Hayashi, Katsutoshi Ohtsuki, Katsuji Bessho, Osamu Mizuno, Yoshihiro Matsuo, Shoichi Matsunaga, Minoru Hayashi, Takaaki Hasegawa, Naruhiro Ikeda
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper describes an automatic content indexing system for news programs, with a special emphasis on its segmentation process. The process can successfully segment an entire news program into topic-centered news stories; the primary tool is a linguistic topic segmentation algorithm. Experiments show that the resulting speech-based segments are fairly accurate, and scene change points supplied by an external video processor can be of help in improving segmentation effectiveness.
Feature-Oriented Image Enhancement with Shock Filters, 1
Authors: Leonid I. Rudin, Stanley Osher
Venue:  (1989)

No abstract available.
Using Reversible Computing To Achieve Fail-Safety
Authors: P. G. Bishop
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

This paper describes a fail-safe design approach that can be used to achieve a high level of fail-safety with conventional computing equipment which may contain design flaws. The method is based on the well-established concept of reversible computing. Conventional programs destroy information and hence cannot be reversed. However it is easy to define a virtual machine that preserves sufficient intermediate information to permit reversal. Any program implemented on this virtual machine is inherently reversible. The integrity of a calculation can therefore be checked by reversing back from the output values and checking for the equivalence of intermediate values and original input values. By using different machine instructions on the forward and reverse paths, errors in any single instruction execution can be revealed. Random corruptions in data values are also detected. An assessment of the performance of the reversible computer design for a simple reactor trip application indicates that it runs about ten times slower than a conventional software implementation and requires about 20 kilobytes of additional storage. The trials also show a fail-safe bias of better than 99.998% for random data corruptions, and it is argued that failures due to systematic flaws could achieve similar levels of fail-safe bias. Potential extensions and applications of the technique are discussed.
Statistical Multiplexing and Admission Control Policy for Smoothed Video Streams Using e-PCRTT Algorithm
Authors: Ofer Hadar, Shlomo Greenberg
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Recent Improvements in telecommunication and computer technologies have made integrated services packet-switched networks possible. It is expected that a significant portion of future networks will carry prerecorded video and that traffic in applications such as Video on Demand (VoD) will include high-fidelity audio, short multimedia clips, and full-length movies. In this paper we study the effect of video rate smoothing, of prerecorded VBR sources, on network utilization and admission control of VoD system, such that the end users receive satisfactory service. The enhancement piecewise constant rate transmission and transport (e-PCRTT) algorithm is used as the smoothing algorithm, which utilizes equal size intervals. The effect of smoothing on statistical characteristics of multiplexed video streams is explored. We found that synchronization between the smoothing intervals can significantly improve the efficiency of the smoothing process by reducing the number of bandwidth changes and the rate variability of the multiplexed stream.In this paper, we propose an admission control policy in which a bandwidth rate-plan is negotiated at stream initiation. The algorithm is evaluated via simulation for VoD Scenario.
Modelling of time-dependent behaviour of polycrystalline rocks
Authors: M. Mühlbauer, J. Kruis, Z. Bittnar
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Time-dependent behaviour of geomaterials plays an important role in stability of deep underground structures as trans-alpine tunnels, open underground galleries, waste disposal structures, etc. The conditions that may cause the loss of stability are, among others, viscous rock, deviatoric stress state, water income resulting in swelling, etc. The examples of existing tunnels in Europe built in creeping rocks and problems they display, provide a motivation for more sophisticated study of the time-dependent phenomena in rock environment for future tunnel projects.The long-term behaviour of a crystalline rock has been modelled as a viscoplastic problem. The Perzyna types of material models which are based on so-called overstress concept have been used. Particularly, the visco-plastic model proposed by Lemaitre and Chaboche for metals and Bingham model have been exploited. The Lemaitre-Chaboche model showed to be suitable also for other materials, as polycrystalline rocks as anhydrite or rate sensitive geomaterials as clays. The model contains three parameters (viscosity parameter, stress exponent and strain hardening parameter), the Bingham model is based on one viscosity parameter.The finite element method has been used for solving mentioned problem. Numerical solution is based on velocity formulation of equilibrium conditions because the presented problem is time-dependent. Explicit method has been applied to the equilibrium conditions and results into three basic phases. The overstress, the increment directions, the value of viscous function and the right hand side are computed in the first phase of the algorithm. The second phase contains solution of equation system. The last phase contains same steps as the first one plus computation of strains, stresses and internal variables increments. All computations were carried out on software developed at our department.
Circumventing/Identifying Faults Effects
Authors: B. Ayeb, A. Farhat, R. Kefi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The literature includes a variety of techniques to address the Byzantine Generals Problem that we call the Byzantine approach. While the main goal within the Byzantine framework is to circumvent and mask the effect of unreliable units (e.g., traitors), much research has been done on identifying (i.e., demasking) unreliable units. This is often called fault identification in system diagnosis. This paper focuses on the identification of unreliable units within the Byzantine framework. Beyond its theoretical interest, an identification of faulty units contributes to accelerate the agreement process itself and drastically reduce the number of messages exchanged between units. The main features of this work are twofold. It does not impose additional assumptions or constraints on the agreement process. It limits the overhead for identifying unreliable units- the identification process is in O(n3).
Tool Specification with GTSL
Authors: Wolfgang Emmerich
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The definition of software development methods encompasses the definition of syntax and static semantics of formal languages. These languages determine documents to be produced during the application of a method. Developers demand language-based tools that provide document production support, check syntax and static semantics of documents and thus implement methods. Method integration must determine inter-document consistency constraints between documents produced in the various tasks. Tools must, therefore, be integrated to implement the required method integration and check or even preserve inter-document consistency. The focus of this paper is on the specification of such integrated tools and outlines the main concepts of the object-oriented tool specification language GTSL.
On the Use of Abstract Data Types to Specify the Modules of a System
Authors: Oystein Helle
Venue:  (1981)

NO SUPPLIED 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