877 resultados para Continuous cropping obstacle
Resumo:
In this paper we analyze the partial grades – of continuous assessment activities including the final exam – and the final grades – computed as a weighted average of partial grades – for nine subjects taught in the third year of Business Administration Degree. On one hand, results show that there is a significant positive correlation between the grades of continuous assessment activities (excluded the final exam) and final exam in seven subjects. On the other hand, overall we find that students’ grades in continuous assessment activities (excluded the final exam) help in the improvement of their final grades (i.e., students’ final grades exceed the grades that they would obtain by only taking into account their final exam grades). The results are consistent when the analysis is carried out over each subject area as well as over the grades of the students who registered for the nine subjects.
Resumo:
We study entanglement accumulation in a memory built out of two continuous variable systems interacting with a qubit that mediates their indirect coupling. We show that, in contrast with the case of bidimensional Hilbert spaces, entanglement superior to one ebit can be accumulated in the memory, even though no entangled resource is used. The protocol is immediately implementable and we assess the role of the main imperfections.
Resumo:
According to the Mickael's selection theorem any surjective continuous linear operator from one Fr\'echet space onto another has a continuous (not necessarily linear) right inverse. Using this theorem Herzog and Lemmert proved that if $E$ is a Fr\'echet space and $T:E\to E$ is a continuous linear operator such that the Cauchy problem $\dot x=Tx$, $x(0)=x_0$ is solvable in $[0,1]$ for any $x_0\in E$, then for any $f\in C([0,1],E)$, there exists a continuos map $S:[0,1]\times E\to E$, $(t,x)\mapsto S_tx$ such that for any $x_0\in E$, the function $x(t)=S_tx_0$ is a solution of the Cauchy problem $\dot x(t)=Tx(t)+f(t)$, $x(0)=x_0$ (they call $S$ a fundamental system of solutions of the equation $\dot x=Tx+f$). We prove the same theorem, replacing "continuous" by "sequentially continuous" for locally convex spaces from a class which contains strict inductive limits of Fr\'echet spaces and strong duals of Fr\'echet--Schwarz spaces and is closed with respect to finite products and sequentially closed subspaces. The key-point of the proof is an extension of the theorem on existence of a sequentially continuous right inverse of any surjective sequentially continuous linear operator to some class of non-metrizable locally convex spaces.
Resumo:
A continuous forward algorithm (CFA) is proposed for nonlinear modelling and identification using radial basis function (RBF) neural networks. The problem considered here is simultaneous network construction and parameter optimization, well-known to be a mixed integer hard one. The proposed algorithm performs these two tasks within an integrated analytic framework, and offers two important advantages. First, the model performance can be significantly improved through continuous parameter optimization. Secondly, the neural representation can be built without generating and storing all candidate regressors, leading to significantly reduced memory usage and computational complexity. Computational complexity analysis and simulation results confirm the effectiveness.
Resumo:
A conventional local model (LM) network consists of a set of affine local models blended together using appropriate weighting functions. Such networks have poor interpretability since the dynamics of the blended network are only weakly related to the underlying local models. In contrast, velocity-based LM networks employ strictly linear local models to provide a transparent framework for nonlinear modelling in which the global dynamics are a simple linear combination of the local model dynamics. A novel approach for constructing continuous-time velocity-based networks from plant data is presented. Key issues including continuous-time parameter estimation, correct realisation of the velocity-based local models and avoidance of the input derivative are all addressed. Application results are reported for the highly nonlinear simulated continuous stirred tank reactor process.
Resumo:
Numerous everyday tasks require the nervous system to program a prehensile movement towards a target object positioned in a cluttered environment. Adult humans are extremely proficient in avoiding contact with any non-target objects (obstacles) whilst carrying out such movements. A number of recent studies have highlighted the importance of considering the control of reach-to-grasp (prehension) movements in the presence of such obstacles. The current study was constructed with the aim of beginning the task of studying the relative impact on prehension as the position of obstacles is varied within the workspace. The experimental design ensured that the obstacles were positioned within the workspace in locations where they did not interfere physically with the path taken by the hand when no obstacle was present. In all positions, the presence of an obstacle caused the hand to slow down and the maximum grip aperture to decrease. Nonetheless, the effect of the obstacle varied according to its position within the workspace. In the situation where an obstacle was located a small distance to the right of a target object, the obstacle showed a large effect on maximum grip aperture but a relatively small effect on movement time. In contrast, an object positioned in front and to the right of a target object had a large effect on movement speed but a relatively small effect on maximum grip aperture. It was found that the presence of two obstacles caused the system to decrease further the movement speed and maximum grip aperture. The position of the two obstacles dictated the extent to which their presence affected the movement parameters. These results show that the antic ipated likelihood of a collision with potential obstacles affects the planning of movement duration and maximum grip aperture in prehension.
Resumo:
This paper discusses the design of gain- scheduled sampled-data controllers for continuous-time polytopic linear parameter-varying systems. The scheduling variables are assumed to available only at the sampling instants, and a bound on the time-variation of the scheduling parameters is also assumed to be known. The resultant gain-scheduled controllers improve the maximum achieveable delay bound over previous constant-gain ones in the literature.