A fast method for choosing the optimum extrapolation parameter for an e.a.d.i. scheme

This paper describes a fast method for choosing the optimum extrapolation parameter ω in an Extrapolated Alternating Direction Implicit (E.A.D.I.) Scheme, for the numerical solution of elliptic partial differential equations. An analysis is presented to show that in the case that the acceleration parameter r is varied, a set of values for the extrapolation parameter ω could be defined. The optimum value of ω is easily obtained from this set. A numerical example demonstrates the applicability of the proposed method.     

COMPUTER-MOVIE的设计与实现技术

COMPUTER MOVIE是一个适用于PC系列微机的计算机教学动画演示系统,可应用于计算机原理、计算机系统结构、微型计算机等课程的教学。本文论述了该系统的构成以及在该系统中采用的一系列作图技术,包括:实现结构化图形实体移动的方法、“面向图形实体/事件驱动/自然遮挡”动画作图法、菜单、背景色调整、相对坐标和大小的采用、多条同时动态延伸线的画法等。这些技术适用于各种教学动画软件的设计与实现。     

基于CompactLogix和现场总线的过程控制系统

对过程控制中的集散控制系统DCS与现场总线控制系统FCS进行了比较,详细阐述了基于Rockwell Automation的现场总线技术DeviceNet的网络控制方法,并通过PID算法编程与监控软件开发,实现了基于CompactLogix控制器与DeviceNet现场总线的过程控制系统。     

基于嵌入式系统的网络化自动抄表系统

设计基于嵌入式系统的网络化自动抄表系统,并着重阐述系统的硬件、软件构成和设计特点。该系统可用于建筑中电、水、气、热等仪表数据的采集和住户耗能设备的控制。自动抄表有利于能量管理部门实现能源的监控管理,提高能源使用效益,对于中国的可持续发展具有非常重要的意义。     

KANTBP: A program for computing energy levels, reaction matrix and radial wave functions in the coupled-channel hyperspherical adiabatic approach

A FORTRAN 77 program is presented which calculates energy values, reaction matrix and corresponding radial wave functions in a coupled-channel approximation of the hyperspherical adiabatic approach. In this approach, a multi-dimensional Schrödinger equation is reduced to a system of the coupled second-order ordinary differential equations on the finite interval with homogeneous boundary conditions of the third type. The resulting system of radial equations which contains the potential matrix elements and first-derivative coupling terms is solved using high-order accuracy approximations of the finite-element method. As a test desk, the program is applied to the calculation of the energy values and reaction matrix for an exactly solvable 2D-model of three identical particles on a line with pair zero-range potentials.

Program summary

Program title: KANTBPCatalogue identifier: ADZH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZH_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 4224No. of bytes in distributed program, including test data, etc.: 31 232Distribution format: tar.gzProgramming language: FORTRAN 77Computer: Intel Xeon EM64T, Alpha 21264A, AMD Athlon MP, Pentium IV Xeon, Opteron 248, Intel Pentium IVOperating system: OC Linux, Unix AIX 5.3, SunOS 5.8, Solaris, Windows XPRAM: depends on (a) the number of differential equations; (b) the number and order of finite-elements; (c) the number of hyperradial points; and (d) the number of eigensolutions required. Test run requires 30 MBClassification: 2.1, 2.4External routines: GAULEG and GAUSSJ [W.H. Press, B.F. Flanery, S.A. Teukolsky, W.T. Vetterley, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1986]Nature of problem: In the hyperspherical adiabatic approach [J. Macek, J. Phys. B 1 (1968) 831-843; U. Fano, Rep. Progr. Phys. 46 (1983) 97-165; C.D. Lin, Adv. Atom. Mol. Phys. 22 (1986) 77-142], a multi-dimensional Schrödinger equation for a two-electron system [A.G. Abrashkevich, D.G. Abrashkevich, M. Shapiro, Comput. Phys. Comm. 90 (1995) 311-339] or a hydrogen atom in magnetic field [M.G. Dimova, M.S. Kaschiev, S.I. Vinitsky, J. Phys. B 38 (2005) 2337-2352] is reduced by separating the radial coordinate ρ from the angular variables to a system of second-order ordinary differential equations which contain potential matrix elements and first-derivative coupling terms. The purpose of this paper is to present the finite-element method procedure based on the use of high-order accuracy approximations for calculating approximate eigensolutions for such systems of coupled differential equations.Solution method: The boundary problems for coupled differential equations are solved by the finite-element method using high-order accuracy approximations [A.G. Abrashkevich, D.G. Abrashkevich, M.S. Kaschiev, I.V. Puzynin, Comput. Phys. Comm. 85 (1995) 40-64]. The generalized algebraic eigenvalue problem AF=EBF with respect to pair unknowns (E,F) arising after the replacement of the differential problem by the finite-element approximation is solved by the subspace iteration method using the SSPACE program [K.J. Bathe, Finite Element Procedures in Engineering Analysis, Englewood Cliffs, Prentice-Hall, New York, 1982]. The generalized algebraic eigenvalue problem (A−EB)F=λDF with respect to pair unknowns (λ,F) arising after the corresponding replacement of the scattering boundary problem in open channels at fixed energy value, E, is solved by the LDLT factorization of symmetric matrix and back-substitution methods using the DECOMP and REDBAK programs, respectively [K.J. Bathe, Finite Element Procedures in Engineering Analysis, Englewood Cliffs, Prentice-Hall, New York, 1982]. As a test desk, the program is applied to the calculation of the energy values and reaction matrix for an exactly solvable 2D-model of three identical particles on a line with pair zero-range potentials described in [Yu. A. Kuperin, P.B. Kurasov, Yu.B. Melnikov, S.P. Merkuriev, Ann. Phys. 205 (1991) 330-361; O. Chuluunbaatar, A.A. Gusev, S.Y. Larsen, S.I. Vinitsky, J. Phys. A 35 (2002) L513-L525; N.P. Mehta, J.R. Shepard, Phys. Rev. A 72 (2005) 032728-1-11; O. Chuluunbaatar, A.A. Gusev, M.S. Kaschiev, V.A. Kaschieva, A. Amaya-Tapia, S.Y. Larsen, S.I. Vinitsky, J. Phys. B 39 (2006) 243-269]. For this benchmark model the needed analytical expressions for the potential matrix elements and first-derivative coupling terms, their asymptotics and asymptotics of radial solutions of the boundary problems for coupled differential equations have been produced with help of a MAPLE computer algebra system.Restrictions: The computer memory requirements depend on:

