Lattices embeddability determined by correction terms.
problem Embeddability of nonunimodular definite lattices.
method Using Elkies' theorem and lattice correction terms.
result Embeddability of lattices is determined by correction terms.
Machine learning identifies key metabolic control circuits in bacterial pathways.
problem Identifying regulated metabolic pathways in bacteria.
method Machine learning approach analyzing multi-omics data.
result Identification of E. coli Glycolysis regulatory circuits.
Metabolic flux balance analyses are a standard tool in analysing metabolic reaction rates compatible with measurements, steady-state and the metabolic reaction network stoichiometry. Flux analysis methods commonly place unrealistic assumptions on fluxes due to the convenience of formulating the problem as a linear prog…
With the maturation of metabolomics science and proliferation of biobanks, clinical metabolic profiling is an increasingly opportunistic frontier for advancing translational clinical research. Automated Machine Learning (AutoML) approaches provide exciting opportunity to guide feature selection in agnostic metabolic pr…
Develops PageRank for directed hypergraphs using metabolic network.
problem Lack of directed hypergraph datasets for PageRank algorithm.
method Developed PageRank algorithm for directed hypergraphs and applied it to metabolic network.
result Successfully applied novel PageRank algorithm to metabolic network.
In a classic paper Zeeman introduced the k-twist spin of a knot K and showed that the exterior of a twist spin fibers over S^1. In particular this result shows that the knot K # -K is doubly slice. In this paper we give a quick proof of Zeeman's result. The k-twist spin of K also gives rise to two metabolizers for K # …
It is known that the linking form on the 2-cover of slice knots has a metabolizer. We show that several weaker conditions, or some other conditions related to sliceness, do not imply the existence of a metabolizer. We then show how the Rudolph-Bennequin inequality can be used indirectly to prove that some knots are not…
A derivative of an algebraically slice knot K is an oriented link disjointly embedded in a Seifert surface of K such that its homology class forms a basis for a metabolizer H of K. We show that for a genus three algebraically slice knot K, the set $\{ \barμ_{\{γ_1,γ_2,γ_3\}}(123) - \barμ_{\{γ'_1,γ'_2,γ'_3\}}(…
Method predicts NAFLD risk with high accuracy and distribution-free coverage guarantees.
problem Insufficient population-level screening tools for NAFLD.
method Gradient-boosted decision trees with conformal prediction.
result Method achieves AUROC of 0.912 internally and 0.891 externally, superior to other models.
Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.
problem Energy constraints in computation.
method Poisson variational autoencoders with a Kullback-Leibler divergence term proportional to firing rates.
result Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.
For n >1, if the Seifert form of a knotted 2n-1 sphere K in S^{2n+1} has a metabolizer, then the knot is slice. Casson and Gordon proved that this is false in dimension three (n = 1). However, in the three dimensional case it is true that if the metabolizer has a basis represented by a strongly slice link then K is sli…
Study compares atom representations in graph neural networks for molecular properties.
problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.
The paper corrects a proof and extends a theorem about linking pairings in 4-manifolds.
problem Linking pairings in 4-manifolds and their properties.
method Analyzes the embedding of multiple copies of a 4-manifold in a compact 4-manifold and examines the resulting linking pairings.
result The linking pairing on the boundary of a 4-manifold is split metabolic, generalizing Hantzsche's theorem.
This work uses Sylvester normalizing flows for more accurate metabolite quantification in MRS.
problem Challenges in accurate metabolite quantification in MRS due to spectral overlap, low SNR, and artifacts.
method Bayesian inference framework with physics-informed Sylvester normalizing flows.
result Accurate metabolite quantification, well-calibrated uncertainties, and insights into parameter correlations and multi-modal distributions.
Deep learning models accurately recognize and estimate physical activity types and energy expenditure from wrist accelerometer data.
problem Rigorous evaluation of wrist-worn accelerometers for assessing physical activity across the lifespan.
method Built deep learning networks to extract spatial and temporal representations from time-series data, recognizing physical activity types and estimating energy expenditure.
result Deep learning models achieved high performance: F1 scores of 0.82, 0.81, and 95 for sedentary, locomotor, and lifestyle activities, respectively; root mean square error of 1.1 for EE estimation.
Novel method identifies proteomic risk markers for Alzheimer disease.
problem Lack of comprehensive proteomic risk markers for Alzheimer disease diagnosis.
method Deep belief network-based feature selection method using proteomic and clinical data.
result Identified an optimal subset of proteins achieving 90% accuracy in Alzheimer disease diagnosis.
ODBAE detects complex phenotypes in biological data.
problem Challenges in identifying complex phenotypes from high-dimensional biological data.
method ODBAE (Outlier Detection using Balanced Autoencoders) identifies influential and high leverage points in latent relationships among multiple physiological parameters.
result ODBAE reveals novel metabolism-related genes and uncovers coordinated abnormalities across metabolic indicators.
Novel process model for metabolomics data analysis.
problem Analyzing complex metabolomics data.
method Data-driven and hypothesis-driven data mining approaches using various techniques.
result Demonstrated applicability and strengths of MeKDDaM model.
The difference between slice and doubly-slice knots is reflected in algebra by the difference between metabolic and hyperbolic Blanchfield linking forms. We exploit this algebraic distinction to refine the classical Witt group of linking forms by defining a `double Witt group' of linking forms. We calculate the double …
Model predicts smoking events using a Hawkes process.
problem Predict smoking events to improve cessation interventions.
method Time-varying semi-parametric Hawkes process model.
result TV-SPHP achieves superior prediction performance.
We show that a steady-state stock-flow consistent macro-economic model can be represented as a Constraint Satisfaction Problem (CSP).The set of solutions is a polytope, which volume depends on the constraintsapplied and reveals the potential fragility of the economic circuit,with no need to study the dynamics. Several …
We develop a theory of chain complex double-cobordism for chain complexes equipped with Poincaré duality. The resulting double-cobordism groups are a refinement of Ranicki's torsion algebraic L-groups for localisations of a commutative ring with involution. The refinement is analogous to the difference between metabo…
We consider the problem of joint modelling of metabolic signals and gene expression in systems biology applications. We propose an approach based on input-output factorial hidden Markov models and propose a structured variational inference approach to infer the structure and states of the model. We start from the class…
We define a set of "second-order" L^(2)-signature invariants for any algebraically slice knot. These obstruct a knot's being a slice knot and generalize Casson-Gordon invariants, which we consider to be "first-order signatures". As one application we prove: If K is a genus one slice knot then, on any genus one Seifert …
A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the purpose of dealing with large-scale data, where the separability assumption is satisfied. In particular, we modify the Linear Programming (LP) algorithm of [9] by introducing a reduced set of constraints for exact NMF. In…
We introduce, test and discuss a method for classifying and clustering data modeled as directed graphs. The idea is to start diffusion processes from any subset of a data collection, generating corresponding distributions for reaching points in the network. These distributions take the form of high-dimensional numerica…
The paper calculates subgroup distortions in 3-manifold groups.
problem Understanding subgroup distortions in 3-manifold groups.
method Computed all finitely generated subgroups of finitely generated 3-manifold groups and analyzed their distortions.
result Subgroup distortions in 3-manifold groups are linear, quadratic, exponential, or double exponential.
Regular subgroups of SL3(R) are identified and ruled out.
problem Identifying and characterizing regular subgroups of SL3(R).
method Using Kapovich–Leeb–Porti and Guichard–Wienhard divergent subgroups criteria, and Oh's results.
result Regular subgroups of SL3(R) are precisely lattices in minimal horospherical subgroups.
Study shows lower central subgroups of a subgroup don't contain those of the free group.
problem Whether lower central subgroups of a subgroup contain those of the free group.
method Analyzes the relationship between lower central subgroups of a free group and its subgroup.
result Lower central subgroups of a subgroup do not contain those of the free group if the subgroup does not normally generate the free group.
Study on braid group quotients by congruence subgroups.
problem Understanding the image of congruence subgroups in GL(n,Z).
method Characterization through symplectic congruence subgroups.
result Open problem solved: image of congruence subgroups in GL(n,Z).
The paper explores geometric finiteness in mapping class groups and constructs new examples of these subgroups.
problem Understanding geometric finiteness in mapping class groups and constructing new examples.
method Examined several constructions of subgroups and determined conditions for geometric finiteness.
result Provides new examples of parabolically geometrically finite and reducibly geometrically finite subgroups.
Proposes a new method for finding non-redundant, standout subgroups in numeric datasets.
problem Mining large numbers of redundant subgroups in numeric datasets.
method Dispersion-aware problem formulation based on MDL principle for subgroup set discovery.
result Empirically demonstrates SSD++ returns outstanding subgroup lists.
Proves Congruence Subgroup Property for two types of groups.
problem Proving Congruence Subgroup Property for specific groups.
method Elementary proof of Johnson filtration and geometric subsurface inclusions.
result Proves Congruence Subgroup Property for nilpotent quotients and subsurface subgroups.
New method constructs non-quasiconvex subgroups in hyperbolic groups.
problem Creating non-quasiconvex subgroups in hyperbolic groups.
method Using Stallings-like techniques on right-angled Coxeter groups (RACGs).
result Explicit examples of non-quasiconvex subgroups constructed.
New techniques reveal subgroup properties in Coxeter groups.
problem Characterizing and understanding subgroups of right-angled Coxeter groups.
method Using cube complexes and Stallings-like techniques to study subgroups.
result Reflection and one-ended subgroups are quasiconvex.
Characterizes knotted subgroups of Lie groups and provides examples.
problem Defining and understanding knotted subgroups of Lie groups.
method Geometric equivalence, one-parameter subgroups, infinitesimal elements, canonical forms, spectrum analysis.
result Completely classified knotted subgroups of SL(2,R) and SL(3,R).
Study subgroups of pro-p PD^3 groups, finding specific conditions.
problem Characterize subgroups of pro-p PD^3 groups. method Analyzes properties of subnormal and finitely presented subgroups.
result Conditions on subgroups of pro-p PD^3 groups. Torelli subgroup rigidity in Out(F_N) proven for N≥4.
problem Proving rigidity of Torelli subgroup in Out(F_N).
method Injective homomorphisms and conjugation analysis.
result Every injective homomorphism from Torelli subgroup to Out(F_N) is conjugate to inclusion.
Extends Anosov subgroup definitions to more general groups.
problem Characterize subgroups of semisimple Lie groups.
method Relativizes characterizations of Anosov subgroups.
result Proves implications and equivalences between relativized characterizations.
Robust subgroup discovery finds non-redundant, statistically significant subgroups.
problem Finding interpretable, robust subgroups from data.
method Formulated subgroup lists for univariate and multivariate targets, used MDL principle and greedy heuristic SSD++.
result SSD++ outperforms previous methods in quality and size of subgroup lists.
No hyperbolic group can have an infinite chain of free subgroups of fixed rank.
problem Infinite ascending chains of free subgroups in hyperbolic groups.
method Proof by contradiction and properties of hyperbolic groups.
result Hyperbolic groups do not contain strictly ascending chains of free quasiconvex subgroups of constant rank.
New theorem on subgroup dynamics of Out(F_N).
problem Understanding subgroups of Out(F_N).
method Analogous to Ivanov's and Handel-Mosher's theorems.
result Subgroups either contain atoroidal elements or fix conjugacy classes.
Clarifies the confidence interval approach for bioequivalence testing.
problem Ensuring the reliability of bioequivalence testing methods.
method Clarifies the conditions under which a 100(1-2α)% confidence interval yields a size-α test.
result A 100(1-2α)% confidence interval approach for bioequivalence testing yields a size-α test only when the two one-sided tests are 'equal-tailed'.
We compute the group of link homotopy classes of link maps of two 2-spheres into 4-space. It turns out to be free abelian, generated by geometric constructions applied to the Fenn-Rolfsen link map and detected by two self-intersection invariants introduced by Paul Kirk in this setting. As a corollary, we show that any …
For effective treatment of Alzheimer disease (AD), it is important to identify subjects who are most likely to exhibit rapid cognitive decline. Herein, we developed a novel framework based on a deep convolutional neural network which can predict future cognitive decline in mild cognitive impairment (MCI) patients using…
Sparse GFA identifies disease factors in FTD subgroups.
problem Heterogeneity in neurological disorders hinders understanding and treatment.
method Sparse Group Factor Analysis (GFA) with regularised horseshoe priors.
result Identified latent disease factors differentially expressed in FTD subgroups.
New lattices in higher dimensions have dense surface subgroups.
problem Finding dense subgroups in higher-dimensional arithmetic lattices.
method Exhibited nonuniform arithmetic lattices in SO(n,1).
result Contain Zariski-dense surface subgroups.
For a finitely generated group, there are two recent generalizations of the notion of a quasiconvex subgroup of a word-hyperbolic group, namely a stable subgroup and a Morse or strongly quasiconvex subgroup. Durham and Taylor defined stability and proved stability is equivalent to convex cocompactness in mapping class …