Study stability of multiphase partitions with volume constraints.
problem Stability of multiphase partitions in convex domains.
method Detailed derivation of second variation formula and study of Jacobi operator eigenvalues.
result Derive stability criteria, including recapturing Sternberg-Zumbrun instability result.
Study proves existence of expanding solutions for multiphase surfaces with regular junctions.
problem Existence of self-similar expanding solutions for multiphase surfaces with regular junctions.
method Proves existence of solutions for a multiphase surface with regular junctions using mean curvature flow.
result Multiple self-similar expanding solutions exist for the initial condition of a multiphase surface with regular junctions.
Deep neural network predicts multiphase flow in heterogeneous domains.
problem Predicting multiphase flow in complex, heterogeneous systems.
method Deep neural network model for handling permeability heterogeneity and learning interplay of forces.
result Highly accurate predictions of CO2 saturation distribution with computational efficiency.
Paper shows how solutions to Allen-Cahn converge to multiphase mean curvature flow.
problem Convergence of Allen-Cahn solutions to multiphase mean curvature flow.
method Conditional convergence result of Allen-Cahn solutions to De Giorgi type BV-solutions of multiphase mean curvature flow.
result De Giorgi type BV-solutions are unique in a weak-strong sense.
Deep neural network models for efficient uncertainty quantification in multiphase flow.
problem Uncertainty quantification of dynamic multiphase flow in heterogeneous media due to high dimensionality and discontinuities.
method Convolutional encoder-decoder neural network for image-to-image regression, incorporating time as an input.
result Accurate surrogate model capable of characterizing spatio-temporal pressure and saturation fields with limited training data.
Unified framework for forward and inverse PDE problems in multiphase media.
problem Non-differentiable inverse problems in discrete-valued material fields.
method GenPANIS: Latent-variable generative framework preserving discrete microstructures.
result Unified bidirectional inference with minimal labeled pairs and physics-aware decoder.
We consider a Canham-Helfrich-type variational problem defined over closed surfaces enclosing a fixed volume and having fixed surface area. The problem models the shape of multiphase biomembranes. It consists of minimizing the sum of the Canham-Helfrich energy, in which the bending rigidities and spontaneous curvatures…
Framework automates microstructure image analysis for materials science.
problem Complex microstructures in materials require automated analysis.
method Combines unsupervised and supervised learning for classification and segmentation.
result Framework can automatically segment and classify micrographs.
Study finds minimizers for complex membrane models without symmetry assumptions.
problem Minimizing the Canham-Helfrich functional in multiple phases for heterogeneous biological membranes.
method Reformulated as oriented curvature varifolds, proving existence without symmetry assumptions.
result Existence of minimizers for single- and multiphase models under constraints.
Proves existence of multiple solutions to a multiphasic equation on manifolds.
problem Existence of multiple solutions to a multiphasic equation with a small volume constraint.
method Lusternik-Schnirelmann and infinite-dimensional Morse theories, combined with isoperimetric theory and transversality theorem.
result Lower bound for the number of solutions depending on topological invariants.
The paper explores the geometric properties of fluid flows and their symmetries.
problem Understanding the geometric properties of fluid flows and their symmetries.
method Analyzing the Euler equation and its relation to geodesic flows on groupoids of multiphase diffeomorphisms.
result Generalized flows, multiphase fluids, and vortex sheets are all geodesics on certain groupoids of multiphase diffeomorphisms.
Paper proposes hybrid machine learning for tuning first principles models in engineering systems.
problem Inaccurate first principles models in process engineering due to changing conditions.
method Hybrid machine learning framework using Bayesian Neural Networks.
result Uncertainty estimates improve operation decisions in multiphase flow modeling.
A new method predicts oil movement in reservoirs using deep learning.
problem Assessing dynamics of multiphase fluid flow in oil reservoirs.
method Metamodel based on Variational Autoencoder and Recurrent Neural Network.
result The Metamodel accurately predicts flow rates, pressure, and fluid saturations.
We present a general definition of the Poisson bracket between differential forms on the extended multiphase space appearing in the geometric formulation of first order classical field theories and, more generally, on exact multisymplectic manifolds. It is well defined for a certain class of differential forms that we …
Support Vector Machines predict gas-liquid flow patterns with 97% accuracy.
problem Predicting gas-liquid flow patterns in multiphase flow systems.
method Support Vector Machine (SVM) applied to a dataset of two-phase flow patterns.
result Achieved 97% correct classification of flow patterns.
The Backlund transformation for pseudospherical surfaces, which is equivalent to that of the sine-Gordon equation, can be restricted to give a transformation on space curves that preserves constant torsion. We study its effects on closed curves (in particular, elastic rods) that generate multiphase solutions for the vo…
SURGIN uses generative models to infer subsurface flow data efficiently.
problem Inefficient and task-specific inversion methods for subsurface multiphase flow.
method SURGIN integrates U-FNO surrogate with SGM for zero-shot conditional generation.
result Decent inference of heterogeneous geological fields and flow dynamics with uncertainty quantification.
Jointly estimates flow fields and particle properties from Lagrangian data.
problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.
Reduces observables on multisymplectic manifolds using Lie algebra actions.
problem Reduction of observables on multisymplectic manifolds with Lie algebra actions.
method Development of a reduction scheme for L∞-algebra of observables. result Reproduces symplectic observable reduction in specific cases.
This paper presents a generalization of symplectic geometry to a principal bundle over the configuration space of a classical field. This bundle, the vertically adapted linear frame bundle, is obtained by breaking the symmetry of the full linear frame bundle of the field configuration space, and it inherits a generaliz…
Novel unsupervised method for fast 3D image registration using cycle-consistent CNN.
problem Medical image registration for cancer diagnosis.
method Unsupervised deep learning using cycle-consistent CNN for deformable registration.
result Very precise 3D image registration within a few seconds, improving cancer size estimation.
Paper proves consistency of spectral hypergraph partitioning under a new model.
problem Consistency of spectral hypergraph partitioning under a new model.
method Spectral hypergraph partitioning algorithm using matrix concentration inequalities.
result First consistency result for partitioning non-uniform hypergraphs.
Paper compares graph and set partition measures for graph clustering.
problem Comparing graph clustering methods using different similarity measures.
method Introduces graph-aware partition similarity measures and compares them with set partition measures.
result Graph-aware measures provide complementary information to set partition measures.
The study limits how many parts regular simplicial partitions can overlap.
problem Bounding the intersection number of regular simplicial partitions.
method Analyzing the properties of regular simplicial partitions.
result Established a maximum limit for the intersection number.
Electrical engineer's AI journey due to deep learning convergence.
problem Separate development of AI and pattern recognition.
method Exploration of AI's historical trajectory and intersection with electrical engineering.
result Convergence of AI and electrical engineering due to deep learning.
New method improves nearest neighbor search using neural networks and graph partitioning.
problem Efficient nearest neighbor search in high-dimensional spaces.
method Developed a new framework for space partitioning using neural networks and graph partitioning.
result Neural LSH partitions outperform existing methods on standard benchmarks.
This paper presents generalized momentum mappings for covariant Hamiltonian field theories. The new momentum mappings arise from a generalization of symplectic geometry to LVY, the bundle of vertically adapted linear frames over the bundle of field configurations Y. Specifically, the generalized field momentum obs…
Framework learns physics-informed continuum models from molecular data.
problem Discovering accurate and robust data-driven continuum models from molecular simulation data.
method Operator regression framework using neural networks in modal space with physical inductive biases.
result Learned operators generalize to unseen system characteristics.
Better spectral partitioning of signed graphs using standard Laplacian.
problem Meaningless partitioning using signed Laplacian eigenvectors.
method Use standard graph Laplacian for spectral partitioning.
result Fiedler vector of standard Laplacian is easier to compute and more beneficial.
Rectangular Bounding Process (RBP) improves partitioning efficiency in multi-dimensional spaces.
problem Creating many unnecessary divisions in sparse regions when describing dense regions.
method Introduces Rectangular Bounding Process (RBP) to efficiently partition multi-dimensional spaces using a bounding strategy.
result The RBP is self-consistent and can be extended to infinite space, offering rich yet parsimonious expressiveness.
GAP uses deep learning to efficiently partition graphs.
problem Graph partitioning to minimize edge cut.
method Deep learning approach with a differentiable loss function.
result GAP achieves competitive partitions and generalizes to unseen graphs.
The study examines the balancedness of random partition models and finds the rich-get-richer characteristic is a result of model assumptions.
problem The balancedness of random partition models is largely neglected in the literature.
method Formulated a framework to define and study the balancedness of exchangeable random partition models, analyzed using product-form exchangeability and projectivity assumptions.
result The 'rich-get-richer' characteristic is an inevitable consequence of the model assumptions.
The paper develops mixed-integer formulations for neural networks using partitioning.
problem Optimizing trained ReLU neural networks with balanced model size and tightness.
method Partitioning node inputs into groups, forming the convex hull via disjunctive programming.
result The proposed formulations outperform existing ones, especially with fewer partitions.
Modeling 3D continua with singular points using Yin sets.
problem Treat singular points as central subjects in 3D continuum topology.
method Model 3D continua as Yin sets, regular open semianalytic sets with bounded boundary.
result Characterize local and global topology of Yin sets.
New partition designs reduce star discrepancy in high-dimensional sampling.
problem Improving the expected star discrepancy in high-dimensional sampling.
method Developed non-equal volume partitions to achieve lower expected star discrepancy.
result Explicit upper bounds for expected star discrepancy under non-equal volume partitions.
How to give a natural geometric definition of a covariant Poisson bracket in classical field theory has for a long time been an open problem - as testified by the extensive literature on "multisymplectic Poisson brackets", together with the fact that all these proposals suffer from serious defects. On the other hand, t…
Enhances consensus clustering with a stronger Mean Partition Theorem.
problem Improving consensus clustering solutions for mean partition.
method Presented a stronger Mean Partition Theorem and Expected Partition Theorem.
result Shows versatility of the Mean Partition Theorem in multiple applications.
The paper constructs Markov partitions for geodesic flow on hyperbolic surfaces.
problem Understanding Markov partitions for general hyperbolic flows.
method Rigorous construction of Markov partitions for geodesic flow on Riemann surfaces of constant negative curvature.
result Explicit forms of rectangles and local cross sections provided for the geodesic flow.
New method unifies and formalizes data partitioning using a single vector.
problem Data partitioning and clustering methods.
method Rank-one matrix factorization and denoising of piecewise constant signals.
result Demonstrates robustness of denoising step in partitioning.
Survey of mass partition problems in geometry and topology.
problem Inducing partitions on measures or sets by dividing space.
method Recent progress in topology, discrete geometry, and computer science.
result Connections between different fields.
The study shows mean partitions are consistent and asymptotically normal.
problem Lack of knowledge about the consistency of mean partitions in consensus clustering.
method Represented partitions as points in orbit space, used Fréchet means and stochastic programming, and analyzed continuous extensions of cluster criteria.
result Mean partitions are consistent and asymptotically normal under normal assumptions.
Locally isoperimetric partitions minimize perimeter in space.
problem Finding minimal perimeter partitions in space.
method Proving closure theorem to limit sequences of isoperimetric clusters.
result Examples of isoperimetric partitions in various dimensions.
Online BSP-Forest improves space partitioning for large-scale classification and regression.
problem Efficient space partitioning for large-scale classification and regression problems.
method Developed an online BSP-Forest framework that expands space coverage and refines partition structure in real-time.
result Guaranteed universal consistency for both classification and regression problems.
Study of Torelli groups of partitioned surfaces with bounds and asymptotic lengths.
problem Understanding Torelli groups of partitioned surfaces.
method Topological and dynamical analysis of Torelli groups of partitioned surfaces.
result Asymptotic translation lengths of Torelli groups of partitioned surfaces behave almost like the reciprocal of the Euler characteristic of the surface.
Efficiently calculates PL model likelihood for partitioned preference data.
problem Computational infeasibility of calculating PL model likelihood for partitioned preference data.
method Random utility model formulation and efficient numerical integration approach.
result Proposed method outperforms existing LTR baselines and scales to real-world tasks.
Paper recovers lattice signal partitions efficiently.
problem Estimating lattice partition from noisy data.
method Uses dyadic CART for computationally-efficient partition recovery.
result Consistently estimates partition with optimal error rate.
New proof of a unique 3-part partition in 8D space.
problem Existence of a non-standard isoperimetric partition in high dimensions.
method Analytical proof showing existence of a specific partition.
result Existence of a non-standard isoperimetric partition in 8D space.
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.