Achieving Rich and Active Alkaline Hydrogen Evolution Heterostructures via Interface Engineering on 2D 1T‐MoS2 Quantum Sheets

Large‐scale production of hydrogen from water‐alkali electrolyzers is impeded by the sluggish kinetics of hydrogen evolution reaction (HER) electrocatalysts. The hybridization of an acid‐active HER catalyst with a cocatalyst at the nanoscale helps boost HER kinetics in alkaline media. Here, it is demonstrated that 1T–MoS₂ nanosheet edges (instead of basal planes) decorated by metal hydroxides form highly active ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ heterostructures, which significantly enhance HER performance in alkaline media. Featured with rich ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ sites, the fabricated 1T–MoS₂ QS/Ni(OH)₂ hybrid (quantum sized 1T–MoS₂ sheets decorated with Ni(OH)₂ via interface engineering) only requires overpotentials of 57 and 112 mV to drive HER current densities of 10 and 100 mA cm^?2, respectively, and has a low Tafel slope of 30 mV dec^?1 in 1 m KOH. So far, this is the best performance for MoS₂‐based electrocatalysts and the 1T–MoS₂ QS/Ni(OH)₂ hybrid is among the best‐performing non‐Pt alkaline HER electrocatalysts known. The HER process is durable for 100 h at current densities up to 500 mA cm^?2. This work not only provides an active, cost‐effective, and robust alkaline HER electrocatalyst, but also demonstrates a design strategy for preparing high‐performance catalysts based on edge‐rich 2D quantum sheets for other catalytic reactions.     

基于Internet的远程教育系统模型研究

随着计算机网络技术的发展，远程教学系统的结构发生了重大的变化，逐步由原来的客户机／服务器(C／S)结构转变为基于Internet的浏览器／服务器(B／S)结构。本文提出了基于CORBA技术的B／S结构系统模型。分析了其运行过程，并与传统的结构进行了比较，指明了其优越性。在本文的结尾。指出了使用这种技术的一个具体例子。     

汽车计算平台工程国外相关标准概述

结合我国汽车计算平台工程,分析了国外相关的标准现状和基本框架,并为今后工作的开展提出了建议.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

The mapping properties of the radiosity operator along an edge

In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd.     

前缘弯掠斜流转子叶顶间隙流动特性数值分析

本文对前缘弯掠斜流转子叶顶间隙内的流动特性进行了数值分析。结果表明:叶顶间隙气流与主流发生卷吸而生成泄漏涡。泄漏涡作用的区域具有较低的压力分布。在叶片通道内,泄漏涡沿着与转子旋向相反的方向朝相邻叶片的压力面移动。大间隙时的泄漏涡比小间隙时强烈。低流量时泄漏涡的作用区域比高流量时大。在各种流量特性下,叶顶尾缘近吸力面区域都存在着二次间隙流。     

Large scale petroleum reservoir simulation and parallel preconditioning algorithms research

Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear     

HL-1M边缘等离子体静电湍流扰动

对HL－1M边缘等离子体静电湍流扰动进行了初步的实验研究。获得了扰动的基本特征量，估计了低杂波引起的径向粒子流的变化。在加低杂波（2．45GHz)前、后，电子密度扰动和极向电场扰动的幅度及其关联性变化不大。虽然低杂波部分抑制了静电湍流，但在数量上不能解释粒子约束改善的实验结果。     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.