A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F , a semikernel S modulo F is an independent set such that if some Sz-arc is not in F , then there exists a zS-arc. A sufficient condition on the digraph is given in terms of semikernel modu...

Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it nonscalable and unsuitable for applications with large-scale datasets. In this work, we study the problem of bounded kernel-based online learning that aims to constrain the number of s...

We interpret the $X_1(2900)$ as an $S$-wave $\bar{D}_1K$ molecular state in Bethe-Salpeter equation approach with ladder and instantaneous approximations for kernel. By solving numerically kernel containing one-particle-exchange diagrams introducing three different form factors (monopole, dipole, exponential factors) verties, we find bound exists. also study decay width of to $D^-K^+$.

Suppose f k g n k=0 is an orthonornal basis for the function space L n of polynomi-als or rational functions of degree n with prescribed poles. Suppose n = 2 s and set V s = L n. Then k n (z; w) = P n k=0 k (z) k (w), is a reproducing kernel for V s. For xed w, such reproducing kernels are known to be functions localized in the neighborhood of z = w. Moreover, by an appropriate choice of the pa...

We construct the fundamental solution of ∂t − ∆y − q(t, y), for functions q with a certain integral space-time relative smallness, in particular for those satisfying a relative Kato condition. The resulting transition density is comparable to the Gaussian kernel in finite time, and it is even asymptotically equal to the Gaussian kernel (in small time) under the relative Kato condition. The resu...

We study the kernel Kn,s(z) of the remainder term Rn,s( f ) of Gauss–Turán–Kronrod quadrature rules with respect to one of the generalized Chebyshev weight functions for analytic functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L∞-error bounds of Gauss–Turán–Kronrod quadratures. Following Kronrod,...

This paper is concerned with stability and recursive feasibility of constrained linear receding horizon control schemes without terminal constraints and costs. Particular attention is paid to characterize the basin of attraction S of the asymptotically stable equilibrium. For stabilizable linear systems with quadratic costs and convex constraints we show that any compact subset of the interior ...

Several physical properties of almond nut and kernel were evaluated as functions of moisture content. The average length, width, thickness, the geometric mean diameter, unit mass and volume of nuts were 25.49, 17.03, 13.12, 18.13 mm, 2.64 g and 2.61 cm respectively. Corresponding values for kernel were 21.19, 14.34, 6.38, 11.42 mm, 0.69 g and 0.71 cm respectively. In the moisture range from 2.7...

The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a particular family of instances of this problem, namely the packing of stars. We give a quadratic kernel for packing k copies of H = K1,s. When we consider the special case of s = 2,...

An integrated 128x128 CMOS image sensor with programmable diffusion kernel for local brightness adaptation and contrast enhancement achieves local brightness adaptation by dividing each individual pixel photocurrent by the average photocurrent of the corresponding kernel. The chip is realized in 1μm standard CMOS. Pixel pitch is 47μm and total chip area is 86.4 mm2. Power dissipation is 20mW at...