44 resultados para Train Crashworthiness
em Cambridge University Engineering Department Publications Database
Resumo:
The frequency range of interest for ground vibration from underground urban railways is approximately 20 to 100 Hz. For typical soils, the wavelengths of ground vibration in this frequency range are of the order of the spacing of train axles, the tunnel diameter and the distance from the tunnel to nearby building foundations. For accurate modelling, the interactions between these entities therefore have to be taken into account. This paper describes an analytical three-dimensional model for the dynamics of a deep underground railway tunnel of circular cross-section. The tunnel is conceptualised as an infinitely long, thin cylindrical shell surrounded by soil of infinite radial extent. The soil is modelled by means of the wave equations for an elastic continuum. The coupled problem is solved in the frequency domain by Fourier decomposition into ring modes circumferentially and a Fourier transform into the wavenumber domain longitudinally. Numerical results for the tunnel and soil responses due to a normal point load applied to the tunnel invert are presented. The tunnel model is suitable for use in combination with track models to calculate the ground vibration due to excitation by running trains and to evaluate different track configurations. © 2006 Elsevier Ltd. All rights reserved.
Crashworthiness of helicopters on water: Test and simulation of a full-scale WG30 impacting on water
Resumo:
The authors present numerical simulations of ultrashort pulse generation by a technique of linear spectral broadening in phase modulators and compression in dispersion compensating fibre, followed by a further stage of soliton compression in dispersion shifted fibre. This laser system is predicted to generate pulses of 140 fs duration with a peak power of 1.5 kW over a wide, user selectable repetition rate range while maintaining consistent characteristics of stability and pulse quality. The use of fibre compressors and commercially available modulators is expected to make the system setup compact and cost-effective. © The Institution of Engineering and Technology 2014.
Resumo:
Coupled-cavity passive harmonic mode-locking of a quantum well based vertical-external-cavity surface-emitting laser has been demonstrated, yielding an output pulse train of 1.5 ps pulses at a repetition rate of 80 GHz and with an average power of 80 mW. Harmonic mode-locking results from coupling between the main laser cavity and a cavity formed within the substrate of the saturable absorber structure. Mode-locking on the second harmonic of the substrate cavity allows a train of 1.1 ps pulses to be generated at a repetition rate of 147 GHz with 40 mW average power. © 2010 American Institute of Physics.
Resumo:
This paper describes two applications in speech recognition of the use of stochastic context-free grammars (SCFGs) trained automatically via the Inside-Outside Algorithm. First, SCFGs are used to model VQ encoded speech for isolated word recognition and are compared directly to HMMs used for the same task. It is shown that SCFGs can model this low-level VQ data accurately and that a regular grammar based pre-training algorithm is effective both for reducing training time and obtaining robust solutions. Second, an SCFG is inferred from a transcription of the speech used to train a phoneme-based recognizer in an attempt to model phonotactic constraints. When used as a language model, this SCFG gives improved performance over a comparable regular grammar or bigram. © 1991.
Resumo:
Bayesian formulated neural networks are implemented using hybrid Monte Carlo method for probabilistic fault identification in cylindrical shells. Each of the 20 nominally identical cylindrical shells is divided into three substructures. Holes of (12±2) mm in diameter are introduced in each of the substructures and vibration data are measured. Modal properties and the Coordinate Modal Assurance Criterion (COMAC) are utilized to train the two modal-property-neural-networks. These COMAC are calculated by taking the natural-frequency-vector to be an additional mode. Modal energies are calculated by determining the integrals of the real and imaginary components of the frequency response functions over bandwidths of 12% of the natural frequencies. The modal energies and the Coordinate Modal Energy Assurance Criterion (COMEAC) are used to train the two frequency-response-function-neural-networks. The averages of the two sets of trained-networks (COMAC and COMEAC as well as modal properties and modal energies) form two committees of networks. The COMEAC and the COMAC are found to be better identification data than using modal properties and modal energies directly. The committee approach is observed to give lower standard deviations than the individual methods. The main advantage of the Bayesian formulation is that it gives identities of damage and their respective confidence intervals.
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.