It is studied systematically for the level strcture of the kernel and hull on continuous-lattice- calued function.In terms of these results,the level characterixations of induced space are odtained.
The existence of some lattices and the lattice having the smallest set of generating elements are important in lattice theory. In this paper by means of the relations of the intrinsic topologies and admissible topolo...The existence of some lattices and the lattice having the smallest set of generating elements are important in lattice theory. In this paper by means of the relations of the intrinsic topologies and admissible topology of a lattice,we prove there not exists the in flute complete and completely distributive lattice which has finite dimension.A complete boolean lattice B possesses the smallest set of generating elements iff B is completely distributive.展开更多
In this paper, we discuss completely positive definite maps over topological algebras. A Schwarz type inequality for n-positive definite maps, and the Stinespring representation theorem for completely positive definit...In this paper, we discuss completely positive definite maps over topological algebras. A Schwarz type inequality for n-positive definite maps, and the Stinespring representation theorem for completely positive definite maps over topological algebras are given.展开更多
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.展开更多
文摘It is studied systematically for the level strcture of the kernel and hull on continuous-lattice- calued function.In terms of these results,the level characterixations of induced space are odtained.
文摘The existence of some lattices and the lattice having the smallest set of generating elements are important in lattice theory. In this paper by means of the relations of the intrinsic topologies and admissible topology of a lattice,we prove there not exists the in flute complete and completely distributive lattice which has finite dimension.A complete boolean lattice B possesses the smallest set of generating elements iff B is completely distributive.
文摘In this paper, we discuss completely positive definite maps over topological algebras. A Schwarz type inequality for n-positive definite maps, and the Stinespring representation theorem for completely positive definite maps over topological algebras are given.
文摘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.
