Variance estimation with Chao's sampling scheme

We show that the Hájek (Ann. Math Statist. (1964) 1491) variance estimator can be used to estimate the variance of the Horvitz–Thompson estimator when the Chao sampling scheme (Chao, Biometrika 69 (1982) 653) is implemented. This estimator is simple and can be implemented with any statistical packages. We consider a numerical and an analytic method to show that this estimator can be used. A series of simulations supports our findings.

Interactions of decay-accelerating factor (DAF) with haemagglutinating human enteroviruses: utilizing variation in primate DAF to map virus binding sites

A cellular receptor for the haemagglutinating enteroviruses (HEV), and the protein that mediates haemagglutination, is the membrane complement regulatory protein decay accelerating factor (DAF; CD55). Although primate DAF is highly conserved, significant differences exist to enable cell lines derived from primates to be utilized for the characterization of the DAF binding phenotype of human enteroviruses. Thus, several distinct DAF-binding phenotypes of a selection of HEVs (viz. coxsackievirus A21 and echoviruses 6, 7, 11-13, 29) were identified from binding and infection assays using a panel of primate cells derived from human, orang-utan, African Green monkey and baboon tissues. These studies complement our recent determination of the crystal structure of SCR(34) of human DAF [Williams, P., Chaudhry, Y., Goodfellow, I. G., Billington, J., Powell, R., Spiller, O. B., Evans, D. J. & Lea, S. (2003). J Biol Chem 278, 10691-10696] and have enabled us to better map the regions of DAF with which enteroviruses interact and, in certain cases, predict specific virus-receptor contacts.

The structure of echovirus type 12 bound to a two-domain fragment of its cellular attachment protein decay-accelerating factor (CD 55)

