Every complementary set of a dependent siphon would be linearly expressed by the complementary sets of its elementary siphons, and the combined relation could be equated entirely with that between T-characteristic vector of dependent and its elementary siphons.

Circle matrix is the algebraic description of all the resource circles in a directed graph, and equivalence reciprocally to that one of complementary set and T-characteristic vector.

The concept of complementary matrix is proposed in this work, and it is proved that elementary siphons are a basis in the siphon space of complementary matrix.

With two transmit antennas, based on Cramer-Rao lower bound for channel estimation, it is shown that the Periodic Complementary Set (PCS) is optimal over frequency-selective fading channels.

TheN-particle Green's function is studied with the help of the Weinberg equation for many-body forces whose kernel is shown to be compact in the complementary set of [ΛN, + ∞[.

As in many epithelia, they are formed by an anastomosing network of ridges on the fracture PF face and by a complementary set of furrows on the fracture EF face of plasma membranes.

On the connectivity properties of the complementary set in fractal percolation models

We study the connectivity properties of the complementary set in Poisson multiscale percolation model and in Mandelbrot's percolation model in arbitrary dimension.

A bang-bang principle is established for any optimal controlk0, that is,k0 = 0 on a setA andk0 =N on the complement setS1?A.

Pattern Discovery would require tracking not only conditions for particular values, but also all of their complement sets.

An efficient method is introduced for discovering minimal functional dependencies from large database. It is based on the concept of agree sets. From agree sets, maximal sets and its complements are derived, and all minimal non-trivial functional dependencies can be generated. The computation of agree sets can be decreased by using stripped partition database. A levelwise algorithm is used for computing the left hand sides of minimal non-trivial functional dependencies. This method can be used to attribute reduction,...

An efficient method is introduced for discovering minimal functional dependencies from large database. It is based on the concept of agree sets. From agree sets, maximal sets and its complements are derived, and all minimal non-trivial functional dependencies can be generated. The computation of agree sets can be decreased by using stripped partition database. A levelwise algorithm is used for computing the left hand sides of minimal non-trivial functional dependencies. This method can be used to attribute reduction, clustering and mining associate rules, etc. in knowledge discovery as well as reorganization and design of databases.

In the article, the authors have deduced the equivalence express forms. They have designed the algorithm program that can calculate the significance of condition attribute subsets from the supplementary sets of decision-making algorithm positive sets. The authors have also designed the algorithm program that can calculate the support degree of condition attribute subsets from the decision-making algorithm positive sets. In the end, they have used them analyzing the factors of identified rock species in the geology....

In the article, the authors have deduced the equivalence express forms. They have designed the algorithm program that can calculate the significance of condition attribute subsets from the supplementary sets of decision-making algorithm positive sets. The authors have also designed the algorithm program that can calculate the support degree of condition attribute subsets from the decision-making algorithm positive sets. In the end, they have used them analyzing the factors of identified rock species in the geology. The result shows the algorithm program designed in the article is effective and feasible.

In this paper,basic concepts and basic bio-chemistry experiments of a model of closed circle DNA computing are brought forward.Closed circle DNA algorithm of the minimal covering problem is put forward.In the closed circle DNA algorithm,an idea that complementary sets of vertex covering are formed straightway by delete experiment is put forward and realized,which has design of the algorithm inimitable and novel.And then complementary sets of minimal covering are obtained by electrophoresis experiment.Minimal...

In this paper,basic concepts and basic bio-chemistry experiments of a model of closed circle DNA computing are brought forward.Closed circle DNA algorithm of the minimal covering problem is put forward.In the closed circle DNA algorithm,an idea that complementary sets of vertex covering are formed straightway by delete experiment is put forward and realized,which has design of the algorithm inimitable and novel.And then complementary sets of minimal covering are obtained by electrophoresis experiment.Minimal coverings can gained from the complementary sets.Only using basic bio-chemistry experiments in the algorithm,so realizing the algorithm is simple and credible.