March 2013
Journal of Theoretical & Applied Information Technology;3/20/2013, Vol. 49 Issue 2, p618
Academic Journal
In this paper, we introduced the basic knowledge of set pair analysis at the first place. Then we defined the general form of basic operations and the properties of connection number, in the end we give the corresponding application examples. The concepts and methods of the operations are the basis points of this paper. The ccomposition operation that put forward in this article makes the results that we need more realistic and it more detailed and more reasonable when describe a problem.The operations also broaden the application scope of connection number and enrich the connection number theory of set pair analysis. The mathematical meaning is clear and the method is simple of this operation, it is easy to learn and use .This research also provides the computational basis for the next studies, it has a certain theoretical and practical significance.


Related Articles

  • Bilevel optimization: on the structure of the feasible set. Jongen, H.; Shikhman, V. // Mathematical Programming;Nov2012, Vol. 136 Issue 1, p65 

    We consider bilevel optimization from the optimistic point of view. Let the pair ( x, y) denote the variables. The main difficulty in studying such problems lies in the fact that the lower level contains a global constraint. In fact, a point ( x, y) is feasible if y solves a parametric...

  • On the computational problem related to the order of the co-prime sets of a natural number. Min, LI // Basic Sciences Journal of Textile Universities / Fangzhi Gaoxia;Dec2012, Vol. 25 Issue 4, p410 

    For any positive integer nlet a1 ,a2 ,a3 , ... ,ak be the divisors of n. All pairs of co-prime divisors are chosen to be a set, the set is called as a pairwise co-prime set D2(n). All three of divisors which are co-prime are chosen to be a se t, the set is called as a triplet co-prime set D3(n)....

  • A Novel Model of Set Pair Analysis Coupled with Extenics for Evaluation of Surrounding Rock Stability. Wang, Mingwu; Xu, Xinyu; Li, Jian; Jin, Juliang; Shen, Fengqiang // Mathematical Problems in Engineering;9/27/2015, p1 

    The evaluation of surrounding rock stability is a complex problem involving numerous uncertainty factors. Here, based on set pair analysis (SPA) coupled with extenics, a novel model, considering incompatibility, certainty, and uncertainty of evaluation indicators, was presented to analyze the...

  • Accuracy of Lipschitz Classifier Ensemble: Confidence Sets Approach. Timofeev, Andrey V. // AIP Conference Proceedings;2015, Vol. 1648 Issue 1, p1 

    This paper introduces an original method for guaranteed estimation of the accuracy for an ensemble of Lipschitz classifiers in a large number of classes. The solution was obtained as a finite closed set of alternative hypotheses, which contains an object of classification with probability of not...

  • Hyperimmunity and A-computable universal numberings. Issakhov, Assylbek // AIP Conference Proceedings;2016, Vol. 1759 Issue 1, p1 

    Whether there exists a computable universal numbering for a computable family is the key question in theory of numberings. In a very general setting, this problem was explored in [Yu. L. Ershov, Theory of Numberings, Handbook of Computability Theory, North-Holland; Amsterdam: Stud. Log. Found....

  • ON THE COMPLEXITY OF THE 3-KERNEL PROBLEM IN SOME CLASSES OF DIGRAPHS. HELL, PAVOL; HERNÁNDEZ-CRUZ, CÉSAR // Discussiones Mathematicae: Graph Theory;2014, Vol. 34 Issue 1, p167 

    Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is κ-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ κ; it is l-absorbent if for every u ∈ V (D) - N there exists v ∈ N such that d(u, v) ≤ l. A...

  • The Complexity of Computing Minimal Unidirectional Covering Sets. Baumeister, Dorothea; Brandt, Felix; Fischer, Felix; Hoffmann, Jan; Rothe, Jörg // Theory of Computing Systems;Oct2013, Vol. 53 Issue 3, p467 

    A common thread in the social sciences is to identify sets of alternatives that satisfy certain notions of stability according to some binary dominance relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Brandt and Fischer (in Math. Soc....

  • Exploring the New Zealand Puzzle. BRANDT, KEITH; NEVSKY, SERGE // Mathematical Spectrum;2015/2016, Vol. 48 Issue 1, p22 

    The New Zealand puzzle consists of 16 square pieces and a 4 × 4 grid. The puzzle pieces are to be placed on the grid one at a time according to some rules. The puzzle is computationally difficult, in that there are millions of ways to place the pieces on the board. We describe a computer...

  • On Finite Groups With Some Maximal H-Subgroups. Wang, L. L.; Wang, A. F.; Chen, G. Y. // Southeast Asian Bulletin of Mathematics;2014, Vol. 38 Issue 3, p451 

    A subgroup H of a finite group G is called an -subgroup of G if the following condition is satisfied: NG(H) ∩ Hg ≤ H,mbox for all g ∈ G. The set of all -subgroups of a group G will be denoted by (G). In this paper, some new results for a finite group to be supersolvable or...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics