Multi-core structure of the main part of the Kuroshio at G-PN section in the East China Sea

Sectional velocity distribution of the East China Sea Kuroshio is one of the basic points in the study of the Kuroshio. Hydrographic temperature and salinity data at G-PN section in the East China Sea from June 1955 to November 2001 are collected and properly processed to calculate the geostrophic current using dynamic height method at the transect of the Kuroshio. After analysis of calculation results, the basic current structure of the Kuroshio in its main part is examined together with scalar estimate and characters of multi- core structure, and spacial-temporal variations of current cores' position. Main result shows that (1) single-core structure, double-core structure and multi-core structure are basic forms in axial part of the Kuroshio; (2) abvious temporal variations exist in current structure of the Kuroshio; (3) the current of structure of the Kuroshio has distinctly seasonal association. The number of current cores is on the high side of core numbers in average and multi-core stucture appears in fall mostly.

基于坐标变换的六维力传感器静态标定方法

为了提高传感器的测量精度,研究了六维力传感器标定矩阵的构造方法。首先,指出了传统标定矩阵的物理意义。然后,在传统标定矩阵中引入坐标平移变换算式,提出了一种综合考虑位置、姿态、坐标轴刻度比例缩放变换关系的六维力传感器静态标定方法。在标定试验的基础上,构造了标定矩阵,并对实测数据进行了补偿计算。误差分析表明:在传感测量系统无平移系统误差时,与传统标定方法相比,该方法的补偿精度略有下降。当在传感测量中加入平移系统误差时,该方法的补偿精度不变,而传统标定方法的测量精度明显下降。该方法起到了消除平移系统误差作用。

高斯束射线追踪

Using the approximate high-frequency asymptotic methods to solve the scalar wave equation, we can get the eikonal equation and transport equation. Solving the eikonal equation by the method of characteristics provides a mathematical derivation of ray tracing equations. So, the ray tracing system is folly based on the approximate high-frequency asymptotic methods. If the eikonal is complex, more strictly, the eikonal is real value at the rays and complex outside rays, we can derive the Gaussian beam. This article mainly concentrates on the theory of Gaussian beam. To classical ray tracing theory, the Gaussina beam method (GBM) has many advantages. First, rays are no longer required to stop at the exact position of the receivers; thus time-consuming two-point ray tracing can be avoided. Second, the GBM yields stable results in regions of the wavefield where the standard ray theory fails (e.g., caustics, shadows zones and critical distance). Third, unlike seismograms computed by conventional ray tracing techniques, the GBM synthetic data are less influenced by minor details in the model representation. Here, I realize kinematical and dynamical system, and based on this, realize the GBM. Also, I give some mathematical examples. From these examples, we can find the importance and feasibility of the ray tracing system. Besides, I've studied about the reflection coefficient of inhomogeneous S-electromagnetic wave at the interface of conductive media. Basing on the difference of directions of phase shift constant and attenuation constant when the electromagnetic wave propagates in conductive medium, and using the boundary conditions of electromagnetic wave at the interface of conductive media, we derive the reflection coefficient of inhomogeneous S-electromagnetic wave, and draw the curves of it. The curves show that the quasi total reflection will occur when the electromagnetic wave incident from the medium with greater conductivity to the medium with smaller conductivity. There are two peak, values at the points of the critical angles of phase shift constant and attenuation constant, and the reflection coefficient is smaller than 1. This conclusion is different from that of total reflection light obviously.

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 VITEWRITE Model of Handwriting Production

