C语言编译密码方案的应用

随着计算机技术飞速发展,编程技术取得巨大进步,各种各样的程序为我们学习工作生活提供了很大方便,编程工具和语言类型也空前丰富。其中,C语言由于实现速度快,逻辑性强,在编程技术中占有重要地位,成为研究开发的重要工具,很多环境下非常便捷。本文从研究角度出发,以总结的方式,介绍在采用C语言编译密码方案并进行分析的过程,在应用中不断学习。     

求解声波动方程的隐格式有限体积法

为研究声传播问题,提出一种声波动方程的隐格式有限体积法,该方法将格点型有限体积法与Newmark格式相结合.模拟平面波的传播过程,对比分析隐格式有限体积法和文献中显格式有限体积法的精度、稳定性及计算消耗等方面的性能.数值结果表明:当λ/Δx≥10时,两种算法均能得到满足精度要求的解;采用无条件稳定的隐格式算法,当满足ω0Δt≤0.3时,预测声压的相对峰值误差1%;当采用相同时间、空间步长时,隐格式算法精度高于显格式算法;隐格式算法对吸收边界的处理精度高于显格式算法,但对全反射边界的处理精度低于显格式算法;两种算法内存消耗比较接近,显格式算法的CPU耗时较少.     

渗透检验标准试块的技术要求与用途

摘介绍ISO3452—3：1998标准及依据该标准而制订的相应国家标准的主要内容，包括渗透检验用标准试块的类型、尺寸和制作方法，以使我国无损检测工作者能更好地了解和采用该标准所规定的渗透检验试块。I型试块适用于确定荧光和着色渗透剂系统的灵敏度等级，Ⅱ型试块适用于评定荧光和着色渗透检验的综合性能，它们可有效保证渗透检验结果的可靠性，已被欧美日等发达国家广泛采用。     

自然崩落法放矿排产优化的数学模型

在自然崩落法相关研究的基础上，探讨了自然崩落法放矿控制的排产优化问题；给出了正向优化和逆向优化的数学模型，为实现均匀放矿提供了一种理想的理论方法。对充分发挥自然崩落法的优越性和提高矿产资源的回收率具有重要的理论和现实意义     

白石水库泥沙淤积与减淤方法的研究

白石水库泥沙淤积严重,牤牛河与大凌河交汇区的淤积尤其严重,将形成"拦门沙坎"把库区分成上下两部分,影响白石水库正常运行。文章分析认为水库初设时的异重流排沙和泄空排沙的减淤方法,受各种客观因素制约,无法实施,并对牤牛河交汇区挖槽减淤方案进行了试验研究,证明挖槽减淤对减缓库区淤积效果十分显著。     

白家河水库溢洪道侧槽水力设计

以白家河水库侧槽溢洪道为例,介绍其设计方案比选、总体布置、水力计算等,给出了其泄流能力、堰面曲线、泄槽临界水深、侧槽末端水深、侧槽末端底高程和侧槽水面线等水力计算方法和成果,为白家河水库侧槽溢洪道的设计提供了依据。     

Perfect secret sharing scheme based on vertex domination set

Due to the fast development in data communication systems and computer networks in recent years, the necessity to protect the secret data has become extremely imperative. Several methods have been proposed to protect the secret data; one of them is the secret sharing scheme. It is a method of distributing a secret K among a finite set of participants, in such a way that only predefined subset of participant is enabled to reconstruct a secret from their shares. A secret sharing scheme realizing uniform access structure described by a graph has received a considerable attention. In this scheme, each vertex represents a participant and each edge represents a minimum authorized subset. In this paper, an independent dominating set of vertices in a graph G is introduced and applied as a novel idea to construct a secret sharing scheme such that the vertices of the graph represent the participants and the dominating set of vertices in G represents the minimal authorized set. While most of the previous schemes were based on the principle of adjacent vertices, the proposed scheme is based upon the principle of non-adjacent vertices. We prove that the scheme is perfect, and the lower bound of the information rate of this new construction is improved when compared to some well-known previous constructions. We include an experiment involving security threats to demonstrate the effectiveness of the proposed scheme.     

Numerical solution of nonlinear system of Klein–Gordon equations by cubic B-spline collocation method

A technique to approximate the solutions of nonlinear Klein–Gordon equation and Klein–Gordon-Schrödinger equations is presented separately. The approach is based on collocation of cubic B-spline functions. The above-mentioned equations are decomposed into a system of partial differential equations, which are further converted to an amenable system of ODEs. The obtained system has been solved by SSP-RK54 scheme. Numerical solutions are presented for five examples, to show the accuracy and usefulness of proposed approach. The approximate solutions of both the equations are computed without using any transformation and linearization. The technique can be applied with ease to solve linear and nonlinear PDEs and also reduces the computational work.     

Real-time nonlinear MPC and MHE for a large-scale mechatronic application

Progress in optimization algorithms and in computational hardware made deployment of Nonlinear Model Predictive Control (NMPC) and Moving Horizon Estimation (MHE) possible to mechatronic applications. This paper aims to assess the computational performance of NMPC and MHE for rotational start-up of Airborne Wind Energy systems. The capabilities offered by an automatic code generation tool are experimentally verified on a real physical system, using a model comprising 27 states and 4 inputs at a sampling frequency of 25 Hz. The results show the feedback times less than 5 ms for the NMPC with more than 1500 variables.