ALGOL 68评价

J.C.Boussard,J.J.Duby(编者),J.Andre,H.Bekie,M.Berthand,5.Brehinier,五度.Griffiths,Ph.Jorrand,C.H.A.Koster,M.Nieolas,J.C.Pailla几d. C.Pain,D.Peeeoud,M.51刀tzoff,P.丫Voden.ALGOL 68评价     

Admission Control Algorithm for Guaranteeing Real-Time Anycast Flow

［1］S. Deering,R. Hinden. Internet Protocol version 6(Ipv6)specification, RFC2460, Dec. 1998 ［2］R. Hinde, S. Derring. IP Version 6 Addressing Architecture,RFC 1884, Dec. 1995 ［3］S. Bhattacharjee, M. H. Ammar, E. W. Zegura, V. Shah,Z.Fei. Application-Laye     

Editorial Board

Editor-in-ChiefGuo-Jie Li lig@ict.ac.cn Institute of Computing Technology, The Chinese Academy of Sciences (CAS)Associate Editors-in-ChiefMing Li mli@wh.math.uwaterloo.ca En-Hua Wu weh@sftw.umac.moUniversity of Waterloo, Canada Institute of Software, CAS, ChinaYing-Hua Min min@ict.ac.cn Xiao-Dong Zhang xzhang@nsf.govInstitute of Computing Technology, CAS, China National Science Foundation, U.S.A.Executive Editor Zhi-Wei Xu zxu@ict.ac.cn Institute of Computing Technology, CAS, China     

Routing on Metacyclic Graphs

［1］S. B. Akers, B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput,1989,38:555～566 ［2］F. F. Annexstein, M. Baumslag,A. L. Rosenberg. Group action graphs and parallel architectures. SIAM J. Comput, 1990,19     

韩国网站99佳

综吕与门户类W功乃刀.Chollan,netWwW .emPaS.COmWW、v.iworld.netWWW.hanSO!.nGtw功八刀.Unitel.CO.krWWW.Shinbim.COmW,八彻.nownUri.net协八切叫.yahoo.eo.kr协闪叭份.hitel.netwww.netsgo.comWWw.4989.eo,krWWW.efm.eo.krWWW.modU.netW功乃N.k21C.CO.krW功八刀.n6Wb0Ok.CO.krwww.koreanshoPPing.eo.krWWW沈ongdaemun,co.kr功乃刀W.kisdire.krWWW .kfke.r6.krWwW.igo.CokrW功八刀.PaPi.eo.kr电脑网络类WWW.nanotim6S.C0mWWW.nara.CO.krWv户刊.neta!k.CO.krww、v.daum,CO.krWwweyberkorea.eo.krW功八NoPe…     

参加CODATA组织的国际相平衡数据会议简介

1.这次会议是由IUPAC和CODATA联合召开的。会议主要领导人为: 主席:Prof.J.E.Dubois,CODATA付主席(法) 成员:Dr.A.D.Kozlov.IUPAC热力学表负责人之一(苏) Dr.D.R.Lide,Jr.IUPAC物理化学部主席,CODATA秘书长(美) Prof.G.M.Schneider IUPAC热力学委员会主席(西德) Prof.E.F.Westrum,Jr.IUPAC参加CODATA代表(美) Prof.W.Zielenkiewicz,IUPAC热力学委员会(波)     

Construction of nonbinary quantum cyclic codes by using graph method

~~Construction of nonbinary quantum cyclic codes by using graph method1. Wootters, W. K., Zurek, W. H., A single quantum cannot be cloned, Nature, 1982, 299: 802-803. 2. Shor, P. W., Scheme for reducing decoherence in quantum memory, Phys. Rev. A, 1995, 52: 2493. 3. Steane, A. M., Multiple particle interference and quantum error correction, Proc. Roy. Soc. London A, 1996, 452: 2551-2557. 4. Calderbank, A. R., Rains, E. M., Shor, P. W. et al., Quantum error correction via c…     

第四届全球智能控制与自动化大会(WCICA′02)征文通知

时间地点 :2 0 0 2年 6月 1 0～ 1 4日　上海　　征文范围 :1 .智能控制 ,2 .神经网络 ,3.模糊系统与模糊控制 ,4.遗传算法与进化计算 ,5.人工智能与专家系统 ,6.智能调度与生产计划 ,7.学习控制 ,8.系统理论与控制理论 ,9.建模、辨识与估计 ,1 0 .自适应控制 ,1 1 .变结构控制 ,1 2 .非线性系统与控制 ,1 3.鲁棒控制 ,1 4 .优化控制与优化方法 ,1 5.大系统理论与方法 ,1 6.故障诊断 ,1 7.CIMS与控制系统 ,1 8.仿真与控制系统 CAD,1 9.智能信息处理系统 ,2 0 .混合系统与 DEDS,2 1 .分布式控制系统 ,2 2 .传感与测量 ,2 3.运动控制 ,2 …     

