Self-Assembly of Bile Steroid Analogues: Molecules, Fibers, and Networks

Structural and rheological features of a series of molecular hydrogels formed by synthetic bile salt analogues have been scrutinized. Among seven gelators, two are neutral compounds, while the others are cationic systems among which one is a tripodal steroid derivative. Despite the fact that the chemical structures are closely related, the variety of physical characteristics is extremely large in the structures of the connected fibers (either plain cylinders or ribbons), in the dynamical modes for stress relaxation of the associated SAFINs, in the scaling laws of the shear elasticity (typical of either cellular solids or fractal floc-like assemblies), in the micron-scale texture and the distribution of ordered domains (spherulites, crystallites) embedded in a random mesh, in the type of nodal zones (either crystalline-like, fiber entanglements, or bundles), in the evolution of the distribution and morphology of fibers and nodes, and in the sensitivity to added salt. SANS appears to be a suitable technique to infer all geometrical parameters defining the fibers, their interaction modes, and the volume fraction of nodes in a SAFIN. The tripodal system is particularly singular in the series and exhibits viscosity overshoots at the startup of shear flows, an “umbrella-like” molecular packing mode involving three molecules per cross section of fiber, and scattering correlation peaks revealing the ordering and overlap of 1d self-assembled polyelectrolyte species.

A method for mapping the distribution and density of rabbits and other vertebrate pests in Australia

The European wild rabbit has been considered Australia’s worst vertebrate pest and yet little effort appears to have gone into producing maps of rabbit distribution and density. Mapping the distribution and density of pests is an important step in effective management. A map is essential for estimating the extent of damage caused and for efficiently planning and monitoring the success of pest control operations. This paper describes the use of soil type and point data to prepare a map showing the distribution and density of rabbits in Australia. The potential for the method to be used for mapping other vertebrate pests is explored. The approach used to prepare the map is based on that used for rabbits in Queensland (Berman et al. 1998). An index of rabbit density was determined using the number of Spanish rabbit fleas released per square kilometre for each Soil Map Unit (Atlas of Australian Soils). Spanish rabbit fleas were released into active rabbit warrens at 1606 sites in the early 1990s as an additional vector for myxoma virus and the locations of the releases were recorded using a Global Positioning System (GPS). Releases were predominantly in arid areas but some fleas were released in south east Queensland and the New England Tablelands of New South Wales. The map produced appears to reflect well the distribution and density of rabbits, at least in the areas where Spanish fleas were released. Rabbit pellet counts conducted in 2007 at 54 sites across an area of south east South Australia, south eastern Queensland, and parts of New South Wales (New England Tablelands and south west) in soil Map Units where Spanish fleas were released, provided a preliminary means to ground truth the map. There was a good relationship between mean pellet count score and the index of abundance for soil Map Units. Rabbit pellet counts may allow extension of the map into other parts of Australia where there were no Spanish rabbit fleas released and where there may be no other consistent information on rabbit location and density. The recent Equine Influenza outbreak provided a further test of the value of this mapping method. The distribution and density of domestic horses were mapped to provide estimates of the number of horses in various regions. These estimates were close to the actual numbers of horses subsequently determined from vaccination records and registrations. The soil Map Units are not simply soil types they contain information on landuse and vegetation and the soil classification is relatively localised. These properties make this mapping method useful, not only for rabbits, but also for other species that are not so dependent on soil type for survival.

Eliciting and encoding expert knowledge on variable selection into classical or Bayesian species distribution models

