Modelling the vibration of tyre sidewalls

The dynamical behaviour of the sidewall has an important influence on tyre vibration characteristics. Nonetheless, it remains crudely represented in many existing models. The current work considers a geometrically accurate, two-dimensional, sidewall description, with a view to identifying potential shortcomings in the approximate formulations and identifying the physical characteristics that must be accounted for. First, the mean stress state under pressurisation and centrifugal loading is investigated. Finite-Element calculations show that, while the loaded sidewall shape remains close to a toroid, its in-plane tensions differ appreciably from the associated analytical solution. This is largely due to the inability of the anisotropic sidewall material to sustain significant azimuthal stress. An approximate analysis, based on the meridional tension alone, is therefore developed, and shown to yield accurate predictions. In conjunction with a set of formulae for the 'engineering constants' of the sidewall material, the approximate solutions provide a straightforward and efficient means of determining the base state for the vibration analysis. The latter is implemented via a 'waveguide' discretisation of a variational formulation. Its results show that, while the full geometrical description is necessary for a complete and reliable characterisation of the sidewall's vibrational properties, a one-dimensional approximation will often be satisfactory in practice. Meridional thickness variations only become important at higher frequencies (above 500 Hz for the example considered here), and rotational inertia effects appear to be minor at practical vehicle speeds. © 2013 Elsevier Ltd. All rights reserved.

Origin of the double- and multi-pulse structure of echolocation signals in Yangtze finless porpoise (Neophocaena phocaenoides asiaeorientialis)

The signals of dolphins and porpoises often exhibit a multi-pulse structure. Here, echolocation signal recordings were made from four geometrically distinct positions of seven Yangtze finless porpoises temporarily housed in a relatively small, enclosed area. Some clicks demonstrated double-pulse, and others multi-pulse, structure. The interpulse intervals between the first and second pulse of the double- and multi-pulse clicks were significantly different among data from the four different positions (p < 0.01, one-way ANOVA). These results indicate that the interpulse interval and structure of the double- and multi-pulse echolocation signals depend on the hydrophone geometry of the animal, and that the double- and multi-pulse structure of echolocation signals in Yangtze finless porpoise is not caused by the phonating porpoise itself, but by the multipath propagation of the signal. Time delays in the 180 degrees phase-shifted surface reflection pulse and the nonphase-shifted bottom reflection pulse of the multi-pulse structures, relative to the direct signal, can be used to calculate the distance to a phonating animal. (c) 2005 Acoustical Society of America.

Ultrafast geometric manipulation of electron spin and detection of the geometric phase via Faraday rotation spectroscopy

Time-resolved Faraday rotation spectroscopy is currently exploited as a powerful technique to probe spin dynamics in semiconductors. We propose here an all-optical approach to geometrically manipulate electron spin and to detect the geometric phase by this type of extremely sensitive experiment. The global nature of the geometric phase can make the quantum manipulation more stable, which may find interesting applications in quantum devices.

Tunneling transmission in two quantum wires coupled by a magnetically defined barrier

A numerical analysis of an electron waveguide coupler based on two quantum wires coupled by a magnetically defined barrier is presented with the use of the scattering-matrix method. For different geometry parameters and magnetic fields, tunneling transmission spectrum is obtained as a function of the electron energy. Different from that of conventional electron waveguide couplers, the transmission spectrum of the magnetically coupled quantum wires does not have the symmetry with regard to those geometrically symmetrical ports, It was found that the magnetic field in the coupling region drastically enhances the coupling between the two quantum wires for one specific input port while it weakens the coupling for the other input port. The results can be well understood by the formation of the edge states in the magnetically defined barrier region. Thus, whether these edge states couple or decouple to the electronic propagation modes in the two quantum wires, strongly depend on the relative moving directions of electrons in the propagating mode in the input port and the edge states in the magnetic region. This leads to a big difference in transmission coefficients between two quantum wires when injecting electrons via different input ports. Two important coupler specifications, the directivity and uniformity, are calculated which show that the system we considered behaves as a good quantum directional coupler. (C) 1997 American Institute of Physics.

Local histogram based geometric invariant image watermarking

