Description: 用BP网络实现布尔运算的功能,输入的两个变量可以有一定的范围,表明BP网络具有一定的纠错能力.-BP networks with the Boolean function, enter the two variables can have a certain range, indicating that BP network has a certain error-correcting capacity. Platform: |
Size: 61440 |
Author:薛峰 |
Hits:
Description: Separated Simplification Method
• One has to derive the symmetrical logical equation while using the Karnaugh
maps of the logic function
• This method, i.e. to perform twice the Boolean simplification for each N-ch
and P-ch networks, is called « separated simplification » method, as:
• one has to consider in a first step the blocks of ‘0’ in the Karnaugh map
to generate the N-ch network
• and in a second step the blokcs of ‘1’ of the Karnaugh maps to generate
the P-ch network-Separated Simplification Method
• One has to derive the symmetrical logical equation while using the Karnaugh
maps of the logic function
• This method, i.e. to perform twice the Boolean simplification for each N-ch
and P-ch networks, is called « separated simplification » method, as:
• one has to consider in a first step the blocks of ‘0’ in the Karnaugh map
to generate the N-ch network
• and in a second step the blokcs of ‘1’ of the Karnaugh maps to generate
the P-ch network Platform: |
Size: 337920 |
Author:phitoan |
Hits:
Description: A method is proposed for solving the two key problems facing quantum neural networks: introduction of
nonlinearity in the neuron operation and efficient use of quantum superposition in the learning algorithm.
The former is indirectly solved by using suitable Boolean functions. The latter is based on the use of
a suitable nonlinear quantum circuit. Platform: |
Size: 134144 |
Author:feiminyu |
Hits:
Description: A Book Analysis and Control of Boolean Networks:A Semi-tensor Product Approach - Analysis and Control of Boolean Networks presents a systematic new approach to the investigation of Boolean control networks. The fundamental tool in this approach is a novel matrix product called the semi-tensor product (STP). Using the STP, a logical function can be expressed as a conventional discrete-time linear system. In the light of this linear expression, certain major issues concerning Boolean network topology- fixed points, cycles, transient times and basins of attractors- can be easily revealed by a set of formulae. This framework renders the state-space approach to dynamic coCheng, Daizhan Qi, Hongsheng Li, Zhiqiang Platform: |
Size: 2009088 |
Author:贝克汉公 |
Hits:
Search - boolean networks