LetD = (V (D), A(D)) be a digraph; a kernelN ofD is a set of verticesN ⊆ V (D) such that N is independent (for any x, y∈N there is no arc between them) and N is absorbent (for each x ∈ V (D) −N) there exists an xN -arc in D). A digraph D is said to be kernel-perfect whenever each one of its induced subdigraphs has a kernel. A digraph D is oriented by sinks when every semicomplete subdigraph of ...

Combined with weight of samples and kernel function, fuzzy clustering method with generalized entropy is studied. Objective function for fuzzy clustering with generalized entropy based on sample weighting is obtained. Following that, fuzzy clustering algorithm with generalized entropy based on sample weighting is presented. In addition, by introducing kernel into the presented objective functio...

An experiment was carried out in a 38 years old coconut plantation of Sakhigopal Local Tall variety at All India Coordinated Research Project on palms, Konark (OUAT) during July 2017 to June 2019. The treatments comprised three cropping system and integrated nutrient management practices. laid Split Plot Design with replications. studies revealed that adoption + sapota pineapple application gre...

Combining ability effects were estimated for different agronomic characters in line × tester crossing program comprising 21 hybrids produced by crossing 7 lines and 3 testers. Parents and hybrids differed significantly for general combining ability (GCA) and specific combining ability (SCA) effects, respectively. The variance due to GCA and SCA showed that gene action was predominantly additive...

Theorem 1 gives an explicit formula for the heat kernel on an H -type group. Folland (2] has shown that for stratified nilpotent Lie groups the heat semigroup is a semigroup of kernel operators on LP, 1 5 p < oo and on Co. Cygan (1] has obtained formulas for heat kernels for any two step nilpotent simply connected Lie group. Cygan found the heat kernel for a free simply connected two step nilpo...

Let G be a directed graph. Its vertex-set will be denoted by X, and its arcs (or ‘directed edges’) are a subset of the Cartesian product X x X. A kernel of G is a subset S of X which is ‘stable’ (independent, i.e.: a vertex in S has no successor in S) and ‘absorbant’ (dominating, i.e. a vertex not in S has a successor in S). This concept has found many applications, for instance in cooperative ...

We provide a new definition for reproducing kernel space with weighted integral and present a method to construct and calculate the reproducing kernel for the space. The new reproducing kernel space is an enlarged reproducing kernel space, which contains the traditional reproducing kernel space. The proposed method of this paper is a universal method and is suitable for the case of that the wei...