In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity prop...In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.展开更多
The totally coded method (TCM) reveal the same law which governing the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure ...The totally coded method (TCM) reveal the same law which governing the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficiency because any figure searching is no longer necessary. The code-series (CS), which are organized from node association table, have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is obvious and it is suited for computer programming. The capability of the computer-aided analysis for the active network, such as operation amplifier network, can be enhanced.展开更多
The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Base...The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficient because figure searching is no longer necessary. The code-series ( CS ), which are organized from node association table, have the holoinformation nature, so that both the content and the sign of each gain-term can be determined via the coded method.The principle of this method is obvious and it is suited for computer programming. The capability of the computeraided analysis for Switched Capacitor (SCN) can be enhanced.展开更多
DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve ...DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.展开更多
文摘In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.
文摘The totally coded method (TCM) reveal the same law which governing the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficiency because any figure searching is no longer necessary. The code-series (CS), which are organized from node association table, have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is obvious and it is suited for computer programming. The capability of the computer-aided analysis for the active network, such as operation amplifier network, can be enhanced.
文摘The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficient because figure searching is no longer necessary. The code-series ( CS ), which are organized from node association table, have the holoinformation nature, so that both the content and the sign of each gain-term can be determined via the coded method.The principle of this method is obvious and it is suited for computer programming. The capability of the computeraided analysis for Switched Capacitor (SCN) can be enhanced.
基金Supported by the CNSF(60274026 60174047+1 种基金 30370356) Supported by the Anhui Provinc'e Educational Committee Foundation(2003Kj098)
文摘DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
