Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of length to width of a flat knotted ribbon. This minimal ratio is called the ribbonlength of the knot. It has been conjectured that the ribbonlength has an upper bound and a lower bound which are both linear in the crossing number of the knot. In the first part of the paper, we use grid diagrams to construct flat knotted ribbons and prove an explicit quadratic upper bound on the ribbonlength for all non-trivial knots. We then improve the quadratic upper bound to a linear upper bound for all non-trivial torus knots and twist knots. Our approach of using grid diagrams to study flat knotted ribbons is novel and can likely be used to obtain a linear upper bound for more general families of knots. In the second part of the paper, we obtain a sharper linear upper bound on the ribbonlength for nontrivial twist knots by constructing a flat knotted ribbon via folding the ribbon over itself multiple times to shorten the length.

The Hamiltonian cycle problem is an important problem in graph theory and computer science. It is a special case of the famous traveling salesman problem. A signicant amount of research has been done on the special cases of nding Hamiltonian cycles in subgraphs of triangular, square and hexagonal grids. However, there is little work on more complicated grids. In this paper, we investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations, which are tessellations formed by two or more kinds of regular polygons. There are only eight semiregular tessellations, and we prove that the Hamiltonian cycle problem in all of them are NP-complete by reducing from NP-complete problems, such as the Hamiltonian cycle problem in max degree 3 bipartite planar graphs. Knowing the NP-completeness of Hamiltonian cycle problem in semiregular grids indicates that there will not be any polynomial time algorithm that solves the Hamiltonian path problem in these tessellations if NP does not equal to P, which helps show the limits of ecient motion planning algorithms and provides new information about what makes problems computationally dicult to solve.

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.

In this project we study the energy functional on the set of Lagrangian tori in CP2. The energy functional has been introduced in [2] as integral of the potential of 2D periodic Schrödinger operator associated to Lagrangian torus. It has been conjectured in [2] that the Clifford torus is the unique global minimum of energy functional (the statement is later referred to as the energy conjecture). Due to geometric interpretation of energy functional as linear combination of the volume andWillmore functionals, this conjecture can be seen as the CP2 analogue of the well-known Willmore conjecture for tori in R3, recently proved in [18]. The energy conjecture has been verified for two families of Hamiltonian-minimal Lagrangian tori in [2]. Results of [5] and [23] imply the conjecture for minimal Lagrangian tori of sufficiently high spectral genus and non-embedded minimal Lagrangian tori, respectively. In the present work we prove the energy conjecture for a family of Hamiltonian-minimal Lagrangian tori in CP2 constructed in [4]. In sharp distinction with cases considered in [2], the value of the energy functional for these tori can not be calculated exactly. The proof relies on analytic bounds for certain elliptic integrals arising from the induced metric of tori. Possible directions of further work are: 1. Consider local behaviour of the energy functional. Are the critical points of the energy functional governed by an integrable PDE, akin to Tzizeica equation describing minimal Lagrangian tori? The same questions for critical points under Hamiltonian variations. 2. Is there an analogue of the energy conjecture for other Kähler-Einstein surfaces? The case of K3 surface is of special interest as minimal Lagrangian tori in K3 can be related to elliptic fibrations (for instance [20]) making the conjecture amenable to algebrogeometric analysis. 3. Examples of monotone Lagrangian tori with trivial Floer cohomology were constructed in [21]. Do there exist critical points of the energy functional with trivial Floer cohomology?

In view of such problems as lacking interaction between figures and text and difficulty in simultaneous positioning of explanation with figures in chinese geometry exercise solution, a Win32 C++ voice lecturing tool integrated with HTML5 dynamic geometry software is designed to realize free control of lecturing progress, random skipping through double-click, simultaneous interaction and highlighting of figure and text, and automatic synchronized reading. On the basis of JavaScript regular expression, the semantic comprehension of geometry exercise text is realized and the production rule set of automatic plotting is designed. During voice synthesising line by line, the mathematic language undergoes normalization processing and figure highlighting information extraction. The study can shed some light on the GeoGebra integrated development and semantic comprehension-based automatic plotting application, and it can be applied to innovative geometry teaching and knowledge base structuring fields.