Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments. (C) 2007 Elsevier B.V. All rights reserved.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Directed Abelian algebras and their application to stochastic models

With each directed acyclic graph (this includes some D-dimensional lattices) one can associate some Abelian algebras that we call directed Abelian algebras (DAAs). On each site of the graph one attaches a generator of the algebra. These algebras depend on several parameters and are semisimple. Using any DAA, one can define a family of Hamiltonians which give the continuous time evolution of a stochastic process. The calculation of the spectra and ground-state wave functions (stationary state probability distributions) is an easy algebraic exercise. If one considers D-dimensional lattices and chooses Hamiltonians linear in the generators, in finite-size scaling the Hamiltonian spectrum is gapless with a critical dynamic exponent z=D. One possible application of the DAA is to sandpile models. In the paper we present this application, considering one- and two-dimensional lattices. In the one-dimensional case, when the DAA conserves the number of particles, the avalanches belong to the random walker universality class (critical exponent sigma(tau)=3/2). We study the local density of particles inside large avalanches, showing a depletion of particles at the source of the avalanche and an enrichment at its end. In two dimensions we did extensive Monte-Carlo simulations and found sigma(tau)=1.780 +/- 0.005.

Sub-telomere directed gene expression during initiation of invasive aspergillosis

Aspergillus fumigatus is a common mould whose spores are a component of the normal airborne flora. Immune dysfunction permits developmental growth of inhaled spores in the human lung causing aspergillosis, a significant threat to human health in the form of allergic, and life-threatening invasive infections. The success of A. fumigatus as a pathogen is unique among close phylogenetic relatives and is poorly characterised at the molecular level. Recent genome sequencing of several Aspergillus species provides an exceptional opportunity to analyse fungal virulence attributes within a genomic and evolutionary context. To identify genes preferentially expressed during adaptation to the mammalian host niche, we generated multiple gene expression profiles from minute samplings of A. fumigatus germlings during initiation of murine infection. They reveal a highly co-ordinated A. fumigatus gene expression programme, governing metabolic and physiological adaptation, which allows the organism to prosper within the mammalian niche. As functions of phylogenetic conservation and genetic locus, 28% and 30%, respectively, of the A. fumigatus subtelomeric and lineage-specific gene repertoires are induced relative to laboratory culture, and physically clustered genes including loci directing pseurotin, gliotoxin and siderophore biosyntheses are a prominent feature. Locationally biased A. fumigatus gene expression is not prompted by in vitro iron limitation, acid, alkaline, anaerobic or oxidative stress. However, subtelomeric gene expression is favoured following ex vivo neutrophil exposure and in comparative analyses of richly and poorly nourished laboratory cultured germlings. We found remarkable concordance between the A. fumigatus host-adaptation transcriptome and those resulting from in vitro iron depletion, alkaline shift, nitrogen starvation and loss of the methyltransferase LaeA. This first transcriptional snapshot of a fungal genome during initiation of mammalian infection provides the global perspective required to direct much-needed diagnostic and therapeutic strategies and reveals genome organisation and subtelomeric diversity as potential driving forces in the evolution of pathogenicity in the genus Aspergillus.

Comparative study of the hygienic behavior of Carniolan and Africanized honey bees directed towards grouped versus isolated dead brood cells

In Apis mellifera, hygienic behavior involves recognition and removal of sick, damaged or dead brood from capped cells. We investigated whether bees react in the same way to grouped versus isolated damaged capped brood cells. Three colonies of wild-type Africanized honey bees and three colonies of Carniolan honey bees were used for this investigation. Capped worker brood cells aged 12 to 14 days old were perforated with the pin-killing method. After making holes in the brood cells, the combs were placed back into the hives; 24 h later the number of cleaned cells was recorded in areas with pin-killed and control brood cells. Four repetitions were made in each colony. Isolated cells were more frequently cleaned than grouped cells, though variance analysis showed no significant difference (P = 0.1421). Carniolan bees also were somewhat, though not significantly more hygienic than Africanized honey bees (P = 0.0840). We conclude that honey bees can detect and remove both isolated and grouped dead brood. The tendency towards greater hygienic efficiency directed towards grouped pin-killed brood may be a consequence of a greater concentration of volatiles emanating from the wounds in the dead pupae.

System-Size Independence of Directed Flow Measured at the BNL Relativistic Heavy-Ion Collider

We measure directed flow (v(1)) for charged particles in Au + Au and Cu + Cu collisions at root s(NN) = 200 and 62.4 GeV, as a function of pseudorapidity (eta), transverse momentum (p(t)), and collision centrality, based on data from the STAR experiment. We find that the directed flow depends on the incident energy but, contrary to all available model implementations, not on the size of the colliding system at a given centrality. We extend the validity of the limiting fragmentation concept to v(1) in different collision systems, and investigate possible explanations for the observed sign change in v(1)(p(t)).

Directed flow at midrapidity in event-by-event hydrodynamics

Fluctuations in the initial geometry of a nucleus-nucleus collision have been recently shown to result in a new type of directed flow (v(1)) that, unlike the usual directed flow, is also present at midrapidity. We compute this new v(1) versus transverse momentum and centrality for Au-Au collisions at RHIC using the hydrodynamic code NeXSPheRIO. We find that the event plane of v(1) is correlated with the angle of the initial dipole of the distribution, as predicted, though with a large dispersion. It is uncorrelated with the reaction plane. Our results are in excellent agreement with results inferred from STAR correlation data.

Numerical evidence against a conjecture on the cover time of planar graphs

