scholarly journals Oxygen evolution on well-characterized mass-selected Ru and RuO2nanoparticles

2015 ◽  
Vol 6 (1) ◽  
pp. 190-196 ◽  
Author(s):  
Elisa A. Paoli ◽  
Federico Masini ◽  
Rasmus Frydendal ◽  
Davide Deiana ◽  
Christian Schlaup ◽  
...  

Well-defined mass-selected Ru and RuO2nanoparticles exhibit an order of magnitude improvement in the oxygen evolution activity, relative to the state-of-the-art, with a maximum at around 3–5 nm.

Author(s):  
Takahiro Naito ◽  
Tatsuya Shinagawa ◽  
Takeshi Nishimoto ◽  
Kazuhiro Takanabe

Recent spectroscopic and computational studies concerning the oxygen evolution reaction over iridium oxides are reviewed to provide the state-of-the-art understanding of its reaction mechanism.


2020 ◽  
Vol 8 (31) ◽  
pp. 15746-15751 ◽  
Author(s):  
Kai Wang ◽  
Bolong Huang ◽  
Weiyu Zhang ◽  
Fan Lv ◽  
Yi Xing ◽  
...  

We report a novel architecture of ultrathin RuRh@(RuRh)O2 core/shell nanosheets with a core of ultrathin metallic RuRh nanosheets and a shell of (RuRh)O2 oxides as a superb electrocatalyst toward the oxgen evolution reaction (OER), better than most of the state-of-the-art Ru-based or Ir-based electrocatalysts. Moreover, the RuRh@(RuRh)O2 core/shell nanosheets exhibit good durability because the (RuRh)O2 oxide shell protects the normally labile RuRh NS core against dissolution during the OER process.


2020 ◽  
Vol 21 (S8) ◽  
Author(s):  
Nicola Prezza ◽  
Nadia Pisanti ◽  
Marinella Sciortino ◽  
Giovanna Rosone

Abstract Background In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the detection of SNPs was suggested and tested. The framework, based on the Burrows-Wheeler Transform (BWT), significantly improves sensitivity and precision of previous de Bruijn graphs based tools by overcoming several of their limitations, namely: (i) the need to establish a fixed value, usually small, for the order k, (ii) the loss of important information such as k-mer coverage and adjacency of k-mers within the same read, and (iii) bad performance in repeated regions longer than k bases. The preliminary tool, however, was able to identify only SNPs and it was too slow and memory consuming due to the use of additional heavy data structures (namely, the Suffix and LCP arrays), besides the BWT. Results In this paper, we introduce a new algorithm and the corresponding tool ebwt2InDel that (i) extend the framework of [Prezza et al., AMB 2019] to detect also INDELs, and (ii) implements recent algorithmic findings that allow to perform the whole analysis using just the BWT, thus reducing the working space by one order of magnitude and allowing the analysis of full genomes. Finally, we describe a simple strategy for effectively parallelizing our tool for SNP detection only. On a 24-cores machine, the parallel version of our tool is one order of magnitude faster than the sequential one. The tool ebwt2InDel is available at github.com/nicolaprezza/ebwt2InDel. Conclusions Results on a synthetic dataset covered at 30x (Human chromosome 1) show that our tool is indeed able to find up to 83% of the SNPs and 72% of the existing INDELs. These percentages considerably improve the 71% of SNPs and 51% of INDELs found by the state-of-the art tool based on de Bruijn graphs. We furthermore report results on larger (real) Human whole-genome sequencing experiments. Also in these cases, our tool exhibits a much higher sensitivity than the state-of-the art tool.


Author(s):  
P. Branco ◽  
L. Fiolhais ◽  
M. Goulão ◽  
P. Martins ◽  
P. Mateus ◽  
...  

