清代台湾嚼食槟榔习俗探析

台湾嚼食槟榔的文化习俗源于明清。清代大陆移民进入台湾,嚼食槟榔渐成时尚,种植槟榔以获利已成为农家经济的一部分。槟榔既是民间礼尚往来之信物,也是解决纠纷的中介物,成为台湾乡村文化生活不可或缺的组成部分。     

明嘉靖二十五年西宁卫长城考

本文以文献记载为线索,结合实地调查资料,论证了明代嘉靖二十五年修筑长城的起止点、走向、位置和构筑类型,同时指出了明代修筑此段长城的督修者为固安王继芳,纠正了《西宁志》记载的谬误.这对了解青海明代长城分布、修筑历史等提供了借鉴和参考.     

试论石柱县人口的发展变化

本文叙述了建国后石柱县各阶段人口发展的情形以及目前石柱县的人口生育模式等人口状况。研究分析表明,影响石柱县人口发展变化的主要因素是经济和政策因素;在不同时期,这两种因素所起的作用是不同的;而在现今的石柱县,政策因素对人口发展的影响占据着主导地位。     

Approximation strategy-proof mechanisms for obnoxious facility location on a line

In the facility location game on a line, there are some agents who have fixed locations on the line where an obnoxious facility will be placed. The objective is to maximize the social welfare, e.g., the sum of distances from the facility to all agents. On collecting location information, agents may misreport the locations so as to stay far away from the obnoxious facility. In this paper, strategy-proof mechanisms are designed and the approximation ratio is used to measure the performances of the strategy-proof mechanisms. Two objective functions, maximizing the sum of squares of distances (maxSOS) and maximizing the sum of distances (maxSum), have been considered. For maxSOS, a randomized 5/3-approximated strategy-proof mechanism is proposed, and the lower bound of the approximation ratio is proved to be at least 1.042. For maxSum, the lower bound of the approximation ratio of the randomized strategy-proof mechanism is proved to be 1.077. Moreover, a general model is considered that each agent may have multiple locations on the line. For the objective functions maxSum and maxSOS, both deterministic and randomized strategy-proof mechanisms are investigated, and the deterministic mechanisms are shown to be best possible.     

A simpler PTAS for connected <Emphasis Type="Italic">k</Emphasis>-path vertex cover in homogeneous wireless sensor network

Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount.     

Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

This paper studies the large-scale stochastic job shop scheduling problem with general number of similar jobs, where the processing times of the same step are independently drawn from a known probability distribution, and the objective is to minimize the makespan. For the stochastic problem, we introduce the fluid relaxation of its deterministic counterpart, and define a fluid schedule for the fluid relaxation. By tracking the fluid schedule, a policy is proposed for the stochastic job shop scheduling problem. The expected value of the gap between the solution produced by the policy and the optimal solution is proved to be O(1), which indicates the policy is asymptotically optimal in expectation.     

An $$O(|E(G)|^2)$$ algorithm for recognizing Pfaffian graphs of a type of bipartite graphs

A graph \(G=(V,E)\) with even number vertices is called Pfaffian if it has a Pfaffian orientation, namely it admits an orientation such that the number of edges of any M-alternating cycle which have the same direction as the traversal direction is odd for some perfect matching M of the graph G. In this paper, we obtain a necessary and sufficient condition of Pfaffian graphs in a type of bipartite graphs. Then, we design an \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs in this class and constructs a Pfaffian orientation if the graph is Pfaffian. The results improve and generalize some known results.     

A continuous characterization of the maximum vertex-weighted clique in hypergraphs

For a simple graph G on n vertices with adjacency matrix A, Motzkin and Strauss established a remarkable connection between the clique number and the global maximum value of the quadratic programm: \(\textit{max}\{ \mathbf {x}^T A \mathbf {x}\}\) on the standard simplex: \(\{\sum _{i=1}^{n} x_i =1, x_i \ge 0 \}\). In Gibbons et al. (Math Oper Res 122:754–768, 1997), an extension of the Motzkin–Straus formulation was provided for the vertex-weighted clique number of a graph. In this paper, we provide a continuous characterization of the maximum vertex-weighted clique problem for vertex-weighted uniform hypergraphs.     

试论社会治理背景下政府与市场关系的经济法规制

政府与市场的关系问题是经济法规制的基于问题,如何正确看待政府与市场在经济生态系统内各自的功能及作用,是经济法规制的核心问题。因为这样的认识直接导致了经济立法的体系构建与内容规则。经济法规制是国家实施经济治理与尊重市场调节的基本依据,也是施行经济法治与社会治理的根本前提。所以,从社会治理的背景下来讨论经济法规制的社会经济发展的制度条件及制度生成条件,有利于真正建立和完善经济法规制的体系和内容,从而使得经济法治生态化地融入社会治理的结构体系内,达到优化社会制度以促进经济发展的目的。     

信息技术背景下教育教学多维度创新体系研究

“互联网+”、3D打印技术为代表的信息化浪潮已经到来,创新创业教育的已经在全国展开,这既是高等教育教学的挑战,更是不可多得的机遇。为适应信息技术的需求,高等院校要未雨绸缪,及时应对,从创新体系构建信息技术要先行、教育教学创新体系构建要结合学科、专业特点进行、二级学院联动、对教师要求及激励等多个方面探讨信息技术背景下教育教学多维度创新体系。