bluuebunny/crossref_metadata_2025 huggingface dataset:
Set of programs for automated digital systems design
Authors: Přibáñ M. , Jakl M. , Janků A. , Kunc P. , Veselý J.
Published: January 2007

Current trend of a computer development is characterized especially by large changes on a field of technology, which offers new logical solutions of a computer design. To follow that trend is necessary to use a computer equipped by appropriate problem oriented software for verifying and realizing a new design. Getting out of that fact was some years ago in the Research Institute for Mathematical Machines in Prague started a long-termed plan called "Automation of Digital Systems Design". Nowadays is realized the first part of this plan, consisting of tasks of the technical design. In the area of a logical design was created the program system for coding and testing of microprograms used for computer EC 1021 and now it is generalized for other devices. In the area of a system design we begin to use a language for the multilevel description of a computer structure, followed by programs for computer description processing and simulation. In this paper is described a set of programs for the technical design and for the design of microprograms.
Generation of Steiner tree connections in a barrier-free environment
Authors: Smith R. J. , Cao C. V.
Published: January 2007

We have recently developed an algorithm for the generation of Steiner trees in a barrier-free environment. The algorithm and related mathematical material appear elsewhere (1); the purpose of this note is to informally describe the concepts underlying our approach, and to demonstrate the computational feasibility of the method. Our problem model consists of a two-dimensional rectilinear grid containing nodes which must be connected by orthogonal line segments. The objective is to connect the set of nodes with a collection of lines having minimum total length. As will be demonstrated, our technique may be manually applied to problems of 25-50 points; much larger problems could be solved by utilizing computer processing. While the algorithm has not yet been proven to produce minimum length trees, we maintain that typical results are at least very nearly minimal. We hope to stimulate critical reactions to the following material by presenting it informally in this Newsletter.
A data structure for the description and the handling of engineering drawings
Authors: Cavagna C. , Cugini U.
Published: January 2007

The specifications of a data structure are essentially linked to the model which it is wished to represent, to the functional links which it is wished to obtain amongst the various data and the action which it is wished to take on such structure.
CAD for LSI
Authors: Klomp J. G. M.
Published: January 2007

CAD for LSI design means a total package from basic circuit analysis up to programs which generate tapes for numerical controlled pattern generators and testing equipment.
Clustering methods as partial solutions to the space allocation problem
Authors: Frew Robert Simpson
Published: January 2007

The paper presents a three phase approach to the space allocation problem. The first phase is to identify the activities that can be considered as members of component groups by classification methods. Secondly to find organizational form for each of the groups and to locate the members into the layout. Thirdly to find organizational form for the whole system and to locate the groups in the system.
Database concepts used in the LOGOS computer-aided design system
Authors: Gingell Robert A. , Risen Dennis A. , Rose Charles W.
Published: January 2007

Some criteria for the database construction of a Computer-Aided Design (CAD) System are specified. These criteria are discussed in terms of the LOGOS CAD system. From the discussion of the LOGOS implementation, a generalized approach to database design for CAD systems is proposed.
Evolution of a spatial allocation system
Authors: Jackson Barry
Published: January 2007

The evolution of methods of finding the "proper" location of a set of architecturally defined spaces runs into unwarranted complexity as the problem approaches "real world" constraints. The problem strains at its boundaries, produces anomalies, does not respond neatly to modeling, and has not produced any change in the architect's concept of built form. It does puzzle analysts and continues to provide both a methodical challenge and a forum for discussion of some of the underlying meanings of "design".
Site selection and placement techniques
Authors: Loomis H. H.
Published: January 2007

