tailieunhanh - neural networks algorithms applications and programming techniques phần 6

đã được bản địa hoá cho các hàng và cột. Vì vậy, chúng tôi bao gồm ức chế toàn cầu, C, mà mỗi đơn vị trong mạng bị ức chế bởi số tiền này không đổi. Cuối cùng, nhớ lại rằng thời hạn cuối cùng trong chức năng năng lượng có chứa thông tin về khoảng cách đi du lịch theo chương trình. | 194 Simulated Annealing a I Low memory High memory b Figure The CO-OCCURRENCE array is shown a depicted as a sequential memory array and b with its mapping to the connections in the Boltzmann network. Figure a . The first four entries in the CO-OCCURRENCE array for this network would be mapped to the connections between units A-B A-C AD and A-E as shown in Figure b . Likewise the next three slots would be mapped to the connections between units B-C B-D and B-E the next two to C-D and C- E and the last one to D-E. By using the arrays in this manner we can collect co-occurrence statistics about the network by starting at the first input unit and sequentially scanning all other units in the network. After completing this initial pass we can complete the network scan by merely Ệ incrementing our array pointer to access the second unit then the third fourth . nth units. We can now specify the remaining data structures needed to implement the Boltzmann network simulator. We begin by defining the top-level record structure used to define the Boltzmann network record BOLTZMANN UNITS integer CLAMPED boOlean INPUTS DEDICATED OUTPUTS DEDICATED NODES layer TEMPERATURE float CURRENT integer number of units in network true clamped false unclamped locate and size network input locate and size network output pointer to layer structure current network temperature step in annealing schedule The Boltzmann Simulator 195 ANNEALING SCHEDULE pointer to user-defined schedule STATISTICS CO-OCCURRENCE pointers to statistics arrays end record Figure provides an illustration of how the values in the BOLTZMANN structure interact to specify a Boltzmann network. Here as in other network models the layer structure is the gateway to the network specific data structures. All that is needed to gain access to the layer-specific data are pointers to the appropriate arrays. Thus the structure for the layer record is given by Figure Organization of the Boltzmann network using the