The quality of species distribution models (SDMs) relies to a large degree on the quality of the input data, from bioclimatic indices to environmental and habitat descriptors (Austin, 2002). Recent reviews of SDM techniques, have sought to optimize predictive performance e.g. Elith et al., 2006. In general SDMs employ one of three approaches to variable selection. The simplest approach relies on the expert to select the variables, as in environmental niche models Nix, 1986 or a generalized linear model without variable selection (Miller and Franklin, 2002). A second approach explicitly incorporates variable selection into model fitting, which allows examination of particular combinations of variables. Examples include generalized linear or additive models with variable selection (Hastie et al. 2002); or classification trees with complexity or model based pruning (Breiman et al., 1984, Zeileis, 2008). A third approach uses model averaging, to summarize the overall contribution of a variable, without considering particular combinations. Examples include neural networks, boosted or bagged regression trees and Maximum Entropy as compared in Elith et al. 2006. Typically, users of SDMs will either consider a small number of variable sets, via the first approach, or else supply all of the candidate variables (often numbering more than a hundred) to the second or third approaches. Bayesian SDMs exist, with several methods for eliciting and encoding priors on model parameters (see review in Low Choy et al. 2010). However few methods have been published for informative variable selection; one example is Bayesian trees (O’Leary 2008). Here we report an elicitation protocol that helps makes explicit a priori expert judgements on the quality of candidate variables. This protocol can be flexibly applied to any of the three approaches to variable selection, described above, Bayesian or otherwise. We demonstrate how this information can be obtained then used to guide variable selection in classical or machine learning SDMs, or to define priors within Bayesian SDMs.

Predicting the temporal response of seagrass meadows to dredging using Dynamic Bayesian Networks

Predicting temporal responses of ecosystems to disturbances associated with industrial activities is critical for their management and conservation. However, prediction of ecosystem responses is challenging due to the complexity and potential non-linearities stemming from interactions between system components and multiple environmental drivers. Prediction is particularly difficult for marine ecosystems due to their often highly variable and complex natures and large uncertainties surrounding their dynamic responses. Consequently, current management of such systems often rely on expert judgement and/or complex quantitative models that consider only a subset of the relevant ecological processes. Hence there exists an urgent need for the development of whole-of-systems predictive models to support decision and policy makers in managing complex marine systems in the context of industry based disturbances. This paper presents Dynamic Bayesian Networks (DBNs) for predicting the temporal response of a marine ecosystem to anthropogenic disturbances. The DBN provides a visual representation of the problem domain in terms of factors (parts of the ecosystem) and their relationships. These relationships are quantified via Conditional Probability Tables (CPTs), which estimate the variability and uncertainty in the distribution of each factor. The combination of qualitative visual and quantitative elements in a DBN facilitates the integration of a wide array of data, published and expert knowledge and other models. Such multiple sources are often essential as one single source of information is rarely sufficient to cover the diverse range of factors relevant to a management task. Here, a DBN model is developed for tropical, annual Halophila and temperate, persistent Amphibolis seagrass meadows to inform dredging management and help meet environmental guidelines. Specifically, the impacts of capital (e.g. new port development) and maintenance (e.g. maintaining channel depths in established ports) dredging is evaluated with respect to the risk of permanent loss, defined as no recovery within 5 years (Environmental Protection Agency guidelines). The model is developed using expert knowledge, existing literature, statistical models of environmental light, and experimental data. The model is then demonstrated in a case study through the analysis of a variety of dredging, environmental and seagrass ecosystem recovery scenarios. In spatial zones significantly affected by dredging, such as the zone of moderate impact, shoot density has a very high probability of being driven to zero by capital dredging due to the duration of such dredging. Here, fast growing Halophila species can recover, however, the probability of recovery depends on the presence of seed banks. On the other hand, slow growing Amphibolis meadows have a high probability of suffering permanent loss. However, in the maintenance dredging scenario, due to the shorter duration of dredging, Amphibolis is better able to resist the impacts of dredging. For both types of seagrass meadows, the probability of loss was strongly dependent on the biological and ecological status of the meadow, as well as environmental conditions post-dredging. The ability to predict the ecosystem response under cumulative, non-linear interactions across a complex ecosystem highlights the utility of DBNs for decision support and environmental management.

Pathological changes at the target tissue level in Sjögren's syndrome and their effect on the exocrine function of the salivary glands

