ParFORM: recent development

We report on the status of our project of parallelization of the symbolic manipulation program FORM. We have now parallel versions of FORM running on Cluster- or SMP-architectures. These versions can be used to run arbitrary FORM programs in parallel.Comment: 5 pages, 6 Encapsulated postscript figures, LaTeX2e, uses espcrc2.sty (included). Talk given at ACAT0

Solutions of some problems in applied mathematics using MACSYMA

Various Symbolic Manipulation Programs (SMP) were tested to check the functioning of their commands and suitability under various operating systems. Support systems for SMP were found to be relatively better than the one for MACSYMA. The graphics facilities for MACSYMA do not work as expected under the UNIX operating system. Not all commands for MACSYMA function as described in the manuals. Shape representation is a central issue in computer graphics and computer-aided design. Aside from appearance, there are other application dependent, desirable properties like continuity to certain order, symmetry, axis-independence, and variation-diminishing properties. Several shape representations are studied, which include the Osculatory Method, a Piecewise Cubic Polynomial Method using two different slope estimates, Piecewise Cubic Hermite Form, a method by Harry McLaughlin, and a Piecewise Bezier Method. They are applied to collected physical and chemical data. Relative merits and demerits of these methods are examined. Kinematics of a single link, non-dissipative robot arm is studied using MACSYMA. Lagranian is set-up and Lagrange's equations are derived. From there, Hamiltonian equations of motion are obtained. Equations suggest that bifurcation of solutions can occur, depending upon the value of a single parameter. Using the characteristic function W, the Hamilton-Jacobi equation is derived. It is shown that the H-J equation can be solved in closed form. Analytical solutions to the H-J equation are obtained

Concurrent processing simulation of the space station

The development of a new capability for the time-domain simulation of multibody dynamic systems and its application to the study of a large angle rotational maneuvers of the Space Station is described. The effort was divided into three sequential tasks, which required significant advancements of the state-of-the art to accomplish. These were: (1) the development of an explicit mathematical model via symbol manipulation of a flexible, multibody dynamic system; (2) the development of a methodology for balancing the computational load of an explicit mathematical model for concurrent processing; and (3) the implementation and successful simulation of the above on a prototype Custom Architectured Parallel Processing System (CAPPS) containing eight processors. The throughput rate achieved by the CAPPS operating at only 70 percent efficiency, was 3.9 times greater than that obtained sequentially by the IBM 3090 supercomputer simulating the same problem. More significantly, analysis of the results leads to the conclusion that the relative cost effectiveness of concurrent vs. sequential digital computation will grow substantially as the computational load is increased. This is a welcomed development in an era when very complex and cumbersome mathematical models of large space vehicles must be used as substitutes for full scale testing which has become impractical

Parallel Computation of Feynman diagrams with DIANA

Co-operation of the Feynman DIagram ANAlyzer (DIANA) with the underlying operational system (UNIX) is presented. We discuss operators to run external commands and a recent development of parallel processing facilities and an extension in the spirit of a component model.Comment: 23 pages, Latex using psfig, epsf and alltt, 3 figure

An Extended Stable Marriage Problem Algorithm for Clone Detection

Code cloning negatively affects industrial software and threatens intellectual property. This paper presents a novel approach to detecting cloned software by using a bijective matching technique. The proposed approach focuses on increasing the range of similarity measures and thus enhancing the precision of the detection. This is achieved by extending a well-known stable-marriage problem (SMP) and demonstrating how matches between code fragments of different files can be expressed. A prototype of the proposed approach is provided using a proper scenario, which shows a noticeable improvement in several features of clone detection such as scalability and accuracy.Comment: 20 pages, 10 figures, 6 table

Kemampuan Generalisasi Matematis Siswa SMP pada Materi Segiempat dan Segitiga

Kemampuan generalisasi matematis adalah bagian dari kemampuan yang harus dimiliki oleh siswa dalam mempersepsi sebuah pola, struktur, gambar, data ataupun suku berikutnya dan merumuskan bentuk umum secara simbolis. Oleh karena itu perlu adanya penalaran yang jelas dalam belajar matematika, kemampuan generalisasi ini dibutuhkan untuk proses mengambil suatu kesimpulan berdasarkan pengamatan atau fakta. Penelitian yang digunakan adalah penelitian kualitatif metode deskriptif, dengan tujuan penelitian ini adalah untuk mendeskripsikan kemampuan generalisasi matematis siswa kelas VIII pada salah satu SMP Negeri 2 Karawang dalam menyelesaikan masalah materi segiempat dan segitiga. Subjek dalam penelitian ini yaitu 3 siswa dari 30 siswa yang didapat dari hasil pengkategorian kemampuan generalisasi matematis. Teknis analisis data dilakukan melalui tes tertulis, kemampuan ini diukur berdasarkan tahapan generalisasi yaitu Perception of generality, Expression of generality, Symbolic of generality, Manipulation of generality. Berdasarkan hasil analisis jawaban, diperoleh informasi bahwa MA mampu 1) identifikasi pola, 2) menentukan suku berikutnya, 3) menghasilkan pola umum, 4) menggunakan hasil generalisasi untuk menyelesaikan masalah. Sedangkan NB hanya mampu 1) menemukan suku ke-n, 2) membuat pola umum. Sedangkan DC hanya mampu mengidentifikasi pola