Impact of difference accuracy on computational properties of vertical grids for a nonhydrostatic model

Starting from nonhydrostatic Boussinesq approximation equations, a general method is introduced to deduce the dispersion relationships. A comparative investigation is performed on inertia-gravity wave with horizontal lengths of 100, 10 and 1 km. These are examined using the second-order central difference scheme and the fourth-order compact difference scheme on vertical grids that are currently available from the perspectives of frequency, horizontal and vertical component of group velocity. These findings are compared to analytical solutions. The obtained results suggest that whether for the second-order central difference scheme or for the fourth-order compact difference scheme, Charny-Phillips and Lorenz ( L) grids are suitable for studying waves at the above-mentioned horizontal scales; the Lorenz time-staggered and Charny-Phillips time staggered (CPTS) grids are applicable only to the horizontal scales of less than 10 km, and N grid ( unstaggered grid) is unsuitable for simulating waves at any horizontal scale. Furthermore, by using fourth-order compact difference scheme with higher difference precision, the errors of frequency and group velocity in horizontal and vertical directions produced on all vertical grids in describing the waves with horizontal lengths of 1, 10 and 100 km cannot inevitably be decreased. So in developing a numerical model, the higher-order finite difference scheme, like fourth-order compact difference scheme, should be avoided as much as possible, typically on L and CPTS grids, since it will not only take many efforts to design program but also make the calculated group velocity in horizontal and vertical directions even worse in accuracy.

全地形轮式移动机器人运动学建模与分析

提出全地形轮式移动机器人的正逆运动学问题。将机器人看成一个混合串-并联多刚体系统,从每个轮-地接触点到机器人车体分别构成一个串联子系统,抛弃车轮纯滚动假设,在轮-地接触点处建立瞬时坐标系,考虑车轮的平面滑移,从而对每个串联子系统形成一个封闭的速度链。对于每个速度闭链,可直接在驱动轮轮心处写出从机器人各驱动轮到机器人本体之间的运动方程,将每个速度闭链的运动方程合并即可得到机器人的整体运动学模型。以一个具有被动柔顺机构的六轮全地形移动机器人为对象进行推导,该方法既考虑了地形不平的影响,又考虑了车轮的前向、侧向及转向滑移,已知机构参数后就可以直接写出机器人的速度方程,且便于运动学求解。该方法对于轮式移动机器人的运动学建模具有一般性,且具有物理意义明确、推导过程简洁等特点。

基于SolidWorks斜齿轮、蜗轮三维建模的研究

详细阐述利用VB6.0进行SolidWorks二次开发的关键技术,论述斜齿轮的三维参数化建模系统开发的具体过程,对比了不同建模方法的特点,提出齿轮三维建模误差分析的两种方法,为模型应用提供了理论指导,同时对该研究方法的拓展性应用举出实例,给出用VB开发SolidWorks一般方法。

基于多Agent可重构机器人控制方法的研究

根据多 Agent理论中的协商、合作机制和可重构机器人结构的分布性 ,将集中式的机器人控制分配到一组关节 Agent中 ,每个 Agent控制机器人的一个关节 ,使用这种分布式方法 ,得到了一种新的通用机器人控制方法 ,即将关节机器人的复杂控制转换为多个简单子系统的控制 ,该方法可应用于具有不同构型的机器人系统 ,特别适用于可重构模块化机器人的控制。利用微分运动理论提出了一种新的决策方法 ,便于 Agent之间的合作与协商。仿真实验结果表明该方法是一种可行的机器人控制方法

QNX设备驱动程序的编制

简要介绍了QNX操作系统，论述了QNX驱动程序的特点，在与其它系统相比较的基础上，详细描述了QNX设备驱动程序在HAL层编写规范——资源管理器的一般编制方法。

f-x-y域去除随机噪音方法研究