•

(a) the number of differential equations;

•

(b) the number and order of finite-elements;

•

(c) the total number of hyperradial points; and

•

(d) the number of eigensolutions required.

Restrictions due to dimension sizes may be easily alleviated by altering PARAMETER statements (see Long Write-Up and listing for details). The user must also supply subroutine POTCAL for evaluating potential matrix elements. The user should supply subroutines ASYMEV (when solving the eigenvalue problem) or ASYMSC (when solving the scattering problem) that evaluate the asymptotics of the radial wave functions at the right boundary point in case of a boundary condition of the third type, respectively.Running time: The running time depends critically upon:

•

(a) the number of differential equations;

•

(b) the number and order of finite-elements;

•

(c) the total number of hyperradial points on interval [0,ρmax]; and

•

(d) the number of eigensolutions required.

The test run which accompanies this paper took 28.48 s without calculation of matrix potentials on the Intel Pentium IV 2.4 GHz.     

Circular Separability of Polygons

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/ or line constraints. The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines. Received October 25, 1998; revised April 21, 1999.     

利用Remoting技术实现分布式系统的开发

运用.NET Remoting进行分布式应用程序开发不仅提高开发效率,而且具有开发的简单性和系统的灵活性,特别是在局域网内运用TCP进行数据传输可以提高数据传输效率.本文介绍了.NET Remoting的体系结构,提出基于.NET Remoting的分布式应用程序的开发方法,并详细论述了在Visual Studio .NET中实现该方法的过程.     

Classification and Uncertainty Visualization of Dendritic Spines from Optical Microscopy Imaging

Neuronal dendrites and their spines affect the connectivity of neural networks, and play a significant role in many neurological conditions. Neuronal function is observed to be closely correlated with the appearance, disappearance and morphology of the spines. Automatic 3‐D reconstruction of neurons from light microscopy images, followed by the identification, classification and visualization of dendritic spines is therefore essential for studying neuronal physiology and biophysical properties. In this paper, we present a method to reconstruct dendrites using a surface representation of the dendrite. The 1‐D skeleton of the dendritic surface is then extracted by a medial geodesic function that is robust and topologically correct. This is followed by a Bayesian identification and classification of the spines. The dendrite and spines are visualized in a manner that displays the spines' types and the inherent uncertainty in identification and classification. We also describe a user study conducted to validate the accuracy of the classification and the efficacy of the visualization.     

Numerical approximation of the Ginzburg-Landau equation with memory effects in the dynamics of phase transitions

We consider the out-of-equilibrium time evolution of a nonconserved order parameter using the Ginzburg-Landau equation including memory effects. Memory effects are expected to play important role on the nonequilibrium dynamics for fast phase transitions, in which the time scales of the rapid phase conversion are comparable to the microscopic time scales. We consider two numerical approximation schemes based on Fourier collocation and finite difference methods and perform a numerical analysis with respect to the existence, stability and convergence of the schemes. We present results of direct numerical simulations for one and three spatial dimensions, and examine numerically the stability and convergence of both approximation schemes.     

