The proceedings contain 14 papers. The topics discussed include: simulating ordered GRB color triples using J to create images with gradients in both hue and value;multidimensional corporate analysis: analytical and g...
ISBN:
(纸本)1581136684
The proceedings contain 14 papers. The topics discussed include: simulating ordered GRB color triples using J to create images with gradients in both hue and value;multidimensional corporate analysis: analytical and graphical approaches;NAVPLANR - flight planning software for pilots;BITSLICE: representation without taxation;useful formulas for multidimensional arrays;an algorithm to compute all full-span sub arrays of a regular array;a new 'dual-view' diagram of array structure;a generating function that counts the combinatorial full-span sub array structure of a regular array with some applications to apl;interesting inner-product scans;finite group tables in apl;instructor - a new technique of guiding the user in simulation software;simulated apl session manager;and bit arrays from row and column sums.
This paper presents a novel approach for integrating arrays with access time 61(l) into functional languages. It introduces n-dimensional arrays combined with a type system that supports hierarchies of array types wit...
详细信息
This paper presents a novel approach for integrating arrays with access time 61(l) into functional languages. It introduces n-dimensional arrays combined with a type system that supports hierarchies of array types with varying shape information as well as a shape-invariant form of array comprehension called WITH-loop. Together, these constructs allow for a programming style similar to that of arrayprogramminglanguages such as apl. We use Single Assignment C (SAC), a functional C-variant aimed at numerical applications that is based on the proposed design, to demonstrate that programs written in that style can be compiled to code whose runtime performance is competitive with that of hand-optimized Fortran programs. However, essential prerequisites for such performance figures are a shape inference system integrated in the type system as well as several high-level optimizations. Most notably of these is With Loop Folding, an optimization technique for eliminating intermediate arrays.
We describe a highly parallel (SIMD within SPMD) tokenizer for the apl language, itself written in apl. The tokenizer does not break any new ground in the world of parallel computation, but does serve the didactic pur...
详细信息
ISBN:
(纸本)9781581136685
We describe a highly parallel (SIMD within SPMD) tokenizer for the apl language, itself written in apl. The tokenizer does not break any new ground in the world of parallel computation, but does serve the didactic purpose of demonstrating that a large amount of parallelism exists in non-numeric computation. We plan to release the APEX apl Compiler, including the tokenizer, under the GNU Public License.
Many individuals benefit if they are given chances to use and learn apl without worrying about pre-decision financial or procedural obligations whatsoever. A tool which can be distributed free without violating any co...
详细信息
ISBN:
(纸本)9781581136685
Many individuals benefit if they are given chances to use and learn apl without worrying about pre-decision financial or procedural obligations whatsoever. A tool which can be distributed free without violating any commercial rules or business ethics is proposed. This tool is an application package created using "Workstation apl2 for Multi-platforms Version 2", an IBM product announced in May, 2002.
The inner-product scan allows a straight-forward calculation of interest-bearing accounts or annuities without a loop in apl. It allows arbitrary deposit (or withdrawal) and interest each period. A defined scan operat...
详细信息
ISBN:
(纸本)9781581136685
The inner-product scan allows a straight-forward calculation of interest-bearing accounts or annuities without a loop in apl. It allows arbitrary deposit (or withdrawal) and interest each period. A defined scan operator for associative functions is provided to improve performance by avoiding the repeated reductions of increasingly long vectors that require +/@@@ n rather than n products. The idea of inner-product scans is developed through the use of rotation matrices to draw polygons and spirals and a connection matrix to implement a shift register that generates random bits.
Using a radically new way of representing arrays, we present a formalism that expands (or decomposes) a regular array into a weighted sum of null arrays. We show that this "polynomial" expansion (1.16) exhau...
详细信息
ISBN:
(纸本)1581136684
Using a radically new way of representing arrays, we present a formalism that expands (or decomposes) a regular array into a weighted sum of null arrays. We show that this "polynomial" expansion (1.16) exhaustively represents the regular full-span array sub structure of the original array. Full-span means full length in the dimensions used. The polynomial is a generating function whose coefficients of which count and indicate the shape of the regular full-span sub arrays of the given regular array. These results are all structural. They do not use knowledge of the particular data contents of the arrays. We apply this new decomposition to catenation and lamination and uncover some new insights into array structure. The decomposition and the algebraic results provide a unifying view and new formalism for regular multi-dimensional arrays. It has application wherever multi-dimensional arrays are used, particularly to generalized hyper cube architectures, OLAP hierarchical data structures, and array oriented languages. It subsumes some previous results. Some of these applications are indicated with their bibliography. There is a combinatorial argument on the shape vector that could generate the coefficients, but it does not give the structural insight of this approach. Copyright 2003 ACM.
It is known from group theory that multiplication tables for finite groups are Latin squares. These basic Latin squares have proved useful for solving various problems, for example, problems of memory management in pa...
详细信息
ISBN:
(纸本)9781581136685
It is known from group theory that multiplication tables for finite groups are Latin squares. These basic Latin squares have proved useful for solving various problems, for example, problems of memory management in parallel computing systems, organizing party games, communications networking, computer imaging, and experimental design. We show how the problem of multiplication tables for a finite group G of order N can be solved using apl. The solution is based on Lagrange's and Cayley's theorems for finite groups: the order of a subgroup of a finite group G is a divisor of the order of the group and every group G of order N is isomorphic with a subgroup of the group of permutations of N objects (symmetric group SN). We demonstrate that using apl interactively offers a powerful, consistent, and simple notation for dealing with the elements of the symmetric group SN. Group tables for the groups of order 4, 6, and 8 are used to illustrate the method. Possible simplifications of the method are outlined.
First we present a new structural decomposition of regular arrays that is derived elsewhere [4]. Second, we list a few special cases of the decomposition. Finally we give 11 examples of arrays, their decomposition, th...
详细信息
ISBN:
(纸本)1581136684
First we present a new structural decomposition of regular arrays that is derived elsewhere [4]. Second, we list a few special cases of the decomposition. Finally we give 11 examples of arrays, their decomposition, their egg crate view, and their dual view (which better represents their true structure). We present this graphical presentation form (a diagrammatic notation) for a regular array. The notation is a "dual" of the usual "egg crate" view. This view makes clear and intuitive the otherwise unintuitive results derived from the newly found array expansion in [4]. The array expansion results are all structural therefore so are these pictorial results. They do not use knowledge of the particular data contents of the arrays. Copyright 2003 ACM.
The internal auditing activites in a public or private firm are fundamental in order to measure the performances and represent these through the use of indexes, tables and graphs that synthesize the financial, economi...
详细信息
ISBN:
(纸本)9781581136685
The internal auditing activites in a public or private firm are fundamental in order to measure the performances and represent these through the use of indexes, tables and graphs that synthesize the financial, economic and corporate aspects of the firm life and development. The procedure can be generalized to the m≥3 cases, using as indexes the functions of the m interested values and considering the level hypersurfaces of these function. It is evident that an index is not necessarily characterized by a division between two values but, the most meaningful index could be banally the difference between the given values.
暂无评论