Selection by sequential elimination based on concordant judgments

1975 ◽  
Vol 4 (1) ◽  
pp. 53-61
Author(s):  
H. T. David ◽  
S. H. Chien ◽  
C. A. Black
Keyword(s):  
Sequential Elimination

On Some Properties of Semi-rings

2018 ◽  
pp. 35-50
Author(s):  
A. I. Belousov
Keyword(s):  
Linear Equations ◽  
Oriented Graph ◽  
Theoretical Computer Science ◽  
Alternative Methods ◽  
Main Role ◽  
Cost Matrix ◽  
Sequential Elimination ◽  
The Matrix ◽  
Systems Of Linear Equations ◽  
The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

scholarly journals A sequential elimination algorithm for computing bounds on the clique number of a graph

2008 ◽  
Vol 5 (3) ◽  
pp. 615-628 ◽  
Author(s):  
Bernard Gendron ◽  
Alain Hertz ◽  
Patrick St-Louis
Keyword(s):  
Clique Number ◽  
Elimination Algorithm ◽  
Sequential Elimination

scholarly journals An Algorithm for Optimal Metering in State Estimation via Sequential Elimination

1987 ◽  
Vol 20 (6) ◽  
pp. 373-377
Author(s):  
Hai-tian Zhao ◽  
Yi-nan Quan ◽  
Zhao-yan Ma
Keyword(s):  
State Estimation ◽  
Sequential Elimination

Backward sequential elimination for sparse vector subset selection

2001 ◽  
Vol 81 (9) ◽  
pp. 1849-1864 ◽  
Author(s):  
S.F. Cotter ◽  
K. Kreutz-Delgado ◽  
B.D. Rao
Keyword(s):  
Subset Selection ◽  
Sequential Elimination ◽  
Sparse Vector
Sign in / Sign up

Export Citation Format

Share Document