Outer wave number spectrum and statistical distribution of apparent wave number vector

Based on the ray theory and Longuet-Higgins's linear,model of sea waves, the joint distribution of wave envelope and apparent wave number vector is established. From the joint distribution, we define a new concept, namely the outer wave number spectrum, to describe the outer characteristics of ocean waves. The analytical form of the outer wave number spectrum, the probability distributions of the apparent wave number vector and its components are then derived. The outer wave number spectrum is compared with the inner wave number spectrum for the average status of wind-wave development corresponding to a peakness factor P = 3. Discussions on the similarity and difference between the outer wave number spectrum and inner one are also presented in the paper. (C) 2002 Elsevier Science Ltd. All rights reserved.

Algorithm Studies on How to Obtain a Conditional Nonlinear Optimal Perturbation (CNOP)

The conditional nonlinear optimal perturbation (CNOP), which is a nonlinear generalization of the linear singular vector (LSV), is applied in important problems of atmospheric and oceanic sciences, including ENSO predictability, targeted observations, and ensemble forecast. In this study, we investigate the computational cost of obtaining the CNOP by several methods. Differences and similarities, in terms of the computational error and cost in obtaining the CNOP, are compared among the sequential quadratic programming (SQP) algorithm, the limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm, and the spectral projected gradients (SPG2) algorithm. A theoretical grassland ecosystem model and the classical Lorenz model are used as examples. Numerical results demonstrate that the computational error is acceptable with all three algorithms. The computational cost to obtain the CNOP is reduced by using the SQP algorithm. The experimental results also reveal that the L-BFGS algorithm is the most effective algorithm among the three optimization algorithms for obtaining the CNOP. The numerical results suggest a new approach and algorithm for obtaining the CNOP for a large-scale optimization problem.

Wind-vector estimation for RADARSAT-1 SAR images: Validation of wind-direction estimates based upon geometry diversity

In this letter, a new wind-vector algorithm is presented that uses radar backscatter sigma(0) measurements at two adjacent subscenes of RADARSAT-1 synthetic aperture radar (SAR) images, with each subscene having slightly different geometry. Resultant wind vectors are validated using in situ buoy measurements and compared with wind vectors determined from a hybrid wind-retrieval model using wind directions determined by spectral analysis of wind-induced image streaks and observed by colocated QuikSCAT measurements. The hybrid wind-retrieval model consists of CMOD-IFR2 [applicable to C-band vertical-vertical (W) polarization] and a C-band copolarization ratio according to Kirchhoff scattering. The new algorithm displays improved skill in wind-vector estimation for RADARSAT-1 SAR data when compared to conventional wind-retrieval methodology. In addition, unlike conventional methods, the present method is applicable to RADARSAT-1 images both with and without visible streaks. However, this method requires ancillary data such as buoy measurements to resolve the ambiguity in retrieved wind direction.

Theoretical study on adsorption of Na+ and Na+(H2O)(n) (n=1-6) on a clean Si(111) surface

To model the adsorption of Na+ in aqueous solution on the semiconductor surface, the interactions of Na+ and Na+(H2O)(n) (n = 1-6) with a clean Si(111) surface were investigated by using hybrid density functional theory (B3LYP) and Moller-Plesset second-order perturbation (MP2) methods. The Si(111) surface was described with Si8H12, Si16H20, and Si22H21 Cluster models. The effect of the basis set superposition error (BSSE) was taken into account by applying the counterpoise (CP) correction. The calculated results indicated that the interactions between the Na+ cation and the dangling bonds of the Si(111) surface are primarily electrostatic with partial orbital interactions. The magnitude of the binding energies depends weakly on the adsorption sites and the size of the clusters. When water molecules are present, the interaction between the Nal and Si(I 11) surfaces weakens and the binding energy has the tendency to saturate. On a Si22H21 cluster described surface, the optimized Na+-surface distance for Na+(H2O)(5) adsorbed at on-top site is 4.16 angstrom and the CP-corrected binding energy (MP2) is -35.4 kJ/mol, implying a weakly adsorption of hydrated Na+ cation on clean Si(111) surface.

空间向量法求解坐标变换

介绍一种利用空间向量求解坐标变换关系的方法，简化了传统的坐标系之间坐标变换关系求解的复杂计算，减小了采样误差对计算结果的影响．为建立各物体之间的位姿关系描述提供了有效的数学计算手段

激光拼焊生产线定位误差分析及其控制

对激光拼焊生产线板材定位精度进行了分析与研究。详细介绍了该系统定位装置的组成及定位原理。通过对板材自身直线度误差、定位销定位误差和对中运动误差的分析,建立了激光拼焊生产线板材定位误差模型。根据系统定位机构特点提出了过盈量作用机制来提高定位精度,通过对前后侧压紧力F1、F2以及过盈量I这3个主要参数的优化,在全自动激光拼焊生产线上实现良好的板材定位精度。对比试验验证了采用过盈量作用机制能有效减小板材定位误差,提高焊接质量。

