(3) a. [to John leave] (building the embedded IP) b. [John1 [to John1 leave] (moving John to the Spec IP) c. [wants[John1 [to John1 leave]] (building the matrix VP) d. [John1 [wants[John1 [to John1 leave]]] (moving John to the Spec VP) e. [John1 [John1 wants[John1 [to John1 leave]]]] (building TP and moving John to its Spec) f. [John1 [John1 wants[John1 [to John1 leave]]]] (deleting all copies ...

Progressive collapse is defined as the spread of an initial failure from element to element, eventually resulting in the collapse of an entire structure or a disproportionately large part of it. The current progressive collapse analyses and design methods in guidelines and codes focus on the alternate load path method. This method is suitable especially in the case of blast-induced progressive ...

The penalty method is a method to generate alternative solutions for many discrete optimization problems. A penalty parameter easily allows to have influence on the difference between optimal and alternative solution. We experimentally test the penalty method for three optimization problems (shortest paths, assignments, travelling salesman) with parameters that change between planning phase and...

A new Monte Carlo technique has been developed for the direct sampling of flight paths in media with continuously varying cross-sections. This technique provides an alternative to the use of delta-tracking for problems where the material cross-sections vary over the particle flight paths. The technique is general, and may provide benefits to Monte Carlo calculations of charged particles, atmosp...

In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM to run-time paths to highlight repeating sequences of interest by using alternative support counting techniques. We show how the patterns identified, can be used to highlight design flaws in enterprise applications. ...

let  $r$ be a commutative noetherian ring and $i$ be an ideal of $r$. we say that $i$ satisfies the persistence property if  $mathrm{ass}_r(r/i^k)subseteq mathrm{ass}_r(r/i^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{ass}_r(r/i)$ denotes the set of associated prime ideals of $i$. in this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $r=k[x_1,ld...