In this paper we study and compare the notions of uniform convexity of functions at a point and on bounded sets with the notions of total convexity at a point and sequential consistency of functions, respectively. We establish connections between these concepts of strict convexity in infinite dimensional settings and use the connections in order to obtain improved convergence results concerning...

Distance weighted discrimination (DWD) is a margin-based classifier with an interesting geometric motivation. DWD was originally proposed as a superior alternative to the support vector machine (SVM), however DWD is yet to be popular compared with the SVM. The main reasons are twofold. First, the state-of-the-art algorithm for solving DWD is based on the second-order-cone programming (SOCP), wh...

Ranking fuzzy numbers plays a main role in many applied models inreal world and in particular decision-making procedures. In manyproposed methods by other researchers may exist some shortcoming.The most commonly used approaches for ranking fuzzy numbers isbased on defuzzification method. Many ranking fuzzy numberscannot discriminate between two symmetric fuzzy numbers withidentical core. In 200...

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

We introduce a computationally effective algorithm for a linear model selection consisting of three steps: screening–ordering–selection (SOS). Screening of predictors is based on the thresholded Lasso that is `1 penalized least squares. The screened predictors are then fitted using least squares (LS) and ordered with respect to their |t| statistics. Finally, a model is selected using greedy gen...

Cviklovič V., Hrubý D., Olejár M., Lukáč O., 2011. Comparison of numerical integration methods in strapdown inertial navigation algorithm. Res. Agr. Eng., 57 (Special Issue): S30–S34. The numerical mathematical theory provides a few ways of numerical integration with different errors. It is necessary to make use of the most exact method with respect to the computing power for a majority of micr...

In this paper, a novel algorithm for transient linear circuit analysis based on the Finite Element Technique (FET) was established. The FET procedure allows straightforward solution complex electric circuits since it is Method (FEM) approach. developed us to select various types of time integration schemes when forming local system equations coupled finite element. To illustrate basic principle...

Consistency checking of cardinal directions is one of the important problems in qualitative spatial reasoning. This paper presents a graph model to visually represent direction specifications. In the model, nodes represent regions occupied by objects, and directed edges indicate direction relationships between objects. This graph model can be applied not only to consistency checking, but also t...