Hierarchical B-spline networks consist of multiple B-spline networks assembled in different level or cascade architecture. To identify the hierarchical B-spline networks and select important input features for each sub-B-spline network automatically, a predefined instruction/operator set was used. The structures of hierarchical B-spline networks were created and evolved by using Probabilistic I...

A computationally inexpensive algorithm for signal interpolation using B-spline functions is presented in this work. Speciically, the convolution between the B-spline coeecients and the B-spline function itself, widely acknowledged as the most costly aspect of B-spline interpolation, is reformulated such that it is directly amenable to implementation at a much lower computational cost (16.25% o...

Given a grid in R, consisting of d bi-infinite sequences of hyperplanes (possibly with multiplicities) orthogonal to the d axes of the coordinate system, we consider the spaces of tensor-product spline functions of a given degree on a multi-cell domain. Such a domain consists of finite set of cells which are defined by the grid. A piecewise polynomial function belongs to the spline space if its...

This paper present a novel numerical algorithm for the linear one-dimensional heat and wave equation. In this method, a nite dierenceapproach had been used to discrete the time derivative while cubic spline isapplied as an interpolation function in the space dimension. We discuss theaccuracy of the method by expanding the equation based on Taylor series andminimize the error. The proposed metho...

‎for a graph $g$ with edge set $e(g)$‎, ‎the multiplicative second zagreb index of $g$ is defined as‎ ‎$pi_2(g)=pi_{uvin e(g)}[d_g(u)d_g(v)]$‎, ‎where $d_g(v)$ is the degree of vertex $v$ in $g$‎. ‎in this paper‎, ‎we identify the eighth class of trees‎, ‎with the first through eighth smallest multiplicative second zagreb indeces among all trees of order $ngeq 14$‎.

In this paper we extend the GeDS methodology, recently developed by Kaishev et al. [18] for Normal univariate spline regression case, to more general GNM/GLM context. Our approach is view (non-)linear predictor as a with free knots which are estimated, along coefficients and degree of spline, using two stage algorithm. A, linear (degree one) free-knot fitted data applying iteratively re-weighte...

Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees freedom and, at same time, a more efficient engineering analysis. Moreover possess set basis similar properties to standard B-splines. In this paper we develop...

A new type of B-spline the expo-rational B-spline is introduced. The heuristic motivation for its introduction comes from important similarities in several celebrated mathematical constructions originating in approximation theory, differential geometry and operator theory. The main result of the paper is the derivation of an Edgeworth and a steepest-descent/saddlepoint asymptotic expansion whic...

Surface blending is a useful operation in geometric design for rounding sharp edges or corners. Meanwhile, NURBS has already become the de facto industrial standard in existing CAD/CAM systems. Therefore, it is required to study how to blend two B-spline surfaces. However, two arbitrary B-spline surfaces (called base surfaces) are hard to be blended with a B-spline surface (called blending surf...

We study the reconstruction of cardinal splines f(t), from their average samples yn = f ∗h(n), n ∈ Z, when the average function h(t) has support in [−1/2, 1/2]. We investigate the existence and uniqueness of the solution of the following problem: for given dates yn, find a cardinal spline f(t), of a given degree, satisfying yn = f ∗ h(n), n ∈ Z. 1 Spline interpolation and average sampling First...