The seismic survey is the most effective prospecting geophysical method during exploration and development of oil/gas. The structure and the lithology of the geological body become increasingly complex now. So it must assure that the seismic section own upper resolution if we need accurately describe the targets. High signal/noise ratio is the precondition of high-resolution. For the sake of improving signal/noise ratio, we put forward four methods for eliminating random noise on the basis of detailed analysis of the technique for noise elimination using prediction filtering in f-x-y domain. The four methods are put forward for settling different problems, which are in the technique for noise elimination using prediction filtering in f-x-y domain. For weak noise and large filters, the response of the noise to the filter is little. For strong noise and short filters, the response of the noise to the filter is important. For the response of the noise, the predicting operators are inaccurate. The inaccurate operators result in incorrect results. So we put forward the method using prediction filtering by inversion in f-x-y domain. The method makes the assumption that the seismic signal comprises predictable proportion and unpredictable proportion. The transcendental information about predicting operator is introduced in the function. The method eliminates the response of the noise to filtering operator, and assures that the filtering operators are accurate. The filtering results are effectively improved by the method. When the dip of the stratum is very complex, we generally divide the data into rectangular patches in order to obtain the predicting operators using prediction filtering in f-x-y domain. These patches usually need to have significant overlap in order to get a good result. The overlap causes that the data is repeatedly used. It effectively increases the size of the data. The computational cost increases with the size of the data. The computational efficiency is depressed. The predicting operators, which are obtained by general prediction filtering in f-x-y domain, can not describe the change of the dip when the dip of the stratum is very complex. It causes that the filtering results are aliased. And each patch is an independent problem. In order to settle these problems, we put forward the method for eliminating noise using space varying prediction filtering in f-x-y domain. The predicting operators accordingly change with space varying in this method. Therefore it eliminates the false event in the result. The transcendental information about predicting operator is introduced into the function. To obtain the predicting operators of each patch is no longer independent problem, but related problem. Thus it avoids that the data is repeatedly used, and improves computational efficiency. The random noise that is eliminated by prediction filtering in f-x-y domain is Gaussian noise. The general method can't effectively eliminate non-Gaussian noise. The prediction filtering method using lp norm (especially p=l) can effectively eliminate non-Gaussian noise in f-x-y domain. The method is described in this paper. Considering the dip of stratum can be accurately obtained, we put forward the method for eliminating noise using prediction filtering under the restriction of the dip in f-x-y domain. The method can effectively increase computational efficiency and improve the result. Through calculating in the theoretic model and applying it to the field data, it is proved that the four methods in this paper can effectively solve these different problems in the general method. Their practicability is very better. And the effect is very obvious.

Non-tactical symmetric nets

Mavron, Vassili; Al-Kenani, A.N., (2003) 'Non-tactical symmetric nets', Journal of the London Mathematical Society 67(2) pp.273-288 RAE2008

Diagnosing Network-Wide Traffic Anomalies

Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem because one must extract and interpret anomalous patterns from large amounts of high-dimensional, noisy data. In this paper we propose a general method to diagnose anomalies. This method is based on a separation of the high-dimensional space occupied by a set of network traffic measurements into disjoint subspaces corresponding to normal and anomalous network conditions. We show that this separation can be performed effectively using Principal Component Analysis. Using only simple traffic measurements from links, we study volume anomalies and show that the method can: (1) accurately detect when a volume anomaly is occurring; (2) correctly identify the underlying origin-destination (OD) flow which is the source of the anomaly; and (3) accurately estimate the amount of traffic involved in the anomalous OD flow. We evaluate the method's ability to diagnose (i.e., detect, identify, and quantify) both existing and synthetically injected volume anomalies in real traffic from two backbone networks. Our method consistently diagnoses the largest volume anomalies, and does so with a very low false alarm rate.

Simultaneous Localization and Recognition of Dynamic Hand Gestures

A framework for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this framework is a dynamic space-time warping (DSTW) algorithm, that aligns a pair of query and model gestures in both space and time. For every frame of the query sequence, feature detectors generate multiple hand region candidates. Dynamic programming is then used to compute both a global matching cost, which is used to recognize the query gesture, and a warping path, which aligns the query and model sequences in time, and also finds the best hand candidate region in every query frame. The proposed framework includes translation invariant recognition of gestures, a desirable property for many HCI systems. The performance of the approach is evaluated on a dataset of hand signed digits gestured by people wearing short sleeve shirts, in front of a background containing other non-hand skin-colored objects. The algorithm simultaneously localizes the gesturing hand and recognizes the hand-signed digit. Although DSTW is illustrated in a gesture recognition setting, the proposed algorithm is a general method for matching time series, that allows for multiple candidate feature vectors to be extracted at each time step.

The Construction of Arbitrary Stable Dynamics in Non-Linear Neural Networks

In this paper, two methods for constructing systems of ordinary differential equations realizing any fixed finite set of equilibria in any fixed finite dimension are introduced; no spurious equilibria are possible for either method. By using the first method, one can construct a system with the fewest number of equilibria, given a fixed set of attractors. Using a strict Lyapunov function for each of these differential equations, a large class of systems with the same set of equilibria is constructed. A method of fitting these nonlinear systems to trajectories is proposed. In addition, a general method which will produce an arbitrary number of periodic orbits of shapes of arbitrary complexity is also discussed. A more general second method is given to construct a differential equation which converges to a fixed given finite set of equilibria. This technique is much more general in that it allows this set of equilibria to have any of a large class of indices which are consistent with the Morse Inequalities. It is clear that this class is not universal, because there is a large class of additional vector fields with convergent dynamics which cannot be constructed by the above method. The easiest way to see this is to enumerate the set of Morse indices which can be obtained by the above method and compare this class with the class of Morse indices of arbitrary differential equations with convergent dynamics. The former set of indices are a proper subclass of the latter, therefore, the above construction cannot be universal. In general, it is a difficult open problem to construct a specific example of a differential equation with a given fixed set of equilibria, permissible Morse indices, and permissible connections between stable and unstable manifolds. A strict Lyapunov function is given for this second case as well. This strict Lyapunov function as above enables construction of a large class of examples consistent with these more complicated dynamics and indices. The determination of all the basins of attraction in the general case for these systems is also difficult and open.

