Modelling Jackson's programming method

The aim of this paper is to present a modelling scheme for programming methods and to illustrate it on Jackson's programming method. We first give a formal semantics to the objects of this method and we model the basic strategy of matching trees in order to build a program structure. In the next section we study how to support a formal development, its automatization, and the building of a formal specification within the scope of our model. Then an example is developed. The last section addresses alternative strategies suggested by the method in order to solve clash problems, where the basic strategy fails. Boundary and ordering clash situations are presented and their strategies are modelled.     

A reinforced movable boundary multiplexing scheme with adaptive interpolation: Modelling and performance evaluation

A novel multiplexing scheme for integrated networks characterized by the coexistence of circuitswitched and packet-switched traffic is described in this paper. The new scheme is realized by a reinforcement of the basic movable boundary hybrid-switching technique, by incorporating an adaptive interpolation within the circuit-switched subsystem. The adaptation mechanism is controlled by the level of congestion in the packet queue. A precise queueing model for the multiplexer is developed and an analytical evaluation of the key performance parameters of interest, namely the loss probability and expected delay of the packet-switched subsystem, and the freeze-out fraction of the circuit-switched subsystem, is conducted. The results of several numerical studies are presented to describe the performance of the multiplexer under different conditions. Of particular significance resulting from these studies is the trade-off between the freeze-out fraction of the circuit-switched subsystem and the loss probability of the packet-switched subsystem; this trade-off may be exploited in a systematic design of the interrated multiplexer tailored to specific applications.     

参数曲线近似弧长参数化的插值方法

本文提出了参数曲线近似弧长参数化的一种插值方法。参数曲线的弧长函数的单调增的，近似弧长参数化可以转化为弧长函数的保单调分段有理线性插值。用这种插值得到的近似弧长参数化曲线插值原曲线上的一组点，最后，两个实例表明了近似弧长参数化曲线能很好地逼近原曲线，且没有所不希望的波动。     

基于九叉树分割的曲面片上点的快速反解算法

本文针对曲面造型中，“由参数样条曲面上点的笛卡尔坐标，反求其对应参数”的反解问题，提出了一种通过曲面快速分割来逼近最终解的快速、简单、可靠的反解算法；并以Ｂ样条参数曲面为例，介绍了算法的实现过程。     

一种电视倍行处理电路的实现

本文成功地设计了包括行重复和行内插在内的倍行处理电路,来抑制和消除行间闪烁及爬行现象,提高图像质量。并通过实验观察了倍行处理的实际效果。     

一类开放DAI系统的动态行为研究

本文针对Ｒｏｓｅｎｓｃｈｅｉｎ合理主体理论中的静态性、局部性等缺陷以及Ｈｕｂｅｒｍａｎ的计算生态学理论中缺乏对单主体的描述等不足加以改进，在对系统进行合理性假设的基础上，引入系统中合理主体与系统的相互作用，进而研究了开放系统的动态性．     

三维Wilson立方体元插值的各向异性

证明了著名的三维Wilson立方体元具有各向异性插值特征，因而可用于任意窄边立方体剖分。并得到了窄边立方体元Wilson元的插值误差。     

非线性样条有限条法及其应用

本文基于完全的增量形式Lagrange描述法,根据虚功原理导出了大挠度弹塑性样条有限条法,用以分析板、壳和薄壁结构与构件的几何与材料非线性问题。本文方法适用于任意边界支承条件和加荷方式,可以计入任意形式的初始缺陷的影响以及沿厚度方向的塑性开展。所给算例表明,该方法具有计算量少.连续性强、精度高、应用广泛等优点.     

一种应用于无线监控网的图像压缩及重建法

采用降低分辨率的方式进一步地降低无线监控图像存储和传输的比特数,然后,在接收端采用垂直瞬间3场调节内插法进行处理,将图像还原,在不损害图像质量的情况下重建原始图像,使得接收端能够获得较清晰的监控图像。该方法比一般的线性内插法具有更好的图像质量,与自适应运动检测控制内插法、基于小波变换的自适应内插法等方法相比,方法更简便易行。     

Splines from a Bayesian point of view

Summary Procedures using splines for estimating values of linear functionals of an unknown function based on finitely many possibly noisy observations of function values are reviewed taking a Bayesian point of view. Interpolation with splines is emphasized as an example of Bayesian numerical analysis, smoothing with splines is presented as interpolation in estimated function values. Extensions of the approach to estimating values of non-linear functionals applied to the unknown function and to estimation subject to linear constaints on the unknown function are discussed. Furthermore, invariance of Bayesian inference to modifications of the prior distribution, resulting from alternative choices of an appropriate function space for estimation, is addressed, too.