SN方法粒子输运计算程序自动建模关键技术问题研究

在充分调研和分析SN方法粒子输运计算程序自动建模方法的基础上，对建模过程中的模型文件格式识别、属性编辑、空腔处理及自动划分离散网格等关键技术问题进行了研究，并提出了合理可行的解决方法。通过对SNAM程序建模部分功能测试，验证了这些方法的正确性和有效性。This paper presents two approaches to enhance the geometry modeling ability of SN particle transport simulation codes and focus on the key issues that lie in the processing from CAD model to SN code geometry model, e.g. CAD file format support, void modeling, mesh generation and model-editing. SNAM （SN Automatic Modeling system） has been developed as an interface code between commercial CAD software and SN particle transport simmulation codes. The testing results have shown that the algorithm and implementation used in SNAM are efficient and capable of all the necessary processing from CAD model to SN geometry model.     

DFT Study on Some Properties of Polybrominated Phenoxathiin 10-Oxides

With the B3LYP calculation method of density functional theory(DFT)and the 6-31G* basis set,full optimization calculation was made for phenoxathiin10-oxide(PTO)and 135 polybromine phenoxathiin 10-oxides(PBPTOs)with the Gaussian 03 program and molar heat capacity in constant volume(CVθ)value of each molecule in the standard state was obtained.The relation between CVθ and the substitution position and number of bromine atom(NPBS)was studied,and the results indicated good correlation(R2 = 1.000)between CVθ and NPBS of PBPTO compounds.Based on the output file of Gaussian 03 program,molar heat capacity at constant pressure(Cp,m)of PBPTO compounds from 200 to 1,000 K was calculated with the statistical thermodynamics program,and the correlation equation between Cp,m and temperature(T,T-1 and T-2)was obtained with the least-squares method,and the correlation coefficient of the correlation equation(R2)was 1.000.In addition,based on the partition function of each molecule calculated by vibration analysis,the relative rate constant of formation of each molecule was calculated.     

Multilinear Commutators of θ-Type Calderón-Zygmund Operators on Non-Homogeneous Metric Measure Spaces

In this paper, the boundedness in Lebesgue spaces of commutators and multilinear commutators generated by θ-type Calderón-Zygmund operators with RB MO(μ) functions on non-homogeneous metric measure spaces is obtained.     

The automatic control of boundary-layer transition — Experiments and computation

In recent years there has been an increasing interest in the control of boundary-layer transition through the use of wall suction. In the current work suction is provided through one or more suction panels situated close to the leading edge of a plate. Experiments show that boundary-layer pressure fluctuation measurements can be used to identify the position of transition. Transition can be maintained at a desired location with minimum power consumption by employing an automatic adaptive feedback control loop which regulates the suction flow rates of two independent suction panels. This can be expressed as a constrained optimization problem. To allow the suction flow rates to be updated, a modified least mean squares algorithm is used within the control loop. Experimental measurements show that the control algorithm allows fast and stable convergence towards the optimum suction distribution for a double suction panel configuration. Numerical simulations have also been performed. The two-dimensional boundary layer was calculated allowing the viscous boundary layer to interact with the inviscid outer flow. Following linear stability theory the spatial growth rates are calculated by solving an Orr-Sommerfeld type eigenvalue problem, with the streamwise location of transition predicted via thee ^N -method. Applying the same optimization strategy as in the experiments, good qualitative agreement between computations and experiments was found. The optimization algorithm has been applied to computer models where the relation between suction flow rates and transition location is described by an empirical analytical function. This shows that the controller can in principle be applied to systems with more than two suction panels.Nomenclature b transition location with zero suction - d desired transition location - e(k) error signal - k iteration index - p rms pressure - p _ref reference rms pressure - r sum of the reference pressure - u streamwise velocity - u _e external velocity - inviscid external velocity - A wave amplitude - F( ) cost function - I identity matrix - N maximum amplification factor - P projection matrix - R Reynolds number - Re Reynolds number based on the boundary-layer thickness - R matrix of weights - Tu turbulence level - vector of suction flow rates - v normal velocity - v _wall suction velocity at the surface - x streamwise coordinates - x _m microphone location - x _T(k) measured transition location - y normal coordinate - y(k) sum of the measured pressures - w(k) noise - plate length - r +i _i - free stream velocity - * displacement thickness - gradient vector - Lagrange multiplier - controller gain - disturbance stream function - disturbance amplitude - wave frequency = complex wave number     

