Robert E. Beasley · Apress eBooks · 2020
An array is a container that holds data while it is being manipulated by a computer program. More specifically, it is a data structure that consists of a collection of elements of the same type, where each element contains its own value and is identified by one or more indices (a.k.a., subscripts). Arrays can be one-dimensional or multidimensional. The elements of a one-dimensional array are referenced by a single index, the elements of a two-dimensional array are referenced by two indices, and so on. It is not uncommon to see arrays of three or more dimensions. The total number of elements in an array is its length. Each dimension of an array has a lower bound (i.e., the index of the first element of the array) and an upper bound (i.e., the index of the last element of the array). Since arrays are zero based in C# by default, the index of the first element in a one-dimensional array is [0], the index of the second element is [1], and so on. The index of the first element in a two-dimensional array is [0, 0], the index of the second element is [0, 1], and so on. An array is statically allocated. That is, its capacity cannot be altered once it is declared. An array is considered an internal data structure because it resides in RAM and only remains there until the program that utilizes it terminates. Thus, the data in an array is said to be nonpersistent. This is in contrast to a database table, which is considered an external data structure because it resides on a peripheral device (e.g., a magnetic disk) and remains there even after the program that utilizes it terminates. Thus, the data in a database table is said to be persistent.
Cited by 1
J. B. Hext · ACM SIGPLAN Notices · 1975
An examination is made of the different ways in which APL and ALGOL 68 refer to cross-sections or other subsets of an array. It is noted that APL allows a variety of reference operations but no reference variables; on the other hand, ALGOL 68 has reference variables and parameters, but only one array operation. Two kinds of array reference are distinguished - the linear and the nonlinear - and a proposal is made for representing a linear reference by a simple form of descriptor, suitable for processing in hardware. The reference operations are then divided into those which give linear results and those which give non-linear. By retaining only the linear ones, it is possible to combine the main advantages of the APL and ALGOL 68 operations into a single system. A discussion is given of some of the issues involved, including those of dynamic types and bounds.
Cited by 0
American Institute of Aeronautics and Astronautics, Inc. eBooks · 2019
Cited by 0
Perry Xiao · 2018
Cited by 0
P. C. Capon, Roland N. Ibbett · ACM SIGPLAN Notices · 1975
In this paper the operation of the machine on code compiled for typical array operations is discussed. The performance of programs written in this straight forward way is compared with the possible gain through using hardware array orders within the MU5 framework. It is necessary to first outline the MU5 order code.
Cited by 1
Kamala Krithivasan, Rani Siromoney · International Journal of Computer Mathematics · 1974
Array automata acting on scenes (two dimensional tapes) are defined. The set of scenes accepted by array automata are proved to be equivalent to the set of arrays generated by array grammars. Certain operators like substitution, homomorphic replication and insertion are extended to sets of arrays. These operators yield interesting classes of pictures.
Cited by 24
K. G. Subramanian, Đỗ Long Vân, P. Helén Chandra et al. · Fundamenta Informaticae · 2008
In this paper, we consider a class of two-dimensional array grammars, called parallel contextual array grammars, that extend the contextual operations on strings to arrays in a naturalway and generate languages of pictures of rectangular arrays. Several classes of these array grammars and the resulting families of picture languages are considered. Necessary conditions for picture languages to be contained in these classes are obtained and the relations between these families are also established.
Cited by 16
Tariq M. Arif · Synthesis lectures on mechanical engineering · 2020
Cited by 0
Denis Gopan, Thomas Reps, Mooly Sagiv · Minds at UW (University of Wisconsin) · 2008
We present a numeric analysis that is capable of reasoning about array operations. In particular, the analysis is able to establish that all elements of an array have been initialized ("an array kill"), as well as to discover numeric constraints on values of initialized array elements, and to verify the correctness of comparisonbased sorting algorithms. The analysis is based on the combination of canonical abstraction and summarizing numeric domains. We present a prototype implementation of the analysis and discuss our experience with applying this prototype to several kernel examples.
Cited by 1Open access
Jianbo Yao, Jianshi Li · 2005
Array operations exist in many nontrivial programs. Array operations can cause subtle information leaks. Many type systems of secure information flow have been developed, however, so far little type system attention to secure information flow of discretional array operations. This paper allows array as first-class value and encodes multidimensional array as array of array by alias array. The soundness of our type system is proved by noninterference.
Cited by 0
Emilio Barrios, Hector Alarcon · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2016
ALMA Science operations activities in Chile are responsibility of the Department of Science Operations, which consists of three groups, the Array Operations Group (AOG), the Program Management Group (PMG) and the Data Management Group (DMG). The AOG includes the Array Operators and have the mission to provide support for science observations, operating safely and efficiently the array. The poster describes the AOG process, management and operational tools.
Cited by 0
Muszalski, Marcin · Jagiellonian University Repository (Jagiellonian University)
W pracy zaprezentowano bibliotekę do obsługi operacji na wielowymiarowych tablicach z nazwanymi wymiarami. Bibliotekę zaimplementowano w języku C++ z wykorzystaniem standardu C++20. Biblioteka zapewnia wygodny interfejs dla użytkownika, dokonywanie walidacji wymiarów w czasie kompilacji oraz unikanie tworzenia wartości pośrednich podczas obliczeń.
Cited by 0
Troy Alan Jensen, Lopezville Rd · 2005
The EVLA will require a reliable quality assurance program for testing the numerous antenna feeds that will be fabricated over the duration of the project. An integral component of this test plan is an Outdoor Antenna Test Range (OATR). This report describes the accomplishments and problems encountered in the development of the OATR during the last quarter of 2004. Proof of concept test results and budgetary information are also provided.
Cited by 0
T. J. Wilkes · 2025
Implements efficient 'NumPy'-like broadcasted operations for atomic and recursive arrays. Besides linking to 'Rcpp', 'broadcast' does not use any external libraries in any way; 'broadcast' was essentially made from scratch and can be installed out-of-the-box. The implementations available in 'broadcast' include, but are not limited to, the following. 1) Broadcasted element-wise operations on any 2 arrays; they support a large set of relational, arithmetic, Boolean, string, and bit-wise operations. 2) A faster, more memory efficient, and broadcasted abind-like function, for binding arrays along an arbitrary dimension. 3) Broadcasted ifelse-like, and apply-like functions. 4) Casting functions, that cast subset-groups of an array to a new dimension, cast nested lists to dimensional lists, and vice-versa. 5) A few linear algebra functions for statistics. The functions in the 'broadcast' package strive to minimize computation time and memory usage (which is not just good for efficient computing, but also for the environment).
Cited by 0Open access
Ranko Lazić, Tom Newcomb, Bill Roscoe · 2008
Cited by 0
Hairong Wang · University of the Witwatersrand, Johannesburg Institutional Repository on DSpace (University of the Witwatersrand, Johannesburg) · 2014
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Master of Science. Johannesburg, 2014.
Cited by 2Open access
Thomas W. Christopher, Ralph W. Wallace · 1986
Cited by 0
Clemens Grelck, Sven‐Bodo Scholz, Kai Trojahner · 2004
Cited by 5
Clemens Grelck, Sven‐Bodo Scholz, Kai Trojahner · Lecture notes in computer science · 2004
Cited by 16
Frank Tsui · SMARTech Repository (Georgia Institute of Technology) · 1974
Cited by 0