Sjögren s syndrome (SS) is a common autoimmune disease affecting the lacrimal and salivary glands. SS is characterized by a considerable female predominance and a late age of onset, commonly at the time of adreno- and menopause. The levels of the androgen prohormone dehydroepiandrosterone-sulphate (DHEA-S) in the serum are lower in patients with SS than in age- and sex-matched healthy control subjects. The eventual systemic effects of low androgen levels in SS are not currently well understood. Basement membranes (BM) are specialized layers of extracellular matrix and are composed of laminin (LM) and type IV collagen matrix networks. BMs deliver messages to epithelial cells via cellular LM-receptors including integrins (Int) and Lutheran blood group antigen (Lu). The composition of BMs and distribution of LM-receptors in labial salivary glands (LSGs) of normal healthy controls and patients with SS was assessed. LMs have complex and highly regulated distribution in LSGs. LMs seem to have specific tasks in the dynamic regulation of acinar cell function. LM-111 is important for the normal acinar cell differentiation and its expression is diminished in SS. Also LM-211 and -411 seem to have some acinar specific functional tasks in LSGs. LM-311, -332 and -511 seem to have more general structure maintaining and supporting roles in LSGs and are relatively intact also in SS. Ints α3β1, α6β1, α6β4 and Lu seem to supply structural basis for the firm attachment of epithelial cells to the BM in LSGs. The expression of Ints α1β1 and α2β1 differed clearly from other LM-receptors in that they were found almost exclusively around the acini and intercalated duct cells in salivons suggesting some type of acinar cell compartment-specific or dominant function. Expression of these integrins was lower in SS compared to healthy controls suggesting that the LM-111 and -211-to-Int α1β1 and α2β1 interactions are defective in SS and are crucial to the maintenance of the acini in LSGs. DHEA/DHEA-S concentration in serum and locally in saliva of patients with SS seems to have effects on the salivary glands. These effects were first detected using the androgen-dependent CRISP-3 protein, the production and secretion of which were clearly diminished in SS. This might be due to the impaired function of the intracrine DHEA prohormone metabolizing machinery, which fails to successfully convert DHEA into its active metabolites in LSGs. The progenitor epithelial cells from the intercalated ductal area of LSGs migrate to the acinar compartment and then undergo a phenotype change into secretory acinar cells. This migration and phenotype change seem to be regulated by the LM-111-to-Int α1β1/Int α2β1 interactions. Lack of these interactions could be one factor limiting the normal remodelling process. Androgens are effective stimulators of Int α1β1 and α2β1 expression in physiologic concentrations. Addition of DHEA to the culture medium had effective stimulating effect on the Int α1β1 and α2β1 expression and its effect may be deficient in the LSGs of patients with SS.

Decentralised key management for delay tolerant networks

Public key authentication is the verification of the identity-public key binding, and is foundational to the security of any network. The contribution of this thesis has been to provide public key authentication for a decentralised and resource challenged network such as an autonomous Delay Tolerant Network (DTN). It has resulted in the development and evaluation of a combined co-localisation trust system and key distribution scheme evaluated on a realistic large geographic scale mobility model. The thesis also addresses the problem of unplanned key revocation and replacement without any central authority.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Understanding data flow and security requirements in wireless Body Area Networks for healthcare

The Body Area Network (BAN) is an emerging technology that focuses on monitoring physiological data in, on and around the human body. BAN technology permits wearable and implanted sensors to collect vital data about the human body and transmit it to other nodes via low-energy communication. In this paper, we investigate interactions in terms of data flows between parties involved in BANs under four different scenarios targeting outdoor and indoor medical environments: hospital, home, emergency and open areas. Based on these scenarios, we identify data flow requirements between BAN elements such as sensors and control units (CUs) and parties involved in BANs such as the patient, doctors, nurses and relatives. Identified requirements are used to generate BAN data flow models. Petri Nets (PNs) are used as the formal modelling language. We check the validity of the models and compare them with the existing related work. Finally, using the models, we identify communication and security requirements based on the most common active and passive attack scenarios.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Comparison of ANN models for predicting water quality in distribution systems