The manufacturing-related tasks in the engineering design of digital systems are those processes which translate a logic design into a functioning physical system. That is, they begin with a description of the system as an interconnection of logic units (such as gates, flip-flops, counters, memories, ALU's, etc.) transforming it into a description of the placement of physical modules and the wiring which interconnects specific terminals on these modules. This portion of the design process has been the one which first saw substantial application of computing, vastly improving the speed, accuracy and capacity of the design organization. It is in this area still that the bulk of the production digital design automation systems are categorized.
A note on the application of differential files to computer aided design
Authors: Atkinson M. P.
Published: January 2007

Recently Severence and Lohman [1] have drawn attention to several attractive properties of differential files, which enable economic preservation of data integrity and allow improved utilisation of different storage devices. They observed that use of Bloom filters would permit the composite file to perform very nearly as well for access requests as a simple file. Stocker [2] has shown that a differential file may be expected to have a better cumulative performance for updates than a simple file.
Use of standards in a production environment
Authors: Payne A. J.
Published: January 2007

This paper reviews the effects of standards when they are applied to the learning of a production technique. In the first part we describe what has been published on the subject previously. The second section develops a theoretical model for the learning of a production operation and then we apply it to experimental results which are described in part three.
A computer graphics human figure application of bio-stereometrics
Authors: Fetter William A.
Published: January 2007

A study of improved computer graphic representation of the human figure is being conducted under a National Science Foundation grant. Special emphasis is given bio-stereometrics as a primary data base from which applications requiring a variety of levels of detail may be prepared. For example, a human figure represented by a single point can be very useful in overview plots of a population. A crude ten point figure can be adequate for queuing theory studies and simulated movement of groups. A one hundred point figure can usefully be animated to achieve different overall body activities including male and female figures. A one thousand point figure similarly animated, begins to be useful in anthropometrics and kinesiology gross body movements. Extrapolations of this order-of-magnitude approach ultimately should achieve very complex data bases and a program which automatically selects the correct level of detail for the task at hand. See Summary Figure 1.
Analysis of fault detection coverage of a self-test program
Authors: Tasar Vehbi
Published: January 2007

A method for determining the percent fault detection coverage of a self-test software program and a method to improve the coverage are presented. These methods are applied to analyze a self-test software program used to check the functional operation of the BDX-910 minicomputer Central Processing Unit (CPU). The results of each analysis are presented. The concepts, tools, assumptions, requirements and constructs of each method are discussed.
Computer assisted mapping and records activities systems (CAMRAS)
Authors: Bathke William L. , Hinkle George J.
Published: January 2007

The Research Foundation of the American Public Works Association is conducting, under the sponsorship of over twenty agencies, the Computer Assisted Mapping and Record Activities Systems (CAMRAS) program. The CAMRAS program provides for a joint use planning, engineering, and management tool that can greatly improve speed and accuracy in compiling, transferring, and using information; and which provides an economical retrieval of important data needed by a large number and variety of public agencies and utility companies operating within a common geographic area. The specific objectives of the program are (1) to develop, promulgate, and implement suggested procedures and standards for jointly funded, and shared use, computer assisted, geo-based location record systems, and (2) to assist in the initiation, development, testing, and operation of a working system at a size and scope to provide a wide range of measurable and user-oriented data. This will be accomplished through a CAMRAS-type implementation of a test site location. Memphis, Tennessee is serving as the site of the model test application which is to be conducted over a three year period at a funding level of approximately $1.7 million.
Placement of modules with irregular shapes in layout design
Authors: Otten R. H. J. M. , Szepieniec A. A.
Published: January 2007

In this paper a fast algorithm for placing modules is presented. It gradually transforms a graph structure into a highly packed placement. The positioning of the modules is such that subsequent wiring procedures can be kept simple and total interconnection length can be relatively small. Restrictions on the shapes of the concerned modules are much weaker than those imposed by algorithms with for the rest comparable potency. In an example the algorithm is applied to bipolar integrated circuits with one wiring layer.
RIGEL
Authors: Rice Beverly S. , Ritter Constance E.
Published: January 2007

The Raster-scan Intelligent Graphics Engineering Language (RIGEL) is a high-level command language which greatly simplifies the task of programming real-time color graphic displays. The RIGEL language is must easier to learn than a conventional subroutine graphics package, is nearly free-format, and is easy to maintain. In addition, it enables the user to define his own symbol library, and incorporates a mechanism for decreasing picture-generation overhead, which is very important in real-time applications.The RIGEL language works as an extension to the ANSI-standard FORTRAN language, which is a language familiar to most engineers and supported on most computers. A preprocessor translates the graphics commands to FORTRAN statements, and an assembler produces Ramtek object code from the compiled FORTRAN source. This object code is transmitted to the display processor, which generates the display on the monitor.
The TREC terabyte retrieval track
Authors: Clarke Charles , Craswell Nick , Soboroff Ian
Published: January 2007

The Terabyte Retrieval Track of the Text REtrieval Conference (TREC) provides an opportunity to test retrieval techniques and evaluation methodologies in the context of a terabyte-scale corpus. Given the size of the corpus, the track also provides a vehicle for participants to investigate query and indexing speeds. This brief summary outlines track activities to date and previews our plans for TREC 2005. For complete information, the reader should consult the full version of this report [1].
The second ACM international workshop on multimedia databases (MMDB 2004) held at ACM CIKM 2004
Authors: Chen Shu-Ching , Shyu Mei-Ling
Published: January 2007

The Second ACM International Workshop on Multimedia Databases was held in Washington, DC, USA, November 13, 2004. Its aim is to bring together university researchers, scientists, industry professionals, software engineers and graduate students who need to become acquainted with new theories and technologies in multimedia databases, and to all those who wish to gain a detailed technical understanding of what multimedia databases involve.
Report on the 27th European conference on information retrieval research (ECIR 2005)
Authors: Losada David E. , Fernández-Luna Juan M.
Published: January 2007

The 27th European Conference on Information Retrieval Research (ECIR 2005), celebrated in Santiago de Compostela (Spain) on 21-23 March 2005, was jointly organized by the University of Santiago de Compostela (Spain) and the University of Granada (Spain), under the auspices of the Information Retrieval Specialist Group of the British Computer Society (BCS-IRSG). The conference was co-chaired by David E. Losada (University of Santiago de Compostela) and Juan M. Fernández-Luna (University of Granada) and was celebrated in the Technical School of Engineering of the University of Santiago de Compostela.
Video information retrieval using objects and ostensive relevance feedback
Authors: Browne Paul
Published: January 2007

The thesis discusses and evaluates a model of video information retrieval that incorporates a variation of Relevance Feedback and facilitates object-based interaction and ranking. Object-based feature search for video IR is one of the main novel aspects of this work.
Searching and mining the web for personalized and specialized information
Authors: Chau Michael
Published: January 2007

With the rapid growth of the Web, users are often faced with the problem of information overload and find it difficult to search for relevant and useful information on the Web. Besides general-purpose search engines, there exist some alternative approaches that can help users perform searches on the Web more effectively and efficiently. Personalized search agents and specialized search engines are two such approaches. The goal of this research is to investigate how machine learning and artificial intelligence techniques can be used to improve these approaches.
Polyphonic music retrieval
Authors: Doraisamy Shyamala
Published: January 2007

This Music Information Retrieval (MIR) study investigates the use of
n
-grams and textual Information Retrieval (IR) approaches for the retrieval and access of polyphonic music data. IR, synonymous with text IR, implies the task of retrieving documents or texts with information content that is relevant to a user's information need.
Two information retrieval learning environments
Authors: Halttunen Kai
Published: January 2007

The design and evaluation of two information retrieval (IR) learning environments took place in a basic course of IR (6 ECTS credits) at the Department of Information Studies at the University of Tampere. The course consisted of lectures, web exercises and tutored search exercises. Tutored exercises were carried out in two learning environments, in a traditional and in an experimental one. The participants in the study (n=57), were undergraduate students of information studies at the university.
Automated word sense disambiguation for web information retrieval
Authors: Stokoe Christopher M.
Published: January 2007

A word in the English language is considered ambiguous if, regardless of context, it can have more than one possible interpretation or meaning. Many words exhibit lexical ambiguity suggesting that it has the potential to impact upon the performance of text retrieval systems. This may be particularly true in the case of web retrieval given the hypothesis that short queries may not provide sufficient context to adequately differentiate between opposing meanings of constituent words. Word sense disambiguation is an active field of study which seeks to create software which automatically resolves ambiguity through mapping word use to meaning. In this study the author examined the use of word sense disambiguation in order to resolve ambiguity within an IR collection. The motivation behind this work was to demonstrate the potential for increased retrieval effectiveness as a result of performing word sense disambiguation.
Using generative probabilistic models for multimedia retrieval
Authors: Westerveld Thijs
Published: January 2007

This thesis discusses information retrieval from multimedia archives, focusing on documents containing visual material. We investigate search and retrieval in collections of images and video, where video is defined as a sequence of still images. No assumptions are made with respect to the content of the documents; we concentrate on retrieval from generic, heterogeneous multimedia collections. In this research area a user's query typically consists of one or more example images and the implicit request is: "Find images similar to this one." In addition the query may contain a textual description of the information need. The research presented here addresses three issues within this area.
Aggregated feature video retrieval for MPEG-7 via clustering
Authors: Ye Jiamin
Published: January 2007

MPEG-7 is a generic standard used to encode information about multimedia content and often, different MPEG-7 Descriptor Schemas are instantiated for different representations of a shot such as text annotations and visual features. Our work focuses on two main areas, the first is devising a method for combining text annotations and visual features into one single MPEG-7 description and the second is defining how best to carry out text and non-text queries for retrieval via a combined description.
Why is the internet traffic bursty in short time scales?
Authors: Jiang Hao , Dovrolis Constantinos
Published: January 2007

Internet traffic exhibits multifaceted burstiness and correlation structure over a wide span of time scales. Previous work analyzed this structure in terms of heavy-tailed session characteristics, as well as TCP timeouts and congestion avoidance, in relatively long time scales. We focus on shorter scales, typically less than 100-1000 milliseconds. Our objective is to identify the actual mechanisms that are responsible for creating bursty traffic in those scales. We show that TCP self-clocking, joint with queueing in the network, can shape the packet interarrivals of a TCP connection in a two-level ON-OFF pattern. This structure creates strong correlations and burstiness in time scales that extend up to the Round-Trip Time (RTT) of the connection. This effect is more important for bulk transfers that have a large bandwidth-delay product relative to their window size. Also, the aggregation of many flows, without rescaling their packet interarrivals, does not converge to a Poisson stream, as one might expect from classical superposition results. Instead, the burstiness in those scales can be significantly reduced by TCP pacing. In particular, we focus on the importance of the minimum pacing timer, and show that a 10-millisecond timer would be too coarse for removing short-scale traffic burstiness, while a 1-millisecond timer would be sufficient to make the traffic almost as smooth as a Poisson stream in sub-RTT scales.
Fundamental bounds on the accuracy of network performance measurements
Authors: Roughan Matthew
Published: January 2007

This paper considers the basic problem of "how accurate can we make Internet performance measurements". The answer is somewhat counter-intuitive in that there are bounds on the accuracy of such measurements, no matter how many probes we can use in a given time interval, and thus arises a type of Heisenberg inequality describing the bounds in our knowledge of the performance of a network. The results stem from the fact that we cannot make independent measurements of a system's performance: all such measures are correlated, and these correlations reduce the efficacy of measurements. The degree of correlation is also strongly dependent on system load. The result has important practical implications that reach beyond the design of Internet measurement experiments, into the design of network protocols.
Standard LISP (reprint)
Authors: Hearn Anthony C.
Published: January 2007

When it was first formulated in 1960, (1) the programming language LISP was a truly machine independent language. However, even the earliest computer implementation encountered problems in input-output control and the handling of free variables which were not considered in the original paper. Successive implementations of LISP on more sophisticated machines have solved such problems by independent methods and introduced extensions of the language peculiar to those machines. Consequently, a LISP user now faces considerable difficulty in moving a program from one machine to another and is often involved in weeks of debugging in the process. As a possible solution to this problem, this paper is an attempt to provide a uniform subset of LISP 1.5 and its variants as it exists today. The version of LISP described, which we call Standard LISP, is sufficiently restricted in form so that programs written in it can run under any LISP system upwardly compatible with LISP 1.5 as described in the LISP 1.5 Programmer's Manual (2). As function names vary from system to system and input-output control is different, some modification of the code is of course necessary before function definitions can be successfully compiled in any given system. However, this modification is performed automatically by a preprocessor, whloh is custom built for a particular system. This preprocessor is a LISP program which is loaded before any Standard LISP programs are run, and could be built automatically into a system if only Standard LISP programs are run. Parts of this preprocessor are similar for all systems, but some of it is peculiar to a given implementation. Standard LISP preprocessors have been written for SHARE LISP for the IBM 7090 series machines, Stanford LISP/360 for IBM System 360 machines, Stanford AI LISP 1.6 for the PDP-6 and PDP-10, BBN-LISP for the SDS 940 and Texas LISP for the CDC 6600. For convenience in exposition we shall refer to the first four systems as SHARE LISP, LISP/360, PDP LIST and BBN-LISP respectively.
A laboratory for the study of automating programming
Authors: Cheatham T. E. , Wegbreit Ben
Published: January 2007

In this paper we describe a facility which we characterize as a laboratory for the study of automating programming. The considerable body of work which is related to programming automation is surveyed briefly, and, following this, the basic components of the laboratory and approach to be employed in utilizing it are discussed.
Problem #2 - the Y
2n
functions
Authors: Campbell J. A.
Published: January 2007

Many branches of mathematical physics use equations of the form[EQUATION]where λ is a small quantity, and the primes denote differentiation with respect to x. In the absence of a general solution, one tries to write f(x) as an expansion in powers of λ. More neatly, if[EQUATION]is tried, to fit the structure of (1), then the work reduces to the derivation of a series expansion for q(x). The solution is [1][EQUATION]where N signifies the order of approximation to which one wishes to go, and Y
2n
represents the member of order λ
2n
of a family of functions obtained by substitution of (3) into (1) and (2). The problem is to compute Y
2n
for as many values of n as possible.
PL/I list processing used as interactive system support
Authors: LaPlace André M. L.
Published: January 2007

The various existing interactive systems use generally the possibilities offered by a host language: REDUCE (Hearn) based on LISP, SAC (Collins) based on FORTRAN, FINSTER (KFA) based on PL/1-FORMAC, and by the system under which they are working. [1, 2, 3]
CAMAL
Authors: Bourne S. R.
Published: January 2007

Various methods for constructing a series solution of the equation [EQUATION] are presented. The form of the solution is similar to the JWKB approximation and is discussed by Froman (1). Each method has been programmed for the CAMAL system and comparisons of performance are made. The resource requirements are compared with theoretical expectations.
MACSYMA
Authors: Fateman R. J.
Published: January 2007

Approach 1: The problem description, as given, was programmed. The time for computing the firs few terms (in seconds): input: 5.9, Y[2]: 2.2, Y[4]: 5.9, Y[6]: 13.6, Y[8]: 37.5, Y[10]: 90.5. These times are on a standard MACSYMA system running on a PDP-10 with 2-microsecond core. This version used only about 50k 36-bit words of the 120k programs available through MACSYMA. (Note that in the output, E(X+N) represents epsilon[n])
SYMBAL
Authors: Sundblad Y.
Published: January 2007

The program has been written in SYMBAL for the CDC 6600 computer in Vkstberga, Stockholm. This is a standard configuration with a 6613 central processor, ten peripheral processors and a 131072 60-bit word core memory with 0.1 ps access time. About 3 machine instructions/us can be performed. SYMBAL version 1. OK (3/3/70).
SAC-1
Authors: Horowitz E.
Published: January 2007

The SAC-1 program was compiled with the IBM FORTRAN-G Compiler on the IBM 360/65, running under OS-MVT. The amount of core used was 110K words. (Not all this space was used for n = 1,...,11. since available space was exhausted while computering n = 12.)
Reply to an editorial
Authors: Fateman R. J.
Published: January 2007

The comparison of algebraic manipulation systems is a difficult task. Nevertheless, I think that some of the conclusions stated in "Solutions of Problem # 2" in the last SIGSAM Bulletin are not entirely valid. I would like to voice some specific objections, especially as they concern LISP and MACSYNA.
Problem #4
Authors: Barton David
Published: January 2007

The problem proposed here is that of performing a Lie transformation. The Lie transform as described by Deprit (1969) is a means of solving certain sets of ordinary differential equations by repeated approximation and he has applied the technique to the problems of predicting the motion of the Moon and also of artificial satellites. Deprit's work contains a remarkable application of symbolic techniques to real problems and it is for this reason that the Lie transform is an interesting calculation.
An interesting bug in FORMAC
Authors: Bahr Knut
Published: January 2007

The zoology of bugs allows us to classify the species of programming bugs into two subspecies: those that are unwholesome to a program's results; and those that lead a peaceful symbiosis, not affecting the results but living on time and space. We are going to describe one of the latter kind.
A speed-up of FORMAC
Authors: Bahr Knut A.
Published: January 2007

The following note reports on a speed-up that is due to a modification in the central part of FORMAC. Since this part is always and heavily used, the overall speed of the system has been increased, typically by a factor of 2, sometimes more, depending on the particular problem. Sigsam problem #2 is used as an example. This report does not make reference to or rely on a previously reported special-case speed-up [5].
Problem #6 - the Kiang problem
Authors: McCarthy D. P.
Published: January 2007

Dr. T. Kiang of the Dublin Institute for Advanced Studies originated the following problem in partial fractions from some astronomical investigations.
One users's one-algorithm comparison of six algebraic systems on the Y
2n
-problem
Authors: Sundblad Yngve
Published: January 2007

In last October's issue (no. 24) of the SIGSAM Bulletin several reports of performance of different algebraic systems on SIGSAM Problem no. 2, described in [1], were published. The timings are somewhat incompatible for the following reasons.
The automatic solution of partial differential equations by means of Taylor series using formula-manipulation methods
Authors: van de Riet R. P.
Published: January 2007

Some five years ago the author published a study on formula manipulation in ALGOL 60 [1,2] containing, among others, a 160 paged chapter on the problem of obtaining automatically solutions of partial differential equations. The publication was in the form of two Mathematical Centre Tracts, which does not seem to have become widely distributed. This turned out somewhat embarrassingly a few months ago when the author invited a reputed formula manipulator for giving a lecture on the subject of this note. The speaker was not aware that a substantial part of his lecture, covering recent results, was contained in the authors tract [2].
Problem #7
Authors: Johnson S. C. , Graham R. L.
Published: January 2007

The function F(x) = (1/2-x) (1-x
2
)
1/2
+x(1+(1-(1/2+x)
2
)
1/2
) has a maximum at about x = .343771, where it attains the value of approximately .674981. This value is the root of an irreducible polynomial of tenth degree over the integers; the problem is to find this polynomial. The obvious way of proceeding is as follows:(1) Differentiate F(x), set it equal to zero, and clear radicals. The result is a tenth degree polynomial P(x) over the integers which has a root at about x = .343771.
FORMAC today, or what can happen to an orphan
Authors: van Hulzen J. A.
Published: January 2007

What Xenakis did not tell about FORMAC in Los Angeles, [30].
Algebraic manipulation in Cambridge
Authors: Barton D. , Fitch J. P.
Published: January 2007

Algebraic Manipulation is by no means new to Cambridge. As long ago as 1949, Boys was using an algebra system, specially written by him, for solving problems in theoretical chemistry. The projects that we wish to describe here are not descended directly from this, except that we too are largely motivated by the desire to solve real problems. Before describing what we are doing, a few details of the sort of establishment we have is necessary.
Toward a revision of FORMAC
Authors: Bahr Knut A.
Published: January 2007

A survey is given of some of the new facilities that have been implemented in FORMAC in an attempt to overcome current deficiencies and move towards a more powerful system.
Solution to problem #7 using MACSYMA
Authors: Fateman R. , Moses J. , Wang P.
Published: January 2007

The solution to problem 7 [SIGSAM Bulletin vol 8, no. 1 (issue no. 29), Feb., 1974] was obtained in its entirety with the use of MACSYMA [1]. No hand calculations were required. The factorization step, the major cost of the solution, uncovered a poor design decision in the existing factorization program [2]. This program was modified, and the factorization was accomplished in 602 seconds of PDP-10 machine time. Since the modified factorization program produces shorter run-times on almost all of our standard test cases. it is now the standard routine.
The SCRATCHPAD language
Authors: Jenks R. D.
Published: January 2007

SCRATCHPAD is an interactive system for symbolic mathematical computation. Its user language, originally intended as a special-purpose non-procedural language, was designed to capture the style and succinctness of common mathematical notations, and to serve as a useful, effective tool for on-line problem solving. This paper describes extensions to the language which enable it to serve also as a high-level programming language, both for the formal description of mathematical algorithms and their efficient implementation.
Introduction to NETFORM
Authors: Smit Mr. Jaap
Published: January 2007

Netform
is an easy to use, interactive, language for symbolic mathematical computation. The well known,
Formac
package, which uses the normal representation of formula's, forms the basis of the system. This basis is extended by means of:1° A linear equations solver, which offers two different possibility's to describe a system of linear equations.2° The description of linear (electrical) networks based on the network structure.In this paper a more detailed description of the just mentioned extensions is given. It will be shown that symbolic mathematical computation can be a very attractive and powerful instrument for the analysis of electrical network.At this moment the system is implemented on an IBM 360-50 computer under the MVT operating system and serves 3 2260 display's in a 240k region. Batch processing is possible in order to be independent of the display's. A file mechanism makes off line preparation of a session possible.
Different polynomial representations and their interaction in the portable algebra system PORT-ALG
Authors: Klip Dorothea A.
Published: January 2007

In recent years a system for the handling of large multivariate polynomials has been developed at the University of Alabama in Birmingham. The coding is generally done in Fortran IV; some special features are coded in PL/1, for the IBM systems 360 or 370. No machine coding is involved.
The use of symbolic computation in solving free boundary problems by the Ritz-Galerkin method
Authors: Miola Alfonso
Published: January 2007

This paper presents a particular method of solving an ordinary linear differential free boundary problem by using the methods of Ritz and of Galerkin. The method described benefits from symbolic manipulation because of the parameter derived from the free boundary condition.It is interesting to note how the using of the symbolic manipulation still offers some different solution strategies. This open choice gets our problem solvable with enough generality and flexibility by any of the present systems for symbolic manipulation.The main demand for symbolic computation is actually in performing symbolic integrations. Hence, according to the present situation of the symbolic integration algorithms, the ability of handling our kind of problem by a now-a-day system is discussed. The alternative of using pattern matching techniques is also presented and discussed.The solution of a particular free boundary problem, by the MACSYMA system is presented.
Software for graph processing
Authors: Nievergelt J.
Published: January 2007

Special purpose programming languages or software packages to facilitate the programming of graph algorithms are being developed at several places. The reports described below have come to my attention. I would appreciate hearing of any other similar efforts.
Ludeman's PL/I FORMAC gradient problem as handled by FORTRAN SYMBOLANG
Authors: Bernstein Herbert J.
Published: January 2007

A program is presented which produces FORTRAN statements defining the gradient of a function of several variables given by an arithmetic expression in the variables and the functions SIN, COS, and EXP. The program is coded in FORTRAN and uses the SLIP based algebraic manipulation package, SYMBOLANG, to perform the differentiations, substitutions, and input/output formatting. It is compared with Ludeman's PL/I FORMAC procedure which does the same task, and from which the SYMBOLANG program was derived. The major difference is that the SYMBOLANG program evaluates expressions against a list of definitions to achieve necessary substitutions, where the FORMAC program does one replacement at a time.
Historical note on gradient evaluation
Authors: Tobey R. G.
Published: January 2007

The following article by H. Eisenpress and A. Bomberault presents a more extensive approach to the generation of FORTRAN statements defining the gradient of a function of several variables than that discussed by either M. M. Ludeman (SIGSAM Bulletin 12, July 1969) or by H. J. Bernstein (p. 19 of this Bulletin). The work described here was done in 1967 and 1968 in PL/I FORMAC. However, many of the techniques were developed as early as 1965 for a program they implemented on the 7090 FORMAC system.
General characteristics of the ANALITIK language
Authors: Korpela Jukka
Published: January 2007

The ANALITIK language is based on the language of the MIR-1 computer (language "MIR" or "ALMIR-65"), which is very similar to Algol, but the most essential part of ANALITIK is, of course, the set of statements for analytical manipulations. These statements can be classified as follows:- simplification (transformation into some canonical form),- comparison of expressions (pattern recognition),- application (transformation according to a user-defined rule or set of rules),- analytical differentiation,- analytical integration.
Group theoretical computations in mathematical crystallography
Authors: Loos Rüdiger , Neubüser J.
Published: January 2007

Crystallographic structures have in the past mainly been studied by geometric means. A first algebraic algorithm for the determination of space groups was formulated by Zassenhaus in 1948. However, only the possibility to use computers have made possible the reliable and efficient use of such algorithms. It will be described how group theoretical systems as well as the implementations of special algorithms have been used to obtain a complete classification of 4-dimensional crystallographic structures as well as more detailed information about the "classical" 3-dimensional crystallography.
Some properties of Gröbner-bases for polynomial ideals
Authors: Buchberger B.
Published: January 2007

We give a uniqueness theorem for Gröbner-bases of polynomial ideals and show that it is effectively decidable whether a given basis is a (minimal normed) Gröbner-basis. Incidentally, we show how our methods may be applied to decide α ≤ β for given polynomial ideals α and β.
Some aspects of symbolic integration via predicate logic programming
Authors: Kanoui Henry
Published: January 2007

During the past years, various algebraic manipulations systems have been described in the literature. Most of them are implemented via "classic" programming languages like Fortran, Lisp, PL1 ... We propose an alternative approach: the use of Predicate Logic as a programming language.
Factoring larger multivariate polynomials
Authors: Wang Paul S.
Published: January 2007

An improved algorithm for factoring multivariate polynomials over the integers has been developed. For larger polynomials, it is generally faster and requires less storage than the original algorithm as described by Wang and Rothschild [2]. The new algorithm has improved strategy to deal with the known problems of the original algorithm. namely, the leading coefficient problem, the bad-zero problem and the combinatorial search for true factors. It features a linearly convergent variable-by-variable p-adic construction procedure for parallel lifting of all factors at once. This procedure is very efficient and it relies on i) distributing the factors of the leading coefficient correctly, and ii) solving the equation αf+βg = h, with multivariate f, g and h, efficiently. Details of these and other aspects of this algorithm together with its generalization to factoring over algebraic number fields will be forthcoming. Obviously, the EZ-GCD algorithm [1] can be similarly improved if its lifting procedure is replaced.
The impact of complexity theory on algorithms for sparse polynomials
Authors: Manders Kenneth L.
Published: January 2007

