Results 271 to 280 of about 3,370,595 (309)
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose/objective We propose a novel lattice deployment for spatially fractionated radiotherapy (SFRT) treatments. In this approach, a larger diameter high‐dose sphere is centrally placed in the bulky tumor mass and surrounded by smaller diameter high‐dose spheres.
Joshua Misa +2 more
wiley +1 more source
SIAM Journal on Computing, 1991 The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques.
Louchard, Guy +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Structural representation of data structures
The European Physical Journal Plus, 2014Study of the morphology of proteins, and their 3D structure, supports investigations of their functions and represents an initial step towards protein-based drug design. The goal of this paper is to define techniques, based on the geometrical and topological structure of protein surfaces, for the detection and analysis of sites of potential protein ...
CANTONI, VIRGINIO +3 more
openaire +3 more sources
Hybrid structure: data structuring for data flow
Microprocessing and Microprogramming, 1989Abstract 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, 1981A 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
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
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
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
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
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
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
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
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
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
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