This article describes the VITEWRITE model for generating handwriting movements. The model consists of a sequential controller, or motor program, that interacts with a trajectory generator to move a hand with redundant degrees of freedom. The neural trajectory generator is the Vector Integration to Endpoint (VITE) model for synchronous variable-speed control of multijoint movements. VITE properties enable a simple control strategy to generate complex handwritten script if the hand model contains redundant degrees of freedom. The controller launches transient directional commands to independent hand synergies at times when the hand begins to move, or when a velocity peak in the outflow command to a given synergy occurs. The VITE model translates these temporally disjoint synergy commands into smooth curvilinear trajectories among temporally overlapping synergetic movements. Each synergy exhibits a unimodal velocity profile during any stroke, generates letters that are invariant under speed and size rescaling, and enables effortless connection of letter shapes into words. Speed and size rescaling are achieved by scalar GO and GRO signals that express computationally simple volitional commands. Psychophysical data such as the isochrony principle, asymmetric velocity profiles, and the two-thirds power law relating movement curvature and velocity arise as emergent properties of model interactions.

On the Relationship Between the Generalized Equality Classifier and ART 2 Neural Networks

In this paper, we introduce the Generalized Equality Classifier (GEC) for use as an unsupervised clustering algorithm in categorizing analog data. GEC is based on a formal definition of inexact equality originally developed for voting in fault tolerant software applications. GEC is defined using a metric space framework. The only parameter in GEC is a scalar threshold which defines the approximate equality of two patterns. Here, we compare the characteristics of GEC to the ART2-A algorithm (Carpenter, Grossberg, and Rosen, 1991). In particular, we show that GEC with the Hamming distance performs the same optimization as ART2. Moreover, GEC has lower computational requirements than AR12 on serial machines.

A Neural Pattern Generator that Exhibits Arousal-Dependant Human Gait Transitions

A neural pattern generator based upon a non-linear cooperative-competitive feedback neural network is presented. It can generate the two standard human gaits: the walk and the run. A scalar arousal or GO signal causes a bifurcation from one gait to the next. Although these two gaits are qualitatively different, they both have the same limb order and may exhibit oscillation frequencies that overlap. The model simulates the walk and the run via qualitatively different waveform shapes. The fraction of cycle that activity is above threshold distinguishes the two gaits, much as the duty cycles of the feet are longer in the walk than in the run.

Quadruped Gait Transitions from a Neural Pattern Generator with Arousal Modulated Interactions

A four-channel neural pattern generator is described in which both the frequency and the relative phase of oscillations are controlled by a scalar arousal or GO signal. The generator is used to simulate quadruped gaits; in particular, rapid transitions are simulated in the order - walk, trot, pace, and gallop - that occurs in the cat. Precise switching control is achieved by using an arousal dependent modulation of the model's inhibitory interactions. This modulation generates a different functional connectivity in a single network at different arousal levels.

A Neural Pattern Generator that Exhibits Frequency-Dependent In-Phase and Anti-Phase Oscillations

This article describes a. neural pattern generator based on a cooperative-competitive feedback neural network. The two-channel version of the generator supports both in-phase and anti-phase oscillations. A scalar arousal level controls both the oscillation phase and frequency. As arousal increases, oscillation frequency increases and bifurcations from in-phase to anti-phase, or anti-phase to in-phase oscillations can occur. Coupled versions of the model exhibit oscillatory patterns which correspond to the gaits used in locomotion and other oscillatory movements by various animals.

A Neural Network Model for Cursive Script Production

This article describes a neural network model, called the VITEWRITE model, for generating handwriting movements. The model consists of a sequential controller, or motor program, that interacts with a trajectory generator to move a. hand with redundant degrees of freedom. The neural trajectory generator is the Vector Integration to Endpoint (VITE) model for synchronous variable-speed control of multijoint movements. VITE properties enable a simple control strategy to generate complex handwritten script if the hand model contains redundant degrees of freedom. The proposed controller launches transient directional commands to independent hand synergies at times when the hand begins to move, or when a velocity peak in a given synergy is achieved. The VITE model translates these temporally disjoint synergy commands into smooth curvilinear trajectories among temporally overlapping synergetic movements. The separate "score" of onset times used in most prior models is hereby replaced by a self-scaling activity-released "motor program" that uses few memory resources, enables each synergy to exhibit a unimodal velocity profile during any stroke, generates letters that are invariant under speed and size rescaling, and enables effortless. connection of letter shapes into words. Speed and size rescaling are achieved by scalar GO and GRO signals that express computationally simple volitional commands. Psychophysical data concerning band movements, such as the isochrony principle, asymmetric velocity profiles, and the two-thirds power law relating movement curvature and velocity arise as emergent properties of model interactions.

