Pore size distribution analysis of activated carbons: Application of density functional theory using nongraphitized carbon black as a reference system

The application of nonlocal density functional theory (NLDFT) to determine pore size distribution (PSD) of activated carbons using a nongraphitized carbon black, instead of graphitized thermal carbon black, as a reference system is explored. We show that in this case nitrogen and argon adsorption isotherms in activated carbons are precisely correlated by the theory, and such an excellent correlation would never be possible if the pore wall surface was assumed to be identical to that of graphitized carbon black. It suggests that pore wall surfaces of activated carbon are closer to that of amorphous solids because of defects of crystalline lattice, finite pore length, and the presence of active centers.. etc. Application of the NLDFT adapted to amorphous solids resulted in quantitative description of N-2 and Ar adsorption isotherms on nongraphitized carbon black BP280 at their respective boiling points. In the present paper we determined solid-fluid potentials from experimental adsorption isotherms on nongraphitized carbon black and subsequently used those potentials to model adsorption in slit pores and generate a corresponding set of local isotherms, which we used to determine the PSD functions of different activated carbons. (c) 2005 Elsevier Ltd. All rights reserved.

Clinically active Crohn's disease in the presence of a low C-reactive protein

Objective. Clinical interest in C-reactive protein (CRP) - a component of the innate immune system - has focused mainly on its worth as an indicator of disease activity. There has been a resurgence of interest in CRP in the Crohn's disease ( CD) literature because several trials of new treatments for active CD have been characterized by both a large proportion of patients with low CRP ( < 10 mg/l) at entry to the trials and by a negative therapeutic outcome. It is therefore of interest to study the clinical characteristics of patients who are thought to have at the same time both active CD and a low CRP. Material and methods. Patients were prospectively recruited as part of the Brisbane IBD clinical and research programme. Subjects were included in the low CRP group only if there were complete datasets for CRP on all occasions of active CD, and CRP was < 10 mg/l. Active disease was defined as CD activity index (CDAI) > 200. The low CRP group was compared with patients in the raised CRP group for a range of clinical variables as well as the major NOD2 variants. Results. There were data sets for 223 CD patients, with a mean disease duration of 12 years. Of these, 22 patients fulfilled the criteria for low CRP. The low CRP group ( group 1) showed significant differences for disease site (p < 0.01) and for BMI (p = 0.006) compared to the raised CRP group ( group 2). Specifically, group 1 had a predominance of pure ileal disease (95% versus 53%) and lack of pure colonic disease (0% versus 24%) compared to group 2, and their BMI was significantly lower (20.3 kg/m(2) versus 25.0 kg/m(2)). Groups 1 and 2 did not differ with respect to Vienna behaviour at diagnosis, smoking, appendicectomy, extra-intestinal manifestations of CD, or NOD2 SNP variants. There was a trend for low CRP patients with previous ileal resection to evolve to a stricturing phenotype. Fat wrapping was noted in 11/13 (85%) of low CRP patients undergoing ileal resections. Conclusions. Patients with CD and a persistently low CRP in the face of active disease were characterized by an almost exclusive ileal disease distribution and a low BMI, compared to those with a raised CRP. These patients had a similar frequency and distribution of NOD2/CARD15 variants. Stricturing ( v inflammatory or penetrating) behaviour may explain some low CRP. Despite the abnormally low BMI, fat wrapping was noted in the majority of low CRP patients undergoing ileal resection.

Nucleolar localization of aprataxin is dependent on interaction with nucleolin and on active ribosomal DNA transcription

