Activity and location of olive oil phenolic antioxidants in liposomes

The antioxidant activity of hydroxytyrosol, hydroxytyrosol acetate, oleuropein, 3,4-dihydroxyphenylelenolic acid (3,4-DHPEA-EA) and 3,4-dihydroxyphenyielenolic acid dialdehyde (3,4-DHPEA-EDA) towards oxidation initiated by 2,2'-azobis (2-amidinopropane) hydrochloride in a soybean phospholipid liposome system was studied. The antioxidant activity of these olive oil phenols was similar and the duration of the lag phase was almost twice that of alpha-tocopherol. Trolox(R), a water-soluble analogue of alpha-tocopherol, showed the worst antioxidant activity. However, oxidation before the end of the lag phase was inhibited less effectively by the olive oil phenols than by alpha-tocopherol and Trolox(R). Synergistic effects (11-20% increase in lag phase) were observed in the antioxidant activity of combinations of alpha-tocopherol with olive oil phenols both with and without ascorbic acid. Fluorescence anisotropy of probes and fluorescence quenching studies showed that the olive oil phenols did not penetrate into the membrane, but their effectiveness as antioxidants showed they were associated with the surface of the phospholipid bilayer. (C) 2003 Elsevier Science Ireland Ltd. All rights reserved.

Drug interaction and location in liposomes: correlation with polar surface areas

An important step in liposome characterization is to determine the location of a drug within the liposome. This work thus investigated the interaction of dipalmitoylphosphatidylcholine liposomes with drugs of varied water solubility, polar surface area (PSA) and partition coefficient using high sensitivity differential scanning calorimetry. Lipophilic estradiol (ES) interacted strongest with the acyl chains of the lipid membrane, followed by the somewhat polar 5-fluorouracil (5-FU). Strongly hydrophilic mannitol (MAN) showed no evidence of interaction but water soluble polymers inulin (IN) and an antisense oligonucleotide (OLG), which have very high PSAs, interacted with the lipid head groups. Accordingly, the drugs could be classified as: hydrophilic ones situated in the aqueous core and which may interact with the head groups; those located at the water-bilayer interface with some degree of penetration into the lipid bilayer; those lipophilic drugs constrained within the bilayer. (c) 2004 Elsevier B.V. All rights reserved.

The effect of Parkinson's disease on time estimation as a function of stimulus duration range and modality

The present research sought to investigate the role of the basal ganglia in timing of sub- and supra-second intervals via an examination of the ability of people with Parkinson's disease (PD) to make temporal judgments in two ranges, 100-500 ms, and 1-5 s. Eighteen nondemented medicated patients with PD were compared with 14 matched controls on a duration-bisection task in which participants were required to discriminate auditory and visual signal durations within each time range. Results showed that patients with PD exhibited more variable duration judgments across both signal modality and duration range than controls, although closer analyses confirmed a timing deficit in the longer duration range only. The findings presented here suggest the bisection procedure may be a useful tool in identifying timing impairments in PD and, more generally, reaffirm the hypothesised role of the basal ganglia in temporal perception at the level of the attentionally mediated internal clock as well as memory retrieval and/or decision-making processes. (c) 2007 Elsevier Inc. All rights reserved.

Location, location, location: development of spatiotemporal sequence learning in infancy

We investigated infants' sensitivity to spatiotemporal structure. In Experiment 1, circles appeared in a statistically defined spatial pattern. At test 11-month-olds, but not 8-month-olds, looked longer at a novel spatial sequence. Experiment 2 presented different color/shape stimuli, but only the location sequence was violated during test; 8-month-olds preferred the novel spatial structure, but 5-month-olds did not. In Experiment 3, the locations but not color/shape pairings were constant at test; 5-month-olds showed a novelty preference. Experiment 4 examined "online learning": We recorded eye movements of 8-month-olds watching a spatiotemporal sequence. Saccade latencies to predictable locations decreased. We argue that temporal order statistics involving informative spatial relations become available to infants during the first year after birth, assisted by multiple cues.

Evidence for unusual spatial location coding in Williams syndrome: an explanation for the local bias in visuo-spatial construction tasks?

Individuals with Williams syndrome (WS) display poor visuo-spatial cognition relative to verbal abilities. Furthermore, whilst perceptual abilities are delayed, visuo-spatial construction abilities are comparatively even weaker, and are characterised by a local bias. We investigated whether his differentiation in visuo-spatial abilities can be explained by a deficit in coding spatial location in WS. This can be measured by assessing participants' understanding of the spatial relations between objects within a visual scene. Coordinate and categorical spatial relations were investigated independently in four participant groups: 21 individuals with WS; 21 typically developing (TD) children matched for non-verbal ability; 20 typically developing controls of a lower non-verbal ability; and 21 adults. A third task measured understanding of visual colour relations. Results indicated first, that the comprehension of categorical and coordinate spatial relations is equally poor in WS. Second, that the comprehension of visual relations is also at an equivalent level to spatial relational understanding in this population. These results can explain the difference in performance on visuo-spatial perception and construction tasks in WS. In addition, both the WS and control groups displayed response biases in the spatial tasks. However, the direction of bias differed across the groups. This finding is explored in relation to current theories of spatial location coding. (c) 2005 Elsevier Inc. All rights reserved.