Compared with other existing methods, the feature point-based image watermarking schemes can resist to global geometric attacks and local geometric attacks, especially cropping and random bending attacks (RBAs), by binding watermark synchronization with salient image characteristics. However, the watermark detection rate remains low in the current feature point-based watermarking schemes. The main reason is that both of feature point extraction and watermark embedding are more or less related to the pixel position, which is seriously distorted by the interpolation error and the shift problem during geometric attacks. In view of these facts, this paper proposes a geometrically robust image watermarking scheme based on local histogram. Our scheme mainly consists of three components: (1) feature points extraction and local circular regions (LCRs) construction are conducted by using Harris-Laplace detector; (2) a mechanism of grapy theoretical clustering-based feature selection is used to choose a set of non-overlapped LCRs, then geometrically invariant LCRs are completely formed through dominant orientation normalization; and (3) the histogram and mean statistically independent of the pixel position are calculated over the selected LCRs and utilized to embed watermarks. Experimental results demonstrate that the proposed scheme can provide sufficient robustness against geometric attacks as well as common image processing operations. (C) 2010 Elsevier B.V. All rights reserved.

Geometric Distortion Insensitive Image Watermarking in Affine Covariant Regions

Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness against rotation, scaling, and translation, but few are resistant to cropping, nonisotropic scaling, random bending attacks (RBAs), and affine transformations. Seo and Yoo present a geometrically invariant image watermarking based on affine covariant regions (ACRs) that provide a certain degree of robustness. To further enhance the robustness, we propose a new image watermarking scheme on the basis of Seo's work, which is insensitive to geometric distortions as well as common image processing operations. Our scheme is mainly composed of three components: 1) feature selection procedure based on graph theoretical clustering algorithm is applied to obtain a set of stable and nonoverlapped ACRs; 2) for each chosen ACR, local normalization, and orientation alignment are performed to generate a geometrically invariant region, which can obviously improve the robustness of the proposed watermarking scheme; and 3) in order to prevent the degradation in image quality caused by the normalization and inverse normalization, indirect inverse normalization is adopted to achieve a good compromise between the imperceptibility and robustness. Experiments are carried out on an image set of 100 images collected from Internet, and the preliminary results demonstrate that the developed method improves the performance over some representative image watermarking approaches in terms of robustness.

Bézier曲线间最近距离的计算方法

针对Bzier曲线间最近距离计算问题,提出一种简捷、可靠的计算方法.该方法以Bernstein多项式算术运算为工具,建立Bzier曲线间最近距离的计算模型;然后充分利用Bzier曲面的凸包性质和de Casteljau分割算法进行求解.该方法几何意义明确,能有效地避免迭代初始值的选择和非线性方程组的求解,并可进一步推广应用于计算Bzier曲线/曲面间的最近距离.实验结果表明,该方法简捷、可靠且容易实现,与Newton-Raphson方法的融合可进一步提高该方法的运行速度.

Feature Matching for Object Localization in the Presence of Uncertainty

We consider the problem of matching model and sensory data features in the presence of geometric uncertainty, for the purpose of object localization and identification. The problem is to construct sets of model feature and sensory data feature pairs that are geometrically consistent given that there is uncertainty in the geometry of the sensory data features. If there is no geometric uncertainty, polynomial-time algorithms are possible for feature matching, yet these approaches can fail when there is uncertainty in the geometry of data features. Existing matching and recognition techniques which account for the geometric uncertainty in features either cannot guarantee finding a correct solution, or can construct geometrically consistent sets of feature pairs yet have worst case exponential complexity in terms of the number of features. The major new contribution of this work is to demonstrate a polynomial-time algorithm for constructing sets of geometrically consistent feature pairs given uncertainty in the geometry of the data features. We show that under a certain model of geometric uncertainty the feature matching problem in the presence of uncertainty is of polynomial complexity. This has important theoretical implications by demonstrating an upper bound on the complexity of the matching problem, an by offering insight into the nature of the matching problem itself. These insights prove useful in the solution to the matching problem in higher dimensional cases as well, such as matching three-dimensional models to either two or three-dimensional sensory data. The approach is based on an analysis of the space of feasible transformation parameters. This paper outlines the mathematical basis for the method, and describes the implementation of an algorithm for the procedure. Experiments demonstrating the method are reported.

3D Pose from Three Corresponding Points Under Weak-Perspective Projection

Model-based object recognition commonly involves using a minimal set of matched model and image points to compute the pose of the model in image coordinates. Furthermore, recognition systems often rely on the "weak-perspective" imaging model in place of the perspective imaging model. This paper discusses computing the pose of a model from three corresponding points under weak-perspective projection. A new solution to the problem is proposed which, like previous solutins, involves solving a biquadratic equation. Here the biquadratic is motivate geometrically and its solutions, comprised of an actual and a false solution, are interpreted graphically. The final equations take a new form, which lead to a simple expression for the image position of any unmatched model point.