In recent work [12][13], Plaisted has considered the computational complexity of certain decision problems for sparse polynomials. The present expository paper is intended to make these results accessible to those working in the area of algebraic manipulation and to clarify the relevance of the results to this area. The basic insight to be gained is that if the best known algorithms for a problem concerning (not necessarily sparse) polynomials process sparse polynomials in such a way that sparsity is lost, then one should not expect it to be possible to design special algorithms with consistently improved performance on sparse polynomials, unless one hopes to solve the NP = P problem positively. Also we note, for the sake of improved communication between complexity theorists and those working on algebraic manipulation, that there is a significant difference between the conventions used for expressing computation time in the two areas: Many algorithms which always run within a polynomial number of steps, in terms of the algebraic parameters involved, will require an exponential number of steps, in terms of input length (as is the usage in complexity theory), on infinitely many inputs.
On the design of a mode-based symbolic system
Authors: Jenks Richard D.
Published: January 2007

This paper is a preliminary report on the design and implementation of a mode-based symbolic programming system and compiler which allows programming with rewrite rules and let and is pattern-match constructs. An important feature of this design is the provision for mode-valued variables which allow algebraic domains to be run-time parameters.
Attempts in local simplification of non nested radicals
Authors: Shtokhamer R.
Published: January 2007

Algorithm for simplifying locally non nested radicals is suggested. The main albegraic operations needed are "GCD's" and solution of Diophantine equations over the integers.
1977 MACSYMA users' conference
Authors: Loos Rüdiger
Published: January 2007

