scholarly journals Computation of cubical homology, cohomology, and (co)homological operations via chain contraction

2014 ◽  
Vol 41 (1) ◽  
pp. 253-275 ◽  
Author(s):  
Paweł Pilarczyk ◽  
Pedro Real
Polymers ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 370 ◽  
Author(s):  
Yuichi Masubuchi

Although the tube framework has achieved remarkable success to describe entangled polymer dynamics, the chain motion assumed in tube theories is still a matter of discussion. Recently, Xu et al. [ACS Macro Lett. 2018, 7, 190–195] performed a molecular dynamics simulation for entangled bead-spring chains under a step uniaxial deformation and reported that the relaxation of gyration radii cannot be reproduced by the elaborated single-chain tube model called GLaMM. On the basis of this result, they criticized the tube framework, in which it is assumed that the chain contraction occurs after the deformation before the orientational relaxation. In the present study, as a test of their argument, two different slip-link simulations developed by Doi and Takimoto and by Masubuchi et al. were performed and compared to the results of Xu et al. In spite of the modeling being based on the tube framework, the slip-link simulations excellently reproduced the bead-spring simulation result. Besides, the chain contraction was observed in the simulations as with the tube picture. The obtained results imply that the bead-spring results are within the scope of the tube framework whereas the failure of the GLaMM model is possibly due to the homogeneous assumption along the chain for the fluctuations induced by convective constraint release.


2007 ◽  
Vol 59 (5) ◽  
pp. 1008-1028
Author(s):  
Tomasz Kaczynski ◽  
Marian Mrozek ◽  
Anik Trahan

AbstractCubical sets and their homology have been used in dynamical systems as well as in digital imaging. We take a fresh look at this topic, following Zariski ideas from algebraic geometry. The cubical topology is defined to be a topology in ℝd in which a set is closed if and only if it is cubical. This concept is a convenient frame for describing a variety of important features of cubical sets. Separation axioms which, in general, are not satisfied here, characterize exactly those pairs of points which we want to distinguish. The noetherian property guarantees the correctness of the algorithms. Moreover, maps between cubical sets which are continuous and closed with respect to the cubical topology are precisely those for whom the homology map can be defined and computed without grid subdivisions. A combinatorial version of the Vietoris–Begle theorem is derived. This theorem plays the central role in an algorithm computing homology of maps which are continuous with respect to the Euclidean topology.


1995 ◽  
Vol 28 (14) ◽  
pp. 5154-5155 ◽  
Author(s):  
Yoshinobu Isono ◽  
Nobuyuki Ohashi ◽  
Toshio Kase

2006 ◽  
Vol 15 (8) ◽  
pp. 2462-2469 ◽  
Author(s):  
M. Niethammer ◽  
W.D. Kalies ◽  
K. Mischaikow ◽  
A. Tannenbaum

2021 ◽  
Author(s):  
◽  
Seungho Choe

Persistent homology is a powerful tool in topological data analysis (TDA) to compute, study and encode efficiently multi-scale topological features and is being increasingly used in digital image classification. The topological features represent number of connected components, cycles, and voids that describe the shape of data. Persistent homology extracts the birth and death of these topological features through a filtration process. The lifespan of these features can represented using persistent diagrams (topological signatures). Cubical homology is a more efficient method for extracting topological features from a 2D image and uses a collection of cubes to compute the homology, which fits the digital image structure of grids. In this research, we propose a cubical homology-based algorithm for extracting topological features from 2D images to generate their topological signatures. Additionally, we propose a score, which measures the significance of each of the sub-simplices in terms of persistence. Also, gray level co-occurrence matrix (GLCM) and contrast limited adapting histogram equalization (CLAHE) are used as a supplementary method for extracting features. Machine learning techniques are then employed to classify images using the topological signatures. Among the eight tested algorithms with six published image datasets with varying pixel sizes, classes, and distributions, our experiments demonstrate that cubical homology-based machine learning with deep residual network (ResNet 1D) and Light Gradient Boosting Machine (lightGBM) shows promise with the extracted topological features.


Sign in / Sign up

Export Citation Format

Share Document