Insights into the dynamics and sources of atmospheric lead and particulate matter in Sao Paulo, Brazil, from high temporal resolution sampling

We present the first results of a study investigating the processes that control concentrations and sources of Pb and particulate matter in the atmosphere of Sao Paulo City Brazil Aerosols were collected with high temporal resolution (3 hours) during a four-day period in July 2005 The highest Pb concentrations measured coincided with large fireworks during celebration events and associated to high traffic occurrence Our high-resolution data highlights the impact that a singular transient event can have on air quality even in a megacity Under meteorological conditions non-conducive to pollutant dispersion Pb and particulate matter concentrations accumulated during the night leading to the highest concentrations in aerosols collected early in the morning of the following day The stable isotopes of Pb suggest that emissions from traffic remain an Important source of Pb in Sao Paulo City due to the large traffic fleet despite low Pb concentrations in fuels (C) 2010 Elsevier BV All rights reserved

Alteration of purinergic P2X(4) and P2X(7) receptor expression in rats with temporal-lobe epilepsy induced by pilocarpine

Although ATP and P2X receptor activity have been lately associated with epilepsy, little is known regarding their exact roles in epileptogenesis. Temporal-lobe epilepsy (TLE) in rat was induced by pilocarpine in order to study changes of hippocampal P2X(2), P2X(4) and P2X(7) receptor expression during acute, latent or chronic phases of epilepsy. During acute and chronic phases increased P2X(7) receptor expression was principally observed in glial cells and glutamatergic nerve terminals, suggesting participation of this receptor in the activation of inflammatory and excitotoxic processes during epileptogenesis. No significant alterations of hippocampal P2X(2) and P2X(4) receptor expression was noted during the acute or latent phase when compared to the control group, indicating that these receptors are not directly involved with the initiation of epilepsy. However, the reduction of hippocampal P2X(4) receptor immunostaining in the chronic phase could reflect neuronal toss or decreased GABAergic signaling. (C) 2008 Elsevier B.V. All rights reserved.

Temporal indicators of language dominance in bilingual children

In the field of bilingualism it is of particular interest to stablish which, if any, of a speaker’s languages is dominant. Earlier research has shown that immigrants who acquire a new language tend to use elements of the timing patterns of the new language in their native language. It is shown here that measurements of timing in the two languages spoken by bilingual children can give information about the relative dominance of the languages for the individual speaker.

The priority of temporal aspects in L2-Swedish prosody : Studies in perception and production

Foreign accent can be everything from hardly detectable to rendering the second language speech unintelligible. It is assumed that certain aspects of a specific target language contribute more to making the foreign accented speech intelligible and listener friendly, than others. The present thesis examines a teaching strategy for Swedish pronunciation in second language education. The teaching strategy “Basic prosody” or BP, gives priority to temporal aspects of Swedish prosody, which means the temporal phonological contrasts word stress and quantity, as well as the durational realizations of these contrasts. BP does not prescribe any specific tonal realizations. This standpoint is based on the great regional variety in realization and distribution of Swedish word accents. The teaching strategy consists virtually of three directives: · Stress the proper word in the sentence. · Stress proper syllables in stressed words and make them longer. · Lengthen the proper segment – vowel or subsequent consonant – in the stressed syllable. These directives reflect the view that all phonological length is stress-induced, and that vowel length and consonant length are equally important as learning goals. BP is examined in the light of existing findings in the field of second language pronunciation and with respect to the phonetic correlates of Swedish stress and quantity. Five studies examine the relation between segment durations and the categorization made by native Swedish listeners. The results indicate that the postvocalic consonant duration contributes to quantity categorization as well as giving the proper duration to stressed syllables. Furthermore, native Swedish speakers are shown to apply the complementary /V: C/ - /VC:/ pattern also when speaking English and German, by lengthening postvocalic consonants. The correctness of the priority is not directly addressed but important aspects of BP are supported by earlier findings as well as the results from the present studies.

Monodic temporal resolution

Until recently, First-Order Temporal Logic (FOTL) has been only partially understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However, a breakthrough by Hodkinson et al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of FOTL. Yet, in order to utilise these theoretical advances, it is important to have appropriate proof techniques for this monodic fragment.In this paper, we modify and extend the clausal temporal resolution technique, originally developed for propositional temporal logics, to enable its use in such monodic fragments. We develop a specific normal form for monodic formulae in FOTL, and provide a complete resolution calculus for formulae in this form. Not only is this clausal resolution technique useful as a practical proof technique for certain monodic classes, but the use of this approach provides us with increased understanding of the monodic fragment. In particular, we here show how several features of monodic FOTL can be established as corollaries of the completeness result for the clausal temporal resolution method. These include definitions of new decidable monodic classes, simplification of existing monodic classes by reductions, and completeness of clausal temporal resolution in the case of monodic logics with expanding domains, a case with much significance in both theory and practice.

Mechanising first-order temporal resolution

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. Although a complete and correct resolution-style calculus has already been suggested for this specific fragment, this calculus involves constructions too complex to be of practical value. In this paper, we develop a machine-oriented clausal resolution method which features radically simplified proof search. We first define a normal form for monodic formulae and then introduce a novel resolution calculus that can be applied to formulae in this normal form. By careful encoding, parts of the calculus can be implemented using classical first-order resolution and can, thus, be efficiently implemented. We prove correctness and completeness results for the calculus and illustrate it on a comprehensive example. An implementation of the method is briefly discussed.

Monodic Temporal Resolution

First-order temporal logic is a coincise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics have identified important enumerable and even decidable fragments. In this paper we present the first resolution-based calculus for monodic first-order temporal logic. Although the main focus of the paper is on establishing completeness result, we also consider implementation issues and define a basic loop-search algorithm that may be used to guide the temporal resolution system.

Handling Equality in Monodic Temporal Resolution

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic resolution method to the guarded monodic fragment with equality and first-order temporal logic over expanding domains. We introduce novel resolution calculi that can be applied to formulae in the normal form associated with the clausal resolution method, and state correctness and completeness results.

Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. In this paper, we develop a clausal resolution method for the monodic fragment of first-order temporal logic over expanding domains. We first define a normal form for monodic formulae and then introduce novel resolution calculi that can be applied to formulae in this normal form. We state correctness and completeness results for the method. We illustrate the method on a comprehensive example. The method is based on classical first-order resolution and can, thus, be efficiently implemented.

Searching for Invariants Using Temporal Resolution

In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants, and so is suitable for mechanising a wide class of temporal problems. We demonstrate that this scheme of searching for invariants can be also applied to a class of multi-predicate induction problems represented by mutually recursive definitions. Completeness of the approach, examples of the application of the scheme, and overview of the implementation are described.