The papers abstracted below appear in the Proceedings of the 1977 MACSYMA Users' Conference. This volume published by NASA-Langley Research Center will be distributed to conference participants and may be purchased after that time from the National Technical Information Service, Springfield, Va. 22161. (Price is yet to be determined. Probably $12.50.) NASA CP-2012
The further development of MIRA
Authors: Gawlik H. J.
Published: January 2007

In 1973 I presented a brief account of MIRA, which was then at an early stage and which had been implemented on a computer which we had built ourselves (1). Since then the project has made considerable progress, and it is the object of the present paper to give some idea of the developments which have taken place in the last three years or so.
REDUCE solution to problem #8
Authors: Harrington S. J.
Published: January 2007

Problem #8 is the problem of finding the power series expansion of a function H
n
(v).
A method for determining the coefficients of a reversed power series
Authors: Hall David L. , Meyers B. Craig
Published: January 2007

The method developed by van Orstrand is applied to the calculation of coefficients of a reversed power series. A FORMAC program which performs this calculation and sample output is given.
A note on algebraic independence of logarithmic and exponential constants
Authors: Caviness B. F. , Prelle M. J.
Published: January 2007

This paper gives a corollary to Schanuel's conjecture that indicates when an exponential or logarithmic constant is transcendental over a given field of constants. The given field is presumed to have been built up by starting with the rationals Q with π adjoined and taking algebraic closure, adjoining values of the exponential function or of some fixed branch of the logarithmic function, and then repeating these two operations a finite number of times.
The evaluation, manipulation and identification of nondimensional numbers
Authors: Hirschberg Morton A.
Published: January 2007

