Toric Rigid Spaces

This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.     

Multiple Observations for Secret-Key Binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.     

Tracking an Auto-Regressive Process with Limited Communication per Unit Time

Samples from a high-dimensional first-order auto-regressive process generated by an independently and identically distributed random innovation sequence are observed by a sender which can communicate only finitely many bits per unit time to a receiver. The receiver seeks to form an estimate of the process value at every time instant in real-time. We consider a time-slotted communication model in a slow-sampling regime where multiple communication slots occur between two sampling instants. We propose a successive update scheme which uses communication between sampling instants to refine estimates of the latest sample and study the following question: Is it better to collect communication of multiple slots to send better refined estimates, making the receiver wait more for every refinement, or to be fast but loose and send new information in every communication opportunity? We show that the fast but loose successive update scheme with ideal spherical codes is universally optimal asymptotically for a large dimension. However, most practical quantization codes for fixed dimensions do not meet the ideal performance required for this optimality, and they typically will have a bias in the form of a fixed additive error. Interestingly, our analysis shows that the fast but loose scheme is not an optimal choice in the presence of such errors, and a judiciously chosen frequency of updates outperforms it.     

Charged torus-like black holes as heat engines

We investigate the thermodynamical properties of charged torus-like black holes and take it as the working substance to study the heat engines. In the extended phase space, by interpreting the cosmological constant as the thermodynamic pressure, we derive the thermodynamical quantities by the first law of black hole thermodynamics and obtain the equation of state. Then, we calculate the efficiency of the heat engine in the Carnot cycle as well as the rectangular cycle,and investigate how the efficiency changes with respect to volume. In addition, to avoid a negative temperature, we emphasize that the charge of this black hole cannot be arbitrary. Last,we check the calculation accuracy of a benchmark scheme and discuss the upper bound and lower bound for charged torus-like black hole in the scheme.     

A numerical study of the motion of a wave running up a beach

The main difficulty for the numerical calculation of the wave running up a beach is the treatment of its moving water boundary. In this paper a scheme of turning the free boundary problem into a fixed boundary problem is designed. The calculated run-up height is consistent with the experiments. Some interesting wave phenomena are also found.     

平面叶栅跨音流场气动特性的数值研究

通过对模型方程的分析，给出了一种新的隐格式构造思想。将它运用到关通量分裂格式中，可得到无近似因子分解、无矩阵运算的高效二阶精度隐式矢通量分裂差分格式，并用来直接求解时间平均Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程组。数值计算标明：该方法具有精度高、稳定性好、计算量少、收敛快等优点，在平面叶栅跨音流场的计算中，较好地捕获了激波，与实验比较，结果令人满意。     

群桩作用机理的数值试验研究

 在分析桩土支撑体系及其相互作用关系的基础上，利用有限元分析软件ANSYS建立了群桩 体系计算模型. 通过对均质土体例题计算结果分析，可以看出利用该建模方法与传统解答有 很好的一致性. 根据辽宁工程技术大学实验馆场地土实测资料，利用该建模方法，求解出了承台与桩的 荷载分担比，对安全、经济地进行群桩基础设计具有重要指导作用和应用价值.     

类升力体外形高超声速粘性绕流拓扑结构分析

采用交替方向隐式分解的隐式NND格式求解全N-S方程模拟“类升力体”外形在高超声速下的大攻角流动,给出了“类升力体”外形表面极限流线随攻角变化的拓扑结构及40°攻角下垂直于体轴的横截面流线拓扑结构。结果表明:类升力体外形三维流场结构十分复杂,攻角从0°～40°变化时,背风面表面极限流线依次由不分离、开式分离向起始于鞍、结点组合的高阶奇点的分离方式转化,翼面横向分离亦随攻角增大而增大;垂直于体轴的横截面流动拓扑结构与文献[2]给出的理论分析一致。     

稀薄流到连续流的气体运动论模型方程算法研究

通过引入碰撞松弛参数和当地平衡态分布函数对BGK模型方程进行修正，确定含流态控制参数可描述不同流域气体流动特性的气体分子速度分布函数的简化控制方程。发展和应用离散速度坐标法于气体分子速度空间，利用一套在物理空间和时间上连续而速度空间离散的分布函数来代替原分布函数对速度空间的连续依赖性。基于非定常时间分裂数值计算方法和无波动、无自由参数的NND耗散差分格式，建立直接求解气体分子速度分布函数的气体运动论有限差分数值方法。推广应用改进的Gauss-Hermite无穷积分法和华罗庚－王元提出的以单和逼近重积分的黄金分割数论积分方法等，对离散速度空间进行宏观取矩获取物理空间各点的气体流动参数，由此发展一套从稀薄流到连续流各流域统一的气体运动论数值算法。通过对不同Knudsen数下一维激波管问题、二维圆柱绕流和三维球体绕流的初步数值实验表明文中发展的数值算法是可行的。     

A unified three point approximating subdivision scheme

In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.