omom Photochemical [2 + 2 + 1] annulation of 2-vinyloxy arylalkynes with bromomalonates via energy transfer By pubs.rsc.org Published On :: Org. Chem. Front., 2024, Advance ArticleDOI: 10.1039/D4QO00249K, Research ArticleShuo Tang, Jiupeng Liu, Min Zhang, Dan Wang, Yong Wang, Jingjing Zhao, Pan LiA transition-metal-free, oxidant-free and base-free photochemical [2 + 2 + 1] radical annulation of 2-vinyloxy arylalkynes with bromomalonates has been developed.To cite this article before page numbers are assigned, use the DOI form of citation above.The content of this RSS Feed (c) The Royal Society of Chemistry Full Article
omom TOMOMAN: a software package for large-scale cryo-electron tomography data preprocessing, community data sharing and collaborative computing By journals.iucr.org Published On :: Here we describe TOMOMAN (TOMOgram MANager), an extensible open-sourced software package for handling cryo-electron tomography data preprocessing. TOMOMAN streamlines interoperability between a wide range of external packages and provides tools for project sharing and archival. Full Article text
omom Computing-in-Memory for Performance and Energy Efficient Homomorphic Encryption. (arXiv:2005.03002v1 [cs.CR]) By arxiv.org Published On :: Homomorphic encryption (HE) allows direct computations on encrypted data. Despite numerous research efforts, the practicality of HE schemes remains to be demonstrated. In this regard, the enormous size of ciphertexts involved in HE computations degrades computational efficiency. Near-memory Processing (NMP) and Computing-in-memory (CiM) - paradigms where computation is done within the memory boundaries - represent architectural solutions for reducing latency and energy associated with data transfers in data-intensive applications such as HE. This paper introduces CiM-HE, a Computing-in-memory (CiM) architecture that can support operations for the B/FV scheme, a somewhat homomorphic encryption scheme for general computation. CiM-HE hardware consists of customized peripherals such as sense amplifiers, adders, bit-shifters, and sequencing circuits. The peripherals are based on CMOS technology, and could support computations with memory cells of different technologies. Circuit-level simulations are used to evaluate our CiM-HE framework assuming a 6T-SRAM memory. We compare our CiM-HE implementation against (i) two optimized CPU HE implementations, and (ii) an FPGA-based HE accelerator implementation. When compared to a CPU solution, CiM-HE obtains speedups between 4.6x and 9.1x, and energy savings between 266.4x and 532.8x for homomorphic multiplications (the most expensive HE operation). Also, a set of four end-to-end tasks, i.e., mean, variance, linear regression, and inference are up to 1.1x, 7.7x, 7.1x, and 7.5x faster (and 301.1x, 404.6x, 532.3x, and 532.8x more energy efficient). Compared to CPU-based HE in a previous work, CiM-HE obtain 14.3x speed-up and >2600x energy savings. Finally, our design offers 2.2x speed-up with 88.1x energy savings compared to a state-of-the-art FPGA-based accelerator. Full Article
omom Dodgers snapshot: Nomomania grips L.A. and Japan when Hideo Nomo dominates in 1995 By www.latimes.com Published On :: Sat, 28 Mar 2020 15:56:17 -0400 The Dodgers' Hideo Nomo, with a quirky windup and devastating forkball, pioneered Japanese players coming to the U.S. by quickly becoming an All-Star. Full Article
omom Estimation of the rate of convergence in the central limit theorem for a sequence of series in terms of averaged pseudomoments By www.ams.org Published On :: Mon, 02 Mar 2020 06:58 EST M. M. Kapustei and P. V. Slyusarchuk Theor. Probability and Math. Statist. 99 (2020), 101-111. Abstract, references and article information Full Article
omom Sampling random graph homomorphisms and applications to network data analysis. (arXiv:1910.09483v2 [math.PR] UPDATED) By arxiv.org Published On :: A graph homomorphism is a map between two graphs that preserves adjacency relations. We consider the problem of sampling a random graph homomorphism from a graph $F$ into a large network $mathcal{G}$. We propose two complementary MCMC algorithms for sampling a random graph homomorphisms and establish bounds on their mixing times and concentration of their time averages. Based on our sampling algorithms, we propose a novel framework for network data analysis that circumvents some of the drawbacks in methods based on independent and neigborhood sampling. Various time averages of the MCMC trajectory give us various computable observables, including well-known ones such as homomorphism density and average clustering coefficient and their generalizations. Furthermore, we show that these network observables are stable with respect to a suitably renormalized cut distance between networks. We provide various examples and simulations demonstrating our framework through synthetic networks. We also apply our framework for network clustering and classification problems using the Facebook100 dataset and Word Adjacency Networks of a set of classic novels. Full Article
omom [ASAP] Assembling Homometallic Sb<sub>6</sub> and Heterometallic Ti<sub>4</sub>Sb<sub>2</sub> Oxo Clusters By feedproxy.google.com Published On :: Tue, 28 Apr 2020 04:00:00 GMT Inorganic ChemistryDOI: 10.1021/acs.inorgchem.9b03238 Full Article
omom Visible-light-induced photocatalyst-free C-3 functionalization of indoles with diethyl bromomalonate By feeds.rsc.org Published On :: Green Chem., 2020, 22,2543-2548DOI: 10.1039/D0GC00292E, PaperGuangmiao Gu, Mengmeng Huang, Jung Keun Kim, Jianye Zhang, Yabo Li, Yangjie WuA visible-light-induced and XB-promoted green approach to construct α-indolyl diethyl malonates was developed.The content of this RSS Feed (c) The Royal Society of Chemistry Full Article