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]

An oracle approach for interaction neighborhood estimation in random fields

We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field. We introduce a model selection rule to choose estimators of conditional probabilities among natural candidates. Our main result is an oracle inequality satisfied by the resulting estimator. We use then this selection rule in a two-step procedure to evaluate the interacting neighborhoods. The selection rule selects a small prior set of possible interacting points and a cutting step remove from this prior set the irrelevant points. We also prove that the Ising models satisfy the assumptions of the main theorems, without restrictions on the temperature, on the structure of the interacting graph or on the range of the interactions. It provides therefore a large class of applications for our results. We give a computationally efficient procedure in these models. We finally show the practical efficiency of our approach in a simulation study.

The Lobel-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars

Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k is an element of N, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r( T, T') of trees T, T' from the above classes.

Morpholin-4-ium morpholine-4-carbodithioate

The title compound, C(4)H(10)NO(+)center dot C(5)H(8)NOS(2)(-), is built up of a morpholinium cation and a dithiocarbamate anion. In the crystal, two structurally independent formula units are linked via N-H center dot center dot center dot S hydrogen bonds, forming an inversion dimer, with graph-set motif R(4)(4)(12).

Liquid-liquid microextraction without phase separation in a multicommuted flow system for diltiazem determination in pharmaceuticals

Liquid-liquid microextraction without phase segmentation was implemented in a multicommuted flow system for determination of the anti-hypertensive diltiazem. The procedure was based on ion pair formation between the drug and the dye bromothymol blue at pH 3.5. The detection was performed without phase separation in a glass tube coupled to a fiber-optics spectrophotometer. The total volume of chloroform was reduced to 50 mu L in comparison with 10 mL consumed in batch. A linear response was observed between 9 and 120 mu mol L(-1), with a detection limit of 0.9 mu mol L(-1) (99.7% confidence level). The coefficient of variation (n = 10), sampling rate and extraction efficiency were estimated as 0.6%, 78 determinations per hour and 61%, respectively. About 30 mu g of bromothymol blue was consumed and the waste volume was 380 mu L per determination. The results for pharmaceutical samples agreed with those obtained by the reference procedure at the 95% confidence level. (C) 2011 Elsevier B.V. All rights reserved.

Involvement of Clostridium gasigenes and C. algidicarnis in `blown pack` spoilage of Brazilian vacuum-packed beef

The objectives of this study were to isolate psychrotrophic clostridia from Brazilian vacuum-packed beef cuts (spoiled or not) and to identify the isolates by using 16S rRNA gene sequencing. Anaerobic psychrotrophic microorganisms were also enumerated and samples were collected to verify the incidence of psychrotrophic clostridia in the abattoir environment. Vacuum-packed beef cuts (n = 8 grossly distended and n = 5 non-spoiled) and environmental samples were obtained from a beef packing plant located in the state of Sao Paulo, Brazil. Each sample was divided in three subsamples (exudate, beef surface and beef core) that were analyzed for vegetative forms, total spore-forming, and sulfide reducing spore-forming, both activated by alcohol and heat. Biochemical profiles of the isolates were obtained using API20A, with further identification using 16S rRNA gene sequencing. The growth temperature and the pH range were also assessed. Populations of psychrotrophic anaerobic vegetative microorganisms of up to 10(10) CFU/(g, mL or 100 cm(2)) were found in `blown pack` samples, while in non-spoiled samples populations of 10(5) CFU/(g, CFU/mL or CFU/100cm(2)) was found. Overall, a higher population of total spores and sulfide reducing spores activated by heat in spoiled samples was found. Clostridium gasigenes (n = 10) and C. algidicarnis (n = 2) were identified using 16S rRNA gene sequencing. Among the ten C. gasigenes isolates, six were from spoiled samples (C1, C2 and C9), two were isolated from non-spoiled samples (C4 and C5) and two were isolated from the hide and the abattoir corridor/beef cut conveyor belt. C. algidicarnis was recovered from spoiled beef packs (C2). Although some samples (C3, C7, C10 and C14) presented signs of `blown pack` spoilage, Clostridium was not recovered. C. algidicarnis (n = 1) and C. gasigenes (n = 9) isolates have shown a psychrotrophic behavior, grew in the range 6.2-8.2. This is the first report on the isolation of psychrotrophic Clostridium (C. gasigenes and C. algidicarnis) in Brazil. This study shows that psychrotrophic Clostridium may pose a risk for the stability of vacuum-packed beef produced in tropical countries during shelf-life and highlights the need of adopting control measures to reduce their incidence in abattoir and the occurrence of `blown pack` spoilage. (C) 2011 Elsevier B.V. All rights reserved.

Macronutrients in Marandu Palisade Grass as Influenced by Lime, Slag, and Nitrogen Fertilization

Soil acidity is one of the main limiting factors for the growth of pasture grasses in Brazilian soils. In addition to lime, slag can be used to correct soil acidity and help plants to absorb nutrients in adequate amounts. The objective of this experiment was to evaluate, under greenhouse conditions, the effects of slag and lime plus nitrogen (N) on marandu palisade grass plants` nutritional status as well as the absorption of macronutrients submitted to two cuts. The treatments consisted of two corrective materials (slag and lime), three corrective material rates (0.81, 1.61, and 3.22 g dm-3 of ECaCO3), three N rates (75, 150, and 300 mg dm-3) plus a control treatment, with four replications. Macronutrient contents in the forage plants were found to be present in adequate levels. The mean value of N accumulated in the shoot was 40.1 mg per plant, phosphorus (P) was 4.6 mg per plant, potassium (K) was 38.6 mg per plant, calcium (Ca) was 7.3 mg per plant, magnesium (Mg) was 6.7 mg per plant, and sulfur (S) was 3.5 mg per plant at the first cut. At the second cut, the nutrient accumulations values were N 50.8 mg per plant, P 6.3 mg per plant, K 20.7 mg per plant, Ca 21.6 mg per plant, Mg 24.0 mg per plant, and S 4.7 mg per plant. Macronutrients accumulation in the shoot of grass increased with the addition of both the correctives as well as the N rates.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Investigating Giant (Gt) Repression in the Formation of Partially Overlapping Pair-Rule Stripes

Drosophila pair-rule genes are expressed in striped patterns with a precise order of overlap between stripes of different genes. We investigated the role of Giant (Gt) in the regulation of even-skipped, hairy, runt, and fushi tarazu stripes formed in the vicinity of Gt expression domains. In gt null embryos, specific stripes of eve, h, run, and ftz are disrupted. With an ectopic expression system, we verified that stripes affected in the mutant are also repressed. Simultaneously hybridizing gt misxpressing embryos with two pair-rule gene probes, we were able to distinguish differences in the repression of pairs of stripes that overlap extensively. Together, our results showed Gt repression roles in the regulation of two groups of partially overlapping stripes and that Gt morphogen activity is part of the mechanism responsible for the differential positioning of these stripes borders. We discuss the possibility that other factors regulate Gt stripe targets as well. Developmental Dynamics 239:2989-2999, 2010. (C) 2010 Wiley-Liss, Inc.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

HYBRID AND INCREMENTAL FUZZY LEARNING FOR HUMAN SKIN DETECTION

In this paper, a framework for detection of human skin in digital images is proposed. This framework is composed of a training phase and a detection phase. A skin class model is learned during the training phase by processing several training images in a hybrid and incremental fuzzy learning scheme. This scheme combines unsupervised-and supervised-learning: unsupervised, by fuzzy clustering, to obtain clusters of color groups from training images; and supervised to select groups that represent skin color. At the end of the training phase, aggregation operators are used to provide combinations of selected groups into a skin model. In the detection phase, the learned skin model is used to detect human skin in an efficient way. Experimental results show robust and accurate human skin detection performed by the proposed framework.

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.

Probabilistic logic with independence

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. (c) 2007 Elsevier Inc. All rights reserved.

A novel continuous time representation for the scheduling of pipeline systems with pumping yield rate constraints

Pipeline systems play a key role in the petroleum business. These operational systems provide connection between ports and/or oil fields and refineries (upstream), as well as between these and consumer markets (downstream). The purpose of this work is to propose a novel MINLP formulation based on a continuous time representation for the scheduling of multiproduct pipeline systems that must supply multiple consumer markets. Moreover, it also considers that the pipeline operates intermittently and that the pumping costs depend on the booster stations yield rates, which in turn may generate different flow rates. The proposed continuous time representation is compared with a previously developed discrete time representation [Rejowski, R., Jr., & Pinto, J. M. (2004). Efficient MILP formulations and valid cuts for multiproduct pipeline scheduling. Computers and Chemical Engineering, 28, 1511] in terms of solution quality and computational performance. The influence of the number of time intervals that represents the transfer operation is studied and several configurations for the booster stations are tested. Finally, the proposed formulation is applied to a larger case, in which several booster configurations with different numbers of stages are tested. (C) 2007 Elsevier Ltd. All rights reserved.

Recognition of noisy images by PLL networks

We use networks composed of three phase-locked loops (PLLs), where one of them is the master, for recognizing noisy images. The values of the coupling weights among the PLLs control the noise level which does not affect the successful identification of the input image. Analytical results and numerical tests are presented concerning the scheme performance. (c) 2008 Elsevier B.V. All rights reserved.