Copper Nanoparticles In鄄Situ Anchored on Nitrogen鄄Doped Carbon for High鄄Efficiency Oxygen Reduction Reaction Electrocatalyst北大核心CSCD

Compared with noble metal platinum (Pt)-based catalysts, inexpensive non-noble metal electrocatalysts have attracted extensive attention for oxygen reduction reaction (ORR). Herein, chitosan as a kind of biomass resource rich in nitrogen and carbon was used to prepare nitrogen-doped carbon (N-C) and N-C in-situ anchored by copper nanoparticles (Cu/N-C). The as-obtained N-C and Cu/N-C nanoparticles were successfully used as non-noble eletrocatalysts tested for ORR. Compared with the N-C, the Cu/N-C showed the high surface area of 607.3 m2窑g-1 with the mean pore size of 2.5 nm and the pore volume of 0.40 cm3窑g-1. The most positive Gibbs free energy change was the rate determining step for ORR process with the 4e mechanism, where the value of the Cu (111)/N-C(-0.39 eV) was lower than that of the N-C(-0.26 eV). The Cu/N-C exhibited superior onset and half-wave potentials (0.96 V and 0.84 V, respectively) in alkaline media (0.1 mol窑L-1 KOH), all of which are much better than those measured for N-C and commercial Pt/C. Furthermore, the Cu/N-C showed superior methanol crossover avoidance and oxygen reduction stability. © 2021 Authors. All rights reserved.     

氮掺杂碳原位锚定铜纳米颗粒用于高效氧还原反应催化剂

与贵金属铂基电化学氧还原反应（ORR）催化剂相比,廉价的非贵金属催化剂引起了广泛的关注。本文以壳聚糖作为一种富含氮和碳元素的生物质资源,利用碳浴法成功制备了氮掺杂碳原位负载铜纳米颗粒（Cu/N-C）催化剂。纯壳聚糖碳化得到的样品N-C的比表面积为67.5 m²·g^-1、平均孔径0.14 nm、平均孔体积8.00 m²·g^-1,与之相比,Cu/N-C比表面积可达607.3 m²·g^-1、平均孔径为2.5 nm、平均孔体积为0.40 cm³·g^-1。通过密度泛函理论（DFT）进行计算表明,Cu(111)/N-C的自由能值低于N-C,更有利于氧还原催化进行。在0.1 mol·L^-1 KOH的介质中,Cu/N-C不仅表现出优异的起始和半波电势（分别为0.96 V和0.84 V）,而且还表现出了优异的抗甲醇性能和稳定性,并且Cu元素掺杂量达到1.67wt.%。     

高校实验室安全教育在线资源调查研究*

对国内高校实验室安全教育在线资源现状进行调研。调查结果表明:在线资源主要有慕课、虚拟仿真实验及安全教育考试系统。因此,在安全教育过程中,可充分利用现有线上资源,弥补线下教学因时间有限、容量有限导致的不足,从而提高安全教育实效。线上、线下安全教育如何有机结合从而最大限度地发挥其在高校安全教育中的作用,仍需不断探索。     

一种牧场配料系统的设计与实现

提出了一种应用于移动Ad Hoc网络的分布式资源接纳控制机制,在目的节点和中间节点部署不同的资源接纳控制模块,能以接近通话或者分组传输的时间间隔适应网络的动态变化,为业务提供较好的QoS保障,并且能够支持多播及接收者异质性。仿真结果表明,添加资源接纳控制机制后,时延、抖动及丢包率分别降低了25.75%,51.76%和24.15%。     

Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.     

An Intersection Theorem on an Unbounded Set and Its Application to the Fair Allocation Problem

We prove the following theorem. Let m and n be any positive integers with mn, and let be a subset of the n-dimensional Euclidean space ⁿ . For each i=1, . . . , m, there is a class of subsets M _i ^j of ^Tn . Assume that for each i=1, . . . , m, that M _i ^j is nonempty and closed for all i, j, and that there exists a real number B(i, j) such that and its jth component _{xjB(i, j)} imply . Then, there exists a partition of {1, . . . , n} such that for all i and We prove this theorem based upon a generalization of a well-known theorem of Birkhoff and von Neumann. Moreover, we apply this theorem to the fair allocation problem of indivisible objects with money and obtain an existence theorem.     

Simulation optimization of buffer allocations in production lines with unreliable machines

We use a recent simulationbased optimization method, sample path optimization, to find optimal buffer allocations in tandem production lines where machines are subject to random breakdowns and repairs, and the product is fluidtype. We explore some of the functional properties of throughput of such systems and exploit these properties to prove the almost sure convergence of our optimization technique, under a regularity condition on the steady state. Utilizing a generalized semiMarkov process (GSMP) representation of the system, we derive recursive expressions to compute onesided directional derivatives of throughput, from a single simulation run. Finally, we give computational results for lines with up to 50 machines. We also compare results for smaller lines with the results from a more conventional method, stochastic approximation, whenever applicable. In these numerical studies, our method performed quite well on problems that are considered difficult by current computational standards.     

Broad distributions from resource partitioning

We present a model describing a generic process in which a finite resource is partitioned and distributed among agents. Through numerical simulation we show that the model considered is able to originate, within a unifying approach, a variety of broad distributions and provides an interpretation of empirical properties of distributions observed in the real world. In particular it allows to relate the exponent of the power-law part of the distributions to resource abundance and accessibility, while the left-end exponential behavior, observed in many distributions, is related to the presence of dissipative effects.     

Polybenzoxazines from renewable diphenolic acid

The novel benzoxazine monomers, DPA‐Bz and MDP‐Bz from renewable diphenolic acid (DPA), which mimics the structure of bisphenol A (BPA), were synthesized by traditional approaches. The structure and purity of the monomers was confirmed by FTIR, ¹H NMR, and ¹³C NMR spectra. The thermally activated polymerization of the MDP‐Bz and DPA‐Bz afforded thermosetting polybenzoxazines with higher T_g's, 270 °C and 208 °C respectively, and higher crosslinking density compared to BPA‐Bz, due to the transesterification or esterification reactions occurred during curing process. These reactions are in accordance with the number of independent reactions determined analyzing by SVD the chemical rank of the IR spectra data matrices recorded along the homopolymerization reactions monitored at 200 °C. Spectral and concentration profiles of the active chemical species involved in these processes were obtained by MCR‐ALS. © 2011 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem, 2011     

An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)

The multi-objective resource allocation problem (MORAP) addresses the important issue which seeks to find the expected objectives by allocating the limited amount of resource to various activates. Resources may be manpower, assets, raw material or anything else in limited supply which can be used to accomplish the goals. The goals may be objectives (i.e., minimizing costs, or maximizing efficiency) usually driven by specific future needs. In this paper, in order to obtain a set of Pareto solution efficiently, we proposed a modified version of ant colony optimization (ACO), in this algorithm we try to increase the efficiency of algorithm by increasing the learning of ants. Effectiveness and efficiency of proposed algorithm was validated by comparing the result of ACO with hybrid genetic algorithm (hGA) which was applied to MORAP later.