ON THE SINGULAR DIRECTIONS OF VALUE DISTRIBUTION OF HOLOMORPHIC CURVES IN P^n（C）

This article proves the existence of singular directions of value distribution theory for some transcendental holomorphic curves in the n-dimensional complex projective space Pn(C). An example is given to complement these results.     

The flow of a variable viscosity fluid between parallel plates with shear heating

A model for the flow of a fluid through a channel with parallel plates is investigated. The channel is narrow, so that the lubrication approximation may be applied. The channel walls are maintained at a constant temperature. Shear heating effects are included and the fluid viscosity decreases exponentially with temperature. When the flow is driven solely by shear stress or imposed velocity at the top, analytical progress is possible. When pressure gradient also drives the flow the problem is solved numerically.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

模式评价理论模型及其应用

基于事前评价过程和自然界生物进化过程的相似性，提出了系统结构、系统结构模式和系统环境模式矩阵的概念，并根据系统结构、系统结构模式与系统环境模式矩阵的适应程度，建立了模式评价决策模型，制定了评价系统的评价分类准则，并对评价系统作了一定的理论分析．将此模型和方法应用于城市生态安全评价中，通过与模糊综合评价法的比较，表明了该评价模型和方法的优越性．     

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     

Coverage dependent magnetic properties of Co chain-coated carbon nanotube

Magnetic properties of Co chain-coated carbon nanotube (CNT) were investigated using a first-principles calculation. Binding energy between Co chain and CNT increased with the coverage ratio, and the adsorption of Co chains on CNT enhanced the conductance channel. Total magnetic moment of Co chains coated on CNT increased with the coverage ratio, while the magnetic moment per Co atom decreased due to spin flip of majority spin states in Co atoms. Spin polarization at the Fermi level of the Co chains was calculated to converge to that of bulk fcc Co.     

Difference discrete connection and curvature on cubic lattice Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differential calculus on the lattice. One of the definitions can be extended to the case over the random lattice. We also discuss the relation between our approach and the lattice gauge theory and apply to the discrete integrable systems.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

Plasticity field adjacent to faces of asperities on a rotating roll after initial indentation into a half-space

The plastic deformation field near the horizontal surface of a half space of perfectly plastic material associated with an indenting rotating rigid tooth is studied using slip line theory. The tooth is one of many on a roll surface and indents first into the half-space material and then rotates about the roll center. A slip line field is proposed for the deforming plastic region and a solution scheme is outlined. The emphasis is on determining the shape of the deforming region, especially that of the free surface. The study has a potential application in roughness transfer in metal forming processing.