基于WEB方式的电子政务初探

本提出了基于WEB方式的电子政务设计、开发、运营方法和技术平台的总体框架。描述了电子政务数据开发模型的雄度，电子政务系统工程的实施原则、实施步骤及应用系统集成的一整套的实践模型。     

电磁场中带电粒子束运动的力学模拟

研究以不同初速度进入互相垂直的匀强磁场和均强电场中的带电粒子束的运动情形，并同相似的力学运动相比拟，建立了直观的力学模型。     

期权理论在高新企业价值评估中的应用

分析了高新技术企业特点，说明了传统的企业价值评估方法不能应用于对高新技术企业的评估。如果把高新技术企业投资看成是为了获得一个未来取得现金流的机会，高新技术企业具有期权性质，就可以用期权理论及Black-Scholes模型评估高新企业的价值。     

On the Circulant and Aperiodic Models of Deconvolution

ＯｎｔｈｅＣｉｒｃｕｌａｎｔａｎｄＡｐｅｒｉｏｄｉｃＭｏｄｅｌｓｏｆＤｅｃｏｎｖｏｌｕｔｉｏｎ￥ＺｏｕＭｏｕｙａｎ＆ＲｏｌｆＵｎｂｅｈａｕｅｎＡｂｓｔｒａｃｔ：Ｔｈｅｐｏｐｕｌａｒｌｙｕｓｅｄｃｉｒｃｕｌａｎｔｍａｔｒｉｘｍｏｄｅｌｏｆｄｅｃｏｎｖｏ...     

Forecast accuracy after pretesting with an application to the stock market

In econometrics, as a rule, the same data set is used to select the model and, conditional on the selected model, to forecast. However, one typically reports the properties of the (conditional) forecast, ignoring the fact that its properties are affected by the model selection (pretesting). This is wrong, and in this paper we show that the error can be substantial. We obtain explicit expressions for this error. To illustrate the theory we consider a regression approach to stock market forecasting, and show that the standard predictions ignoring pretesting are much less robust than naive econometrics might suggest. We also propose a forecast procedure based on the ‘neutral Laplace estimator’, which leads to an improvement over standard model selection procedures. Copyright © 2004 John Wiley & Sons, Ltd.     

Estimation and testing of time-varying coefficient regression models in the presence of linear restrictions

A linear regression model with random walk coefficients is extended to allow for linear restrictions between the coefficients to be satisfied at each point in time. Estimation in this model is shown to be no more involved than estimation in the standard model. It is also demonstrated how, after a slight modification to the testing problem, classical test procedures may be applied to the problem of testing for such restrictions. The performance of the Lagrange Multiplier test for a variety of different restrictions is then investigated via simulation. An empirical application involving testing for homogeneity in a random walk coefficient version of the AIDS model is given.     

A ground‐level ozone forecasting model for Santiago,Chile

A physically based model for ground‐level ozone forecasting is evaluated for Santiago, Chile. The model predicts the daily peak ozone concentration, with the daily rise of air temperature as input variable; weekends and rainy days appear as interventions. This model was used to analyse historical data, using the Linear Transfer Function/Finite Impulse Response (LTF/FIR) formalism; the Simultaneous Transfer Function (STF) method was used to analyse several monitoring stations together. Model evaluation showed a good forecasting performance across stations—for low and high ozone impacts—with power of detection (POD) values between 70 and 100%, Heidke's Skill Scores between 40% and 70% and low false alarm rates (FAR). The model consistently outperforms a pure persistence forecast. Model performance was not sensitive to different implementation options. The model performance degrades for two‐ and three‐days ahead forecast, but is still acceptable for the purpose of developing an environmental warning system at Santiago. Copyright © 2002 John Wiley & Sons, Ltd.     

语境因素在The Sampler一文的语篇理解中的应用

运用背景知识,认知模式,认知语境知识和知识草案等理论去分析理解购物行为模式,通过分析行为模式的特殊性以及对词语标记性的运手,揭示了一个特殊购物者———TheSam-pler———充满孤独无助的内心世界。     

现代意义下作战模型的研究

本文阐述了现代战争的特点，构造了现代意义下的作战模型，通过求解与分析，指明信息在现代战争中的重要作用和对未来战争的指导意义。     

Radar Imaging Based on Iterative Algorithms

It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.