New methods to construct curve pairs and their applications.
problem Constructing curve pairs and their properties.
method Using integral curves to study direction and donor curves.
result New methods to construct partner curves of unit speed curves.
New method to construct partner curves of non-lightlike curves.
problem Constructing partner curves for non-lightlike curves.
method Using integral curves in Minkowski 3-space, direction curve, and donor curve.
result New methods to construct partner curves of a unit speed non-lightlike curve.
A method to detect spillover effects and select valid donors for synthetic control models.
problem Identifying valid donors in synthetic control models when spillover effects are possible.
method Theoretical grounding and practical method using pre-intervention data to identify donor values and debias causal estimates.
result A Theorem that identifies assumptions for identifying donor values and debias causal estimates.
Paper learns data-driven organ matching rules from observational data.
problem Tackles organ transplantation compatibility using observational data.
method Representation learning to cluster donors and apply recipient transformations.
result Model outperforms human experts in predicting transplant outcomes.
Donor-aware scRNA-seq benchmarks improve classification accuracy in inflammatory bowel disease.
problem Influenza disease classification from scRNA-seq data is prone to donor-level confounding.
method Developed and evaluated three feature representations across two IBD cohorts.
result Compartment-stratified CLR composition and GatedStructuralCFN embeddings outperform linear models in classification accuracy.
Donors who defer their donations volunteer less in the future.
problem Volunteer labor can be less beneficial to charities than its costs.
method Regression discontinuity design with a procedure to handle manipulation.
result Donor manipulation invalidates standard regression discontinuity design, but a new method provides partial identification bounds.
Paper develops a model to predict kidney transplant success.
problem Mismatched deceased donor-recipient kidney leads to post-transplant death.
method Data analysis of 584 imported kidneys from 12 transplant centers.
result Predicting model reduces mortality rate due to kidney mismatch.
ClusterSC improves synthetic control by selecting relevant donor groups.
problem The curse of dimensionality in synthetic control with individual-level data.
method ClusterSC incorporates clustering to select relevant donor groups.
result ClusterSC consistently outperforms classical SC approaches.
Paper uses ML to classify liver diseases from clinical data.
problem Classifying liver diseases from clinical data.
method Multiple imputation, PCA, data visualizations, binary classifier algorithms (ANN, RF, SVM).
result SVM showed better accuracy (98.23%).
Enhances solar cell efficiency prediction using deep neural networks.
problem Predicting HOMO values for organic solar cells from limited experimental data.
method Ensemble deep neural network (SINet) using SMILES and InChI molecular representations.
result Significant performance improvement from transfer learning and dual molecular representations.
Study uses genetic algorithms to predict boolean values in blood donor databases.
problem Predicting boolean values in blood donor databases.
method Used genetic algorithms to optimize classifier performance.
result Optimized genetic algorithm pipeline outperformed other classifiers.
Differentially private synthetic control estimates treatment effects while protecting privacy.
problem Estimating treatment effects on sensitive data without revealing individual information.
method Combines non-private synthetic control and differentially private empirical risk minimization.
result Private synthetic control produces accurate predictions with minimal privacy cost.
SFC aims to protect the Amazon with a digital currency and smart contracts.
problem Protecting the Amazon's ecosystem and ensuring resource credibility.
method Blockchain, digital contracts, smart contracts with oracles.
result Ensures credibility and security for financial resources invested in Amazon projects.
Robust synthetic control method improves comparative case studies.
problem Comparative case studies with missing data and noisy covariates.
method Singular value thresholding to de-noise data, automatic donor selection, robustness to missing data.
result Improved prediction accuracy and robustness to missing data.
Reflective of income and wealth distributions, philanthropic gifting appears to follow an approximate power-law size distribution as measured by the size of gifts received by individual institutions. We explore the ecology of gifting by analysing data sets of individual gifts for a diverse group of institutions dedicat…
The kind of realized mission inflows the sensitivity to risk. Among other factors, the risk results from decision about liquid assets investment level and liquid assets financing. The higher the risk exposure, the higher the level of liquid assets. If the specific risk exposure is smaller, the more aggressive could be …
Charities can increase donations by targeting optimal recipients.
problem Ineffective fundraising leads to lower resources for goods.
method Combines field experiment and causal machine-learning approach.
result Machine-learning-based optimal targeting increases donations significantly.
Machine learning improves kidney transplant outcomes prediction.
problem Improving prediction of kidney transplant success.
method Random forest machine learning model trained on kidney donor risk index data.
result Random forest predicted 2,148 more successful transplants than the risk index.
Paper predicts IVF pregnancy rates from basic patient info.
problem Predicting IVF pregnancy rates from patient characteristics.
method Clustering patients into groups, then SVM models for each group.
result Support vector machine models achieve best overall performance.
Cooperation is a persistent behavioral pattern of entities pooling and sharing resources. Its ubiquity in nature poses a conundrum. Whenever two entities cooperate, one must willingly relinquish something of value to the other. Why is this apparent altruism favored in evolution? Classical solutions assume a net fitness…
Improved molecular property prediction using attention and gate mechanisms.
problem Predicting molecular properties from chemical data.
method Attention and gate mechanisms in graph convolutional networks.
result Improved prediction of molecular properties, including photovoltaic efficiency.
IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.
problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.
Adaptive model improves age prediction from DNA methylation data.
problem Improving age prediction from DNA methylation data with heterogeneity.
method Adaptive model for feature selection based on individual sample distributions.
result Substantial improvement in age prediction for one tissue type.
Generative Distribution Embeddings learn multiscale representations of distributions.
problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.
Prediction markets can shape political behavior through persistent signals, not just forecast accuracy.
problem The role of prediction markets beyond forecasting.
method Transaction-level evidence from the 2024 U.S. presidential election, Signal Credibility Index (SCI).
result Price signals in prediction markets are more influential due to persistence, breadth of trader types, and cross-platform consensus.
Improved logistic regression for multi-omics data improves prediction and variable selection.
problem Predicting binary class labels from multi-omics datasets with varying characteristics.
method Two-step penalized logistic regression with separate variable selection for each data layer.
result Our approach selects more relevant predictors and achieves comparable prediction performance.
The study explores Bertrand and Mannheim curves in 4D Euclidean space for framed curves.
problem Exploring Bertrand and Mannheim curves in 4D Euclidean space for framed curves.
method Defining and investigating Bertrand and Mannheim curves of framed curves in 4D Euclidean space.
result Bertrand and Mannheim curves exist even for framed curves in 4D Euclidean space, contrary to regular curves.
The study examines Bertrand Legendre curves in the unit tangent bundle over Euclidean plane.
problem Investigating properties of Legendre curves and their associated curves.
method Analyzing Bertrand Legendre curves and their associated curves, including parallel, evolute, and involute curves.
result Existence conditions and inverse operation for Bertrand Legendre curves are provided.
Method for generating new curves from plane curves on cylinders.
problem Generating new space curves from given plane curves.
method Defining a non-planar space curve on a right generalized cylinder and examining its focal curve.
result Parametric representation of the focal curve of a cylindrical curve.
The paper characterizes curves in pseudo-Galilean 4-space.
problem Characterizing curves in the pseudo-Galilean 4-space G14. method Investigation and characterisation of admissible curves in terms of curvature functions.
result Necessary and sufficient conditions for admissible rectifying curves in G14. The paper explores Bertrand and framed curves in 3D space.
problem Characterizing Bertrand and framed curves in Euclidean 3-space.
method Analyzing curves where tangent, normal, or binormal lines match another curve's lines.
result Conditions for the existence of Bertrand and framed curves are clarified.
The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.
problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying k-equivalent curves, analyzing intersections with other curves. result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By certified, we mean that the approximation can approximate the given curve to any given pr…
The study classifies singularities of spherical orthotomic curves.
problem Classifying singularities of spherical orthotomic curves.
method Defining spherical orthotomic curves and classifying their singularities.
result Singularities of spherical orthotomic curves are classified.
Flow deforms locally convex curves to curves of constant k-order width.
problem Evolve locally convex curves to curves of constant k-order width.
method Introduced a nonlocal curvature flow to evolve locally convex curves in the plane.
result The flow converges to a smooth, locally convex curve of constant k-order width as time goes to infinity.
Modified curve shortening flow constructs λ-Angenent curve.
problem Constructing λ-Angenent curve. method Modified curve shortening flow
result Constructs λ-Angenent curve. Study on CR curves in 3-sphere, focusing on critical curves integration and existence.
problem Addressing the integration and existence of critical curves in the CR 3-sphere.
method Provided a procedure for the explicit integration of general critical curves and characterized closed curves.
result Existence of infinite countably many closed critical curves.
The paper quantifies fractal curves using centroaffine curvatures.
problem Quantifying the irregularities of fractal curves.
method Using moving frame and centroaffine curvatures.
result Fractal curves can be described by a sequence of affine curvatures.
Study rectifying curves in 3D multiplicative Euclidean space.
problem Investigate rectifying curves in a non-Newtonian geometry setting.
method Apply multiplicative differential-geometric concepts to rectifying curves.
result Classify multiplicative rectifying curves using spherical curves.
In classical curve theory, the geometry of a curve in three dimensions is essentially characterized by their invariants, curvature and torsion. When they are given, the problem of finding a corresponding curve is known as 'solving natural equations'. Explicit solutions are known only for a handful of curve classes, inc…
The paper characterizes pedal curves of quadratic curves.
problem Understanding pedal curves of quadratic curves.
method Analyzing the inverse construction of pedal curves.
result Characterization of pedal curves of quadratic curves.
Unified description of aesthetic curves through self-affinities.
problem Characterizing log-aesthetic curves and their properties.
method Reformulating and proving self-affinities of planar curves, integrating equiaffine geometry.
result Unified characterization of constant curvature curves in similarity and equiaffine geometries.
Primitive curves in handlebodies form a connected complex.
problem Understanding the structure of curves in handlebodies.
method Defining and analyzing primitive curves and constructing sequences between them.
result The primitive curve complex for a handlebody is connected.
Study on Bertrand lightcone framed curves in Lorentz-Minkowski 3-space.
problem Analyzing mixed types of curves with singular points in Lorentz-Minkowski 3-space.
method Using lightcone frame to consider Bertrand types for lightcone framed curves.
result Existence conditions of Bertrand lightcone framed curves in all cases.
Study isotopy of rational cuspidal curves in 4-manifolds.
problem Isotopy of rational cuspidal curves in 4-manifolds.
method Tame symplectic curves, pseudo-holomorphic curves, log pairs, 4-dimensional topology.
result Every rational cuspidal curve is isotopic to a complex curve in degrees up to 5.
Defines new curves from tangent indicatrix of curves, linking them to helices and slant helices.
problem Understanding and constructing helices and slant helices from spherical curves.
method Defining integral curves of Frenet vectors and using their curvatures.
result Established relationships and methods to create helices and slant helices from specific spherical curves.
In this study, we introduce a new type of surface curves called D-type curve. This curve is defined by the property that the unit Darboux vector W0 of a space curve r(s) and unit surface normal n along the curve r(s) satisfy the condition <n,W0>=constant. We point out that a D-type curve is a geodesic curve or an asymp…
Study on triharmonic curves in f-Kenmotsu manifolds.
problem Characterizing triharmonic curves in f-Kenmotsu manifolds.
method Investigation of necessary and sufficient conditions for Frenet curves, slant, and Legendre curves to be triharmonic. Proof of specific properties of triharmonic Frenet curves.
result Triharmonic Frenet curves with constant curvature are Frenet helices in three dimensional f-Kenmotsu manifolds.