The APTX gene, mutated in patients with the neurological disorder ataxia with oculomotor apraxia type 1 (AOA1), encodes a novel protein aprataxin. We describe here, the interaction and interdependence between aprataxin and several nucleolar proteins, including nucleolin, nucleophosmin and upstream binding factor-1 (UBF-1), involved in ribosomal RNA (rRNA) synthesis and cellular stress signalling. Interaction between aprataxin and nucleolin occurred through their respective N-terminal regions. In AOA1 cells lacking aprataxin, the stability of nucleolin was significantly reduced. On the other hand, down-regulation of nucleolin by RNA interference did not affect aprataxin protein levels but abolished its nucleolar localization suggesting that the interaction with nucleolin is involved in its nucleolar targeting. GFP-aprataxin fusion protein co-localized with nucleolin, nucleophosmin and UBF-1 in nucleoli and inhibition of ribosomal DNA transcription altered the distribution of aprataxin in the nucleolus, suggesting that the nature of the nucleolar localization of aprataxin is also dependent on ongoing rRNA synthesis. In vivo rRNA synthesis analysis showed only a minor decrease in AOA1 cells when compared with controls cells. These results demonstrate a cross-dependence between aprataxin and nucleolin in the nucleolus and while aprataxin does not appear to be directly involved in rRNA synthesis its nucleolar localization is dependent on this synthesis.

Population pharmacokinetics of itraconazole and its active metabolite hydroxy-itraconazole in paediatric cystic fibrosis and bone marrow transplant patients

Objective: The objective of the study was to characterise the population pharmacokinetic properties of itraconazole and its active metabolite hydroxyitraconazole in a representative paediatric population of cystic fibrosis and bone marrow transplant (BMT) patients and to identify patient characteristics influencing the pharmacokinetics of itraconazole. The ultimate goals were to determine the relative bioavailability between the two oral formulations (capsules vs oral solution) and to optimise dosing regimens in these patients. Methods: All paediatric patients with cystic fibrosis or patients undergoing BMT at The Royal Children's Hospital, Brisbane, QLD, Australia, who were prescribed oral itraconazole for the treatment of allergic bronchopulmonary aspergillosis (cystic fibrosis patients) or for prophylaxis of any fungal infection (BMT patients) were eligible for the study. Blood samples were taken from the recruited patients as per an empirical sampling design either during hospitalisation or during outpatient clinic visits. ltraconazole and hydroxy-itraconazole plasma concentrations were determined by a validated high-performance liquid chromatography assay with fluorometric detection. A nonlinear mixed-effect modelling approach using the NONMEM software to simultaneously describe the pharmacokinetics of itraconazole and its metabolite. Results: A one-compartment model with first-order absorption described the itraconazole data, and the metabolism of the parent drug to hydroxy-itraconazole was described by a first-order rate constant. The metabolite data also showed one-compartment characteristics with linear elimination. For itraconazole the apparent clearance (CLitraconazole) was 35.5 L/hour, the apparent volume of distribution (V-d(itraconazole)) was 672L, the absorption rate constant for the capsule formulation was 0.0901 h(-1) and for the oral solution formulation was 0.96 h-1. The lag time was estimated to be 19.1 minutes and the relative bioavailability between capsules and oral solution (F-rel) was 0.55. For the metabolite, volume of distribution, V-m/(F (.) f(m)), and clearance, CL/(F (.) fm), were 10.6L and 5.28 L/h, respectively. The influence of total bodyweight was significant, added as a covariate on CLitraconazoie/F and V-d(itraconazole)/F (standardised to a 70kg person) using allometric three-quarter power scaling on CLitraconazole/F, which therefore reflected adult values. The unexplained between-subject variability (coefficient of variation %) was 68.7%, 75.8%, 73.4% and 61.1% for CLitraconazoie/F, Vd(itraconazole)/F, CLm/(F (.) fm) and F-rel, respectively. The correlation between random effects of CLitraconazole and Vd((itraconazole)) was 0.69. Conclusion: The developed population pharmacokinetic model adequately described the pharmacokinetics of itraconazole and its active metabolite, hydroxy-itraconazole, in paediatric patients with either cystic fibrosis or undergoing BMT. More appropriate dosing schedules have been developed for the oral solution and the capsules to secure a minimum therapeutic trough plasma concentration of 0.5 mg/L for these patients.

Paediatric population pharmacokinetics of itraconazole and its active metabolite hydroxy-itraconazole in cystic fibrosis and bone marrow transplant patients

