Stubbs, D. F., Data Structures with Abstract Data Types and Pascal. Pacific Grove, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....data types and encapsulation and the use of recursion as problem solving tools. It covers the use of abstraction as a way of simplifying problems and developing good solutions a good introduction to this style of program development. An introduction to the modern theory of data types is either [SW85] or [SW87] These books stresses data abstraction and the separation of the design and implementation of data structures. The programming language used is either Pascal or Modula 2 depending on the edition; hence, these books would make an excellent rst text on programming. 7.6 Formal methods ....

D. F. Stubbs and N. W. Webre. Data Structures with abstract data types and Pascal. Brooks/Cole Publishing Company, Monterey, CA, 1985.

....in new versions of PRP to obtain a better speedup. I anticipate that most applications suited for PRP are extensive computations where the ratio of work performed by the servers is high compared to the size of the in and out parameters. Typically, the applications will have an order of magnitude [Stubbs 89] of O(n 2 ) or higher. Accordingly, it is my opinion that the need for future improvements on the PRP system will be at the other end of the scale, i.e. to o#er the user a more flexible and user friendly parallel system. I will therefore outline some areas that should be examined in future ....

....in parallel with PRP. This problem is an NP complete problem [Garey 79] The salesman wants to visit a number of interconnected cities, and would like to know the shortest roundtrip when all of the cities are to be visited, and every city is to be visited only once. The order of magnitude [Stubbs 89] for an algorithm with no cuto# computing an instance of the Traveling Salesman problem is O( n 1) However, we will use an algorithm with cuto# which will give us the opportunity to try an instance with 14 cities. To obtain the the cuto#s, we use a modified version of the greedy algorithm. ....

Stubbs D. F. & Webre N. W. (1989): "Data Structures with Abstract Data Types and Pascal - Second Edition.", Brooks/Cole Publishing Company, p.p. 31-33.

....to implement the data model described in this paper and to include it in a prototype Marine Information System (MIS) by the end of 1994. The implementation will be based on C and a relational DBMS (Oracle) since no object oriented DBMS is available for this project. An abstract data type (ADT) (Stubbs and Webre, 1985) will be bulit on top of the database, to bridge the gap between the object oriented conceptual data model and the relational logical model. This ADT will handle the mapping between the defined classes in C and the flat tables in the database. In this way the application using the ADT need not ....

Stubbs, D. F. and Webre, N. W. (1985), Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing Company, Pacific Grove, California.

....abstract graph, because it abstracts the common concepts of different graphs, hiding the unnecessary details. In order to implement abstract graphs it is necessary to parameterise them with the data type of the objects held by the graph nodes. This conforms with the standard definition of a graph [Stubs89] and [Kruse87] But in particular application domains, namely in data modelling, it is very useful to have at hand information about the graph itself. For instance, the shape of a node in a graph drawing. This can be expressed by another data type. As this type will carry information about the ....

Stubbs, Daniel F. and Webre, Neil W., "Data Structures With Abstract Data Types and Pascal", second edition, Thompson Information, 1989.

....should be grouped in modules or libraries, so that they can be utilized by any application needing them. Figure 11 shows such an organization of functions in a MIS. The modules indicated there can be realized as abstract data types, ADT s, where details of data structures and operations are hidden [SW85]. This would ensure access through a well defined interface, and avoid unauthorized manipulation of data. All parts may not contain exactly the same routines in every scenario, but each application can incorporate the routines it needs from the common modules. Format conversion User Marine ....

....the types of data sets described earlier in this report. First, we need to register the spatial and temporal coverage of a data set. As there are no built in data types or functions for either latitude, longitude, elevation or time, these have to be implemented as a module or an abstract data type [SW85] on top of the DBMS. For recording the temporal span of a data set there is a need to specify time accurately, i.e. a point of time should be given by a date (year, month and day of month) and the time of day (hour, minute, second and millisecond) Today only a DATE data type is available, so ....

D.F. Stubbs and N.W. Webre, "Data structures with Abstract Data Types and Pascal", Brooks/Cole Publishing Company, 1985.

....with neighboring facets, and we represent the intersection line in the edge data structure, as a position and direction vector pair. From this one can compute the cone of normal directions to the intersection line of the facets, if required. The graph is implemented as adjacency lists (see [7]) The basic exploration algorithm is indicated in figure 7. We discuss the mathematics and details behind each of the steps. 4.1 Notation We need to quantify the faceted sensor surface in the sensor space of the robot. We will do so only for our 3 sensor robot, where the tools of vector ....

D.F. Stubbs and N.W. Webre, Data structures with abstract data types and Pascal, Brooks/Cole Publishing Company, 1989

.... with object oriented features such as the ability to define abstract data types, hierarchies of object classes and inheritance, amongst others [Bundock and Raper, 1992] At present there are no spatial or temporal data types or operations in the standard SQL, so we will build an abstract data type [Stubbs and Webre, 1985] to bridge the gap between our spatio temporal data model and the tables of the SQL database. Other implementations of an extensible GIS have already used extensions of SQL with promising results [Vijlbrief and van Oosterom, 1992] Using object oriented databases and data modeling techniques has ....

Stubbs, D. F. and Webre, N. W. (1985), Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing Company, Pacific Grove, California.

....search tree could be used; however, the input data ordering is unknown. In the degenerate case, this could be equivalent in performance to searching a linear list of vertex values, and this is unacceptable. A balanced binary search tree, termed an AVL search tree, overcomes these limitations [11]. It never degenerates to the equivalent performance of searching a linear list because its balance is maintained as each element is inserted in it. It also meets the requirements for being able to traverse through the data and efficiently allow range searching, which is used to determine ....

Daniel F. Stubbs and Neil W. Webre, Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing Company, 1989.

No context found.

Stubbs, D. F., Data Structures with Abstract Data Types and Pascal. Pacific Grove, 1989.

No context found.

Daniel F. Stubbs and Neil W. Webre. Data Structures with Abstract Data Types and Pascal. Brooks/Cole Publishing Company, Pacific Grove, California, 1985.

No context found.

D.F. Stubbs and N.W. Webre. Data Structures: with Abstract Data Types and Pascal. Brooks/Cole Publishing Company, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC