Aproximación fenomenológica al concepto de refugio temporal: anacronismos de una construcción inestable

Ponencia leída en el Foro de Comunicaciones IkasArt III (BEC Barakaldo, 2011.11.11)[por Skype]

Fish assemblages and benthic habitats of Buck Island Reef National Monument (St. Croix, U.S. Virgin Islands) and the surrounding seascape: A characterization of spatial and temporal patterns

Since 1999, NOAA’s Biogeography Branch of the Center for Coastal Monitoring and Assessment (CCMA-BB) has been working with federal and territorial partners to characterize, monitor, and assess the status of the marine environment around northeastern St. Croix, U.S. Virgin Islands. This effort is part of the broader NOAA Coral Reef Conservation Program’s (CRCP) National Coral Reef Ecosystem Monitoring Program (NCREMP). With support from CRCP’s NCREMP, CCMA conducts the “Caribbean Coral Reef Ecosystem Monitoring project” (CREM) with goals to: (1) spatially characterize and monitor the distribution, abundance, and size of marine fauna associated with shallow water coral reef seascapes (mosaics of coral reefs, seagrasses, sand and mangroves); (2) relate this information to in situ fine-scale habitat data and the spatial distribution and diversity of habitat types using benthic habitat maps; (3) use this information to establish the knowledge base necessary for enacting management decisions in a spatial setting; (4) establish the efficacy of those management decisions; and (5) develop data collection and data management protocols. The monitoring effort in northeastern St. Croix was conducted through partnerships with the National Park Service (NPS) and the Virgin Islands Department of Planning and Natural Resources (VI-DPNR). The geographical focal point of the research is Buck Island Reef National Monument (BIRNM), a protected area originally established in 1961 and greatly expanded in 2001; however, the work also encompassed a large portion of the recently created St. Croix East End Marine Park (EEMP). Project funding is primarily provided by NOAA CRCP, CCMA and NPS. In recent decades, scientific and non-scientific observations have indicated that the structure and function of the coral reef ecosystem around northeastern St. Croix have been adversely impacted by a wide range of environmental stressors. The major stressors have included the mass Diadema die off in the early 1980s, a series of hurricanes beginning with Hurricane Hugo in 1989, overfishing, mass mortality of Acropora corals due to disease and several coral bleaching events, with the most severe mass bleaching episode in 2005. The area is also an important recreational resource supporting boating, snorkeling, diving and other water based activities. With so many potential threats to the marine ecosystem and a dramatic change in management strategy in 2003 when the park’s Interim Regulations (Presidential Proclamation No. 7392) established BIRNM as one of the first fully protected marine areas in NPS system, it became critical to identify existing marine fauna and their spatial distributions and temporal dynamics. This provides ecologically meaningful data to assess ecosystem condition, support decision making in spatial planning (including the evaluation of efficacy of current management strategies) and determine future information needs. The ultimate goal of the work is to better understand the coral reef ecosystems and to provide information toward protecting and enhancing coral reef ecosystems for the benefit of the system itself and to sustain the many goods and services that it offers society. This Technical Memorandum contains analysis of the first six years of fish survey data (2001-2006) and associated characterization of the benthos (1999-2006). The primary objectives were to quantify changes in fish species and assemblage diversity, abundance, biomass and size structure and to provide spatially explicit information on the distribution of key species or groups of species and to compare community structure inside (protected) versus outside (fished) areas of BIRNM. (PDF contains 100 pages).

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

A temporal and spatial study of invertebrate communities associated with hard-bottom habitats in the South Atlantic Bight

Species composition, biomass, density, and diversity of benthic invertebrates from six bard-bottom areas were evaluated. Seasonal collections using a dredge, trawl, and suction and grab samplers yielded 432, 525, and 845 taxa, respectively. Based on collections wltb the different gear types, species composition of invertebrates was found to change bathymetrically. Inner- and mlddle-shelf sites were more similar to each other in terms of invertebrate species composition than they were to outer-shelf sites, regardless of season. Sites on the inner and outer shelf were grouped according to latitude; however, results suggest that depth is apparently a more important determinant of invertebrate species composition than either season or latitude. Sponges generally dominated dredge and trawl collections in terms of biomass. Generally, cnidarians, bryozoans, and sponges dominated at sites In terms of number of taxa collected. The most abundant smaller macrofauna collected in suction and grab samples were polychaetes, amphipods, and mollusks. Densities of the numerically dominant species changed botb seasonally and bathymetrically, with very few of these species restricted to a specific bathymetrlc zone. The high diversity of invertebrates from hard-bottom sites is attributed to the large number of rare species. No consistent seasonal changes in diversity or number of species were noted for individual stations or depth zones. In addition, H and its components showed no definite patterns related to depth or latitude. However, more species were collected at middle-shelf sites than at inner- or outer-shelf sites, which may be related to more stable bottom temperature or greater habitat complexity in that area. (PDF file contains 110 pages.)

Alvará com força de Ley, por que Vossa Magestade ha por bem renovar a inteira, e inviolavel observancia da Ley de doze de setembro de mil seiscentos cincoenta e tres, em quanto nella se estabeleceo, que os indios do Graõ Pará, e Maranhaõ sejão governados no temporal pelos Governadores, Ministros, e pelos seus principaes, e justiças seculares, com inhibição das administrações dos regulares, derogando todas as Leys, Regimentos, Ordens, e Disposições contrarias : para V. Magestade ver

