Abstract:
Based on analyzing the regional character of higher vocational graduates employment, this paper analyzes the reasons for this employment trend, advances relevant countermeasures for employment of higher vocational graduates, and explores the direction for higher vocational graduates employment.

Abstract:
Recently, there has been a hot discussion on project teaching theory among many higher vocational schools; however the practice of project teaching is still in the beginning period. Hence, many problems appear in project lead. This paper aims to analyze the existing problems in the practice of project teaching and also raise some resolutions.

Abstract:
This paper analyzes how exchange rate affects the direct investment by a multinational corporation model in which two factories of the identical corporation located in two different countries in the pursuit of the maximal profits. we set up hypotheses and give the derivation of the model through which we draw a conclusion: the real exchange rate has a negative influence on FDI by the wealth and cost effects. And we also find the experiment test is in support of the conclusion firmly. Key words: Exchange Rate; FDI

Abstract:
We give optimal effective bounds for some well-known theorems on complex algebraic surfaces, which are respectively due to Serre, Zariski (1962), Castelnuovo (1897), Artin (1962, 1966), Benveniste (1984), Cutkosky and Srinivas (1993). These theorems are about Riemann-Roch problem (on the behavior of the function dim |nD| of n), vanishing theorems, base-point freeness and k-very ampleness of the linear systems |nD| and |nA+L|, where D is effective, A is nef and big and L is arbitrary. As a consequence, we obtain an effective version of Matsusaka's big theorem, and we give also examples to show that our bound is the best possible one.

Abstract:
In this paper we are interested in the brush number of a graph - a concept introduced by McKeil and by Messinger, Nowakowski and Pralat. Our main aim in this paper is to determine the brush number of the two-dimensional torus. This answers a question of Bonato and Messinger. We also find the brush number of the cartesian product of a clique with a path, which is related to the Box Cleaning Conjecture of Bonato and Messinger.

Abstract:
The trace of a family of sets $\mathcal{A}$ on a set $X$ is $\mathcal{A}|_X=\{A\cap X:A\in \mathcal{A}\}$. If $\mathcal{A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace $\mathcal{A}|_X$ does not contain a maximal chain, then how large can $\mathcal{A}$ be? Patk\'os conjectured that, for $n$ sufficiently large, the size of $\mathcal{A}$ is at most $\binom{n-k+r-1}{r-1}$. Our aim in this paper is to prove this conjecture.

Abstract:
The purpose of this paper is to give a linear and effective height inequality for algebraic points on curves over functional fields. Our height inequality can be viewed as the logarithmic canonical class inequality of a punctured curve over a functional field (a fibered surface minus a section).

Abstract:
In this paper, we shall prove Beauville's conjecture: if $f:S \to P^1$ is a non-trivial semistable fibration of genus g>1, then $f$ admits at least 5 singular fibers. We have also constructed an example of genus 2 with 5 singular fibers. This paper will appear in the Journal of Algebraic Geometry.

Abstract:
In this part of the series, we shall investigate Deligne-Mumford semistable reductions from the point of view of numerical invariants. As an application, we obtain two numerical criterions for a base change to be stabilizing, and for a fibration to be isotrivial. We also obtain a canonical class inequality for any fibration. Some other applications are presented. Most of the results of this paper have arithmetical analogues. This paper will appear in Math. Z.

Abstract:
It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\binom{n}{3}$ directed triangles, and that the constant 1/4 is best possible. Motivated by some geometric considerations, our aim in this paper is to consider some `higher order' versions of this statement. For example, if we give each 3-set from an $n$-set a cyclic ordering, then what is the greatest number of `directed 4-sets' we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each $d$-set from an $n$-set.