Sentence examples for could optimally be from inspiring English sources

To expedite a semantic product design environment, the relevant minimal set of design rules could optimally be distilled from the given disparate design rules.

Relationship between the number of stages, effective heat exchanger area and operating pressure levels of expanders, which could optimally be employed for least specific power consumption has been established through exergy analysis.

"If I compare what their profits are when a record company charges a retailer 60 cents a song, I find that [the current] overall profits for the entire channel, which is the label and the retailer, are almost 50% lower than what they could optimally be when the record label charges lower wholesale prices".

These markers could then be prospectively defined and tested for validity in phase 3 clinical trials, potentially defining which individuals could optimally be prescribed the drug.

Topics included how the AFLY5 intervention could have been improved and how school-based diet and PA interventions should optimally be delivered.

Coronary segments distal to a total occlusion could not be optimally visualised by ICA and thus were excluded from the analyses.

Lastly, due to our sample size and the large number of potential subject characteristics and/or procedural characteristics associated with higher levels of discomfort, these potential associations could not be optimally tested.

It is concluded that cactus pear could optimally substitute pasture hay up to 60%.

These data might imply that the immune profile of the breast tumor in sequentially endocrine-treated breast cancer patients could predict BC death and overall death in HR+ve breast disease, and thus additional adjuvant therapy, such as chemotherapy and radiotherapy, could be optimally allocated based on this prognostic indicator.

SiO2 SiO2, ZrO2 SiO2, or Al2O3 SiO2 bimodal pore support could be optimally prepared by incipient-wetness impregnation (IWI) of silica Q-50 pellet with silica, zirconia or alumina sol, respectively.

The maximum matching problem for bipartite graphs could be optimally solved using well-known polynomial-time algorithms such as the Edmonds Karp algorithm [22].