Axial symmetry and transverse trace-free tensors in numerical relativity

Transverse trace-free (TT) tensors play an important role in the initial conditions of numerical relativity, containing two of the component freedoms. Expressing a TT tensor entirely, by the choice of two scalar potentials, is not a trivial task however. Assuming the added condition of axial symmetry, expressions are given in both spherical and cylindrical coordinates, for TT tensors in flat space. A coordinate relation is then calculated between the scalar potentials of each coordinate system. This is extended to a non-flat space, though only one potential is found. The remaining equations are reduced to form a second order partial differential equation in two of the tensor components. With the axially symmetric flat space tensors, the choice of potentials giving Bowen-York conformal curvatures, are derived. A restriction is found for the potentials which ensure an axially symmetric TT tensor, which is regular at the origin, and conditions on the potentials, which give an axially symmetric TT tensor with a spherically symmetric scalar product, are also derived. A comparison is made of the extrinsic curvatures of the exact Kerr solution and numerical Bowen-York solution for axially symmetric black hole space-times. The Brill wave, believed to act as the difference between the Kerr and Bowen-York space-times, is also studied, with an approximate numerical solution found for a mass-factor, under different amplitudes of the metric.

Gröbner basis techniques for certain problems in coding and systems theory

There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has shown that a Göbner basis approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time modeling, multivariable interpolation and list decoding. Gröbner basis theory has come into its own in the context of software and algorithm development. By generalizing the concept of polynomial degree, term orders are provided for multivariable polynomial rings and free modules over polynomial rings. The orders are not, in general, unique and this adds, in no small way, to the power and flexibility of the technique. As well as being generating sets for ideals or modules, Gröbner bases always contain a element which is minimal with respect tot the corresponding term order. Central to this thesis is a general algorithm, valid for any term order, that produces a Gröbner basis for the solution module (or ideal) of elements satisfying a sequence of generalized congruences. These congruences, based on shifts and homomorphisms, are applicable to a wide variety of problems, including key equations and interpolations. At the core of the algorithm is an incremental step. Iterating this step lends a recursive/iterative character to the algorithm. As a consequence, not all of the input to the algorithm need be available from the start and different "paths" can be taken to reach the final solution. The existence of a suitable chain of modules satisfying the criteria of the incremental step is a prerequisite for applying the algorithm.

Hardware design of cryptographic accelerators

With the rapid growth of the Internet and digital communications, the volume of sensitive electronic transactions being transferred and stored over and on insecure media has increased dramatically in recent years. The growing demand for cryptographic systems to secure this data, across a multitude of platforms, ranging from large servers to small mobile devices and smart cards, has necessitated research into low cost, flexible and secure solutions. As constraints on architectures such as area, speed and power become key factors in choosing a cryptosystem, methods for speeding up the development and evaluation process are necessary. This thesis investigates flexible hardware architectures for the main components of a cryptographic system. Dedicated hardware accelerators can provide significant performance improvements when compared to implementations on general purpose processors. Each of the designs proposed are analysed in terms of speed, area, power, energy and efficiency. Field Programmable Gate Arrays (FPGAs) are chosen as the development platform due to their fast development time and reconfigurable nature. Firstly, a reconfigurable architecture for performing elliptic curve point scalar multiplication on an FPGA is presented. Elliptic curve cryptography is one such method to secure data, offering similar security levels to traditional systems, such as RSA, but with smaller key sizes, translating into lower memory and bandwidth requirements. The architecture is implemented using different underlying algorithms and coordinates for dedicated Double-and-Add algorithms, twisted Edwards algorithms and SPA secure algorithms, and its power consumption and energy on an FPGA measured. Hardware implementation results for these new algorithms are compared against their software counterparts and the best choices for minimum area-time and area-energy circuits are then identified and examined for larger key and field sizes. Secondly, implementation methods for another component of a cryptographic system, namely hash functions, developed in the recently concluded SHA-3 hash competition are presented. Various designs from the three rounds of the NIST run competition are implemented on FPGA along with an interface to allow fair comparison of the different hash functions when operating in a standardised and constrained environment. Different methods of implementation for the designs and their subsequent performance is examined in terms of throughput, area and energy costs using various constraint metrics. Comparing many different implementation methods and algorithms is nontrivial. Another aim of this thesis is the development of generic interfaces used both to reduce implementation and test time and also to enable fair baseline comparisons of different algorithms when operating in a standardised and constrained environment. Finally, a hardware-software co-design cryptographic architecture is presented. This architecture is capable of supporting multiple types of cryptographic algorithms and is described through an application for performing public key cryptography, namely the Elliptic Curve Digital Signature Algorithm (ECDSA). This architecture makes use of the elliptic curve architecture and the hash functions described previously. These components, along with a random number generator, provide hardware acceleration for a Microblaze based cryptographic system. The trade-off in terms of performance for flexibility is discussed using dedicated software, and hardware-software co-design implementations of the elliptic curve point scalar multiplication block. Results are then presented in terms of the overall cryptographic system.