二维流形三角网格模型顶点法矢量估计

提出一种以顶点的一邻域中三角形在该顶点处的顶角与对应三角形的面积比值加权三角面法矢量估计二维流形三角网格模型顶点法矢量的方法.回顾了现有的五种顶点法矢量估计方法,然后给出了新的方法.设计了利用理论法矢量与估计法矢量的夹角作为误差评价标准的实验,应用球体和椭球体模型分析了所涉及的6种估计方法的性能。

VTI各向异性叠前深度偏移及速度分析

Theoretical research, laboratory test and field observation show that most of sediment rock has anisotropic features. It will produce some notable errors when applying isotropic methods such as prestack depth migration and velocity analysis to dada acquired under anisotropic condition; it also has a bad effect on geologic interpretation. Generally speaking, the vertical transverse isotropic media is a good approximation to geologic structure, thus it has an important realistic meaning for anisotropic prestack depth migration theory researching and precise complex geologic imaging if considering anisotropic effect of seismic wave propagation. There are two indispensable parts in prestack depth migration of realistic records, one is proper prestack depth migration algorithm, and the other is velocity analysis using prestack seismic data. The paper consists of the two aspects. Based on implicit finite difference research proposed by Dietrich Ristow et al （1997） about VTI media prestack depth migration, the paper proposed split-step Fourier prestack depth migration algorithm （VTISSF） and Fourier finite difference algorithm （VTIFFD） based on wave equation for VTI media, program are designed and the depth migration method are tested using synthetic model. The result shows that VTISSF is a stable algorithm, it generally gets a good result if the reflector dip is not very steep, while undermigration phenomena appeared in steep dips case; the VTIFFD algorithm bring us better result in steep dips with lower efficiency and frequency dispersion. For anisotropic prestack depth migration velocity analysis of VTI media, The paper discussed the basic hypothesis of VTI model in velocity analysis algorithm, basis of anisotropic prestack depth migration velocity analysis and travel time table calculation of VTI media in integral prestack depth migration. Then , analyzed the P-wave common imaging gather in the case of homogeneous velocity and vertically variable velocity . studied the residual correction in common imaging gather produced by media parameter error, analyzed the condition of flat event and correct depth in common imaging gather . In this case, the anisotropic model parameter vector is , is vertical velocity of a point at top surface, is vertical velocity gradient, and are anisotropic parameter. We can get vertical velocity gradient from seismic data; then the P-wave common imaging gather of VTI media whose velocity varies in vertical and horizontal direction, the relationship between media parameter and event residual time shift of common image gather are studied. We got the condition of flattening common imaging gather with correct depth. In this case the anisotropic model parameter vector is , is velocity gradient in horizontal direction. As a result, the vertical velocity grads can be decided uniquely, but horizontal velocity grads and anisotropic parameter can’t be distinguished if no priori information available, our method is to supply parameter by velocity scanning; then, as soon as is supplied we can get another four parameters of VTI media from seismic data. Based on above analysis, the paper discussed the feasibility of migration velocity analysis in vertically and horizontally varied VTI media, synthetic record of three models are used to test the velocity analysis method . Firstly, anisotropic velocity analysis test is done using a simple model with one block, then we used a model with multiple blocks, thirdly, we analyzed the anisotropic velocity using a part of Marmousi model. The model results show that this velocity analysis method is feasible and correct.

从赌博游戏中的损失厌恶行为看情感预测与体验在决策中的作用

In Kermer, Driver-Linn, Wilson and Gilbert’s (2006) study on affective forecast, they found that people have a tendency to overestimate affective reactions in gains and losses, and people expect losses to have greater hedonic impact than gains of equal magnitude. Because of thus affective forecasting error, people prefer to irrationally avoid losses. Loss aversion is then seen as both a wealth-maximizing error and an affect-maximizing error. The present study examined the relationships among affective forecast, affective experience and loss aversion, and tested Kermer et al.’s (2006) conclusion that people’s loss aversion is an affective forecasting error. In experiment 1, we examined the relationship between affective forecast and loss aversion. Kermer et al.’s (2006) hypothesized that when people expect losses to have greater hedonic impact than gains, they will accept the gambling task, and when people expect gains to have greater hedonic impact than losses, they will refuse the gambling task. We found that (1) individuals with lower loss aversion had a greater tendency to accept a gambling task than those with higher loss aversion; (2) individuals with lower loss aversion expected losses and gains to have smaller affective impacts than those with higher loss aversion. Thus, people never exactly calculated their forecasting affective. In experiment 2, we examined the relationship between affective forecast and affective experience. Consistent with Kermer et al.’s (2006) finding, we found that our participants tended to overestimate affective reactions in gains as well as losses. More interestingly, Kermer et al.’s (2006) found that participants’ predictions for a loss were significantly more distant from experienced emotions than were their predictions for a win, we, however, found the opposite —participants’ predictions for a win were significantly more distant from the experienced emotions than were their predictions for a loss. These experiments further validated the relations between affection and decision making, and contributed to our understanding on the affective reactions to future events. Our study imply that it was not the exact calculation of affective forecast on decision outcomes, but rather the magnitude of affection on outcomes, that influenced people’s affective decision making. It indicated that those with lower magnitude of affection would less like to avoid losses, and thus more like to accept a gambling task.

