Download or read book Obliq 3D Tutorial and Reference Manual written by Marc A. Najork and published by . This book was released on 1994 with total page 128 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Obliq-3D is an interpreted language that is embedded into the 3D animation system Anim3D. Anim3D is based on a few simple, yet powerful constructs that allow a programmer to describe three-dimensional scenes and animations of such scenes. Obliq-3D, by virtue of its interpretive nature, provides the programmer with a fast turnaround environment. The combination of simplicity and fast turnaround allows application programmers to construct non-trivial animations quickly and easily. The first half of this report contains a tutorial to Obliq-3D, which develops the various concepts of the animation system. The second part contains a reference manual, which describes the functionality of Obliq-3D module by module."

Download or read book Visual Obliq written by Krishna Bharat and published by . This book was released on 1995 with total page 46 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Datacad Reference Manual written by and published by DATACAD LLC. This book was released on 1997 with total page 1270 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Computer Human Interaction in Symbolic Computation written by Norbert Kajler and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 222 pages. Available in PDF, EPUB and Kindle. Book excerpt: The well attended March 1994 HIse workshop in Amsterdam was a very lively con ference which stimulated much discussion and human-human interaction. As the editor of this volume points out, the Amsterdam meeting was just part of a year-long project that brought many people together from many parts of the world. The value of the effort was not only in generating new ideas, but in making people aware of work that has gone on on many fronts in using computers to make mathematics more understandable. The author was very glad he attended the workshop. * In thinking back over the conference and in reading the papers in this collection, the author feels there are perhaps four major conclusions to be drawn from the current state of work: 1. graphics is very important, but such features should be made as easy to use as possible; 2. symbolic mathematical computation is very powerful, but the user must be able to see "intermediate steps"; 3. system design has made much progress, but for semester-long coursework and book-length productions we need more tools to help composition and navigation; 4. monolithic systems are perhaps not the best direction for the future, as different users have different needs and may have to link together many kinds of tools. The editor of this volume and the authors of the papers presented here have also reached and documented similar conclusions.

Download or read book The Internet in 3D written by Rae A. Earnshaw and published by Morgan Kaufmann. This book was released on 1997 with total page 424 pages. Available in PDF, EPUB and Kindle. Book excerpt: A network connection can provide a window to the world of information, where data programs can be exchanged with millions of other users. New styles of virtual and multimedia information are now being developed that will become an integral part of these interactions. "The Internet in 3D" covers this exciting and fast-moving area, discussing techniques and applications of using 3D multimedia on the Internet.

Download or read book Processes are in the Eye of the Beholder written by Leslie Lamport and published by . This book was released on 1994 with total page 44 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "A two-process algorithm is shown to be equivalent to an N-process one, illustrating the insubstantiality of processes. A completely formal equivalence proof in TLA (the Temporal Logic of Actions) is sketched."

Download or read book DeckScape written by Marc H. Brown and published by . This book was released on 1995 with total page 30 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "This report describes DeckScape, an experimental World-Wide Web browser based on a deck metaphor. A deck consists of a collection of Web pages, and multiple decks can exist on the screen at once. As the user traverses links, new pages appear on top of the current deck. Retrievals are done using a background thread, so all visible pages in any deck are active at all times. Users can move and copy pages between decks, and decks can be used as a general-purpose way to organize material, such as hotlists, query results, and breadth-first expansions."

Download or read book Distributed Active Objects written by Marc H. Brown and published by . This book was released on 1996 with total page 38 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Program Fragments Linking and Modularization written by Luca Cardelli and published by . This book was released on 1997 with total page 46 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Module mechanisms have received considerable theoretical attention, but the associated concepts of separate compilation and linking have not been emphasized. Anomalous module systems have emerged in functional and object-oriented programming where software components are not separately typecheckable and compilable. In this paper we provide a context where linking can be studied, and separate compilability can be formally stated and checked. We propose a framework where each module is separately compiled to a self-contained entity called a linkset; we show that separately compiled, compatible modules can be safely linked together."

