We show that a compact operator A is a multiple of a positive semi-definite operator if and only if (A B) W (A) W (B), for all (rank one) operators B. An example of a normal operator is given to show that the equivalence conditions may fail in general. We then obtain conditions to identify other classes of operators A so that equivalence conditions hold.

In this paper, we consider a class of penalized NCP-functions, which includes several existing well-known NCP-functions as special cases. The merit function induced by this class of NCP-functions is shown to have bounded level sets and provide error bounds under mild conditions. A derivative free algorithm is also proposed, its global convergence is proved and numerical performance compared with those based on some existing NCP-functions is reported.

We propose an approach to find constant curvature metrics on triangulated closed 3-manifolds using a finite dimensional variational method whose energy function is the volume. The concept of an angle structure on a tetrahedron and on a triangulated closed 3-manifold is introduced following the work of Casson, Murakami and Rivin. It is proved by A. Kitaev and the author that any closed 3-manifold has a triangulation supporting an angle structure. The moduli space of all angle structures on a triangulated 3-manifold is a bounded open convex polytope in a Euclidean space. The volume of an angle structure is defined. Both the angle structure and the volume are natural generalizations of tetrahedra in the constant sectional curvature spaces and their volume. It is shown that the volume functional can be extended continuously to the compact closure of the moduli space. In particular, the maximum point of the

The SMS4 block cipher is part of the Chinese WAPI wireless standard. This paper describes the specification and offers a specification for a toy version called simplified SMS4 (S-SMS4). We explore algebraic attacks on SMS4 and S-SMS4 using Gröbner basis attacks on equation systems over GF(2) and GF(2^8), as well as attacks using a SAT solver derived from the GF(2) model. A comparison of SAT and Gröbner basis attacks is provided.

A Tamed Transformation Method (TTM) cryptosystem was proposed by T.T.Moh in 1999. We describe how the first implementation scheme of the TTM system can be defeated. The computational complexity of our attack is 2^{33} computations on the finite field with 2^8 elements.