Dynamics of the deconfinement transition of quarks and gluons in a finite volume

We employ finite elements methods for the approximation of solutions of the Ginzburg-Landau equations describing the deconfinement transition in quantum chromodynamics. These methods seem appropriate for situations where the deconfining transition occurs over a finite volume as in relativistic heavy ion collisions, where in addition expansion of the system and flow of matter are important. Simulation results employing finite elements are presented for a Ginzburg-Landau equation based on a model free energy describing the deconfining transition in pure gauge SU(2) theory. Results for finite and infinite system are compared.     

用ASP.NET构建电子邮件发送系统

本文分析了.NET Framework的System.Web.Mail名称空间中主要类以及其属性和方法,并给出了以此来构建电子邮件发送系统的步骤和部分实例代码.     

GMCADS系统的研究及应用

当今,机械CAD向CAD/CAM/CAE集成化方向发展,机械系统运动学/动力学分析软件是集成化CAD/CAM/CAE不可缺少的支撑软件之一。我们以多刚体系统动力学为基本理论,研制了面向问题的、交互式的通用机械计算机辅助设计系统GMCADS。本文介绍了GMCADS系统的分析原理、图形输出技术,并给出了应用实例。     

Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks

State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms such as K-ring analysis a challenge. This paper proposes an algorithm to improve the efficiency of ring analysis of large graphs, exploiting properties of K-rings and spatial correlations of vertices in the graph. The algorithm uses dual-tree expansion (DTE) and spatial hash-function tagging (SHAFT) to optimize computation and memory access. Numerical tests show nearly perfect linear scaling of the algorithm. Also a parallel implementation of the DTE + SHAFT algorithm achieves high scalability. The algorithm has been successfully employed to analyze large MD simulations involving up to 500 million atoms.     

离散系统的一种从模型取状态鲁棒MRAC方案

本文对具有可测扰动的离散系统提出了一种从模型取状态的鲁棒模型参考自适应控制ＭＲＡＣ（模型参考自适应控制）新算法。     

Deconvolution problems and superresolution in Hilbert-transform spectroscopy based on a.c. Josephson effect

The analysis of the numerical aspects of Hilbert transform spectroscopy based on the a.c. Josephson effect is presented. The resolving power of Hilbert transform spectroscopy is determined by such factors as the linewidth of the Josephson oscillations (intrinsic or natural resolution limit) and the limitation of the measurement interval (extrinsic or technical resolution limit) like in any spectroscopic technique based on some integral transformations. The deconvolution problem in Hilbert transform spectroscopy is posed and its solution is considered using the approach of the 1st kind integral equation for the spectrum of the incident radiation constructed from the input data of the Hilbert transform spectroscopy—the ‘hilbertogram’. The program package RECOVERY based on the maximum likelihood method is used for this purpose. This method allows to attain the maximum possible resolution enhancement in output result for a given signal-to-noise ratio in the input experimental data. The samples of numerical simulations and the spectrum of frequency-modulated BWO radiation measured by means of the Josephson junction made from high-T_c superconductor are presented. It is shown also that the integral equation approach allows to recover the sought spectrum beyond the intrinsic resolution limit and to achieve the superresolution.     

Stochastic optimization for the calculation of the time dependency of the physiological demand during exercise and recovery

The stochastic optimization method ALOPEX IV is successfully applied to the problem of estimating the time dependency of the physiological demand in response to exercise. This is a fundamental and unsolved problem in the area of exercise physiology, where the lack of appropriate tools and techniques forces the assumption and the use of a constant demand during exercise. By the use of an appropriate partition of the physiological time series and by means of stochastic optimization, the time dependency of the physiological demand during heavy intensity exercise and its subsequent recovery is, for the first time, revealed.     

Stochastic optimization for modeling physiological time series: application to the heart rate response to exercise

Stochastic optimization is applied to the problem of optimizing the fit of a model to the time series of raw physiological (heart rate) data. The physiological response to exercise has been recently modeled as a dynamical system. Fitting the model to a set of raw physiological time series data is, however, not a trivial task. For this reason and in order to calculate the optimal values of the parameters of the model, the present study implements the powerful stochastic optimization method ALOPEX IV, an algorithm that has been proven to be fast, effective and easy to implement. The optimal parameters of the model, calculated by the optimization method for the particular athlete, are very important as they characterize the athlete's current condition. The present study applies the ALOPEX IV stochastic optimization to the modeling of a set of heart rate time series data corresponding to different exercises of constant intensity. An analysis of the optimization algorithm, together with an analytic proof of its convergence (in the absence of noise), is also presented.