Bayesian model predicts drip-line locations in heavy calcium isotopes.
problem Determining the neutron drip line in the Ca region of heavy nuclei.
method Bayesian model averaging with Gaussian-process-based extrapolations.
result Predicted posterior probabilities for drip-line locations in heavy calcium isotopes.
Quantified limits of nuclear stability beyond drip lines.
problem Predicting nuclear stability beyond known isotopes.
method Microscopic nuclear mass models, Bayesian methodology, Gaussian processes.
result Quantified predictions of one- and two-nucleon separation energies.
Bayesian analysis predicts properties of proton-emitting nuclei beyond the proton drip line.
problem Predicting properties of unstable nuclei in the proton-rich region.
method Bayesian Gaussian processes and mass models corrected with statistical emulators.
result Quantified predictions for separation energies and probabilities of proton emission.
Liquid chromatography coupled with tandem mass spectrometry, also known as shotgun proteomics, is a widely-used high-throughput technology for identifying proteins in complex biological samples. Analysis of the tens of thousands of fragmentation spectra produced by a typical shotgun proteomics experiment begins by assi…
The paper tackles inverse uncertainty quantification in neutron noise analysis.
problem Uncertainty in estimating material properties from noisy neutron correlation measurements.
method Surrogate models and inverse uncertainty quantification to account for measurement error and model bias.
result Improved prediction of neutron correlations and quantification of uncertainties.
Machine learning helps create accurate models of neutron star postmerger signals.
problem Creating accurate postmerger waveforms for binary neutron stars is challenging due to theoretical uncertainties and limited numerical simulations.
method Used a conditional variational autoencoder (CVAE) to construct postmerger models based on numerical-relativity simulations.
result The CVAE can accurately generate postmerger waveforms and encode the neutron star equation of state.
Paper demonstrates triaxial strain tomography using neutron imaging.
problem Reconstructing full triaxial strain field from Bragg-edge neutron images.
method Gaussian process based approach ensuring equilibrium and boundary conditions.
result Validation of reconstruction through comparison with conventional strain scans and simulations.
New method reconstructs strain and lattice spacing from neutron data.
problem Jointly reconstructing strain and lattice spacing from neutron data.
method Solves non-linear problem ensuring strain field equilibrium with knowledge of boundary conditions.
result Demonstrates ability to jointly reconstruct strain and lattice spacing from simulated data.
Active learning improves neutron spectroscopy experiments by automating measurement selection.
problem Efficiently searching for signals in neutron scattering experiments with limited beam time.
method Probabilistic active learning using log-Gaussian processes.
result Automated selection of informative measurements improves experimental efficiency.
This paper applies reactor theory to supply chain management.
problem Maintaining optimal item delivery and collection ratios in supply chains.
method Translating neutron transport and diffusion theory to supply chain management, introducing analogy factors and interactors.
result A deterministic model for supply chain optimization.
ANNs predict SAFARI-1 neutron fluxes with uncertainties.
problem Uncertainty quantification in ANN predictions for SAFARI-1.
method Deep Neural Networks (DNNs) with Monte Carlo Dropout (MCD) and Bayesian Neural Networks (BNN VI) for uncertainty quantification.
result Uncertainty bands envelop noisy measurement data points, indicating good prediction and generalization.
The study uses DPGMM to analyze pulsar families in parameter space.
problem Classifying and understanding different types of pulsars.
method Unsupervised machine learning with Dirichlet process Gaussian mixture model (DPGMM).
result DPGMM provides insights into pulsar families and their relations.
Gravitational waves are predicted by the general theory of relativity. In [6] D. Christodoulou showed that gravitational waves have a nonlinear memory. We proved in [3] that the electromagnetic field contributes at highest order to the nonlinear memory effect of gravitational waves. In the present paper, we study this …
In X-ray binary star systems consisting of a compact object that accretes material from an orbiting secondary star, there is no straightforward means to decide if the compact object is a black hole or a neutron star. To assist this classification, we develop a Bayesian statistical model that makes use of the fact that …
The R-function theory of Thomas is used to model neutron inelastic scattering and the fine, intermediate, and gross structure observed in the Dow Jones Industrial Average on a typical trading day.
Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.
problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.
The main task in oil and gas exploration is to gain an understanding of the distribution and nature of rocks and fluids in the subsurface. Well logs are records of petro-physical data acquired along a borehole, providing direct information about what is in the subsurface. The data collected by logging wells can have si…
New method finds all thin film structures from reflectometry data.
problem Computational prohibitive for standard algorithms, leading to unreliable analysis.
method Prior-Amortized Neural Posterior Estimation (PANPE) combining simulation-based inference and adaptive priors.
result Identifies all realistic structures in seconds, setting new standards in reflectometry.
Accelerates pulsar light curve inference with learned representations and optimization.
problem Computational expense of Markov chain Monte Carlo methods for posterior inference.
method Combining U-Net latent representations with local simulator-guided optimization.
result 120x reduction in inference time (24 hours to 12 minutes) with accuracy preserved.
Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak static gravitational field limits, the paths are applied successfully to interpret…
New method uses SBI to infer magnetorotational properties of isolated pulsars.
problem Constrain magnetorotational properties of isolated Galactic radio pulsars.
method Combines population synthesis with SBI to model neutron star birth and evolution.
result Inferred μlogB=13.10−0.10+0.08, σlogB=0.45−0.05+0.05 for lognormal distributions. Evaluation of hydrocarbon reservoir requires classification of petrophysical properties from available dataset. However, characterization of reservoir attributes is difficult due to the nonlinear and heterogeneous nature of the subsurface physical properties. In this context, present study proposes a generalized one cl…
Stationary and axially symmetric space-times play an important role in astrophysics, particularly in the theory of neutron stars and black holes. The static vacuum sub-class of these space-times is known as Weyl's class, and contains the Schwarzschild space-time as its most prominent example. This paper is going to stu…
Study on AI-driven modeling for high burnup accident-tolerant fuels in SMRs.
problem Design and optimization of high burnup accident-tolerant fuels for SMRs.
method Artificial intelligence and multi-scale modeling (neutronics, thermal hydraulics, fuel performance).
result Demonstrated the effectiveness of AI in modeling and optimizing SMR fuels.
The paper describes the geometric properties of line congruences' singularities.
problem Understanding the singularities of generic line congruences.
method Use of an equiaffine pair to define generic line congruences.
result Geometric description of folds, cusps, and swallowtails as singularities of generic line congruences.
This paper generalizes the envelope of mid-lines to intermediate lines for a plane curve.
problem Understanding the envelope of intermediate lines for a plane curve.
method Using singularity theory techniques to analyze the local behavior of the envelope of intermediate lines.
result The envelope of intermediate lines (EIL) is formed by three disconnected sets: AEIL, the curve itself, and IPTL. Topology of space line arrangements depends on line count and multiple points.
problem Understanding the topology of space line arrangements.
method Determined by the number of lines and data on multiple points.
result Topology of complements is determined by line count and multiple points.
Study restricts line arrangements with odd points using topological arguments.
problem Restrictions on line arrangements with singular points of odd multiplicity.
method Topological arguments on locally-flat spheres in 4-manifolds.
result No line arrangement with 13 lines and only triple points exists.
A special group of transformations of the real line cannot act effectively on it.
problem Understanding the limitations of transformations on the real line.
method Analyzing the group of orientation-preserving quasi-isometries of the real line.
result The group of quasi-isometries of the real line cannot act effectively on the line.
Study Blaschke's asymptotic lines on surfaces in 3D space.
problem Characterize Blaschke's asymptotic lines on surfaces in 3D.
method Analyze binary differential equations near cusp and umbilic points.
result Describe Blaschke's asymptotic lines near Euclidean parabolic set.
Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.
problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.
Characterizes winding of braided vector fields in tubular domains.
problem Understanding the topology of braided vector fields in complex domains.
method Defines field line winding as a measure of entanglement, proving its uniqueness in classifying vector field topology.
result Field line winding uniquely classifies the topology of braided vector fields.
Classifies metric lines in Engel-type groups, a step towards solving sub-Riemannian manifold problems.
problem Classifying metric lines in Engel-type groups.
method Sequence method to study metric lines in jet space.
result Classified metric lines of Engel-type groups $\Eng(n)$.
New Calabi-Yau metrics with conical singularities are created near complex lines.
problem Creating Calabi-Yau metrics with conical singularities near complex lines.
method Using branched covering arguments to construct metrics with conical singularities.
result Calabi-Yau metrics with unstable conical singularities are successfully created.
A line arrangement of 3n lines in CP2 satisfies Hirzebruch property if each line intersect others in n+1 points. Hirzebruch asked if all such arrangements are related to finite complex reflection groups. We give a positive answer to this question in the case when the line arrangement in CP2 is…
The paper examines asymptotic lines of plane fields in 3D space.
problem Qualitative properties of asymptotic lines in plane fields.
method Analysis of null directions and Gaussian curvature.
result Asymptotic lines coincide with classical ones in completely integrable fields.
The paper explores reflection principles for lightlike line segments on maximal surfaces.
problem Reflection property does not hold for lightlike line segments on maximal surfaces.
method Analyzes reflection properties for lightlike line segments connecting shrinking singularities.
result Shows a kind of reflection principle for lightlike line segments on maximal surfaces.
This paper studies topological properties of line arrangements in complex projective plane.
problem Understanding the topology of line arrangements in complex projective plane.
method Established foundational results using homological methods to compute cohomology rings and studied homotopy types.
result Complement of a symplectic line arrangement has the homotopy type of a minimal CW complex.
Circular nets with spherical parameter lines have geometric properties related to Darboux cyclides and terminating Laplace sequences.
problem Discretizing surfaces with spherical curvature lines.
method Lie-geometric discretisation in terms of principal contact element nets.
result Circular nets with two families of spherical parameter lines are related to Darboux cyclides.
The paper explores graphons of line graphs from sparse finite graphs.
problem Estimating graph limits from sparse finite graphs.
method Mapping finite graphs to their line graphs and analyzing graphs with the square-degree property.
result Graphons of line graphs can distinguish between sparse graphs like star graphs and superlinear preferential attachment graphs.
Estimates cohomology dimensions for Nakano q-semipositive line bundles.
problem Estimating cohomology dimensions for Nakano q-semipositive line bundles.
method Asymptotic estimates for high tensor powers of semipositive line bundles over q-convex manifolds and various complex manifolds.
result Optimal order estimates for cohomology dimensions.
New method describes entanglement of straight lines in 3D space.
problem Tackles the geometry and topology of configurations of straight lines.
method Introduces direction matrices and a discrete motion principle.
result Shows n-crosses as links of pairwise connected unknots.
Study affine curvature lines on surfaces in 3D space.
problem Understanding the behavior of affine curvature lines on surfaces.
method Analyzing binary differential equations and topological models.
result Obtained topological models and generic behavior of affine curvature lines.
Shows CM line bundles are ample on K-stable varieties.
problem Ensuring CM line bundles are ample on K-stable varieties.
method Analyzes CM line bundles on K-stable varieties and their families.
result CM line bundles are ample on K-stable varieties with maximal variation.
Study proves Hodge symmetry on Oeljeklaus-Toma manifolds with line bundles.
problem Hodge symmetry on complex manifolds with line bundles.
method Analyzes Dolbeault cohomology of Oeljeklaus-Toma manifolds with holomorphic line bundles.
result Proves Hodge symmetry and vanishing/non-vanishing of Dolbeault cohomology.
We define a pseudo-inverse for line graphs using linear integer programming.
problem Not all graphs have a corresponding root graph, making the line graph operation non-invertible.
method Propose a linear integer program to edit the smallest number of edges in the line graph to recover a root graph.
result The pseudo-inverse operation is well-behaved and works in practice as shown by empirical experiments.
The paper finds two types of metric lines in curve spaces.
problem Classifying metric lines in jet spaces of curves.
method Established the existence of two families of metric lines in the 2-jet space of plane curves.
result Found precise criteria for identifying metric lines in sub-Riemannian geodesics.
We explain the bundle structures of the {\it Determinant line bundle} and the {\it Quillen determinant line bundle} considered on the connected component of the space of Fredholm operators including the identity operator in an intrinsic way. Then we show that these two are isomorphic and that they are non-trivial line …