A (2,6)-fullerene F is a 2-connected cubic planar graph whose faces are only 2-length and 6-length. Furthermore, it consists of exactly three 2-length faces by Euler's formula. The (2,6)-fullerene comes from Do\v{s}li\'{c}'s (k,6)-fullerene, a 2-connected 3-regular plane graph with only k-length faces and hexagons. Do\v{s}li\'{c} showed that the (k,6)-fullerenes only exist for k = 2, 3, 4 or 5, and some of the structural properties of (k,6)-fullerene for k = 3, 4 or 5 are studied. In this paper, we study the properties of (2,6)-fullerene. We obtain that the edge-connectivity of (2,6)-fullerenes is 2. Every (2,6)-fullerene is 1-extendable, but not 2-extendable. F is said to be k- resonant (k>0) if the deleting of any i (0=< i<= k) disjoint even faces of F results in a graph with at least one perfect matching. We have that every (2,6)-fullerene is 1-resonant. An edge set S of F is called an anti-Kekule set if F-S is connected and has no perfect matchings, where F-S denotes the subgraph obtained by deleting all edges in S from F. The anti-Kekule number of F, denoted by ak(F), is the cardinality of a smallest anti-Kekule set of F. We have that every (2,6)-fullerene F with |V(F)|>6 has anti-Kekule number 4. Further we mainly prove that there exists a (2,6)-fullerene F having f_{F} hexagonal faces, where f_{F} is related to the two parameters n, m.

To handle the huge amount of data generated by IoT devices, Big Data processing tools make it easier. This paper discusses the Big Data concept and its main V’s characteristics. It further describes IoT-enabling technologies; nominally cloud computing such as SaaS and PaaS. The centralization and infrastructure of Big Data systems, and how Cloud Computing gives a platform access to the data from anywhere. The paper explores IoT with big data architectural solutions for various use cases across the healthcare and transportation sectors.

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

Formal Calculation introduces a way to calculate various nested sums.It uses an auxiliary Form for calculation and provides results in three forms.Besides computation, it is also a powerful tool for analysis and studies various numbers in a unified way.This article contains many results of two types of Stirling numbers, associated Stirling numbers and Eulerian numbers. Formal Calculation provides a method for obtaining combinatorial identities. Applying it to the Gaussian coefficient is a new way for the analysis of q - Binomial. In the process of analysis, this paper makes a great generalization of Euler numbers and polynomials, Wilson's theorem and Wolstenholme's theorem, revealing that they are just special cases. Finally, this article introduces a theorem on symmetry.

