城市监控系统联网平台的建设

本文详细介绍了“城市监控系统联网平台”的建设背景、目标、原则；闸述了联网平台系统结构、各功能模块、平台开发技术；重点讨论了系统实施过程中需要解决的模拟和数字平台的统一、联网平台建设中的关键技术，提出了可行的技术解决方案，对网络数字监控设备访问接口的标准化、通用数字矩阵的实现等技术的应用发展方向进行了分析与探讨。[编者按]     

构建更加安全的智能移动平台

智能移动平台已超越PC成为了最大的计算平台,其安全性也受到了越来越多的关注。与PC相比,针对智能移动平台的恶意代码虽然在近些年发展很快,但尚处于萌芽期。本文尝试从移动和Pc平台安全性的两个最大不同点出发,谈谈如何构建更加安全的计算平台,避免重蹈PC平台的覆辙。     

广义平台与平台模式

从现代科技创新知识的发展角度论述了广义平台的基本特征与应用模式,探讨了单片机产业平台应用现状,提出了广义平台建设、更新和维护的方法。     

物联网平台及其云化平台的开放性评估

采用归纳总结的方法对物联网平台的定位、物联网平台的类型进行了描述,指出物联网平台是物联网产业布局的核心。并提出了物联网云化平台开放性评估模型和方法,包括物联网云平台与用户系统的接口模型、互操作性评估方法、可移植性评估方法以及开放性评估方法。最后对物联网平台技术发展的演进方向进行了预判。     

基于可信计算平台的体系结构研究与应用

介绍了可信计算平台的关键部件组成及其功能，描述了可信计算平台的特点和原理机制，以及目前可信计算平台的研究进展情况，分析了基于可信计算平台技术的应用前景和存在的问题，并对未来的趋势进行了展望。基于863项目“可信计算系统平台”的安全芯片研制成功，展现了可信计算的良好应用前景。     

Linux手机软件平台创建工具

随着手机功能的丰富和使用领域的拓广,手机软件平台技术越来越被重视。手机软件平台对手机开发和手机性能上的影响,已经使其成为技术领域内一个研究的热点。为了使基于Linux的嵌入式软件平台的建立、集成和分配更容易,需要一个手机软件平台创建工具,以提高手机软件平台的开发效率。手机软件平台创建工具是一个图形用户界面的系统集成和分配工具,功能覆盖了创建手机软件平台的全过程。分析了基于Linux的手机软件平台的优势,探讨了软件包管理方式,描述了平台创建工具的系统结构和相关技术,并讨论了该工具在手机软件开发过程中所起的重要作用。     

浩辰CAD：创新中国设计平台

近日，苏州浩辰科技发展有限公司推出了最新版本的自主平台软件ICADV2006i，及时备份功能成为一大亮点。此前，该项目已经通过国家建设部科技成果鉴定，并得到了权威专家的一致肯定。有望替代国外同类平台软件，对国产CAD平台的创新发展具有划时代的意义。     

电力生产管理系统业务支撑平台

本文介绍了当前电力生产管理系统的建设需求,并充分考虑业务的未来发展,分析了业务系统的建设对业务支撑平台的诉求,基于此阐述了业务支撑平台的定位和特点,最终对业务支撑平台的设计思想和实现思路进行了详细论述．     

地学e-Science发展的回顾与展望

自 e-Science 提出之后的近 20 年间,地学 e-Science 在计算、网络和存储等信息技术的推动下,业已形成了基于数据、模型、计算、可视化分析和协同工作的地学研究框架,已经成为推动地学研究方法变革的驱动器。本文梳理和归纳了地学 e-Science 的发展过程和一些典型应用,总结了地学e-Science 的发展趋势,提出了简化的基于 3M 平台（Monitoring（监测平台）、Modeling（模型平台）、Manipulating（操作平台））的地学 e-Science 架构。从地学 e-Science 发展趋势上看,建立基于数据产生、采集、传输、管理的联合观测系统,形成完善的监测平台是地学 e-Science 的基础。建立数据分析、制备、同化和模型构建、集成与模拟的模型平台是地学 e-Science 的核心。建立基于高性能计算、可视化分析和协同工作环境的操作平台是地学 e-Science 研究的基本环境。     

汇编系统中多平台支持技术的研究

支持多语种,多平台是当前编译技术的发展趋势,它适应了当有计算机系统迅猛更新的需要,汇编系统作为多语种,多平台编译中必不可少的重要组成部分,是实现多平台支持的关键,文中提出了一个适用于不同计算机平台的多平台汇编系统的模型,在此基础上讨论了汇编系统中多平台支持技术的３个２要素;平台配置机制,指令系统支持方式和目标文件处理策略,并描述了相应的设计与实现方法。     

