A comparison of different approaches to integrate flamelet tables with presumed-shape PDF in flamelet models for turbulent flames

Flamelet models for turbulent combustion modelling make use of presumed-shape probability density functions (PDFs) for integrating laminar flamelet solutions to obtain an integrated flamelet table that can readily be used for turbulent flame calculations. The existence of non-unique approaches for such an integration has rarely been investigated before. For the first time, this work studies systematically the non-uniqueness of the flamelet table integration approaches. A flamelet model called the flamelet/progress variable model is used in the study, although the issue exists generally in many other flamelet models. Two classes of table integration approaches are investigated, one preserving the laminar flamelet structures during integration and the other not. Three different table integration approaches are examined and compared in detail to provide a thorough understanding of the different approaches. A partially stirred reactor is used as a test case for examining the different approaches. A method based on the transported PDF method is also employed to provide a reference for the assessment of the different flamelet table integration approaches. It is found in general that the flamelet preserving integration approach yields a more reasonable joint PDF of the mixture fraction and the progress variable, and the prediction results are closer to the referenced transported PDF results.     

Predicting USCS soil classification from soil property variables using Random Forest

Soil classification systems are widely used for quickly and easily summarizing soil properties and provide a shorthand method of communication between scientists, engineers, and end-users. Two of the most widely used soil classification systems are the United States Department of Agriculture (USDA) textural soil classification system and the Unified Soil Classification System (USCS). Unfortunately, not all soil map units are classified according to the USDA or USCS systems, and previous attempts to provide a crosswalk table have been inconsistent. Random Forest machine learning model was used to create a USCS prediction model using USDA soil property variables. Important variables for predicting USCS code from available soil properties were USDA soil textures, percent organic material, and available water storage. Prediction error rates less than 2% were achieved compared to error rates of approximately 40% using crosswalk methods.     

Connected cubic s-arc-regular Cayley graphs of finite nonabelian simple groups

A graph is said to be s-arc-regular if its full automorphism group acts regularly on the set of its s-arcs. In this paper, we investigate connected cubic s-arc-regular Cayley graphs of finite nonabelian simple groups. Two suffcient and necessary conditions for such graphs to be 1- or 2-arc-regular are given and based on the conditions, several infinite families of 1-or 2-arc-regular cubic Cayley graphs of alternating groups are constructed.     

平板折叠桌的设计模型

根据折叠桌的运动特征,选取折叠桌的四分之一为研究对象,建立任意角度下桌脚点的运动变化模型。考虑到产品稳固性、加工便利性和节约用材三方面对加工参数的影响,对折叠桌进行受力分析,得到多目标组合优化模型,用以确定出折叠桌的最优设计参数。针对用户提出的桌面形状要求,建立桌脚曲线的参数方程。作为模型推广,以椭圆状折叠桌为例,运用Matlab画出了桌脚边缘线在折叠过程中的动态变化示意图。同时,又深入研究Robert van Embricqs的滑动折叠桌,建立了新的桌脚曲线参数方程。最后,运用Matlab对多种形状折叠桌进行仿真,编写多目标优化算法,得出了最优加工参数,并进行了算法描述。     

Efficient lookup table using a linear function of inverse distance squared

The major bottleneck in molecular dynamics (MD) simulations of biomolecules exist in the calculation of pairwise nonbonded interactions like Lennard‐Jones and long‐range electrostatic interactions. Particle‐mesh Ewald (PME) method is able to evaluate long‐range electrostatic interactions accurately and quickly during MD simulation. However, the evaluation of energy and gradient includes time‐consuming inverse square roots and complementary error functions. To avoid such time‐consuming operations while keeping accuracy, we propose a new lookup table for short‐range interaction in PME by defining energy and gradient as a linear function of inverse distance squared. In our lookup table approach, densities of table points are inversely proportional to squared pair distances, enabling accurate evaluation of energy and gradient at small pair distances. Regardless of the inverse operation here, the new lookup table scheme allows fast pairwise nonbonded calculations owing to efficient usage of cache memory. © 2013 Wiley Periodicals, Inc.     

一种基于STM32的NAND flash的块分配框架设计

STM32对大容量数据文件存储与管理问题可通过NAND flash来解决。而NAND flash的高效管理需要文件系统参与。NAND flash有特殊的块读写及擦除机制,一般的嵌入式文件系统组织结构并不完全兼容NAND flash。针对NAND flash的特点兼顾STM32的资源承受力要提出新的NAND flash块分配框架,框架通过块分配槽这种数据结构,在不使用块分配表与垃圾表的情况下,实现了NAND flash均衡负载与垃圾块的回收;同时通过节点分配栈与文件节点表的配合来提高STM32对文件的读写速度,空间利用率和系统性能。仿真实验和计算结果表明该块分配框架可有效提高NAND flash块的均衡负载与节省RAM空间。     

地面目标雷达与红外特性数据库构建

为了对地面目标雷达与红外特性测试的各类数据进行统一规范化管理,使其高效应用,分析各类数据的特性及其处理方式,构建了目标特性数据库管理系统;数据库的整体设计中,在数据头和数据文件方案基础上增加了自动跟随数据表编号的路径生成方法,结合了接口式的运作结构,模块化的数据库功能和层次化的数据表结构设计思路;数据库的编制基于Access数据库管理软件和VC++编程软件,通过ADO数据库访问技术加以实现,详细描述了ADO接口的编程步骤,并对本接口不同指针的入库频率和提取效率进行了对比择优;在运行中,提出了主、副数据库移植性管理方法;工作实践验证了目标特性数据库管理系统的可靠性和高效性,为地面目标特性的测试与分析提供了良好的数据支撑。     

Perfect 1‐Factorizations of a Family of Cayley Graphs

A 1‐factorization of a graph G is a decomposition of G into edge‐disjoint 1‐factors (perfect matchings), and a perfect 1‐factorization is a 1‐factorization in which the union of any two of the 1‐factors is a Hamilton cycle. We consider the problem of the existence of perfect 1‐factorizations of even order 4‐regular Cayley graphs, with a particular interest in circulant graphs. In this paper, we study a new family of graphs, denoted , which are Cayley graphs if and only if k is even or . By solving the perfect 1‐factorization problem for a large class of graphs, we obtain a new class of 4‐regular bipartite circulant graphs that do not have a perfect 1‐factorization, answering a problem posed in 7 . With further study of graphs, we prove the nonexistence of P1Fs in a class of 4‐regular non‐bipartite circulant graphs, which is further support for a conjecture made in 7 .     

On Symmetric Cayley Graphs of Valency Eleven

A Cayley graph Γ=Cay(G,S)is said to be normal if G is normal in Aut Γ.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Γ of finite nonabelian simple groups G,where the vertex stabilizer Av is soluble for A=Aut Γ and v ∈ VΓ.We prove that either Γ is normal or G=A5,A10,A54,A274,A549 or A1099.Further,11-valent symmetric nonnormal Cayley graphs of A5,A54 and A274 are constructed.This provides some more examples of nonnormal 11-valent symmetric Cayley graphs of finite nonabelian simple groups after the first graph of this kind(of valency 11)was constructed by Fang,Ma and Wang in 2011.