In this paper, we present a new measuring method of computing the transitive trustworthy degree between two different nodes. In this measuring method, the transitive trust degree of u and v along a path is measured in...
详细信息
ISBN:
(纸本)9781424453313
In this paper, we present a new measuring method of computing the transitive trustworthy degree between two different nodes. In this measuring method, the transitive trust degree of u and v along a path is measured in terms of the minimum weight of all edges on the path. For parallel paths between u and v, the transitive trust degree is defined as the maximum among the transitive degrees of all these paths. We prove that the measuring method can be done in polynomial time.
The causes of deficiency of the max-min approach to feature selection are investigated. It is shown that the theoretical premise providing the basis for the max-min algorithm is not necessarily valid. A condition unde...
详细信息
The causes of deficiency of the max-min approach to feature selection are investigated. It is shown that the theoretical premise providing the basis for the max-min algorithm is not necessarily valid. A condition under which the max-min algorithm is not justified is derived, and a counterexample illustrating it is presented.
The positioning control system should carry out the follow-ing objectives, which are that the controlled machine must have the ability to accurately stall at high speed and possess no overshoot transient processes. Th...
详细信息
The positioning control system should carry out the follow-ing objectives, which are that the controlled machine must have the ability to accurately stall at high speed and possess no overshoot transient processes. These requirements are in conflict with one another in some cases. The solution of the max-min performance index problem, in which both weighting matrices Q and control parameter U are used to the system activity, can achieve the above objectives. Simulation experiments illustrate the validity of the method.
The theory for optimally assigning capacities to the links of a store forward computer communication network is developed by the minimization of the maximum of two groupings of all link capacities previously assigned ...
详细信息
The theory for optimally assigning capacities to the links of a store forward computer communication network is developed by the minimization of the maximum of two groupings of all link capacities previously assigned to the network. The min-max and max-min algorithms developed have both local and global properties. The basic mathematical structure of the local section of the min-maxalgorithm is derived from the Lagrange Multiplier technique for minimizing convex functions, or the Kuhn-Tucker method for constrained minimization solutions, and the constraints imposed by the functional structure definitions. Since the min-maxalgorithm attains the optimal minimized delay assignment by minimization of the min-max assignment, the aspects of its relation to the max-min algorithms, the min-max inequality and the of both algorithms offers an option for considering all possible, allowed link assignment combinations (2 n - 2) of the n capacities available to further minimize delay.
暂无评论