QCDgrid: A Grid Resource for Quantum Chromodynamics

Quantum Chromodynamics (QCD) is an application area that requires access to large supercomputing resources and generates large amounts of raw data. The UK's national lattice QCD collaboration UKQCD currently stores and requires access to around five Tbytes of data, a figure that is growing dramatically as the collaboration's purpose built supercomputing system, QCDOC [P.A. Boyle, D. Chen, N.H. Christ, M. Clark, S.D. Cohen, C. Cristian, Z. Dong, A. Gara, B. Joo, C. Jung, C. Kim, L. Levkova, X. Liao, G. Liu, R.D. Mawhinney, S. Ohta, K. Petrov, T. Wettig and A. Yamaguchi, “Hardware and software status of QCDOC, arXiv: hep-lat/0309096”, Nuclear Physics. B, Proceedings Supplement, Vol. 838, pp. 129–130, 2004. See: http://www.ph.ed.ac.uk/ukqcd/community/qcdoc/; P.A. Boyle, D. Chen, N.H. Christ, M.A. Clark, S.D. Cohen, C. Cristian, Z. Dong, A. Gara, B. Joo, C. Jung, C. Kim, L.A. Levkova, X. Liao, R.D. Mawhinney, S. Ohta, K. Petrov, T. Wettig and A. Yamaguchi, “Overview of the QCDSP and QCDOC computers”, IBM Journal of Research and Development, Vol. 49, No. 2/3, p. 351, 2005] came into full production service towards the end of 2004. This data is stored on QCDgrid, a data Grid currently composed of seven storage elements at five separate UK sites.     

Weaker convergence for Newton's method under Hölder differentiability

We use more precise majorizing sequences than in earlier studies such as [J. Appell, E. De Pascale, J.V. Lysenko, and P.P. Zabrejko, New results on Newton–Kantorovich approximations with applications to nonlinear integral equations, Numer. Funct. Anal. Optim. 18 (1997), pp. 1–17; I.K. Argyros, Concerning the ‘terra incognita’ between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005), pp. 179–194; F. Cianciaruso, A further journey in the ‘terra incognita’ of the Newton–Kantorovich method, Nonlinear Funct. Anal. Appl. 15 (2010), pp. 173–183; F. Cianciaruso and E. De Pascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003), pp. 713–723; F. Cianciaruso, E. De Pascale, and P.P. Zabrejko, Some remarks on the Newton–Kantorovich approximations, Atti Sem. Mat. Fis. Univ. Modena 48 (2000), pp. 207–215; E. De Pascale and P.P. Zabrejko, Convergence of the Newton–Kantorovich method under Vertgeim conditions: A new improvement, Z. Anal. Anwendvugen 17 (1998), pp. 271–280; J.A. Ezquerro and M.A. Hernández, On the R-order of convergence of Newton's method under mild differentiability conditions, J. Comput. Appl. Math. 197 (2006), pp. 53–61; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations (in Russian), Dokl. Akad. Nauk BSSR 38 (1994), pp. 20–24; P.D. Proinov, New general convergence theory for iterative processes and its applications to Newton–Kantorovich type theorems, J. Complexity 26 (2010), pp. 3–42; J. Rokne, Newton's method under mild differentiability conditions with error analysis, Numer. Math. 18 (1971/72), pp. 401–412; B.A. Vertgeim, On conditions for the applicability of Newton's method, (in Russian), Dokl. Akad. N., SSSR 110 (1956), pp. 719–722; B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957), pp. 166–169 (in Russian); English transl.: Amer. Math. Soc. Transl. 16 (1960), pp. 378–382; P.P. Zabrejko and D.F. Nguen, The majorant method in the theory of Newton–Kantorovich approximations and the Pták error estimates, Numer. Funct. Anal. Optim. 9 (1987), pp. 671–684; A.I. Zinc?enko, Some approximate methods of solving equations with non-differentiable operators (Ukrainian), Dopovidi Akad. Nauk Ukraïn. RSR (1963), pp. 156–161] to provide a semilocal convergence analysis for Newton's method under Hölder differentiability conditions. Our sufficient convergence conditions are also weaker even in the Lipschitz differentiability case. Moreover, the results are obtained under the same or less computational cost. Numerical examples are provided where earlier conditions do not hold but for which the new conditions are satisfied.     

Isogeometric variational multiscale modeling of wall-bounded turbulent flows with weakly enforced boundary conditions on unstretched meshes

