Study on the grammaticalization of the prepositions‘Zi’and‘Cong’and its integration with TCSL

汉语是分析性语言，语法手段主要依靠语序和虚词。作为虚词重要一员的介词，大部分由动词语法化而来。本文基于语法化理论，采用对比分析、共时与历时、定量和定性分析相结合的研究方法，选取时处介词“从”、“自”作为研究对象，从以下几个部分进行探讨研究： 第一章为绪论，包括选题缘由、研究意义、研究对象和内容、研究方法和语料来源以及相关研究综述。 第二章和第三章基于汉语本体视角进行研究。第二章为介词“从”、“自”共时差异分析，分别从句法、语义、语用情况进行对比考察；第三章从历时层面研究“从”、“自”的语法化过程，同时讨论两者在此过程中产生的特殊现象；然后借鉴认知语言学、语用学、语言类型学和结构主义语言学的...Chinese is an analytical language and the grammatical means mainly rely on the word order and grammar function words. As a key member of function words, most of the prepositions come from grammaticalization of verbs. Based on the theory of grammaticalization, the combined method of comparison and analysis, synchrony and diachrony as well as quantitative and qualitative is used to study the preposi...学位：文学硕士院系专业：海外教育学院_语言学及应用语言学学号：2652012115127

语法化理论研究综述

语法化最初是历史语言学的一个分支,后经过一个世纪的发展和完善,实现了历史考察和共时分析的结合,突破了之前纯粹单一的历时研究视角。语法化研究领域主要涉及语法化概念的界定、语法化研究范围、语法化的动因和机制

短期华文教学模式与菲律宾华裔青少年中华文化培养——以菲律宾“中华文化大乐园”为分析对象

短期华文教学模式是基于汉语独特的语言特点和教学理念,以海外华人为教学对象,结合第二语言教学的一般性理论和对外汉语教学理论,在汉语教学过程中形成的教学范式。它具有短时性、强化性和速成性的特点。菲律宾“中华文化大乐园“是一种比较成功且具有特色的短期华文教学模式案例。它将汉语学习与中华文化培养相结合,充分重视项目参与者的华裔身份,从菲律宾华裔青少年文化认同感、语言背景、学习动机等特点出发,在课程设置、教材编写、课堂教学和教学检测等方面都融入了文化因素。项目寓教于乐,灵活多变,针对性强,进一步丰富了现有的汉语短期教学模式

Some New Results on Matching Extension Theory

匹配理论是图论中一个重要的基础分支，它不仅对认识图的结构有重要作用，而且也广泛的应用到组合优化，理论化学等研究领域。匹配可扩理论是匹配理论中热门的研究方向，已产生了许多有价值的结论，特别是引入了k-可扩图、n-因子临界图、(n,k,d)-图、k-圈共振图等一系列图类，这些概念的引入对进一步揭示图的结构有重要的贡献。本文主要研究了1-可扩图中可去耳朵数的下界，图的分数匹配可扩性，奇图（阶为奇数）的匹配可扩性以及如何用最少的完美匹配覆盖图中所有边等问题。设G是一个图。如果删除G中任意n个点后所得的余图有k-匹配，并且任意的k-匹配都可以扩充为该余图的一个亏d-匹配，那么称G是一个(n,k,d)-图...Matching theory is an important and elementary branch of Graph Theory. It not only benefits to understand the structure of graphs but also has widely applications in combinatorial optimization and theoretical chemistry. Matching Extension Theory is a popular subject in matching theory. Many valuable results have been obtained. In particular, some new concepts and new classes of graphs were introdu...学位：理学博士院系专业：数学科学学院数学与应用数学系_应用数学学号：B20042301

Some Results of Fractional n-extendable Graphs

如果图G中有n-匹配并且对任意一个n-匹配M,G中都有一个分数完美匹配f使得对于任意e∈M,f(e)=1成立,那么G被称为是分数n-可扩图.马英红等首先引出此概念,并给出分数n-可扩图和极大分数n-可扩图的刻画.本文分别刻画了分数n-可扩二部图和极小分数n-可扩图,研究了k-因子临界图和分数n-可扩图之间的关系并利用图的bind-ing数和最小度给出了分数n-可扩图的两个充分条件.A graph G is called fractional n-extendable if G has a n-matching and each n-matching M of G can be extended to a fractional perfect matching M of G such that f(e)=1 for all e∈M.Ma and Liu firstly introduced the concept and characterized fractional n-extendable graphs and maximally fractional n-extendable graphs.In this paper,the author characterizes fractional n-extendable bipartite graphs and minimally fractional n-extendable graphs,and studies the relation between fractional n-extendablegraphs and k-factor-critical graphs.In addition,the author gives two sufficient conditions of fractional n-extendable graphs in term of binding number and minimum degree respectively.国家自然科学基金(10331020)资