Landscapes of kingship in early medieval Ireland, AD 400–1150

This thesis explores the evolution of kingship in early medieval Ireland (AD 400–1150) through a kingdom based and multi-scalar approach to royal landscapes. Through exploring the role of place and landscape in the construction of early medieval Irish kingship, this study will assess the relationship between the social, economic and ideological roles of the king in Irish society. Kingship in Ireland was vested in places, such that royal landscapes were the pre-eminent symbol of regality and authority. As such, an interdisciplinary study of kingship grounded in archaeological methodologies has a unique potential to contribute to our knowledge of the practice of kingship. Consequently, this research considers the material apparatus of different scales of kingships and explores the role of landscape in the construction of kingship and the evolution of kingdoms. It takes two major case studies; (i) Cashel, Munster and the Éoganachta federation; and (ii) the Uí Néill, Tara and the Síl nÁedo Sláine kingdom of Brega. Through interdisciplinary methodologies it charts the genesis and development of political federations, focusing specifically on the role that royal landscapes’ played in their evolution. Similarly, this thesis engages critically with the nature of assembly places and practices in Ireland, and focuses specifically on issues pertaining to the nature of assembly and the archaeological manifestation of such practices. It includes a list of 115 landscapes identified as assembly places, and through the analysis of this material, this thesis examines the ways in which different types of royal sites articulated together to create royal landscapes implicated in the exercise of kingship, and the construction and maintenance of authority. Moreover, through the analysis of assembly places within the context of the development of kingdoms, and structures of jurisdiction and administration, it also investigates the evolution of supra-regional scales of identity and community associated with the emergence of major political federations in early medieval Ireland.

Lovelock terms and BRST cohomology

Lovelock terms are polynomial scalar densities in the Riemann curvature tensor that have the remarkable property that their Euler-Lagrange derivatives contain derivatives of the metric of an order not higher than 2 (while generic polynomial scalar densities lead to Euler-Lagrange derivatives with derivatives of the metric of order 4). A characteristic feature of Lovelock terms is that their first nonvanishing term in the expansion g λμ = η λμ + h λμ of the metric around flat space is a total derivative. In this paper, we investigate generalized Lovelock terms defined as polynomial scalar densities in the Riemann curvature tensor and its covariant derivatives (of arbitrarily high but finite order) such that their first nonvanishing term in the expansion of the metric around flat space is a total derivative. This is done by reformulating the problem as a BRST cohomological one and by using cohomological tools. We determine all the generalized Lovelock terms. We find, in fact, that the class of nontrivial generalized Lovelock terms contains only the usual ones. Allowing covariant derivatives of the Riemann tensor does not lead to a new structure. Our work provides a novel algebraic understanding of the Lovelock terms in the context of BRST cohomology. © 2005 IOP Publishing Ltd.