منابع مشابه
A Convergence Theorem for Sequential Learning in Two Layer Perceptrons
We consider a Perceptron with Ni input units, one output and a yet unspecified number of hidden units. This Perceptron must be able to learn a given but arbitrary set of input-output examples. By sequential learning we mean that groups of patterns, pertaining to the same class, are sequentially separated from the rest by successively adding hidden units until the remaining patterns are all in t...
متن کاملDesigning Perceptrons for the Recognitionof
Digital straight lines can be charactarized by Rosenfeld's chord property as well as Hung's evenness property. Both properties can be formulated in terms of linear inequalities. Because linear inequalities can be veriied by the predicates of a Gamba perceptron, this leads in a straightforward manner to the design of perceptrons that can recognize digital straight lines. In this paper we will di...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولStrategies for Scheduling And - andOr - Work in Parallel Logic Program
Recent parallel logic programming systems, such as Andorra-I, can exploit multiple forms of parallelism, and-and or-parallelism, in logic programs. In order to eeectively exploit both kinds of parallelism, such systems must address one problem not yet tackled in logic programming systems, namely how to distribute resources between two diierent kinds of parallel work, and-and or-work. This paper...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1992
ISSN: 0263-6115
DOI: 10.1017/s1446788700035333