Oblivious Transfer (OT) is a fundamental primitive in cryptography, supporting protocols such as Multi-Party Computation and Private Set Intersection (PSI), that are used in applications like contact discovery, remote diagnosis and contact tracing. Due to its fundamental nature, it is utterly important that its execution is secure even if arbitrarily composed with other instances of the same, or other protocols. This property can be guaranteed by proving its security under the Universal Composability model. Herein, a 3-round Random Oblivious Transfer (ROT) protocol is proposed, which achieves high computational efficiency, in the Random Oracle Model. The security of the protocol is based on the Ring Learning With Errors assumption (for which no quantum solver is known). ROT is the basis for OT extensions and, thus, achieves wide applicability, without the overhead of compiling ROTs from OTs. Finally, the protocol is implemented in a server-class Intel processor and four application-class ARM processors, all with different architectures. The usage of vector instructions provides on average a 40% speedup. The implementation shows that our proposal is at least one order of magnitude faster than the state-of-the-art, and is suitable for a wide range of applications in embedded systems, IoT, desktop, and servers. From a memory footprint perspective, there is a small increase (16%) when compared to the state-of-the-art. This increase is marginal and should not prevent the usage of the proposed protocol in a multitude of devices. In sum, the proposal achieves up to 37k ROTs/s in an Intel server-class processor and up to 5k ROTs/s in an ARM application-class processor. A PSI application, using the proposed ROT, is up to 6.6 times faster than related art.


Plant Methods ◽  
2019 ◽  
Vol 15 (1) ◽  
Author(s):  
Haipeng Xiong ◽  
Zhiguo Cao ◽  
Hao Lu ◽  
Simon Madec ◽  
Liang Liu ◽  
...  

Abstract Background Grain yield of wheat is greatly associated with the population of wheat spikes, i.e., $$spike~number~\text {m}^{-2}$$spikenumberm-2. To obtain this index in a reliable and efficient way, it is necessary to count wheat spikes accurately and automatically. Currently computer vision technologies have shown great potential to automate this task effectively in a low-end manner. In particular, counting wheat spikes is a typical visual counting problem, which is substantially studied under the name of object counting in Computer Vision. TasselNet, which represents one of the state-of-the-art counting approaches, is a convolutional neural network-based local regression model, and currently benchmarks the best record on counting maize tassels. However, when applying TasselNet to wheat spikes, it cannot predict accurate counts when spikes partially present. Results In this paper, we make an important observation that the counting performance of local regression networks can be significantly improved via adding visual context to the local patches. Meanwhile, such context can be treated as part of the receptive field without increasing the model capacity. We thus propose a simple yet effective contextual extension of TasselNet—TasselNetv2. If implementing TasselNetv2 in a fully convolutional form, both training and inference can be greatly sped up by reducing redundant computations. In particular, we collected and labeled a large-scale wheat spikes counting (WSC) dataset, with 1764 high-resolution images and 675,322 manually-annotated instances. Extensive experiments show that, TasselNetv2 not only achieves state-of-the-art performance on the WSC dataset ($$91.01\%$$91.01% counting accuracy) but also is more than an order of magnitude faster than TasselNet (13.82 fps on $$912\times 1216$$912×1216 images). The generality of TasselNetv2 is further demonstrated by advancing the state of the art on both the Maize Tassels Counting and ShanghaiTech Crowd Counting datasets. Conclusions This paper describes TasselNetv2 for counting wheat spikes, which simultaneously addresses two important use cases in plant counting: improving the counting accuracy without increasing model capacity, and improving efficiency without sacrificing accuracy. It is promising to be deployed in a real-time system with high-throughput demand. In particular, TasselNetv2 can achieve sufficiently accurate results when training from scratch with small networks, and adopting larger pre-trained networks can further boost accuracy. In practice, one can trade off the performance and efficiency according to certain application scenarios. Code and models are made available at: https://tinyurl.com/TasselNetv2.


2017 ◽  
Vol 5 (17) ◽  
pp. 7753-7758 ◽  
Author(s):  
Kaiyue Zhu ◽  
Huanying Liu ◽  
Mingrun Li ◽  
Xuning Li ◽  
Junhu Wang ◽  
...  

Fe3+-doped β-Ni(OH)2, prepared via an atomic-scale topochemical transformation route, exhibits much higher oxygen evolution activity than the state-of-the-art IrO2.


2020 ◽  
Vol 501 (2) ◽  
pp. 1999-2016
Author(s):  
Aarynn L Carter ◽  
Sasha Hinkley ◽  
Mariangela Bonavita ◽  
Mark W Phillips ◽  
Julien H Girard ◽  
...  