Iterative lavrentiev regularization for symmetric kernel-driven operator equations: with application to digital image restoration problems

~~Iterative Lavrentiev regularization for symmetric kernel-driven operator equations: with application to digital image restoration problems1. Roggemann, M. C, WeJsh, B., Imaging Through Turbulence. New York. CRC Press, 1996. 2. Bertero, M., Boccacci, P., Introduction to Inverse Prolems in Imaging, Bristol: IOP Publishing, 1998. 3. George, S., Nair, M. T., A class of discrepancy principles for the simplified regularization of ill-posed problems, J. Austral. Math. Soc, Ser.…     

2002年国际会议消息(英文)

JANUARY 23- 25, 4th International Conferencn FUSION OF EARTH DATA, Groupe Teledetection & Modelisa- tion. Sophia Antipolis. French Riviera, France. Contact: www. data-fusion. org/conf/fourth. 30-Feb l. Austin. Texas. 12th Annual Texas GIS Forum and Training Conference. Contact: Hugh Bender. TNRIS director, 1700N. Congress Ave. , Austin ,TX78711[512-463- 8337 ,fax, 512- 463- 7274 ,e -mail: hbender@tnris. state. tx. us, Web: http://www. tnris. state. tx. us/gisfestival] March 17-20, The Geospatial Information &Technology Association's (GITA) Annual Conference 25 :" Bringing IT To-gether: Charting the Course," Geospatial Information & Technology Association's (GI-TA), Tampa, FL. Contact: 303- 337- 0513, info @gita. org; http://www. gita. org. April 5-7. Remote Sensing and Photogrammetry Society 12th Thompson Symposium,loughborough, Eng-land Contact :The RSPSoc Office,School of Geography,University of Nottingham,Nottingham NG7 2RDTel. :+44 115 951 5435 website :www. rspsoc. org 8-11. CoLorado Springs. Colo. 18th National Space Symposium. Contact:The Space Foundation,2860 S. Circle Drive,Suite 2301,Colorado Springs, CO80906[800-691-4000,fax: 719-576-8801,e-mail: custserv@spacefoundation. org, Web: http ..//www. spacesymposium. org] 19-26. American Society for Photogrammetry and Remote Sensing ASPRS-ACSM Annual Confer-enee and XXII FIG Congreess,Washington D. C, USA Contact: 5410 Grosvenor Lane,Suite 210, Bethes-da,Maryland 20814-2160,USA,Tel.: +1 301 493 0290May 14-16, The New English GIS Conference, New England Chapters of GITA and ACSM, Boxborough. MA. Contact: 802-655-7769;www. negis. org. 15-18. Enschede, The Netherlands. Sixth Seminar on GIS and Developing Countries (GISDECO2002). Contact :GISDECO 2002, International Institute for Aerospace Sur-vey and Earth Sciences. POBox 6, 7500 AA Enschede, The NetherLands [e- mail .. GISDECO2002@itc. nl, Web: http://www. geog.uu. nl/gisdeco/gisdeco. html]June 11-13, Third International Symposium on: Remote Sensing of Urban Areas, Istanbul Technical Uni-versity, Istanbul, Turkey. Contact :www. ins. itu. edu. tr/rsurban3.July 9-12, Joint Internatinnal Symposium on GeoSpatial Theory, Processing and Applications. ISPRSCommission IV 10th SDH, and CIG. Ottawa,Canada. Contact :www. geomatics2002. org. 8-12. San Diego. 22nd Annual ESRI International User Confcrence. Contact:ESRI Inc. 380 NewYork St., Red-lands, CA 92373-8100[909-793-2853 ext. 1-1363, fax : 909 - 3O7 - 3128 , http : //www. esri. com/events/uc] 9-12. International Society for Photogrammetry and Remote Sensing Symposium of Commission IV,Ot-tawa,Canada,Contact : T. Herbert, Canada Institute of ageomatics, 1390 Prince of Wales, Suite 400,Ot-tawa,Ontario, Canada K2C 3N6 Tel. :+1 613 224 9851 24 - 28, IGARSS International Geoscience and Remote Sensing Symposium Conference; Toronto, Canada;Jeannie Boyes info@igarss02. ca ;www. igarss02. ca/index. htmlSeptember 18-20. EARSel Special Interest Group on Remote Sensing for Developing Countries, University ofBonn Remote Sensing Research Group. Bonn. Germany. Contact: 49- 0- 228- 729701: 49- 0- 228-739702 (fax) ;www. rsrg. uni-bonn. de.November 8-15. Denver. The 15th William T. Pecora Memorial Remote Sensing Symposium/Land Satellite In-formation IV Conference and Exhibition and the International Society for Photogrammetry and RemoteSensing Commission I Symposium. Contact :TemperanceBattee, Marketing/Meetings Manager, AmericanSociety for Photugrammetry and Remote Sensing. 5410 Grosvenor Lane, Suite 210. Bethesda. MD 20814-2160[301-493-0290ext. 1O6, fax:301-493-0208. e-maiL:tbattee@asprs. org, http://www. as-prs. org/Pecora- ISPRS- 2002] 18-20. Integrating Remote Sensing at the Global, Regional and Local Scale,ASPRS, Denver, CO.Contact :301-493-0290; www. asprs. org. DECEMBER 3- 6. Hyderabad, India. International Society for Photogrammetry and Remote Sensing TechnicalCommission VII (ISPRS TC VII) International Symposium on Resource and Environmental Monitoring.Contact: Organising Secretariat, National Remote Sensing Agency, Balanagar, Hydrabad 500 037, India [91- 40 - 387 - 8962, fax: 91 - 40 - 387 - 7210, e - mail: isprstcvii @nrsa. gov. in, www. commission7. isprs.org]     

A finite difference non-matching domain decomposition algorithm for the parabolic equation

A finite difference domain decomposition algorithm on a non-overlapping non-matching grid for the parabolic equation is discussed. The basic procedure is to define the explicit scheme at the interface points with a larger mesh spacing H, then the implicit schemes with different mesh spacings are applied on the non-matching subdomains, respectively. The stability bound is released both for the one-dimensional and two-dimensional parabolic problem. Finally, numerical experiments are also presented.     

A Practical Implementation of Parallel Dynamic Load Balancing for Adaptive Computing in VLSI Device Simulation

We present a new parallel semiconductor device simulation using the dynamic load balancing approach. This semiconductor device simulation based on the adaptive finite volume method with a posteriori error estimation has been developed and successfully implemented on a 16-PC Linux cluster with a message passing interface library. A constructive monotone iterative technique is also applied for solution of the system of nonlinear algebraic equations. Two different parallel versions of the algorithm to perform a complete device simulation are proposed. The first is a dynamic parallel domain decomposition approach, and the second is a parallel current-voltage characteristic points simulation. This implementation shows that a well-designed load balancing simulation can significantly reduce the execution time up to an order of magnitude. Compared with the measured data, numerical results on various submicron VLSI devices are presented, to show the accuracy and efficiency of the method.     

Parallel block interface domain decomposition methods for the 2D convection–diffusion equation

In this paper, a new block interface domain decomposition method (BI-DDM) with non-overlapping subdomains for the numerical solution of a two-dimensional convection–diffusion equation is presented. The block interface formulation is derived from the idea of using small groups of a certain number of mesh points where this group is treated explicitly similar to the way a single point is treated in the point method. The BI-DDM is incorporated with a correction phase which is able to economize further on the computing cost. The performance analysis of this method on several recently developed group iterative schemes implemented on a message-passing architecture are presented and discussed.     

Adaptive nonlinear discriminant analysis by regularized minimum squared errors

Kernelized nonlinear extensions of Fisher's discriminant analysis, discriminant analysis based on generalized singular value decomposition (LDA/GSVD), and discriminant analysis based on the minimum squared error formulation (MSE) have recently been widely utilized for handling undersampled high-dimensional problems and nonlinearly separable data sets. As the data sets are modified from incorporating new data points and deleting obsolete data points, there is a need to develop efficient updating and downdating algorithms for these methods to avoid expensive recomputation of the solution from scratch. In this paper, an efficient algorithm for adaptive linear and nonlinear kernel discriminant analysis based on regularized MSE, called adaptive KDA/RMSE, is proposed. In adaptive KDA/RMSE, updating and downdating of the computationally expensive eigenvalue decomposition (EVD) or singular value decomposition (SVD) is approximated by updating and downdating of the QR decomposition achieving an order of magnitude speed up. This fast algorithm for adaptive kernelized discriminant analysis is designed by utilizing regularization techniques and the relationship between linear and nonlinear discriminant analysis and the MSE. In addition, an efficient algorithm to compute leave-one-out cross validation is also introduced by utilizing downdating of KDA/RMSE.     

自由角度显示系统下的运动向量算法

为了解决三维运动矢量计算的问题,提出一种算法,这种算法是在静态三维重建的基础上用二维图片计算刚体运动的线性方法,利用QR分解求解线性方程的最小均方误差解,迭代来消除离群值,来得到运动矢量.这种算法不需要摄像机标定,实时性好,有利于视频的流畅显示,实验结果表明,此种算法具有一定的鲁棒性.     

基于最小面积差的三维模型简化算法

文章提出了一种基于面积误差度量下的三维网格模型简化方法。该方法通过极小化误差目标函数来简化三角网格模型。算法首先对边遍历,计算每条边的最小面积差;然后对面积差最小的边进行折叠;最后通过求解折叠边的最小面积差,确定新点的坐标。实验结果表明,该算法不仅可以反映局部表面几何变化,还可使模型仍具有较高保真度。最后用实例说明了该方法的有效性。     

基于"结式法"的二次曲面求交算法

提出了一种新的基于“结式法”的二次曲面求交算法，该算法首先利用结式法计算出两二次曲面相交时交线的投影方程,再对投影方程进行分解等处理，通过循环计算从而得到投影交线的分支数及其上的一系列的点,然后回代入两二次曲面中的一个即可得到二次曲面的交线，该算法实现简单且符合求交算法的稳定、准确和快速等要求。     

基于无味卡尔曼滤波的多雷达方位配准算法

将无味卡尔曼滤波（Unscented Kalman filter，UKF）应用于雷达配准，提出一种新的多雷达方位配准算法。在该算法中，目标的运动状态和方位误差由选定的采样点来近似，在每个更新过程中，采样点随着状态方程传播并随非线性测量方程变换，得到目标的运动状态和方位误差的均值，避免了对非线性方程的线性化，且具有较高的计算精度。与传统的扩展卡尔曼滤波（Extended Kalman filter，EKF）方法进行了仿真比较，结果表明UKF方法能有效地克服非线性跟踪问题中很容易出现的滤波发散问题，且估计精度高于UKF方法。     

三维Navier-Stokes方程分步法的并行算法在异构平台上实现初探

本文选取了三维不可压缩流动方程的分步法(fractional-step method),其中动量方程使用BiCGSTAB算法进行迭代求解,而压力泊松方程使用Fourier变换法进行直接求解。本文研究该算法在集群平台上的并行算法,从区域分解入手,分析一维、两维、三维区域划分三种情况下,各并行处理器上的计算量与通讯量,根据分析结果使用两维区域分解。分析BiCGSTAB算法和泊松Fourier变换法在GPGPU异构平台上的移植方法。最后,本文分析了BiCGSTAB和泊松方程Fourier变换法两种算法在CPU集群和GPGPU异构平台上的并行性能结果。     

A parallel Aitken-additive Schwarz waveform relaxation suitable for the grid

The objective of this paper is to describe a grid-efficient parallel implementation of the Aitken–Schwarz waveform relaxation method for the heat equation problem. This new parallel domain decomposition algorithm, introduced by Garbey [M. Garbey, A direct solver for the heat equation with domain decomposition in space and time, in: Springer Ulrich Langer et al. (Ed.), Domain Decomposition in Science and Engineering XVII, vol. 60, 2007, pp. 501–508], generalizes the Aitken-like acceleration method of the additive Schwarz algorithm for elliptic problems. Although the standard Schwarz waveform relaxation algorithm has a linear rate of convergence and low numerical efficiency, it can be easily optimized with respect to cache memory access and it scales well on a parallel system as the number of subdomains increases. The Aitken-like acceleration method transforms the Schwarz algorithm into a direct solver for the parabolic problem when one knows a priori the eigenvectors of the trace transfer operator. A standard example is the linear three dimensional heat equation problem discretized with a seven point scheme on a regular Cartesian grid. The core idea of the method is to postprocess the sequence of interfaces generated by the additive Schwarz wave relaxation solver. The parallel implementation of the domain decomposition algorithm presented here is capable of achieving robustness and scalability in heterogeneous distributed computing environments and it is also naturally fault tolerant. All these features make such a numerical solver ideal for computational grid environments. This paper presents experimental results with a few loosely coupled parallel systems, remotely connected through the internet, located in Europe, Russia and the USA.