Requesting an algorithm that operates as follows:
(1) Several tracks are discovered by the program, based on silence detection.
(2) The "seek time" of all the tracks is determined. Here is an example of how to determine the seek time of 3 tracks:
6 min: 67% probability x 6 = 4.02
2 min: 22% probability x 2 = .44
1 min: 11% probability x 1 = .11
----
Seek time 4.57 min
The probability is determined by dividing the track length by the total file length
(e.g. 6 min / 9 min = 67%).
(3) The two adjacent tracks with the minimum combined time are then tentatively combined:
6 min: 67% probability x 6 = 4.02
3 min: 33% probability x 3 = .99
----
Seek time 5.01 min
(4) This new seek time will be greater than the previous seek time. If the new seek time is less than a user defined maximum, continue this process at (2), otherwise reject the tentative combination, terminate this process, and output the tracks.
It would be a failure mode if the initial seek time is greater than the user defined maximum, and no tracks would be output.
DavidLNewton@comcast.net
