Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

试析仲裁简易程序的适用条件

虽然我国各仲裁委员会在实践中大量适用仲裁简易程序,但我国法学理论界却很少对其时代内涵进行界定,对其适用条件也缺乏探讨,因而制约了仲裁简易程序的研究和发展。本文在分析仲裁简易程序时代内涵的基础上,从主观条件和客观条件两方面对仲裁简易程序的适用条件进行了探讨,建议规范我国仲裁简易程序的适用条件,实现仲裁简易程序的和谐价值取向。     

碳纳米管阵列、捆束的三步升温工艺制备及其形貌与结构

使用结构简单的单温炉设备，通过三步升温热解二茂铁、三聚氰氨混合物方法，在二氧化硅、多晶陶瓷基底上分别合成了碳纳米管阵列、碳纳米管捆束.使用扫描电子显微镜、透射电子显微镜、电子能量损失谱和x射线光电子能谱对合成样品进行了结构和成分分析.结果显示：两种基底上合成的纳米管均为多壁纯碳管；生长于光滑二氧化硅表面的碳纳米管具有高度取向性和一致的外径，长度为10—40μm.碳纳米管采取催化剂顶端生长模式并展示出类杯状形貌；生长于粗糙多晶陶瓷表面的碳纳米管捆束随机取向，碳纳米管直径为15—80nm，长度在几百微米，展示 关键词： 碳纳米管 热解法 三步升温工艺     

存储过程在ASP/ADO中的应用

使用存储过程可以优化对数据库的访问，本文详细介绍存储过程在ASP／ADO中的应用，并通过一个实例说明如何在ASP页面中使用存储过程。     

逼近严格伪压缩映象不动点的Ishikawa迭代程序

Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

曲棍球赛场技战术的计算机分析系统

介绍在ＩＢＭ－ＰＣ／ＸＴ计算机上实现的曲棍球赛场统计系统的研制过程、设计思想、采用的方法、软件设计与功能、技术指标操作步骤以及使用效果。     

基于C/S结构的机房管理系统的设计与实现

介绍了机房管理系统的设计方法，给出了工作流程和功能模块以及出入口管理的功能和实现技术．