40949007
Pluggability Issues in the Multi Protocol
There are several advantages to providing communication links between independent scientific applications. Important problems to solve include data and control integration. Solving these problems separately is an essential aspect of the design and implementation of a protocol for mathematics. The Multi Protocol (MP) specification addresses the exchange of mathematical data by focusing only on the data encoding issues. In this way, MP can be plugged into various existing data transport mechanisms addressing control integration, or augmented by a higher control-related protocol layer. Our implementation of MP is independent of the data transport mechanism and can work with several devices. An application puts/gets data to/from MP buffers which communicate with the transport device through an abstract device interface. This paper describes the general design of the interface between MP and a transport device and the lessons we have learned during its implementation.
10322452
SUI: a system independent user interface for an integrated scientific computing environment
The design and implementation of a Scientific User Interface is presented. Written in the C language, SUI is a window-menu-mouse oriented graphical user interface that is designed to provide a modern and integrated computing environment for scientific work. SUI can serve multiple client systems in parallel including symbolic, numeric, graphics and document formatting systems. SUI achieves hardware and operating system independence as well as network transparency by employing the X11 protocols and achieves client system independence by defining a client-SUI protocol that is simple and effective. Features of SUI includes input editing, history, 2-D mathematical expression display, interactive selection of subexpressions, interactive display and manipulation of 2-D and 3-D plots of mathematical functions, cut and paste with syntax translation, command templates, incremental 2-D display of mathematical input, and interactive configuration. A prototype system demonstration is planned for ISSAC'90
16442663
Parallel univariate polynomial factorization on shared-memory multiprocessors
Using parallelism afforded by shared-memory multiprocessors to speed up systems for polynomial factorization is discussed. The approach is to take the fastest known factoring algorithm for practical purposes and parallelize key parts of it. The univariate factoring algorithm consists of two major tasks (a) factoring modulo small integer primes and (b) EEZ lifting and recovery of true factors. A C coded system PFACTOR that implements (a) in parallel is described in detail. PFACTOR is a stand-alone parallel factorizer that can take input from a file, a pipe or a socket connection over a network. It can also be used interactively as a UNIX command. PFACTOR consists of parallel selection of primes, automatic balancing of work, parallel Berlekamp algorithm, and parallel reconciliation of degrees of factors modulo different primes. Actual timings on the Encore Multimax show the effectiveness of the approach. Work on part (b) is still on going.
17343502
IAMC architecture and prototyping: a progress report
Internet Accessible Mathematical Computation (IAMC) is a distributed framework to supply mathematical computing powers over the Internet. Presented are conceptual and experimental work on the IAMC architecture, a client prototype (Dragonfly), client GUI, a server prototype (Starfish), the Mathematical Computation Protocol (MCP), mathematical data encoding, and the external compute engine interface.
18326845
Parallel univariate p-adic lifting on shared-memory multiprocessors
Parallelization of univariate p-aclic lifting, a procedure important in modem gcd and factorization algorithms, is presented. The strategy is to take the fastest known sequential algorithm and parallelize its key steps: lift basis, residue, correction coefficients, updating factors, cldecting true factors, and reformulation for continued lifting. Both linear and quadratic lifting are investigated. A new procedure for reformulating the lifting after finding true factors speeds up the sequential and the parallel lifting. PLIFT, a software package written in C for a 26-processor Sequent Balance, implements the parallel algorithms. Timing results are given in an appendix,
28403175
GI/S: A Graphical User Interface For Symbolic Computation Systems
The design and implementation of GI/S, a Graphical user Interface for Symbolic computation systems, is described. The system provides a multiple window environment for the high-resolution 2-D display of mathematical expressions, the ability to select and manipulate parts of expressions with a mouse, and graphics plotting of mathematical expressions. GI/S also provides command line editing and a history mechanism for editing and re-executing past commands. GI/S is written in Franz Lisp for the Macsyma system and has been implemented on the Tektronix 4404 workstation.
26302852
Some New Results on Isotonic Array Grammars
28879338
Reasoning in Practical Situations
An automatic reasoning system usually consists of the following major components: (1) a formal language that represents knowledge, (2) a semantics that defines meaning and truth value in the language, (3) a set of inference rules that derives new knowledge from existing knowledge, (4) a memory that stores knowledge, and (5) a control mechanism that chooses premises and rules in each inference step. The first three components are usually referred to as a logic, or the logical part of the reasoning system, and the last two as an implementation of, or the control part of the system.
12790595
Optimally scheduling N customer arrival times for a single-server system
Abstract In this paper, we investigate the problem of scheduling a finite number of customer arrivals for a single-server system. Under the assumptions that the customers arrive at the system by scheduled appointments and they request random amount of times for service, the question is: what are the ‘best’ arrival times so that the total operating cost is minimized? This type of queueing problem has important applications in production systems as well as in service systems. Using phase-type distribution functions and matrix algebraic manipulation, we are able to obtain recursive expressions for the customer flow-time distributions, from which the mean and variance, or higher moments, can be easily computed. A computational procedure is developed that efficiently evaluates the mean flow-times for large number of customers that need to be scheduled. This procedure is integrated with a nonlinear program that determines the optimal customer arrival times.
15278727
LOCI: Load Shedding through Class-Preserving Data Acquisition
An avalanche of data available in the stream form is overstretching our data analyzing ability. In this paper, we propose a novel load shedding method that enables fast and accurate stream data classification. We transform input data so that its class information concentrates on a few features, and we introduce a progressive classifier that makes prediction with partial input. We take advantage of stream data's temporal locality -for example, readings from a temperature sensor usually do not change dramatically over a short period of time -for load shedding. We first show that temporal locality of the original data is preserved by our transform, then we utilize positive and negative knowledge about the data (which is of much smaller size than the data itself) for classification. We employ both analytical and empirical analysis to demonstrate the advantage of our approach.
16442037
Handwritten Bank Check Recognition Of Courtesy Amounts
In spite of rapid evolution of electronic techniques, a number of large-scale applications continue to rely on the use of paper as the dominant medium. This is especially true for processing of bank checks. This paper examines the issue of reading the numerical amount field. In the case of checks, the segmentation of unconstrained strings into individual digits is a challenging task because of connected and overlapping digits, broken digits, and digits that are physically connected to pieces of strokes from neighboring digits. The proposed architecture involves four stages: segmentation of the string into individual digits, normalization, recognition of each character using a neural network classifier, and syntactic verification. Overall, this paper highlights the importance of employing a hybrid architecture that incorporates multiple approaches to provide high recognition rates.