Sentence examples for decrement until from inspiring English sources

Within both cohorts, patients exhibited a decrease in OS starting at about 4.0 mg per day, with progressive decrement until a dosage of 8.0 mg per day, above which there was no further decrease in OS.

The estimated amount of pressure decrement until the termination of lava extrusion is 3×107 Pa.

We first define an arbitrary value in the 16-bit register; however, when the program is waiting for the user to press "new game" to start a new game, inside the wait loop, the value in the 16-bit register keeps decrementing until the player pushes the button.

The S1-S2 interval was decremented until capture was lost.

Station Y waits a further DIFS period before decrementing the backoff counter to 4. Subsequently, the backoff counter is decremented until it reaches zero and station Y transmits.

This class can be further divided into forward counters (Figure2a and backward counters (Figure2b, depending on whether the counter is incremented or decremented until being reset to a predefined value; Random walk sub-chains (see, Figure2c): the value of the descriptor variable is subject to random, but constrained, increments and decrements.

This class can be further divided into forward counters (Figure2a and backward counters (Figure2b, depending on whether the counter is incremented or decremented until being reset to a predefined value; Figure 2 Sub-chains. (a) Counter-like sub-chain, forward counter.

Then, IBP measurements were performed with 25 ml increments up to 300 ml and with 25 ml decrements until baseline.

The initial Primer3 amplicon design is as close to the optimum parameters as possible, for each subsequent design the optimum parameters are relaxed in decrements until the set number of primer pairs has been reached.

After identifying k start (minimum k whose optimal cost o is equal to the optimal cost obtained for unbounded k), we decremented k until k A (maximum k which generates acyclic solutions) is found.

We can determine k A as follows: for every optimal reconciliation in S, we keep track of the longest distance observed for a switch and denote by k start the smallest value observed among all optimal solutions; then starting from k start, we decrement this value until at least one time-feasible solution is found.