69 resultados para Cipher and telegraph codes
em Cambridge University Engineering Department Publications Database
Resumo:
Aside from cracks, the impact of other surface defects, such as air pockets and discoloration, can be detrimental to the quality of concrete in terms of strength, appearance and durability. For this reason, local and national codes provide standards for quantifying the quality impact of these concrete surface defects and owners plan for regular visual inspections to monitor surface conditions. However, manual visual inspection of concrete surfaces is a qualitative (and subjective) process with often unreliable results due to its reliance on inspectors’ own criteria and experience. Also, it is labor intensive and time-consuming. This paper presents a novel, automated concrete surface defects detection and assessment approach that addresses these issues by automatically quantifying the extent of surface deterioration. According to this approach, images of the surface shot from a certain angle/distance can be used to automatically detect the number and size of surface air pockets, and the degree of surface discoloration. The proposed method uses histogram equalization and filtering to extract such defects and identify their properties (e.g. size, shape, location). These properties are used to quantify the degree of impact on the concrete surface quality and provide a numerical tool to help inspectors accurately evaluate concrete surfaces. The method has been implemented in C++ and results that validate its performance are presented.
Resumo:
Gas turbine engine performance requires effective and reliable internal cooling over the duty cycle of the engine. Life predictions for rotating components subject to the main gas path temperatures are vital. This demands increased precision in the specification of the internal air system flows which provide turbine stator well cooling and sealing. This in turn requires detailed knowledge of the flow rates through rim seals and interstage labyrinth seals. Knowledge of seal movement and clearances at operating temperatures is of great importance when prescribing these flows. A test facility has been developed at the University of Sussex, incorporating a two stage turbine rated at 400 kW with an individual stage pressure ratio of 1.7:1. The mechanical design of the test facility allows internal cooling geometry to be rapidly re-configured, while cooling flow rates of between 0.71 CW, ENT and 1.46 C W, ENT, may be set to allow ingress or egress dominated cavity flows. The main annulus and cavity conditions correspond to in cavity rotational Reynolds numbers of 1.71×106< Reφ <1.93×106. Displacement sensors have been used to establish hot running seal clearances over a range of stator well flow conditions, allowing realistic flow rates to be calculated. Additionally, gas seeding techniques have been developed, where stator well and main annulus flow interactions are evaluated by measuring changes in gas concentration. Experiments have been performed which allow rim seal and re-ingestion flows to be quantified. It will be shown that this work develops the measurement of stator well cooling flows and provides data suitable for the validation of improved thermo-mechanical and CFD codes, beneficial to the engine design process. Copyright © 2011 by Rolls-Royce plc.
Resumo:
The numerical propagation of subcritical Tollmein-Schlichting (T-S), inviscid vortical and cut-on acoustic waves is explored. For the former case, the performances of the very different NEAT, NTS, HYDRA, FLUXp and OSMIS3D codes is studied. A modest/coarse hexahedral computational grid that starkly shows differences between the different codes and schemes used in them is employed. For the same order of discretization the five codes show similar results. The unstructured codes are found to propagate vortical and acoustic waves well on triangular cell meshes but not the T-S wave. The above code contrasting exercise is then carried out using implicit LES or Smagorinsky LES for and Ma = 0.9 plane jet on modest 0.5 million cell grids moving to circa 5 million cell grids. For this case, even on the coarse grid, for all codes results were generally encouraging. In general, the spread in computational results is less than the spread of the measurements. Interestingly, the finer grid turbulence intensity levels are slightly more under-predicted than those of the coarse grid. This difference is attributed to the numerical dispersion error having a favourable coarse grid influence. For a non-isothermal jet, HYDRA and NTS also give encouraging results. Peak turbulence values along the jet centreline are in better agreement with measurements than for the isothermal jets. Copyright © 2006 by University of Wales.
Resumo:
In this paper, we reported the results of the first stage of HTGR fuel element depletion benchmark obtained with BGCore and HELIOS depletion codes. The results of the k-inf are generally in good agreement. However, significant deviation in concentrations of several nuclides between MCNP based and HELIOS codes was observed.
Resumo:
We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. © 2004 Elsevier B.V.
Resumo:
We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. © 2004 Elsevier B.V.
Resumo:
We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. ©2003 Published by Elsevier Science B. V.
Resumo:
We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. ©2003 Published by Elsevier Science B. V.