Eine differentialtopologische Berechnung der Totalen Krümmung und Totalen Absolutkrümmung in der sphärischen Differentialgeometrie

The aim of this article is to compute the total (absolute) curvature, i.e. the mean value of the (absolute) Lipschitz-Killing-curvature, of an immersion f: MSⁿ of a compact manifold into the unit sphere in a differential topological manner. Through a generalization of KUIPERs treatment of immersions in Euclidean spaces it can be computed as the mean value of the number of critical points—weighted by (–1)^k (k=Index) resp.not weighted—of certain functions. These functions are the pullback via f of level-functions, which are defined almost everywhere on Sⁿ. Such a level-function is constructed by taking any oriented great circle as a leveling-scale and the orthogonal great (n–1)-spheres as level-surfaces.     

A Framework for Evaluating Knowledge-Based Interestingness of Association Rules

In Knowledge Discovery in Databases (KDD)/Data Mining literature, interestingness measures are used to rank rules according to the interest a particular rule is expected to evoke. In this paper, we introduce an aspect of subjective interestingness called item-relatedness. Relatedness is a consequence of relationships that exist between items in a domain. Association rules containing unrelated or weakly related items are interesting since the co-occurrence of such items is unexpected. Item-Relatedness helps in ranking association rules on the basis of one kind of subjective unexpectedness. We identify three types of item-relatedness – captured in the structure of a fuzzy taxonomy (an extension of the classical concept hierarchy tree). An item-relatedness measure for describing relatedness between two items is developed by combining these three types. Efficacy of this measure is illustrated with the help of a sample taxonomy. We discuss three mechanisms for extending this measure from a two-item set to an association rule consisting of a set of more than two items. These mechanisms utilize the relatedness of item-pairs and other aspects of an association rule, namely its structure, distribution of items and item-pairs. We compare our approach with another method from recent literature.     

On the exactness of a theorem of G.A. Fomin

, . . [1] - . .     

Robust Estimation of Tail Parameters for Two-Parameter Pareto and Exponential Models via Generalized Quantile Statistics

Robust estimation of tail index parameters is treated for (equivalent) two-parameter Pareto and exponential models. These distributions arise as parametric models in actuarial science, economics, telecommunications, and reliability, for example, as well as in semiparametric modeling of upper observations in samples from distributions which are regularly varying or in the domain of attraction of extreme value distributions. New estimators of generalized quantile type are introduced and compared with several well-established estimators, for the purpose of identifying which estimators provide favorable trade-offs between efficiency and robustness. Specifically, we examine asymptotic relative efficiency with respect to the (efficient but nonrobust) maximum likelihood estimator, and breakdown point. The new estimators, in particular the generalized median types, are found to dominate well-established and popular estimators corresponding to methods of trimming, least squares, and quantiles. Further, we establish that the least squares estimator is actually deficient with respect to both criteria and should become disfavored. The generalized median estimators manifest a general principle: smoothing followed by medianing produces a favorable trade-off between efficiency and robustness.     

Positivity and Stability for One-Sided Coupled Operator Matrices

Many evolutionary systems can be described by an abstract Cauchy problem governed by an operator matrix. Assuming this problem to be one-sided coupled and well-posed we study in this paper the positivity and the stability of the associated matrix semigroup. The abstract results are illustrated by several examples.     

A survey of pseudo (v,k, λ)-designs

This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.     

Applications of the zero–one law to problems connected with Cauchy's functional equation

Summary Marek Kuczma's book, entitled An Introduction To The Theory Of Functional Equations And Inequalities, mentions a certain setV ₀ in several places and presents references as to where this set is discussed in the literature. The main result of this paper is a proof of the fact that the setA _M (V ₀)={xV ₀ f(x)>M} is saturated non-measurable for each additive discontinuous functionf and each real numberM. Other results aboutV ₀ are also presented. Connections between measure and category are stressed. The main tool in our proofs is a certain so-called zero–one law and its topological analogue. In addition it is shown that the zero–one law is equivalent to Smital's lemma.     

Continuation of functionals on ultradifferentiable function spaces

, c _k b _k . . . .

---

---

This work is supported by N.B.H.M. grant No. 48/1/94-R&D-II.     

Invarianz gewisser Operatorenklassen unter nichtkommutativen ergodischen Mitteln

Let be a group of *-automorphisms on the algebra of bounded linear operators on a complex Hilbert space H. Then the strongly closed convex hull of the orbit of any compact operator under consists of compact operators. The same is true if one replaces compact by nuclear, Hilbert-Schmidt or positive Fredholm. We further discuss these results in the framework of the noncommutative mean ergodic theorem of KOVACS and SZ#x00FC;CS and formulate an analogous theorem for the algebra of compact operators on a complex Hilbert space.

---

---

Gefördert von der Deutschen Forschungsgemeinschaft im Rahmen des Forschungsvorhabens Ko 506/1.     

Complex whitham deformations in problems with “integrable instability”