Echovirus type 12 (EV12), an enterovirus of the Picornaviridae family, uses the complement regulator, decay-accelerating factor (DAF, CD55) as a cellular receptor. We have calculated a three-dimensional reconstruction of EV12 bound to a fragment of DAF, consisting of short consensus repeat domains 3 and 4, from cryo-negative stain electron microscopy data (EMD #1057). This shows that, as for an earlier reconstruction of the related echovirus type 7 bound to DAF, attachment is not within the viral canyon but occurs close to the two-fold symmetry axes. Despite this general similarity, our reconstruction reveals a receptor interaction that is quite different from that observed for EV7. Fitting of the crystallographic co-ordinates for DAF34 and EV11 into the reconstruction shows a close agreement between the crystal structure of the receptor fragment and the density for the virus-bound receptor, allowing unambiguous positioning of the receptor with respect to the virion (PDB #1UPN). Our finding that the mode of virus-receptor interaction in EV12 is distinct from that seen for EV7 raises interesting questions regarding the evolution and biological significance of the DAF-binding phenotype in these viruses.

Dung and nest surveys: estimating decay rates

1. Wildlife managers often require estimates of abundance. Direct methods of estimation are often impractical, especially in closed-forest environments, so indirect methods such as dung or nest surveys are increasingly popular. 2. Dung and nest surveys typically have three elements: surveys to estimate abundance of the dung or nests; experiments to estimate the production (defecation or nest construction) rate; and experiments to estimate the decay or disappearance rate. The last of these is usually the most problematic, and was the subject of this study. 3. The design of experiments to allow robust estimation of mean time to decay was addressed. In most studies to date, dung or nests have been monitored until they disappear. Instead, we advocate that fresh dung or nests are located, with a single follow-up visit to establish whether the dung or nest is still present or has decayed. 4. Logistic regression was used to estimate probability of decay as a function of time, and possibly of other covariates. Mean time to decay was estimated from this function. 5. Synthesis and applications. Effective management of mammal populations usually requires reliable abundance estimates. The difficulty in estimating abundance of mammals in forest environments has increasingly led to the use of indirect survey methods, in which abundance of sign, usually dung (e.g. deer, antelope and elephants) or nests (e.g. apes), is estimated. Given estimated rates of sign production and decay, sign abundance estimates can be converted to estimates of animal abundance. Decay rates typically vary according to season, weather, habitat, diet and many other factors, making reliable estimation of mean time to decay of signs present at the time of the survey problematic. We emphasize the need for retrospective rather than prospective rates, propose a strategy for survey design, and provide analysis methods for estimating retrospective rates.

Coxsackievirus B3-associated myocardial pathology and viral load reduced by recombinant soluble human decay-accelerating factor in mice

Coxsackievirus B3 (CVB3) infection can result in myocarditis, which in turn may lead to a protracted immune response and subsequent dilated cardiomyopathy. Human decay-accelerating factor (DAF), a binding receptor for CVB3, was synthesized as a soluble IgG1-Fc fusion protein (DAF-Fc). In vitro, DAF-Fc was able to inhibit complement activity and block infection by CVB3, although blockade of infection varied widely among strains of CVB3. To determine the effects of DAF-Fc in vivo, 40 adolescent A/J mice were infected with a myopathic strain of CVB3 and given DAF-Fc treatment 3 days before infection, during infection, or 3 days after infection; the mice were compared with virus alone and sham-infected animals. Sections of heart, spleen, kidney, pancreas, and liver were stained with hematoxylin and eosin and submitted to in situ hybridization for both positive-strand and negative-strand viral RNA to determine the extent of myocarditis and viral infection, respectively. Salient histopathologic features, including myocardial lesion area, cell death, calcification and inflammatory cell infiltration, pancreatitis, and hepatitis were scored without knowledge of the experimental groups. DAF-Fc treatment of mice either preceding or concurrent with CVB3 infection resulted in a significant decrease in myocardial lesion area and cell death and a reduction in the presence of viral RNA. All DAF-Fc treatment groups had reduced infectious CVB3 recoverable from the heart after infection. DAF-Fc may be a novel therapeutic agent for active myocarditis and acute dilated cardiomyopathy if given early in the infectious period, although more studies are needed to determine its mechanism and efficacy.

Performance of GPRS coding scheme detection under severe multipath and co-channel interference as a function of soft-bit width

The General Packet Radio Service (GPRS) has been developed for the mobile radio environment to allow the migration from the traditional circuit switched connection to a more efficient packet based communication link particularly for data transfer. GPRS requires the addition of not only the GPRS software protocol stack, but also more baseband functionality for the mobile as new coding schemes have be en defined, uplink status flag detection, multislot operation and dynamic coding scheme detect. This paper concentrates on evaluating the performance of the GPRS coding scheme detection methods in the presence of a multipath fading channel with a single co-channel interferer as a function of various soft-bit data widths. It has been found that compressing the soft-bit data widths from the output of the equalizer to save memory can influence the likelihood decision of the coding scheme detect function and hence contribute to the overall performance loss of the system. Coding scheme detection errors can therefore force the channel decoder to either select the incorrect decoding scheme or have no clear decision which coding scheme to use resulting in the decoded radio block failing the block check sequence and contribute to the block error rate. For correct performance simulation, the performance of the full coding scheme detection must be taken into account.

A framework towards multi-modal fingerprinting scheme for multimedia assets

Fingerprinting is a well known approach for identifying multimedia data without having the original data present but what amounts to its essence or ”DNA”. Current approaches show insufficient deployment of three types of knowledge that could be brought to bear in providing a finger printing framework that remains effective, efficient and can accommodate both the whole as well as elemental protection at appropriate levels of abstraction to suit various Foci of Interest (FoI) in an image or cross media artefact. Thus our proposed framework aims to deliver selective composite fingerprinting that remains responsive to the requirements for protection of whole or parts of an image which may be of particularly interest and be especially vulnerable to attempts at rights violation. This is powerfully aided by leveraging both multi-modal information as well as a rich spectrum of collateral context knowledge including both image-level collaterals as well as the inevitably needed market intelligence knowledge such as customers’ social networks interests profiling which we can deploy as a crucial component of our Fingerprinting Collateral Knowledge. This is used in selecting the special FoIs within an image or other media content that have to be selectively and collaterally protected.

Parallel Monte Carlo sampling scheme for sphere and hemisphere

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles. Both algorithms are based on a transformation of the unit square. Similarly to the Arvo's algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-D/lonte Carlo solving of rendering equation is discussed.

Performance of asynchronous channel assignment scheme in non-uniform and dynamic topology WLANs

Dense deployments of wireless local area networks (WLANs) are fast becoming a permanent feature of all developed cities around the world. While this increases capacity and coverage, the problem of increased interference, which is exacerbated by the limited number of channels available, can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, an asynchronous, distributed and dynamic channel assignment scheme has been proposed that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of this scheme when it is deployed in the more practical non-uniform and dynamic topology scenarios. Specifically, we investigate its effectiveness (1) when APs are deployed in a nonuniform fashion resulting in some APs suffering from higher levels of interference than others and (2) when APs are effectively switched `on/off' due to the availability/lack of traffic at different times, which creates a dynamically changing network topology. Simulation results based on actual WLAN topologies show that robust performance gains over other channel assignment schemes can still be achieved even in these realistic scenarios.

An asynchronous channel assignment scheme: performance evaluation

Due to its popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, we proposed an improved asynchronous distributed and dynamic channel assignment scheme that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of the proposed scheme in practical scenarios found in densely populated WLAN deployments. Specifically, we investigate the convergence behaviour of the scheme and how its performance gains vary with different number of available channels and in different deployment densities. We also prove that our scheme is guaranteed to converge in a single iteration when the number of channels is greater than the number of neighbouring APs.