Download or read book To Provide Or to Bound written by Monika R. Henzinger and published by . This book was released on 1996 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In dynamic graph algorithms the following provide-or- bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log n) to O(log n)."

Download or read book A Logic of Object oriented Programs written by Martín Abadi and published by . This book was released on 1998 with total page 58 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "We develop a logic for reasoning about object-oriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for self-reference in objects. It is much like a type system for objects with subtyping, but our specifications go further than types in detailing pre- and postconditions. We intend the logic as an analogue of Hoare logic for object-oriented programs. Our main technical result is a soundness theorem that relates the logic to a standard operational semantics."

Download or read book Continuous Monitoring and Performance Specification written by Sharon E. Perl and published by . This book was released on 1998 with total page 88 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Reports 100 150 written by and published by . This book was released on 1998 with total page 78 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Autodesk 3D Studio written by and published by . This book was released on 1992 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Proving Possibility Properties written by Leslie Lamport and published by . This book was released on 1995 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "A method is described for proving 'always possibly' properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA (Temporal Logic of Actions) specifications."

Download or read book Modularity in the Presence of Subclassing written by Raymond Paul Stata and published by . This book was released on 1997 with total page 122 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Classes are harder to subclass than they need be. This report addresses this problem, showing how to design classes that are more modular and easier to subclass without sacrificing the extensibility that makes subclassing useful to begin with. We argue that a class should have two interfaces, an instance interface used by programmers manipulating instances of the class, and a specialization interface used by programmers building subclasses of the class. Instance interfaces are relatively well understood, but design principles for specialization interfaces are not. In the context of single inheritance, we argue that specialization interfaces should be partitioned into class components. A class component groups part of a class's state together with methods to maintain that state. Class components establish abstraction boundaries within classes, allowing modular replacement of components by subclasses. Achieving this replaceability requires reasoning about each component as an independent unit that depends only on the specifications of other components and not on their implementations. We introduce the concept of abstract representation to denote the view of a class's state given in its specialization interface. This view is more detailed than the view used to describe instances of the class, revealing details that describe the interfaces between class components. It is less detailed than the actual implementation, hiding implementation details that should not be exposed even to specializers. We also consider multiple inheritance, specifically, Snyder's model of encapsulated multiple inheritance. We advocate separating class components into individual classes called mixins. Instantiable classes are built by combining multiple mixins. With the mixin style of design, class hierarchies have more classes than in equivalent single-inheritance designs. These classes have smaller, simpler interfaces and can be reused more flexibly. To explore the impact our ideas might have on program design, we consider classes from existing libraries in light of the proposed single- and multiple-inheritance methodologies. To explore the impact our ideas might have on language design, we present two different extensions to Java, one that provides a level of static checking for single-inheritance designs, and another that adds the encapsulated model of multiple inheritance."

Download or read book An Efficient Matching Algorithm for a High throughput Low latency Data Switch written by Thomas L. Rodeheffer and published by . This book was released on 1998 with total page 70 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "This paper focuses on two desired properties of cell-based switches for digital data networks: (1) data cells should not be detained inside the switch any longer than necessary (the work-conserving property) and (2) data cells that have been in the switch longer (older cells) should have priority over younger cells (the order-conserving property). A well-known, but expensive design of a work- and order-conserving switch is the output-queued switch. A different switch design is the speedup crossbar switch, in which input buffers are connected to output buffers through a crossbar that runs at a multiple (called the speedup) of the external cell rate. A matching algorithm determines which cells are forwarded through the crossbar at any given time. Previous work has proposed a matching algorithm called the lowest output occupancy first algorithm (LOOFA). It is known that a LOOFA switch with speedup at least 2 is work-conserving. We propose a refinement of LOOFA called the lowest output occupancy and timestamp first algorithm (LOOTFA). The main result of this paper is that a LOOTFA crossbar switch is work- and order-conserving provided that the speedup is at least 3. We prove this result and consider some generalizations."