The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focuses on creating and analysing structures. There are numerous studies linking algebraic structures and graphs, which began with the introduction of Cayley graphs of groups. Several algebraic graphs have been defined on rings, which have huge-growing literature. In this article, we systematically review the literature on some variants of Cayley graphs that are defined on rings, to understand the research in this area.

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a vertex-clique incidence matrix for a graph and produce new lower bounds for the negative eigenvalues and negative inertia of a graph. Moreover, utilizing these vertex-clique incidence matrices, we generalize several notions such as the signless Laplacian matrix, and develop bounds on the incidence energy and the signless Laplacian energy of the graph. %The tight upper bounds for the energies of a graph and its line graph are given. More generally, we also consider the set $S(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent. An important parameter in this setting is $q(G)$, and is defined to be the minimum number of distinct eigenvalues over all matrices in $S(G)$. For a given graph $G$ the concept of a vertex-clique incidence matrix associated with an edge clique cover is applied to establish several classes of graphs with $q(G)=2$.

In history, theta function identities have been studied extensively and deeply. In this paper, applying the residue theorem of an elliptic function, we obtain a parameterized theta function identity. Then, by selecting the appropriate parameter, we derive some famous Jacobi identities, as well as other relatively simple theta function identities.

Application of the Ramsey Theory to the set of the points placed in the plane is discussed. Consider a set of N points located in the same plane. The straight lines connecting these points are yikx=αikx+βik i,k=1...N. Listed below values of slopes αik are possible: αik&gt;0; αik=0; αik is not defined; αik&lt;0. Following coloring procedure is introduced: we connect the pairs of points for which αik&gt;0, αik=0 or αik is not defined, with the red links, and the pairs of points for which αik&lt;0 place with green links. The suggested coloring procedure enables building of the complete bi-colored graph for any set containing N points located in the same plane. We apply the Ramsey theorem to the complete graph emerging from the suggested coloring. For the set containing N=6 points at least one monochromatic triangle will necessarily appear in the graph. The values of the slopes αik depend on the chosen coordinate system. The rotation of coordinate axes changes the coloring of the graph; however, at least one monochromatic triangle will be present for N=6. The introduced coloring procedure diminishes the order of the symmetry group of the regular hexagon, irrespectively to the orientation of the coordinate axes. We hypothesized that this will be true for arbitrary regular n-polygon, independently on the orientation of coordinate axes. The inverse bi-color Ramsey graphs arise, when we replace red links appearing in the source graph with red ones, and vice versa. The total number of triangles in the “direct” and “inverse” Ramsey graphs is the same. We considered the particular case of the set of points for which αik&gt;0 or αik&lt;0 is true in the given coordinates. In this particular case, the rotation of the Cartesian coordinate axes to the angle θ=π2 yields the inverse complete graph. Generalization of this coloring for an arbitrary number and arbitrary location of the source points is introduced.

Linear-width is a well-regarded width parameter in graph theory. The constructs of linear loose tangle and linear tangle present obstacles to attaining linear-width. In this succinct paper, our primary focus will be the exploration of maximal linear loose tangles.

Loose Tangle is a concept in graph theory that has a dual relationship with branch-width which is well-known graph width parameter. Ultrafilter, a fundamental notion in mathematics, is similarly known to have a dual relationship with branch-width when extended to a connectivity system (X, f). In this compact paper, we revisit and contemplate the interplay between Loose Tangle and Filter through the lens of a submodular partition function.

Suppose G is a graph with vertex-orbits O1,1 O2, . . . ,Ot, and jOi j denotes the cardinallity of Oi. Then OG (x) = åt 2 i=1 xjOi j is called as orbit polynomial. It is well-known that this polynomial 3 has a unique positive zero d in the interval [0, 1]. The aim of this paper is to study the specific 4 properties of this polynomial and then we determine the location of this root for several classes of 5 complex networks to compare with other graphical measures. Besides, we compare the unique 6 positive zero measure with several well-known centrality graph measures.

We characterize the form of the order divisor graph of cyclic groups based on the group order. Furthermore, we describe some topological indices of the order divisor graph of cyclic groups, including the Wiener index, Harary index, first Zagreb index, and second Zagreb index.

A number of challenging combinatorial optimization problems in logistics, transportations, aeronautics, and astronautics can be modeled as orienteering problems (OPs). To address the classic OP and its real-world variants, a parallel adaptive local-search algorithm based on competition and evolution (Palace) is proposed in this paper. In this algorithm, the parallelism runs proper local-search metaheuristics and operators to obtain the population per generation; then the competition grades those metaheuristics and operators to highlight the outperforming and eliminate the underperforming; also, the evolution explores large solution space and reproduces the best solutions for next generation. In this manner, the parallelism, competition, and evolution are organized in an easy-to-use algorithm and enable the expansibility, adaptivity, and exploration abilities, respectively. The Palace is examined on the classic and real-world Benchmarks about the OP, the time-dependent/independent OP with time windows, and the unmanned aerial vehicle and agile earth observation satellite planning. As a result, the Palace shows good performance in applicability and effectiveness in comparison with the state-of-the-art algorithms.

W. L. Edge proved that the internal points of a conic in PG(2,5), together with the collinear triples on the non-secant lines, form the Desargues configuration. M. Saniga showed an intimate connection between Desargues configurations and the generalized quadrangles of order two, GQ(2,2), whose representation has been dubbed “the doily” by Stan Payne in 1973. In this paper we prove that the external points of a conic in PG(2,5), together with the collinear and non-collinear triples on the non-tangent lines, form the generalized quadrangle of order two.

A stochastic dominance (SD) relation can be defined by two different perspectives: One from the view of distributions, and the other one from the view of expected utilities. In early days, Fishburn investigated SD from the view of distributions and we refer this perspective as Fishburn’s SD. One of his many results was the development of fractional-order SD for continuous distributions. However, discrete fractional-order SD may not be generalized directly since some properties of fractional calculus do not have a discrete counterpart. In this paper, we develop a discrete analogue of fractional-order SD from the view of distributions. We generalize the order of SD by Lizama’s fractional delta operator, show the preservation of SD hierarchy, and formulate the utility classes that are congruent with our SD relations. This work brings a message that some results of discrete SD cannot be generalized directly from continuous SD. We characterize the difference between discrete and continuous fractional-order SD, as well as the way to handle them.

Different variants of thinning for discrete random variables are studied. The thinning procedure allows to introduce an analog of scale parameter for positive integer-valued random variables. Sufficient and necessary conditions for the existence of such a scale are given.

By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.

Discrete Double Hilbert Exponential sums along polynomials. This is preprint version (not peer reviewed) And we now check the proof of (ii) of Lemma 3.2 whether it is really true.

The normal and Poisson distribution assumptions in the normal-Poisson mixed effects regression model are often too restrictive for many real count data. Several works have independently relaxed the Poisson conditional distribution assumption for counts or the normal distribution assumption for random effects. This work couples some recent advances in these two regards to develop a skew t–discrete gamma regression model in which the count outcomes have full dispersion flexibility and random effets can be skewed and heavy tailed. Inference in the model is achieved by maximum likelihood using pseudo-adaptive Gaussian quadature. The use of the proposal is demonstrated on a popular owl sibling negotiation data. It appears that, for this example, the proposed approach outperforms models based on normal random effects and the Poisson or negative binomial count distribution.

In this research article we solve the problem of synchronization and anti-synchronization of chaotic systems described by discrete and time-delayed variable fractional order differential equations. To guarantee the synchronization and anti-synchronization of these systems, we use the well-known PID control theory and the Lyapunov-Krasovskii stability theory for discrete systems of variable fractional order.We illustrate the results obtained through simulation with examples, in which it can be seen that our results are satisfactory, thus achieving synchronization and anti-synchronization of chaotic systems of variable fractional order with discrete time delay.

In this paper, we examine two strategies for boosting the performance of ensembles of Siamese networks (SNNs) for image classification using two loss functions (Triplet and Binary Cross Entropy) and two methods for building the dissimilarity spaces (FULLY and DEEPER). With FULLY, the distance between a pattern and a prototype is calculated by comparing two images using the fully connected layer of the Siamese network. With DEEPER, each pattern is described using a deeper layer combined with dimensionality reduction. The basic design of the SNNs takes advantage of supervised k-means clustering for building the dissimilarity spaces that train a set of support vector machines, which are then combined by sum rule for a final decision. The robustness and versatility of this approach are demonstrated on several cross-domain image data sets, including a portrait data set, two bioimage and two animal vocalization data sets. Results show that the strategies employed in this work to increase the performance of dissimilarity image classification using SNN is closing the gap with standalone CNNs. Moreover, when our best system is combined with an ensemble of CNNs, the resulting performance is superior to an ensemble of CNNs, demonstrating that our new strategy is extracting additional information.

The notion of potential-growth indicator came to being in the field of matrix population models long ago, almost simultaneously with the pioneering Leslie model for age-structured population dynamics, albeit the term has been given and the theory developed only recent years. The indicator represents an explicit function, R(L), of matrix L elements and indicates the position of the spectral radius of L relative to 1 on the real axis, thus signifying the population growth, or decline, or stabilization. Some indicators turned out useful in theoretical layouts and practical applications prior to calculating the spectral radius itself. The most senior (1994) and popular indicator, R0(L), is known as the net reproductive rate, and we consider two more ones, R1(L) and RRT(A), developed later on. All the three are different in what concerns their simplicity and the level of generality, and we illustrate them with a case study of Calamagrostis epigeios, a long-rhizome perennial weed actively colonizing open spaces in the temperate zone. While the R0(L) and R1(L) fail respectively because of complexity and insufficient generality, the RRT(L) does succeed, justifying the merit of indication.

Most existing flexible count regression models allow only approximate inference. Balanced discretization is a simple method to produce a mean-parametrizable flexible count distribution starting from a continuous probability distribution. This makes easy the definition of flexible count regression models allowing exact inference under various types of dispersion (equi-, under- and overdispersion). This study describes maximum likelihood (ML) estimation and inference in count regression based on balanced discrete gamma (BDG) distribution and introduces a likelihood ratio based latent equidispersion (LE) test to identify the parsimonious dispersion model for a particular dataset. A series of Monte Carlo experiments were carried out to assess the performance of ML estimates and the LE test in the BDG regression model, as compared to the popular Conway-Maxwell-Poisson model (CMP). The results show that the two evaluated models recover population effects even under misspecification of dispersion related covariates, with coverage rates of asymptotic 95% confidence interval approaching the nominal level as the sample size increases. The BDG regression approach, nevertheless, outperforms CMP regression in very small samples (n = 15 − 30), mostly in overdispersed data. The LE test proves appropriate to detect latent equidispersion, with rejection rates converging to the nominal level as the sample size increases. Two applications on real data are given to illustrate the use of the proposed approach to count regression analysis.

In this study, we consider delta fractional Sturm--Liouville (DFSL) initial value problems in the sense of delta Caputo and delta Riemann-Liouville (R--L) operators. One of the properties of delta fractional difference operators which makes it different from nabla counterpart is to shift its domain. This feature makes it more complex than the nabla fractional operator. We obtain sum representation of solutions for DFSL initial value problems with the help of $\mathcal{Z}-$ transformation. Moreover, we get analytical solutions of homogeneous DFSL problem within Riemann-Liouville (R--L) and Caputo sense, discrete Sturm--Liouville (DSL) problem, continuous fractional Sturm--Liouville (FSL) problem in the sense of R--L and Caputo operators, and continuous Sturm--Liouville (SL) differential problem. From this point of view, we compare all the solutions with each other. Consequently, we show that all results for these four eigenvalue problems are compatible with each other and approach to each other while the orders tends to one, i.e. $\Delta^{\mu }\left( \Delta x\left( t-\mu \right) \right)\cong D_{0^{+}}^{\mu }\left( x^{\prime }\left( t\right) \right)\cong \Delta^2x(n-1) \cong x^{\prime \prime }\left( t\right) =\lambda x\left( t\right),\ \mu\rightarrow1 $ . We support our results comparatively by tables and simulations in detail.

In this paper, Hybrid Automata, which is a formal model for hybrid systems, has been introduced. A summary of its theory is presented and some of its special and important classes are listed and some properties that can be studied and checked for it are mentioned. Finally, the purposes of use, the most widely used areas, and the tools that provide H.A. Support are addressed.

In this paper, we introduce two discrete degenerate random variables, namely the degenerate binomial and degenerate Poisson random variables. We deduce the expectations of the degenerate binomial random variables. We compute the generating function of the moments of the degenerate Poisson random variables, which leads us to define the new type degenerate Bell polynomials, and hence obtain explicit expressions for the moments of those random variables in terms of such polynomials. We also get the variances of the degenerate Poisson random variables. Finally, we illustrate two examples of the degenerate Poisson random variables.

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. The theory of the actual manipulated quantities was shown, including the standard set of shift, modulation, multiplication, and convolution rules. In this second part of the series, we address the computational aspects of the 2D DFT in polar coordinates. Specifically, we demonstrate how the decomposition of the 2D DFT as a DFT, Discrete Hankel Transform (DHT) and inverse DFT sequence can be exploited for efficient code. We also demonstrate how the proposed 2D DFT can be used to approximate the continuous forward and inverse Fourier transform in polar coordinates in the same manner that the 1D DFT can be used to approximate its continuous counterpart.

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In this paper, we propose and evaluate the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. This discrete theory is shown to arise from discretization schemes that have been previously employed with the 1D DFT and the discrete Hankel Transform (DHT). The proposed transform possesses orthogonality properties, which leads to invertibility of the transform. In the first part of this two-part paper, the theory of the actual manipulated quantities is shown, including the standard set of shift, modulation, multiplication, and convolution rules. Parseval and modified Parseval relationships are shown, depending on which choice of kernel is used. Similar to its continuous counterpart, the 2D DFT in polar coordinates is shown to consist of a 1D DFT, DHT and 1D inverse DFT.

This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic travelling salesman problem (DTSP). The DTSP can be modelled as a sequence of static sub-problems, each of which is an instance of the TSP. We present a method for automatically setting the values of the DPSO parameters without three parameters, which can be defined based on the size of the problem, the size of the particle swarm, the number of iterations, and the particle neighbourhood size. We show that the diversity of parameter values has a positive effect on the quality of the generated results. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.

Let be a power function $f_{r,M}(s)$ defined for every $s$ within the finite set $M$ as follows $$f_{r,M}(s)= \begin{cases} s^r, \ &s\in M,\\ 0, \ &\mathrm{otherwise}. \end{cases} $$ Let a discrete convolution of $f_{r,M}(s)$ be denoted as follows $\mathrm{Conv}_{r,M}[n]=(f_{r,M}*f_{r,M})[n]$. Let a real coefficients $A_{m,j}$ be given by the following recurrence $$ A_{m,j} = \begin{cases} 0, & \mathrm{if } \ j<0 \ \mathrm{or } \ j>m, \\ (2j+1)\binom{2j}{j} \sum_{d=2j+1}^{m} A_{m,d} \binom{d}{2j+1} \frac{(-1)^{d-1}}{d-j} B_{2d-2j}, & \mathrm{if } \ 0 \leq j < m, \\ (2j+1)\binom{2j}{j}, & \mathrm{if } \ j=m. \end{cases} $$ In this paper we show that for every $n>0$ the following odd-power identities involving coefficients $A_{m,j}$ and convolution transform $\mathrm{Conv}_{r,M}[n]$ hold $$ \begin{split} n^{2m+1}+1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{N}}[n],\\ n^{2m+1}-1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{Z}_{>0}}[n],\\ n^{2m+1}&=\sum_{r=0}^{m}A_{m,r}\sum_{k=1}^{n} k^r(n-k)^r\\ &=\sum_{r=0}^{m}A_{m,r}\sum_{k=0}^{n-1} k^r(n-k)^r. \end{split} $$

