1,283 research outputs found

    Grayanotoxin I Intoxication in Pet Pigs

    Get PDF
    Contaminated honey is a common cause of grayanotoxin intoxication in humans. Intoxication of animals, especially cattle, is usually due to ingestion of plants of the Ericaceae family, such as Rhododendron. Here, we report the ingestion of Pieris japonica as the cause of grayanotoxin I intoxication in 2 miniature pigs that were kept as pets. The pigs showed sudden onset of pale oral mucosa, tachycardia, tachypnea, hypersalivation, tremor, and ataxia that progressed to lateral recumbency. The pathological examination of one pig revealed no specific indications for intoxication except for the finding of plant material of Pieris japonica in the intestine. Grayanotoxin I was identified in the ingested plant, gastric content, blood, liver, bile, kidney, urine, lung, and skeletal muscle via HPLC-MS/MS. Grayanotoxin I should be considered as a differential etiological diagnosis in pigs with unspecific signs and discovery of ingested plant material as the only indication in the pathologic examination

    Size reconstructibility of graphs

    Get PDF
    The deck of a graph GG is given by the multiset of (unlabelled) subgraphs {Gv:vV(G)}\{G-v:v\in V(G)\}. The subgraphs GvG-v are referred to as the cards of GG. Brown and Fenner recently showed that, for n29n\geq29, the number of edges of a graph GG can be computed from any deck missing 2 cards. We show that, for sufficiently large nn, the number of edges can be computed from any deck missing at most 120n\frac1{20}\sqrt{n} cards.Comment: 15 page

    Route Planning in Transportation Networks

    Full text link
    We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle

    A legal framework for a transnational offshore grid in the North Sea

    Get PDF
    A legal framework for a transnational offshore grid in the North Sea Most North Sea states consider offshore wind energy as a substantial contributor towards reaching their renewable energy targets. With the increasing number of offshore wind farms and the increasing distance from shore, the question of how to efficiently bring the electricity to shore is gaining importance. To date, the standard approach for transporting the energy to shore is to provide each wind farm with an individual park-to-shore cable. Due to the costs of submarine cables, the scarceness of acceptable cable routes and the potential conflicts with other users of the sea, new concepts are required

    Triangular flow in event-by-event ideal hydrodynamics in Au+Au collisions at sNN=200A\sqrt{s_{\rm NN}}=200A GeV

    Full text link
    The first calculation of triangular flow v3v_3 in Au+Au collisions at sNN=200A\sqrt{s_{\rm NN}}=200A GeV from an event-by-event (3+1)-d transport+hydrodynamics hybrid approach is presented. As a response to the initial triangularity ϵ3\epsilon_3 of the collision zone, v3v_3 is computed in a similar way to the standard event-plane analysis for elliptic flow v2v_2. It is found that the triangular flow exhibits weak centrality dependence and is roughly equal to elliptic flow in most central collisions. We also explore the transverse momentum and rapidity dependence of v2v_2 and v3v_3 for charged particles as well as identified particles. We conclude that an event-by-event treatment of the ideal hydrodynamic evolution starting with realistic initial conditions generates the main features expected for triangular flow.Comment: 5 pages, 7 figures, two figures and discussion added, centrality dependence of e2 and e3 added, version accepted by PR
    corecore