ABSTRACT The James Webb Space Telescope (JWST), currently scheduled to launch in 2021, will dramatically advance our understanding of exoplanetary systems with its ability to directly image and characterize planetary-mass companions at wide separations through coronagraphy. Using state-of-the-art simulations of JWST performance, in combination with the latest evolutionary models, we present the most sophisticated simulated mass sensitivity limits of JWST coronagraphy to date. In particular, we focus our efforts towards observations of members within the nearby young moving groups β Pictoris and TW Hya. These limits indicate that whilst JWST will provide little improvement towards imaging exoplanets at short separations, at wide separations the increase in sensitivity is dramatic. We predict JWST will be capable of imaging sub-Jupiter mass objects beyond ∼30 au, sub-Saturn mass objects beyond ∼50 au, and that beyond ∼100 au, JWST will be capable of directly imaging companions as small as 0.1 MJ − at least an order of magnitude improvement over the leading ground-based instruments. Probing this unexplored parameter space will be of immediate value to modelling efforts focused on planetary formation and population synthesis. JWST will also serve as an excellent complement to ground-based observatories through its unique ability to characterize previously detected companions across the near- to mid-infrared for the first time.


2021 ◽  
Author(s):  
Mehmet Aziz Yirik ◽  
Maria Sorokina ◽  
Christoph Steinbeck

<p>The generation of constitutional isomer chemical spaces has been a subject of cheminformatics since the early 1960s, with applications in structure elucidation and elsewhere. In order to perform such a generation efficiently, exhaustively and isomorphism-free, the structure generator needs to ensure the building of canonical graphs already during the generation step and not by subsequent filtering.</p><p>Here we present MAYGEN, an open-source, pure-Java development of a constitutional isomer molecular generator. The principles of MAYGEN’s architecture and algorithm are outlined and the software is benchmarked against the state-of-the-art, but closed-source solution MOLGEN, as well as against the best open-source solution OMG. MAYGEN outperforms OMG by an order of magnitude and gets close to and occasionally outperforms MOLGEN in performance.</p>


Author(s):  
Meurig T. Gallagher ◽  
David J. Smith

Stokes flow, discussed by G.G. Stokes in 1851, describes many microscopic biological flow phenomena, including cilia-driven transport and flagellar motility; the need to quantify and understand these flows has motivated decades of mathematical and computational research. Regularized stokeslet methods, which have been used and refined over the past 20 years, offer significant advantages in simplicity of implementation, with a recent modification based on nearest-neighbour interpolation providing significant improvements in efficiency and accuracy. Moreover this method can be implemented with the majority of the computation taking place through built-in linear algebra, entailing that state-of-the-art hardware and software developments in the latter, in particular multicore and GPU computing, can be exploited through minimal modifications (‘passive parallelism’) to existing Matlab computer code. Hence, and with widely available GPU hardware, significant improvements in the efficiency of the regularized stokeslet method can be obtained. The approach is demonstrated through computational experiments on three model biological flows: undulatory propulsion of multiple Caenorhabditis elegans , simulation of progression and transport by multiple sperm in a geometrically confined region, and left–right symmetry breaking particle transport in the ventral node of the mouse embryo. In general an order-of-magnitude improvement in efficiency is observed. This development further widens the complexity of biological flow systems that are accessible without the need for extensive code development or specialist facilities. This article is part of the theme issue ‘Stokes at 200 (part 2)’.


2021 ◽  
Author(s):  
Mehmet Aziz Yirik ◽  
Maria Sorokina ◽  
Christoph Steinbeck

<p>The generation of constitutional isomer chemical spaces has been a subject of cheminformatics since the early 1960s, with applications in structure elucidation and elsewhere. In order to perform such a generation efficiently, exhaustively and isomorphism-free, the structure generator needs to ensure the building of canonical graphs already during the generation step and not by subsequent filtering.</p><p>Here we present MAYGEN, an open-source, pure-Java development of a constitutional isomer molecular generator. The principles of MAYGEN’s architecture and algorithm are outlined and the software is benchmarked against the state-of-the-art, but closed-source solution MOLGEN, as well as against the best open-source solution OMG. MAYGEN outperforms OMG by an order of magnitude and gets close to and occasionally outperforms MOLGEN in performance.</p>


Sign in / Sign up

Export Citation Format

Share Document