Probabilist,possibilist and belief objects for knowledge analysis

The main aim of the symbolic approach in data analysis is to extend problems, methods and algorithms used on classical data to more complex data called symbolic objects which are well adapted to representing knowledge and which are generic unlike usual observations which characterize individual things. We introduce several kinds of symbolic objects: Boolean, possibilist, probabilist and belief. We briefly present some of their qualities and properties; three theorems show how Probability, Possibility and Evidence theories may be extended on these objects. Finally, four kinds of data analysis problems including the symbolic extension are illustrated by several algorithms which induce knowledge from classical data or from a set of symbolic objects.     

Morera type theorems on the unit disc

, . . : , , , , .     

On the Cesàro summability of orthogonal sequences

(C, ). , . 0<<1. 1) - ( _k ), _k =a _k , (C, ), . 2) , , (C, ) ; _k = =¦a _k ¦.     

On minimax filtration of vector processes

We study the problem of optimal linear estimation of the transformation of a stationary random process (t) with values in a Hilbert space by observations of the process (t) + (t) fort0. We obtain relations for computing the error and the spectral characteristic of the optimal linear estimate of the transformationA for given spectral densities of the processes (t) and (t). The minimax spectral characteristics and the least favorable spectral densities are obtained for various classes of densities.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 3, pp. 389–397, March, 1993.     

Discrete Spectrum of Differential Operators in Spectral Gaps under Nonnegative Perturbations of High Order

Let A be a self-adjoint elliptic second-order differential operator, let (, ) be an inner gap in the spectrum of A, and let B(t) = A + tW ^* W, where W is a differential operator of higher order. Conditions are obtained under which the spectrum of the operator B(t) in the gap (, ) is either discrete, or does not accumulate to the right-hand boundary of the spectral gap, or is finite. The quantity N(, A, W, ), (, ), > 0 (the number of eigenvalues of the operator B(t) passing the point (, ) as t increases from 0 to ) is considered. Estimates of N(, A, W, ) are obtained. For the perturbation W ^* W of a special form, the asymptotics of N(, A, W, ) as + is given. Bibliography: 5 titles.     

Best approximation and best unilateral approximation of the kernel of a biharmonic equation and optimal renewal of the values of operators

For the classB _p , 0 < 1, 1p , of 2-periodic functions of the form f(t)=u(,t), whereu (,t) is a biharmonic function in the unit disk, we obtain the exact values of the best approximation and best unilateral approximation of the kernel K(t) of the convolution f= K *g, gl, with respect to the metric of L₁. We also consider the problem of renewal of the values of the convolution operator by using the information about the values of the boundary functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.47, No. 11, pp. 1549–1557, November, 1995.     

On the newly generalized absolute Riesz summability of orthogonal series

[3] , [1], ¦C,,(t)¦ _k - . , , ¦R, , (t)¦ _k - ¦R, , (t)¦ _k - . (t)=1,k=1 [7], [9].

---

---

This research was partially supported by the Hungarian National Foundation for Scientific Research under Grant#T 016 393.     

Design of manufacturing systems using queueing models

Design issues in various types of manufacturing systems such as flow lines, automatic transfer lines, job shops, flexible machining systems, flexible assembly systems and multiple cell systems are addressed in this paper. Approaches to resolving these design issues of these systems using queueing models are reviewed. In particular, we show how the structural properties that are recently derived for single and multiple stage queueing systems can be used effectively in the solution of certain design optimization problems.Supported in part by the Natural Sciences and Engineering Research Council of Canada via Operating and Strategic Grants on Modeling and Analyses of Production Systems and Modeling and Implementation of Just-in-Time Cells.Supported in part by the NSF Grants ECS-8811234 and DDM-9113008 and by Sloan Foundation Grants for the Consortium for Competitiveness and Cooperation and for the study on Competitive Semiconductor Manufacturing.     

Additive functions

1<q<2 L:= _n=1 1/q ⁿ=1/q–1. [0,1] _n()=1, A _n:= _i=1 ^n–1 _i(x)/q^i+1/n x _n(x)=0, _n>. , = _{n=1 n}(x)/qⁿ. F: [0,L]R , F(x)= _{n=1 n}(x)a_n, _n=1 ¦a _n¦<. [0,L]. q(1,2), . , q(1, 2), . .     

The Spectral Theory of Amenable Actions and Invariants of Discrete Groups

