Sentence examples for terminal combination from inspiring English sources

Using input data from each of the terminals and the estimated coefficients from the modified SEM, we extrapolated exposures spatially across the entire cohort for the year 2000 and calculated a monthly exposure estimate for each job and terminal combination.

These estimates were adjusted for changes in work-related conditions over time based on a previous exposure assessment of this industry, and for changes in background levels based on a trend analysis of historical air pollution data, to derive monthly estimates of EC exposure for each job and trucking terminal combination between 1971 and 2000.

In brief, the job titles are categorized mainly as long-haul driver (driving between cities), pickup/delivery (P&D) driver (local driving within cities), dock worker (moving freight within the terminal), combination worker (workers who both work on the dock and drive P&D trucks), mechanic (repairing tractors and trailers), hostler (moving trucks in the terminal yard), and clerk (office worker).

We employed the following terms in our search: palliative care, end of life care, death and dying, care of the dying, and terminal care, in combination with the Boolean operator (AND) nursing education.

We developed and trialed several collar and platform terminal transmitter (PTT) combinations on both free-living and captive fruit bats (Family Pteropodidae: Genus Pteropus).

Then, the relay decodes the symbols received from both source terminals and broadcasts the combination of both symbols to both terminals in the third time slot.

For example, blind people need sound messages; the deaf, graphic messages and vibration of the terminal and, lastly, a combination of graphic and sound messages are used for the elderly.

The covariate for distance to the airport terminal may reflect a combination of parking lots, activities on nearby roadways, and aircraft and ground support activity proximate to the terminal, but our analyses could not separate out these contributions.

Context‐free languages are generated using rules with only one Left Hand Site (LHS) non‐terminal and any combination of terminal and non‐terminal symbols on the Right Hand Site (RHS): (3) N → (Σ ∪ N ) ∗, This formal definition of a non‐probabilistic context‐free grammar G=< Σ, N, P, S> restricts each rule from the set P to the following form: (4) A → α, where A∈ N and α∈(Σ∪ N ∗[ 97].

Our strategy was based on a two-step protocol that combines HDR triggered by TALENs with seamless removal of the selection cassette by an improved PB system [ePB terminal repeats used in combination with the hyperactive int transposase].

Alternatively, open your terminal with the key combination ^ Ctrl+⎇ Alt+T, then type ccsm and hit ↵ Enter.