要素匹配与中国投资效率空间差异性——基于双层嵌套型函数的分解研究

本文基于四要素双层嵌套的生产函数，利用1990-2016年全国层面及省际层面数据测算投资效率，并分析其空间结构特征及演变轨迹，检验投资效率匹配效应影响因素。研究发现：①1990-2016年我国整体投资效率呈下降趋势，资本-技能劳动匹配效应与整体投资效率走势趋同，快速累积的资本存量和不断升级的资本质量与短缺的技能劳动之间矛盾突出。②东中西部地区投资效率增长非一致性明显。东部地区资本相对投资效率明显高于中西部，但下降幅度大于中西部，中西部与东部地区之间差距缩小，其中匹配效应是区域间投资效率非平衡的主要成因。③若产业结构升级的技能劳动需求不能满足，将引发要素错配，不利于有效投资。房价与工资提升分别通过影响技能劳动供给和需求抑制要素匹配效率；教育和公路设施会对地区要素匹配产生积极影响，改善地区间投资效率非均衡性；地区投资效率存在显著正向空间相关性，毗邻地区的要素流动和经济发展相近地区的技术溢出均对投资效率产生积极的影响。     

清代中缅划界的法律之误

中英1894年签订《续议滇缅界、商务条款》,条约前5条是关于定界的规定,划定了除中缅北段未定界以外的边界。由于对有效占有的理解、条约文本、以及地图的失误,中国反而丧失了实际管辖的小江流域,也遗留下南段未定界。中缅近代遗留的南、北两段边界争端,除近代欧洲列强侵略原因外,也源于中国对领土划界、国际法领土取得和变更理论的理解不够深入和准确。因此,及时理解国际法有关领土理论的产生与变更、在积极运用国际法解决边界争端之时更谨慎地注意技术上的细节,才是真正解决国家边界争端的恰当方式。     

高含水期油藏层间压力结构差异量化方法研究

由于长期注水开发和层间非均质性影响，高含水期油藏各小层层间压力结构差异严重，掌握差异状况是合理调整的重要依据。针对现场分层测压资料少，单层压力资料获取困难的情况，应用渗流力学原理建立了高含水期地层层间压力结构差异量化数学模型，模型的关键参数可以通过生产数据计算获得。枣园油田的实例验证表明，高含水油藏层间压力存在明显差异，该方法能够确定各小层的压力差异状况。量化计算结果和实测资料相接近，有利于认清开发矛盾，为合理调整提供技术依据。     

在夹缝中沉沦--论晚清海军国产舰船地位的边缘化

晚清政府在19世纪60年代中期设厂造船,开始了近代海军的建设历程。国产舰船在晚清海军发展的过程中也曾经占有主要地位,为海防建设作出了巨大贡献。但由于自身质量问题以及来自外部的冲击,官办造船厂存在的先天弊端以及统治者海洋意识的淡薄等原因,国产舰船在晚清海军舰船装备建设中的地位日益被边缘化,最终导致近代海军建设的失败,给近代中国带来巨大的危害。     

Constant factor approximation for the weighted partial degree bounded edge packing problem

In the partial degree bounded edge packing problem (PDBEP), the input is an undirected graph \(G=(V,E)\) with capacity \(c_v\in {\mathbb {N}}\) on each vertex v. The objective is to find a feasible subgraph \(G'=(V,E')\) maximizing \(|E'|\), where \(G'\) is said to be feasible if for each \(e=\{u,v\}\in E'\), \(\deg _{G'}(u)\le c_u\) or \(\deg _{G'}(v)\le c_v\). In the weighted version of the problem, additionally each edge \(e\in E\) has a weight w(e) and we want to find a feasible subgraph \(G'=(V,E')\) maximizing \(\sum _{e\in E'} w(e)\). The problem is already NP-hard if \(c_v = 1\) for all \(v\in V\) (Zhang in: Proceedings of the joint international conference on frontiers in algorithmics and algorithmic aspects in information and management, FAW-AAIM 2012, Beijing, China, May 14–16, pp 359–367, 2012). In this paper, we introduce a generalization of the PDBEP problem. We let the edges have weights as well as demands, and we present the first constant-factor approximation algorithms for this problem. Our results imply the first constant-factor approximation algorithm for the weighted PDBEP problem, improving the result of Aurora et al. (FAW-AAIM 2013) who presented an \(O(\log n)\)-approximation for the weighted case. We also study the weighted PDBEP problem on hypergraphs and present a constant factor approximation if the maximum degree of the hypergraph is bounded above by a constant. We study a generalization of the weighted PDBEP problem with demands where each edge additionally specifies whether it requires at least one, or both its end-points to not exceed the capacity. The objective is to pick a maximum weight subset of edges. We give a constant factor approximation for this problem. We also present a PTAS for the weighted PDBEP problem with demands on H-minor free graphs, if the demands on the edges are bounded by polynomial. We show that the PDBEP problem is APX-hard even for bipartite graphs with \(c_v = 1, \; \forall v\in V\) and having degree at most 3.     

Quality of Life in Italian Official Surveys

Quality-of-life studies have a 50-year history and inherited the tradition of the “social indicators” movement, born in the United States during the sixties and involving scholars and researchers, supported by the public administration and interested in gathering and analysing data aimed at studying non-economic components of societal wellbeing. The idea of quantifying “symptoms” (indicators) of living conditions has been launched by Italian statistician and criminologist, Alfredo Niceforo, who has been recognised as the pioneer of social-indicators concept. Moreover, with his book on Les indices numérique de la civilisation et du progrès, he may be considered the originator of an approach of comprehensive welfare and quality of life measurement as it is the concern of modern social indicators and quality of life.     

Unterstützung dualer Karrieren im Spitzensport

The longstanding focus of elite athletes on top sports entails disadvantages hampering their later entry to the world of work. In order to successfully contribute their outstanding personality traits to a later job, athletes are thus particularly required to care for their employability. Contributing to this, the author carried out a competency balancing with top athletes. This coaching method significantly decreased the athletes’ need for self-information. Evaluation further showed indications of increased clarity and certainty of occupational goals as well as work satisfaction.     

The matching extension problem in general graphs is co-NP-complete

A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete.     

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

We revise existing and introduce new mixed-integer programming models for the Multiprocessor scheduling problem with communication delays. The basis for both is the identification of two major modeling strategies one of which can be considered ordering-based, and the other assignment-based. We first reveal redundancies in the encoding of feasible solutions found in present formulations and discuss how they can be avoided. For the assignment-based approach, we propose new inequalities that lead to provably stronger continuous relaxations and better performance in practice. Moreover, we derive a third, novel modeling strategy and show how to more compactly linearize assignment formulations with quadratic constraints. In a comprehensive experimental comparison of representative models that reflect the state-of-the-art in terms of strength and size, we evaluate not only running times but also the obtained lower and upper bounds on the makespan for the harder instances of a large scale benchmark set.