Sentence examples for by adding a defined from inspiring English sources

A recovery assay was also performed by adding a defined amount of MDA before incubating with the oxidant mixture.

The salt-modified Pt catalysts were synthesized by adding a defined amount of salt in the form of an aqueous solution to the heterogeneous catalyst.

The suitability of Amicon Ultra 0.5 mL 30K centrifugal filters for the purification and concentration of ssDNA_ODN from eluates was tested by adding a defined ssDNA_ODN amount, namely, 10  μg, to water or 5 M urea solution.

We therefore decided to study the autoactivation process by adding a small defined amount of active trypsin to ensure comparability with published studies and congruent results.

Last week, in reporting fast-track authority to the floor, the Senate Finance Committee surprised many observers by adding a provision, 18-8, defining currency manipulation as a violation of the deal.

First, the HG-U133A RMA expression values were adjusted by adding a gene-wise constant defined as the difference between the mean of the test set samples and the mean of the training set samples, separately for each gene.

To express the relative improvement in UT1 UTC WRMS given by adding a third station, we define a WRMS ratio parameter begin{aligned} beta = frac{mathrm {WRMS}_{3,mathrm{stations}}}{mathrm {WRMS}_{2,mathrm{stations}}}, end{aligned} (1 where (mathrm {WRMS}_{2,mathrm{stations}}) is the reference UT1 UTC WRMS obtained using the standard two-station networks of INT1 and INT2 sessions.

Within EpiCollect+ this is achieved by adding a new form and defining a 'key' field that is used to link data in one level of the hierarchy to the level above and/or below.

The dynamical system is defined by adding a control feedback to the solution of the Hill Clohessy Wiltshire equations in order to track the desired velocities (as returned by the kinematic swarm model for equilibrium points).

In this paper the second-order unstable Fibonacci system is defined by adding a control input to the recursion relation that generates the Fibonacci numbers, and the characteristics of its Kalman state estimator and its control using both the LQR and deadbeat control approaches are investigated.

The logics \ \textsf{FO}(\texttt{TC})\) and \ \textsf{SO}(\texttt{TC})\) are similarly defined by adding a transitive closure operator \ \texttt{TC}_{\psi(\vec{x})}(\vec{x})\) which holds of a term \(\vec{t}\) just in case \(\vec{t}^{\mathcal{A}}\) is in the transitive closure of the relation denoted by \ \psi(\vec{x})\) in \(\mathcal{A}\).