With the aim of helping to improve the teaching of entrepreneurship in high schools, this study set out to identify appropriate teaching strategies. A selective group of 22 experts in the area of teaching entrepreneurship was extensively interviewed. The interviews were   semi-structured and the data collected from them were coded using an open, axial, and selective coding system. Results show ...

The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex non-commutative basic open semi-algebraic set (defined below). The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and systems engineering. A non-commutative basic open semi-algebraic set is defined in terms of a non-commutative `×`-matrix polynomial p(x1 · · ...

We introduce a natural topology on the space of left orderings of an arbitrary semi-group G. We prove that this space is always compact and that for free abelian groups it is homeomorphic to the Cantor set. We use our topological approach to provide a simple proof of the existence of universal Gröbner bases. 1. Orderings for semi-groups Given a semi-group G (ie. a set with an associative binary...

We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipped independently with a probability of ε > 0. Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly O( √ nε), which beats the inapproximability bounds.

Semi-linear sets, which are finitely generated subsets of the monoid (Z,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas in Presburger arithmetic or by other means, the effect of Boolean operations on semi-linear sets in terms of the size of generators has primarily been studied for explicit representations. In t...