Bibliothek

Beschreibung: An edge of a perfect graph $G$ is critical if $G-e$ is imperfect. We would like to decide whether $G - e$ is still {\sl almost perfect} or already {\sl very imperfect}. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.

Beschreibung: Collection of abstracts of the first SIAM-EMS conference Applied Mathematics in our Changing World'' in Berlin, September 2-6, 2001.

Beschreibung: {\sc Zimpl} is a little language to translate the mathematical model of a problem into a linear or (mixed-)integer mathematical program expressed in {\tt lp} or {\tt mps} file format which can be read by a LP or MIP solver.

Beschreibung: Given a set of service requests (events), a set of guided servers (units), and a set of unguided service contractors (conts), the vehicle dispatching problem {\sl vdp} is the task to find an assignment of events to units and conts as well as tours for all units starting at their current positions and ending at their home positions (dispatch) such that the total cost of the dispatch is minimized. The cost of a dispatch is the sum of unit costs, cont costs, and event costs. Unit costs consist of driving costs, service costs and overtime costs; cont costs consist of a fixed cost per service; event costs consist of late costs linear in the late time, which occur whenever the service of the event starts later than its deadline. The program \textsf{ZIBDIP} based on dynamic column generation and set partitioning yields solutions on heavy-load real-world instances (215 events, 95 units) in less than a minute that are no worse than 1\% from optimum on state-of-the-art personal computers.

Beschreibung: Scenario tree models of stochastic programs arise naturally under standard nonanticipativity assumptions. We demonstrate how tree-sparse programs cover the general case, with \emph{arbitrary} information constraints. Detailed examples and intuitive interpretations illuminate the basic thoughts behind the abstract but elementary construction.

Beschreibung: In this paper we present an algorithm that accelerates 3D texture-based volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and the number of texture bricks -- a prerequisite for fast rendering. Comparing our approach to an octree based algorithm we show that our algorithm increases rendering performance significantly for sparse data. A further advantage is that less parameter tuning is necessary.

Beschreibung: Mathematical optimization techniques are on their way to becoming a standard tool in chemical process engineering. While such approaches are usually based on deterministic models, uncertainties such as external disturbances play a significant role in many real-life applications. The present article gives an introduction to practical issues of process operation and to basic mathematical concepts required for the explicit treatment of uncertainties by stochastic optimization.

Beschreibung: Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. UCMC aims at avoiding the typical metastable or trapping behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. Therefore, the state space of the chain has to be hierarchically decomposed into its metastable conformations. This is done by means of combining the technique of conformation analysis as recently introduced by the authors, and appropriate annealing strategies. We present a detailed examination of the uncoupling-coupling procedure which uncovers its theoretical background, and illustrates the hierarchical algorithmic approach. Furthermore, application of the UCMC algorithm to the $n$-pentane molecule allows us to discuss the effect of its crucial steps in a typical molecular scenario.

Beschreibung: Standard model predictive control for real-time operation of industrial production processes may be inefficient in the presence of substantial uncertainties. To avoid overly conservative disturbance corrections while ensuring safe operation, random influences should be taken into account explicitly. We propose a multistage stochastic programming approach within the model predictive control framework and apply it to a distillation process with a feed tank buffering external sources. A preliminary comparison to a probabilistic constraints approach is given and first computational results for the distillation process are presented.

Beschreibung: Dynamic stochastic programs are prototypical for optimization problems with an inherent tree structure inducing characteristic sparsity patterns in the KKT systems of interior methods. We propose an integrated modeling and solution approach for such tree-sparse programs. Three closely related natural formulations are theoretically analyzed from a control-theoretic viewpoint and compared to each other. Associated KKT solution algorithms with linear complexity are developed and comparisons to other interior approaches and related problem formulations are discussed.

Beschreibung: We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly enviroment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size~$B\in\mathbb{N}$. The packing process is subject to the constraint that at any moment in time at most $q\in\mathbb{N}$ bins may be partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item must be packed without knowledge of any future items. We investigate the existence of competitive online algorithms for the online uniform binpacking problem. We show upper bounds for the bin coloring problem. We prove an upper bound of $3q$ - 1 and a lower bound of $2q$ for the competitive ratio of a natural greedy-type algorithm, and show that surprisingly a trivial algorithm which uses only one open bin has a strictly better competitive ratio of $2q$ - 1. Morever, we show that any deterministic algorithm has a competitive ratio $\Omega (q)$ and that randomization does not improve this lower bound even when the adversary is oblivious.

Beschreibung: In circuit switching networks call streams are characterized by their mean and peakedness (two-moment method). The $GI/M/C/0$ system is used to model a single link, where the $GI$-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a $GI/M/C/0$ system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d.\ holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used rigorously. The main result of this paper is an efficient algorithm for computing the moments of the freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.

