Types in a mixed language system

As a support for writing software, a comprehensive set of problem oriented languages appears preferable to any so-called universal language, as soon as static checking is sufficient to ensure type correctness of the mixed language program. We lay the basis for a mixed language system where this requirement is fulfilled. The general outline of the system is first sketched. Detailed consideration is then given to our basic constructs for establishing communication between languages, namely standard types and foreign types. Abstract types, such as defined in CLU, are finally shown to be a particular class of foreign types.     

A Nonlinear Problem Associated to the Motion of a Membrane

A nonlinear model associated to the motion of a membrane is considered as limit of a sequence of approximate models, for which a global existence and uniqueness theorem can be proved. The paper investigates the relationship between the solutions of the real and approximate models.     

C-Korrespondenzenkategorien,insbesondere über der Kategorie der komplexen Räume

In § 1, the definition and several examples of C-Korrespondenzenkategorien are given. § 2 contains properties of such categories, especially concerning fibre products and images. In § 3, the existence of a smallest category of correspondences within the class of the categories of correspondences respecting images is proven.     

Complex algebraic plane curves via their links at infinity

Summary Considering that the study of plane cuves has an over 2000 year history and is the seed from which modern algebraic geometry grew, surprisingly little is known about the topology of affine algebraic plane curves. We topologically classify regular algebraic plane curves in complex affine 2-space using splice diagrams: certain decorated trees that code Puiseux data at infinity. (The regularity condition — that the curve be a typical fiber of its defining polynomial — can conjecturally be avoided.) We also show that the splice diagram determines such algebraic information as the minimal degree of the curve, even in the irregular case. Among other things, this enables algebraic classification of regular algebraic plane curves with given topology.     

Averaging of Systems with Slow Variables

We justify the averaging method for systems with delay described by both slow and fast variables. The results obtained are applied to the analysis of one problem in control theory.     

Feine Topologie am Martinrand eines Standardprozesses

Summary For a Standard process admitting a dual process and satisfying Hypothesis (B) of Kunita and Watanabe, we investigate the limit behavior of excessive functions. First we analyse two concepts of fine topology on the Martin compactification of the state space, which are suggested by classical potential theory. We then prove several versions of the Fatou-Doob theorem: h-excessive functions have a limit in _h -almost every Martin boundary point — a) almost surely along -paths, b) with respect to the fine topology, c) with respect to the Martin topology outside of a set which is thin in .

---

---

Die Arbeit entstand im Rahmen eines von der Deutschen Forschungsgemeinschaft finanzierten Forschungsvorhabens.     

A monte carlo model for simulation of tank battles

A Monte Carlo model for simulation of company-level tank battles is described. The simulation is started with an observation phase. The probability of discovery is dependent upon properties of the terrain etc. Target selection is simulated deterministically with priority rules. Every unit belongs to one of the following states of fight: undamaged, able to shoot only, able to move only, shocked and out of action.It is possible to simulate surprise attacks and battles after a sudden contact if the units are assumed to fight from the same position during the whole battle. In a later version of the model, the units are permitted to show as much of themselves as they wish during the battle. Thus it is possible to simulate (small) changes of position, initiated by the current events.     

Discrete facility location with nonlinear diseconomies in fixed costs

A discrete facility location problem is formulated where the total fixed cost for establishing the facilities includes a component that is a nonlinear function of the number of facilities being established. Some theoretical properties of the solution are derived when this fixed cost is a convex nondecreasing function of the number of facilities. Based on these properties an efficient bisection heuristic is developed where at each iteration, the classical uncapacitated facility location and/or m-median subproblems are solved using available efficient heuristics.     

A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data

Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate all other missing distances to build a full set of distances. However, the estimation step is costly and prone to introducing errors. In this report, we describe a geometric build-up algorithm for solving protein structure by using only a sparse set of inter-atomic distances. Such a sparse set of distances can be obtained by combining NMR data with our knowledge on certain bond lengths and bond angles. It can also include confident estimations on some missing distances. Our algorithm utilizes a simple geometric relationship between coordinates and distances. The coordinates for each atom are calculated by using the coordinates of previously determined atoms and their distances. We have implemented the algorithm and tested it on several proteins. Our results showed that our algorithm successfully determined the protein structures with sparse sets of distances. Therefore, our algorithm reduces the need of estimating the missing distances and promises a more efficient approach to NMR structure modeling.     

