this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

We investigate the problem of maximizing sum submodular and supermodular functions under a fairness constraint. This function is non-submodular in general. For an offline model, we introduce two approximation algorithms: A greedy algorithm threshold algorithm. streaming propose one-pass also analyze ratios these algorithms, which all depend on total curvature function. The computable polynomial...

This study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by Persian-speaking L2 learners of English in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of UGin adult SLA. To do so, 92 participants were assigned into different levels of L2knowledge based on their performances on the Oxford Placeme...

We review Hildreth's algorithm for computing the least squares regression subject to inequality constraints and Dykstra's generalization. We provide a geometric proof of convergence and several ehancements to the algorithm and generalize the application of the algorithm from convex cones to convex sets.

We consider the Knapsack Covering problem subject to a matroid constraint. In this problem, we are given an universe U of n items where item i has attributes: a cost c(i) and a size s(i). We also have a demand D. We are also given a matroid M = (U, I) on the set U . A feasible solution S to the problem is one such that (i) the cumulative size of the items chosen is at least D, and (ii) the set ...