## SEARCH

#### Institution

##### ( see all 527)

- University of Manchester 36 (%)
- University of London 29 (%)
- University of Calgary 22 (%)
- University of Edinburgh 20 (%)
- Hochschule der Bundeswehr 15 (%)

#### Author

##### ( see all 1062)

- Bornat, Richard 29 (%)
- Birtwistle, G. M. 22 (%)
- Coleman, Derek 21 (%)
- Bromm, Karl Udo 16 (%)
- Schneider, Wolfgang 16 (%)

#### Subject

##### ( see all 33)

- Computer Science [x] 1117 (%)
- Computer Science, general 541 (%)
- Theory of Computation 453 (%)
- Software Engineering/Programming and Operating Systems 141 (%)
- Programming Techniques 97 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 1117 matching Articles
Results per page:

## Doubly deterministic tabled OL systems

### International Journal of Computer & Information Sciences (1979-08-01) 8: 335-347 , August 01, 1979

A tabled OL system is doubly deterministic if its tables (developmental programs) are deterministic and its choice of table is also deterministic. Numerous results on DDTOL systems are presented, mainly decidability results. The putative biological importance of the model is also discussed and its choice motivated.

## DEMOS A System for Discrete Event Modelling on Simula

### DEMOS A System for Discrete Event Modelling on Simula (1979-01-01) , January 01, 1979

## Translating Statements and Declarations

### Understanding and Writing Compilers (1979-01-01): 105-117 , January 01, 1979

Chapters 5 and 6 show the tree-walking mechanism to its best advantage, working on the translation of source program constructs whose efficient implementation is crucial to the efficiency of the object program. Code fragments for statements are rarely so crucial, particularly when the expressions which they contain are efficiently translated. This chapter therefore shows example procedures which translate statements by linking together the code fragments discussed in chapters 5, 6 and 9 and in section III.

## The OSA Project Design and Formal Specification of an X.25 Based Open Transport Layer and its Protocols

### Kommunikation in verteilten Systemen (1979-01-01) 22: 51-86 , January 01, 1979

The paper presented should be a kind of tutorial for those who have a basic understanding of the open systems interconnections philosophy as well as of software technological problems in developing reliable systems. It mainly consists of four parts, namely

it explains the requirements for the Transport Layer as given in the Reference Model (of Open Systems Interconnections) document;

it gives a general design for the RM Transport Layer meeting these requirements; this design is based on simple building blocks that may be easily described and specified;

it characterizes a subset of the building blocks of the general design suitable for an X.25 based RM Transport Layer (having almost identical services used and provided as those presently discussed in the PIX group);

it discusses the simplifications obtained from this decomposition of the whole Transport Layer into uniform building blocks and the technique we apply for formally specifying the modules (the building blocks contain) as well as the building blocks, themselves.

what intentions the Reference Model document associates with its Transport Layer, as well as

The intention of this paper is to provide a sound basis for a common understanding ofwhat intentions the Reference Model document associates with its Transport Layer, as well as

how a layer may be designed such that advanced technologies for producing reliable software may be applied.

## Optimieren und Korrigieren von Programmen

### Programmierbare Taschenrechner in Schule und Ausbildung (1979-01-01): 48-52 , January 01, 1979

### Zusammenfassung

Das Optimieren (lat. optimum) von Programmen umfaßt jene Maßnahmen, die den Einsatz von Programmen ökonomisch günstig beeinflussen. Dazu gehört beim PTR 1

das Einsparen von Programmschritten

2die Beschränkung auf möglichst wenig Zahlenspeicher

3die Verkürzung von Rechenzeiten.

## Algebraic extensions of arbitrary integral domains

### Symbolic and Algebraic Computation (1979-01-01) 72: 134-139 , January 01, 1979

The theory of using a polynomial to create an algebraic field extension is well-defined in mathematical literature and the technique is commonly used in symbolic computation. Even when extensions are not over a field, monics polynomials are often used to extend rings (e.g., the Gaussian Integers can be formed as ℤ[*x*]/*x*^{2}+1). As long as only algebraic integers are introduced (i.e., the extension is monic), the computational methods are straightforward and the algorithms and supporting theory are known.

The intent of this paper is to develop the theory and algorithms necessary to understand and accommodate the use of non-monic extensions in a symbolic computing system. None of the computer algebra systems currently in operation allow such extensions. It will be shown, however, that these restrictions place an unnecessary bound on user capabilities since non-monic extension algorithms can be implemented practically and efficiently.

## Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls

### Graph-Grammars and Their Application to Computer Science and Biology (1979-01-01) 73: 127-138 , January 01, 1979

The way in which *Pfn* (sets and partial functions) provides a setting for the semantics of deterministic programs [and *Rel* (sets and relations) provides a setting for the semantics of nondeterministic programs] has led us to axiomatize the notion of a *partially-additive monoid*. We show that programs incorporating procedure calls may be represented by graph grammars, with one non-terminal and production for each distinct procedure (including the program itself). Program execution may be construed as a process of interpretation of graphs obtained by repeated graph substitution. We show that the resultant *interpretive semantics* yields the same result as our theory of the *canonical fixpoint* for *abstract recursion schemes* introduced in an earlier paper.

## Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion

### Symbolic and Algebraic Computation (1979-01-01) 72: 291-300 , January 01, 1979

In a recently published paper [4] the author described a new algorithm for multivariate polynomial factorization over the integers. One important feature of this algorithm is the variable-by-variable p-adic construction of all factors in parallel. To perform such p-adic construction of the factors, a second p-adic construction for multivariate "correction coefficients" is used. This second p-adic construction is in an "inner loop" of the construction process. Therefore its efficiency is of central importance to the entire factoring algorithm. In [4], an iterative algorithm is used for this second p-adic construction. A timing analysis of this iterative algorithm is included. A new recursive method for the p-adic construction of the correction coefficients is presented and analyzed.

Timing comparisons, both theoretical, and empirical are made of these two approaches. The recursive algorithm is shown to be much more efficient.

## Electrical Effects in Nonlinear Physico-Chemical Systems: Field Chemical Wave Interaction and Bio-Self Electrophoresis

### Pattern Formation by Dynamic Systems and Pattern Recognition (1979-01-01) 5: 144-154 , January 01, 1979

The presence of membrane potentials in electrophysiological systems is shown to be capable of profoundly influencing the course of biomorphogenesis. We focus on the problem of self organization in the egg of *Fucus* and develop a simple model that has many of the qualitative features of this system.

A theory of the effects of electric fields on spatio-temporal patterning is developed. The induction of qualitatively new types of waves upon the imposition of an applied field is shown. The theory is applied to model systems including the FKN kinetics.

To develop a rigorous foundation for these theories a multiscale formalism is developed in terms of the (small) ratio of the Debye length to the reaction-diffusion length. The theory naturally incorporates the important charge neutrality coupling of the ionic fluxes that is often neglected or incorrectly accounted for.

## Einführung

### Der Verkehrsfluß auf Schnellstraßen (1979-01-01) 3: 1-10 , January 01, 1979

### Zusammenfassung

Die stürmische Entwicklung der Technik im zurückliegenden Jahrhundert hat das Leben des Menschen grundlegend verändert. So hat er heute die Möglichkeit, an beliebigen Orten auf Energie aus weitverzweigten Netzen zur eigenen Verfügung zuzugreifen, Nachrichten und Informationen in Bruchteilen von Sekunden über den Erdball auszutauschen sowie Güter und Personen in hoher Geschwindigkeit über große Distanzen zu befördern, was in früheren Jahren als utopischer, unerreichbarer Traum galt.