1532988
Symbolic Computation and Parallel Software
Two aspects of parallelism as related to symbolic computing are presented: (1) the implementation of parallel programs for the factorization of polynomials, and (2) the automatic derivation and generation of parallel codes for finite element analysis. The former illustrates the use of parallel programming to speed up symbolic manipulation. The latter shows how symbolic systems can help create parallel software for scientific computation. Through these two case studies, the promise of parallelism in symbolic computation is demonstrated.
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.
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.
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.
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
5347997
WME: towards a web for mathematics education
Reported is an approach for Web-based Mathematics Education (WME). The WME framework is a distributed system that aims to create a Web for mathematics education. Components of the WME framework include the Mathematics Education Markup Language (MeML) for page markup, regular Web servers to deliver pages, WME Page Processors to enable common Web browsers to receive MeML pages, and a variety of WME services (mathematical and educational) to supply power and interactivity to MeML pages. The MeML language supports the creation of efficient, effective, and dynamic mathematics education content. The WME architecture is designed so that mathematics education contents (static and/or dynamic) and remote WME services can be built independently, maintained independently, deployed easily, and still interoperate and reinforce one another on a global scale.
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.
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.
6086436
3D Line Image Analysis - A Heuristic Parallel Approach with Learning and Recognition
Abstract A heuristic parallel approach for (3d) line image analysis is introduced by using the concept of coordinated graph, layered graph representation, and parallel matching techniques and it significantly reduces the time required for dealing with three-dimensional line image analysis problems. Their fundamental properties and the concept of finite representations are investigated, and an interactive and iterative recognition algorithm with learning and recognition as a part of each other is presented. Several interested examples including curved and disconnected line images are illustrated. In addition to its importance in theoretical studies, this approach can also be applied to 3d object recognition, image processing, and computer vision in industrial, military, and medical fields.
42651
Analytical design of maximally flat FIR fractional Hilbert transformers
Recently, the classical Hilbert transformer is generalized into the fractional Hilbert transformer which could be implemented optically. This modification of the Hilbert transform adds an additional degree of freedom on the Hilbert transformer and improves the performance of the transform. In this paper, the design of FIR filters fractional Hilbert transformer is proposed. The FIR filters are designed in the maximally flat sense. The impulse responses of the filters are uniquely solved and expressed in simple analytic forms. The impulse responses can be exactly expressed as fixed point binary values. The resulting frequency responses approximate the ideal one very well in the middle-frequency band. Efficient hardware realization structures are obtained based on the symmetric properties of the impulse responses. Several design examples with various transform parameters and various filter orders are presented. Some examples of 1-D/2-D edge detection are given. The examples show that the proposed FIR filter can enhance the selected edges very efficiently.
2857808
A knowledge-based segmentation algorithm for enhanced recognition of handwritten courtesy amounts
Abstract A knowledge-based segmentation algorithm to enhance recognition of courtesy amounts on bank checks is proposed in this paper. This algorithm uses multiple contextual cues to enhance segmentation and recognition. The system described extracts context from the handwritten numerals and uses a syntax parser based on a deterministic finite automaton to provide adequate feedback to enhance recognition. Further feedback is provided by a simple legal amount decoder that determines word count and recognizes several key words (e.g. thousand and hundred). This provides an additional semantic constraint on the dollar section. The segmentation analysis module presented is capable of handling a number of commonly used styles for courtesy amount representation. Both handwritten and machine written courtesy and legal amounts were utilized to test the efficacy of the preprocessor for the check recognition system described in this paper. The substitution error was reduced by 30–40% depending on the input check mix.