Objectives: The aim of the study was to characterise the population pharmacokinetics (popPK) properties of itraconazole (ITRA) and its active metabolite hydroxy-ITRA in a representative paediatric population of cystic fibrosis (CF) and bone marrow transplant (BMT) patients. The goals were to determine the relative bioavailability between the two oral formulations, and to explore improved dosage regimens in these patients. Methods: All paediatric patients with CF taking oral ITRA for the treatment of allergic bronchopulmonary aspergillosis and patients undergoing BMT who were taking ITRA for prophylaxis of any fungal infection were eligible for the study. A minimum of two blood samples were drawn after the capsules and also after switching to oral solution, or vice versa. ITRA and hydroxy-ITRA plasma concentrations were measured by HPLC[1]. A nonlinear mixed-effect modelling approach (NONMEM 5.1.1) was used to describe the PK of ITRA and hydroxy-ITRA simultaneously. Simulations were used to assess dosing strategies in these patients. Results: Forty-nine patients (29CF, 20 BMT) were recruited to the study who provided 227 blood samples for the population analysis. A 1-compartment model with 1st order absorption and elimination best described ITRA kinetics, with 1st order conversion to hydroxy-ITRA. For ITRA, the apparent clearance (ClItra/F) and volume of distribution (Vitra/F) was 35.5L/h and 672L, respectively; the absorption rate constant for the capsule formulation was 0.0901 h-1 and for the oral solution formulation it was 0.959 h-1. The capsule comparative bioavailability (vs. solution) was 0.55. For hydroxy-ITRA, the apparent volume of distribution and clearance were 10.6 L and 5.28 L/h, respectively. Of several screened covariates only allometrically scaled total body weight significantly improved the fit to the data. No difference between the two populations was found. Conclusion: The developed popPK model adequately described the pharmacokinetics of ITRA and hydroxy-ITRA in paediatric patients with CF and patients undergoing BMT. High inter-patient variability confirmed previous data in CF[2], leukaemia and BMT[3] patients. From the population model, simulations showed the standard dose (5 mg/kg/day) needs to be doubled for the solution formulation and even 4 times more given of the capsules to achieve an adequate target therapeutic trough plasma concentration of 0.5 mg/L[4] in these patients.

Automatic segmentation of the knee bones using 3D active shape models

This paper presents an automated segmentation approach for MR images of the knee bones. The bones are the first stage of a segmentation system for the knee, primarily aimed at the automated segmentation of the cartilages. The segmentation is performed using 3D active shape models (ASM), which are initialized using an affine registration to an atlas. The 3D ASMs of the bones are created automatically using a point distribution model optimization scheme. The accuracy and robustness of the segmentation approach was experimentally validated using an MR database of fat suppressed spoiled gradient recall images.

Active node supporting context-aware vertical handover in pervasive computing environment with redundant positioning

A major requirement for pervasive systems is to integrate context-awareness to support heterogeneous networks and device technologies and at the same time support application adaptations to suit user activities. However, current infrastructures for pervasive systems are based on centralized architectures which are focused on context support for service adaptations in response to changes in the computing environment or user mobility. In this paper, we propose a hierarchical architecture based on active nodes, which maximizes the computational capabilities of various nodes within the pervasive computing environment, while efficiently gathering and evaluating context information from the user's working environment. The migratable active node architecture employs various decision making processes for evaluating a rich set of context information in order to dynamically allocate active nodes in the working environment, perform application adaptations and predict user mobility. The active node also utilizes the Redundant Positioning System to accurately manage user's mobility. This paper demonstrates the active node capabilities through context-aware vertical handover applications.

Mixture density networks

