Properties of boolean functions with a tree decomposition

Boolean functions that have a multiple disjoint decomposition scheme in the form of a tree are considered. Properties of such functions are given for the case that the functions are increasing, unate, and/or have no vacuous variables. The functions with a binary decomposition scheme are of special interest. The modulus of sensitivity is defined, and evaluated for some classes of functions. The modulus of sensitivity is interesting from the point of view of semantic information processing. It is found that the sensitivity for the class of functions with a given disjoint binary decomposition scheme is much smaller than for the unrestricted class of boolean functions. This indicates that these functions are potentially useful in pattern recognition of discrete data.The authors gratefully acknowledge the financial support of the National Research Council of Canada through a postdoctoral fellowship and an operating grant respectively.     

Structure of rings of functions with Riemann Stieltjes convolution products

In this note three sets of complex valued functions with pointwise addition and a Riemann Stieltjes convolution product are considered. The functions considered are discrete analytic functions, sequences, and continuous functions of bounded variation defined on the nonnegative real numbers. Each forms a commutative algebra with identity. The discrete analytic functions form a principal ideal ring with five maximal ideals, nine prime ideals, and is essentially a direct sum of four discrete valuation rings. The ring of sequences is isomorphic to an ideal of the ring of discrete analytic functions; it has two maximal and three prime ideals. Both contain divisors of zero. The units, associates, irreducible elements and primes in these two rings are described. The results are used to study the continuous functions; partial results are obtained concerning units and divisors of zero. The product satisfies a convolution theorem.     

Some Extensions of Loewner's Theory of Monotone Operator Functions

Several extensions of Loewner's theory of monotone operator functions are given. These include a theorem on boundary interpolation for matrix-valued functions in the generalized Nevanlinna class. The theory of monotone operator functions is generalized from scalar-to matrix-valued functions of an operator argument. A notion of κ-monotonicity is introduced and characterized in terms of classical Nevanlinna functions with removable singularities on a real interval. Corresponding results for Stieltjes functions are presented.     

图灵机计算实数函数的稳定性

定义在全体实数上的可计算函数是一个很重要的概念．在这以前定义可计算的实数函数有两个途径．第一个途径是首先要定义可计算实数的指标．想要确定实数函数y=f（x）是不是可以计算就要看是否存在一个自然数的（部分）递归函数将可计算实数x的指标对应到可计算实数y的指标．这样一来对实数函数的研究依赖于对自然数函数的研究．第二个定义可计算的实数函数的途径是以逼近为基础的．一个实数函数是可以计算的如果它既是序列可计算的同时也是一致连续的．用这个途径来定义可计算实数函数使用的条件过强以至于很多有用的实数函数成为不可计算的实数函数．例如“〈”和“=”的命题函数就是不可以计算的因为它们是不连续的命题函数．本文讨论了图灵机的稳定性并且给出了一个基于稳定图灵机的可计算实数函数的定义．我们的定义不需要用到自然数的（部分）递归函数．根据我们的定义很多常用实数函数特别是一些不连续的常用实数函数都是可以计算的．用我们的定义来讨论可计算实数函数的性质比原来的定义要方便得多．     

Regularity of boundary wavelets

The conventional way of constructing boundary functions for wavelets on a finite interval is by forming linear combinations of boundary-crossing scaling functions. Desirable properties such as regularity (i.e. continuity and approximation order) are easy to derive from corresponding properties of the interior scaling functions. In this article we focus instead on boundary functions defined by recursion relations. We show that the number of boundary functions is uniquely determined, and derive conditions for determining regularity from the recursion coefficients. We show that there are regular boundary functions which are not linear combinations of shifts of the underlying scaling functions.     

On Generalized Linearity of Quadratic Fractional Functions

