Ultrahigh Loading Copper Single Atom Catalyst for Palladium-free Wacker Oxidation

Wacker oxidation is an industry-adopted process to transform olefins into value-added epoxides and carbonyls. However, traditional Wacker oxidation involves the use of homogeneous palladium and copper catalysts for the olefin addition and reductive elimination. Here, we demonstrated an ultrahigh loading Cu single atom catalyst(14% Cu, mass fraction) for the palladium-free Wacker oxidation of 4-vinylanisole into the corresponding ketone with N-methylhydroxylamine hydrochloride as an additive under mild conditions. Mechanistic studies by ¹⁸O and deuterium isotope labelling revealed a hydrogen shift mechanism in this palladium-free process using N-methylhydroxylamine hydrochloride as the oxygen source. The reaction scope can be further extended to Kucherov oxidation. Our study paves the way to replace noble metal catalysts in the traditional homogeneous processes with single atom catalysts.     

重庆汽车产业配置与地域类型

运用产业经济学和区域经济地理学的原理、结合地理学的分析方法,着重探讨了重庆汽车产业配置地域运动过程和促使其演变的原因.划分重庆汽车产业分布为四种地域类型:“嘉陵江东岸与长江北岸型”;“长江南岸型”;“嘉陵江西岸型”;“飞地型”.对重庆汽车产业配置特点,存在问题作了深入地剖析与揭示,并对今后调整作了初步的设想.     

城市土地规划的优化方法研究

以多目标决策理论、组合优化理论以及预测科学技术为依据 ,首先建立了土地功能配置模型 ,帮助规划师对各种不同功能土地的片面布置进行分析 ,从而找到最合理的城市土地布局 ;然后以遗传算法作为优化工具 ,对建立的模型进行了优化。     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

河流COD污染通量变化规律研究

分析了两种类型河流COD污染通量变化特征。汇水面积较大的河流 ,下游断面汛期COD通量远大于点源COD入河排污量 ,典型河流断面可达其 9～ 2 2倍。这类河流COD污染通量与河水流量呈显著正相关 ,r值在 0 .90 3～ 0 .997范围 ,文中给出线性回归方程。河流点源污染量变异系数一般在 30 %～ 6 0 %,面源可达 12 7%～ 2 0 7%。     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

A novel specimen for investigating the mechanical behavior of elastomers under multiaxial loading conditions

In this paper we describe the design and manufacture of an axial-torsion test specimen, and provide relationships needed when conducting stress-strain characterization experiments with the specimen. The specimen is a short hollow cylinder of rubber bonded between two steel mounting rings, in which simultaneous axial and shear strains are produced via independently controlled axial and twist displacements. We present calculations for the strain-displacement and stress-load relationships, and strain energy density. These relationships have been established and validated via a combination of analytical and experimental techniques, and finite element analysis. We have investigated the extent and effects of strain and stress field non-uniformity in the test specimen. The specimen design is sufficiently simple that a closed-form expression for the strain-displacement relationship has been successfully developed.