In this paper, shear localization due to strain softening in sidepressed cylinders, is inverstigated. Shear localization causes formation of macroscopic shear bands which can be obsserved in the metallographic cross-section. In this paper, for the first time a method is presented in which a simple two-slice model is used to study the formation of shear bands. The results obtained form this mode...

In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explanation is based on stable set polytope formulations for perfect graphs. keywords: Integer programming, stable set polytope, satellite mission planning, cocomparability graph.

The Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conjectures in graph theory. During more than four decades, numerous attempts were made to solve it, by combinatorial methods, by linear algebraic methods, or by polyhedral methods. The rst of these three approaches yielded the rst (and to date only) proof of the SPGC; the other two remain promising to consider...

The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs....

The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal o...

The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in nding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. W...

This paper proposes a method for evaluating grammatical error detection methods to maximize the learning effect obtained by grammatical error detection. To achieve this, this paper sets out the following two hypotheses — imperfect, rather than perfect, error detection maximizes learning effect; and precisionoriented error detection is better than a recall-oriented one in terms of learning effec...

This article pursues two tasks. The first is to clarify the value and productivity of Williams’s Keywords: a vocabulary culture society (first edition 1976, second expanded 1983a) for project Cultural Studies. clarification helped, I argue, by reading it alongside Vološinov’s Marxism philosophy language (published in Russian 1929, translated into English 1973). related task speculative developm...

We obtain the characterization of saturation class and approximation spaces for perfect spline approximation. Also, a generalized perfect spline approximation is investigated.