263 research outputs found

    Variations of the global net air–sea heat flux during the “hiatus” period (2001–10)

    Get PDF
    Author Posting. © American Meteorological Society, 2016. This article is posted here by permission of American Meteorological Society for personal use, not for redistribution. The definitive version was published in Journal of Climate 29 (2016): 3647-3660, doi:10.1175/JCLI-D-15-0626.1.An assessment is made of the mean and variability of the net air–sea heat flux, Qnet, from four products (ECCO, OAFlux–CERES, ERA-Interim, and NCEP1) over the global ice-free ocean from January 2001 to December 2010. For the 10-yr “hiatus” period, all products agree on an overall net heat gain over the global ice-free ocean, but the magnitude varies from 1.7 to 9.5 W m−2. The differences among products are particularly large in the Southern Ocean, where they cannot even agree on whether the region gains or loses heat on the annual mean basis. Decadal trends of Qnet differ significantly between products. ECCO and OAFlux–CERES show almost no trend, whereas ERA-Interim suggests a downward trend and NCEP1 shows an upward trend. Therefore, numerical simulations utilizing different surface flux forcing products will likely produce diverged trends of the ocean heat content during this period. The downward trend in ERA-Interim started from 2006, driven by a peculiar pattern change in the tropical regions. ECCO, which used ERA-Interim as initial surface forcings and is constrained by ocean dynamics and ocean observations, corrected the pattern. Among the four products, ECCO and OAFlux–CERES show great similarities in the examined spatial and temporal patterns. Given that the two estimates were obtained using different approaches and based on largely independent observations, these similarities are encouraging and instructive. It is more likely that the global net air–sea heat flux does not change much during the so-called hiatus period.This paper is funded in part by the NOAA Climate Observation Division, Climate Program Office, under Grant NA09OAR4320129 and by the NOAA MAPP Climate Reanalysis Task Force Team under Grant NA13OAR4310106. The study was initiated when X. Liang was a postdoc at MIT, where he was supported in part by the NSF through Grant OCE-0961713, by NOAA through Grant NA10OAR4310135, and by the NASA Physical Oceanography Program through ECCO.2016-11-1

    FPSA: A Full System Stack Solution for Reconfigurable ReRAM-based NN Accelerator Architecture

    Full text link
    Neural Network (NN) accelerators with emerging ReRAM (resistive random access memory) technologies have been investigated as one of the promising solutions to address the \textit{memory wall} challenge, due to the unique capability of \textit{processing-in-memory} within ReRAM-crossbar-based processing elements (PEs). However, the high efficiency and high density advantages of ReRAM have not been fully utilized due to the huge communication demands among PEs and the overhead of peripheral circuits. In this paper, we propose a full system stack solution, composed of a reconfigurable architecture design, Field Programmable Synapse Array (FPSA) and its software system including neural synthesizer, temporal-to-spatial mapper, and placement & routing. We highly leverage the software system to make the hardware design compact and efficient. To satisfy the high-performance communication demand, we optimize it with a reconfigurable routing architecture and the placement & routing tool. To improve the computational density, we greatly simplify the PE circuit with the spiking schema and then adopt neural synthesizer to enable the high density computation-resources to support different kinds of NN operations. In addition, we provide spiking memory blocks (SMBs) and configurable logic blocks (CLBs) in hardware and leverage the temporal-to-spatial mapper to utilize them to balance the storage and computation requirements of NN. Owing to the end-to-end software system, we can efficiently deploy existing deep neural networks to FPSA. Evaluations show that, compared to one of state-of-the-art ReRAM-based NN accelerators, PRIME, the computational density of FPSA improves by 31x; for representative NNs, its inference performance can achieve up to 1000x speedup.Comment: Accepted by ASPLOS 201

    Comparative Study of Data Classification Methods Between EEG and ECoG Used to BCI

    Get PDF
    Abstract: Effective decoding of the source signal is a key to improve Brain-computer interfaces (BCI) performances. Two groups of motor imagery (MI) data based on electroencephalograms (EEG) and electrocorticograms (ECoG) which provided by International Brain-Computer Interface Competition organization are analyzed, and concluded that ECoG signals processing is more suitable for model-driven approaches. Temporal-frequency features were extracted by model-driven method instead of data-driven method and compared, and classified by support vector machine (SVM). The results show 6 % improvement of motor imagery experiment classification accuracy on ECoG data, compared with of data-driven method

    Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles

    Get PDF
    The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway. Recent work considers the scenario in which secret sharing is needed, and separately, the scenario when key cycles are present. The novel technique is the use of a co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of formal encryption in the presence of both key cycles and secret shares at the same time, which is a non-trivial extension of former approaches

    A Timed Logic for Modeling and Reasoning about Security Protocols

    Get PDF
    Many logical methods are usually considered suitable to express the static properties of security protocols while unsuitable to model dynamic processes or properties. However, a security protocol itself is in fact a dynamic process over time, and sometimes it is important to be able to express time-dependent security properties of protocols. In this paper, we present a new timed logic based on predicate modal logic, in which time is explicitly expressed in parameters of predicates or modal operators. This makes it possible to model an agent\u27s actions, knowledge and beliefs at different and exact time points, which enables us to model both protocols and their properties, especially time-dependent properties. We formalize semantics of the presented logic, and prove its soundness. We also present a modeling scheme for formalizing protocols and security properties of authentication and secrecy under the logic. The scheme provides a flexible and succinct framework to reason about security protocols, and essentially enhances the power of logical methods for protocol analysis. As a case study, we then analyze a timed-release protocol using this framework, and discover a new vulnerability that did not appear previously in the literature. We provide a further example to show additional advantages of the modeling scheme in the new logic
    • 

    corecore