Shaping Inputs to Reduce Vibration: A Vector Diagram Approach

This paper describes a method for limiting vibration in flexible systems by shaping the system inputs. Unlike most previous attempts at input shaping, this method does not require an extensive system model or lengthy numerical computation; only knowledge of the system natural frequency and damping ratio are required. The effectiveness of this method when there are errors in the system model is explored and quantified. An algorithm is presented which, given an upper bound on acceptable residual vibration amplitude, determines a shaping strategy that is insensitive to errors in the estimated natural frequency. A procedure for shaping inputs to systems with input constraints is outlined. The shaping method is evaluated by dynamic simulations and hardware experiments.

Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The underlying mathematics is for exact feature data, with no positional uncertainty. In practice, heuristics are added to handle uncertainty. We provide a precise analysis of affine point matching, obtaining an expression for the range of affine-invariant values consistent with bounded uncertainty. This analysis reveals that the range of affine-invariant values depends on the actual $x$-$y$-positions of the features, i.e. with uncertainty, affine representations are not invariant with respect to the Cartesian coordinate system. We analyze the effect of this on geometric hashing and alignment recognition methods.

Multi-Scale Vector-Ridge-Detection for Perceptual Organization Without Edges

We present a novel ridge detector that finds ridges on vector fields. It is designed to automatically find the right scale of a ridge even in the presence of noise, multiple steps and narrow valleys. One of the key features of such ridge detector is that it has a zero response at discontinuities. The ridge detector can be applied to scalar and vector quantities such as color. We also present a parallel perceptual organization scheme based on such ridge detector that works without edges; in addition to perceptual groups, the scheme computes potential focus of attention points at which to direct future processing. The relation to human perception and several theoretical findings supporting the scheme are presented. We also show results of a Connection Machine implementation of the scheme for perceptual organization (without edges) using color.

The Alignment of Objects With Smooth Surfaces: Error Analysis of the Curvature Method

The recognition of objects with smooth bounding surfaces from their contour images is considerably more complicated than that of objects with sharp edges, since in the former case the set of object points that generates the silhouette contours changes from one view to another. The "curvature method", developed by Basri and Ullman [1988], provides a method to approximate the appearance of such objects from different viewpoints. In this paper we analyze the curvature method. We apply the method to ellipsoidal objects and compute analytically the error obtained for different rotations of the objects. The error depends on the exact shape of the ellipsoid (namely, the relative lengths of its axes), and it increases a sthe ellipsoid becomes "deep" (elongated in the Z-direction). We show that the errors are usually small, and that, in general, a small number of models is required to predict the appearance of an ellipsoid from all possible views. Finally, we show experimentally that the curvature method applies as well to objects with hyperbolic surface patches.

On the Relationship Between Generalization Error, Hypothesis Complexity, and Sample Complexity for Radial Basis Functions

In this paper, we bound the generalization error of a class of Radial Basis Function networks, for certain well defined function learning tasks, in terms of the number of parameters and number of examples. We show that the total generalization error is partly due to the insufficient representational capacity of the network (because of its finite size) and partly due to insufficient information about the target function (because of finite number of samples). We make several observations about generalization error which are valid irrespective of the approximation scheme. Our result also sheds light on ways to choose an appropriate network architecture for a particular problem.

The Essential Dynamics Algorithm: Essential Results

This paper presents a novel algorithm for learning in a class of stochastic Markov decision processes (MDPs) with continuous state and action spaces that trades speed for accuracy. A transform of the stochastic MDP into a deterministic one is presented which captures the essence of the original dynamics, in a sense made precise. In this transformed MDP, the calculation of values is greatly simplified. The online algorithm estimates the model of the transformed MDP and simultaneously does policy search against it. Bounds on the error of this approximation are proven, and experimental results in a bicycle riding domain are presented. The algorithm learns near optimal policies in orders of magnitude fewer interactions with the stochastic MDP, using less domain knowledge. All code used in the experiments is available on the project's web site.