Quadrature Formula for Sampled Functions

This paper deals with efficient quadrature formulas involving functions that are observed only at fixed sampling points. The approach that we develop is derived from efficient continuous quadrature formulas, such as Gauss-Legendre or Clenshaw-Curtis quadrature. We select nodes at sampling positions that are as close as possible to those of the associated classical quadrature and we update quadrature weights accordingly. We supply the theoretical quadrature error formula for this new approach. We show on examples the potential gain of this approach.

The Impact of Germination and In Vitro Digestion on the Formation of Angiotensin Converting Enzyme (ACE) Inhibitory Peptides from Lentil Proteins Compared to Whey Proteins

Biologically active peptides are of particular interest in food science and human nutrition because they have been shown to play several physiological roles. In vitro gastrointestinal digestion of lentil and whey proteins in this study produced high angiotensin-I converting enzyme inhibitory activity with 75.5±1.9 and 91.4±2.3% inhibition, respectively. High ACE inhibitory activity was observed in lentil after 5 days of germination (84.3±1.2%). Fractionation by reverse phase chromatography gave inhibitory activities as high as 86.3±2.0 for lentil, 94.8±1.8% for whey and 93.7±1.7% at 5th day of germination. Further purification by HPLC resulted in several inhibitory peptides with IC50 values ranging from 0.064 to 0.164 mg/ml. These results demonstrate that lentil proteins are a good source of peptides with ACE inhibitory activity that can be released by germination or gastrointestinal digestion. Despite the lower bioactivity in comparison with whey proteins, incorporation of lentil proteins in functional food formulations and natural drugs look promising.

Evaluating per-user Fairness of Goal-Oriented Parallel Computer Job Scheduling Policies

Fair share objective has been included into the goaloriented parallel computer job scheduling policy recently. However, the previous work only presented the overall scheduling performance. Thus, the per-user performance of the policy is still lacking. In this work, the details of per-user fair share performance under the Tradeoff-fs(Tx:avgX) policy will be further evaluated. A basic fair share priority backfill policy namely RelShare(1d) is also studied. The performance of all policies is collected using an event-driven simulator with three real job traces as input. The experimental results show that the high demand users are usually benefited under most policies because their jobs are large or they have a lot of jobs. In the large job case, one job executed may result in over-share during that period. In the other case, the jobs may be backfilled for performances. However, the users with a mixture of jobs may suffer because if the smaller jobs are executing the priority of the remaining jobs from the same user will be lower. Further analysis does not show any significant impact of users with a lot of jobs or users with a large runtime approximation error.