In this work, we combine (i) NURBS-based isogeometric analysis, (ii) residual-driven turbulence modeling and iii) weak imposition of no-slip and no-penetration Dirichlet boundary conditions on unstretched meshes to compute wall-bounded turbulent flows. While the first two ingredients were shown to be successful for turbulence computations at medium-to-high Reynolds number [I. Akkerman, Y. Bazilevs, V. M. Calo, T. J. R. Hughes, S. Hulshoff, The role of continuity in residual-based variational multiscale modeling of turbulence, Comput. Mech. 41 (2008) 371–378; Y. Bazilevs, V.M. Calo, J.A. Cottrell, T.J.R. Hughes, A. Reali, G. Scovazzi, Variational multiscale residual-based turbulence modeling for large eddy simulation of incompressible flows, Comput. Methods Appl. Mech. Engrg., 197 (2007) 173–201], it is the weak imposition of no-slip boundary conditions on coarse uniform meshes that maintains the good performance of the proposed methodology at higher Reynolds number [Y. Bazilevs, T.J.R. Hughes. Weak imposition of Dirichlet boundary conditions in fluid mechanics, Comput. Fluids 36 (2007) 12–26; Y. Bazilevs, C. Michler, V.M. Calo, T.J.R. Hughes, Weak Dirichlet boundary conditions for wall-bounded turbulent flows. Comput. Methods Appl. Mech. Engrg. 196 (2007) 4853–4862]. These three ingredients form a basis of a possible practical strategy for computing engineering flows, somewhere between RANS and LES in complexity. We demonstrate this by solving two challenging incompressible turbulent benchmark problems: channel flow at friction-velocity Reynolds number 2003 and flow in a planar asymmetric diffuser. We observe good agreement between our calculations of mean flow quantities and both reference computations and experimental data. This lends some credence to the proposed approach, which we believe may become a viable engineering tool.     

Free boundary problems in the theory of fluid flow through porous media: A numerical approach

In this paper we study from the numerical point of view elliptic free boundary problems in the theory of fluid flow through porous media by a new method. Research supported by C.N.R. in the frame of the collaboration between L. A. N. of Pavia and E. R. A. 215 of C. N. R. S. and of Paris University and carried out also with the cooperation of the Division C. E. T. I. S. of C.C.R. Euratom Ispra.     

Book reviews

CALCULUS AND THE COMPUTER (An Approach to problem solving) by T. V. Fossum and R. W. Gatterdam, 1980, pub. by Scott, Forrseman & Co., Glenview, Illinois, 217pp+Index. $6.95 (only U.S. Price available).

KNOWLEDGE BASED PROGRAM CONSTRUCTION, by David R. Barstow, The Computer Science Library, Programming Languages Series No. 6. North-Holland, 1979. $10.

NUMERICAL ANALYSIS OF SEMICONDUCTOR DEVICES. Proceedings of the NASECODE 1 Conference held at Trinity College, Dublin, from 27th-29th June 1979, edited by B.T. Browne and J. J. H. Miller, pub. by Boole Press Ltd., P.O. Box No. 5, 51 Sandycove Road, Dunlaoghaire, Co. Dublin, Ireland, August 1979, XII + 303 pages, Cloth £20 (U.S. $42) ISBN 0-906783-003.     

New shape-based auroral oval segmentation driven by LLS-RHT

A new method that exploits shape to localize the auroral oval in satellite imagery is introduced. The core of the method is driven by the linear least-squares (LLS) randomized Hough transform (RHT). The LLS-RHT is a new fast variant of the RHT suitable when not all necessary conditions of the RHT can be satisfied. The method is also compared with the three existing methods for aurora localization, namely the histogram-based k-means [C.C. Hung, G. Germany, K-means and iterative selection algorithms in image segmentation, IEEE Southeastcon 2003 (Session 1: Software Development)], adaptive thresholding [X. Li, R. Ramachandran, M. He, S. Movva, J.A. Rushing, S.J. Graves, W. Lyatsky, A. Tan, G.A. Germany, Comparing different thresholding algorithms for segmenting auroras, in: Proceedings of the International Conference on Information Technology: Coding and Computing, vol. 6, 2004, pp. 594-601], and pulse-coupled neural network-based [G.A. Germany, G.K. Parks, H. Ranganath, R. Elsen, P.G. Richards, W. Swift, J.F. Spann, M. Brittnacher, Analysis of auroral morphology: substorm precursor and onset on January 10, 1997, Geophys. Res. Lett. 25 (15) (1998) 3042-3046] methods. The methodologies and their performance on real image data are both considered in the comparison. These images include complications such as random noise, low contrast, and moderate levels of key obscuring phenomena.     

Response to the comments on "Fundamental limits of reconstruction-based superresolution algorithms under local translation"

