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).

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}.

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.

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.

Exploring the random genesis of co-occurrence networks

Using the network random generation models from Gustedt (2009)[23], we simulate and analyze several characteristics (such as the number of components, the degree distribution and the clustering coefficient) of the generated networks. This is done for a variety of distributions (fixed value, Bernoulli, Poisson, binomial) that are used to control the parameters of the generation process. These parameters are in particular the size of newly appearing sets of objects, the number of contexts in which new elements appear initially, the number of objects that are shared with `parent` contexts, and, the time period inside which a context may serve as a parent context (aging). The results show that these models allow to fine-tune the generation process such that the graphs adopt properties as can be found in real world graphs. (C) 2011 Elsevier B.V. All rights reserved.

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.

Characterization of electrical penetration graphs of Bucephalogonia xanthophis, a vector of Xylella fastidiosa in citrus

The sharpshooter Bucephalogonia xanthophis (Berg) (Homoptera: Cicadellidae) is a vector of the xylem-limited bacterium, Xylella fastidiosa (Wells, Raju, Hung, Weisburg, Mandelco-Paul, and Brenner), which causes citrus variegated chlorosis. Despite the importance of citrus variegated chlorosis, the probing behavior of vectors on citrus and its implications for transmission of X. fastidiosa have not been studied. Here we studied electrical penetration graph (EPG-DC system) waveforms produced by B. xanthophis on Citrus sinensis (L.) Osbeck (Rutaceae), and their relationships with stylet activities and xylem ingestion. Electrical penetration graph waveforms were described based on amplitude, frequency, voltage level, and electrical origin of the observed traces during stylet penetration on plant tissues. The main waveforms were correlated with histological observations of salivary sheaths in plant tissues and excretion analysis, in order to determine stylet activities and their precise position. Six waveforms and associated activities are described: (S) secretion of salivary sheath and intracellular stylet pathway, (R) resting during stylet pathway, (Xc) contact of stylets with xylem vessels, (Xi) active xylem ingestion, (N) interruption within the xylem phase (during Xc or Xi), and (W) withdrawal of stylet from the plant. The sharpshooter spent 91.8% of its probing time with its stylet in the xylem, where the main activity was ingestion (Xi: 97.5%). During a probe, the most likely sequence of events is secretion of salivary sheath and pathway (S) through epidermal and parenchyma cells (all individuals), followed by contact with xylem (Xc) (67.6% of all individuals) and ingestion (Xi) (88.3% of those that exhibit waveform Xc). The mean time to contact the xylem (Xc) and initiate ingestion (Xi) after onset of the first probe was 27.8 and 34.2 min, respectively. However, sustained xylem ingestion (Xi > 5 min) was established after 39.8 min, on average. This information is basic for future studies on the transmission mechanisms of X. fastidiosa and in order to establish control strategies aimed at interfering with this process.

Optimal irrigation depth for bean crops considering water constraints and farmer`s risk aversion level

Nowadays, the rising competition for the use of water and environmental resources with consequent restrictions for farmers should change the paradigm in terms of irrigation concepts, or rather, in order to attain economical efficiency other than to supply water requirement for the crop. Therefore, taking into account the social and economical role of bean activity in Brazil, as well as the risk inherent to crop due to its high sensibility to both deficit and excessive water, the optimization methods regarding to irrigation management have become more interesting and essential. This study intends to present a way to determine the optimal water supply, considering different combinations between desired bean yield and level of risk, bringing as a result a graph with the former associated with the latter, depending on different water depths.

Canonical discriminant analysis applied to broiler chicken performance

The mechanisms involved in the control of growth in chickens are too complex to be explained only under univariate analysis because all related traits are biologically correlated. Therefore, we evaluated broiler chicken performance under a multivariate approach, using the canonical discriminant analysis. A total of 1920 chicks from eight treatments, defined as the combination of four broiler chicken strains (Arbor Acres, AgRoss 308, Cobb 500 and RX) from both sexes, were housed in 48 pens. Average feed intake, average live weight, feed conversion and carcass, breast and leg weights were obtained for days 1 to 42. Canonical discriminant analysis was implemented by SAS((R)) CANDISC procedure and differences between treatments were obtained by the F-test (P < 0.05) over the squared Mahalanobis` distances. Multivariate performance from all treatments could be easily visualised because one graph was obtained from two first canonical variables, which explained 96.49% of total variation, using a SAS((R)) CONELIP macro. A clear distinction between sexes was found, where males were better than females. Also between strains, Arbor Acres, AgRoss 308 and Cobb 500 (commercial) were better than RX (experimental), Evaluation of broiler chicken performance was facilitated by the fact that the six original traits were reduced to only two canonical variables. Average live weight and carcass weight (first canonical variable) were the most important traits to discriminate treatments. The contrast between average feed intake and average live weight plus feed conversion (second canonical variable) were used to classify them. We suggest analysing performance data sets using canonical discriminant analysis.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

A Fibred Tableau Calculus for Modal Logics of Agents

In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.

Packing complete multipartite graphs with 4-cycles

In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.

Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.