We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This concluding chapter summarizes the key concepts discussed in this book. Once problem solving is accepted as any goal-directed activity, it becomes clear that problem solving can be viewed as a framework for discussing all of our cognitive functions. Mental representations are important not only because they can be changed and lead to insight. Abstract mental representations also lead to goal-directed actions in which mental functions can cause physical actions. The AI community is no longer surprised by this fact, so the time has come for the cognitive community to accept it, too. This book puts forth a conjecture that the symmetry of a problem representation is the key to solving problems intelligently, that is, the way humans solve them. Symmetry is essential in scientific discovery, in ordinary insight problems, and in combinatorial optimization problems as well. Combinatorial optimization problems have enormous search spaces, but humans know how to avoid performing search by using a direction. This is analogous to the way a least-action principle operates in physics. The path that requires the least effort can be produced in a step by step process where the next step is made without considering alternatives. All of this makes it clear, finally, why intuitive physics is real: mathematical concepts of symmetry and constrained optimization underlie both cognitive functions and the natural laws. These concepts have also been used in most engineering applications. This fact justifies the optimism that AI systems should be able to emulate human intelligence.
An inverse diffraction problem is considered. Both classical Tikhonov regularisation and a slow-evolution-from-the-continuation-boundary (SECB) method are used to solve the ill-posed problem. Regularisation error estimates for the two methods are compared, and the SECB method is seen to be an improvement on the classical Tikhonov method. Two numerical examples demonstrate their feasibility and efficiency.
We are concerned with the proof of a generalized solution to an ill-posed variational inequality. This is determined as a solution to an appropriate minimization problem involving a nonconvex functional, treated by an optimal control technique.
Morozov’s discrepancy principle is one of the simplest and most widely used parameter choice strategies in the context of regularization of ill-posed operator equations. Although many authors have considered this principle under general source conditions for linear ill-posed problems, such study for nonlinear problems is restricted to only a few papers. The aim of this paper is to apply Morozov’s discrepancy principle for Tikhonov regularization of nonlinear ill-posed problems under general source conditions.
A general method for solving stereological problems for particle systems is applied to polyhedron structures. We suggested computing the kernel function of the respective stereological integral equation by means of computer simulation. Two models of random polyhedrons are investigated. First, regular prisms are considered which are described by their size and shape. The size-shape distribution of a stationary and isotropic spatial ensemble of regular prisms can be estimated from the size-shape distribution of the polygons observed in a section plane. Secondly, random polyhedrons are constructed as the convex hull of points which are uniformly distributed on surfaces of spheres. It is assumed that the size of the polyhedrons and the number of points (i.e. the number of vertices) are random variables. Then the distribution of a spatially distributed ensemble of polyhedrons is determined by its size-number distribution. The corresponding numerical density of this bivariate size-number distribution can be stereologically determined from the estimated numerical density of the bivariate size-number distribution of the intersection profiles.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.