Non-commutative symbolic coding

Gohm, Rolf; Kummerer, B.; Lang, T., (2006) 'Non-commutative symbolic coding', Ergodic Theory and Dynamical Systems 26(5) pp.1521-1548 RAE2008

Ergodicity and Mixing Rate of One-Dimensional Cellular Automata

One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability ε or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton L called the soldiers rule, this problem has intrigued researchers for the last two decades since L is clearly more robust than local voting: in the absence of noise, L eliminates any finite island of perturbation from an initial configuration of all 0's or all 1's. The same holds for a 4-state monotonic variant of L, K, called two-line voting. We will prove that the probabilistic cellular automata Kε and Lε asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time Relax(⋅), which measures the time before the onset of significant information loss. This is known to grow as (1/ε)^c for noisy local voting. The impressive error-correction ability of L has prompted some researchers to conjecture that Relax(Lε) = 2^(c/ε). We prove the tight bound 2^(c1log^21/ε) ＜ Relax(Lε) ＜ 2^(c2log^21/ε) for a biased error model. The same holds for Kε. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance.

Nonlinear piezoelectricity in electroelastic energy harvesters: Modeling and experimental identification

We propose and experimentally validate a first-principles based model for the nonlinear piezoelectric response of an electroelastic energy harvester. The analysis herein highlights the importance of modeling inherent piezoelectric nonlinearities that are not limited to higher order elastic effects but also include nonlinear coupling to a power harvesting circuit. Furthermore, a nonlinear damping mechanism is shown to accurately restrict the amplitude and bandwidth of the frequency response. The linear piezoelectric modeling framework widely accepted for theoretical investigations is demonstrated to be a weak presumption for near-resonant excitation amplitudes as low as 0.5 g in a prefabricated bimorph whose oscillation amplitudes remain geometrically linear for the full range of experimental tests performed (never exceeding 0.25% of the cantilever overhang length). Nonlinear coefficients are identified via a nonlinear least-squares optimization algorithm that utilizes an approximate analytic solution obtained by the method of harmonic balance. For lead zirconate titanate (PZT-5H), we obtained a fourth order elastic tensor component of c1111p =-3.6673× 1017 N/m2 and a fourth order electroelastic tensor value of e3111 =1.7212× 108 m/V. © 2010 American Institute of Physics.

Convergence of numerical time-averaging and stationary measures via Poisson equations

Numerical approximation of the long time behavior of a stochastic di.erential equation (SDE) is considered. Error estimates for time-averaging estimators are obtained and then used to show that the stationary behavior of the numerical method converges to that of the SDE. The error analysis is based on using an associated Poisson equation for the underlying SDE. The main advantages of this approach are its simplicity and universality. It works equally well for a range of explicit and implicit schemes, including those with simple simulation of random variables, and for hypoelliptic SDEs. To simplify the exposition, we consider only the case where the state space of the SDE is a torus, and we study only smooth test functions. However, we anticipate that the approach can be applied more widely. An analogy between our approach and Stein's method is indicated. Some practical implications of the results are discussed. Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.

Improving cold chain technologies through the use of phase change material

Gemstone Team FRESH

Three parallel programming paradigms: Comparisons on an archetypal PDE computation

Three paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation -- a nonlinear, structured-grid partial differential equation boundary value problem -- using the same algorithm on the same hardware. All of the paradigms -- parallel languages represented by the Portland Group's HPF, (semi-)automated serial-to-parallel source-to-source translation represented by CAP-Tools from the University of Greenwich, and parallel libraries represented by Argonne's PETSc -- are found to be easy to use for this problem class, and all are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under any paradigm includes specification of the data partitioning, corresponding to a geometrically simple decomposition of the domain of the PDE. Programming in SPMD style for the PETSc library requires writing only the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global-to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm as a starting point, introduction of concurrency through subdomain blocking (a task similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Programming with CAPTools involves feeding the same sequential implementation to the CAPTools interactive parallelization system, and guiding the source-to-source code transformation by responding to various queries about quantities knowable only at runtime. Results representative of "the state of the practice" for a scaled sequence of structured grid problems are given on three of the most important contemporary high-performance platforms: the IBM SP, the SGI Origin 2000, and the CRAYY T3E.