Short RNA Universal Coding for Topological Transformation Nano‐barcoding Application

ChemBioChem ◽  
2020 ◽  
Author(s):  
Jeonghun Kim ◽  
Je Hun Moon ◽  
Soong Ho Um
Keyword(s):  
Topological Transformation ◽  
Universal Coding

scholarly journals Short RNA Universal Coding for Topological Transformation Nano‐barcoding Application

ChemBioChem ◽  
2021 ◽  
Author(s):  
Jeonghun Kim ◽  
Je Hun Moon ◽  
Soong Ho Um
Keyword(s):  
Topological Transformation ◽  
Universal Coding

Topological Transformation of Mg‐containing Layered Double Hydroxide Nanosheets for Efficient Photo‐driven CH4 Coupling

2021 ◽  
Author(s):  
Yu-Fei Song ◽  
Yanqi Xu ◽  
Xiaoliang Sun ◽  
Xian Wang ◽  
Lunhua He ◽  
...  
Keyword(s):  
Layered Double Hydroxide ◽  
Topological Transformation ◽  
Double Hydroxide

Computational Capacity of Complex Memcapacitive Networks

2021 ◽  
Vol 17 (2) ◽  
pp. 1-25
Author(s):  
Dat Tran ◽  
Christof Teuscher
Keyword(s):  
Power Consumption ◽  
Small World ◽  
Fading Memory ◽  
Reservoir Computing ◽  
Topological Transformation ◽  
Trade Off ◽  
Topological Structures ◽  
Computational Capacity ◽  
Computational Capability ◽  
Comparable Performance

Emerging memcapacitive nanoscale devices have the potential to perform computations in new ways. In this article, we systematically study, to the best of our knowledge for the first time, the computational capacity of complex memcapacitive networks, which function as reservoirs in reservoir computing, one of the brain-inspired computing architectures. Memcapacitive networks are composed of memcapacitive devices randomly connected through nanowires. Previous studies have shown that both regular and random reservoirs provide sufficient dynamics to perform simple tasks. How do complex memcapacitive networks illustrate their computational capability, and what are the topological structures of memcapacitive networks that solve complex tasks with efficiency? Studies show that small-world power-law (SWPL) networks offer an ideal trade-off between the communication properties and the wiring cost of networks. In this study, we illustrate the computing nature of SWPL memcapacitive reservoirs by exploring the two essential properties: fading memory and linear separation through measurements of kernel quality. Compared to ideal reservoirs, nanowire memcapacitive reservoirs had a better dynamic response and improved their performance by 4.67% on three tasks: MNIST, Isolated Spoken Digits, and CIFAR-10. On the same three tasks, compared to memristive reservoirs, nanowire memcapacitive reservoirs achieved comparable performance with much less power, on average, about 99× , 17×, and 277×, respectively. Simulation results of the topological transformation of memcapacitive networks reveal that that topological structures of the memcapacitive SWPL reservoirs did not affect their performance but significantly contributed to the wiring cost and the power consumption of the systems. The minimum trade-off between the wiring cost and the power consumption occurred at different network settings of α and β : 4.5 and 0.61 for Biolek reservoirs, 2.7 and 1.0 for Mohamed reservoirs, and 3.0 and 1.0 for Najem reservoirs. The results of our research illustrate the computational capacity of complex memcapacitive networks as reservoirs in reservoir computing. Such memcapacitive networks with an SWPL topology are energy-efficient systems that are suitable for low-power applications such as mobile devices and the Internet of Things.

Stimuli‐Responsive Topological Transformation of a Molecular Borromean Ring via Controlled Oxidation of Thioether Moieties

2021 ◽  
Author(s):  
Guo-Xin Jin ◽  
Hai-Ning Zhang ◽  
Wei-Bin Yu ◽  
Yue-Jian Lin
Keyword(s):  
Stimuli Responsive ◽  
Topological Transformation ◽  
Borromean Ring

Optimal Universal Coding with Respect to the Maximal Individual Relative Redundancy Criterion

2004 ◽  
Vol 40 (1) ◽  
pp. 90-101
Author(s):  
Yu. M. Shtarkov ◽  
Tj. J. Tjalkens ◽  
F. M. J. Willems
Keyword(s):  
Universal Coding

Topological transformation strategy for layered double hydroxide@carbon nanofibers as highly efficient electromagnetic wave absorber

2021 ◽  
Vol 867 ◽  
pp. 159046
Author(s):  
Tiantian Yu ◽  
Junfeng Qiu ◽  
Jun Liao ◽  
Xiangyu Wang ◽  
Wei Chen ◽  
...  
Keyword(s):  
Electromagnetic Wave ◽  
Carbon Nanofibers ◽  
Layered Double Hydroxide ◽  
Topological Transformation ◽  
Highly Efficient ◽  
Double Hydroxide ◽  
Transformation Strategy

Study of binary image compression using universal coding

1991 ◽  
Author(s):  
Yasuhiko Nakano ◽  
Hirotaka Chiba ◽  
Yoshiyuki Okada ◽  
Shigeru Yoshida ◽  
Masahiro Mori
Keyword(s):  
Image Compression ◽  
Binary Image ◽  
Universal Coding

Mathematical Analysis on Helicoids Architectural Form

2013 ◽  
Vol 790 ◽  
pp. 273-277
Author(s):  
Zhong Yi ◽  
Cheng Zhi Yuan
Keyword(s):  
Mathematical Analysis ◽  
Mathematical Theory ◽  
Architecture Design ◽  
Curved Surfaces ◽  
Mathematical Transformation ◽  
Geometric Figure ◽  
Topological Transformation ◽  
Architectural Form ◽  
Geometric Figures ◽  
Architecture Modeling

In a sense, architecture may be called as a geometric figure. Although architectural forms are very different, the form from one kind of architecture to another kind of architecture is equivalent to one kind of mathematical transformation in view of mathematics; for example, the transformation between a cube architecture and a spherical architecture belongs to a topological transformation. Currently, many sculptural features appear in the architecture design, which may be called as the nonlinear architecture. Curves and curved surfaces are widely used in the architecture modeling. Moreover, functional spaces are divided inside the architecture shell according to requirements. Architects are inclined to use a mathematical theory especially the geometrical knowledge in an architecture design. However, architects can not imagine many artistic geometric figures in geometry. Besides, such wonderful geometric figures always include some miraculous mathematical and physical properties.

A sequential algorithm for the universal coding of finite memory sources

1992 ◽  
Vol 38 (3) ◽  
pp. 1002-1014 ◽  
Author(s):  
M.J. Weinberger ◽  
A. Lempe ◽  
J. Ziv
Keyword(s):  
Sequential Algorithm ◽  
Universal Coding ◽  
Finite Memory
Sign in / Sign up

Export Citation Format

Share Document