tailieunhanh - Artificial Mind System – Kernel Memory Approach - Tetsuya Hoya Part 7

Tham khảo tài liệu 'artificial mind system – kernel memory approach - tetsuya hoya part 7', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | 46 3 The Kernel Memory Concept i Fig. . Example 2 - a bi-directional MIMO system represented by kernel memory in the figure each of the three kernel units receives and yields the outputs representing the bi-directional flows. For instance when both the two modality-dependent inputs x1 and x2 are simultaneously presented to the kernel units K1 and K2 respectively K3 may be subsequently activated via the transfer of the activations from K1 and K2 due to the link weight connections in between thus feedforward . In reverse the excitation of the kernel unit K3 can cause the subsequent activations from K1 and K2 via the link weights w12 and w13 . feedback . Note that instead of ordinary outputs each kernel is considered to output its template centroid vector in the figure formation . related to the concept formation to be described in Chap. 9 . Thus the information flow in this case is feedforward x1 x2 K1 K K3 . In contrast if such a Gestalt kernel K3 is somehow activated by the other kernel s via w3k and the activation is transferred back to both kernels K1 and K2 via the respective links W13 and w23 the information flow is in turn feedback since W3k K3 K1 K2 . Therefore the kernel memory as in Fig. represents a bi-directional MIMO system. As a result it is also possible to design the kernel memory in such a way that the kernels K1 and K2 eventually output the centroid vector c1 and c2 respectively and if the appropriate decoding mechanisms for c1 and c2 are given as external devices we could even restore the complete information . in this example this imitates the mental process to remember both the sound and facial image of a specific person at once . Note that both the MIMO systems in Figs. and can in principle be viewed as graph theoretic networks see . Christofides 1975 and the Topological Variations in Terms of Kernel Memory 47 X3 o o o- XM Fig. . Example 3 - a tree-like representation in terms of a MIMO kernel memory system in .