1,722,348 research outputs found
Sceliphron javanum subsp. chinenense van Breugel 1968
No full text<i>4.</i> <i>Sceliphron javanum chinenense</i> van Breugel, 1968 <p> <i>Sceliphron javanum chinense</i> van Breugel <i>in</i> van der Vecht & van Breugel 1968: 244, ♀, ♂. Holotype: ♀, China: Island of Hainan: Fan Heang (MCZ).</p> <p> <b>Diagnosis.</b> Mesoscutum more or less distinctly striate, but striae not sharply defined; scutellum longitudinally striate; second submarginal cell anteriorly as a rule narrower than third; hind tibia black; hind femur yellow, with usually ill defined fuscous mark at apex above; at least apical third of fore and mid femora yellow to yellowish brown; fore and mid tibiae orange yellow.</p> <p> According to van der Vecht & van Breugel (1968: 244), <i>S. javanum chinense</i> van Breugel is very similar to <i>S. javanum javanum</i> (Lepeletier) and <i>S. javanum petiolare</i> Kohl, but differs mainly by leg colour.</p> <p> <b>Note</b>. van der Vecht & van Breugel (1968) tentatively placed specimens from Sikkim, West Bengal, Assam (presently Meghalaya) under <i>S. javanum chinenense</i> van Breugel as sufficient materials from these areas were not available for them. For this reason this subspecies has been excluded from the present study.</p> <p> <b>Distribution</b>. India: Meghalaya, Sikkim (?), West Bengal. <i>Elsewhere</i>: China; Laos; Vietnam (van der Vecht & van Breugel 1968; Pulawski 2021).</p>Published as part of <i>Anagha, S., Kumar, P. Girish, Binoy, C., Mazumdar, P. C. & Sureshan, P. M., 2021, A review of the mud-dauber wasps of genus Sceliphron Klug (Hymenoptera Sphecidae) from India, pp. 61-85 in Zootaxa 4969 (1)</i> on page 82, DOI: 10.11646/zootaxa.4969.1.3, <a href="http://zenodo.org/record/4745790">http://zenodo.org/record/4745790</a>
Van Breugel Master's Thesis
No full textLarge Igneous Provinces (LIPs) form as a result of either mantle plumes, rifting, or subduction, with plume origins being favored in most cases. Each geodynamic setting provides geochemical and geochronological spatial patterns, which can be used to distinguish them. Detailed spatial context has not been considered for combinations of isotope and lithogeochemical data associated with most LIPs. Therefore, the Karoo & Ferrar and Parana-Etendeka LIPs are used to test this theory.
Jurassic break-up of SW Gondwana and formation of the associated Karoo and Ferrar LIPs provide a useful test case because of the amount of data available and their known spatial context. Ages range from 183 Ma to 172 Ma. While the age range is close to 11 million years (m.y.), U-Pb ages correspond to a range from 183-179 Ma. Younger Ar-Ar dates coincide with the U-Pb ages, raising the possibility that Ar-Ar dates represent closure ages rather than igneous crystallization ages. Whole-rock lithochemistry illustrates distinct variable spatial patterns logically linked to a triple junction between Africa and Antarctica for the Karoo magmatism while coeval Ferrar activity is situated parallel to the original subduction margin of Gondwana.
Extensive study on the Parana-Etendeka LIP associated with the Cretaceous break-up of South America and Africa provides a similar test case as the Jurassic Karoo & Ferrar LIPs, based on the amount of data available and their known spatial context. Geochronologically, Ar-Ar dates range from 137 Ma to 125 Ma with U-Pb ages set around 135-133 Ma. With an Ar-Ar age range of 12 m.y. coinciding with the U-Pb ages, Ar-Ar dates potentially represent cooling/closure ages rather than igneous crystallization ages. Whole-rock lithogeochemistry illustrates spatially distinct variations which differ from dyke swarm patterns linked to a triple junction between Africa and South America. Difference between initially assumed and newly assumed plume centers presents the idea that Parana-Etendeka magmatism is coeval to Atlantic rifting, rather than a direct cause of rifting.
Comparison of these sets of LIPs provides similar results in identification of volcanic origins and magmatism. Presence of a continued heat source, most likely caused from plume-induced magmatism, suggests Ar-Ar dates represent cooling/closure ages. Other LIP test cases present effective use of whole-rock and isotope geochemical proxies in magmatic classification
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages(QAPL 2007), Braga, Portugal
No full textObserving Walking Drosophila Behavior in Response to Optogenetically Induced Olfactory Stimulation
No full textVan Breugel Seino. 2019. Atong Texts: Glossed, Translated and Annotated Narratives in a Tibeto-Burman Language of Meghalaya, Northeast India
Get PDFThis presentation of 37 glossed, translated and annotated texts is based on field recordings made by van Breugel from 2004 to 2007, while he was a PhD student at LaTrobe University. They are presented here in a distinct volume which completes the trio made up of the previously published dictionary (2009, rev. 2015) and grammar (2014) of the endangered language Atong, which van Breugel is the first linguist to document. Atong is a Tibeto-Burman language of Northeast India and Bangladesh, class..
Failures, Finiteness, and Full Abstraction
No full textion Franck van Breugel September 09, 1997 ADDR: Corso Italia 40,56125 Pisa,Italy. TEL: +39-50-887111. FAX: +39-50-887226 Failures, Finiteness, and Full Abstraction Franck van Breugel Universit`a di Pisa, Department of Computer Science Corso Italia 40, 56125 Pisa, Italy [email protected] Abstract For a simple CCS-like language a trace semantics and a failure semantics are presented. The failure semantics is shown to be fully abstract with respect to the trace semantics if and only if the set of internal actions is infinite. Introduction In this paper we focus on the full abstraction problem. Already in the early seventies this issue was raised by Milner [Mil73, page 168]. For a discussion of its importance we refer the reader to the introduction of Stoughton's monograph [Sto88]. In the early eighties, Brookes, Hoare, and Roscoe [BHR84] introduced failures to provide a semantics for CSP [Hoa85]. These failures give rise to a fully abstract semantics for CSP as was shown by Bergst..
Computing Probabilistic Bisimilarity Distances via Policy Iteration
Get PDFA transformation mapping a labelled Markov chain to a simple stochastic game is presented. In the resulting simple stochastic game, each vertex corresponds to a pair of states of the labelled Markov chain. The value of a vertex of the simple stochastic game is shown to be equal to the probabilistic bisimilarity distance, a notion due to Desharnais, Gupta, Jagadeesan and Panangaden, of the corresponding pair of states of the labelled Markov chain. Bacci, Bacci, Larsen and Mardare introduced an algorithm to compute the probabilistic bisimilarity distances for a labelled Markov chain. A modification of a basic version of their algorithm for a labelled Markov chain is shown to be the policy iteration algorithm applied to the corresponding simple stochastic game. Furthermore, it is shown that this algorithm takes exponential time in the worst case
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata
Get PDFProbabilistic bisimilarity, due to Segala and Lynch, is an equivalence relation that captures which states of a probabilistic automaton behave exactly the same. Deng, Chothia, Palamidessi and Pang proposed a robust quantitative generalization of probabilistic bisimilarity. Their probabilistic bisimilarity distances of states of a probabilistic automaton capture the similarity of their behaviour. The smaller the distance, the more alike the states behave. In particular, states are probabilistic bisimilar if and only if their distance is zero.
Although the complexity of computing probabilistic bisimilarity distances for probabilistic automata has already been studied and shown to be in NP cap coNP and PPAD, we are not aware of any practical algorithm to compute those distances. In this paper we provide several key results towards algorithms to compute probabilistic bisimilarity distances for probabilistic automata. In particular, we present a polynomial time algorithm that decides distance one. Furthermore, we give an alternative characterization of the probabilistic bisimilarity distances as a basis for a policy iteration algorithm
- …