Quadratic fractional functions are proved to be quasilinear if and only if they are pseudo-linear. For these classes of functions, some characterizations are provided by means of the inertia of the quadratic form and the behavior of the gradient of the function itself. The study is then developed showing that generalized linear quadratic fractional functions share a particular structure. Therefore it is possible to suggest a sort of “canonical form” for those functions. A wider class of functions given by the sum of a quadratic fractional function and a linear one is also studied. In this case generalized linearity is characterized by means of simple conditions. Finally, it is deepened on the role played by generalized linear quadratic fractional functions in optimization problems.     

Approximation by translates of refinable functions

Summary. The functions are refinable if they are combinations of the rescaled and translated functions . This is very common in scientific computing on a regular mesh. The space of approximating functions with meshwidth is a subspace of with meshwidth . These refinable spaces have refinable basis functions. The accuracy of the computations depends on , the order of approximation, which is determined by the degree of polynomials that lie in . Most refinable functions (such as scaling functions in the theory of wavelets) have no simple formulas. The functions are known only through the coefficients in the refinement equation – scalars in the traditional case, matrices for multiwavelets. The scalar "sum rules" that determine are well known. We find the conditions on the matrices that yield approximation of order from . These are equivalent to the Strang–Fix conditions on the Fourier transforms , but for refinable functions they can be explicitly verified from the . Received August 31, 1994 / Revised version received May 2, 1995     

On the Strong McShane Integral of Functions with Values in a Banach Space

The classical Bochner integral is compared with the McShane concept of integration based on Riemann type integral sums. It turns out that the Bochner integrable functions form a proper subclass of the set of functions which are McShane integrable provided the Banach space to which the values of functions belong is infinite-dimensional. The Bochner integrable functions are characterized by using gauge techniques. The situation is different in the case of finite-dimensional valued vector functions.     

On the analytic model of a class of semi-hyponormal operators

The analytic model of a class of semi-hyponormal operators is derived using three kernal functions. In addition, explicit forms of the kernal functions are given and the Pincus principal functions of the operators are calculated.     

Functions of a quaternion variable which are gradients of real-valued functions

We consider the collection of functions of one quaternion variable which can be expressed asG(Y) whereY is a real-valued quaternion function andG is a differential operator which corresponds to the gradient of real variable theory. Integral theorems for such functions are given, together with necessary and sufficient conditions for a function to be a gradient function, in terms of its Frechet derivative. The extended complex analytic functions, the Fueter functions, and the momentum-energy density functions are seen to be gradient functions which correspond to biharmonic, harmonic, and wave functions respectively.     

Support-type properties of generalized convex functions

Chebyshev systems induce in a natural way a concept of convexity. The functions convex in this sense behave in many aspects similarly to ordinary convex functions. In this paper support-type properties are investigated. Using osculatory interpolation, the existence of support-like functions is established for functions convex with respect to Chebyshev systems. Unique supports are determined. A characterization of the generalized convexity via support properties is presented.     

Estimates of the norm of a function orthogonal to the piecewise-constant functions in terms of higher-order moduli of continuity

The uniform norm of a function that is defined on the real line and has zero integrals between integer points is estimated in terms of its modulus of continuity of arbitrary even order. Sharp bounds of this kind are known for periodic functions. The passage to nonperiodic functions significantly complicates the problem. In general, the constant for nonperiodic functions is greater than that for periodic functions. The constants in the bound are improved compared with those known earlier. The proof is based on a representation of the error of the polynomial interpolation as the product of the influence polynomial and an integrated difference of higher order.     

Global optimization of bounded factorable functions with discontinuities

A deterministic global optimization method is developed for a class of discontinuous functions. McCormick’s method to obtain relaxations of nonconvex functions is extended to discontinuous factorable functions by representing a discontinuity with a step function. The properties of the relaxations are analyzed in detail; in particular, convergence of the relaxations to the function is established given some assumptions on the bounds derived from interval arithmetic. The obtained convex relaxations are used in a branch-and-bound scheme to formulate lower bounding problems. Furthermore, convergence of the branch-and-bound algorithm for discontinuous functions is analyzed and assumptions are derived to guarantee convergence. A key advantage of the proposed method over reformulating the discontinuous problem as a MINLP or MPEC is avoiding the increase in problem size that slows global optimization. Several numerical examples for the global optimization of functions with discontinuities are presented, including ones taken from process design and equipment sizing as well as discrete-time hybrid systems.     

