长江中游城市群人口-空间-产业城镇化的时空耦合特征分析

文章基于ArcGIS-GeoDa平台,利用2008-2013年长江中游城市群面板数据,从人口、空间和产业城镇化角度刻画新型城镇化发展,实证检验长江中游城市群人口-空间-产业城镇化的空间自相关性及系统之间的时空耦合特征.研究表明:长江中游城市群新型城镇化水平偏低,空间城镇化和产业城镇化存在空间溢出效应,人口-空间-产业城镇化之间的耦合协调程度不高,但是各市(县)两极分化较明显.     

渴求新知与崇尚传统——李叔同"学堂乐歌"创作的文化取向及其意义

李叔同的“学堂乐歌”创作是一种“别求新声”的现代追求;是一种不失传统的现代创新。他要借助西方的美学情调,推崇中国的精神内核。他的歌词创作未完成文学语言由古代韵文向现代白话的彻底转变,但从形式上打破了旧韵文的传统格局,而且创造性地运用了古代词牌长短句的特点,在形式上又发展了现代长短句歌词的新品种,并依照西洋乐曲形成了自己崭新的结构。他在用西方音乐形式与“本国语言”向人们诉说最深沉的感情的同时,也展示了“学堂乐歌”民族性与现代性相融合的特征。     

微课、MOOC及翻转课堂对高等医学教育影响的研究

作为近年来新兴的教学模式,微课、MOOC及翻转课堂对传统教学方法及模式带来挑战的同时,亦弥补了传统教学方法及模式的不足,并成为当今教育教学研究的热点。通过对微课、MOOC及翻转课堂的起源及发展进行追溯,进一步对当前高等医学教育中三种教学模式的使用现状进行深入探究,并在此基础上展望应用前景,旨在为今后在医学高等教育教学过程中使用更加合理的特色化、多元化教育教学模式及方法提供一定的借鉴。     

劳动教育融入高校《创业实践》课程的探索

当前,高校的创新创业教育已经步入了与劳动教育深度融合的新阶段。在这样的背景下,《创业实践》课程在打造精品劳动教育课程的过程中,以构建多元化劳动教育课程体系为目标,通过解决劳动教育知识点多样但缺乏系统性、劳动教育元素丰富但分散以及创业劳动体验效果好但考核方式单一这三个关键问题,探索和促进了劳动教育与创新创业类课程的有机融合。     

盈余重述归因分析——资产负债表膨胀的角度

针对国内外学者对财务重述原因的争议,在借鉴已有研究成果的基础上,本文从资产负债表膨胀的角度对盈余重述进行了归因分析。以高报盈余的重述公司为对象,利用多元回归分析等方法实证后发现,与非重述公司相比,高报盈余的重述公司在财务报告发生错误的年度资产负债表膨胀水平较高,说明公司被重述期正向调整了盈余,重述归因于公司之前年度有意的盈余管理;违规公司被重述期期初的资产负债表膨胀度显著高于非违规公司,证明公司违规主要是由于会计准则弹性范围内调整盈余的机会受限。     

债权治理与盈余质量:来自中国证券市场的经验证据

以2007-2008年非金融类上市公司为样本,研究了债权治理与盈余质量之间的关系,得到以下研究结论:资产负债率与盈余质量显著负相关,短期资产负债率与盈余质量显著负相关,长期资产负债率与盈余质量呈现出不显著的正相关关系。进一步研究后发现,短期债务融资是引发盈余质量恶化的主要原因,而长期债务融资虽然一定程度上改善了上市公司的盈余质量,但这种效果总的来说并不显著。此外,最终控制人的国有性质加剧了债务契约引发的盈余管理动机,恶化了盈余质量。     

Compact labelings for efficient first-order model-checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of such classes can be covered by graphs of bounded clique-width with limited overlaps. We also consider such labelings for bounded first-order formulas on graph classes of bounded expansion. Some of these results are extended to counting queries.     

On the number of separable partitions

Consider partitions of a given set A of n distinct points in general position in ℝ ^d into parts where each pair of parts can be separated by a hyperplane that contains a given set of points E. We consider the problem of counting and generating all such partitions (correcting a classic 1967 result of Harding about the number of such partitions into two parts). Applications of the result to partition problems are presented.     

On the distance paired domination of generalized Petersen graphs <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,1) and <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,2)

Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a k -distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a k-distance paired dominating set for graph G is the k -distance paired domination number, denoted by γ _p ^k (G). In this paper, we determine the exact k-distance paired domination number of generalized Petersen graphs P(n,1) and P(n,2) for all k≥1.     

Geometric rounding: a dependent randomized rounding scheme

We develop a new dependent randomized rounding method for approximation of a number of optimization problems with integral assignment constraints. The core of the method is a simple, intuitive, and computationally efficient geometric rounding that simultaneously rounds multiple points in a multi-dimensional simplex to its vertices. Using this method we obtain in a systematic way known as well as new results for the hub location, metric labeling, winner determination and consistent labeling problems. A comprehensive comparison to the dependent randomized rounding method developed by Kleinberg and Tardos (J. ACM 49(5):616–639, 2002) and its variants is also conducted. Overall, our geometric rounding provides a simple and effective alternative for rounding various integer optimization problems.