宽体液腔Janus-Helmholtz换能器

本文使用有限元方法对宽体液腔Janus-Helmholtz(JH)换能器进行了仿真分析,得出了壳体宽度拓展增量对JH换能器工作性能的影响规律。使用三维建模的方式,分析了连接部分对换能器性能的影响及宽体壳体的的模态,证明了三维建模的必要性。依据仿真优化结构设计了一款宽体液腔JH换能器并进行了湖上测试。最终测试结果与仿真结果有很好的一致性,相较直筒JH换能器其谐振频率降低300Hz,发射电压响应最高可达144dB。     

船舶与海洋平台结构冰载荷的高性能扩展多面体离散元方法

船舶与海洋平台结构的冰载荷是寒区海洋工程结构物设计中的关键参数,而离散元方法是有效计算结构冰载荷的重要手段. 本文采用基于闵可夫斯基和原理的扩展多面体离散元方法模拟船舶与海洋平台结构的相互作用过程. 其中,构造扩展多面体的近似包络函数并建立了基于优化模型的快速接触搜索算法;考虑单元间粘结作用的刚度软化过程建标识码元间的粘结-破碎模型. 同时,发展了 CPU-GPU 协同异构环境下的高性能并行算法. 为分析海冰与海洋结构作用中的冰载荷,采用ISO标准验证了扩展多面体离散元分析结构冰载荷的准确性. 采用离散元方法计算了船舶结构的冰载荷,研究了船舶结构表明的线载荷分布特点,并采用船舶结构冰阻力经验公式验证了计算结果的合理性. 采用离散元方法计算了平整冰区与多桩腿平台结构的相互作用,分析各桩腿上的冰载荷特点. 针对碎冰区的海冰管理过程,采用离散元方法分析了船舶结构绕行过程中的船舶和海洋平台结构冰载荷. 本文方法可有效应用于海洋结构冰载荷分析,能为极地船舶与海洋平台结构的设计和安全运行提供科学的分析手段.      

Hollow polyhedron structure of amorphous Ni-Co-S/Co(OH)_2 for high performance supercapacitors

In power storage technology,ion exchange is widely used to modify the electronic structures of electrode materials to stimulate their electrochemical properties.Here,we proposed a multistep ion exchange(cation exchange and anion exchange) strategy to synthesize amorphous Ni-Co-S and β-Co(OH)_2 hybrid nanomaterials with a hollow polyhedron structures.The synergistic effects of different components and the remarkable superiorities of hollow structure endow Ni-Co-S/Co(OH)_2 electrode with outstanding electrochemical performance,including ultra-high specific capacity(1440.0 C/g at 1 A/g),superior capacitance retention rate(79.1% retention at 20 A/g) and long operating lifespan(81.4% retention after5000 cycles).Moreover,the corresponding hybrid supercapacitor enjoys a high energy density of 58.4 Wh/kg at the power density of 0.8 kW/kg,and a decent cyclability that the capacitances are maintained at80.8% compared with the initial capacitance.This research presents a high-performance electrode material and provides a promising route for the construction of electrode materials for supercapacitors with both structural and component advantages.     

基于扩展多面体的离散单元法及其作用于圆桩的冰载荷计算

对于具有复杂几何形态的多面体单元,线性接触模型不能准确地计算不同接触模式下的作用力,且接触变形和作用力方向也不易判断.基于闵可夫斯基和(Minkowski sum)方法的扩展多面体单元能够准确描述非规则颗粒单元的几何形态,并可精确计算单元间的接触碰撞作用.该方法具有接触判断简单、计算效率高的特点.它将基本多面体和扩展球体相叠加以形成具有光滑棱边和角点的扩展多面体单元.考虑扩展多面体单元相互作用过程中角点、棱边和平面之间的不同接触模式,发展了相应的非线性黏弹性接触模型. 该接触模型将不同接触模型下的法向刚度统一表述为单元接触中接触点处等效曲率半径的函数;黏滞力和切向弹性力接触模型则借鉴球体单元非线性接触模型的处理方法. 为检验扩展多面体的可靠性,对碎冰区冰块对圆桩结构的冰载荷进行了离散元分析. 采用沃洛诺伊(Voronoi)切割算法获得了碎冰的初始随机分布状态,并考虑了海冰在运动过程中的海水浮力和拖曳力.计算表明该扩展多面体单元可描述海冰在海流拖曳下的运动过程以及圆桩结构的动冰力特性.在此基础上进一步分析了冰速和冰块尺寸对圆桩冰力的影响,并确定了冰力在圆桩上的分布规律. 最后,讨论了目前扩展多面体单元在计算冰载荷方面的局限性和改进方法.     