A Kantorovich-type convergence analysis for the Gauss-Newton-Method

Summary We present a (semilocal) Kantorovich-type convergence analysis for the Gauss-Newton-Method which reduces to the wellknown Newton-Kantorovich-Theorem for the Newton-Method in a natural way. Additionnally a classification of the nonlinear regression problem into adequate and not-adequate models is obtained.     

Error estimates for the finite element solution of variational inequalities

Summary We study the mixed finite element approximation of variational inequalities, taking as model problems the so called obstacle problem and unilateral problem. Optimal error bounds are obtained in both cases.Supported in part by National Science Foundation grant MCS 75-09457, and by Office of Naval Research grant N00014-76-C-0369     

Compact elements in the lattice of radicals

Summary A radical R, in the sense of Kurosh--Amitsur, is said to be compact if, given any collection of radicals X such that R ≤;VX, we have R ≤;VX' for some finite subcollection X' of X. A ring A is said to be radical compact if the lower radical on the singleton {A} is compact. This paper explores the relationship between radical compact rings and rings satisfying certain finiteness conditions. Closure properties of the class of all radical compact rings are also investigated.     

Hypercyclic and chaotic convolution operators associated with the Dunkl operator on <Emphasis Type=”Bold”>C</Emphasis>

Summary We show that there exist infinitely many positive integers m not of the form n-&ohgr;(n) for any positive integer n. Here, &ohgr;(n) stands for the number of distinct prime factors of n. A similar result holds with &ohgr;(n) replaced by the total number of prime factors of n (counting multiplicities), or by the number of divisors of n.     

Design of Stacked Self-Healing Rings Using a Genetic Algorithm

Ring structures in telecommunications are taking on increasing importance because of their self-healing properties. We consider a ring design problem in which several stacked self-healing rings (SHRs) follow the same route, and, thus, pass through the same set of nodes. Traffic can be exchanged among these stacked rings at a designated hub node. Each non-hub node may be connected to multiple rings. It is necessary to determine to which rings each node should be connected, and how traffic should be routed on the rings. The objective is to optimize the tradeoff between the costs for connecting nodes to rings and the costs for routing demand on multiple rings. We describe a genetic algorithm that finds heuristic solutions for this problem. The initial generation of solutions includes randomly-generated solutions, complemented by seed solutions obtained by applying a greedy randomized adaptive search procedure (GRASP) to two related problems. Subsequent generations are created by recombining pairs of parent solutions. Computational experiments compare the genetic algorithm with a commercial integer programming package.     

Sooner and later waiting time problems in a two-state Markov chain

LetX ₁,X ₂,... be a time-homogeneous {0, 1}-valued Markov chain. LetF ₀ be the event thatl runs of 0 of lengthr occur and letF ₁ be the event thatm runs of 1 of lengthk occur in the sequenceX ₁,X ₂, ... We obtained the recurrence relations of the probability generating functions of the distributions of the waiting time for the sooner and later occurring events betweenF ₀ andF ₁ by the non-overlapping way of counting and overlapping way of counting. We also obtained the recurrence relations of the probability generating functions of the distributions of the sooner and later waiting time by the non-overlapping way of counting of 0-runs of lengthr or more and 1-runs of lengthk or more.     

Quasiregular points and time changes

For a one-parameter flow without stationary points it is proved that the notion of quasiregular point depends solely on the orbit structure (i. e. not on the parametrization of time). This leads naturally to an affine isomorphism between the cones of invariant measures before and after a continuous time change, a fact which is due toB. Marcus ([3]).Research supported by NSF GP-18961 and NSF MPS75-0557.     

Endoprime modules

Summary We study the harmonic analysis associated with the Dunkl operator on C and analyze the hypercyclicity and chaos of Dunkl convolution operators on the space of entire functions on C.     

New sufficient convergence conditions for the secant method

We provide new sufficient conditions for the convergence of the secant method to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than the earlier ones and under our convergence hypotheses we can cover cases where the earlier conditions are violated.     

Discrete Newton methods and iterated defect corrections

Summary In this paper we present a general theory for discrete Newton methods, iterated defect corrections via neighbouring problems and deferred corrections based on asymptotic expansions of the discretization error.Dedicated to Professor Dr. J. Weisinger on the occasion of his sixty-fifth birthday