Beschreibung: In this work we concentrate on developing methods which determine good lower bounds for set partitioning problems (SPP) in an appropriate amount of time. We found out that it makes sense to use the Lagrangian relaxation method for this task. The Lagrangian relaxed problem of SPP has a simple structure, which leads to algorithms and heuristics, whose total complexity per iteration depends linearly on the number of non-zeros of the problem matrix of SPP. In contrast, other methods like simplex methods or interior point methods have a complexity of higher order. Because the problem matrices of our tested instances are sparse, the linear dependence becomes an advantage for the algorithms and heuristics mentioned above. As a reference for the state-of-the-art we have applied the dual simplex method and the barrier function method, implemented in CPLEX. The methods, which we have developed and compared with those of CPLEX, are SBM, CAM, CCBM, and CBM. SBM is a subgradient bundle method derived from the basic subgradient method, which is a global convergent method for determining the maximum of concave functions. CAM is a coordinate ascent method, where the convex coordinate bundle method CCBM and the coordinate bundle method CBM are derivatives from CAM. We observed that the basic subgradient and the coordinate ascent method are improved if bundling techniques can be used. But the motivation for bundling differs for both approaches. In the former case bundling helps to approximate a minimum norm subgradient, which provides a steepest ascent direction, in order to speed up the performance. In the latter case bundling enables proceeding along directions, which are not restricted on the coordinate directions. By this the performance is accelerated. Among all used techniques stabilization is worth mentioning. Stabilization improves the performance especially at the beginning by avoiding too big steps during the proceeding. This leads to a more stabilized progression. Stabilization was successfully applied to SBM, CAM, CCBM, and CBM. As an overall result we conclude the following: \begin{enumerate} \item CPLEX computes the optimal objective values, whereas SBM and CBM has on average a gap of under $1.5\%$. \item In comparison to CPLEX baropt, SBM, CAM, and CBM the algorithm CCBM has a slow convergence because of the convex combination of ascent coordinate directions. An alternative is to relax the convex combination to a simple sum of the corresponding directions. This idea is realized in CBM. \item If we focus on the running time rather than on optimality then CBM is on average the fastest algorithm. \end{enumerate} Note that methods like SBM or CBM are applied on static SPP instances in order to determine a good lower bound. For solving SPP we need dynamical methods. Due to the complex topic of dynamical methods we will not discuss them, but a certain technique is worth mentioning. It is called column generation. We have indicated that this technique needs good Lagrangian multipliers of the corresponding SPP instances in order to generate further columns (in our case duties), which are added to the current SPP instance. Those multipliers are by-products of methods like our six considered methods. Due to the large number of such generation steps the running time depends on the computation time of these methods. Therefore, CBM fits more to this technique than CPLEX baropt or SBM. To sum it up it can be said that applications such as a duty scheduling can be described as set partitioning problems, whose lower bound can be solved by simplex, interior points, subgradient, or coordinate ascent methods. It turns out that the interior points method CPLEX baropt and the heuristic CBM have good performances. Furthermore, good Lagrangian multipliers, which are by-products of these methods, can be used by techniques like column generation. For this particular technique it also turns out that among our tested algorithms CBM is the most efficient one. In general we can state that real-world applications, which have to solve a large number of Lagrangian relaxed SPP instances can improve their performance by using CBM.

Beschreibung: The success of large-scale multi-national projects like the forthcoming analysis of the LHC particle collision data at CERN relies to a great extent on the ability to efficiently utilize computing a management software (Datagrid, Globus, etc.), while the effective integration of computing nodes has been largely neglected up to now. This is the focus of our work. We present a framework for a high-performance cluster that can be used as a reliable computing node in the Grid. We outline the cluster architecture, the management of distributed data and the seamless intergration of the cluster into the Grid environment.

Beschreibung: A new approach to the numerical solution of optimal control problems including control and state constraints is presented. Like hybrid methods, the approach aims at combining the advantages of direct and indirect methods. Unlike hybrid methods, however, our method is directly based on interior-point concepts in function space --- realized via an adaptive multilevel scheme applied to the complementarity formulation and numerical continuation along the central path. Existence of the central path and its continuation towards the solution point is analyzed in some theoretical detail. An adaptive stepsize control with respect to the duality gap parameter is worked out in the framework of affine invariant inexact Newton methods. Finally, the performance of a first version of our new type of algorithm is documented by the successful treatment of the well-known intricate windshear problem.

Beschreibung: By computed tomography data (CT), the individual geometry of the mandible is quite well reproduced, also the separation between cortical and trabecular bone. Using anatomical knowledge about the architecture and the functional potential of the masticatory muscles, realistic situations were approximated. The solution of the underlying partial differential equations describing linear elastic material behaviour is provided by an adaptive finite element method. Estimations of the discretization error, local grid refinement, and multilevel techniques guarantee the reliability and efficiency of the method.

Beschreibung: Optimization is the task of finding an optimum solution to a given problem. When the decision variables are discrete we speak of a combinatorial optimization problem. Such a problem is online when decisions have to be made before all data of the problem are known. And we speak of a real-time online problem when online decisions have to be computed within very tight time bounds. This paper surveys the are of combinatorial online and real-time optimization, it discusses, in particular, the concepts with which online and real-time algorithms can be analyzed.

Beschreibung: This paper describes a new simulation tool for the prediction of aerosol formation and behavior in gas--liquid contact devices such as absorbers, scrubbers, quench coolers, and condensers as well as multistage gas cleaning processes, respectively. Aerosol formation can impact severely the separation efficiency of gas cleaning processes. Aerosol or fog formation can arise by spontaneous condensation or desublimation in supersaturated gas phases. The rigorous description of the mass and energy transfer between the gas phase, the liquid phase, and the growing aerosol droplets leads to a system of partial differential and algebraic equations. For the solution of these systems we have developed the plant simulation tool AerCoDe. This program bases upon the linearly--implicit Euler discretisation, which in combination with extrapolation permits an adaptive step size and order control. Typical simulation results of a multistage industrial flue gas scrubbing process are presented. It is shown, that experimental data can be confirmed if the number concentration of condensation nuclei as an input parameter is roughly known.

Beschreibung: This paper discusses online optimization of real-world transportation systems. We concentrate on transportation problems arising in production and manufacturing processes, in particular in company internal logistics. We describe basic techniques to design online optimization algorithms for such systems, but our main focus is decision support for the planner: which online algorithm is the most appropriate one in a particular setting? We show by means of several examples that traditional methods for the evaluation of online algorithms often do not suffice to judge the strengths and weaknesses of online algorithms. We present modifications of well-known evaluation techniques and some new methods, and we argue that the selection of an online algorithm to be employed in practice should be based on a sound combination of several theoretical and practical evaluation criteria, including simulation.

Beschreibung: Wireless communication networks employ radio frequencies to establish communication links. The available radio spectrum is very limited. To meet today's radio communication demand, this resource has to be administered and reused carefully in order to control mutual interference. The reuse can be organized via separation in space, time, or frequency, for example. The problem, therefore, arises to distribute frequencies to links in a ``reasonable manner''. This is the basic form of the frequency assignment problem. What ``reasonable'' means, how to quantify this measure of quality, which technical side constraints to consider cannot be answered in general. The exact specification of this task and its mathematical model depend heavily on the particular application considered. In this paper we discuss this issue with respect to the GSM standard for mobile communication.

