基于加权流量介数中心性的路网脆弱性分析——以无锡市为例

针对当前路网脆弱性研究中缺乏对真实交通状况考量的问题，在复杂网络理论的基础上，结合交通流量信息，提出了基于加权流量介数中心性的路网脆弱性分析方法。首先计算路网拓扑抽象图中各节点的最短路径介数中心性，然后使用流量数据对相应区域最短路径介数中心性加权，综合得到最终的脆弱性指标结果。以无锡市为例，对其实际交通路网脆弱性进行了计算，结果表明，该方法能综合反映静态全局路网结构与动态局部通行信息和现实交通情景下的路网脆弱性。     

基于碳关税和配额的再制造决策研究

在跨国闭环供应链中考虑碳关税、碳配额和碳税三种政策的影响,分别建立了出口国制造商(OEM)再制造模型和OEM授权进口国零售商进行再制造模型,得到不同模型中OEM和零售商的最优价格、最优销售量、最优利润,进一步分析了产品碳排放总量是否超过配额的不同情形下新产品碳排放量对新产品和再制造品价格、销售量的影响以及其中碳关税和碳税发挥的作用.结果表明,在配额限制下,存在碳关税、碳税以及两种政策共同约束的取值区间,当税率水平在不同区间时,新产品碳排放量对两种产品的价格、销售量有不同的影响.     

Power-of-two sampling in redundancy systems: The impact of assignment constraints

A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While intuition suggests that non-uniform sampling adversely impacts performance, this was only supported through simulations, and rigorous statements have remained elusive. Building on product-form distributions for redundancy systems, we prove the stochastic dominance of uniform sampling for a four-server system as well as arbitrary-size systems in light traffic.     

片段化森林中檵木幼苗种内叶经济性状变异及其驱动因子

在异质性生境中，种内功能性状变异有助于植物对环境的适应，进而影响种群更新、群落构建和生态系统过程。探讨了种内叶经济性状的变异及受生境异质性的塑造情况。以千岛湖片段化生境中的常见种檵木（Loropetalum chinense）的幼苗为研究对象，测定了200株檵木幼苗个体水平的7个叶经济性状（比叶面积SLA、叶全碳量C、叶全氮量N等）及其对应的生境因子（郁闭度、土壤全碳量、土壤全氮量等），采用相关性检验、主成分分析和线性混合效应模型等方法探讨片段化森林中檵木幼苗的种内叶经济性状变异及生境异质性对该变异的驱动作用。结果显示：（1） 在7个叶经济性状所构成的21对相关性分析中，有12对显著相关。经主成分分析降维后，主成分1（PC1）占性状总变异的43.02%，主要与比叶面积、叶绿素浓度、叶全氮量呈正相关，与叶干物质质量分数和叶碳氮比呈负相关，体现了檵木的种内叶经济谱，可反映叶片的最大光合效率。（2）片段化对生境条件和叶经济性状均有影响。岛屿森林群落的郁闭度显著低于大陆。相对于大陆，岛屿中的檵木幼苗趋向于更小的PC1值（缓慢投资-收益策略）；大岛边缘较大岛内部偏向于更小的PC1值。（3）生境因子中，郁闭度对PC1具有显著正效应。研究表明，片段化生境中的檵木在幼苗阶段存在叶经济谱，生境片段化可通过影响生境条件进而改变檵木幼苗的叶经济性状。随着生境片段化程度的加剧，檵木幼苗的叶经济性状逐渐向缓慢投资-收益策略靠拢。     

ITS示范工程对城市交通畅通性的贡献率研究

通过分析城市交通畅通性的影响因素及其与ITS(智能交通系统)的关系,挖掘ITS对城市交通畅通性的贡献率指标.搜集实证研究对象数据,采用灰色预测模型预测贡献率指标的数值,将ITS示范工程实施前后的数值进行对比,计算得到ITS示范工程对城市交通畅通性的贡献率.由贡献率结果判断ITS示范工程对城市交通畅通性的作用及ITS示范工程的实施效果如何,为未来ITS的发展提供相应的参考建议.     

“禁摩限电”效果综合评价模型

将交通需求级别进行划分后,通过数据包络分析法计算交通需求匹配度和交通运行效率,近乎绝对细化交通运行表现,依据具有时间轴的四维交通状况模拟建立了全新多维度的交通评价体系。此外,利用模糊层次分析法确定道路交通安全评价指标体系中各个指标的权重,同时作出基于差异驱动原理的综合评价。最后,将交通的污染指标提炼为机动车的排放指标和电动车的耗电指标来衡量交通工具对环境的影响。     

Multipore Zeolites: Synthesis and Catalytic Applications

In the last few years, important efforts have been made to synthesize so‐called “multipore” zeolites, which contain channels of different dimensions within the same crystalline structure. This is a very attractive subject, since the presence of pores of different sizes would favor the preferential diffusion of reactants and products through those different channel systems, allowing unique catalytic activities for specific chemical processes. In this Review we describe the most attractive achievements in the rational synthesis of multipore zeolites, containing small to extra‐large pores, and the improvements reported for relevant chemical processes when these multipore zeolites have been used as catalysts.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

政府补贴、国企国有化系数与中国企业的产能过剩

近年来中国产能过剩日益严重,化解该矛盾已成为十八大后中国推进经济体制改革、调整产业结构的重中之重.考虑中国国情,从微观层面出发,构建混合寡占竞争模型,能有效解决产能过剩.分析表明:1政府调整对国有企业的补贴以及国有企业国有化系数可以有效解决民营企业的产能过剩问题;2在中国的现状下,国有企业确实存在产能过剩,并且减少政府对国有企业的补贴以及调整国有企业国有化系数可以有效减少国有企业的产能过剩量.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.