基于耦合声场建模的膨胀腔消声器声学性能分析及试验

针对圆柱形膨胀腔消声器三维建模及声学性能分析问题, 提出一种基于切比雪夫变分原理的耦合声场建模方法, 建立三维圆柱形膨胀腔消声器理论模型并搭建试验台架, 传递损失试验结果验证了理论模型的准确性. 将膨胀腔消声器内部声场分解为多个子声场, 基于子声场间压力与质点振速连续性条件, 推导声场耦合变分公式, 构建子声场拉格朗日泛函. 将子声场声压函数展开为切比雪夫-傅里叶级数形式, 通过瑞利-里兹法求解膨胀腔消声器频率、声压响应及传递损失. 计算并对比分析扩张比、扩张腔长度、进出口管偏置对膨胀腔消声器消声性能的影响. 结果表明: 扩张比增大会有效提高消声器在低频段的消声性能, 进出口管的偏置对消声器消声性能影响很小.     

复合材料失效判据有效性验证方法研究

为系统地验证复合材料失效判据计算精度和有效性范围,给出了4种材料体系、6种铺层形式的层合板在单轴、双轴载荷下的失效试验数据,用以评估复合材料失效判据在单向层合板失效包线、多向层合板初始失效包线、多向层合板最终失效包线、层合板变形及层合板的破坏特性等五个方面的预测能力。并根据验证方法和有效性评估策略对失效判据计算精度进行量化考核,给出了失效判据在五个层面上的计算精度。     

HyperFLOW软件非结构网格亚跨声速湍流模拟的验证与确认

计算流体力学(computational fluid dynamics,CFD)数值模拟在航空航天等领域发挥越来越重要的作用,然而CFD数值模拟结果的可信度仍然需要通过不断地验证与确认来提高.本文给出了从制造解精度测试、简单到复杂外形湍流模拟网格收敛性研究等三个方面开展CFD软件验证与确认的方法,并对自主研发的CFD软件平台HyperFLOW在非结构网格上模拟亚跨声速湍流问题的能力进行了验证与确认.首先通过基于Euler方程和标量扩散方程的制造解精度测试,分别验证了HyperFLOW在非结构网格上对Euler方程和黏性项的求解精度,结果表明其能够在任意非结构网格上达到设计的二阶精度. 其次,通过NASATurbulence Modeling Resource中的湍流平板、二维翼型近尾迹流动、二维Bump等几个典型的亚声速湍流算例的网格收敛性研究,量化考察了数值结果的观测精度阶和网格收敛性指数,并与国外知名CFD解算器CFL3D,FUN3D的计算结果进行了对比,验证了HyperFLOW对简单湍流问题的模拟能力,且具有良好的网格收敛性和计算精度(阶). 最后,通过NASA CommonResearchModel标模定升力系数的网格收敛性研究和升阻极曲线预测,验证了软件在复杂外形亚跨声速湍流流动数值模拟中也具有良好的可信度.      

基于NPP-VIIRS夜间灯光数据的山西省GDP空间化模拟

选取山西省为研究对象，以美国国家极轨合作仪件-可见红外成像辐射计套件（NPP-VIIRS）夜间灯光数据、GDP统计数据等为数据源，构建GDP空间化拟合模型，建立山西省GDP密度图，据此研究山西省经济的空间差异性。通过对NPP-VIIRS夜间灯光数据的空间化处理，提取灯光指数，并将其与GDP进行回归拟合，建立最佳回归模型，得到GDP密度拟合图；利用县级GDP数据进行线性纠正，从而提高GDP的模拟精度。结果表明：（1）NPP-VIIRS夜间灯光数据与GDP的相关性较高，可用于山西省GDP模拟；（2）与GDP分区建模相比，GDP整体建模的精度更高；（3）山西省GDP的空间分布整体呈由城市中心逐渐向周边辐射的特点，构成GDP过渡带。     

基于认识化学正向价值的教学实践——以“二氧化碳*”为例

模拟大型科普求真类节目《是真的吗？》创设学习氛围;通过基于生活生产实际的“日常灭火可否用N₂代替CO₂”“深海捕获CO₂可否调控温室效应”“石油采矿业中,向油井下注射1吨CO₂可否增产原油3~5吨”“用石灰水可否保鲜鸡蛋”等4个核心问题及3个真假难辨的小问题,引导学生从化学的正向视角深刻认识二氧化碳的性质;利用移动磁贴板设计板书,引导学生经历并建构结构化知识体系。     

基于LabVIEW的砝码自动检定系统设计与实现

