产业转移下的海上丝绸之路沿线集装箱港口的投资决策研究

在产业转移背景下,考虑港口服务货运需求与刺激货运需求的双重功效,研究海上丝绸之路沿线产业承接地的港口投资建设问题。首先,在现实交通运输网络中加入虚拟链接构建超级网络,用以刻画制造业的转移、生产和运输过程。其次,建立制造业承接地港口投资决策优化模型,用运输阻抗、地价和工资三个内生变量描述港口投资、产业转移与区域经济之间均衡关系。模型以产业承接地港口收益最大为目标,确定承接地港口的投资规模及费率水平。最后,以斯里兰卡的科伦坡口为例进行数值分析,计算海上丝绸之路沿线港口需求与供给间正向反馈的数量关系及上确界,为优化沿线港口投资实现投资利益最大化提供依据。     

排名聚合算法在少量长列表聚合中的性能比较分析

排名聚合将多个排名列表聚合成一个综合排名列表,可应用于推荐系统、链路预测、元搜索、提案评选等.当前已有工作从不同角度对不同排名聚合算法进行了综述、比较,但存在算法种类较少、数据统计特性不清晰、评价指标不够合理等局限性.不同排名聚合算法在提出时均声称优于已有算法,但是用于比较的方法不同,测试的数据不同,应用的场景不同,因此何种算法最能适应某一任务在很多情况下仍不甚清楚.本文基于Mallows模型,提出一套生成统计特性可控的不同类型的排名列表的算法,使用一个可应用于不同类型排名列表的通用评价指标,介绍9种排名聚合算法以及它们在聚合少量长列表时的表现.结果发现启发式方法虽然简单,但是在排名列表相似度较高、列表相对简单的情况下,能够接近甚至超过一些优化类方法的结果;列表中平局数量的增长会降低聚合排名的一致性并增加波动;列表数量的增加对聚合效果的影响呈现非单调性.整体而言,基于距离优化的分支定界方法 (FAST)优于其他各类算法,在不同类型的排名列表中表现非常稳定,能够很好地完成少量长列表的排名聚合.     

Recent breakthroughs of antibacterial and antiviral protective polymeric materials during COVID-19 pandemic and after pandemic: Coating,packaging, and textile applications

The global epidemic owing to COVID-19 has generated awareness to ensuring best practices for avoiding the microorganism spread. Indeed, because of the increase in infections caused by bacteria and viruses such as SARS-CoV-2, the global demand for antimicrobial materials is growing. New technologies by using polymeric systems are of great interest. Virus transmission by contaminated surfaces leads to the spread of infectious diseases, so antimicrobial coatings are significant in this regard. Moreover, antimicrobial food packaging is beneficial to prevent the spread of microorganisms during food processing and transportation. Furthermore, antimicrobial textiles show an effective role. We aim to provide a review of prepared antimicrobial polymeric materials for use in coating, food packaging, and textile during the COVID-19 pandemic and after pandemic.     

Arc reversals of cycles in orientations of G vertex-multiplications

Ryser proved that any two tournaments with the same score sequence are $C_3$-equivalent while Beineke and Moon proved the $C_4$-equivalence for any two bipartite tournaments with the same score lists. In this paper, we extend these results to orientations of G vertex-multiplications. We focus on two main areas, namely orientations with the same score list and with score-list parity. Our main tools are extensions of the refinement technique, directed difference graph and a reduction lemma.     

Electrochemical technologies for treating petroleum industry wastewater

This review focuses on recent developments in electrochemical technology (with special emphasis on electrocoagulation, electro-oxidation, and electro-Fenton) to treat petroleum industry effluents (offshore and hydraulic fracturing extraction, as well as refinery effluents). In addition, an overview is given of what these processes face to position themselves as consolidated technologies.     

高技术产业技术创新与产业集聚协同发展实证研究——基于京津冀、长三角、珠三角的比较

运用复合系统协同度模型, 测算了2010~2018年京津冀、长三角、珠三角高技术产业及其细分行业的技术创新与产业集聚协同度. 结果表明 在研究期内, 高技术产业技术创新与产业集聚协同度总体在低位运行, 大部分处于未协同和较低水平协同, 且技术创新发展在2014年后明显快于产业集聚; 京津冀、长三角均处于初始阶段向成长阶段过渡时期, 珠三角则相对领先, 逐渐向协作阶段跨越; 京津冀在航空、航天器及设备制造业上最具协同优势, 长三角在医药制造业、医疗仪器设备及仪器仪表制造业上向协作阶段过渡的优势明显, 珠三角在电子及通信设备制造业、医疗仪器设备及仪器仪表制造业上有向协作阶段发展的势头.     

中国战略性新兴产业国际竞争力评价

以"新钻石模型"为基础,从产业环境、产业支撑和产业创新等3个维度构建战略性新兴产业国际竞争力评价指标体系.运用2005~2014年的面板数据对战略性新兴产业进行因子分析.评价结果显示,电子及通信设备制造业与医药制造业国际竞争力明显高于计算机及办公设备制造业与医疗仪器设备及仪器仪表制造业.航空航天器及设备制造业国际竞争力有很大提升潜力.电子及通信设备制造业创新能力表现突出,但战略性新兴产业整体创新能力较低.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

List coloring triangle-free planar graphs

This paper proves the following result. Assume $G$ is a triangle-free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\text{◂=▸}|L\left(v\right)|=4$ for each vertex $\text{◂+▸}v\in V\left(G\right)-X$ and $\text{◂=▸}|L\left(v\right)|=3$ for each vertex $v\in X$, then $G$ is $L$-colorable.     

Coloring triangle‐free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow‐up work of Bernshteyn) on the (list) chromatic number of triangle‐free graphs. In both our results, we permit the amount of color made available to vertices of lower degree to be accordingly lower. One result concerns list coloring and correspondence coloring, while the other concerns fractional coloring. Our proof of the second illustrates the use of the hard‐core model to prove a Johansson‐type result, which may be of independent interest.