高精度隐式参差光滑格式的构造

参照Lax-Wendroff格式的构造方法,就双曲型方程、抛物型方程和双曲-抛物型方程,构造了一种新的IRS(implicit residual smoothing)格式。该IRS格式有二阶或三阶时间精度且大大地拓宽了解的稳定区域和CFL数。这种新的IRS格式有中心加权型和迎风偏向型两种,并用von-Neumann分析方法分析了格式的稳定范围。讨论了在透平机械中广泛应用的Dawes方法的局限性,发现该方法对稳态问题得出的解与时间步长的选取有关,对粘性问题求解时,时间步长受严格限制。最后,结合TVD(total variation diminishing)格式和四阶Runge-Kutta技术,用IRS格式和Dawes方法对二维反射激波场进行了数值模拟,数值结果支持本文的分析结论。     

Geometric error of finite volume schemes for conservation laws on evolving surfaces

This paper studies finite volume schemes for scalar hyperbolic conservation laws on evolving hypersurfaces of \(\mathbb {R}^3\) . We compare theoretical schemes assuming knowledge of all geometric quantities to (practical) schemes defined on moving polyhedra approximating the surface. For the former schemes error estimates have already been proven, but the implementation of such schemes is not feasible for complex geometries. The latter schemes, in contrast, only require (easily) computable geometric quantities and are thus more useful for actual computations. We prove that the difference between approximate solutions defined by the respective families of schemes is of the order of the mesh width. In particular, the practical scheme converges to the entropy solution with the same rate as the theoretical one. Numerical experiments show that the proven order of convergence is optimal.     

Convergence rate of strong Local Linearization schemes for stochastic differential equations with additive noise

There is a variety of strong Local Linearization (LL) schemes for the numerical integration of stochastic differential equations with additive noise, which differ with respect to the algorithm that is used in the numerical implementation of the strong Local Linear discretization. However, in contrast with the Local Linear discretization, the convergence rate of the LL schemes has not been studied so far. In this paper, two general theorems about this matter are presented and, with their support, additional results are derived for some particular schemes. As a direct application, the convergence rate of some strong LL schemes for SDEs with jumps is briefly expounded as well.     

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

Commitment schemes have been extensively studied since they were introduced by Blum in 1982. Rivest recently showed how to construct unconditionally secure non-interactive commitment schemes, assuming the existence of a trusted initializer. In this paper, we present a formal mathematical model for unconditionally secure non-interactive commitment schemes with a trusted initializer and analyze their binding and concealing properties. In particular, we show that such schemes cannot be perfectly binding: there is necessarily a small probability that Alice can cheat Bob by committing to one value but later revealing a different value. We prove several bounds on Alice's cheating probability, and present constructions of schemes that achieve optimal cheating probabilities. We also analyze a class of commitment schemes based on resolvable designs.     

On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption

This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).We begin by surveying some useful schemes for key distribution that have been presented in the literature, giving background and examples (but not too many proofs). In particular, we look more closely at the attractive concept of key distribution patterns, and present a new method for making these schemes more efficient through the use of resilient functions. Then we present a general approach to the construction of broadcast schemes that combines key predistribution schemes with secret sharing schemes. We discuss the Fiat-Naor Broadcast Scheme, as well as other, new schemes that can be constructed using this approach.     

Understanding Saul'yev‐type unconditionally stable schemes from exponential splitting

Saul'yev‐type asymmetric schemes have been widely used in solving diffusion and advection equations. In this work, we show that Saul'yev‐type schemes can be derived from the exponential splitting of the semidiscretized equation which fundamentally explains their unconditional stability. Furthermore, we show that optimal schemes are obtained by forcing each scheme's amplification factor to match that of the exact amplification factor. A new second‐order explicit scheme is found for solving the advection equation with the identical amplification factor as the implicit Crank–Nicolson algorithm. Other new schemes for solving the advection–diffusion equation are also derived.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1961–1983, 2014     

Sequential and dynamic frameproof codes

There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes and traitor-tracing schemes. The concept of traitor-tracing has been applied to a digital broadcast setting in the form of dynamic traitor-tracing schemes and sequential traitor-tracing schemes, which could be used to combat piracy of pay-TV broadcasts, for example. In this paper, we extend the properties of frameproof codes to this dynamic model, defining and constructing both l-sequential c-frameproof codes and l-dynamic c-frameproof codes. We also give bounds on the number of users supported by such schemes.      

Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization

In recent years, there has been a growing interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs). Among approaches developed for EAs to deal with DOPs, immigrants schemes have been proven to be beneficial. Immigrants schemes for EAs on DOPs aim at maintaining the diversity of the population throughout the run via introducing new individuals into the current population. In this paper, we carefully examine the mechanism of generating immigrants, which is the most important issue among immigrants schemes for EAs in dynamic environments. We divide existing immigrants schemes into two types, namely the direct immigrants scheme and the indirect immigrants scheme, according to the way in which immigrants are generated. Then experiments are conducted to understand the difference in the behaviors of different types of immigrants schemes and to compare their performance in dynamic environments. Furthermore, a new immigrants scheme is proposed to combine the merits of two types of immigrants schemes. The experimental results show that the interactions between the two types of schemes reveal positive effect in improving the performance of EAs in dynamic environments.     

The Symmetrical Dissipative Difference Schemes for Quasi-Linear Hyperbolic Conservation Laws

In this paper we construct a new type of symmetrical dissipative difference scheme. Except discontinuity these schemes have uniformly second-order accuracy. For calculation using these, the simple-wave is very exact, the shock has high resolution, the programing is simple and the CPU time is economical. Since the paper [1] introduced that in some conditions Lax-Wendroff scheme would converge to nonphysical solution, many researchers have discussed this problem. According to preserving the monotonicity of the solution preserving monotonial schemes and TVD schemes have been introduced by Harten, et. According to property of hyperbolic wave propagation the schemes of split-coefficient matrix (SCM) and split-flux have been formed. We emphasize the dissipative difference scheme, and these schemes are dissipative on arbitrary conditions.     

一阶双曲型方程组初边值问题的差分格式及其稳定性

本文比较系统地讨论了有关数值求解两个自变量的一阶双曲型方程组初边值问题的某些问题,给出了几种能用于任何类型的初边值问题的差分格式,并在很宽的条件下证明了其中的某些变系数的初边值问题的差分格式对初值和边值是稳定的、差分格式所立出的方程组是良态的.其中的某些格式已用于解决某些复杂的实际问题(应用部分见[16]).     

On the General Solution of Coupled Problems: Comparison of Monolithic and Partitioning Approaches

Coupled systems arise whenever there is a dynamic interaction between two or more functionally distinct components. The mathematical model for such a phenomenon consists of a system of coupled partial differential equations (PDE) in space and time, that has to be solved, either analytically or numerically, in order to describe or predict the response of the system under specific conditions. In spite of the natural accuracy of the analytical methods, they are less favourable due to their disability to treat more complex problems. Instead, different numerical schemes have been developed during the last decades, which are specialised to solve various coupled problems. These methods can be divided into two main categories, namely, monolithic and partitioned approaches. The main goal of this work is to study the general ideas behind monolithic and partitioned solution schemes for the pure differentially coupled systems. In the next step, the coupled problem of linear thermoelasticity is considered as benchmark example and the isothermal and isentropic operator-splitting schemes as two typical decoupling methods for this problem are presented. A canonical initial boundary-value problem has also been solved monolithically as well as by using the a.m. operator-splitting schemes and using the acquired results, the efficiency and stability of the methods are compared. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

New mutation schemes for differential evolution algorithm and their application to the optimization of directional over-current relay settings

Differential evolution is a novel evolutionary approach capable of handling non-differentiable, nonlinear and multimodal objective functions. It has been consistently ranked as one of the best search algorithm for solving global optimization problems in several case studies. In the present study we propose five new mutation schemes for the basic DE algorithm. The corresponding versions are termed as MDE1, MDE2, MDE3, MDE4 and MDE5. These new schemes make use of the absolute weighted difference between the two points and instead of using a fixed scaling factor F, use a scaling factor following the Laplace distribution. The performance of the proposed schemes is validated empirically on a suit of ten benchmark problems having box constraints. Numerical analysis of results shows that the proposed schemes improves the convergence rate of the DE algorithm and also maintains the quality of solution. Efficiency of the proposed schemes is further validated by applying it to a real life electrical engineering problem dealing with the optimization of directional over-current relay settings. It is a highly constrained nonlinear optimization problem. A constraint handling mechanism based on repair methods is used for handling the constraints. Once again the simulation results show the compatibility of the proposed schemes for solving the real life problem.     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

Semidirect Products of Association Schemes

In his 1996 work developing the theory of association schemes as a generalized group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation into the entire set of association schemes. We then derive a way to decompose certain association schemes into smaller association schemes. We also investigate to what extent this product helps us to understand and characterize the structure of association schemes. We give some examples to show that the semidirect product produces many schemes that cannot be described as neither the direct product nor the wreath product of smaller schemes.This research was supported by Com²MaC-KOSEF, Korea.     

Proof schemes combined: mapping secondary students’ multi-faceted and evolving first encounters with mathematical proof

In this paper, we propose an enriched and extended application of Harel and Sowder’s proof schemes taxonomy that can be used as a diagnostic tool for characterizing secondary students’ emergent learning of proof and proving. We illustrate this application in the analysis of data collected from 85 Year 9 (age 14–15) secondary students. We capture these students’ first encounters with proof and proving in an educational context (mixed ability, state schools in Greece) where mathematical proof is explicitly present in algebra and geometry lessons and where proving skills are typically expected, and rewarded, in key national examinations. We analyze student written responses to six questions, soon after the students had been introduced to proof and we identify evidence of six of the seven proof schemes proposed by Harel and Sowder as well as a further eight combinations of the six. We observed these combinations often within the response of the same student and to the same item. Here, we illustrate the eight combinations and we claim that a dynamic use of the proof schemes taxonomy that encompasses sole and combined proof schemes is a potent theoretical and pedagogical tool for mapping students’ multi-faceted and evolving competence in, and appreciation for, proof and proving.     

Comparative study of 1D, 2D and 3D simplified gas kinetic schemes for simulation of inviscid compressible flows

With assumption that all the particles in the phase velocity space are concentrated on a circle and on a sphere, the circular function-based gas kinetic scheme and sphere function-based gas kinetic scheme have been developed by Shu and his coworkers [21], [22], [23]. These schemes are simpler than the Maxwellian function-based gas kinetic schemes. The simplicity is due to the fact that the integral domain of phase velocity of circular function and sphere function is a finite region while the integral domain of Maxwellian distribution function is infinite. In this work, the 1D delta function-based gas kinetic scheme is also developed to form a complete set of the simplified gas kinetic schemes. The 1D, 2D and 3D simplified gas kinetic schemes can be viewed as the truly 1D, 2D and 3D flux solvers since they are based on the multi-dimensional Boltzmann equation. On the other hand, to solve the 3D flow problem, the tangential velocities are needed to be approximated by some ways for the 1D and 2D simplified gas kinetic schemes, and to solve the 1D flow problem, the tangential velocities should be taken as zero for the 2D and 3D simplified gas kinetic schemes. The performances of these three schemes for simulation of inviscid compressible flows are investigated in this work by their application to solve the test problems from 1D to 3D cases. Numerical results showed that the efficiency of the delta function-based gas kinetic scheme is slightly superior to that of the circular function- and sphere function-based gas kinetic schemes, while its stability is inferior significantly to the latter. For simulation of the 3D hypersonic flows, the sphere function-based gas kinetic scheme could be the best choice.     

Efficient local structure‐preserving schemes for the RLW‐type equation

The multisymplectic schemes have been used in numerical simulations for the RLW‐type equation successfully. They well preserve the local geometric property, but not other local conservation laws. In this article, we propose three novel efficient local structure‐preserving schemes for the RLW‐type equation, which preserve the local energy exactly on any time‐space region and can produce richer information of the original problem. The schemes will be mass‐ and energy‐preserving as the equation is imposed on appropriate boundary conditions. Numerical experiments are presented to verify the efficiency and invariant‐preserving property of the schemes. Comparisons with the existing nonconservative schemes are made to show the behavior of the energy affects the behavior of the solution.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1678–1691, 2017     

An ideal spline-wavelet family for curve design and editing

Subdivision schemes provide the most efficient and effective way to design and render smooth spatial curves. It is well known that among the most popular schemes are the de Rham–Chaikin and Lane–Riesenfeld subdivision schemes, that can be readily formulated by direct applications of the two-scale (or refinement) sequences of the quadratic and cubic cardinal B-splines, respectively. In more recent works, semi-orthogonal and bi-orthogonal spline-wavelets have been integrated to curve subdivision schemes to add such powerful tools as automatic level-of-detail control algorithm for curve editing and rendering, and efficient simulation processing scheme for global graphic illumination and animation. The objective of this paper is to introduce and construct a family of spline-wavelets to overcome the limitations of semi-orthogonal and bi-orthogonal spline-wavelets for these and other applications, by adding flexibility to the enhancement of desirable characters without changing the sweep of the subdivision spline curve, by providing the shortest lowpass and highpass filter pairs without decreasing the discrete vanishing moments, and by assuring robust stability.     

Suppression of numerically induced chaos with nonstandard finite difference schemes

It has been previously shown that despite its simplicity, appropriate nonstandard schemes greatly improve or eliminate numerical instabilities. In this work we construct several standard and nonstandard finite-difference schemes to solve a system of three ordinary nonlinear differential equations that models photoconductivity in semiconductors and for which it has been shown that integration with a conventional fourth-order Runge-Kutta algorithm produces numerical-induced chaos. It was found that a simple nonstandard forward Euler scheme successfully eliminates these numerical instabilities. In order to help determine the best finite-difference scheme, it was found useful to test the local stability of the scheme by direct inspection of the eigenvalues dependent on the step size.