We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time tau (G(N)) of a planar graph G(N) of N vertices and maximal degree d is lower bounded by tau (G(N)) >= C(d)N(lnN)(2) with C(d) = (d/4 pi) tan(pi/d), with equality holding for some geometries. We tested this conjecture on the regular honeycomb (d = 3), regular square (d = 4), regular elongated triangular (d = 5), and regular triangular (d = 6) lattices, as well as on the nonregular Union Jack lattice (d(min) = 4, d(max) = 8). Indeed, the Monte Carlo data suggest that the rigorous lower bound may hold as an equality for most of these lattices, with an interesting issue in the case of the Union Jack lattice. The data for the honeycomb lattice, however, violate the bound with the conjectured constant. The empirical probability distribution function of the cover time for the square lattice is also briefly presented, since very little is known about cover time probability distribution functions in general.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

On the resilience of long cycles in random graphs

In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.

Gibbs random graphs on point processes

Consider a discrete locally finite subset Gamma of R(d) and the cornplete graph (Gamma, E), with vertices Gamma and edges E. We consider Gibbs measures on the set of sub-graphs with vertices Gamma and edges E` subset of E. The Gibbs interaction acts between open edges having a vertex in common. We study percolation properties of the Gibbs distribution of the graph ensemble. The main results concern percolation properties of the open edges in two cases: (a) when Gamma is sampled from a homogeneous Poisson process; and (b) for a fixed Gamma with sufficiently sparse points. (c) 2010 American Institute of Physics. [doi:10.1063/1.3514605]

Toxicity-directed approach of polyester manufacturing industry wastewater provides useful information for conducting treatability studies

A broader characterization of industrial wastewaters, especially in respect to hazardous compounds and their potential toxicity, is often necessary in order to determine the best practical treatment (or pretreatment) technology available to reduce the discharge of harmful pollutants to the environment or publicly owned treatment works. Using a toxicity-directed approach, this paper sets the base for a rational treatability study of polyester resin manufacturing. Relevant physical and chemical characteristics were determined. Respirometry was used for toxicity reduction evaluation after physical and chemical effluent fractionation. Of all the procedures investigated, only air stripping was significantly effective in reducing wastewater toxicity. Air stripping in pH 7 reduced toxicity in 18.2%, while in pH 11 a toxicity reduction of 62.5% was observed. Results indicated that toxicants responsible for the most significant fraction of the effluent`s instantaneous toxic effect to unadapted activated sludge were organic compounds poorly or not volatilized in acid conditions. These results led to useful directions for conducting treatability studies which will be grounded on actual effluent properties rather than empirical or based on the rare specific data on this kind of industrial wastewater. (C) 2008 Elsevier B.V. All rights reserved.

Frequency Domain Connectivity Identification: An Application of Partial Directed Coherence in fMRI

Functional magnetic resonance imaging (fMRI) has become an important tool in Neuroscience due to its noninvasive and high spatial resolution properties compared to other methods like PET or EEG. Characterization of the neural connectivity has been the aim of several cognitive researches, as the interactions among cortical areas lie at the heart of many brain dysfunctions and mental disorders. Several methods like correlation analysis, structural equation modeling, and dynamic causal models have been proposed to quantify connectivity strength. An important concept related to connectivity modeling is Granger causality, which is one of the most popular definitions for the measure of directional dependence between time series. In this article, we propose the application of the partial directed coherence (PDC) for the connectivity analysis of multisubject fMRI data using multivariate bootstrap. PDC is a frequency domain counterpart of Granger causality and has become a very prominent tool in EEG studies. The achieved frequency decomposition of connectivity is useful in separating interactions from neural modules from those originating in scanner noise, breath, and heart beating. Real fMRI dataset of six subjects executing a language processing protocol was used for the analysis of connectivity. Hum Brain Mapp 30:452-461, 2009. (C) 2007 Wiley-Liss, Inc.

Characterization of electrical penetration graphs of the Asian citrus psyllid, Diaphorina citri, in sweet orange seedlings

Detailed information on probing behavior of the Asian citrus psyllid, Diaphorina citri Kuwayama (Hemiptera: Psyllidae), is critical for understanding the transmission process of phloem-limited bacteria (Candidatus Liberibacter spp.) associated with citrus `huanglongbing` by this vector. In this study, we investigated stylet penetration activities of D. citri on seedlings of Citrus sinensis (L.) Osbeck cv. Pera (Rutaceae) by using the electrical penetration graph (EPG-DC system) technique. EPG waveforms were described based on amplitude, frequency, voltage level, and electrical origin of the observed traces during stylet penetration into plant tissues. The main waveforms were correlated with histological observations of salivary sheath termini in plant tissues, to determine the putative location of stylet tips. The behavioral activities were also inferred based on waveform similarities in relation to other Sternorrhyncha, particularly aphids and whiteflies. In addition, we correlated the occurrence of specific waveforms with the acquisition of the phloem-limited bacterium Ca. Liberibacter asiaticus by D. citri. The occurrence of a G-like xylem sap ingestion waveform in starved and unstarved psyllids was also compared. By analyzing 8-h EPGs of adult females, five waveforms were described: (C) salivary sheath secretion and other stylet pathway activities; (D) first contact with phloem (distinct from other waveforms reported for Sternorrhyncha); (E1) putative salivation in phloem sieve tubes; (E2) phloem sap ingestion; and (G) probably xylem sap ingestion. Diaphorina citri initiates a probe with stylet pathway through epidermis and parenchyma (C). Interestingly, no potential drops were observed during the stylet pathway phase, as are usually recorded in aphids and other Sternorrhyncha. Once in C, D. citri shows a higher propensity to return to non-probing than to start a phloem or xylem phase. Several probes are usually observed before the phloem phase; waveform D is observed upon phloem contact, always immediately followed by E1. After E1, D. citri either returns to pathway activity (C) or starts phloem sap ingestion, which was the longest activity observed.