寒冷地区某既有办公建筑围护结构优化改造研究

既有公共建筑能耗中,围护结构节能潜力巨大。以兰州某既有办公建筑为例,采用DeST-C软件模拟围护结构不同材料厚度、窗型,得出系列负荷,通过对数据分析、比较,得出如下结论:外墙外保温适宜材料为50mm的挤塑板,最大热负荷节能率为45.66%;屋面适宜保温材料为65mm的挤塑板,最大热负荷节能率为4.25%;外窗各个朝向全部更换玻璃,推荐选用内张膜中空玻璃(双膜),最大热负荷节能率为7.36%;单独更换南向外窗材料,推荐选用真空镀膜复合中空玻璃,最大热负荷节能率为1.78%。     

以 提高实践能力为目标的数据结构课程教学改革探索

This paper analyzes the problems existing in the teaching of data structure course, and puts forward the reform from the as- pects of strengthening basic programming, visualized explanation of abstract theory, combination of C++, Java programming, ratio- nal use of online platform, and stratification of exercises, aiming at improving students' practical ability, learning interest and self- confidence.     

论携号转网行为的私法规制

以电信用户入网协议为切入点,电信用户的携号转网行为应受到《合同法》《消费者权益保护法》等私法规范的保护与限制。该行为引起的格式条款解释、合同终止、违约责任、损失赔偿等问题,不能仅靠《电信条例》等公法规范来调整。应当积极引导广大消费者用户以私法领域相关规定为依据,转变争议解决思维,拓宽纠纷处理途径,合理选择维权手段,以保护自身合法民事权益,与行业监管部门共同推动电信行业有序发展。     

基于深度信念网络的列车故障音频诊断方法

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN)，利用小波包分解提取检测信号的特征向量并将其作为DBN的输入，待网络充分训练后，由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明，该方法能够在无监督的条件下有效识别列车故障，保障了列车的运行安全。     

社交网络中基于网络结构支撑模型的谣言传播研究

结合结构支撑理论，探究节点网络结构支持力的一些性质，提出了社交网络结构中的全网支持力和被支持力的总量一致性，并进一步提出计算节点支持力的方法。谣言作为特殊信息，在支持力不同节点之间的传播特性有所不同，借鉴随机游走模型中的PageRank计算方法，对不同节点支持力的谣言传播以及传播后的辟谣状况进行了仿真模拟，结果表明支持力不同的节点对于谣言传播和辟谣影响明显。     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Top illuminated organic photodetectors with dielectric/metal/dielectric transparent anode

The top illuminated organic photodetectors (OPDs) with a Dielectric/Metal/Dielectric (DMD) transparent anode are fabricated. The transparent electrode is composed of molybdenum trioxide (MoO₃)/silver (Ag)/MoO₃ layers and zinc oxide (ZnO)/aluminum (Al) is used for bottom cathode. The optimized DMD electrode has an optical transmittance of 85.7% at the wavelength of 546 nm and sheet resistance of ∼6 Ω/sq. The fabricated OPDs exhibit a high detectivity and wide range linearity.     

不同晶相结构ZrO2负载铜基催化剂用于二乙醇胺脱氢反应

通过制备不同晶相结构〔单斜相(m-ZrO_2)、四方相(t-ZrO_2)和无定型(a-ZrO_2)〕ZrO_2载体,再通过沉积沉淀法制得Cu/m-ZrO_2、Cu/t-ZrO_2和Cu/a-ZrO_2催化剂,分别用于催化二乙醇胺脱氢合成亚氨基二乙酸反应。采用XRD、氮气物理吸附脱附、XPS、H_2-TPR、CO_2-TPD对催化剂的结构进行了表征。结果表明,Cu/m-ZrO_2催化剂界面更加有利于Cu~+/Cu~0稳定存在,具有更多的碱性位点,且抗氧化性较好。在二乙醇胺脱氢反应中,Cu/m-ZrO_2催化剂性能最好,反应时间为2.5 h,亚氨基二乙酸收率为97.64%。