 |
Algorithm describing the procedure for determining the values of ai :
1. begin
2. We consider at a breaking point
3. We successively browse the database containing the different pre-recorded nodes to find where is a.
4. If a > ai then g(a) < g(ai)
5. Considering a1 (the first node of known domain), if g(a) > g(a1) then
a1 < a else a > a1 endif
6. We are looking for i0 2 f1; :::ng such that if g(ai0+1) < g(a) < g(ai0)
then ai0+1 < a < ai0 endif
7. endif
8. end
Assuming beforehand that the corresponding u0(ai0) values for each node ai of the domain representing a cable telephone line have been evaluated, measured and recorded in a database, as indicated in the table below: |
IEEE/ICACT20220323 Slide.17
[Big Slide]