We shall give a complete geometrical description of the FM partners of a K3 surface of Picard number 1 and its applications.

Checkpoint/restart is an important mechanism for system fault tolerance. It saves the state of an executing program periodically and recovers it after a failure. As many applications involve file operations, supporting file rollbacks is essential for checkpoint/restart. Complete backup can restore files to the correct state, but its cost is too high. In this paper we propose a behavior based file checkpointing strategy (BBFC), which provides a correct recovery of file data and ensures consistency between file state and other states of a process when a rollback is done by restarting the program from the last checkpoint. BBFC classifies details of the file operation behaviors and provides a guidance on what to be saved during file checkpointing according to those behaviors. It dramatically minimizes the overhead of file checkpointing due to the reduction of file data which need to be saved. And it is transparent and easy to use.

It is well known that semi-discrete high order discontinuous Galerkin (DG) methods satisfy cell entropy inequalities for the square entropy for both scalar conservation laws (\RefOne{Jiang and Shu (1994)} \cite{jiang1994cell}) and symmetric hyperbolic systems (\RefOne{Hou and Liu (2007)} \cite{hou2007solutions}), in any space dimension and for any triangulations. However, this property holds only for the square entropy and the integrations in the DG methods must be exact. It is significantly more difficult to design DG methods to satisfy entropy inequalities for a non-square convex entropy, and / or when the integration is approximated by a numerical quadrature. In this paper, we develop a unified framework for designing high order DG methods which will satisfy entropy inequalities for any given single convex entropy, through suitable numerical quadrature which is specific to this given entropy. Our framework applies from one-dimensional scalar cases all the way to multi-dimensional systems of conservation laws. For the one-dimensional case, our numerical quadrature is based on the methodology established in \RefOne{Carpenter et al (2014)} \cite{carpenter2014entropy} and \RefOne{Gassner (2013)} \cite{gassner2013skew}. The main ingredients are summation-by-parts (SBP) operators derived from Legendre Gauss-Lobatto quadrature, the \RefThree{entropy conservative flux} within elements, and the entropy stable flux at element interfaces. We then generalize the scheme to two-dimensional triangular meshes by constructing SBP operators on triangles based on a special quadrature rule. A local discontinuous Galerkin (LDG) type treatment is also incorporated to achieve the generalization to convection-diffusion equations. Extensive numerical experiments are performed to validate the accuracy and shock capturing efficacy of these entropy stable DG methods.

Let X and Y be locally compact Hausdorff spaces. We give a full description of disjointness preserving Fredholm linear operators T from C0(X) into C0(Y), and show that is continuous if either Y contains no isolated point or T has closed range. Our task is achieved by writing T as a weighted composition operator Tf = h f . Through the relative homeomorphism , the structure of the range space of T can be completely analyzed, and X and Y are homeomorphic after removing finite subsets.

Embedded cores are being increasingly used in the design of large system-on-a-chip (SoC). Because of the high complexity of SoC, the design verification is a challenge for system integrators. To reduce the verification complexity, the port-order fault (POF) model has been used for verifying core-based designs (Tang and Jou, 1998). In this paper, we present an automatic-verification pattern generation (AVPG) for SoC design verification based on the POF model and perform experiments on combinational and sequential benchmarks. Experimental results show that our AVPG can efficiently generate verification patterns with high POF coverage.