This paper describes a computer program which evaluates, manipulates and identifies nondimensional numbers (pi terms, dimensionless numbers or factors) generated using the Buckingham Pi Theorem. Computations are performed using SYMBOLANG, an algebraic (symbol) manipulation package (solutions are kept in symbolic form). Manipulation occurs in two ways. First, many allowable combinations of pi terms (up to 720) are generated by changing the ordering of the dimensional equations which are solved. Second, a small group of operators (squaring, square-rooting, cube-rooting, reciprocating, and division of both the minimum and maximum exponent) are applied to each solution (these too are solutions and also kept in symbolic form). Numerical substitution into the symbolic forms produce scalars (evaluated solutions) for subsequent use (plotting, regression, factor analysis, etc.). Finally, every symbolic solution is compared with well-known nondminsional numbers (e.g., Reynold's, Weber's, etc.). If a match is not found, this information is displayed.
An improved algorithmic construction of Gröbner-bases for polynomial ideals
Authors: Kollreider C. , Buchberger B.
Published: January 2007

In /1/, /2/ we gave an algorithm for the construction of so called Gröbner-bases of polynomial ideals. In this paper we present some new theoretical results by which the complexity of this algorithm may drastically be reduced in many cases.
A comparative study of algorithms for sparse polynomial multiplication
Authors: Klip Dorothea A.
Published: January 2007

Two algorithms will be discussed:GEN-MULT for the sorting of general tableaux and dense to moderately unstructured (multivariate) polynomials. This algorithm is based on the general properties of a "tableau", which hold for the matrix of the exponents of the polynomial product.
A short note on a new method for polynomial real root isolation
Authors: Akritas Alkiviadis G.
Published: January 2007

The purpose of this short note is to make known to our community some of the results of my Ph.D. Dissertation [1]. More details can also be found elsewhere [2], [3].
Advanced tests for algorithms of differentiation
Authors: de Queiroz F. Teixeira
Published: January 2007

The oldest algorithm for handling symbolic information is, perhaps, one which computes the derivative of a function. Nowadays, such an algorithm, to be a valuable tool, is never used on its own but as an element of a very large set of procedures. This set constitutes a formula manipulation system and the algorithm for differentiation certainly lies at its heart.
Comments on the open letter from Fateman to Veltman
Authors: Gawlik H. James
Published: January 2007

There are two areas in particular in which the views attributed to Dr. Veltman are absurd, and I should like to comment on them separately.
SCRATCHPAD/360
Authors: Jenks R. D.
Published: January 2007

The key concepts of the SCRATCHPAD language are described, assessed, and illustrated by an example. The language was originally intended as an interactive problem solving language for symbolic mathematics. Nevertheless, as this paper intends to show, it can be used as a programming language as well.
A symbolic limit evaluation program in REDUCE
Authors: Harrington Steven J.
Published: January 2007

