Diffusion of Large Nitrogen Bubbles into Tap Water Studied by the Rotary Chamber Technique

The rotary chamber technique allows extended observation times of rising bubbles up into the 10‐mm range. After establishing the technique in combination with optical sizing in previous publications, this work completes the case of nitrogen bubbles in tap water. The rise velocity and the mass transfer are measured for five degrees of water saturation. A one‐parameter model equation involving the Archimedes number is offered for calculation. The limit of the analytical boundary layer model is depicted.     

Kinetics of polyesterification and models, 3. Kinetics and mechanism of pentaerythritol esterification by long-chain carboxylic acids at technological conditions

Kinetics of the esterification of pentaerythritol by long-chain carboxylic acids (C₇ – C₁₈) has been followed by potentiometric titrimetry. A simplified approach for the estimation of the rate constant values and the rate constants of the consecutive processes was developed according to the previous established kinetic law for similar systems. A computer simulation of the component concentrations variation has been carried out in order to prove the selected kinetic model.     

Using static analysis to improve automatic test generation

Conformance testing is still the main industrial validation technique for telecommunication protocols. In practice, the automatic construction of test cases based on finite-state models is hindered by the state explosion problem. We try to reduce its magnitude by using static analysis techniques in order to obtain smaller but equivalent models. Published online: 24 January 2003     

Applied macroinorganics. II. Protonation and heavy metal ions complex-formation behavior of three crosslinked resins of poly(amido-amine) structure

Three resins having a poly(amido-amine) structure have been synthesized. The basicity and complexing ability towards copper(II) have been investigated by potentiometric techniques, and compared with those of the corresponding soluble polymers. The adsorbing capacities of the resins in columns were tested, and a sharp separation between different metal ions is achieved.     

Comparative study of forward and backward test-kinetic simulation approaches

In this paper we perform a comparative study of the forward and backward Liouville mapping applied to the modeling of ring-shaped and non-gyrotropic velocity distribution functions of particles injected in a sheared electromagnetic field. The test-kinetic method is used to compute the velocity distribution function in various areas of a proton cloud moving in the vicinity of a region with a sharp transition of the magnetic field and a non-uniform electric field. In the forward approach the velocity distribution function is computed for a two-dimensional spatial bin, while in the backward approach the distribution function is averaged over a spatial bin with the same size as for the forward method and using a two-dimensional trapezoidal integration scheme. It is shown that the two approaches lead to similar results for spatial bins where the velocity distribution function varies smoothly. On the other hand, with bins covering regions of configuration space characterized by sharp spatial gradients of the velocity distribution function, the forward and backward approaches will generally provide different results.     

面向油田领域的中文真词错误自动校对方法研究

中文真词错误自动校对是自然语言理解的一项重要的基础研究课题,油田数字化过程中利用图像识别及人工录入产生的中文真词错误会直接影响后期数据综合分析准确度。对中文真词错误成因和统计语言模型进行分析,提出一种面向油田领域的中文真词错误自动校对方法。该方法首先构建通用领域和油田领域混淆集,再引入同义词集丰富知识库,对语料分词后,综合统计分析目标词与混淆词、周边词的同义词之间关系,自动校对真词错误。实验表明,提出的方法能有效校对油田领域的中文真词错误。     

Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts

Privacy has traditionally been a major motivation of distributed problem solving. One popular approach to enable privacy in distributed environments is to implement complex cryptographic protocols. In this paper, we propose a different, orthogonal approach, which is to control the quality and the quantity of publicized data. We consider the Open Constraint Programming model and focus on algorithms that solve Distributed Constraint Optimization Problems (DCOPs) using a local search approach. Two such popular algorithms exist to find good solutions to DCOP: DSA and GDBA. In this paper, we propose DSAB, a new algorithm that merges ideas from both algorithms to allow extensive handling of constraint privacy. We also study how algorithms behave when solving Utilitarian DCOPs, where utilitarian agents want to reach an agreement while reducing the privacy loss. We experimentally study how the utilitarian approach impacts the quality of the solution and of publicized data.