Brucella abortus and its closest phylogenetic relative, Ochrobactrum spp., differ in outer membrane permeability and cationic peptide resistance

The outer membrane (OM) of the intracellular parasite Brucella abortus is permeable to hydrophobic probes and resistant to destabilization by polycationic peptides and EDTA. The significance of these unusual properties was investigated in a comparative study with the opportunistic pathogens of the genus Ochrobactrum, the closest known Brucella relative. Ochrobactrum spp. OMs were impermeable to hydrophobic probes and sensitive to polymyxin B but resistant to EDTA. These properties were traced to lipopolysaccharide (LPS) because (i) insertion of B. abortus LPS, but not of Escherichia coli LPS, into Ochrobactrum OM increased its permeability; (ii) permeability and polymyxin B binding measured with LPS aggregates paralleled the results with live bacteria; and (iii) the predicted intermediate results were obtained with B. abortus-Ochrobactrum anthropi and E. coli-O. anthropi LPS hybrid aggregates. Although Ochrobactrum was sensitive to polymyxin, self-promoted uptake and bacterial lysis occurred without OM morphological changes, suggesting an unusual OM structural rigidity. Ochrobactrum and B. abortus LPSs showed no differences in phosphate, qualitative fatty acid composition, or acyl chain fluidity. However, Ochrobactrum LPS, but not B. abortus LPS, contained galacturonic acid. B. abortus and Ochrobactrum smooth LPS aggregates had similar size and zeta potential (-12 to -15 mV). Upon saturation with polymyxin, zeta potential became positive (1 mV) for Ochrobactrum smooth LPS while remaining negative (-5 mV) for B. abortus smooth LPS, suggesting hindered access to inner targets. These results show that although Ochrobactrum and Brucella share a basic OM pattern, subtle modifications in LPS core cause markedly different OM properties, possibly reflecting the adaptive evolution of B. abortus to pathogenicity.

A direct physiological trade-off between personal and social immunity

1. Recent work shows that organisms possess two strategies of immune response: personal immunity, which defends an individual, and social immunity, which protects other individuals, such as kin. However, it is unclear how individuals divide their limited resources between protecting themselves and protecting others.
2. Here, with experiments on female burying beetles, we challenged the personal immune system and measured subsequent investment in social immunity (antibacterial activity of the anal exudates).
3. Our results show that increased investment in one aspect of personal immunity (wound repair) causes a temporary decrease in one aspect of the social immune response.
4. Our experiments further show that by balancing investment in personal and social immunity in this way during one breeding attempt, females are able to defend their subsequent lifetime reproductive success.
5. We discuss the nature of the physiological trade-off between personal and social immunity in species that differ in the degree of eusociality and coloniality, and suggest that it may also vary within species in relation to age and partner contributions to social immunity.

Adaptive binary mask for privacy region protection

Privacy region protection in video surveillance systems is an active topic at present. In previous research, a binary mask mechanism has been developed to indicate the privacy region; however this incurs a significant bitrate overhead. In this paper, an adaptive binary mask is proposed to represent the privacy region. In a practical privacy region protection application, in which the privacy region typically occupies less than half of the overall frame and is rectangular or approximately rectangular, the proposed adaptive binary mask can effectively reduce the bitrate overhead. The proposed method can also be easily applied to the FMO mechanism of H.264/AVC, providing both error resilience and a lower bitrate overhead.

Adaptive Measurement-Based Policy-Driven QoS Management with Fuzzy-Rule-based Resource Allocation

Fixed and wireless networks are increasingly converging towards common connectivity with IP-based core networks. Providing effective end-to-end resource and QoS management in such complex heterogeneous converged network scenarios requires unified, adaptive and scalable solutions to integrate and co-ordinate diverse QoS mechanisms of different access technologies with IP-based QoS. Policy-Based Network Management (PBNM) is one approach that could be employed to address this challenge. Hence, a policy-based framework for end-to-end QoS management in converged networks, CNQF (Converged Networks QoS Management Framework) has been proposed within our project. In this paper, the CNQF architecture, a Java implementation of its prototype and experimental validation of key elements are discussed. We then present a fuzzy-based CNQF resource management approach and study the performance of our implementation with real traffic flows on an experimental testbed. The results demonstrate the efficacy of our resource-adaptive approach for practical PBNM systems

Comparison of adaptive beamforming and orthogonal STBC with outdated feedback

We compare the achievable performance of adaptive beamforming (A-BF) and adaptive orthogonal space time block coding (A-OSTBC) with outdated channel feedback. We extend our single user setup to multiuser diversity systems employing adaptive modulation, and illustrate the impact of feedback delay on the multiuser diversity gain with either A-OSTBC or A-BF. Using closed-form expressions for spectral efficiency and average BER of a multiuser diversity system derived in this paper, we prove that the A-BF scheme outperforms the A-OSTBC scheme with no feedback delay. However, when the feedback delay is large, the A-OSTBC scheme achieves better performance due to the reduced diversity advantage of A-BF. We observe that more transmit antennas bring higher spectral efficiency for BF. With small feedback delay, this becomes inverted using OSTBC, due to the effect of channel-hardening. Interestingly, however, we show that A-OSTBC with multiple users enjoys improved spectral efficiency when the number of transmit antennas is increased and the feedback delay is significant

Adaptive linear combination of heuristic orderings in constructing examination timetables

In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a heuristic modifier to address the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specific problem data. Two graph coloring heuristics were used in this study (largest degree and saturation degree). A score for the difficulty of assigning each examination was obtained from an adaptive linear combination of these two heuristics and examinations in the list were ordered based on this value. The examinations with the score value representing the higher difficulty were chosen for scheduling based on two strategies. We tested for single and multiple heuristics with and without a heuristic modifier with different combinations of weight values for each parameter on the Toronto and ITC2007 benchmark data sets. We observed that the combination of multiple heuristics with a heuristic modifier offers an effective way to obtain good solution quality. Experimental results demonstrate that our approach delivers promising results. We conclude that this adaptive linear combination of heuristics is a highly effective method and simple to implement.

The ParaPhrase Project:Parallel patterns for adaptive heterogeneous multicore systems

This paper describes the ParaPhrase project, a new 3-year targeted research project funded under EU Framework 7 Objective 3.4 (Computer Systems), starting in October 2011. ParaPhrase aims to follow a new approach to introducing parallelism using advanced refactoring techniques coupled with high-level parallel design patterns. The refactoring approach will use these design patterns to restructure programs defined as networks of software components into other forms that are more suited to parallel execution. The programmer will be aided by high-level cost information that will be integrated into the refactoring tools. The implementation of these patterns will then use a well-understood algorithmic skeleton approach to achieve good parallelism. A key ParaPhrase design goal is that parallel components are intended to match heterogeneous architectures, defined in terms of CPU/GPU combinations, for example. In order to achieve this, the ParaPhrase approach will map components at link time to the available hardware, and will then re-map them during program execution, taking account of multiple applications, changes in hardware resource availability, the desire to reduce communication costs etc. In this way, we aim to develop a new approach to programming that will be able to produce software that can adapt to dynamic changes in the system environment. Moreover, by using a strong component basis for parallelism, we can achieve potentially significant gains in terms of reducing sharing at a high level of abstraction, and so in reducing or even eliminating the costs that are usually associated with cache management, locking, and synchronisation. © 2013 Springer-Verlag Berlin Heidelberg.