27 resultados para parallel computation model
Resumo:
Spatial light modulators based around liquid crystal on silicon have found use in a variety of telecommunications applications, including the optimization of multimode fibers, free-space communications, and wavelength selective switching. Ferroelectric liquid crystals are attractive in these areas due to their fast switching times and high phase stability, but the necessity for the liquid crystal to spend equal time in each of its two possible states is an issue of practical concern. Using the highly parallel nature of a graphics processing unit architecture, it is possible to calculate DC balancing schemes of exceptional quality and stability.
Resumo:
A parallel processing network derived from Kanerva's associative memory theory Kanerva 1984 is shown to be able to train rapidly on connected speech data and recognize further speech data with a label error rate of 0·68%. This modified Kanerva model can be trained substantially faster than other networks with comparable pattern discrimination properties. Kanerva presented his theory of a self-propagating search in 1984, and showed theoretically that large-scale versions of his model would have powerful pattern matching properties. This paper describes how the design for the modified Kanerva model is derived from Kanerva's original theory. Several designs are tested to discover which form may be implemented fastest while still maintaining versatile recognition performance. A method is developed to deal with the time varying nature of the speech signal by recognizing static patterns together with a fixed quantity of contextual information. In order to recognize speech features in different contexts it is necessary for a network to be able to model disjoint pattern classes. This type of modelling cannot be performed by a single layer of links. Network research was once held back by the inability of single-layer networks to solve this sort of problem, and the lack of a training algorithm for multi-layer networks. Rumelhart, Hinton & Williams 1985 provided one solution by demonstrating the "back propagation" training algorithm for multi-layer networks. A second alternative is used in the modified Kanerva model. A non-linear fixed transformation maps the pattern space into a space of higher dimensionality in which the speech features are linearly separable. A single-layer network may then be used to perform the recognition. The advantage of this solution over the other using multi-layer networks lies in the greater power and speed of the single-layer network training algorithm. © 1989.
Resumo:
In Multiplexed MPC, the control variables of a MIMO plant are moved asynchronously, following a pre-planned periodic sequence. The advantage of Multiplexed MPC lies in its reduced computational complexity, leading to faster response to disturbances, which may result in improved performance, despite finding sub-optimal solution to the original problem. This paper extends the original Multiplexed MPC in a way such that the control inputs are no longer restricted to a pre-planned periodic sequence. Instead, the most appropriate control input channel would be optimised and selected to counter the disturbances, hence the name 'Channel-Hopping'. In addition, the proposed algorithm is suitable for execution on modern computing platforms such as FPGA or GPU, exploits multi-core, parallel and pipeline computing techniques. The algorithm for the proposed Channel-hopping MPC (CH-MPC) will be described and its stability established. Illustrative examples are given to demonstrate the behaviour of the proposed Channel-Hopping MPC algorithm. © 2011 IFAC.
Resumo:
We describe new results on the vibrations of rolling tyres, aimed at noise prediction for tyres of given design on a smooth road surface. This new approach incorporates our existing models, of smooth road-tyre interaction and belt vibration but includes additional features that are required for real tyre patterns. To this end, the model allows variable tread block size and grooves along the belt circumference; the density and angle of these grooves may also vary laterally. The key innovation is to treat the tyre belt as a laterally stacked series of rings, each of which is equipped with a set of viscoelastic springs around its circumference. It is shown how to use this construction to mimic the details of actual tyre patterns and, in conjunction with existing models, predict belt vibrations. The construction is applied to develop a ring discretisation for a real tyre that shows strong lateral variations. It is shown that the vibration amplitude is concentrated on a set of parallel lines in frequency-wavenumber space and that the tread pattern dictates the occurrence and spacing of these lines. Linkage to a boundary element calculation then allows quantification of the influence of tread parameters on radiated noise. Keywords: Vibration, tread pattern, tyre noise. Copyright © (2011) by the Institute of Noise Control Engineering.
Resumo:
The computation of both transient and steady turbulent incompressible isothermal flows is studied. The flow is very complex, having streamline curvature, large vortex structures and stagnation resulting from an impinging rectangular jet. For transient computations, the standard k-ε model is adopted. For steady flows, the k-ε, high and low Reynolds number k-l and mixing length models are tried. Zonal approaches combining the above turbulence models are also investigated. None of the models are found to give satisfactory agreement with velocity measurements.
Resumo:
A heated rotating cavity with an axial throughflow of cooling air is used as a model for the flow in the cylindrical cavities between adjacent discs of a high-pressure gas-turbine compressor. In an engine the flow is expected to be turbulent, the limitations of this laminar study are fully realised but it is considered an essential step to understand the fundamental nature of the flow. The three-dimensional, time-dependent governing equations are solved using a code based on the finite volume technique and a multigrid algorithm. The computed flow structure shows that flow enters the cavity in one or more radial arms and then forms regions of cyclonic and anticyclonic circulation. This basic flow structure is consistent with existing experimental evidence obtained from flow visualization. The flow structure also undergoes cyclic changes with time. For example, a single radial arm, and pair of recirculation regions can commute to two radial arms and two pairs of recirculation regions and then revert back to one. The flow structure inside the cavity is found to be heavily influenced by the radial distribution of surface temperature imposed on the discs. As the radial location of the maximum disc temperature moves radially outward, this appears to increase the number of radial arms and pairs of recirculation regions (from one to three for the distributions considered here). If the peripheral shroud is also heated there appear to be many radial arms which exchange fluid with a strong cyclonic flow adjacent to the shroud. One surface temperature distribution is studied in detail and profiles of the relative tangential and radial velocities are presented. The disc heat transfer is also found to be influenced by the disc surface temperature distribution. It is also found that the computed Nusselt numbers are in reasonable accord over most of the disc surface with a correlation found from previous experimental measurements. © 1994, MCB UP Limited.
Resumo:
Some amount of differential settlement occurs even in the most uniform soil deposit, but it is extremely difficult to estimate because of the natural heterogeneity of the soil. The compression response of the soil and its variability must be characterised in order to estimate the probability of the differential settlement exceeding a certain threshold value. The work presented in this paper introduces a probabilistic framework to address this issue in a rigorous manner, while preserving the format of a typical geotechnical settlement analysis. In order to avoid dealing with different approaches for each category of soil, a simplified unified compression model is used to characterise the nonlinear compression behavior of soils of varying gradation through a single constitutive law. The Bayesian updating rule is used to incorporate information from three different laboratory datasets in the computation of the statistics (estimates of the means and covariance matrix) of the compression model parameters, as well as of the uncertainty inherent in the model.
Resumo:
Bistable dynamical switches are frequently encountered in mathematical modeling of biological systems because binary decisions are at the core of many cellular processes. Bistable switches present two stable steady-states, each of them corresponding to a distinct decision. In response to a transient signal, the system can flip back and forth between these two stable steady-states, switching between both decisions. Understanding which parameters and states affect this switch between stable states may shed light on the mechanisms underlying the decision-making process. Yet, answering such a question involves analyzing the global dynamical (i.e., transient) behavior of a nonlinear, possibly high dimensional model. In this paper, we show how a local analysis at a particular equilibrium point of bistable systems is highly relevant to understand the global properties of the switching system. The local analysis is performed at the saddle point, an often disregarded equilibrium point of bistable models but which is shown to be a key ruler of the decision-making process. Results are illustrated on three previously published models of biological switches: two models of apoptosis, the programmed cell death and one model of long-term potentiation, a phenomenon underlying synaptic plasticity. © 2012 Trotta et al.
Resumo:
We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in ℝn. In these formulas, p-planes are represented as the column space of n × p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications - computing an invariant subspace of a matrix and the mean of subspaces - are worked out.
Resumo:
In recent years, there has been increasing interest in the study of gait patterns in both animals and robots, because it allows us to systematically investigate the underlying mechanisms of energetics, dexterity, and autonomy of adaptive systems. In particular, for morphological computation research, the control of dynamic legged robots and their gait transitions provides additional insights into the guiding principles from a synthetic viewpoint for the emergence of sensible self-organizing behaviors in more-degrees-of-freedom systems. This article presents a novel approach to the study of gait patterns, which makes use of the intrinsic mechanical dynamics of robotic systems. Each of the robots consists of a U-shaped elastic beam and exploits free vibration to generate different locomotion patterns. We developed a simplified physics model of these robots, and through experiments in simulation and real-world robotic platforms, we show three distinctive mechanisms for generating different gait patterns in these robots.