21 resultados para Span-by-span method


Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper a new system identification algorithm is introduced for Hammerstein systems based on observational input/output data. The nonlinear static function in the Hammerstein system is modelled using a non-uniform rational B-spline (NURB) neural network. The proposed system identification algorithm for this NURB network based Hammerstein system consists of two successive stages. First the shaping parameters in NURB network are estimated using a particle swarm optimization (PSO) procedure. Then the remaining parameters are estimated by the method of the singular value decomposition (SVD). Numerical examples including a model based controller are utilized to demonstrate the efficacy of the proposed approach. The controller consists of computing the inverse of the nonlinear static function approximated by NURB network, followed by a linear pole assignment controller.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A systematic approach is presented for obtaining cylindrical distribution functions (CDF's) of noncrystalline polymers which have been oriented by extension. The scattering patterns and CDF's are also sharpened by the method proposed by Deas and by Ruland. Data from atactic poly(methyl methacrylate) and polystyrene are analysed by these techniques. The methods could also be usefully applied to liquid crystals.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A system identification algorithm is introduced for Hammerstein systems that are modelled using a non-uniform rational B-spline (NURB) neural network. The proposed algorithm consists of two successive stages. First the shaping parameters in NURB network are estimated using a particle swarm optimization (PSO) procedure. Then the remaining parameters are estimated by the method of the singular value decomposition (SVD). Numerical examples are utilized to demonstrate the efficacy of the proposed approach.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Details are given of the development and application of a 2D depth-integrated, conformal boundary-fitted, curvilinear model for predicting the depth-mean velocity field and the spatial concentration distribution in estuarine and coastal waters. A numerical method for conformal mesh generation, based on a boundary integral equation formulation, has been developed. By this method a general polygonal region with curved edges can be mapped onto a regular polygonal region with the same number of horizontal and vertical straight edges and a multiply connected region can be mapped onto a regular region with the same connectivity. A stretching transformation on the conformally generated mesh has also been used to provide greater detail where it is needed close to the coast, with larger mesh sizes further offshore, thereby minimizing the computing effort whilst maximizing accuracy. The curvilinear hydrodynamic and solute model has been developed based on a robust rectilinear model. The hydrodynamic equations are approximated using the ADI finite difference scheme with a staggered grid and the solute transport equation is approximated using a modified QUICK scheme. Three numerical examples have been chosen to test the curvilinear model, with an emphasis placed on complex practical applications

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Background: Acquisition of the intestinal microbiota in early life corresponds with the development of the mucosal immune system. Recent work on caesarean-delivered infants revealed that early microbial composition is influenced by birthing method and environment. Furthermore, we have confirmed that early-life environment strongly influences both the adult gut microbiota and development of the gut immune system. Here, we address the impact of limiting microbial exposure after initial colonization on the development of adult gut immunity. Methodology/Principal Findings: Piglets were born in indoor or outdoor rearing units, allowing natural colonization in the immediate period after birth, prior to transfer to high-health status isolators. Strikingly, gut closure and morphological development were strongly affected by isolator-rearing, independent of indoor or outdoor origins of piglets. Isolator-reared animals showed extensive vacuolation and disorganization of the gut epithelium, inferring that normal gut closure requires maturation factors present in maternal milk. Although morphological maturation and gut closure were delayed in isolatorreared animals, these hard-wired events occurred later in development. Type I IFN, IL-22, IL-23 and Th17 pathways were increased in indoor-isolator compared to outdoor-isolator animals during early life, indicating greater immune activation in pigs originating from indoor environments reflecting differences in the early microbiota. This difference was less apparent later in development due to enhanced immune activation and convergence of the microbiota in all isolator-reared animals. This correlated with elevation of Type I IFN pathways in both groups, although T cell pathways were still more affected in indoor-reared animals. Conclusions/Significance: Environmental factors, in particular microbial exposure, influence expression of a large number of immune-related genes. However, the homeostatic effects of microbial colonization in outdoor environments require sustained microbial exposure throughout development. Gut development in high-hygiene environments negatively impacts on normal succession of the gut microbiota and promotes innate immune activation which may impair immune homeostasis.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.