Results 11 to 20 of about 92,985 (260)
COMPARING COMPUTABILITY IN TWO TOPOLOGIES
AbstractComputable analysis provides ways of representing points in a topological space, and therefore of defining a notion of computable points of the space. In this article, we investigate when two topologies on the same space induce different sets of computable points.
Amir, Djamel Eddine, Hoyrup, Mathieu
openaire +2 more sources
DEGENERATE DISTRIBUTED CONTROL SYSTEMS WITH FRACTIONAL TIME DERIVATIVE
The existence of a unique strong solution for the Cauchy problem to semilinear nondegenerate fractional differential equation and for the generalized Showalter–Sidorov problem to semilinear fractional differential equation with degenerate operator at the
Marina V. Plekhanova
doaj +1 more source
Leveraging the mathematics of shape for solar magnetic eruption prediction
Current operational forecasts of solar eruptions are made by human experts using a combination of qualitative shape-based classification systems and historical data about flaring frequencies. In the past decade, there has been a great deal of interest in
Deshmukh Varad +3 more
doaj +1 more source
Computational Acceleration of Topology Optimization Using Deep Learning
Topology optimization is a computationally expensive process, especially when complicated designs are studied, and this is mainly due to its finite element analysis and iterative solvers incorporated into the algorithm.
Jalal Rasulzade +4 more
doaj +1 more source
Topology-Hiding Computation [PDF]
Secure Multi-party Computation (MPC) is one of the foundational achievements of modern cryptography, allowing multiple, distrusting, parties to jointly compute a function of their inputs, while revealing nothing but the output of the function. Following the seminal works of Yao and Goldreich, Micali and Wigderson and Ben-Or, Goldwasser and Wigderson ...
Tal Moran, Ilan Orlov, Silas Richelson
openaire +2 more sources
Computational differential topology
Some of the more differential aspects of the nascent field of computational topology are introduced and treated in considerable depth. Relevant categories based upon stratified geometric objects are proposed, and fundamental problems are identified and ...
Denis Blackmore, Yuriy Mileyko
doaj +1 more source
Formation of features based on computational topology methods
The use of traditional methods of algebraic topology to obtain information about the shape of an object is associated with the problem of forming a small amount of information, namely, Betti numbers and Euler characteristics.
S.N. Chukanov
doaj +1 more source
The structure of scientific collaborations has been the object of intense study both for its importance for innovation and scientific advancement, and as a model system for social group coordination and formation thanks to the availability of authorship ...
Alice Patania +2 more
doaj +1 more source
An algorithm for calculating top-dimensional bounding chains [PDF]
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S(n−1)|) (where S(n−1)
J. Frederico Carvalho +3 more
doaj +2 more sources
Topological Computation without Braiding [PDF]
revtex4, 4 pages, 4 ...
Bombin, H., Martin-Delgado, M. A.
openaire +3 more sources