针对目前砝码检定工作操作过程复杂、检定效率低等问题,设计了一种基于LabVIEW的砝码自动检定系统。在符合砝码检定规程的情况下,系统实现了检定数据实时采集、数据处理、生成原始记录、管理标准器、查询历史数据和衡器控制等功能。相对现有的砝码检定方法有操作简单、高效、程序移植性好等优点。系统由主控计算机、串口转无线扩展卡、多台衡器设备及相应的标准砝码装置组成。通过使用串口转Wi-Fi模块,系统可实现控制多台衡器设备的需求。实验结果证明,系统运行稳定可靠,采集数据准确,容易扩展,且大幅度减轻了检定人员的劳动强度,在计量检定工作中具有一定的实用和推广价值。     

C语言在密立根实验数据处理中的应用

用密立根油滴仪测油滴的电荷,求基本电量,及验证电荷量子性的实验是大学物理实验的经典实验。实验采用倒过来验证法,数据多,计算量较大,本文探讨使用C语言编程来处理实验数据。     

RESEARCH ON METHOD TO CALCULATE VELOCITIES OF SOLID PHASE AND LIQUID PHASE IN DEBRIS FLOW

Velocities of solid phase and liquid phase in debris flow are one key problem to research on impact and abrasion mechanism of banks and control structures under action of debris flow. Debris flow was simplified as two-phase liquid composed of solid phase with the same diameter particles and liquid phase with the same mechanical features. Assume debris flow was one-dimension two-phase liquid moving to one direction, then general equations of velocities of solid phase and liquid phase were founded in two-phase theory. Methods to calculate average pressures, volume forces and surface forces of debris flow control volume were established. Specially, surface forces were ascertained using Bingham's rheology equation of liquid phase and Bagnold's testing results about interaction between particles of solid phase. Proportional coefficient of velocities between liquid phase and solid phase was put forward, meanwhile, divergent coefficient between theoretical velocity and real velocity of solid phase was provided too. To state succinctly before, method to calculate velocities of solid phase and liquid phase was obtained through solution to general equations. The method is suitable for both viscous debris flow and thin debris flow. Additionally, velocities every phase can be identified through analyzing deposits in-situ after occurring of debris flow. It is obvious from engineering case the result in the method is consistent to that in real-time field observation.     

Concurrent combined verification: reducing false positives in automated NMR structure verification through the evaluation of multiple challenge control structures

Automated structure verification using ¹H NMR data or a combination of ¹H and heteronuclear single‐quantum correlation (HSQC) data is gaining more interest as a routine application for qualitative evaluation of large compound libraries produced by synthetic chemistry. The goal of this automated software method is to identify a manageable subset of compounds and data that require human review. In practice, the automated method will flag structure and data combinations that exhibit some inconsistency (i.e. strange chemical shifts, conflicts in multiplicity, or overestimated and underestimated integration values) and validate those that appear consistent. One drawback of this approach is that no automated system can guarantee that all passing structures are indeed correct structures. The major reason for this is that approaches using only ¹H or even ¹H and HSQC spectra often do not provide sufficient information to properly distinguish between similar structures. Therefore, current implementations of automated structure verification systems allow, in principle, false positive results. Presented in this work is a method that greatly reduces the probability of an automated validation system passing incorrect structures (i.e. false positives). This novel method was applied to automatically validate 127 non‐proprietary compounds from several commercial sources. Presented also is the impact of this approach on false positive and false negative results. Copyright © 2012 John Wiley & Sons, Ltd.     

Bounded invariant verification for time-delayed nonlinear networked dynamical systems

We present a technique for bounded invariant verification of nonlinear networked dynamical systems with delayed interconnections. The underlying problem in precise bounded-time verification lies with computing bounds on the sensitivity of trajectories (or solutions) to changes in initial states and inputs of the system. For large networks, computing this sensitivity with precision guarantees is challenging. We introduce the notion of input-to-state (IS) discrepancy of each module or subsystem in a larger nonlinear networked dynamical system. The IS discrepancy bounds the distance between two solutions or trajectories of a module in terms of their initial states and their inputs. Given the IS discrepancy functions of the modules, we show that it is possible to effectively construct a reduced (low dimensional) time-delayed dynamical system, such that the trajectory of this reduced model precisely bounds the distance between the trajectories of the complete network with changed initial states. Using the above results we develop a sound and relatively complete algorithm for bounded invariant verification of networked dynamical systems consisting of nonlinear modules interacting through possibly delayed signals. Finally, we introduce a local version of IS discrepancy and show that it is possible to compute them using only the Lipschitz constant and the Jacobian of the dynamic function of the modules.