نتایج جستجو برای: kernel weight

تعداد نتایج: 397502  

Journal: :تولید گیاهان زراعی 0

in order to study of drought tolerance in bread wheat genotypes, this study was conducted in maragheh dryland agricultural research station. the study included two experiments and the statistical design of each experiment was a rcbd with four replications, and 20 bread wheat genotypes that were compared under drought stress (rainfed) and supplementary irrigation. analysis of simple variance sup...

A. Cizmesija J. Pecaric M. Krnic

We derive whole series of new integral inequalities of the Hardy-type, with non-conjugate exponents. First, we prove and discuss two equivalent general inequa-li-ties of such type, as well as their corresponding reverse inequalities. General results are then applied to special Hardy-type kernel and power weights. Also, some estimates of weight functions and constant factors are obtained. ...

Journal: :CoRR 2012
John Moeller Parasaran Raman Avishek Saha Suresh Venkatasubramanian

We present a fast algorithm for multiple kernel learning (MKL). Our matrix multiplicative weight update (MWUMKL) algorithm is based on a well-known QCQP formulation [5]. In addition, we propose a novel fast matrix exponentiation routine for QCQPs which might be of independent interest. Our method avoids the use of commercial nonlinear solvers and scales efficiently to large data sets. 1

Journal: :Pakistan journal of biological sciences : PJBS 2014
Abel Debebe Harijat Singh Hailu Tefera

This experiment was conducted at Debre Zeit and Akaki during 2004-2005 cropping season on F2-derived F4 bulk families of three crosses, viz, DZ-01-974 x DZ-01-2786, DZ-01-974 x DZ-Cr-37 and Alba x Kaye Murri. To estimate the correlations and path coefficients between yield and yield components, 63 F4 families were taken randomly from each of the three crosses. The 189 F4 families, five parents ...

2016
Marzieh Mokarram Ehsan Bijanzadeh

Prediction of barley yield is an attempt to accurately forecast the outcome of a specific situation, using as input information extracted from a set of data features that potentially describe the situation. In this study, an attempt has been made to analyze and compare multiple linear regression (MLR), and artificial neural network (ANN) including multi-layer p erceptron (MLP) and r adial basis...

2005
Suzanne M. Kelly Ron Brightwell

Catamount is designed to be a low overhead operating system for a parallel computing environment. Functionality is limited to the minimum set needed to run a scientific computation. The design choices and implementations will be presented.

2006
CHRISTOPHER A. OKPOTI

A discrete Hardy-type inequality ( ∑∞ n=1( ∑n k=1dn,kak)un) ≤ C( ∑∞ n=1 a p nvn) is considered for a positive “kernel” d = {dn,k}, n,k ∈ Z+, and p ≤ q. For kernels of product type some scales of weight characterizations of the inequality are proved with the corresponding estimates of the best constant C. A sufficient condition for the inequality to hold in the general case is proved and this co...

Journal: :Math. Comput. 2000
David Hunter Geno P. Nikolov

Gauss-Lobatto quadrature formulae associated with symmetric weight functions are considered. The kernel of the remainder term for classes of analytic functions is investigated on elliptical contours. Sufficient conditions are found ensuring that the kernel attains its maximal absolute value at the intersection point of the contour with either the real or the imaginary axis. The results obtained...

2017
BICHENG YANG B. YANG

Abstract. By the use of techniques of real analysis and weight functions, we obtain two lemmas and build a few equivalent conditions of a Hardy-type integral inequality with a non-homogeneous kernel, related to a parameter where the constant factor is expressed in terms of the extended Riemann zeta function. Meanwhile, a few equivalent conditions for two kinds of Hardytype integral inequalities...

Journal: :Neural networks : the official journal of the International Neural Network Society 2005
Menita Carozza Salvatore Rampone

In this paper, we consider learning problems defined on graph-structured data. We propose an incremental supervised learning algorithm for network-based estimators using diffusion kernels. Diffusion kernel nodes are iteratively added in the training process. For each new node added, the kernel function center and the output connection weight are decided according to an empirical risk driven rul...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید