A process oriented semantics of the PRAM-language FORK

The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.

In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model.     

A generalized approach to the reconstruction of a restricted class of digitized planar curves

Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised. The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding problem for a class of curves.     

Melt index prediction by weighted least squares support vector machines

Melt index is considered an important quality variable determining product specifications. Reliable prediction of melt index (MI) is crucial in quality control of practical propylene polymerization processes. In this paper a least squares support vector machines (LS‐SVM) soft‐sensor model of propylene polymerization process is developed to infer the MI of polypropylene from other process variables. Considering the use of a SSE cost function without regularization might lead to less robust estimates; the weighted least squares support vector machines (weighted LS‐SVM) approach of propylene polymerization process is further proposed to obtain a robust estimation of melt index. The performance of standard SVM model is taken as a basis of comparison. A detailed comparison research among the standard SVM, LS‐SVM, and weighted LS‐SVM models is carried out. The research results confirm the effectiveness of the presented methods. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 101: 285–289, 2006     

Hydrocarbon exploration risk evaluation through uncertainty and sensitivity analyses techniques

The evaluation of the exploration risk in the oil industry is a fundamental component of the decision process related to the exploratory phase. In this paper the two basic components of the exploratory risk: trap geometry and trapped hydrocarbon quantities (fluid), are compounded in a single coherent uncertainty and sensitivity approach. The results clarify that the model geometry influences each Petroleum System Modeling step and that the geometric uncertainty is correlated with the fluid uncertainty. The geometric uncertainty evaluation makes use of geostatistical techniques that produce a number of possible realizations of the trap geometry, all compatible with available data. The evaluation of the fluid uncertainty, through a Monte Carlo methodology, allows us to compute the possible quantities of oil and gas, generated in a basin and migrated from the hydrocarbon source location to each single trap. The final result is the probability distribution of oil and gas for each trap in the basin, together with other useful indicators like: the hydrocarbon filling probability map, the closure probability map, the drainage area probability map, the spilling paths probabilities, the trap-filling scenarios.     

广义频率响应函数的鲁棒建模新方法

针对基于非线性谱分析的故障诊断技术的需要,研究了非线性系统的广义频率响应函数的鲁棒在线建模方 法。首先将次元分析算法应用于Volterra级数模型的辨识,并通过对此算法的修正,得到了一种改进的Volterra系统的鲁 棒辨识算法。对其鲁棒性能进行的分析表明,改进算法的鲁棒抗噪性能被明显提高。在此基础上,提出了一种广义频率响 应函数的两步鲁棒建模新方法。仿真实验表明,该方法具有良好的鲁棒收敛性能,能够有效解决GFRF的在线建模问题。     

A fictitious domain decomposition method for the solution of partially axisymmetric acoustic scattering problems. Part I: Dirichlet boundary conditions

We present a fictitious domain decomposition method for the fast solution of high‐frequency acoustic scattering problems characterized by a partially axisymmetric sound‐soft scatterer. We apply this method to the solution of various mockup submarine problems, and highlight its computational advantages and intrinsic parallelism. Copyright © 2002 John Wiley & Sons, Ltd.     

信号时域积分性质的一个推广应用

对信号进行运算（卷积运算，傅氏变换，拉纸变换）时，应用时域积分性质，得出由函数导数的运算式求取原函数的相应运算结果的一般性计算公式，使时域积分性质的应用得到推广。     

基于图像的虚拟环境建模技术

综述了基于图像的虚拟现实环境的建模技术，并给出了各种模型表示的理论依据和建模过程的定义。把环境表示分为四类：全景图，光场数据库，深度图像和多投影中心图。全景图的生成包括基于图像相关性和基于图像整合变换的算法。光场数据库的分类主要依据全光函数。同时论述了在各种表示下的采样和建模技术。最后讨论了当前建模技术研究的热点及所需要解决的问题。     

形式化语言在UMTS开发中的应用

由于3G协议规范的复杂性，3GPP方法论指导方针中鼓励使用标准的形式化语言来进行UMTS产品的设计、开发与测试。文中概要性地描述了UMTS的体系结构和在规范描述中用到的一些形式化语言的基本概念和特点，探讨了这些形式化语言在UMTS开发中的应用。使用形式化语言开发UMTS可以简化和改进测试程序，实现新产品与新标准的同步推出。