Projective injections of geometries and their affine extensions

We present a general method allowing the construction geometries whose diagram is an extension of the diagram of a given geometry. Some applications of this construction process are described. © 1995 Birkhäuser Verlag.

Case base adaptation using solution-space metrics

In this paper we propose a generalisation of the k-nearest neighbour (k-NN) retrieval method based on an error function using distance metrics in the solution and problem space. It is an interpolative method which is proposed to be effective for sparse case bases. The method applies equally to nominal, continuous and mixed domains, and does not depend upon an embedding n-dimensional space. In continuous Euclidean problem domains, the method is shown to be a generalisation of the Shepard's Interpolation method. We term the retrieval algorithm the Generalised Shepard Nearest Neighbour (GSNN) method. A novel aspect of GSNN is that it provides a general method for interpolation over nominal solution domains. The performance of the retrieval method is examined with reference to the Iris classification problem,and to a simulated sparse nominal value test problem. The introducion of a solution-space metric is shown to out-perform conventional nearest neighbours methods on sparse case bases.

Case based adaptation using interpolation over nominal values

In this paper we propose a method for interpolation over a set of retrieved cases in the adaptation phase of the case-based reasoning cycle. The method has two advantages over traditional systems: the first is that it can predict “new” instances, not yet present in the case base; the second is that it can predict solutions not present in the retrieval set. The method is a generalisation of Shepard’s Interpolation method, formulated as the minimisation of an error function defined in terms of distance metrics in the solution and problem spaces. We term the retrieval algorithm the Generalised Shepard Nearest Neighbour (GSNN) method. A novel aspect of GSNN is that it provides a general method for interpolation over nominal solution domains. The method is illustrated in the paper with reference to the Irises classification problem. It is evaluated with reference to a simulated nominal value test problem, and to a benchmark case base from the travel domain. The algorithm is shown to out-perform conventional nearest neighbour methods on these problems. Finally, GSNN is shown to improve in efficiency when used in conjunction with a diverse retrieval algorithm.

Evaluation of particle degradation due to high-speed impacts in a pneumatic handling system

Particle degradation can be a significant issue in particulate solids handling and processing, particularly in pneumatic conveying systems, in which high-speed impact is usually the main contributory factor leading to changes in particle size distribution (comparing the material to its virgin state). However, other factors may strongly influence particles breakage as well, such as particle concentrations, bend geometry,and hardness of pipe material. Because of such complex influences, it is often very difficult to predict particle degradation accurately and rapidly for industrial processes. In this article, a general method for evaluating particle degradation due to high-speed impacts is described, in which the breakage properties of particles are quantified using what are known as "breakage matrices". Rather than a pilot-size test facility, a bench-scale degradation tester has been used. Some advantages of using the bench-scale tester are briefly explored. Experimental determination of adipic acid has been carried out for a range of impact velocities in four particle size categories. Subsequently, particle breakage matrices of adipic acid have been established for these impact velocities. The experimental results show that the "breakage matrices" of particles is an effective and easy method for evaluation of particle degradation due to high-speed impacts. The possibility of the "breakage matrices" approach being applied to a pneumatic conveying system is also explored by a simulation example.

Extraction of electrode kinetic parameters from microdisc voltammetric data measured under transport conditions intermediate between steady-state convergent and transient linear diffusion as typically applies to room temperature ionic liquids

The extraction of electrode kinetic parameters for electrochemical couples in room-temperature ionic liquids (RTILs) is currently an area of considerable interest. Electrochemists typically measure electrode kinetics in the limits of either transient planar or steady-state convergent diffusion for which the voltammetic response is well understood. In this paper we develop a general method allowing the extraction of this kinetic data in the region where the diffusion is intermediate between the planar and convergent limits, such as is often encountered in RTILs using microelectrode voltammetry. A general working surface is derived, allowing the inference of Butler-Volmer standard electrochemical rate constants for the peak-to-peak potential separation in a cyclic voltammogram as a function of voltage scan rate. The method is applied to the case of the ferrocene/ferrocenium couple in [C(2)mim][N(Tf)(2)] and [C(4)mim][N(Tf)(2)].