The focusing nonlinear Schrödinger equation with finite-density boundary conditions as |x| is considered. The asymptotic behavior of the solution ast is investigated by means of the complex theory of deformations of Whitham.Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 104, No. 3, pp. 393–419, September, 1995.     

Role of information in the stochastic zero-sum differential game

In this paper, a linear-quadratic Gaussian zero-sum differential game is studied. Maneuverability is defined to measure players' strength. It is shown that a more maneuverable player would prefer a more observable information system. An example is given to show that a more controllable player might not prefer more observable measurements in the stochastic environment.The research reported in this paper was made possible through support extended to the Division of Engineering and Applied Physics, Harvard University, by the US Office of Naval Research under the Joint Services Electronics Program by Contract No. N00014-75-c-0648 and by the National Science Foundation under Grant No. GK31511.     

On the solution of a generalized Schrödinger-type equation

Lu(t)+(u,F)g(t)=f(t), tS. , ( F, g). .

---

---

The authors wish to thank Professor Yu. A. Rozanov for his help and discussions.     

Some Issues in the Theory of Optimal Algorithms and Informational Complexity

The article presents the basic concepts and reviews the main results of the theory of optimal algorithms and informational complexity. Informational complexity bounds are provided for Lipschitzian multi-criterion problems that construct the approximate Pareto-optimal strategy set under different interpretations of approximation—approximation by the functional and approximation by the argument. The informational complexity is compared for the scalar global optimization problem and the problem of finding the roots of nonlinear equations by global search methods.     

Contractions with a unilateral shift summand are reflexive

If T is a contraction on the Hilbert space H and there is an invariant subspace K for T such that T/K is similar to a backward shift, then T is reflexive. If similarity is replaced by quasi-similarity, then the same conclusion holds under the additional condition that the defect index of T be finite.This research was partially supported by National Science Council (Republic of China).     

On affine scaling algorithms for nonconvex quadratic programming

We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa.     

Склярные дифференциалвные инварианты третвего порядка риамнового простанства трех измерений

.      

Diagonal Bases in Orlik-Solomon Type Algebras

To encode an important property of the no broken circuit bases of the Orlik- Solomon-Terao algebras, Szenes has introduced a particular type of bases, the so called diagonal basis. We prove that this definition extends naturally to a large class of algebras, the so called - algebras. Our definitions make also use of an iterative residue formula based on the matroidal operation of contraction. This formula can be seen as the combinatorial analogue of an iterative residue formula introduced by Szenes. As an application we deduce nice formulas to express a pure element in a diagonal basis.AMS Subject Classification: 52C35, 05B35, 14F40.     

Applying a fuzzy relation to describe influence of flux behaviour in a printed coil

Summary Being a subject of expectedly fuzzy character, an attempt is made to apply fuzzy functions, more precisely fuzzy relations to investigate the problem of flux distortion in a printed coil.

---

Zusammenfassung Da die Vorgänge in einer gedruckten Spule sich aus einer Vielzahl schwerer erfaßbarer Einzeleinflüsse zusammensetzen, die insbesondere den Magnetfluß verzerren, lag es nahe, den Versuch zu machen, die Fuzzy Functions (die logische Algebra, gemäß [1]) darauf anzuwenden. Die Fuzzy Functions sind gedacht für das Beschreiben von Vorgängen, oder Ereignissen, die im Ansatz ein breit gefächertes (fuzzy) Verhalten, ohne scharfe Grenzen aufweisen; siehe Fig. 4.Dieser gefächerten logischen Funktion entspricht eine reguläre mathematische Kurvenschar, die meßtechnisch nachgewiesen werden muß.Im vorliegenden Falle ergab sich eine Korrekturfunktion (5), die es gestattet, die Induktivität gedruckter Spulen, in einem weiten Bereich von Abmessungen und Windungen, mit einer Genauigkeit von –2% bis +5% zu bestimmen.

     

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.     

Equivalent Sets of Solutions of the Klein–Gordon Equation with a Constant Electric Field

We argue extensively in favor of our earlier choice of the in and out states (among the solutions of a wave equation with one-dimensional potential). In this connection, we study the nonstationary and stationary families of complete sets of solutions of the Klein–Gordon equation with a constant electric field. A nonstationary set _Pv consists of the solutions with the quantum number p _v=p ⁰ v–p₃. It can be obtained from the nonstationary set _P3 with the quantum number p ₃ by a boost along the x ₃ axis (in the direction of the electric field) with the velocity –v. By changing the gauge, we can bring the solutions in all sets to the same potential without changing quantum numbers. Then the transformations of solutions in one set (with the quantum number p _v) to the solutions in another set (with the quantum number p _v) have group properties. The stationary solutions and sets have the same properties as the nonstationary ones and are obtainable from stationary solutions with the quantum number p ⁰ by the same boost. It turns out that each set can be obtained from any other by gauge manipulations. All sets are therefore equivalent, and the classification (i.e., assigning the frequency sign and the in and out indices) in any set is determined by the classification in the set _P3, where it is obvious.