Wang and Feng (IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 5, p 846, May 2006) pointed out that the deduction in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004) overlooked the validity of the perturbation theorem used in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004). In this paper, we show that, when the perturbation theorem is invalid, the probability of successful superresolution is very low. Therefore, we only have to derive the limits under the condition that validates the perturbation theorem, as done in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004).     

A counterexample of a theorem by Tsolas et al. and an independentresult by Zaborszky et al. [with reply]

Recent results on the composition of the stability boundary by N.A. Tsolas et al. (IEEE Trans. Circuits Syst., vol.CAS-32, no.10, pp.1041-9, Oct. 1985) and J. Zaborszky et al. (Proc. IFAC Symp. Power Syst. Power Plant. Contr., Beijing, China, Aug. 1986, pp.597-603) claimed that it consisted of the stable manifolds of index-one unstable equilibria and their closures. A counterexample shows the potential existence of additional structures within the boundary. This finding invalidates numerous theorems published in the literature. The author concedes that the counterexample to the theorem in the paper by N.A. Tsolas et al. is unassailable and identifies the error in his proof     

On the estimation of the general parameter

In this paper, we first discuss the origin, developments and various thoughts by several researchers on the generalized linear regression estimator (GREG) due to Deville and Särndal [Deville, J.C., Särndal, C.E., 1992. Calibration estimators in survey sampling. J. Amer. Statist. Assoc. 87, 376-382]. Then, the problem of estimation of the general parameter of interest considered by Rao [Rao, J.N.K., 1994. Estimating totals and distribution functions using auxiliary information at the estimation stage. J. Official Statist. 10 (2), 153-165], and Singh [Singh, S., 2001. Generalized calibration approach for estimating the variance in survey sampling. Ann. Inst. Statist. Math. 53 (2), 404-417; Singh, S., 2004. Golden and Silver Jubilee Year-2003 of the linear regression estimators. In: Proceedings of the Joint Statistical Meeting, Toronto (Available on the CD), 4382-4380; Singh, S., 2006. Survey statisticians celebrate Golden Jubilee Year-2003 of the linear regression estimator. Metrika 1-18] is further investigated. In addition to that it is shown that the Farrell and Singh [Farrell, P.J., Singh, S., 2005. Model-assisted higher order calibration of estimators of variance. Australian & New Zealand J. Statist. 47 (3), 375-383] estimators are also a special case of the proposed methodology. Interestingly, it has been noted that the single model assisted calibration constraint studied by Farrell and Singh [Farrell, P.J., Singh, S., 2002. Re-calibration of higher order calibration weights. Presented at Statistical Society of Canada conference, Hamilton (Available on CD); Farrell, P.J., Singh, S., 2005. Model-assisted higher order calibration of estimators of variance. Australian & New Zealand J. Statist. 47 (3), 375-383] and Wu [Wu, C., 2003. Optimal calibration estimators in survey sampling. Biometrika 90, 937-951] is not helpful for calibrating the Sen [Sen, A.R., 1953. On the estimate of the variance in sampling with varying probabilities. J. Indian Soc. Agril. Statist. 5, 119-127] and Yates and Grundy [Yates, F., Grundy, P.M., 1953. Selection without replacement from within strata with probability proportional to size. J. Roy. Statist. Soc. Ser. 15, 253-261] estimator of the variance of the linear regression estimator under the optimal designs of Godambe and Joshi [Godambe, V.P., Joshi, V.M., 1965. Admissibility and Bayes estimation in sampling finite populations—I. Ann. Math. Statist. 36, 1707-1722]. Three new estimators of the variance of the proposed linear regression type estimator of the general parameters of interest are introduced and compared with each other. The newly proposed two-dimensional linear regression models are found to be useful, unlike a simulation based on a couple of thousands of random samples, in comparing the estimators of variance. The use of knowledge of the model parameters in assisting the estimators of variance has been found to be beneficial. The most attractive feature is that it has been shown theoretically that the proposed method of calibration always remains more efficient than the GREG estimator.     

Book Reviews

Book reviewed in this article:
Title : Cognition and Computers-Studies in Learning Authors : R. W. Lawler, J. B. H. du Boulay, M. Hughes and H. MacLeod
Title : Never mind the technology think of the information Authors : Godfrey Wace
Title : Computer Appreciation Author : Bob Dingle
Title : Programming in microProlog made simple Authors : P. H. Hepburn
Title : Children, Computers and the Curriculum Authors : J. J. Wellington
Title : Computers and Modern Language Studies Authors : K. C. Cameron, W. S. Dodd & S. P. Q. Rahtz