Ao alto do título : Sebastião José de Carvalho e Mello.

Fiabilidad de los predictores clínicos y de la biopsia de arteria temporal en el diagnóstico de la arteritis de células gigantes

182 p. : il.

Variación temporal del ADNmt en poblaciones de la cornisa cantábrica. Contribución del AND antiguo

333 p.

Neural representation of auditory temporal structure

Neurons in the songbird forebrain nucleus HVc are highly sensitive to auditory temporal context and have some of the most complex auditory tuning properties yet discovered. HVc is crucial for learning, perceiving, and producing song, thus it is important to understand the neural circuitry and mechanisms that give rise to these remarkable auditory response properties. This thesis investigates these issues experimentally and computationally.

Extracellular studies reported here compare the auditory context sensitivity of neurons in HV c with neurons in the afferent areas of field L. These demonstrate that there is a substantial increase in the auditory temporal context sensitivity from the areas of field L to HVc. Whole-cell recordings of HVc neurons from acute brain slices are described which show that excitatory synaptic transmission between HVc neurons involve the release of glutamate and the activation of both AMPA/kainate and NMDA-type glutamate receptors. Additionally, widespread inhibitory interactions exist between HVc neurons that are mediated by postsynaptic GABA_A receptors. Intracellular recordings of HVc auditory neurons in vivo provides evidence that HV c neurons encode information about temporal structure using a variety of cellular and synaptic mechanisms including syllable-specific inhibition, excitatory post-synaptic potentials with a range of different time courses, and burst-firing, and song-specific hyperpolarization.

The final part of this thesis presents two computational approaches for representing and learning temporal structure. The first method utilizes comput ational elements that are analogous to temporal combination sensitive neurons in HVc. A network of these elements can learn using local information and lateral inhibition. The second method presents a more general framework which allows a network to discover mixtures of temporal features in a continuous stream of input.

Temporal synchronization in optical parametric chirped pulse amplification laser system

The effect of temporal synchronization between the chirped signal pulse and the pumping pulse in an optical parametric chirped pulse amplification laser system is researched theoretically and experimentally. The results show that the gain of optical parametric amplification is sensitive to the temporal synchronization. Therefore, accurate temporal synchronization between the chirped signal pulse and the pumping pulse is essential to obtain high optical parametric amplification gain and stable output from an optical parametric chirped pulse amplification laser. Based on our 16.7-TW/120-fs optical parametric chirped pulse amplification laser system with similar to1-ns pumping pulse duration and <10-ps time jitter between the signal and pumping pulse, the effect of the temporal synchronization on optical parametric chirped pulse amplification is demonstrated. The experimental results agree with the calculation. (C) 2004 Society of Photo-Optical Instrumentation Engineers.

Diffraction integral formulas of the pulsed wave field in the temporal domain

To resolve the diffraction problems of the pulsed wave field directly in the temporal domain, we extend the Rayleigh diffraction integrals to the temporal domain and then discuss the approximation condition of this diffraction formula. (C) 1997 Optical Society of America.

Analysis of temporal structure in spike trains of visual cortical area MT

The temporal structure of neuronal spike trains in the visual cortex can provide detailed information about the stimulus and about the neuronal implementation of visual processing. Spike trains recorded from the macaque motion area MT in previous studies (Newsome et al., 1989a; Britten et al., 1992; Zohary et al., 1994) are analyzed here in the context of the dynamic random dot stimulus which was used to evoke them. If the stimulus is incoherent, the spike trains can be highly modulated and precisely locked in time to the stimulus. In contrast, the coherent motion stimulus creates little or no temporal modulation and allows us to study patterns in the spike train that may be intrinsic to the cortical circuitry in area MT. Long gaps in the spike train evoked by the preferred direction motion stimulus are found, and they appear to be symmetrical to bursts in the response to the anti-preferred direction of motion. A novel cross-correlation technique is used to establish that the gaps are correlated between pairs of neurons. Temporal modulation is also found in psychophysical experiments using a modified stimulus. A model is made that can account for the temporal modulation in terms of the computational theory of biological image motion processing. A frequency domain analysis of the stimulus reveals that it contains a repeated power spectrum that may account for psychophysical and electrophysiological observations.

Some neurons tend to fire bursts of action potentials while others avoid burst firing. Using numerical and analytical models of spike trains as Poisson processes with the addition of refractory periods and bursting, we are able to account for peaks in the power spectrum near 40 Hz without assuming the existence of an underlying oscillatory signal. A preliminary examination of the local field potential reveals that stimulus-locked oscillation appears briefly at the beginning of the trial.

Pulse temporal cleaner based on nonlinear ellipse rotation by using BK7 glass plate

We report a new pulse cleaning technique to enhance the contrast ratio of intense ultra-short laser pulses. A pulse temporal cleaner based on nonlinear ellipse rotation by using BK7 glass plate is developed, and a contrast ratio improvement of two orders of magnitude for the milli-joule level femtosecond input pulses is demonstrated, the total transmission efficiency of the pulse cleaner is 16.7%.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.