Deterministic models have been widely used to predict water quality in distribution systems, but their calibration requires extensive and accurate data sets for numerous parameters. In this study, alternative data-driven modeling approaches based on artificial neural networks (ANNs) were used to predict temporal variations of two important characteristics of water quality chlorine residual and biomass concentrations. The authors considered three types of ANN algorithms. Of these, the Levenberg-Marquardt algorithm provided the best results in predicting residual chlorine and biomass with error-free and ``noisy'' data. The ANN models developed here can generate water quality scenarios of piped systems in real time to help utilities determine weak points of low chlorine residual and high biomass concentration and select optimum remedial strategies.

Voltage and Temperature Aware Statistical Leakage Analysis Framework Using Artificial Neural Networks

Artificial neural networks (ANNs) have shown great promise in modeling circuit parameters for computer aided design applications. Leakage currents, which depend on process parameters, supply voltage and temperature can be modeled accurately with ANNs. However, the complex nature of the ANN model, with the standard sigmoidal activation functions, does not allow analytical expressions for its mean and variance. We propose the use of a new activation function that allows us to derive an analytical expression for the mean and a semi-analytical expression for the variance of the ANN-based leakage model. To the best of our knowledge this is the first result in this direction. Our neural network model also includes the voltage and temperature as input parameters, thereby enabling voltage and temperature aware statistical leakage analysis (SLA). All existing SLA frameworks are closely tied to the exponential polynomial leakage model and hence fail to work with sophisticated ANN models. In this paper, we also set up an SLA framework that can efficiently work with these ANN models. Results show that the cumulative distribution function of leakage current of ISCAS'85 circuits can be predicted accurately with the error in mean and standard deviation, compared to Monte Carlo-based simulations, being less than 1% and 2% respectively across a range of voltage and temperature values.

Algorithms for Exact Structure Discovery in Bayesian Networks

Bayesian networks are compact, flexible, and interpretable representations of a joint distribution. When the network structure is unknown but there are observational data at hand, one can try to learn the network structure. This is called structure discovery. This thesis contributes to two areas of structure discovery in Bayesian networks: space--time tradeoffs and learning ancestor relations. The fastest exact algorithms for structure discovery in Bayesian networks are based on dynamic programming and use excessive amounts of space. Motivated by the space usage, several schemes for trading space against time are presented. These schemes are presented in a general setting for a class of computational problems called permutation problems; structure discovery in Bayesian networks is seen as a challenging variant of the permutation problems. The main contribution in the area of the space--time tradeoffs is the partial order approach, in which the standard dynamic programming algorithm is extended to run over partial orders. In particular, a certain family of partial orders called parallel bucket orders is considered. A partial order scheme that provably yields an optimal space--time tradeoff within parallel bucket orders is presented. Also practical issues concerning parallel bucket orders are discussed. Learning ancestor relations, that is, directed paths between nodes, is motivated by the need for robust summaries of the network structures when there are unobserved nodes at work. Ancestor relations are nonmodular features and hence learning them is more difficult than modular features. A dynamic programming algorithm is presented for computing posterior probabilities of ancestor relations exactly. Empirical tests suggest that ancestor relations can be learned from observational data almost as accurately as arcs even in the presence of unobserved nodes.

Design of logical topologies for wavelength-routed optical networks

his paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.

Throughput performance of distributed applications in switched networks in presence of end-system bottlenecks

The steady state throughput performance of distributed applications deployed in switched networks in presence of end-system bottlenecks is studied in this paper. The effect of various limitations at an end-system is modelled as an equivalent transmission capacity limitation. A class of distributed applications is characterised by a static traffic distribution matrix that determines the communication between various components of the application. It is found that uniqueness of steady state throughputs depends only on the traffic distribution matrix and that some applications (e.g., broadcast applications) can yield non-unique values for the steady state component throughputs. For a given switch capacity, with traffic distribution that yield fair unique throughputs, the trade-off between the end-system capacity and the number of application components is brought out. With a proposed distributed rate control, it has been illustrated that it is possible to have unique solution for certain traffic distributions which is otherwise impossible. Also, by proper selection of rate control parameters, various throughput performance objectives can be realised.

Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection using wireless sensor Networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices,we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: 1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, 2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which 3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time),based on the sensor observations obtained until time slot k.Our results show that an optimum closed loop control onMk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.