Let G denote a semisimple group, a discrete subgroup, B=G/P the Poisson boundary. Regarding invariants of discrete subgroups we prove, in particular, the following:(1) For any -quasi-invariant measure on B, and any probablity measure on , the norm of the operator () on L ²(B,) is equal to (), where is the unitary representation in L ²(X,), and is the regular representation of .(2) In particular this estimate holds when is Lebesgue measure on B, a Patterson–Sullivan measure, or a -stationary measure, and implies explicit lower bounds for the displacement and Margulis number of (w.r.t. a finite generating set), the dimension of the conformal density, the -entropy of the measure, and Lyapunov exponents of .(3) In particular, when G=PSL₂() and is free, the new lower bound of the displacement is somewhat smaller than the Culler–Shalen bound (which requires an additional assumption) and is greater than the standard ball-packing bound.We also prove that ()=_G() for any amenable action of G and L ¹(G), and conversely, give a spectral criterion for amenability of an action of G under certain natural dynamical conditions. In addition, we establish a uniform lower bound for the -entropy of any measure quasi-invariant under the action of a group with property T, and use this fact to construct an interesting class of actions of such groups, related to 'virtual' maximal parabolic subgroups. Most of the results hold in fact in greater generality, and apply for instance when G is any semi-simple algebraic group, or when is any word-hyperbolic group, acting on their Poisson boundary, for example.     

A variational principle for eigenvalues of pencils of Hermitian matrices

LetH=(A, B) be a pair of HermitianN×N matrices. A complex number is an eigenvalue ofH ifdet(A–B)=0 (we include = ifdetB=0). For nonsingularH (i.e., for which some is not an eigenvalue), we show precisely which eigenvalues can be characterized as _k ⁺ =sup{inf{*A:*B=1,S},SS _k},S _k being the set of subspaces of C ^N of codimensionk–1.Dedicated to the memory of our friend and colleague Branko NajmanResearch supported by NSERC of Canada and the I.W.Killam FoundationProfessor Najman died suddenly while this work was at its final stage. His research was supported by the Ministry of Science of CroatiaResearch supported by NSERC of Canada     

A characterization of semimartingales on nuclear spaces

Summary This work is devoted to prove the following fact: Suppose that is a nuclear space whose dual is nuclear under the strong topology. IfX is a weakly adapted mapping with values in such that for any,X'() has a modification which is a semimartingale then there exists a unique projective system of Hubert space-valued semimartingales indexed by the Hilbert-Schmidt neighbourhood base of the dual space whose projective limit isX.In the last part we study in detail a semimartingale defined as the convolution of a distribution by a random Dirac measure whose support is determined by the trajectories of a real-valued semimartingale.     

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.     

On certain imbedding and extension theorems for a weighted class of functions

n- , S n–1 m (0m<n), () S . () , ().     

Convergence of random products of compact contractions in Hilbert space

Let {T₁, ..., T_N} be a finite set of linear contraction mappings of a Hilbert space H into itself, and let r be a mapping from the natural numbers N to {1, ..., N}. One can form S_n=T_r(n)...T_r(1) which could be described as a random product of the T_i's. Roughly, the S_n converge strongly in the mean, but additional side conditions are necessary to ensure uniform, strong or weak convergence. We examine contractions with three such conditions. (W): x_n1, Tx_n1 implies (I-T)x_n0 weakly, (S): x_n1, Tx_n1 implies (I-T)x_n0 strongly, and (K): there exists a constant K>0 such that for all x, (I-T)x²K(x²–Tx²).We have three main results in the event that the T_i's are compact contractions. First, if r assumes each value infinitely often, then S_n converges uniformly to the projection Q on the subspace _i= ₁ ^N [x|T_ix=x]. Secondly we prove that for such compact contractions, the three conditions (W), (S), and (K) are equivalent. Finally if S=S(T₁, ..., T_N) denotes the algebraic semigroup generated by the T_i's, then there exists a fixed positive constant K such that each element in S satisfies (K) with that K.     

Approximation of Classes B p,θ r by Linear Methods and Best Approximations

We investigate problems related to the approximation by linear methods and the best approximations of the classes , 1 p in the space L .     

On summability of subsequences of partial sums of trigonometric Fourier series

n- (n1) fL ^p ([–, ] ⁿ ),=1 = (L C) . , , f([–, ] ⁿ ).     

Asymptotic formulas for Toeplitz and Wiener-Hopf operators

For certain analytic functions f, the expression trace {f(T_n[]) – f(T_n[]T_n[])} is computed asymptotically. Here T_n[] is the finite Toeplitz matrix generated by the function . The analogous expression for Wiener-Hopf operators is also computed asymptotically. These results in turn yield information concerning the asymptotic behavior of determinants of finite Toeplitz and Wiener-Hopf operators with discontinuous generating function.     

Martingale Hardy spaces,BMO and VMO spaces with nonlinearly ordered stochastic basis

VMO. , ⁺, «» VMO . « » .     

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.