Although Shannon mutual information has been widely used, its effective calculation is often difficult for many practical problems, including those in neural population coding. Asymptotic formulas based on Fisher information sometimes provide accurate approximations to the mutual information but this approach is restricted to continuous variables because the calculation of Fisher information requires derivatives with respect to the encoded variables. In this paper, we consider information-theoretic bounds and approximations of the mutual information based on Kullback--Leibler divergence and Rényi divergence. We propose several information metrics to approximate Shannon mutual information in the context of neural population coding. While our asymptotic formulas all work for discrete variables, one of them has consistent performance and high accuracy regardless of whether the encoded variables are discrete or continuous. We performed numerical simulations and confirmed that our approximation formulas were highly accurate for approximating the mutual information between the stimuli and the responses of a large neural population. These approximation formulas may potentially bring convenience to the applications of information theory to many practical and theoretical problems.

In the paper, a fully discrete compact difference scheme with $O(\tau^{2}+h^{4})$ precision is established by considering the numerical approximation of the one-dimensional Allen-Cahn equation. The numerical solutions satisfy discrete maximum principle under reasonable step ratio and time step constraint is proved. And the energy stability for the fully discrete scheme is investigated. An example is finally presented to show the effectiveness of scheme.

This algorithm is designed to perform Discrete Fourier Transforms (DFT) to convert temporal data into spectral data. This algorithm obtains the Fourier Transforms by studying the Coefficient of Determination of a series of artificial sinusoidal functions with the temporal data, and normalizing the variance data into a high-resolution spectral representation of the time-domain data with a finite sampling rate. What is especially beneficial about this DFT algorithm is that it can produce spectral data at any user-defined resolution.

