The liquefaction resistance of soil can be evaluated using laboratory tests such as cyclic simple shear, cyclic triaxial, cyclic torsional shear as well as field methods like Standard Penetration Test (SPT), Cone Penetration Test (CPT) and Shear Wave Velocity (Vs). In this regard, this study attempts to compare the results of the SPT based on the simplified procedure proposed by Seed and Idriss...

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...

In this paper total cross sections for signals and backgrounds of top-and Higgs-production channels in e + e − collisions at a future linear collider are presented. All channels considered are characterized by the emergence of six-particle final states. The calculation takes into account the full set of tree-level amplitudes in each process. Two multipurpose parton level generators, HELAC/PHEGA...

The universal design is the best way for today’s design of public facilities. It develops from the non-barrier design and turns to be perfect. Starting from concluding the differences of non-barrier design and universal design in practice, this paper analyzes and describes the process of from non-barrier design to universal design, aiming at form a complete, systematic, and correct recognition ...

By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. These include problems with chordal microstructure; problems with chordal microstructure complement; problems with tree structure; and the “all-different” constraint. In each of these cases we show that the associated mic...

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by C...

We developed minimal perfect hash functions for a variety of datasets using the probabilistic process of simulated annealing (SA). The SA solution structure is a tree representing an annealed program (algorithm). This solution structure is similar to the structure used in genetic programming. When executed, the SA program produces multiple hash functions for the given data set. An initial hash ...

Our proof (with Robertson and Thomas) of the strong perfect graph conjecture ran to 179 pages of dense matter; and the most impenetrable part was the final 55 pages, on what we called “wheel systems”. In this paper we give a replacement for those 55 pages, much easier and shorter, using “even pairs”. This is based on an approach of Maffray and Trotignon.