Minimization of a sum-of-squares or cross-entropy error function leads to network outputs which approximate the conditional averages of the target data, conditioned on the input vector. For classifications problems, with a suitably chosen target coding scheme, these averages represent the posterior probabilities of class membership, and so can be regarded as optimal. For problems involving the prediction of continuous variables, however, the conditional averages provide only a very limited description of the properties of the target variables. This is particularly true for problems in which the mapping to be learned is multi-valued, as often arises in the solution of inverse problems, since the average of several correct target values is not necessarily itself a correct value. In order to obtain a complete description of the data, for the purposes of predicting the outputs corresponding to new input vectors, we must model the conditional probability distribution of the target data, again conditioned on the input vector. In this paper we introduce a new class of network models obtained by combining a conventional neural network with a mixture density model. The complete system is called a Mixture Density Network, and can in principle represent arbitrary conditional probability distributions in the same way that a conventional neural network can represent arbitrary functions. We demonstrate the effectiveness of Mixture Density Networks using both a toy problem and a problem involving robot inverse kinematics.

Regularisation of mixture density networks

Mixture Density Networks are a principled method to model conditional probability density functions which are non-Gaussian. This is achieved by modelling the conditional distribution for each pattern with a Gaussian Mixture Model for which the parameters are generated by a neural network. This thesis presents a novel method to introduce regularisation in this context for the special case where the mean and variance of the spherical Gaussian Kernels in the mixtures are fixed to predetermined values. Guidelines for how these parameters can be initialised are given, and it is shown how to apply the evidence framework to mixture density networks to achieve regularisation. This also provides an objective stopping criteria that can replace the `early stopping' methods that have previously been used. If the neural network used is an RBF network with fixed centres this opens up new opportunities for improved initialisation of the network weights, which are exploited to start training relatively close to the optimum. The new method is demonstrated on two data sets. The first is a simple synthetic data set while the second is a real life data set, namely satellite scatterometer data used to infer the wind speed and wind direction near the ocean surface. For both data sets the regularisation method performs well in comparison with earlier published results. Ideas on how the constraint on the kernels may be relaxed to allow fully adaptable kernels are presented.

First year qualifying report: neural networks for extracting wind vectors from satellite scatterometer data

The ERS-1 Satellite was launched in July 1991 by the European Space Agency into a polar orbit at about km800, carrying a C-band scatterometer. A scatterometer measures the amount of radar back scatter generated by small ripples on the ocean surface induced by instantaneous local winds. Operational methods that extract wind vectors from satellite scatterometer data are based on the local inversion of a forward model, mapping scatterometer observations to wind vectors, by the minimisation of a cost function in the scatterometer measurement space.par This report uses mixture density networks, a principled method for modelling conditional probability density functions, to model the joint probability distribution of the wind vectors given the satellite scatterometer measurements in a single cell (the `inverse' problem). The complexity of the mapping and the structure of the conditional probability density function are investigated by varying the number of units in the hidden layer of the multi-layer perceptron and the number of kernels in the Gaussian mixture model of the mixture density network respectively. The optimal model for networks trained per trace has twenty hidden units and four kernels. Further investigation shows that models trained with incidence angle as an input have results comparable to those models trained by trace. A hybrid mixture density network that incorporates geophysical knowledge of the problem confirms other results that the conditional probability distribution is dominantly bimodal.par The wind retrieval results improve on previous work at Aston, but do not match other neural network techniques that use spatial information in the inputs, which is to be expected given the ambiguity of the inverse problem. Current work uses the local inverse model for autonomous ambiguity removal in a principled Bayesian framework. Future directions in which these models may be improved are given.

Statistical mechanics of support vector networks

Using methods of Statistical Physics, we investigate the generalization performance of support vector machines (SVMs), which have been recently introduced as a general alternative to neural networks. For nonlinear classification rules, the generalization error saturates on a plateau, when the number of examples is too small to properly estimate the coefficients of the nonlinear part. When trained on simple rules, we find that SVMs overfit only weakly. The performance of SVMs is strongly enhanced, when the distribution of the inputs has a gap in feature space.

CDMA multiuser detection, neural networks, and statistical mechanics

