Let C and Q be nonempty closed convex sets in RN and RM , respectively, and A an M by N real matrix. The split feasibility problem (SFP) is to find x ∈ C with Ax ∈ Q, if such x exist. An iterative method for solving the SFP, called the CQ algorithm, has the following iterative step: x = PC(x + γ A (PQ − I )Ax), where γ ∈ (0, 2/L) with L the largest eigenvalue of the matrix AT A and PC and PQ de...

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...

Jet finding algorithms, as they are used in ee and hadron collisions, are reviewed and compared. It is suggested that a successive combination style algorithm, similar to that used in ee physics, might be useful also in hadron collisions, where cone style algorithms have been used previously. 12.38.Bx, 13.87.-a Typeset using REVTEX

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

Unlike Lexical Projections, Functional Projections (Extended Projections) are more of an ‘abstract’ in nature. Therefore, Functional Projections seem to be acquired later than Lexical Projections by the L2 learners. The present study investigates Iranian L2 learners’ acquisition of English Extended Projections taking into account their level of grammatical proficiency. Specifically, the aim is ...