Influence of embedded length on strength of BFRP rods bonded parallel to the grain in low grade timber by pullout-bending tests

Bonded-in rod connections in timber possess many desirable attributes in terms of efficiency, manufacture, performance, aesthetics and cost. In recent years research has been conducted on such connections using fibre reinforced polymers (FRPs) as an alternative to steel. This research programme investigates the pull-out capacity of Basalt FRP rods bonded-in in low grade Irish Sitka Spruce. Embedded length is thought to be the most influential variable contributing to pull- out capacity of bonded-in rods after rod diameter. Previous work has established an optimum embedded length of 15 times the hole diameter. However, this work only considered the effects of axial stress on the bond using a pull-compression testing system which may have given an artificially high pull out capacity as bending effects were neglected. A hinge system was utilised that allows the effects of bending force to be taken in to consideration along with axial forces in a pull-out test. This paper describes an experimental programme where such pull-bending tests were carried out on samples constructed of 12mm diameter BFRP bars with a 2mm glueline thickness and embedded lengths between 80mm and 280mm bonded-in to low-grade timber with an epoxy resin. Nine repetitions of each were tested. A clear increase in pull-out strength was found with increasing embedded length.

PSWT Based Linear Predictive Coding and Development of a Parallel Multiple Subsequence Structure for DWT Computation

During 1990's the Wavelet Transform emerged as an important signal processing tool with potential applications in time-frequency analysis and non-stationary signal processing.Wavelets have gained popularity in broad range of disciplines like signal/image compression, medical diagnostics, boundary value problems, geophysical signal processing, statistical signal processing,pattern recognition,underwater acoustics etc.In 1993, G. Evangelista introduced the Pitch- synchronous Wavelet Transform, which is particularly suited for pseudo-periodic signal processing.The work presented in this thesis mainly concentrates on two interrelated topics in signal processing,viz. the Wavelet Transform based signal compression and the computation of Discrete Wavelet Transform. A new compression scheme is described in which the Pitch-Synchronous Wavelet Transform technique is combined with the popular linear Predictive Coding method for pseudo-periodic signal processing. Subsequently,A novel Parallel Multiple Subsequence structure is presented for the efficient computation of Wavelet Transform. Case studies also presented to highlight the potential applications.

Document Image Segmentation and Compression using Artificial Neural Networks and Evolutionary Methods

The work is intended to study the following important aspects of document image processing and develop new methods. (1) Segmentation ofdocument images using adaptive interval valued neuro-fuzzy method. (2) Improving the segmentation procedure using Simulated Annealing technique. (3) Development of optimized compression algorithms using Genetic Algorithm and parallel Genetic Algorithm (4) Feature extraction of document images (5) Development of IV fuzzy rules. This work also helps for feature extraction and foreground and background identification. The proposed work incorporates Evolutionary and hybrid methods for segmentation and compression of document images. A study of different neural networks used in image processing, the study of developments in the area of fuzzy logic etc is carried out in this work

Jerim-320: A New 320-Bit Hash Function Compared To Hash Functions With Parallel Branches

This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications

Linear predicted two-pass hexagonal algorithm with parallel implementation for motion estimation

This paper presents a paralleled Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA., Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We introduced hashtable into video processing and completed parallel implementation. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. It discusses how parallel video coding on load balanced multiprocessor systems can help, especially on motion estimation. The effect of load balancing for improved performance is discussed. The performance or the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Two-pass hexagonal algorithm with parallel implementation for video coding

This paper presents a paralleled Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA, Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We introduced hashtable into video processing and completed parallel implementation. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. It discusses how parallel video coding on load balanced multiprocessor systems can help, especially on motion estimation. The effect of load balancing for improved performance is discussed. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Improved two-pass hexagonal algorithm with parallel implementation for video coding - art. no. 60630J

This paper presents an improved parallel Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We used bashtable into video processing and completed parallel implementation. The hashtable structure of LHMEA is improved compared to the original TPA and LHMEA. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. The implementation contains spatial and temporal approaches. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Hyperspectral image compression onboard next-generation satellites: implementation solutions on GPU and FPGAs

Programa de doctorado: Ingeniería de Telecomunicación Avanzada

Suppression pathways saturate with contrast for parallel surrounds but not for superimposed cross-oriented masks

Contrast masking from parallel grating surrounds (doughnuts) and superimposed orthogonal masks have different characteristics. However, it is not known whether the saturation of the underlying suppression that has been found for parallel doughnut masks depends on (i) relative mask and target orientation, (ii) stimulus eccentricity or (iii) surround suppression. We measured contrast-masking functions for target patches of grating in the fovea and in the periphery for cross-oriented superimposed and doughnut masks and parallel doughnut masks. When suppression was evident, the factor that determined whether it accelerated or saturated was whether the mask stimulus was crossed or parallel. There are at least two interpretations of the asymptotic behaviour of the parallel surround mask. (1) Suppression arises from pathways that saturate with (mask) contrast. (2) The target is processed by a mechanism that is subject to surround suppression at low target contrasts, but a less sensitive mechanism that is immune from surround suppression ‘breaks through’ at higher target contrasts. If the mask can be made less potent, then masking functions should shift downwards, and sideways for the two accounts, respectively. We manipulated the potency of the mask by varying the size of the hole in a parallel doughnut mask. The results provided strong evidence for the first account but not the second. On the view that response compression becomes more severe progressing up the visual pathway, our results suggest that superimposed cross-orientation suppression precedes orientation tuned surround suppression. These results also reveal a previously unrecognized similarity between surround suppression and crowding (Pelli, Palomares, & Majaj, 2004).