A novel approach, based on statistical mechanics, to analyze typical performance of optimum code-division multiple-access (CDMA) multiuser detectors is reviewed. A `black-box' view ot the basic CDMA channel is introduced, based on which the CDMA multiuser detection problem is regarded as a `learning-from-examples' problem of the `binary linear perceptron' in the neural network literature. Adopting Bayes framework, analysis of the performance of the optimum CDMA multiuser detectors is reduced to evaluation of the average of the cumulant generating function of a relevant posterior distribution. The evaluation of the average cumulant generating function is done, based on formal analogy with a similar calculation appearing in the spin glass theory in statistical mechanics, by making use of the replica method, a method developed in the spin glass theory.

Creating and managing value in collaborative networks

This is a theoretical paper that examines the interplay between individual and collective capabilities and competencies and value transactions in collaborative environments. The theory behind value creation is examined and two types of value are identified, internal value (Shareholder value) and external value (Value proposition). The literature on collaborative enterprises/network is also examined with particular emphasis on supply chains, extended/virtual enterprises and clusters as representatives of different forms and maturities of collaboration. The interplay of value transactions and competencies and capabilities are examined and discussed in detail. Finally, a model is presented which consists of value transactions and a table which compares the characteristics of different types of collaborative enterprises/networks. It is proposed that this model presents a platform for further research to develop an in-depth understanding into how value may be created and managed in collaborative enterprises/networks.

Traffic based energy consumption optimisation to improve the lifetime and performance of ad hoc wireless sensor networks

Ad hoc wireless sensor networks (WSNs) are formed from self-organising configurations of distributed, energy constrained, autonomous sensor nodes. The service lifetime of such sensor nodes depends on the power supply and the energy consumption, which is typically dominated by the communication subsystem. One of the key challenges in unlocking the potential of such data gathering sensor networks is conserving energy so as to maximize their post deployment active lifetime. This thesis described the research carried on the continual development of the novel energy efficient Optimised grids algorithm that increases the WSNs lifetime and improves on the QoS parameters yielding higher throughput, lower latency and jitter for next generation of WSNs. Based on the range and traffic relationship the novel Optimised grids algorithm provides a robust traffic dependent energy efficient grid size that minimises the cluster head energy consumption in each grid and balances the energy use throughout the network. Efficient spatial reusability allows the novel Optimised grids algorithm improves on network QoS parameters. The most important advantage of this model is that it can be applied to all one and two dimensional traffic scenarios where the traffic load may fluctuate due to sensor activities. During traffic fluctuations the novel Optimised grids algorithm can be used to re-optimise the wireless sensor network to bring further benefits in energy reduction and improvement in QoS parameters. As the idle energy becomes dominant at lower traffic loads, the new Sleep Optimised grids model incorporates the sleep energy and idle energy duty cycles that can be implemented to achieve further network lifetime gains in all wireless sensor network models. Another key advantage of the novel Optimised grids algorithm is that it can be implemented with existing energy saving protocols like GAF, LEACH, SMAC and TMAC to further enhance the network lifetimes and improve on QoS parameters. The novel Optimised grids algorithm does not interfere with these protocols, but creates an overlay to optimise the grids sizes and hence transmission range of wireless sensor nodes.

Regularisation of mixture density networks

Mixture Density Networks are a principled method to model conditional probability density functions which are non-Gaussian. This is achieved by modelling the conditional distribution for each pattern with a Gaussian Mixture Model for which the parameters are generated by a neural network. This thesis presents a novel method to introduce regularisation in this context for the special case where the mean and variance of the spherical Gaussian Kernels in the mixtures are fixed to predetermined values. Guidelines for how these parameters can be initialised are given, and it is shown how to apply the evidence framework to mixture density networks to achieve regularisation. This also provides an objective stopping criteria that can replace the `early stopping' methods that have previously been used. If the neural network used is an RBF network with fixed centres this opens up new opportunities for improved initialisation of the network weights, which are exploited to start training relatively close to the optimum. The new method is demonstrated on two data sets. The first is a simple synthetic data set while the second is a real life data set, namely satellite scatterometer data used to infer the wind speed and wind direction near the ocean surface. For both data sets the regularisation method performs well in comparison with earlier published results. Ideas on how the constraint on the kernels may be relaxed to allow fully adaptable kernels are presented.