APL2003 Conference Schedule
|
|||||
Wednesday, June 11
|
|||||
| 2 pm | Opening remarks | ||||
| 2:30 - 3:45 | Tutorial 1 |
NavplanR - software to help pilots plan their flights by Dan Baronet
How to turn a project into running code from planification to distribution using J. You will see how this particular small project evolved, from piloting requirements and software specifications to packaging and going through test suites. You will see how to use of some of J's features like the project manager and the packager. |
|||
| 3:45 - 4:00 |
Coffee Break
| ||||
| 4:00 - 5:00 | Vendor Forum I | Dyalog APL's John Daintree presents an overview of recent enhancements to Dyalog APL: announcing Version 10 | |||
| 6:00 - ? |
Informal Evening Gathering |
||||
Thursday, June 12
|
|||||
|
9 am |
Announcements, etc. | ||||
| 9:15 - 10:15 | Concurrent Sessions |
Inner-Product Scan for Interest & Annuities by Curtis Jones The inner-product scan allows a straightforward 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. |
Simulating Ordered RGB Color Triples Using J
by Linda Alvord & Tama Traberman A proposal of how to connect the properties of color called hue and value. We order colors using J and then simulate a palette of RGB color triples. The new palette arranges colors close in order from dark to light. From the suggested order for all 16,777,216 colors, we select a 216-color web palette which orders its colors by both hue and value. Using the RGB palette we create images from data arrays that indicate the relative magnitudes of the data. Contour maps follow easily. The proposed model serves as an excellent way to develop arrays in J. The model also demonstrates the process by which we make conjectures, create prototypes and assess their strengths and weaknesses. |
||
| 10:15 - 10:30 |
Coffee Break
| ||||
| 10:30 - 11:30 | Concurrent Sessions |
The Calculation of the Square Matrix Determinant
by Antonio Annibali and Francesco Bellini The calculation of a square matrix determinant is a typical matrix algebra operation and this, applied to big matrixes, asks for complex calculations. There are different algorithms for the calculation of a determinant, with different features for the aesthetic, functional and efficiency point of view. Besides two traditional methods such as • the algorithmic definition, • the first Laplace’s theorem, during this work will be shown another method based on the availability (in the APL environment) of the primitive function {del}, that performs the calculation of the inverse matrix of a non singular square matrix. |
A Generating Function for the Combinatorial Full-Span Sub Array Structure of a Regular Array with Some Applications to APL
by Ronald I. Frank, DPS 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, the 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. |
||
| 11:30 - 12:30 | Plenary Session | Hector Garcia-Molina of Stanford University | |||
| 12:30 - 2:00 | Lunch | ||||
| 2:00 - 2:45 | Vendor Forum II | MicroAPL presents APLX: their cross-platform APL for PC, Mac and Linux | |||
| 2:45 - 3:30 | Vendor Forum III | APL2000 presents an overview of enhancements to the APL2000 development environment | |||
| 3:30 - 3:45 |
Coffee Break
| ||||
| 3:45 - 4:45 | Concurrent Sessions |
Simulated APL Session Manager
by Kyosuke Saigusa Many individuals around us will definitely benefit if they are given chances to use and learn APL without worrying about pre-decision financial or procedural obligations whatsoever. This paper proposes such a tool which can be distributed free without violating any commercial rules or business ethics. This application package emphasizes the following aspects of APL2: 1. Practicality- more business oriented 2. Conformity-with the common practice 3. Portability-across computing environments 4. Support of Japanese Language |
Multidimensional Corporate Analysis: Analytical and Graphical Approaches
by Antonio Annibali & Francesco Bellini The internal auditing activities in a public or private firm are fundamental in order to measure the performances and represent these through the use of indexes (ratio analysis), tables and graphs that synthesize the financial, economic and corporate aspect of the firm life and development. Consider m the values of the fundamental elements taken from successive balance sheets, during n years. Every set of m values can be represented, from a geometrical point of view, with a point in the m dimensional space and the ordered set of n points provides the representation of the corporate performance according to the variation of the temporal variable t. The ratio analysis, normally used by corporate analysts, consists in a set of a meaningful functions derived from the above mentioned values. |
||
| 4:45 - 5:30 | SIGAPL Meeting | ||||
| 6:00 - ? | Informal Evening Gathering | ||||
Friday, June 13
|
|||||
|
9 am |
Announcements, etc. | ||||
| 9:15 - 10:15 | Concurrent Sessions |
INSTRUCTOR - A New Technique of Guiding the User in Simulation Software
by Georg Reichard A new guidance concept is presented, which encourages third parties to provide additional comprehensive information to users of highly complex (e.g. simulation-) software, helping them to flatten the steep learning curve by understanding the impact of decisions made during the input/design process. |
A New “Dual-View” Diagram of Array Structure
by Ronald I. Frank, DPS First we present a new structural decomposition of regular arrays. 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. 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. |
||
| 10:15 - 10:30 |
Coffee Break
| ||||
| 10:30 - 11:30 | Concurrent Sessions |
Vendor Forum IV
Smart Arrays for the APL Programmer - James Brown
SmartArrays captures the array processing capability of the APL Languages and makes it available in Java, C++, and C#. This presentation will show how SmartArrays faithfully captures the array methods of APL and extends them in natural ways. The author hopes that the availability of such a facility will spread the array programing paradigm to the greater programming audience and increase the value of the array skills that APL programmers possess. |
Useful Formulas for Multidimensional Arrays
by Stephen Eriksson-Bique Previous work focused on developing a complete yet concise calculus for programming multidimensional arrays that is based mainly on the essential mathematical properties of computations, that permits the expression of mathematical algorithms as in APL, and that balances abstraction and application. Primitives are defined in an architecture-independent way using algebraic notions, mainly constructors, as in the theory of lists, instead of freely defining operations as in APL or ad hoc using indices. Multidimensional arrays are defined so that they possess a single type, which is a primitive concept independent of other data types or an implementation. Traditional notation for arrays is frequently more of an obstacle than an aid. We review useful formulas and identities that lack many of the indices typically required. We show how the new notation helps to simplify some of the definitions and proofs. We give some examples starting from the specification of a problem. |
||
| 11:30 | Plenary Session | Jim Kurose of the University of Massachusetts Computer Science Department | |||
| 12:30 - 2:00 | Lunch | ||||
| 2:00 - 2:45 | Vendor Forum V | IBM presents an overview of APL2 enhancements | |||
| 2:45 - 3:30 | Concurrent Sessions |
BITSLICE: Representation without Taxation
by Bob Bernecky (presented by Roy Sykes) A high-performance utility for parallel bit-level indexing of array data. Our results demonstrate the importance of bit arrays as a fundamental data type and of being able to view array data at the Boolean array level. |
Bit Arrays from Row and Column Sums
by R. G. Selfridge A number of fields use bit arrays to study distributions. In ecology such an array serves as a presence/absence array to describe the distribution of species across islands. In such an environment one concept is that the total number of species on a given island will stay fixed, as will the total number of islands populated by a given species. Thus a primary constraint is fixed row/column sums. Now we need to create sample bit-matrices that meet these row and column sum constraints. If such matrices are 'properly random' then conclusions are drawn about the actual physical solution. It is our intent to discuss the possible ways to generate such bit-matrices and describe a new algorithm for generation. |
||
| 3:30 - 3:45 |
Coffee Break
| ||||
| 3:45 - 4:45 | Session / Tutorial |
An Algorithm to Compute All Full-Span Sub Arrays of a Regular Array
by Dr. Ronald I. Frank, DPS We present an algorithm that explicitly generates all full-span regular sub arrays of a given N dimensional regular array. The algorithm can be viewed as generating all j-dimensional full span sub arrays for fixed j, for j = 0 to j = N. We first list some lemmas and definitions, and then give the algorithm that is based upon the knowledge gained from a new expansion. We give both an heuristic summary and a more detailed example. There will be both Java 1.4 code and an APL WS available. |
Tutorial III -
Functional GUI Programming
by Paul S. Mansour Conventional wisdom holds that APL is not well-suited for GUI design. Many APL programmers either reflexively think that “the grass is greener” some other place or simply assume a tool like Visual Studio is the inevitable, optimal choice. Using a functional approach, the GUI forms designer paradigm offers more power and flexibility over conventional forms designers in that it scales to more complex forms design in a way that, say, Visual Studio does not. |
||
| 7:00 - 9:00 | APL2003 Banquet |
Speaker: Stan Kelly-Bootle
Jargon: Its Cause and Cure |
|||
Saturday, June 14
|
|||||
| 9 am | Announcements and Closing Remarks | ||||
| 9:15 - 10:15 | Tutorial |
Tutorial IV - Developing GUI Applications with APL2
by David Liebtag This tutorial will introduce attendees to the fundamental concepts in APL2 GUI application development and work through the development process of several applications. The tutorial will cover: |
|||
| 10:15 - 10:30 |
Coffee Break
| ||||
| 10:30 - 11:30 | Invited Presentation |
APL Web Services, Peer-Peer, Server-Client: Automating Web Deployment of Existing APL Applications by Fred Waid, APL2000, Inc. |
|||
| 11:45 - 12:45 | Invited Presentation |
Faster Than A Speeding Bullet: Performance Enhancements for APL using Assembly Language by Roy A. Sykes, Jr. |
|||
| 12:45 - 2:00 | Lunch - End of APL2003 Conference | ||||