Inverse Sumudu transform multiple shifting properties are used to design methodology for solving ordinary differential equations. Then algorithm applied to solve Whittaker and Zettl equations to get their new exact solutions and profiles which shown through Maple complex graphicals. Table of inverse Sumudu transforms for elementary functions given for supporting the differential equations solving using inverse Sumudu transform.

Optimal dividend payment under a ruin constraint is a two objective control problem which—in simple models—can be solved numerically by three essentially different methods. One is based on a modified Bellman equation and the policy improvement method (see Hipp C., 2003). In this paper we use explicit formulas for running allowed ruin probabilities which avoid a complete search and speed up and simplify the computation. The second is also a policy improvement method, but without the use of a dynamic equation (see Hipp C., 2003). It is based on closed formulas for first entry probabilities and discount factors for the time until first entry (see Hipp C., 2016). Third a new, faster and more intuitive method which uses appropriately chosen barrier levels and a closed formula for the corresponding dividend value. Using the running allowed ruin probabilities, a simple test for admissibility—concerning the ruin constraint—is given. All these methods work for the discrete De Finetti model and are applied in a numerical example. The non stationary Lagrange multiplier method suggested in (see Hipp C., 2016), Section 2.2.2 does also yield optimal dividend strategies which differ from those in all other methods, and Lagrange gaps are present here. These gaps always exist in De Finetti models, see (see Hipp C., 2017).

High Efficiency Video Coding (HEVC) uses an 8-point filter and a 7-point filter, which are based on the discrete cosine transform (DCT), for the 1/2-pixel and 1/4-pixel interpolations, respectively. In this paper, discrete sine transform (DST)-based interpolation filters (IF) are proposed. The first proposed DST-based IFs (DST-IFs) use 8-point and 7-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. The final proposed DST-IFs use 12-point and 11-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. These DST-IF methods are proposed to improve the motion-compensated prediction in HEVC. The 8-point and 7-point DST-IF methods showed average BD-rate reductions of 0.7% and 0.3% in the random access (RA) and low delay B (LDB) configurations, respectively. The 12-point and 11-point DST-IF methods showed average BD-rate reductions of 1.4% and 1.2% in the RA and LDB configurations for the Luma component, respectively.

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals.