@misc{ChraparyDalitzNeunetal., author = {Chrapary, Hagen and Dalitz, Wolfgang and Neun, Winfried and Sperber, Wolfram}, title = {Design, concepts, and state of the art of the swMATH service}, issn = {1438-0064}, doi = {10.1007/s11786-017-0305-5}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-62263}, abstract = {In this paper, the concepts and design for an efficient information service for mathematical software and further mathematical research data are presented. The publication-based approach and the Web-based approach are the main building blocks of the service and will be discussed. Heuristic methods are used for identification, extraction, and ranking of information about software and other mathematical research data. The methods provide not only information about the research data but also link software and mathematical research data to the scientific context.}, language = {en} } @misc{NeunSturmVigerske, author = {Neun, Winfried and Sturm, Thomas and Vigerske, Stefan}, title = {Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11644}, number = {10-01}, abstract = {Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods to prove or disprove convexity of rational functions over a polyhedral domain. Our algorithms reduce convexity questions to real quantifier elimination problems. Our methods are implemented and publicly available in the open source computer algebra system REDUCE. Our long term goal is to integrate REDUCE as a workhorse'' for symbolic computations into a numerical solver.}, language = {en} } @misc{WolfNeun, author = {Wolf, Thomas and Neun, Winfried}, title = {About a Computer Algebra based online Mathtest}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10688}, number = {08-14}, abstract = {The article describes the online mathematics test {\tt http://lie.math.brocku.ca/mathtest}, its typical applications and experiences gathered.}, language = {en} } @misc{DraheimNeunSuliman, author = {Draheim, Dirk and Neun, Winfried and Suliman, Dima}, title = {Searching and Classifying Differential Equations on the Web}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7975}, number = {04-22}, abstract = {In this paper we describe the semantic analysis of differential equations given in the ubiquitous semi-structured formats MathML and OpenMath. The analysis is integrated in a deployed Web indexing framework. Starting from basic classifications for differential equations the proposed system architecture is amenable to extensions for further reconstruction of mathematical content on the Web. The syntactic analysis of mathematical formulae given in the considered formats must overcome ambiguities that stem from the fact that formula particles may have different encodings, which are in principle completely arbitrary. However, it turns out that the syntactic analysis can be done straightforward given some natural heuristic assumptions.}, language = {en} } @misc{DalitzNeunSperber, author = {Dalitz, Wolfgang and Neun, Winfried and Sperber, Wolfram}, title = {Semantic Annotation in Mathematics and Math-Net}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7379}, number = {03-15}, abstract = {The Web of the future will provide a huge amount of information. We need better ways for dealing with and managing the information. A qualified semantic annotation of the information plays a key role for the Web of the future. This article gives an overview about the efforts of the mathematical community to build up a distributed and open information and communication system for mathematics: the Math-Net. The Math-Net Initiative has developed metadata schemas for some classes of Web resources which are relevant in mathematics. Math-Net Services process this information and enable the user to efficiently search and access the information.}, language = {en} } @misc{MelenkNeun, author = {Melenk, Herbert and Neun, Winfried}, title = {Implementation of Portable Standard LISP for the SPARC Processor.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4625}, number = {TR-89-06}, abstract = {The SPARC processor is a RISC (Reduced Instruction Set Computer) microcomputer, built into the SUN4 workstations. Since RISC processors are very well-suited for LISP processing, the implementation of a dialect of LISP (Portable Standard LISP, PSL) boded well for a great speed-up in comparison with other types of microcomputers. A first approach was done at The RAND Corporation in Santa Monica, which was derived from classical processor types like MC68000 or VAX. At the Konrad- Zuse-Zentrum f{\"u}r Informationstechnik Berlin (ZIB) that initial implementation was redesigned in order to adapt PSL to the specific features of the SPARC processor. The present implementation, in some parts, is very close to Cray PSL version also done in ZIB. Some timing informations are given in the appendix.}, language = {en} } @misc{MelenkNeun, author = {Melenk, Herbert and Neun, Winfried}, title = {REDUCE User s Guide for the CRAY 1 / CRAY X-MP Series Running UNICOS. Version 3.3.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4539}, number = {TR-88-02}, abstract = {This document describes operating procedures for running REDUCE specific to the CRAY 1 and CRAY X-MP computers running the Operating System UNICOS. The document was derived from the corresponding document for Vax/UNIX prepared by A. C. Hearn and L. R. Seward, The Rand Corporation, Santa Monica, (CP85).}, language = {en} } @misc{MelenkNeun, author = {Melenk, Herbert and Neun, Winfried}, title = {REDUCE Installation Guide for CRAY 1 / X-MP Systems Running UNICOS. Version 3.3.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4541}, number = {TR-88-03}, abstract = {This guide describes the CRAY/UNICOS REDUCE distribution tape and the procedures for installing, testing and maintaining REDUCE on a CRAY 1 or CRAY X-MP running UNICOS. This document was derived from the corresponding document for Vax/UNIX prepared by A. C. Hearn and L.R. Seward, The Rand Corporation, Santa Monica, publication CP84.}, language = {en} } @misc{MelenkNeun, author = {Melenk, Herbert and Neun, Winfried}, title = {Parallel Polynomial Operations in the Buchberger Algorithm.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-125}, number = {SC-88-04}, abstract = {The Buchberger algorithm is a basic tool for the solution of systems of polynomial equations in an environment of computer algebra applications. A model for overlapped processing of different steps of the algorithm is presented, which uses the data structure of the polynomials (distributive representation) for synchronization. The model can be applied for multi processors with fast access to shared data. It is tested with Cray X-MP multi processors based on a parallel version of Portable Standard Lisp (PSL 3.4).}, language = {en} } @misc{MelenkMoellerNeun, author = {Melenk, Herbert and M{\"o}ller, H. Michael and Neun, Winfried}, title = {Symbolic Solution of Large Stationary Chemical Kinetics Problems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-157}, number = {SC-88-07}, abstract = {The paper presents a new application of computer algebra to the treatment of steady states of reaction systems. The method is based on the Buchberger algorithm. This algorithm was modified such that it can exploit the special structure of the equations derived from reaction systems, so even large systems can be handled. In contrast to numerical approximation techniques, the algebraic solution gives a complete and definite overview of the solution space and it is even applicable when parameter values are unknown or undetermined. The algorithm, its adaptation to the problem class and its application to selected examples are presented.}, language = {en} }