Electron beam induced modification of poly(ethylene terephthalate) films

Electron beam processing of poly(ethylene terephthalate) (PET) films is found to promote significant changes in the melting heat, intrinsic viscosity and polymer film-liquid (water, isooctane and toluene) boundary surface tension. These properties are featured with several maximums depending on the absorbed dose and correlating with the modification of PET surface functionality. Studies using adsorption of acid-base indicators and IR-spectroscopy revealed that the increase of PET surface hydrophilicity is determined by the oxidation of methylene and methyne groups. Electron beam treatment of PET films on the surface of N-vinylpyrrolidone aqueous solution provided graft copolymerization with this comonomer at optimum process parameters (energy 700 keV, current 1 mA, absorbed dose 50 kGy).     

Determining Modes for Continuous Data Assimilation in 2D Turbulence

We study the number of determining modes necessary for continuous data assimilation in the two-dimensional incompressible Navier–Stokes equations. Our focus is on how the spatial structure of the body forcing affects the rate of continuous data assimilation and the number of determining modes. We treat this problem analytically by proving a convergence result depending on the H ^–1 norm of f and computationally by considering a family of forcing functions with identical Grashof numbers that are supported on different annuli in Fourier space. The rate of continuous data assimilation and the number of determining modes is shown to depend strongly on the length scales present in the forcing.     

Long‐range dependence and performance in telecom networks

Telecommunications systems have recently undergone significant innovations. These call for suitable statistical models that can properly describe the behaviour of the input traffic in a network. Here we use fractional Brownian motion (FBM) to model cumulative traffic network, thus taking into account the possible presence of long‐range dependence in the data. A Bayesian approach is devised in such a way that we are able to: (a) estimate the Hurst parameter H of the FBM; (b) estimate the overflow probability which is a parameter measuring the quality of service of a network: (c) develop a test for comparing the null hypothesis of long‐range dependence in the data versus the alternative of short‐range dependence. In order to achieve these inferential results, we elaborate an MCMC sampling scheme whose output enables us to obtain an approximation of the quantities of interest. An application to three real datasets, corresponding to three different levels of traffic, is finally considered. Copyright © 2004 John Wiley & Sons, Ltd.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Local Existence and Continuation Criterion for Solutions of the Spherically Symmetric Einstein-Vlasov-Maxwell System

Using the iterative scheme we prove the local existence and uniqueness of solutions of the spherically symmetric Einstein-Vlasov-Maxwell system with small initial data. We prove a continuation criterion to global in-time solutions.     

用反射法自动测量大尺寸样品的折射率分布

针对大尺寸样品的折射率分布测量,引入自动扫描装置和适时数据处理系统,研究出一种高灵敏度的智能化反射法折射率分布测量仪,可进行快速、自动、准确的折射率分布测量.经理论分析和实验研究提出了一套合理的实验数据处理方法.并具体介绍和详尽分析了实验装置,讨论了有关理论和实验误差,给出了消除各种误差的有效方法,最终得出较为理想的实验结果.     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.     

Observation on meta-stability of thulium nitrate crystal by using electric measurements

Frequency dependence of ac conductivity from 1 to 10⁵ Hz and time series of the conductivity at 2 kHz were measured along c-axis of thulium nitrate crystal, Tm(NO₃)₃6H₂O at temperatures from 203.15 to 293.15 K. The meta-stability was observed. The frequency spectra of the conductivity were similar to those in disorder system. Aging effect was observed. Non-periodic instability (burst) was found. Non-linear dynamical property was characterized by 1/f noise spectrum, limit cycle in return map and dependence of correlation exponent on embedding dimension.     

大焦深成像系统仿真实验研究

如何增大非相干光学成像系统的焦深是应用光学研究领域的热点问题.本文对采用高次非球面光学掩模板与图像处理相结合增大成像光学系统焦深的新方法进行了深入分析,建立了大焦深成像系统仿真实验模型,并进行了大焦深成像系统仿真实验.实验结果证明了该方法在维持原相对孔径的同时使光学系统在较大的离焦范围内有好的成像质量.实际应用中还要综合考虑模板参量、信噪比等关键因素.