By Marshall C. Yovits
This quantity in a chain detailing concepts in undefined, software program and the theory/design/applications of pcs, is worried with reusable software program parts, object-oriented modelling, discrete occasion simulation, and neurocomputing formalisms in desktop studying and visualization.
Read or Download Advances in Computers, Vol. 33 PDF
Similar object-oriented design books
Particular variation utilizing Java 2 general version in particular covers in simple terms the normal version of model 1. three of the Java software program improvement package (SDK). It starts with a chain of speedy refreshers for Object-oriented programming and Java basics, together with applet programming and threads, to make sure that readers are in control.
Scala is an object-oriented programming language for the Java digital desktop. as well as being object-oriented, Scala is usually a useful language, and combines the simplest methods to OO and sensible programming. In Italian, Scala ability a stairway, or steps certainly, Scala helps you to step as much as a programming atmosphere that comes with the very best fresh considering in programming language layout whereas additionally letting you employ your entire latest Java code.
Liferay Portal is the major open-source firm portal framework that makes use of Java and net 2. zero applied sciences. internet portals usually functionality as some degree of entry to info at the world-wide-web. net portals, reminiscent of Yahoo! , current details from various resources in a unified method. apart from the quest engine ordinary, internet portals supply different companies akin to e–mail, information, inventory costs, infotainment, and diverse different beneficial properties.
Extra resources for Advances in Computers, Vol. 33
It is not surprising that it is observed in current practice, though, because a typical reusable software component is based directly on the designs, data structures, and algorithms found in standard computer-science textbooks: classical stacks, lists, symbol tables, sorting algorithms, and so on. Difficulties arising from their potential reusability were not at issue in the original designs of these structures, and their performance as the basis for reusable components suffers as a result. Even in cases where an abstract design is a good one, there may be no efficient implementation currently on the market.
The ensures clause of Push now says nothing about the value of x upon return from the operation, so the implementer is free to return any value for that parameter. It is no longer necessary to copy an Item in order to implement Push. This 40 BRUCE W. WEIDE et a / . change leaves us with the following (final) redesign of the Stack-Template: concept Stack-Template context parameters type Item mathematics theory STRING-THEORY is STRING-THEORY-TEMPLATE (math [Item]) interface type Stack is modeled by STRING exemplar s initially s = EMPTY operation Push (s : Stack, x : Item) s = POST ( # s, # x) ensures operation Pop (s : Stack, x : Item) requires not (s = EMPTY) ensures # s = POST (s, x) operation Is-Empty (s : Stack) returns control ensures Is-Empty iff (s = EMPTY) end Stack-Template An interesting and obvious question is whether the redefined behavior of the Push operation is really what a client program might want.
An OBJ specification of an abstract component can be thought of as a set of equations that define a mathematical theory, or it can be treated as an executable program by interpreting the defining equations as rewrite rules. The performance of a concrete component that is constructed in this way may or may not be acceptable. We do not further consider this method of implementation because one of the basic features of a reusablesoftware-components industry will surely be a potential client’s freedom to choose among various concrete components that realize the same abstract component.