A method for the automatic evaluation of algebraic limits is described. It combines many of the techniques previously employed, including top-down recursive evaluation, power series expansion, and L'Hôpital's rule. It introduces the concept of a special algebraic form for limits. The method has been implemented in MODE-REDUCE.
A simple method of taking nth roots of integers
Authors: Fitch John
Published: January 2007

When performing algebraic calculations by computer one is occasionally faced with expressions like 4
(1/2)
. A particular example of this is in the statistics calculation described in [1], where the expressions involve[EQUATION]When all we require is the principal (positive) root the expression collapses. Dealing with (q
2
)
(1/2)
for an explicit q is not difficult; this note is concerned with the treatment of the 4
(1/2)
.
Solution to problem 8
Authors: Bahr Knut
Published: January 2007

Problem 8 (Random Walk) appears to ask for a power series expansion of[EQUATION]with X = (B+√B
2
-4C)/2 and Y = (B-√B
2
-4C)/2 The term -1 comes in because (H1-Y)/(X-Y)*X
O
is obviously independent of n and thus of no interest.
Double by single length division
Authors: Fitch John , Norman Arthur
Published: January 2007

Arbitrary precision arithmetic packages are built around methods for multiplying single length numbers to get a double length result and dividing double length numbers by single length ones to get a quotient and remainder. Existing systems use one of three strategies to do the double by single division:1) descend to machine code,2) exploit the fact that if the number base is small enough there is no difficulty,3) Use a variant on what we term the 'recursive algorithm' as displayed below.