Beschreibung: This paper is a summary of the Round Table: ``The Impact of Mathematical Research on Industry and Vice Versa'' held at 3ecm in Barcelona on July 11, 2000. The round table started with contributions of the three panelists. Irene Fonseca, the panel chair, opened the discussion by stating six questions addressing the main issues of the round table topic. She presented the panel's answers to these questions, drawing on many examples from her own academic experience. In the following additional presentations, the other two panel members added further points of view based on their personal involvement with industry. The round table ended with a lively discussion with members from the audience. This written summary of the oral presentations follows the structure of the round table indicated above.

Beschreibung: This article is about \emph{adaptive column generation techniques} for the solution of duty scheduling problems in public transit. The current optimization status is exploited in an adaptive approach to guide the subroutines for duty generation, LP resolution, and schedule construction toward relevant parts of a large problem. Computational results for three European scenarios are reported.

Beschreibung: The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to a primal optimal solution. Separating with respect to these approximations gives rise to a cutting plane algorithm that converges to the optimal solution under reasonable assumptions on the separation oracle and the feasible set. We have implemented a practical variant of the cutting plane algorithm for improving semidefinite relaxations of constrained quadratic 0-1 programming problems by odd-cycle inequalities. We also consider separating odd-cycle inequalities with respect to a larger support than given by the cost matrix and present a heuristic for selecting this support. Our preliminary computational results for max-cut instances on toroidal grid graphs and balanced bisection instances indicate that warm start is highly efficient and that enlarging the support may sometimes improve the quality of relaxations considerably.

Beschreibung: Many phenomena in nature and engineering happen simultaneously on rather diverse spatial and temporal scales, i.e.\ exhibit a multi-scale character. Therefore various hierarchical data structures and numerical schemes have been devised to represent quantitatively such phenomena. A special numerical multilevel technique, associated with a particular hierarchical data structure, is so-called Adaptive Mesh Refinement (AMR). This scheme achieves locally very high spatial and temporal resolutions. Due to its popularity, many scientists are in need of interactive visualization tools for AMR data. In this article we present a 3D texture-based volume rendering algorithm for AMR data, that directly utilizes the hierarchical structure. Thereby interactive rendering even for large data sets is achieved. In particular the problems of interpolation artifacts, opacity corrections, and texture memory limitations are addressed. The algorithm's value in practice is demonstrated with simulation and image data.

Beschreibung: By combining techniques of preparation, histology, confocal microscopy, data visualization and data processing, we have created and recently published a standard brain model for drosophila and honey bee brains. This report describes the algorithms and implementation of the corresponding software modules. At the same time it serves as a user's guide for scientist who want to reproduce the results for differerent species or mutants.

Beschreibung: Several classes of systems of evolution equations with one or two vector unknowns are considered. We investigate also systems with one vector and one scalar unknown. For these classes all equations having the simplest higher symmetry are listed.

Beschreibung: Two traffic streams $\Phi_1$, $\Phi_2$ are offered a link. The calls of $\Phi_i$ require exponential holding times with parameter $\mu$ and are accepted if less than $C_i$ trunks are occupied. Approximating the $\Phi_i$ by appropriate renewal processes meeting their first two moments, defined as the moments of the numbers of calls in virtual links of infinite capacity to which the traffic streams as freed traffics are virtually directed and where the calls get fresh exponential i.i.d.\ holding times with parameter $\mu$, stable recursive algorithms of complexity $O(\max(C_1,C_2))$ are derived for the first two defined as above moments of the individual overflow and freed carried traffics. The results offer a unified handling of both overflow and carried traffics in circuit switching networks with trunk reservation, providing a basis for new two-moment network dimensioning algorithms.

Beschreibung: We study the performance of QCD simulations with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering on $10^4$ and $12^4$ lattices. In order to compare tempered with standard simulations, covariance matrices between sub-ensembles have to be formulated and evaluated using the general properties of autocorrelations of the parallel tempering algorithm. We find that rendering the hopping parameter $\kappa$ dynamical does not lead to an essential improvement. We point out possible reasons for this observation and discuss more suitable ways of applying parallel tempering to QCD.

Beschreibung: We report numerical results for SBmethod --- a publically available implementation of the spectral bundle method --- applied to the 7$^{th}$ DIMACS challenge test sets that are semidefinite relaxations of combinatorial optimization problems. The performance of the code is heavily influenced by parameters that control bundle update and eigenvalue computation. Unfortunately, no mathematically sound guidelines for setting them are known. Based on our experience with SBmethod, we propose heuristics for dynamically updating the parameters as well as a heuristc for improving the starting point. These are now the default settings of SBmethod Version 1.1. We compare their performance on the DIMACS instances to our previous best choices for Version 1.0. SBmethod Version 1.1 is also part of the independent DIMACS benchmark by H.~Mittelmann. Based on these results we try to analyze strengths and weaknesses of our approach in comparison to other codes for large scale semidefinite programming.

Beschreibung: Many {\cal NP}-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for diverse optimization problems. To apply a tree decomposition approach, the treewidth of the graph has to be determined, independently of the application at hand. Although for fixed $k$, linear time algorithms exist to solve the decision problem ``treewidth $\leq k$'', their practical use is very limited. The computational tractability of treewidth has been rarely studied so far. In this paper, we compare four heuristics and two lower bounds for instances from applications such as the frequency assignment problem and the vertex coloring problem. Three of the heuristics are based on well-known algorithms to recognize triangulated graphs. The fourth heuristic recursively improves a tree decomposition by the computation of minimal separating vertex sets in subgraphs. Lower bounds can be computed from maximal cliques and the minimum degree of induced subgraphs. A computational analysis shows that the treewidth of several graphs can be identified by these methods. For other graphs, however, more sophisticated techniques are necessary.

