A generalization of Nevanlinna’s First Fundamental Theorem to superharmonic functions on Green balls is proved. This enables us to generalize many other theorems, on the behaviour of mean values of superharmonic functions over Green spheres, on the Hausdorff measures of certain sets, on the Riesz measures of superharmonic functions, and on differences of positive superharmonic functions.
The least concave majorant, $\hat F$, of a continuous function $F$ on a closed interval, $I$, is defined by $ \hat F (x) = \inf\{ G(x) G \geq F, G \text{ concave}\},\quad x \in I. $ We present an algorithm, in the spirit of the Jarvis March, to approximate the least concave majorant of a differentiable piecewise polynomial function of degree at most three on $I$. Given any function $F \in\mathcal{C}^4(I)$, it can be well-approximated on $I$ by a clamped cubic spline $S$. We show that $\hat S$ is then a good approximation to $\hat F$. We give two examples, one to illustrate, the other to apply our algorithm., Martin Franců, Ron Kerman, Gord Sinnamon., and Obsahuje bibliografii
We present a new approach to solving boundary value problems on noncompact intervals for second order differential equations in case of nonlocal conditions. Then we apply it to some problems in which an initial condition, an asymptotic condition and a global condition is present. The abstract method is based on the solvability of two auxiliary boundary value problems on compact and on noncompact intervals, and uses some continuity arguments and analysis in the phase space. As shown in the applications, Kneser-type properties of solutions on compact intervals and a priori bounds of solutions on noncompact intervals are key ingredients for the solvability of the problems considered, as well as the properties of principal solutions of an associated half-linear equation. The application of this method leads to some new existence results, which complement and extend some previous ones in the literature.
By a chordal graph is meant a graph with no induced cycle of length $\ge 4$. By a ternary system is meant an ordered pair $(W, T)$, where $W$ is a finite nonempty set, and $T \subseteq W \times W \times W$. Ternary systems satisfying certain axioms (A1)–(A5) are studied in this paper; note that these axioms can be formulated in a language of the first-order logic. For every finite nonempty set $W$, a bijective mapping from the set of all connected chordal graphs $G$ with $V(G) = W$ onto the set of all ternary systems $(W, T)$ satisfying the axioms (A1)–(A5) is found in this paper.
Expected utility model can be derived not only in probability theory, but also in other models proposed to quantify someone’s belief. We deal with the transferable belief model and use the pignistic probabilities when decision is required. We introduce a new class of graphical representation, expected utility networks with pignistic probabilities and define conditional expected utility independence to decompose the expected utility function.
With a chaotic system being divided into linear and nonlinear parts, a new approach is presented to realize generalized chaos synchronization by using feedback control and parameter commutation. Based on a linear transformation, the problem of generalized synchronization (GS) is transformed into the stability problem of the synchronous error system, and an existence condition for GS is derived. Furthermore, the performance of GS can be improved according to the configuration of the GS velocity. Further generalization and appropriation can be acquired without a stability requirement for the chaotic system's linear part. The Lorenz system and a hyperchaotic system are taken for illustration and verification and the results of the simulation indicate that the method is effective.
This paper preseiits our experience with a completely new approach to
handwritten text recognitiori. A brief description of a new type of input devices is followed by a more detailed explanation of recognition methods used. The results achieved are discussed and ideas ror further research are suggested.
In this study, a new artificial intelligence optimization algorithm, Differential Search (DS), was proposed for Principal Component Analysis (PCA) based unsupervised change detection method for optic and SAR image data. The model firstly computes an eigenvector space using previously created k×k blocks. The change detection map is generated by clustering the feature vector as two clusters which are changed and unchanged using Differential Search Algorithm. For clustering, a cost function is used based on minimization of Euclidean distance between cluster centers and pixels. Experimental results of optic and SAR images proved that proposed approach is effective for unsupervised change detection of remote sensing image data.
Let $G$ be a finite group and $p$ a prime number. We prove that if $G$ is a finite group of order $|{\rm PSL}(2,p^2)|$ such that $G$ has an irreducible character of degree $p^2$ and we know that $G$ has no irreducible character $\theta $ such that $2p\mid \theta (1)$, then $G$ is isomorphic to ${\rm PSL}(2,p^2)$. As a consequence of our result we prove that ${\rm PSL}(2,p^2)$ is uniquely determined by the structure of its complex group algebra.