Quasidifferentiability of nonsmooth quasiconvex functions

The paper deals with nonsmooth quasiconvex functions and develops a quasidifferential analysis for this class of functions. Therefore, in terms of sub and superdifferentials, first order approximations of the functions are derived, optimality conditions are stated and directions of descent (either simple feasible or of steepest descent) are determined. Moreover, a relation among positively homogeneous convex and quasiconvex functions is established     

A generalization of a class of close-to-convex functions

We consider a class of functions, including the Bazilevich functions, which are regular in the unit disk. The theorems of Levandovskii identifying the class of close-to-convex functions with the class of linearly accessible functions are generalized, and the geometric structure of this class is established. A method constructing a subordinating homotopy chain is used.Translated from Matematicheskie Zametki, Vol. 11, No. 5, pp. 509–516, May, 1972.     

Analysis and Application of the Rational B-Spline Finite Element Method in 2D

Non-Uniform Rational B-Splines (NURBS) are basis functions used in CAD software to describe exact geometric models. The implementation of these basis functions in the context of the Finite Element Analysis (FEA) is known as isogeometric analysis. The concept and definition of NURBS is briefly presented here. Since these functions are implemented as shape functions for the isogeometric analysis, the refinement strategies are discussed. The example of an infinite plate with circular hole serves as a benchmark. Finally, isogeometric analysis is applied to gradient elasticity since NURBS functions are of higher continuity and this is required in gradient elasticity. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Dirichlet problem for pluriholomorphic functions of two complex variables

In this paper the Dirichlet problem for pluriholomorphic functions of two complex variables is investigated. The key point is the relation between pluriholomorphic functions and pluriharmonic functions. The link is constituted by the Fueter-regular functions of one quaternionic variable. Previous results about the boundary values of pluriharmonic functions and new results on L² traces of regular functions are applied to obtain a characterization of the traces of pluriholomorphic functions.     

Quasiconformality and invertibility of transformations in non archimedean vector spaces

The paper treats functions which in a finite dimensional normed space over a field with a non archimedean valuation possess a certain simple quasilinearity property. The first principal result states that these functions are quasiconformal in certain balls. The second result is an inverse function theorem which characterizes in a simple way the images of the functions considered. An existence theorem for quasilinear functions is then provided as well. The paper closes with a presentation of two algorithms for the numerical inversion of quasilinear functions.     

A study of the effect of the loss function on Bayes estimates of failure intensity,MTBF, and reliability

The number of failures in a fixed time T is assumed to follow the Poisson distribution, and the failure intensity (reciprocal MTBF) is assumed to have a gamma prior distribution. This model has recently been employed on actual USAF failure data, and the parameters in the various comparisons of this study typify these data. Bayes estimates of failure intensity, MTBF, and reliability are compared for five classes of loss functions. Included in the study are two new classes of loss functions which appear to have useful applications and a third, well-known loss function whose usefulness seems not to have been exploited. Mathematical properties on the new loss function are given in addition to comparing them to the other loss functions. The “popular” squared error loss function is shown to be a poor approximation to other loss functions for the most part, even when it is used to approximate other symmetric loss functions. Numerical comparisons are made to show the widely different decisions that may be reached if different loss functions are used and to aid researchers in selecting a loss function to meet experimental objectives.     

Expansion over a system of shifts of pyramidal functions with a square base

A method for approximation of functions of two variables by a linear combination of non-negative piecewise linear functions with a compact support is presented. Two quadratic pyramids are used as generating functions for the system of shifts. The accuracy of this local method is proved to have the same order as the best approximation by piecewise linear functions.