Beschreibung: The currently most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations for probabilistic networks, that is, triangulations with a minimal maximum clique size. We provide a set of rules for stepwise reducing a graph, without losing optimality. This reduction allows us to solve the triangulation problem on a smaller graph. From the smaller graph's triangulation, a triangulation of the original graph is obtained by reversing the reduction steps. Our experimental results show that the graphs of some well-known real-life probabilistic networks can be triangulated optimally just by preprocessing; for other networks, huge reductions in their graph's size are obtained.

Beschreibung: {\begin{rawhtml} 〈a href="http://dx.doi.org/10.1007/s10479-007-0178-0"〉 Revised Version unter http://dx.doi.org/10.1007/s10479-007-0178-0〈/a〉 \end{rawhtml}} Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modelling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances.

Beschreibung: The pole condition is a general concept for the theoretical analysis and the numerical solution of a variety of wave propagation problems. It says that the Laplace transform of the physical solution in radial direction has no poles in the lower complex half-plane. In the present paper we show that for the Helmholtz equation with a radially symmetric potential the pole condition is equivalent to Sommerfeld's radiation condition. Moreover, a new representation formula based on the pole condition is derived and used to prove existence, uniqueness and asymptotic properties of solutions. This lays the foundations of a promising new algorithm to solve time-harmonic scattering problems numerically and provides a new approach for analyzing existing algorithms such as the Perfectly Matched Layer (PML) method and the Bayliss-Gunzburger-Turkel (BGT) algorithm.

Beschreibung: In this paper we study the PML method for Helmholtz-type scattering problems with radially symmetric potential. The PML method consists in surrounding the computational domain by a \textbf{P}erfectly \textbf{M}atched sponge \textbf{L}ayer. We prove that the approximate solution obtained by the PML method converges exponentially fast to the true solution in the computational domain as the thickness of the sponge layer tends to infinity. This is a generalization of results by Lassas and Somersalo based on boundary integral eqaution techniques. Here we use techniques based on the pole condition instead. This makes it possible to treat problems without an explicitly known fundamental solution.

Beschreibung: The paper's main result is a simple derivation rule for the Jacobi polynomials with respect to their parameters, i.e. for $\partial_{\alpha} P_n^{\alpha,\beta}$, and $\partial_{\beta} P_n^{\alpha,\beta}$. It is obtained via relations for the Gaussian hypergeometric function concerning parameter derivatives and integer shifts in the first two arguments. These have an interest on their own for further applications to continuous and discrete orthogonal polynomials. The study is motivated by a Galerkin method with moving weight, presents all proofs in detail, and terminates in a brief discussion of the generated polynomials.

Beschreibung: We derive a simple accuracy matching strategy for inexact Gauss Newton methods and apply it to the numerical solution of boundary value problems of ordinary differential equations by collocation. The matching strategy is based on an affine contravariant convergence theorem, i. e. , the characteristic constants are invariant under affine transformations of the domain. The inexact Gauss Newton method is applied to an integral formulation of the BVP. As discretization for the arising linear subproblems we employ adaptive collocation at Gaussian nodes with varying local orders and stepsizes. The grids are chosen via adaptive refinement and order selection.

Beschreibung: In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types of identities for those functions. Some of these identities like differential equations, power series representations, and hypergeometric representations can even dealt with algorithmically, i.\ e.\ they can be computed by the Computer Algebra system, rather than only verified. The types of functions that can be treated by the given technique cover the generalized hypergeometric functions, and therefore most of the special functions that can be found in mathematical dictionaries. The types of identities for which we present verification algorithms cover differential equations, power series representations, identities of the Rodrigues type, hypergeometric representations, and algorithms containing symbolic sums. The current implementations of special functions in existing Computer Algebra systems do not meet these high standards as we shall show in examples. They should be modified, and we show results of our implementations.

Beschreibung: {\newcommand{\R} {{\rm {\mbox{\protect\makebox[.15em][l]{I}R}}}} Given a list of $n$ numbers in $\R $, one wants to decide wether every number in the list occurs at least $k$ times. I will show that $(1-\epsilon)n\log_3(n/k)$ is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lov\'asz method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general.}

Beschreibung: We present an adaptive Rothe method for two--dimensional problems combining an embedded Runge--Kutta scheme in time and a multilevel finite element discretization in space. The spatial discretization error is controlled by a posteriori error estimates based on interpolation techniques. A computational example for a thermodiffusive flame propagation model illustrates the high accuracy that is possible with the proposed method.

Beschreibung: The multicommodity linear formulation of the Fixed Charge Network Flow Design problem is known to have significantly sharp linear relaxation lower bounds. However the tradeoff is the introduction of a large amount of artificial variables. We exhibit a class of special instances for which the lower bound is tight. Further we completly describe the polyhedron in the space of the natural variables.

Beschreibung: Die von der DMV-Fachgruppe Scientific Computing in Kooperation mit dem gleichnamigen GAMM-Fachausschuss organisierte Tagung \glqq Scientific Computing in der Theoretischen Physik\grqq~fand vom 16. - 18. März 1994 am Fachbereich Mathematik und Informatik der Freien Universität Berlin statt. Ziel des Workshops war, die Kontakte zwischen den Fachleuten der Gebiete {\em Computational Physics} und {\em Scientific Computing} zu intensivieren. Schwerpunkte des Workshops waren numerische Simulation von Transportmodellen der Astrophysik und Halbleiterphysik, Multilevel-Methoden für partielle Differentialgleichungen sowie Monte-Carlo-Methoden und molekulardynamische Verfahren für Probleme der Statistischen Physik und Quantenfeldtheorie. Der Workshop fand ein äusserst positives Echo und führte über 70 Teilnehmer der verschiedenen Teilgebiete der Theoretischen Physik und ca. 50 Teilnehmer aus dem Bereich der Numerischen Mathematik zusammen. \originalTeX

Beschreibung: We give an overview of an approach on special functions due to Truesdell, and show how it can be used to develop certain type of identities for special functions. Once obtained, these identities may be verified by an independent algorithmic method for which we give some examples.

Beschreibung: {\newcommand{\N} {{\rm {\mbox{\protect\makebox[.15em][l]{I}N}}}} In several publications the first author published an algorithm for the conversion of analytic functions for which derivative rules are given into their representing power series $\sum\limits_{k=0}^{\infty}a_{k}z^{k}$ at the origin and vice versa, implementations of which exist in {\sc Mathematica}, {\sc Maple} and {\sc Reduce}. One main part of this procedure is an algorithm to derive a homogeneous linear differential equation with polynomial coefficients for the given function. We call this type of ordinary differential equations {\sl simple}. Whereas the opposite question to find functions satisfying given differential equations is studied in great detail, our question to find differential equations that are satisfied by given functions seems to be rarely posed. In this paper we consider the family $F$ of functions satisfying a simple differential equation generated by the rational, the algebraic, and certain transcendental functions. It turns out that $F$ forms a linear space of transcendental functions. % with polynomial function coefficients. Further $F$ is closed under multiplication and under the composition with rational functions and rational powers. These results had been published by Stanley who had proved them by theoretical algebraic considerations. In contrast our treatment is purely algorithmically oriented. We present algorithms that generate simple differential equation for $f+g$, $f\cdot g$, $f\circ r$ ($r$ rational), and $f\circ x^{p/q}$ ($p,q\in\N_0$), given simple differential equations for $f$, and $g$, and give a priori estimates for the order of the resulting differential equations. We show that all order estimates are sharp. After finishing this article we realized that in independent work Salvy and Zimmermann published similar algorithms. Our treatment gives a detailed description of those algorithms and their validity.}

Beschreibung: The power of the symbolic math system {\small REDUCE} for solving large and difficult problems in science and engineering is demonstrated by a set of model problems. These include algebraic equation solving, formal variable elimination, formal power series, symbolic treatment of differential equations and applications from theoretical physics.

Beschreibung: Results from finite-element-calculations are usually visualized by colored surface- and contour-line-plots or polygonal patches or simply displaced lines and grids. In computer graphics however more advanced techniques like texture-mapping and NURBS are well established and there exist efficient algorithms and implementations. We show that these techniques are not only easy to use, but form a very natural and far more efficient approach for visualization of higher order finite-element's solutions like in $p$- and $h$-$p$-version. Texture-mapping is useful for displaying vector-valued data, too.

Beschreibung: In Quantum Chemistry the field of Laser--Assisted Molecular Control'' has received a considerable amount of attention recently. One key problem in this new field is the simulation of the dynamical reaction of a molecule subjected to external radiation. This problem is described by the Schrödinger equation, which, after eigenfunction expansion, can be written in the form of a large system of ordinary differential equations, the solutions of which show a highly oscillatory behaviour. The oscillations with high frequencies and small amplitudes confine the stepsizes of any numerical integrator -- an effect, which, in turn, blows up the simulation time. Larger stepsizes can be expected by averaging these fast oscillations, thus smoothing the trajectories. Standard smoothing techniques (averaging, filtering) would kill the whole process and thus, lead to wrong numerical results. To avoid this unwanted effect and nevertheless speed up computations, this paper presents a quasiresonant smoothing algorithm (QRS). In QRS, a natural splitting parameter $\delta$ controls the smoothing properties. An adaptive QRS--version (AQRS) is presented which includes an error estimation scheme for choosing this parameter $\delta$ in order to meet a given accuracy requirement. In AQRS $\delta$ is permanently adapted to the solution properties for computing the chemically necessary information'' only. The performance of AQRS is demonstrated in several test problems from the field Laser--Assisted Selective Excitation of Molecules'' in which the external radiation is a picosecond laser pulse. In comparison with standard methods speedup factors of the order of $10^2$ are observed.

Beschreibung: This article describes the REDUCE package ZEILBERG implemented by Gregor Stölting and the author. The REDUCE package ZEILBERG is a careful implementation of the Gosper (The sum package contains also a partial implementation of the Gosper algorithm.) and Zeilberger algorithms for indefinite, and definite summation of hypergeometric terms, respectively. An expression $a_k$ is called a {\sl hypergeometric term} (or {\sl closed form}), if $a_{k}/a_{k-1}$ is a rational function with respect to $k$. Typical hypergeometric terms are ratios of products of powers, factorials, $\Gamma$ function terms, binomial coefficients, and shifted factorials (Pochhammer symbols) that are integer-linear in their arguments.

Beschreibung: We test the performance of the multicanonical approach for biological molecules. The simulated molecules are frustrated systems with a complicated energy landscape. The resulting slowing down in simulations is alleviated by our ansatz. We perform a multicanonical simulation of nonpolar amino acids and study their $\alpha$-helix propensities. The results are shown to be in agreement with recent experimental results.

Beschreibung: In an array of coupled oscillators {\em synchronous chaos} may occur in the sense that all the oscillators behave identically although the corresponding motion is chaotic. When a parameter is varied this fully symmetric dynamical state can lose its stability, and the main purpose of this paper is to investigate which type of dynamical behavior is expected to be observed once the loss of stability has occurred. The essential tool is a classification of Lyapunov exponents based on the symmetry of the underlying problem. This classification is crucial in the derivation of the analytical results but it also allows an efficient computation of the dominant Lyapunov exponent associated with each symmetry type. We show how these dominant exponents determine the stability of invariant sets possessing various instantaneous symmetries and this leads to the idea of {\em symmetry breaking bifurcations of chaotic attractors}. Finally the results and ideas are illustrated for several systems of coupled oscillators.

Beschreibung: We present new Monte Carlo results in non-compact lattice QED with staggered fermions down to $m_0 = 0.005$. This extends our previous investigations on the nature of the continuum limit of QED.

Beschreibung: The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called hypergeometric term if both $F(n+1,k)/F(n,k)$ and $F(n,k+1)/F(n,k)$ are rational functions. Typical examples are ratios of products of exponentials, factorials, $\Gamma$ function terms, binomial coefficients, and Pochhammer symbols that are integer-linear with respect to $n$ and $k$ in their arguments. We consider the more general case of ratios of products of exponentials, factorials, $\Gamma$ function terms, binomial coefficients, and Pochhammer symbols that are rational-linear with respect to $n$ and $k$ in their arguments, and present an extended version of Zeilberger's algorithm for this case, using an extended version of Gosper's algorithm for indefinite summation. In a similar way the Wilf-Zeilberger method of rational function certification of integer-linear hypergeometric identities is extended to rational-linear hypergeometric identities. The given algorithms on definite summation apply to many cases in the literature to which neither the Zeilberger approach nor the Wilf-Zeilberger method is applicable. Examples of this type are given by theorems of Watson and Whipple, and a large list of identities (``Strange evaluations of hypergeometric series'') that were studied by Gessel and Stanton. It turns out that with our extended algorithms practically all hypergeometric identities in the literature can be verified. Finally we show how the algorithms can be used to generate new identities. REDUCE and MAPLE implementations of the given algorithms can be obtained from the author, many results of which are presented in the paper.

Beschreibung: We present a set of C++ classes that realize an abstract inexact Gauss Newton method in combination with a continuation process for the solution of parameter dependent nonlinear problems. The object oriented approach allows the continuation of different types of solutions within the same framework. \\{\bf Abstract: }We present a set of C++ classes that realize an abstract inexact Gauss Newton method in combination with a continuation process for the solution of parameter dependent nonlinear problems. The object oriented approach allows the continuation of different types of solutions within the same framework.

Beschreibung: We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes and similar linear programs with exponential decreasing paths. The analysis of two randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus we disprove two bounds conjectured in the literature. At the same time, we establish quadratic upper bounds for random pivots on the linear programs under investigation. This motivates the question whether some randomized pivot rules possibly have quadratic worst-case behavior on general linear programs.

Beschreibung: We consider nested iterations, in which the multigrid method is replaced by some simple basic iteration procedure, and call them {\em cascadic iterations}. They were introduced by Deuflhard, who used the conjugate gradient method as basic iteration (CCG method). He demonstrated by numerical experiments that the CCG method works within a few iterations if the linear systems on coarser triangulations are solved accurately enough. Shaidurov subsequently proved multigrid complexity for the CCG method in the case of $H^2$-regular two-dimensional problems with quasi-uniform triangulations. We show that his result still holds true for a large class of smoothing iterations as basic iteration procedure in the case of two- and three-dimensional $H^{1+\alpha}$-regular problems. Moreover we show how to use cascadic iterations in adaptive codes and give in particular a new termination criterion for the CCG method.

Beschreibung: The results from invariant theory and the results for semi-invariants and equivariants are summarized in a way suitable for the combination with Gröbner basis computation. An algorithm for the determination of fundamental equivariants using projections and a Poincar\'{e} series is described. Secondly, an algorithm is given for the representation of an equivariant in terms of the fundamental equivariants. Several ways for the exact determination of zeros of equivariant systems are discussed

Beschreibung: We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and devices. We present alternative integer programming formulations for this problem and discuss the links between these formulations. Having chosen to work in the space of edges of the multicut, we investigate the convex hull of incidence vectors of feasible multicuts. In particular, several classes of inequalities are introduced, and their strength and robustness are analyzed as various problem parameters change.

Beschreibung: In this paper we consider the problem of $k$-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for so-called cycle, cycle with ears, knapsack tree and path-block-cycle inequalities. The separation heuristics, plus primal heuristics, have been implemented in a branch-and-cut routine using a formulation including the edges with nonzero costs and node variables. Results are presented for three classes of problems: equipartitioning problems arising in finite element methods and partitioning problems associated with electronic circuit layout and compiler design.

Beschreibung: {\def\N{{\mbox{{\rm I\kern-0.22emN}}}} Let a set $N$ of items, a capacity $F \in \N$ and weights $a_i \in \N$, $i \in N$ be given. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality $$\sum_{i \in N} a_i x_i \leq F.$$ In this paper we present a linear description of the 0/1 knapsack polytope for the special case where $a_i \in \{\mu,\lambda\}$ for all items $i \in N$ and $1 \leq \mu 〈 \lambda \leq b$ are two natural numbers. The inequalities needed for this description involve elements of the Hilbert basis of a certain cone. The principle of generating inequalities based on elements of a Hilbert basis suggests further extensions.}

Beschreibung: We compare a few variants of the recently proposed multicanonical method with the well known simulated annealing for the effectiveness in search of the energy global minimum of a biomolecular system. For this we study in detail Met-enkephalin, one of the simplest peptides. We show that the new method not only outperforms simulated annealing in the search of the energy groundstate but also provides more statistical-mechanical information about the system.

Beschreibung: We demonstrate the effectiveness of the multicanonical algorithm for the tertiary structure prediction of peptides and proteins. Unlike to simulated annealing the relationship to the canonical ensemble remains exactly controlled. Hence, the new method allows not only the prediction of the lowest-energy conformation, but also the calculation of thermodynamic quantities at various temperature from one run.

Beschreibung: Large chemical computations show the need for full adaptivity supporting the development of robust and highly efficient programs. For solutions possessing sharp moving spatial transitions, as travelling wavefronts or emerging boundary and internal layers, an automatic adjustment of both the space and the time stepsize is generally accepted to be more successful in efficient resolving critical regions of high spatial and temporal activity. In contrast to the widespread discretization sequence first space then time the reversed sequence first time then space is employed. Full adaptivity of the proposed algorithm is realized by combining embedded time discretization and multilevel finite element space discretization. In this paper the algorithm is described for one--dimensional problems. The numerical results show the significantly new perspectives opened by this approach.

Beschreibung: An error controlled finite elemente method (FEM) for solving stationary Schrödinger equations in three space dimensions is proposed. The method is based on an adaptive space discretization into tetrahedra and local polynomial basis functions of order $p=1$--$5$ defined on these tetrahedra. According to a local error estimator the triangulation is automatically adapted to the solution. Numerical results for standard problems appearing in vibrational motion and molecular structure calculations are presented and discussed. Relative precisions better than 1e-8 are obtained. For equilateral H$_3^{++}$ the adaptive FEM turns out to be superior to global basis set expansions in the literature. Our precise FEM results exclude in a definite manner the stability or metastability of equilateral H$_3^{++}$ in its groundstate.

Beschreibung: {\def\NP{\hbox{$\cal N\kern-.1667em\cal P$}} The {\sl storage assignment problem} asks for the cost minimal assignment of containers with different sizes to storage locations with different capacities. Such problems arise, for instance, in the optimal control of automatic storage devices in flexible manufacturing systems. This problem is known to be $\NP$-hard in the strong sense. We show that the storage assignment problem is $\NP$-hard for {\sl bounded sizes and capacities}, even if the sizes have values $1$ and~$2$ and the capacities value~$2$ only, a case we encountered in practice. Moreover, we prove that no polynomial time $\epsilon$-approximation algorithm exists. This means that almost all storage assignment problems arising in practice are indeed hard.}

Beschreibung: We consider the numerical treatment of Hamiltonian systems that contain a potential which grows large when the system deviates from the equilibrium value of the potential. Such systems arise, e.g., in molecular dynamics simulations and the spatial discretization of Hamiltonian partial differential equations. Since the presence of highly oscillatory terms in the solutions forces any explicit integrator to use very small step-size, the numerical integration of such systems provides a challenging task. It has been suggested before to replace the strong potential by a holonomic constraint that forces the solutions to stay at the equilibrium value of the potential. This approach has, e.g., been successfully applied to the bond stretching in molecular dynamics simulations. In other cases, such as the bond-angle bending, this methods fails due to the introduced rigidity. Here we give a careful analysis of the analytical problem by means of a smoothing operator. This will lead us to the notion of the smoothed dynamics of a highly oscillatory Hamiltonian system. Based on our analysis, we suggest a new constrained formulation that maintains the flexibility of the system while at the same time suppressing the high-frequency components in the solutions and thus allowing for larger time steps. The new constrained formulation is Hamiltonian and can be discretized by the well-known SHAKE method.

Beschreibung: We investigate the generating sets (``Gröbner bases'') of integer lattices which correspond to the Gröbner bases of the associated binomial ideals. Extending results in Sturmfels and Thomas, preprint 1994, we obtain a geometric characterization of the universal Gröbner basis in terms of the vertices and edges of the associated corner polyhedra. We emphasize the special case where the lattice has finite index. In this case the corner polyhedra were studied by Gomory, and there is a close connection to the ``group problem in integer programming'' Schrijver, p.~363. We present exponential lower and upper bounds for the size of a reduced Gröbner basis. The initial complex of (the ideal of) a lattice is shown to be dual to the boundary of a certain simple polyhedron.

Beschreibung: We consider periodic orbits of autonomous parameter dependent ODE's. Starting from a shooting algorithm for the numerical computation of periodic orbits via an adaptive Poincar\'e-section we develop a pathfollowing algorithm for periodic solutions based on a tangential continuation method with implicit reparametrization. For ODE's equivariant w.r.t. a finite group we show that spatial as well as spatio-temporal symmetries of periodic orbits can be exploited within the (multiple) shooting context. We describe how turning points, period doubling bifurcations and Hopf points along the branch of periodic solutions can be handled. Furthermore equivariant Hopf points and generic secondary bifurcations of periodic orbits with $ Z_m$-symmetry are treated. We tested the code with standard examples, e.g., the period doubling cascade in the Lorenz equations. To show the efficiency of the described methods we also used the program for an application from electronics, a ring oscillator with $n $ inverters. In this example the exploitation of symmetry reduces the amount of work for the continuation of periodic orbits from ${\cal O}(n^2)$ to ${\cal O}(n)$

Beschreibung: In this paper we modify Buchberger's $S$-pair reduction algorithm for computing a Gröbner basis of a toric ideal so as to apply to an integer program in inequality form with fixed right hand sides and fixed upper bounds on the variables. We formulate the algorithm in the original space and interpret the reduction steps geometrically. In fact, three variants of this algorithm are presented and we give elementary proofs for their correctness. A relationship between these (exact) algorithms, iterative improvement heuristics and the Kernighan-Lin procedure is established.

Beschreibung: Adopting a statistical approach for the computation of turbulent combustion flows an approximation for the probability density function (PDF) of the composition variables is often required to treat the highly non-linear reaction term in a satisfactory way. One class of methods currently being used are the moment methods which employ transport equations for low order statistical moments and use a parametrized shape of the PDF. A second class solves a transport equation for the joint PDF by a Monte Carlo method. In the present paper we develop an intermediate algorithm based on a Galerkin method for the PDF transport equation. The solution is developed in terms of an orthogonal or bi-orthogonal basis of a suitable Hilbert space. The unconventional use of the related weight function as a prefactor (moving weight approach) permits adaptivity and results in a generalization of the $\beta-$closure for bounded scalar quantities. We present the approximation procedure in detail and apply it to the evolution of the composition in a homogeneous well-stirred reactor. The extension to non-homogeneous flow simulations is straightforward.

Beschreibung: Combinatorial optimization problems pervade many areas of human problem solving especially in the fields of business, economics and engineering. Intensive mathematical research and vast increases in raw computing power have advanced the state of the art in exact and heuristic problem solving at a pace that is unprecedented in human history. We survey here in layman's terms some of the fundamental concepts and principles that have led this progress. (This article will appear -- possibly in modified form -- in a popular science magazine.)

Beschreibung: {\def\N{{\mbox{{\rm I\kern-0.22emN}}}} Given a set $N$ of items and a capacity $b \in \N$, and let $N_j$ be the set of items with weight $j$, $1 \leq j \leq b$. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality $$\sum_{j=1}^b \sum_{i \in N_j} jx_i \leq b.$$ In this paper we first present a complete linear description of the 0/1 knapsack polytope for two special cases: (a) $N_j = \emptyset$ for all $1 〈 j \leq \lfloor {b \over 2} \rfloor$ and (b) $N_j = \emptyset$ for all $1 〈 j \leq \lfloor {b \over 3} \rfloor$ and $N_j = \emptyset$ for all $j \geq \lfloor {b \over 2} \rfloor + 1$. It turns out that the inequalities that are needed for the complete description of these special polytopes are derived by means of some ``reduction principle''. This principle is then generalized to yield valid and in many cases facet defining inequalities for the general 0/1 knapsack polytope. The separation problem for this class of inequalities can be solved in pseudo polynomial time via dynamic programming techniques.}

Beschreibung: In the field of deep regional hyperthermia, one of the most widely used devices is the BSD--2000 Hyperthermia System which employs the Sigma 60 applicator. The Sigma 60 consists of four independent sources, giving it the potential to control the energy pattern within the patient. The independent amplitudes and phases, as well as frequency selection and applicator position, present a large number of parameters for the operator to determine. Computer simulation has long been recognized as an attractive approach to optimizing these parameters. A treatment planning program was used in clinical practice at Stanford University Medical Center for two years. It demonstrated the feasibility of computer simulation for deep regional hyperthermia in a clinical situation. However, several parts of this system were written in a language specific to one workstation, which severely restricted the wider distribution of the program to other users of the Sigma 60. A new treatment planning system for the BSD 2000 has been developed and put into clinical practice at the Rudolf Virchow Clinic of the Free University of Berlin. The new method, which we will refer to as the Berlin system, has a simpler model construction program and a considerably better graphics capability. However, the most important feature is that all programs are written in FORTRAN, C, or the X Window graphics system. Therefore, the entire treatment planning system is completely portable to other workstations.

Beschreibung: In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing.

Beschreibung: The aim of this paper is to compute all isolated solutions to symmetric polynomial systems. Recently, it has been proved that modelling the sparse structure of the system by its Newton polytopes leads to a computational breakthrough in solving the system. In this paper, it will be shown how the Lifting Algorithm, proposed by Huber and Sturmfels, can be applied to symmetric Newton polytopes. This symmetric version of the Lifting Algorithm enables the efficient construction of the symmetric subdivision, giving rise to a symmetric homotopy, so that only the generating solutions have to be computed. Efficiency is obtained by combination with the product homotopy. Applications illustrate the practical significance of the presented approach.

Beschreibung: In this paper we describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are defined via an inductive scheme that can also be used in a more general setting.

Beschreibung: \begin{footnotesize} \noindent Combining electronic specialized information, such as electronic information retrieval from central databases, with the new means of communication opens up new perspectives for mathematics in Germany. Based on the current Fachinformationsprojekt (Specialized Information Project) run by the Deutsche Mathematiker-Vereinigung (DMV) and supported by the Federal Minister for Research and Technology (BMFT), the DMV is planning a new infrastructure activity for mathematics. This activity will not only include mathematical university departments and research institutes, but also partners from mathematical research laboratories in industry as well as suppliers of mathematical information, in particular, scientific publishing houses, the Technical Information Library (TIB) Hannover, university libraries and -- last but not least -- the Fachinformationszentrum (FIZ) Karlsruhe with the Zentralblatt für Mathematik. \noindent On the technical basis of the Internet and its worldwide information services (Gopher, WAIS, World Wide Web, Hyper-G, ftp and e-mail), a distributed mathematical information system is to be created, whose partners make their local resources available both to other partners and to the worldwide Internet community. These aims can be achieved by means of the consequent use of software that is structured according to the client-server model and distributed and accepted within the Internet. \noindent Providing the technical equipment, however, is by far not enough. Without the creation of a personal, technical and organizational infrastructure, realization of such a project will not be possible. For every partner the realization of the following measures is envisaged:\\[-7mm] \noindent \end{footnotesize} \begin{small} \begin{itemize} \item[*] Establishing an Information Coordinator\/ at every participating institution\\[-8mm] \item[*] Creation of a Forum for Mathematical Information\/\\[-8mm] \item[*] Installation and maintenance of Mathematical Information Stations\/\\[-8mm] \item[*] Participation in national and international Standardization Activities\/\\[-8mm] \item[*] Regular workshops and training courses, public relations\\[-7mm] \end{itemize} \noindent The following activities (carried out by all partners or within pilot projects by special groups) focusing on mathematical and mathematics-related information are planned:\\[-7mm] \noindent \begin{itemize} \item[*] Set up of Electronic Information Systems\/ by all partners \\[-8mm] \item[*] Distributed\/ electronic offer of Preprints\/ and scripts (full texts) by all partners\\[-8mm] \item[*] Distributed\/ electronic offer of Software and Data Collections\/ by all partners\\[-8mm] \item[*] Access to Global Information Systems in Mathematics\/\\[-8mm] \item[*] Organization of a Living Museum of Mathematics\/\\[-8mm] \item[*] Access to {\it Electronic Library Catalogs,}\/ esp.~to libraries of university departments\\[-8mm] \item[*] Electronic offer of Scanned Historical Books and Documents\/\\[-8mm] \item[*] Creation and management of Electronic Mathematical Journals\/\\[-8mm] \item[*] Creation of a framework for various kinds of Electronic Reviewing\/\\[-8mm] \item[*] Testing of new methods for Electronic Document Delivery\/\\[-8mm] \item[*] Electronic Project Organization\/\\[-7mm] \end{itemize} \noindent \end{small} \begin{footnotesize} The project aims, at its beginning, at the creation of an information infrastructure for database retrieval, e-mail, electronic conferencing and subject-specific information networks. Its focus is on mathematics in Germany. The general scope, however, is broader. The project is open for discussion, coordination, and cooperation with partners in other areas of science, industry or in other countries. It is also hoped that this project may form an example along which other models of electronic information and communication can be developed. Moreover, the project is also meant to enhance the offer from German mathematics to the worldwide "give and take" within the Internet community. \end{footnotesize}