Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

On the excitation of a closely spaced array by a line source

An infinite row of periodically spaced, identical rigid circularcylinders is excited by an acoustic line source which is parallelto the generators of the cylinders. A method for calculatingthe scattered field accurately and efficiently is presented.When the cylinders are sufficiently close together, Rayleigh–Blochsurface waves that propagate energy to infinity along the arrayare excited. An expression is derived which enables the amplitudesof these surface waves to be computed without requiring thesolution to the full scattering problem.     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

Contact angle hysteresis of liquid drops as means to measure adhesive energy of zein on solid substrates

Adhesion of zein to solid substrates has been studied using surface energy profiles as indices and by adhesion mapping using atomic force microscopy (AFM). Different plasticizers like glycerol and sorbitol have been used to form mixed films with zein and properties of these films are studied using surface energy profiles. Comparison of the results from the different mixed samples with those from the pure zein films showed that force mapping could identify areas rich in protein. The adhesion maps produced were deconvoluted from sample topography and contrasted with the data obtained from contact angle measurements. A comparison of the two methods shows that the extent of contact angle hysteresis is indicative of both hydrophobicity of the surface as well as the force of adhesion. Mechanical properties and microstructure of zein films prepared by casting from solutions and using Langmuir-Blodgett film technique have been investigated. Pure zein seemed brittle and exhibited an essentially linear relationship between stress and strain. Films with plasticizer were tougher than these films. In general, mixed films showed better mechanical properties than pure films and had higher ultimate tensile strength and increased per cent elongation. Further, the mixed films of zein showed a higher force of adhesion compared to the pure films.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

Exceptional set of a representation with fractional powers

We prove that for any given c, 1 < c < 17/11, almost all natural numbers are representable in the form [x ^c] + [p ^c], where x is a natural number and p is a prime.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

Numerical calculations of temperature distribution of double layer metallic surface treated by laser beams

A mathematical model of laser beam treatment of double layer alloys (Ni/Fe, Al/Fe and Cr/Fe systems) describing the effect of laser beam on different physical and geometrical parameters of coated layer system has been adapted. The numerical solutions of the non-homogeneous heat-transport differential equation could estimate the temperature of the treated region.The suggested model allows investigation of the temperature distribution as a function of treated surface and laser parameters. The physical parameters of the treated materials were taken as functions of temperature due to the change in the temperature of the treated double layer materials.     

2‐connected 7‐coverings of 3‐connected graphs on surfaces

An m‐covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most 6k ? 12 vertices of degree 7. We also construct, for every surface F² with Euler genus k ≥ 2, a 3‐connected graph G on F² with arbitrarily large representativity each of whose 2‐connected 7‐coverings contains at least 6k ? 12 vertices of degree 7. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 26–36, 2003