Strategies and biases in location memory in Williams syndrome

Individuals with Williams syndrome (WS) demonstrate impaired visuo-spatial abilities in comparison to their level of verbal ability. In particular, visuo-spatial construction is an area of relative weakness. It has been hypothesised that poor or atypical location coding abilities contribute strongly to the impaired abilities observed on construction and drawing tasks [Farran, E. K., & Jarrold, C. (2005). Evidence for unusual spatial location coding in Williams syndrome: An explanation for the local bias in visuo-spatial construction tasks? Brain and Cognition, 59, 159-172; Hoffman, J. E., Landau, B., & Pagani, B. (2003). Spatial breakdown in spatial construction: Evidence from eye fixations in children with Williams syndrome. Cognitive Psychology, 46, 260-301]. The current experiment investigated location memory in WS. Specifically, the precision of remembered locations was measured as well as the biases and strategies that were involved in remembering those locations. A developmental trajectory approach was employed; WS performance was assessed relative to the performance of typically developing (TD) children ranging from 4- to 8-year-old. Results showed differential strategy use in the WS and TD groups. WS performance was most similar to the level of a TD 4-year-old and was additionally impaired by the addition of physical category boundaries. Despite their low level of ability, the WS group produced a pattern of biases in performance which pointed towards evidence of a subdivision effect, as observed in TD older children and adults. In contrast, the TD children showed a different pattern of biases, which appears to be explained by a normalisation strategy. In summary, individuals with WS do not process locations in a typical manner. This may have a negative impact on their visuo-spatial construction and drawing abilities. (c) 2007 Elsevier Ltd. All rights reserved.

A sparse kernel density estimation algorithm using forward constrained regression

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The leave-one-out (LOO) test score is used for kernel selection. The jackknife parameter estimator subject to positivity constraint check is used for the parameter estimation of a single parameter at each forward step. As such the proposed approach is simple to implement and the associated computational cost is very low. An illustrative example is employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with comparable accuracy to that of the classical Parzen window estimate.

An on-line algorithm of uncertain time delay estimation in a continuous system

In this paper, we present an on-line estimation algorithm for an uncertain time delay in a continuous system based on the observational input-output data, subject to observational noise. The first order Pade approximation is used to approximate the time delay. At each time step, the algorithm combines the well known Kalman filter algorithm and the recursive instrumental variable least squares (RIVLS) algorithm in cascade form. The instrumental variable least squares algorithm is used in order to achieve the consistency of the delay parameter estimate, since an error-in-the-variable model is involved. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

Improved channel estimation in TDMA by reproduction with applications in GSM/GPRS under co-channel interference

Finding an estimate of the channel impulse response (CIR) by correlating a received known (training) sequence with the sent training sequence is commonplace. Where required, it is also common to truncate the longer correlation to a sub-set of correlation coefficients by finding the set of N sequential correlation coefficients with the maximum power. This paper presents a new approach to selecting the optimal set of N CIR coefficients from the correlation rather than relying on power. The algorithm reconstructs a set of predicted symbols using the training sequence and various sub-sets of the correlation to find the sub-set that results in the minimum mean squared error between the actual received symbols and the reconstructed symbols. The application of the algorithm is presented in the context of the TDMA based GSM/GPRS system to demonstrate an improvement in the system performance with the new algorithm and the results are presented in the paper. However, the application lends itself to any training sequence based communication system often found within wireless consumer electronic device(1).

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.

A novel two pass hexagonal search algorithm for motion estimation

This paper presents a novel two-pass algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS). compensation. for block base motion On the basis of research from previous algorithms, especially an on-the-edge motion estimation algorithm called hexagonal search (HEXBS), we propose the LHMEA and the Two-Pass Algorithm (TPA). We introduce hashtable into video compression. In this paper we employ LHMEA for the first-pass search in all the Macroblocks (MB) in the picture. Motion Vectors (MV) are then generated from the first-pass and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of MBs. The evaluation of the algorithm considers the three important metrics being time, compression rate and PSNR. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms. Experimental results show that the proposed algorithm can offer the same compression rate as the Full Search. LHMEA with TPA has significant improvement on HEXBS and shows a direction for improving other fast motion estimation algorithms, for example Diamond Search.

Paralelled Two-Pass Hexagonal algorithm 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 of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Two-Pass Hexagonal algorithm with improved Hashtable structure for motion estimation

This paper presents an improved 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). The hashtable structure of LHMEA is improved compared to the original TPA and LHMEA. The evaluation of the algorithm considers the three important metrics being processing time, compression rate and PSNR. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Linear hashtable motion estimation algorithm for distributed video processing

This paper presents a parallel Linear Hashtable Motion Estimation Algorithm (LHMEA). Most parallel video compression algorithms focus on Group of Picture (GOP). Based on LHMEA we proposed earlier [1][2], we developed a parallel motion estimation algorithm focus inside of frame. We divide each reference frames into equally sized regions. These regions are going to be processed in parallel to increase the encoding speed significantly. The theory and practice speed up of parallel LHMEA according to the number of PCs in the cluster are compared and discussed. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass Hexagonal Search (HEXBS) motion estimation, which only searches a small number of Macroblocks (MBs). We evaluated distributed parallel implementation of LHMEA of TPA for real time video compression.