scholarly journals Coordinate–independent mapping of structural and functional data by objective relational transformation (ORT)

2000 ◽  
Vol 355 (1393) ◽  
pp. 37-54 ◽  
Author(s):  
Klaas E. Stephan ◽  
Karl Zilles ◽  
Rolf Kötter
Keyword(s):  
Functional Data ◽  
Database Systems ◽  
Transformation Method ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Cortical Organization ◽  
Cortical Areas ◽  
Enormous Amount ◽  
Methodological Problems ◽  
Brain Data

Neuroscience has produced an enormous amount of structural and functional data. Powerful database systems are required to make these data accessible for computational approaches such as higher–order analyses and simulations. Available databases for key data such as anatomical and functional connectivity between cortical areas, however, are still hampered by methodological problems. These problems arise predominantly from the parcellation problem, the use of incongruent parcellation schemes by different authors.We here present a coordinate–independent mathematical method to overcome this problem: objective relational transformation (ORT). Based on new classifications for brain data and on methods from theoretical computer science, ORT represents a formally defined, transparent transformation method for reproducible, coordinate–independent mapping of brain data to freely chosen parcellation schemes. We describe the methodology of ORTand discuss its strengths and limitations. Using two practical examples, we show that ORT in conjunction with connectivity databases like CoCoMac (http://www.cocomac.org) is an important tool for analyses of cortical organization and structure–function relationships.

scholarly journals From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1036
Author(s):  
Abel Cabrera Martínez ◽  
Alejandro Estrada-Moreno ◽  
Juan Alberto Rodríguez-Velázquez
Keyword(s):  
Vertex Cover ◽  
Domination Number ◽  
Theoretical Computer Science ◽  
Discrete Mathematics ◽  
Special Issue ◽  
Total Domination Number ◽  
Theoretical Computer ◽  
Graph Parameters ◽  
Semitotal Domination ◽  
Domination In Graphs

This paper is devoted to the study of the quasi-total strong differential of a graph, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. Given a vertex x∈V(G) of a graph G, the neighbourhood of x is denoted by N(x). The neighbourhood of a set X⊆V(G) is defined to be N(X)=⋃x∈XN(x), while the external neighbourhood of X is defined to be Ne(X)=N(X)∖X. Now, for every set X⊆V(G) and every vertex x∈X, the external private neighbourhood of x with respect to X is defined as the set Pe(x,X)={y∈V(G)∖X:N(y)∩X={x}}. Let Xw={x∈X:Pe(x,X)≠⌀}. The strong differential of X is defined to be ∂s(X)=|Ne(X)|−|Xw|, while the quasi-total strong differential of G is defined to be ∂s*(G)=max{∂s(X):X⊆V(G)andXw⊆N(X)}. We show that the quasi-total strong differential is closely related to several graph parameters, including the domination number, the total domination number, the 2-domination number, the vertex cover number, the semitotal domination number, the strong differential, and the quasi-total Italian domination number. As a consequence of the study, we show that the problem of finding the quasi-total strong differential of a graph is NP-hard.

scholarly journals Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials

2021 ◽  
Author(s):  
Mareike Dressler ◽  
Adam Kurpisz ◽  
Timo de Wolff
Keyword(s):  
Computer Science ◽  
Affine Transformation ◽  
Optimization Problems ◽  
Polynomial Optimization ◽  
Theoretical Computer Science ◽  
Sums Of Squares ◽  
Theoretical Computer ◽  
Complexity Bounds ◽  
Polynomial Optimization Problems ◽  
Transformation Of Variables

AbstractVarious key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS-based certificates remain valid: First, for polynomials, which are nonnegative over the n-variate boolean hypercube with constraints of degree d there exists a SONC certificate of degree at most $$n+d$$ n + d . Second, if there exists a degree d SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree d SONC certificate that includes at most $$n^{O(d)}$$ n O ( d ) nonnegative circuit polynomials. Moreover, we prove that, in opposite to SOS, the SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar’s Positivstellensatz for SOS. We discuss these results from both the algebraic and the optimization perspective.

scholarly journals A nonlocal game for witnessing quantum networks

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Ming-Xing Luo
Keyword(s):  
Computational Complexity ◽  
Main Idea ◽  
Bell Inequalities ◽  
Theoretical Computer Science ◽  
Graph Representation ◽  
Necessary Condition ◽  
Quantum Networks ◽  
Theoretical Computer ◽  
Sufficient And Necessary Condition ◽  
Unified Method

Abstract Nonlocal game as a witness of the nonlocality of entanglement is of fundamental importance in various fields. The well-known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks consisting of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We propose an efficient method to construct multipartite nonlocal games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providing a simple sufficient and necessary condition. The graphic games imply a linear Bell testing of the nonlocality of general quantum networks consisting of EPR states. It also allows generating new instances going beyond CHSH game. These results have interesting applications in quantum networks, Bell theory, computational complexity, and theoretical computer science.

Sign in / Sign up

Export Citation Format

Share Document