931 resultados para Locally Elementary Operators


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A model of sugarcane digestion was applied to indicate the suitability of various locally available supplements for enhancing milk production of Indian crossbred dairy cattle. Milk production was calculated according to simulated energy, lipogenic, glucogenic and aminogenic substrate availability. The model identified the most limiting substrate for milk production from different sugarcane-based diets. For sugarcane tops/urea fed alone, milk production was most limited by amino acid followed by long chain fatty acid availability. Among the protein-rich oil cake supplements at 100, 200 and 300 g supplement/kg total DM, cottonseed oil cake proved superior with a milk yield of 5.5, 7.3 and 8.3 kg/day, respectively. This was followed by mustard oil cake with 5.1, 6.5 and 7.6 kg/day, respectively. In the case of a protein-rich supplement (fish meal), milk yield was limited to 6.6 kg/day due to a shortage of long chain fatty acids. However, at 300 g of supplementation, energy became limiting, with a milk yield of 6.7 kg/day. Supplementation with rice bran and rice polishings at 100, 200 and 300 g restricted milk yield to 4.3, 4.9 and 5.5 and 4.5, 5.3 and 6.1 kg/day, respectively, and amino acids became the factor limiting milk production. The diet comprising basal sugarcane tops supplemented by leguminous fodder, dry fodder (e.g. rice or wheat straw) and concentrates at levels of 100, 200 and 300 g supplements/kg total diet DM proved to be the most balanced with a milk yield of 5.1, 6.7 and 9.0 kg/day, respectively.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A construction algorithm for multioutput radial basis function (RBF) network modelling is introduced by combining a locally regularised orthogonal least squares (LROLS) model selection with a D-optimality experimental design. The proposed algorithm aims to achieve maximised model robustness and sparsity via two effective and complementary approaches. The LROLS method alone is capable of producing a very parsimonious RBF network model with excellent generalisation performance. The D-optimality design criterion enhances the model efficiency and robustness. A further advantage of the combined approach is that the user only needs to specify a weighting for the D-optimality cost in the combined RBF model selecting criterion and the entire model construction procedure becomes automatic. The value of this weighting does not influence the model selection procedure critically and it can be chosen with ease from a wide range of values.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The note proposes an efficient nonlinear identification algorithm by combining a locally regularized orthogonal least squares (LROLS) model selection with a D-optimality experimental design. The proposed algorithm aims to achieve maximized model robustness and sparsity via two effective and complementary approaches. The LROLS method alone is capable of producing a very parsimonious model with excellent generalization performance. The D-optimality design criterion further enhances the model efficiency and robustness. An added advantage is that the user only needs to specify a weighting for the D-optimality cost in the combined model selecting criterion and the entire model construction procedure becomes automatic. The value of this weighting does not influence the model selection procedure critically and it can be chosen with ease from a wide range of values.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper introduces a new variant of the popular n-dimensional hypercube network Q(n), known as the n-dimensional locally twisted cube LTQ(n), which has the same number of nodes and the same number of connections per node as Q(n). Furthermore. LTQ(n) is similar to Q(n) in the sense that the nodes can be one-to-one labeled with 0-1 binary sequences of length n. so that the labels of any two adjacent nodes differ in at most two successive bits. One advantage of LTQ(n) is that the diameter is only about half of the diameter of Q(n) We develop a simple routing algorithm for LTQ(n), which creates a shortest path from the source to the destination in O(n) time. We find that LTQ(n) consists of two disjoint copies of Q(n) by adding a matching between their nodes. On this basis. we show that LTQ(n) has a connectivity of n.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The locally twisted cube is a newly introduced interconnection network for parallel computing. Ring embedding is an important issue for evaluating the performance of an interconnection network. In this paper, we investigate the problem of embedding rings into a locally twisted cube. Our main contribution is to find that, for each integer l is an element of (4,5,...,2(n)}, a ring of length I can be embedded into an n-dimensional locally twisted cube so that both the dilation and the load factor are one. As a result, a locally twisted cube is Hamiltonian. We conclude that a locally twisted cube is superior to a hypercube in terms of ring embedding capability. (C) 2004 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers for these formulations, and also on the norms of the classical acoustic single- and double-layer potential operators. These bounds to some extent make explicit the dependence of condition numbers on the wave number $k$, the geometry of the scatterer, and the coupling parameter. For example, with the usual choice of coupling parameter they show that, while the condition number grows like $k^{1/3}$ as $k\to\infty$, when the scatterer is a circle or sphere, it can grow as fast as $k^{7/5}$ for a class of `trapping' obstacles. In this paper we prove further bounds, sharpening and extending our previous results. In particular we show that there exist trapping obstacles for which the condition numbers grow as fast as $\exp(\gamma k)$, for some $\gamma>0$, as $k\to\infty$ through some sequence. This result depends on exponential localisation bounds on Laplace eigenfunctions in an ellipse that we prove in the appendix. We also clarify the correct choice of coupling parameter in 2D for low $k$. In the second part of the paper we focus on the boundary element discretisation of these operators. We discuss the extent to which the bounds on the continuous operators are also satisfied by their discrete counterparts and, via numerical experiments, we provide supporting evidence for some of the theoretical results, both quantitative and asymptotic, indicating further which of the upper and lower bounds may be sharper.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we extend the well-known Leinfelder–Simader theorem on the essential selfadjointness of singular Schrödinger operators to arbitrary complete Riemannian manifolds. This improves some earlier results of Shubin, Milatovic and others.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove essential self-adjointness of a class of Dirichlet operators in ℝn using the hyperbolic equation approach. This method allows one to prove essential self-adjointness under minimal conditions on the logarithmic derivative of the density and a condition of Muckenhoupt type on the density itself.