Results 291 to 300 of about 6,738,763 (341)
Some of the next articles are maybe not open access.

Structured data in structural analysis software

26th Structures, Structural Dynamics, and Materials Conference, 1985
This paper discusses the use of computer data structures in finite- element structural analysis programs. A number of data structure types that have been shown to be useful in such programs are introduced and described. A simple finite-element model is used to demonstrate how the given set of data structure types naturally lend themselves to developing
Donald L. Kunz, A.Stewart Hopkins
openaire   +3 more sources

Hybrid structure: data structuring for data flow

Microprocessing and Microprogramming, 1989
Abstract The asynchronous nature of the data flow model of computations allows exploitation of maximum inherent parallelism in many application programs. However, before the data flow model of computations can become a viable alternative to the control flow model of computations, one has to find practical solutions to some major problems such as ...
Ali R. Hurson, B. Lee
openaire   +2 more sources

The structure of “data structures”

Proceedings of the ACM '81 conference on - ACM 81, 1981
A data structure is defined to be a 4-tuple D, F, S, A>. D and F are Domain and Function definitions which define the externally observable behavior; S and A are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students.
openaire   +2 more sources

Data Structures

2012
Data structures are variables that store more than one value. There are many different kinds of data structures. We have already been working with one kind, arrays (e.g., vectors and matrices). We use vectors and matrices when we want to be able to loop through them (or, essentially, have this done for us using vectorized code).
openaire   +4 more sources

Using Data Structures

1981
The Oxford English Dictionary defines the word “recursion” in the following way: RECURSION. [Now rare or obs. 1626]. A backward movement, return.
Chris Mellish, William F. Clocksin
openaire   +2 more sources

Dynamic Data Structures

1978
The types of variable in Pascal programs have been classified (in chapter 7) as unstructured and structured. The structured types have been further subdivided into elementary structured types and advanced structured types. The variables themselves may also be divided into two groups, depending on the manner of their creation.
A. M. Addyman, I. R. Wilson
openaire   +2 more sources

Structure in tRNA data

Biochimie, 1982
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri   +2 more
openaire   +3 more sources

The data structure Array

1982
So far, we have given each variable an individual name. This is impractical, if many variables are necessary that are treated in the same way and are of the same type, such as, for example, if a table of data is to be constructed. In this case, we wish to give the entire set of data a name and to denote individual elements with an identifying number, a
openaire   +2 more sources

On the dynamization of data structures

BIT, 1988
We present a simple dynamization method that preserves the query and storage costs of a static data structure and ensures reasonable update costs. In this method, the majority of data elements are maintained in a single data structure, and the updates are handled using ``smaller'' auxiliary data structures.
Rao, Nageswara S. V.   +2 more
openaire   +2 more sources

Dynamically structured data

Software: Practice and Experience, 1981
AbstractWhile the control structures in recent programming languages are structured, the data structures are still primitive. This paper examines data structures and operations on them, and proposes some new features in programming languages. These new features are principally in the areas of data description and data usage.
I. R. Wilson, Nazim H. Madhavji
openaire   +3 more sources

Home - About - Disclaimer - Privacy