Symmetric duality with (p, r) − ρ − (η, θ)-invexity

In this paper we introduce a new type of generalized invex function, called (p, r) − ρ − (η, θ)-invex function and study symmetric duality results under these assumptions. In our study the nonnegative orthants for the constraints are replaced by closed convex cones and their polars. We establish weak and strong duality theorems under (p, r) − ρ − (η, θ)-invexity assumptions for the symmetric dual problems. We also give many examples to justify our results.     

Reconstruction of Less Regular Conductivities in the Plane

Abstract

We consider the inverse conductivity problem of how to reconstruct an isotropic electric conductivity distribution in a conductive body from static electric measurements on the boundary of the body. An exact algorithm for the reconstruction of a conductivity in a planer domain from the associated Dirichlet-to-Neumann map is given. We assume that the conductivity has essentially one derivative, and hence we improve earlier reconstruction results. The method relies on a reduction of the conductivity equation to a first order system, to which the ?¯-method of inverse scattering theory can be applied.     

Removable edges in a 5-connected graph and a construction method of 5-connected graphs

An edge e of a k-connected graph G is said to be a removable edge if G?e is still k-connected. A k-connected graph G is said to be a quasi (k+1)-connected if G has no nontrivial k-separator. The existence of removable edges of 3-connected and 4-connected graphs and some properties of quasi k-connected graphs have been investigated [D.A. Holton, B. Jackson, A. Saito, N.C. Wormale, Removable edges in 3-connected graphs, J. Graph Theory 14(4) (1990) 465-473; H. Jiang, J. Su, Minimum degree of minimally quasi (k+1)-connected graphs, J. Math. Study 35 (2002) 187-193; T. Politof, A. Satyanarayana, Minors of quasi 4-connected graphs, Discrete Math. 126 (1994) 245-256; T. Politof, A. Satyanarayana, The structure of quasi 4-connected graphs, Discrete Math. 161 (1996) 217-228; J. Su, The number of removable edges in 3-connected graphs, J. Combin. Theory Ser. B 75(1) (1999) 74-87; J. Yin, Removable edges and constructions of 4-connected graphs, J. Systems Sci. Math. Sci. 19(4) (1999) 434-438]. In this paper, we first investigate the relation between quasi connectivity and removable edges. Based on the relation, the existence of removable edges in k-connected graphs (k?5) is investigated. It is proved that a 5-connected graph has no removable edge if and only if it is isomorphic to K₆. For a k-connected graph G such that end vertices of any edge of G have at most k-3 common adjacent vertices, it is also proved that G has a removable edge. Consequently, a recursive construction method of 5-connected graphs is established, that is, any 5-connected graph can be obtained from K₆ by a number of θ⁺-operations. We conjecture that, if k is even, a k-connected graph G without removable edge is isomorphic to either K_k+1 or the graph H_k/2+1 obtained from K_k+2 by removing k/2+1 disjoint edges, and, if k is odd, G is isomorphic to K_k+1.     

二维直方图θ划分最大Shannon熵图像阈值分割

鉴于常用二维直方图区域直分法存在错分,最近提出的斜分法不具普遍性,提出了适用面更广的基于二维直方图θ划分和最大Shannon熵的图像阈值分割算法.首先给出了二维直方图θ划分方法,采用四条平行斜线及一条其法线与灰度级轴成θ角的直线划分二维直方图区域,按灰度级和邻域平均灰度级的加权和进行阈值分割,斜分法可视为该方法中θ=45°的特例;然后导出了二维直方图θ-划分最大Shannon熵阈值选取公式及其快速递推算法;最后给出了θ取不同值时的分割结果及运行时间,θ取较小值时,边界形状准确性较高,θ取较大值时,抗噪性较强,应用时可根据实际图像特点及需求合理选取θ的值.与常规二维直方图直分最大Shannon熵法相比,本文提出的方法所得分割结果更为准确,抵抗噪声更为稳健,且所需运行时间及存储空间也大为减小.     

The split-step θ-methods for stochastic delay Hopfield neural networks

In this paper, we construct a new split-step numerical method for stochastic delay Hopfield neural networks. The main aim of this paper is to investigate the mean-square stability of this split-step θ-methods for stochastic delay Hopfield neural networks. It is proved that the split-step θ-methods are mean-square stable under suitable conditions. Numerical experiments verify the numerical stability results obtained from theory. A comparison between this work and Ronghua et al. [8] is also discussed in the example.