Paper explores folding patterns of curved creases preserving their geometric properties.
problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.
Paper classifies pillow box isometric deformations preserving crease patterns.
problem Classifying pillow box isometric deformations preserving crease patterns.
method Continuous isometric deformations from pillow boxes to double rectangles, preserving crease patterns.
result Such deformations necessarily change pillow box topology.
Consider an oriented curve Γ in a domain D in the plane R2. Thinking of D as a piece of paper, one can make a curved folding in the Euclidean space R3. This can be expressed as the image of an "origami map" Φ:D→R3 such that Γ is the singular set of Φ, the word "…
Consider a curve Γ in a domain D in the plane R2. Thinking of D as a piece of paper, one can make a curved folding P in the Euclidean space R3. The singular set C of P as a space curve is called the crease of P and the initially given plane curve Γ is called the crease patt…
This paper explores non-periodic folding of Spidron units, revealing nonlinear dynamics.
problem Understanding the kinematics and nonlinear phenomena of Spidron units.
method Analysis of single unit cell kinematics and recursive construction of multiple cells.
result Non-periodic folding restricts isotropic folding as the number of unit cells increases.
We describe a general family of curved-crease folding tessellations consisting of a repeating "lens" motif formed by two convex curved arcs. The third author invented the first such design in 1992, when he made both a sketch of the crease pattern and a vinyl model (pictured below). Curve fitting suggests that this init…
New game defined on origami patterns, linking number introduced.
problem Defining a game on origami patterns.
method Introduced Region Select on origami crease patterns.
result Defined a new unlinking number.
Researchers solved a geometry paradox for creased tubes.
problem Resolving the paradox of Gaussian curvature in creased tubes.
method Calculated Gaussian curvature in terms of rate of change of solid angle, dependent on fold angle and curvature.
result Gaussian curvature is zero overall despite the surface being doubly-curved.
New framework reveals limits of flexible, periodic thin surfaces.
problem Understanding the mechanical behavior of thin, periodic surfaces.
method Developed a duality between surface rotations and in-plane stresses.
result Exactly three out of six possible strain states are isometries.
Classifies and analyzes the stability of black hole event horizon birth points using contact geometry.
problem Classifying and understanding the structural possibilities of black hole crease sets.
method Contact geometry approach, focusing on BigFronts and their Legendrian projections.
result Refined stability discussion of the event horizon birth component and identification of additional components.
The paper proves the existence of a folded annulus with multiple creases.
problem Existence of a folded annulus with multiple creases.
method Analyze developable surfaces, use normal curvature and relative torsion, compute geometric descriptors, prove propagation of folds.
result Proves the existence of a folded annulus with multiple creases.
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…
Periodic surfaces have a limited number of bending modes, equal to their membrane modes.
problem Understanding the limitations of bending modes in periodic surfaces.
method Analyzing deformation modes of periodic, piecewise smooth, simply connected surfaces.
result Effective membrane modes and bending modes are orthogonal, limiting the total number of modes to 3.
A flat Klein bottle is visualized using origami.
problem Visualizing a Klein bottle's flatness and topology.
method Curved-crease origami with inelastic film.
result The sculpture illustrates both flatness and non-orientability.
Origami can create complex knots, with minimum creases defining a new knot invariant.
problem Creating complex knots using origami folds.
method Developed a new knot invariant called the fold number, defined as the minimum number of creases required to obtain an equivalent knot.
result No proper foldings can produce nontrivial knots, but improper foldings can.
Unified theory solves strain compatibility and elasticity of origami metamaterials.
problem Understanding and controlling the morphing paths of origami metamaterials.
method Unified theory for a wide array of origami tessellations, solving strain compatibility and elasticity.
result Origami metamaterials exhibit equal but opposite in-plane and out-of-plane Poisson's ratios and bending energy depends on strain gradient.
The Positive Mass Theorem for special singular initial data.
problem Proving the positive mass theorem for data with a codimension one singularity.
method Using asymptotically flat spin initial data sets with matching Bartnik data condition involving spacetime rotations.
result Established a spacetime positive mass theorem and rigidity statement.
Classifies embeddings of surfaces in 3D space with product structure.
problem Classifying embeddings of surfaces in Euclidean 3-space with product structure.
method Investigates embeddings of a surface in R2imesR, focusing on critical points and isotopy classes. result Provides necessary and sufficient conditions for realizing certain configurations of curves as crease sets.
The study explores isometric deformations of surfaces of translation.
problem Determine the ways surfaces of translation bend isometrically.
method Analyzes existence conditions and provides closed-form expressions for infinitesimal and finite bendings of surfaces of translation.
result Surfaces of translation admit various infinitesimal and finite bendings, including purely torsional and torsion-free.
Study finds how periodic surfaces can bend without stretching.
problem Understanding isometric deformations of periodic surfaces.
method Characterization of isometric deformations using a constraint derived from Gauss theorem.
result Relates surface stretching to bending and twisting.
Shells resist three out of six possible loads if simply connected.
problem Understanding the load resistance of shells.
method Formal mathematical analysis of shell strains and deflections.
result The space of strains is three-dimensional for simply-connected shells.
Proves Gromov's conjecture on total mean curvature using surgery and positive mass theorems.
problem Proving Gromov's conjecture on total mean curvature of fill-ins.
method Surgery to reduce to fill-ins of spheres, positive mass theorems, and quantitative surgery process.
result Proves Gromov's conjecture on total mean curvature in various cases.
Clinical decision support systems (CDSS) will play an in-creasing role in improving the quality of medical care for critically ill patients. However, due to limitations in current informatics infrastructure, CDSS do not always have com-plete information on state of supporting physiologic monitor-ing devices, which can …
New solutions found for bending of flat surfaces and origami structures.
problem Understanding the energy-efficient bending modes of origami tessellations and corrugated shells.
method Direct construction of closed-form solutions for surfaces of translation.
result Three inextensional modes identified for surfaces of translation, including stretching, bending, and twisting.
New concept of effective isometries for compliant shells.
problem Inadequate classification of isometric deformations for compliant shells.
method Introduce effective isometric deformations defined by first-order isometry in a small scale separation parameter.
result Effective isometries are solutions to a quasilinear second-order PDE.
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
problem Exponential growth of patterns in structured data.
method Safe Pattern Pruning (SPP) method.
result Effective model building in practical data analysis.
BN^2MF identifies unknown exposure patterns in environmental mixtures.
problem Identifying unknown exposure patterns in environmental mixtures.
method Bayesian non-parametric non-negative matrix factorization (BN^2MF) with non-negative continuous priors and a non-parametric sparse prior.
result Estimates patterns of chemical exposures without specifying the number of patterns.
RestoreAI predicts landmine risk from patterns, improving clearance efficiency.
problem Predicting landmine risk from spatial patterns to enhance clearance efficiency.
method RestoreAI uses landmine patterns for risk prediction, implementing three deminers: linear, curved, and Bayesian.
result RestoreAI significantly boosts clearance efficiency, achieving a 14.37 percentage point increase in cleared landmines per timestep.
Study of knots with generalized Mazur patterns and their invariants.
problem Understanding the invariants and properties of knots with generalized Mazur patterns.
method Computational analysis of τ and ε invariants for n-twisted satellites. result None of the n-twisted patterns from the family act surjectively on the smooth or rational concordance group. Two approaches detect EV charging patterns at stations.
problem Identify charging patterns at electric vehicle charging stations.
method Two approaches: rule-based and hierarchical clustering.
result Hierarchical clustering revealed unexpected charging patterns.
Universal learning machine is a theory trying to study machine learning from mathematical point of view. The outside world is reflected inside an universal learning machine according to pattern of incoming data. This is subjective pattern of learning machine. In [2,4], we discussed subjective spatial pattern, and estab…
Study of combinatorial Calabi flow on ideal circle patterns.
problem Finding ideal circle patterns with prescribed curvatures.
method Combinatorial Calabi flow in hyperbolic and Euclidean geometry.
result Flow converges exponentially to ideal circle patterns.
Proves existence of circle patterns on surfaces with cusps.
problem Existence of circle patterns with prescribed angles on surfaces with cusps.
method Introduced combinatorial Ricci and Calabi flows to prove longtime existence and convergence.
result Existence of generalized circle patterns with prescribed angles on surfaces with cusps.
Study circle patterns on tori, linking symplectic forms and homeomorphisms.
problem Understanding circle patterns on tori and their symplectic properties.
method Investigates the space of circle patterns on closed tori with complex projective structures, embedding it into Teichmüller spaces and analyzing symplectic forms.
result Non-degeneracy of the pulled-back Weil-Petersson symplectic form and homeomorphism between circle patterns and Teichmüller spaces.
An immense class of physical counterexamples to the four dimensional strong cosmic censor conjecture---in its usual broad formulation---is exhibited. More precisely, out of any closed and simply connected 4-manifold an open Ricci-flat Lorentzian 4-manifold is constructed which is not globally hyperbolic and no perturba…
FSR efficiently discovers significant patterns with few resampled datasets.
problem Mining significant patterns in transactional data, especially subgroups.
method FSR uses resampling to bound the supremum deviation of quality statistics, providing rigorous guarantees on false discoveries.
result FSR effectively discovers significant subgroups with a small number of resampled datasets.
In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern pruning (SPP) for a class of predictive pattern mining problems. The SPP method a…
TFPS improves time series forecasting by learning pattern-specific experts.
problem Challenges in forecasting time series data with varying patterns across segments.
method Dual-domain encoder, subspace clustering, pattern-specific experts.
result Significantly improved forecasting accuracy, especially in long-term forecasting.
Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…
While Multiple Instance (MI) data are point patterns -- sets or multi-sets of unordered points -- appropriate statistical point pattern models have not been used in MI learning. This article proposes a framework for model-based MI learning using point process theory. Likelihood functions for point pattern data derived …
The paper integrates statistical significance and discriminative power in pattern discovery.
problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.
Paper extends circle pattern theory to obtuse angles.
problem Circle patterns with obtuse angles not previously covered.
method Using topological degree theory, extends Koebe-Andreev-Thurston Theorem.
result Generalized Andreev's Theorem for obtuse dihedral angles.
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time behaviors of Chow-Luo's combinatorial Ricci flows for these patterns. As consequences,…
Pattern sampling reduces time series classification complexity.
problem High computational complexity of exhaustive search for shapelets.
method Pattern sampling using a weighted trie to extract discriminative patterns.
result Significant reduction in computational and memory resources.
Symplectic forms match on circle pattern space.
problem Matching symplectic forms on circle pattern space.
method Pullback of symplectic forms to circle pattern space.
result Symplectic forms on circle pattern space coincide.
Study identifies clusters of EU countries with similar young mortality patterns.
problem Identify clusters of EU countries with similar mortality patterns in young population.
method Symbolic data analysis (SDA) with age, gender, and main causes of death dimensions.
result Identified clusters of EU countries with similar mortality patterns in young population.
This research improves LSTM for monthly electricity demand forecasting using pattern-based methods.
problem Forecasting mid-term monthly electricity demand with high accuracy.
method Developed a hybrid LSTM model using x-patterns and exponential smoothing.
result The hybrid model outperformed standard LSTM and classical models.
For using neural networks in safety critical domains, it is important to know if a decision made by a neural network is supported by prior similarities in training. We propose runtime neuron activation pattern monitoring - after the standard training process, one creates a monitor by feeding the training data to the ne…