Skip to main content

Extending a Java Based Framework for Scientific Software-Components

  • Conference paper
Computer Algebra in Scientific Computing CASC’99

Abstract

A prototypical framework, which was used for building software components for symbolic computation, is extended as follows. First, we demonstrate that the server components can be accessed from other frameworks for collaborative scientific computing, too. Specifically, we incorporate access from the PROGRESS system. Second, we discuss several design issues that arise when encapsulating existing systems as services into the framework. Many of these issues are of a general nature but become relevant in our effort to incorporate the invariant package of MAS and the quantifier elimination package qepcad into our framework.

Supported by Deutsche Forschungsgemeinschaft under grant Ku 966/6-1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amrhein, B., and Gloor, O. The Fractal Walk. In Gröbner Bases and Applications—Int. Conf. 33 Years of Gröbner Bases (Feb. 1998), B. Buchberger and F. Winkler, Eds., vol. 251 of London Mathematical Society Lecture Notes Series, Cambridge University Press, pp. 305–322.

    Google Scholar 

  2. Amrhein, B., Gloor, O., and Küchlin, W. On the Walk. Theoretical Comput. Sci. 187 (1997), 179–202.

    Article  MATH  Google Scholar 

  3. Becker, P. A framework for providing and using algorithms and algorithmic meta knowledge on the Internet. In Proceedings of the 5th Annual Workshop on Information Technologies & Systems (WITS’95)(1995), S. Ram and M. Jarke, Eds., no. 95-15 in Aachener Informatik-Berichte, pp. 2–11.

    Google Scholar 

  4. Becker, P. An embeddable and extendable language for large-scale programming on the Internet. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS’96) (1996), pp. 594–603.

    Chapter  Google Scholar 

  5. Becker, P. Verteiltes Modell-Management und Objektbanken für diskrete Probleme und diskrete Strukturen. Dissertation, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 1996.

    MATH  Google Scholar 

  6. Berners-Lee, T. Universal Resource Identifiers in WWW. RFC 1630, CERN, June 1994.

    Google Scholar 

  7. Brown, C. W. Simplification of truth-invariant cylindrical algebraic decomposition. In Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation (ISSAC’98) (Rostock, Germany, 1998), O. Gloor, Ed., The Association for Computing Machinery, ACM, pp. 295–301.

    Google Scholar 

  8. Chauvin, C., Muller, M., and Weber, A. An application of quantifier elimination to mathematical biology. In Computer Algebra in Science and Engineering (Bielefeld, Germany, Aug. 1994), J. Fleischer, J. Grabmeier, F. W. Hehl, and W. Küchlin, Eds., Zentrum fur Interdisziplinare Forschung, World Scientific, pp. 287–296.

    Google Scholar 

  9. Dolzmann, A., and Sturm, T. Redlog user manual. FMI, Universität Passau, 94030 Passau, Germany, 1997. http://www.fmi.uni-passau.de/ redlog/.

  10. Gaetano, M., Huchet, C., and Neun, W. The realization of an OpenMath server for REDUCE. In Computer Algebra in Scientific Computing (CASC- 98)—Extended Abstracts (St. Petersburg, Russia, Apr. 1998), N. N. Vassiliev, Ed., pp. 48–56.

    Google Scholar 

  11. Göbel, M. Computing bases for permutation-invariant polynomials. Journal of Symbolic Computation 19 (1995), 285–291.

    Article  MathSciNet  MATH  Google Scholar 

  12. Göbel, M. Symideal Grobner bases. In Rewriting Techniques and Applications — 7th International Conference (RTA’96) (New Brunswick, NJ, U.S.A., July 1996), H. Ganzinger, Ed., vol. 1103 of Lecture Notes in Computer Science, Springer-Verlag, pp. 48–62.

    Chapter  Google Scholar 

  13. Göbel, M. The invariant package of MAS. In Rewriting Techniques and Applications — 8th International Conference (RTA’97) (Sitges, Barcelona, Spain, 1997), H. Comon, Ed., vol. 1232 of Lecture Notes in Computer Science, Springer-Verlag, pp. 327–330.

    Google Scholar 

  14. Hamilton, G. JavaBeans. Sun Microsystems, July 1997. For Version 1.01. http://java.sun.com/beans/.

  15. Hermann, T. Kommunikation zwischen Progress und Java. Studienarbeit, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 1997.

    Google Scholar 

  16. Hong, H. Improvements in CAD-Based Quantifier Elimination. PhD thesis, Ohio State University, Columbus, Ohio, USA, 1990.

    Google Scholar 

  17. Hong, H., Liska, R., and Steinberg, S. Testing stability by quantifier elimination. Journal of Symbolic Computation 24, 2 (Aug. 1997), 161–187.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kredel, H.MAS: Modula-2 Algebra System. In IV International Conference on Computer Algebra in Physical Research(1990), V. P. Gerdt, V. A. Rostovtsev, and D. V. Shirkov, Eds., World Scientific Publishing, pp. 31–34. http://alice.fmi.uni-passau.de/mas.html.

    Google Scholar 

  19. Loos, R., and Weispfenning, V. Applying linear quantifier elimination. The Computer Journal 5 (1993), 450–462.

    Article  MathSciNet  Google Scholar 

  20. MATSE PROJECT GROUP. The MatSe project (Linkup of Mathematical Servers in the Internet). http://iramri.wiwi.hu-berlin.de/matse/1997.

  21. Noether, E. Der Endlichkeitssatz der Invarianten endlicher Gruppen. Math. Ann. 77 (1916), 89–92.

    Article  Google Scholar 

  22. OPENMATH CONSORTIUM. OpenMath. http://www.openmath.org1997.

    Google Scholar 

  23. Orfali, R., and Harkey, D. Client/Server Programming with JAVA and CORBA. Wiley, 1997.

    Google Scholar 

  24. POLYMATH DEVELOPMENT GROUP. Java OpenMath Library. Centre for Experimental and Constructive Mathematics, Simon Eraser University, Burnaby, BC, Canada, 1997. Version 0.3. http://pdg.cecm.sfu.ca/openmath/lib/

  25. Siegel, J. CORBA Fundamentals and Programming. John Wiley & Sons, New York, 1996.

    Google Scholar 

  26. Sturmfels, B. Algorithms in Invariant Theory. Texts and Monographs in Symbolic Computation. Springer-Verlag, Wien, 1993.

    MATH  Google Scholar 

  27. Weber, A., Küchlin, W., and Eggers, B. Parallel computer algebra software as a Web component. Concurrency: Practice and Experience 10, 11–13 (1998), 1179–1188.

    Article  Google Scholar 

  28. Weber, A., Küchlin, W., Eggers, B., and Simonis, V. A parallel Grobner solver as a Web component. In Computer Algebra in Scientific Computing (CASC-98)—Extended Abstracts (St. Petersburg, Russia, Apr. 1998), N. N. Vassiliev, Ed., p. 133.

    Google Scholar 

  29. Weber, A., Küchlin, W., and Hoss, J. Connecting and reusing computer algebra software via CORBA—a case study. Submitted for the proceedings of the Dagstuhl conference on generic programming.

    Google Scholar 

  30. Weispfenning, V. Quantifier elimination for real algebra—the cubic case. In Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation (ISSAC’94) (Oxford, July 1994), Association for Computing Machinery, pp. 258–263.

    Google Scholar 

  31. Weispfenning, V. Quantifier elimination for real algebra—the quadratic case and beyond. Applicable Algebra in Engineering Communication and Computing 8, 2 (Feb. 1997), 85–101.

    Article  MathSciNet  MATH  Google Scholar 

  32. Zippel, R. The Weyl computer algebra substrate. In Design and Implementation of Symbolic Computation Systems — International Symposium DISCO’93 (Gmunden, Austria, Sept. 1993), A. Miola, Ed., vol. 722 of Lecture Notes in Computer Science, Springer-Verlag, pp. 303–318.

    Chapter  Google Scholar 

  33. Zippel, R. The MathBus Term Structure. Cornell University, Ithaca, NY 14853, U.S.A., 1997. http://www2.cs.cornell.edu/Simlab/papers/mathbus/mathTerm.htm.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Göbel, M., Küchlin, W., Müller, S., Weber⋆, A. (1999). Extending a Java Based Framework for Scientific Software-Components. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing CASC’99. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60218-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60218-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66047-7

  • Online ISBN: 978-3-642-60218-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics