904 resultados para Secure multiparty computation cryptography
Resumo:
Fostering young children's mental computation capacity is essential to support their numeracy development. Debate continues as to whether young children should be explicitly taught strategies for mental computation, or be afforded the freedom to develop their own. This paper reports on teaching experiments with two groups of students in their first year of schooling: those considered 'at-risk', and those deemed mathematically advanced. Both groups made considerable learning gains as a result of instruction. Importantly, the gains of the at-risk group are likely to renew both their own, and their teacher's confidence in their ability to learn. In this paper, the instructional programs are documented, highlighting the influence of instruction upon the children's development.
Resumo:
For neural networks with a wide class of weight priors, it can be shown that in the limit of an infinite number of hidden units, the prior over functions tends to a gaussian process. In this article, analytic forms are derived for the covariance function of the gaussian processes corresponding to networks with sigmoidal and gaussian hidden units. This allows predictions to be made efficiently using networks with an infinite number of hidden units and shows, somewhat paradoxically, that it may be easier to carry out Bayesian prediction with infinite networks rather than finite ones.
Resumo:
Training Mixture Density Network (MDN) configurations within the NETLAB framework takes time due to the nature of the computation of the error function and the gradient of the error function. By optimising the computation of these functions, so that gradient information is computed in parameter space, training time is decreased by at least a factor of sixty for the example given. Decreased training time increases the spectrum of problems to which MDNs can be practically applied making the MDN framework an attractive method to the applied problem solver.