Geometry and Topology Change in Complex Systems

Author(s):  
Vladimir G. Ivancevic ◽  
Tijana T. Ivancevic
Author(s):  
S. A. Dobershtein ◽  
N. M. Zhilin ◽  
I. V. Veremeev

This paper presents the research of methods for decrease of the capacitance ratio in the STW-resonators without significant degradation of the quality factor by use of the external inductors and topology change: IDT division on parts and their series connection. The calculated and experimental data are presented for 416 MHz and 766 MHz STW-resonators with quality factors Q = 7000–7978. The capacitance ratio has been reduced from 1200 to 301.


2017 ◽  
Vol 32 (31) ◽  
pp. 1750180
Author(s):  
Badis Ydri ◽  
Cherine Soudani ◽  
Ahlam Rouag

We present a new model of quantum gravity as a theory of random geometries given explicitly in terms of a multitrace matrix model. This is a generalization of the usual discretized random surfaces of two-dimensional quantum gravity which works away from two dimensions and captures a large class of spaces admitting a finite spectral triple. These multitrace matrix models sustain emergent geometry as well as growing dimensions and topology change.


Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 958 ◽  
Author(s):  
Zijun Hang ◽  
Mei Wen ◽  
Yang Shi ◽  
Chunyuan Zhang

Network algorithms are building blocks of network applications. They are inspired by emerging commodity programmable switches and the Programming Protocol-Independent Packet Processors (P4) language. P4 aims to provide target-independent programming neglecting the architecture of underlying infrastructure. However, commodity programmable switches have tight programming restrictions due to limited resources and latency. In addition, manufacturers tailor P4 according to their architecture, putting more restrictions on it. These intrinsic and extrinsic restrictions dilute the goal of P4. This paper proposes P4 high-level programming (P4HLP) framework, a suite of toolchains that simplifies P4 programming. The paper highlights three aspects: (i) E-Domino, a high-level programming language that defines both stateless and stateful processing of data plane in C-style codes; (ii) P4HLPc, a compiler that automatically generates P4 programs from E-Domino programs, which removes the barrier between high-level programming and low-level P4 primitives; (iii) modular programming that organizes programs into reusable modules, to enable fast reconfiguration of commodity switches. Results show that P4HLPc is efficient and robust, thus is suitable for data plane high-level programming. Compared with P4, E-Domino saves at least 5.5× codes to express the data plane algorithm. P4HLPc is robust to policy change and topology change. The generated P4 programs achieve line-rate processing.


2011 ◽  
Vol 08 (06) ◽  
pp. 1225-1238 ◽  
Author(s):  
IZUMI TANAKA ◽  
SEIJI NAGAMI

The purpose of this study is to examine the effect of topology change in the initial universe. In this study, the concept of G-cobordism is introduced to argue about the topology change of the manifold on which a transformation group acts. This G-manifold has a fiber bundle structure if the group action is free and is related to the spacetime in Kaluza–Klein theory or Einstein–Yang–Mills system. Our results revealed the fundamental processes of compactification in G-manifolds. In these processes, the initial high symmetry and multidimensional universe changes to present universe by the mechanism which lowers the dimensions and symmetries.


Author(s):  
Masatoshi Funabashi

Recently emerging data-driven citizen sciences need to harness increasing amount of massive data with varying quality. This paper develops essential theoretical frameworks and example models and examine its computational complexity for interactive data-driven citizen science within the context of guided self-organization. We first define a conceptual model that incorporates quality of observation in terms of accuracy and reproducibility, ranging between subjectivity, inter-subjectivity, and objectivity. Next, we examine the database's algebraic and topological structure in relation to informational complexity measures, and evaluate its computational complexities with respect to exhaustive optimization. Conjectures of criticality are obtained on self-organizing processes of observation and dynamical model development. Example analysis is demonstrated with the use of biodiversity assessment database, the process that inevitably involves human subjectivity for the management in open complex systems.


2020 ◽  
Vol 65 (5) ◽  
pp. 1343-1363 ◽  
Author(s):  
Takuya Terahara ◽  
Kenji Takizawa ◽  
Tayfun E. Tezduyar ◽  
Atsushi Tsushima ◽  
Kensuke Shiozaki

1993 ◽  
Vol 10 (8) ◽  
pp. L89-L91 ◽  
Author(s):  
G W Gibbons
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document