Extending Matchings in Odd Graphs

设g是一个图,n,k和d是三个非负整数,满足n+2k+d≤|V(g)|-2,|V(g)|和n+d有相同的奇偶性.如果删去g中任意n个点后所得的图有k-匹配,并且任一k-匹配都可以扩充为一个亏d-匹配,那么称g是一个(n,k,d)-图.lIu和yu首先引入了(n,k,d)-图的概念,并且给出了(n,k,d)-图的一个刻划和若干性质.(0,k,1)-图也称为几乎k-可扩图.在本文中,作者改进了(n,k,d)-图的刻划,并给出了几乎k-可扩图和几乎k-可扩二部图的刻划,进而研究了几乎k-可扩图与n-因子临界图之间的关系.Let G be a graph,and let n,k and d be three nonnegative integers such that n+2k+ d≤|V(G) |-2 and,|V(G) | and n + d have the same parity.If after deleting any n vertices from G the remaining subgraph of G contains an k-matching and each k-matching of the subgraph can be extended to a defect-d-matching of the subgraph,then G is called an(n,k,d)-graph.Liu and Yu--([1]) first introduced(n,k,d)-graphs,and gave some properties and characterization of(n,k,d)-graphs.A(0,k,1)-graph may be also called a near k-extendable graph.In the present paper,the authors improve the characterization of(n,k,d)-graphs,and consequently obtain a characterization of near k-extendable graphs.Furthermore,a characterization of near k-extendable bipartite graphs and the relations between near k-extendable graphs and n-factor critical graphs are investigated.国家自然科学基金(10831001);福建省教育厅科技项目(JA08223)资

Some results of minimun sets of 1-factors covering a graph

The project supported by NSFC(10331020

Some Results of Minimum Sets of 1-Factors Covering a Graph

假设G是一个1-可扩图.G的1-因子覆盖是G的某些1-因子的集合M使得U_(M∈M)M=E(G).1-因子数目最小的1-因子覆盖称为excessive factorization.一个excessive factorization中的1-因子数目称为图G的excessive index,记为X_e~′(G).本文我们基于G的耳朵分解和E(G)的依赖关系给出了X_e~′(G)的上界.对任意正整数k≥3,我们构造出一个图G使得△(G)=3而X_e~′(G)=k.进而,我们考虑了乘积图的excessive index.Let G be a 1-extendable graph.A 1-factor cover of G is a set M of t-factors of G such that∪_(MεM)M= E(G).A 1-factor cover of minimum cardinality is called an excessive factorization.The excessive index of G.denote X_e′(G),is the size of an excessive factorization of G.In the present paper,we obtain a tight upper bound of X_e′(G)based on dependence relation on E(G)and ear decomposition of G.For any positive integer k≥3,we construct a graph G with△(G)=3 and X_e′G)=-k.In addition,we also consider the excessive index of the Cartesian product of two graphs.The project supported by NSFC(10331020);; the Scientific Research Foundation of Xiamen University of Technology(YKJ07011R

The Window of the City in the Opening Times:A Review of the Design of Guiyang Longdongbao International Airport Terminal 2

2014年6月7—8日,由新建筑杂志社、当代中国建筑创作论坛学术委员会、贵州省建筑设计研究院、中国民航机场建设集团公司联合举办的“贵阳·新建筑论坛“在贵阳市铂尔曼酒店举行。7日上午,在设计方的带领下与会嘉宾参观了论坛品评对象——贵阳龙洞堡国际机场T2航站楼,下午围绕论坛主题“开放时代的城市窗口“展开品谈。会上围绕航站楼建筑设计创作中的理念、技术以及整体环境的空间和景观体验等方面问题进行了深入探讨,总结了T2航站楼在设计建造过程中的问题,对其建筑设计创作水平给予了较高评价