[ΒΙΒΛΙΟ][B] Discrete calculus: Applied analysis on graphs for computational science
LJ Grady, JR Polimeni - 2010 - Springer
The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …
proper set of definitions and differential operators that make it possible to operate the …
[HTML][HTML] A new approach to the analytical and numerical form-finding of tensegrity structures
We develop a new formulation for the form-finding of tensegrity structures in which the
primary variables are the Cartesian components of element lengths. Both an analytical and …
primary variables are the Cartesian components of element lengths. Both an analytical and …
GCP-HOLO: Generating High-Order Linkage Graphs for Path Synthesis
Abstract One degrees-of-freedom (1DOF) linkages are persistent in mechanical systems.
However, designing linkages to follow a desired path, known as path synthesis, is …
However, designing linkages to follow a desired path, known as path synthesis, is …
Network, anatomical, and non-imaging measures for the prediction of ADHD diagnosis in individual subjects
Brain imaging methods have long held promise as diagnostic aids for neuropsychiatric
conditions with complex behavioral phenotypes such as Attention-Deficit/Hyperactivity …
conditions with complex behavioral phenotypes such as Attention-Deficit/Hyperactivity …
Sparse pose graph optimization in cycle space
The state-of-the-art modern pose-graph optimization (PGO) systems are vertex based. In this
context, the number of variables might be high, albeit the number of cycles in the graph (loop …
context, the number of variables might be high, albeit the number of cycles in the graph (loop …
On the network topology of cross-linked acrylate photopolymers: a molecular dynamics case study
A reactive molecular dynamics approach is used to simulate cross-linking of acrylate
polymer networks. By employing the same force field and reactive scheme and studying …
polymer networks. By employing the same force field and reactive scheme and studying …
Emergence of complex network topologies from flow-weighted optimization of network efficiency
Transportation and distribution networks are a class of spatial networks that have been of
interest in recent years. These networks are often characterized by the presence of complex …
interest in recent years. These networks are often characterized by the presence of complex …
Minimum cycle and homology bases of surface embedded graphs
We study the problems of finding a minimum cycle basis (a minimum weight set of cycles
that form a basis for the cycle space) and a minimum homology basis (a minimum weight set …
that form a basis for the cycle space) and a minimum homology basis (a minimum weight set …
Differentiable automatic structural optimization using graph deep learning
The current limitations of non-differentiable evaluation models and computationally
expensive heuristic algorithms hinder the optimization of real-world structures. This research …
expensive heuristic algorithms hinder the optimization of real-world structures. This research …
[HTML][HTML] Cycle analysis of directed acyclic graphs
In this paper, we employ the decomposition of a directed network as an undirected graph
plus its associated node meta-data to characterise the cyclic structure found in directed …
plus its associated node meta-data to characterise the cyclic structure found in directed …