ON THE PRODUCT OF GATEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.     

广义C-R组的性质及两个边值问题

本文考虑广义C-R组^[1](H)的解f=u iv jw∈C^2的一些性质，提出与之相关的两个边值问题，用积分方程方法和调和函数性质证明了边值问题解的存在唯一性，并写出解的积分表达式．     

Computing Zeta Functions of Kummer Curves via Multiplicative Characters

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of Dwork and Reich. We show, however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota     

Integrability of subdifferentials of directionally Lipschitz functions

Using a quantitative version of the subdifferential characterization of directionally Lipschitz functions, we study the integrability of subdifferentials of such functions over arbitrary Banach space.

     

A subdomain boundary element method for high‐Reynolds laminar flow using stream function‐vorticity formulation

The paper presents a new formulation of the integral boundary element method (BEM) using subdomain technique. A continuous approximation of the function and the function derivative in the direction normal to the boundary element (further ‘normal flux’) is introduced for solving the general form of a parabolic diffusion‐convective equation. Double nodes for normal flux approximation are used. The gradient continuity is required at the interior subdomain corners where compatibility and equilibrium interface conditions are prescribed. The obtained system matrix with more equations than unknowns is solved using the fast iterative linear least squares based solver. The robustness and stability of the developed formulation is shown on the cases of a backward‐facing step flow and a square‐driven cavity flow up to the Reynolds number value 50 000. Copyright © 2004 John Wiley & Sons, Ltd.     

用格林函数法计算量子点中的应变分布

自组装量子点材料作为一种新型的光电材料无论在理论和实际应用都成为当今物理学界的研 究热点.由GaAs包围的InAs小岛，由于较大的晶格失配（≈-0.067），应变效应在量子点 的 形成过程中起主导作用.大部分计算量子点结构应变分布的方法都是基于数值解法，需要大 量的计算工作.给出用格林函数法推导各种常见形状量子点应变分布的解析表达式详细过程，讨论了弹性各向异性和形状各向异性对量子点应变分布的影响程度.结果表明对于不 同形状量子点结构中主要部分的应变分布都是相似的，流体静压变部分的特征值随量子点形状的变化不 关键词： 自组装量子点 格林函数 应变分布     

能动反射镜低频像差补偿能力分析

 采用Algor软件包并利用有限元法对37单元能动反射镜低频误差补偿能力进行了分析计算，确定了镜面厚度8mm，驱动器间距46mm，极头直径12mm等能动反射镜制造的关键参数。通过计算机仿真分析证明，基于这些参数所设计的能动反射镜可以对低频误差进行有效校正，校正精度的均方根值小于等于λ／８，从而可以为能动反射镜的制造提供理论依据。     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...