正交约束下的D-最优试验设计

针对一类因素间具有正交约束的回归模型的试验设计问题,以D-最优为准则,以加速度计试验设计为背景,从试验点的均衡分布原则出发,以不同试验环境下合加速度大小为依据,给出了不同环境下球内接正多面体的试验方法,通过进一步计算和深入分析表明,单球面时为避免信息矩阵降秩应采用不同安装方式,降低模型维数以达到试验目的;两球面下试验设计的优劣与两个半径的大小有关,半径越大计划越优,而且信息矩阵的秩最大时两个球半径之间呈近似线性关系.试验结果的优劣还受到初始安装位置的影响,为了达到最优化,应使合加速度方向与加速度计的某个轴同向.     

非正常凸多面体及凹多面体的落地概率

通过研究非正常凸、凹多边形板着地后的特点,得出了非正常凸多边形板及凹多边形板各边着地的概率.进而用立体角的概念,在分析非正常凸、凹多面体着地的特点后,得到了非正常凸多面体及凹多面体各面着地的概率.     

基于Mel频谱值和深度学习网络的鸟声识别算法*

为了增强网络对鸟鸣声信号的特征学习能力并提高识别精度,提出一种基于深度残差收缩网络和扩张卷积的鸟声识别方法。首先,提取鸟鸣声信号的对数梅尔特征及其一阶和二阶差分系数组成logMel特征集作为网络模型的输入;其次,通过深度残差收缩网络自动学习噪声阈值,减少噪声干扰;然后,引入扩张卷积增大卷积核感受野并利用注意力机制使网络更关注关键帧特征;最后,通过双向长短时记忆网络从学到的局部特征中学习长期依赖关系。以百鸟数据birdsdata鸟声库中的19种中国常见鸟类作为实验对象,识别正确率可以达到96.58%,并对比模型在不同信噪比数据下的识别结果,结果表明该模型在噪声环境下的识别效果优于现有模型。     

ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements

In multiple criteria decision aiding, it is common to use methods that are capable of automatically extracting a decision or evaluation model from partial information provided by the decision maker about a preference structure. In general, there is more than one possible model, leading to an indetermination which is dealt with sometimes arbitrarily in existing methods. This paper aims at filling this theoretical gap: we present a novel method, based on the computation of the analytic center of a polyhedron, for the selection of additive value functions that are compatible with holistic assessments of preferences. We demonstrate the most important characteristics of this technique with an experimental and comparative study of several existing methods belonging to the UTA family.     

Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets

In this paper we introduce an algorithm for the creation of polyhedral approximations for certain kinds of digital objects in a three-dimensional space. The objects are sets of voxels represented as strongly connected subsets of an abstract cell complex. The proposed algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of the objects are restricted to have genus 0. The second aim of this paper is to present some practical improvements to the discussed convex hull algorithm to reduce computation time.     

Projected Chvátal–Gomory cuts for mixed integer linear programs

Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure integer linear program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimize over the first Chvátal closure by modeling the Chvátal–Gomory (CG) separation problem as a mixed integer linear program (MILP) which is then solved by a general- purpose MILP solver. Unfortunately, this approach does not extend immediately to the Gomory mixed integer (GMI) closure of an MILP, since the GMI separation problem involves the solution of a nonlinear mixed integer program or a parametric MILP. In this paper we introduce a projected version of the CG cuts, and study their practical effectiveness for MILP problems. The idea is to project first the linear programming relaxation of the MILP at hand onto the space of the integer variables, and then to derive Chvátal–Gomory cuts for the projected polyhedron. Though theoretically dominated by GMI cuts, projected CG cuts have the advantage of producing a separation model very similar to the one introduced by Fischetti and Lodi, which can typically be solved in a reasonable amount of computing time. Gérard Cornuéjols was supported in part by NSF grant DMI-0352885, ONR grant N00014-03-1-0188, and ANR grant BLAN 06-1-138894. Matteo Fischetti was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract n. FP6-021235-2). Andrea Lodi was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract n. FP6-021235-2).