-
43961
-
43962
-
43963
Towards measuring attention allocation in model-based engineering teamwork
Published 2021Get full text
Thesis -
43964
Computationally Efficient Optimization of Formation Flying Trajectories, with Solar Radiation Pressure, near Lagrange Points
Published 2024“…Since the restricted three-body problem has no closed-form solutions, schedulers focused on high-level mission trajectory designs must iteratively numerically solve the equations of motion for the telescope and starshade, which can quickly become computationally inefficient. …”
Get full text
Thesis -
43965
Advances in Computer-Assisted Design and Analysis of First-Order Optimization Methods and Related Problems
Published 2024“…These methods have become the main workhorses for modern large-scale optimization and machine learning due to their low iteration costs, minimal memory requirements, and dimension-independent convergence guarantees. …”
Get full text
Get full text
Thesis -
43966
-
43967
-
43968
-
43969
-
43970
-
43971
-
43972
Improvements in magnetic resonance imaging excitation pulse design
Published 2009Get full text
Thesis -
43973
-
43974
-
43975
Mapping of complex marine environments using an unmanned surface craft
Published 2012Get full text
Thesis -
43976
-
43977
MCODE, Version 2.2: An MCNP-ORIGEN DEpletion Program
Published 2012“…The default depletion option is constant power depletion. Meanwhile, an iterative robust flux depletion scheme is available. …”
Get full text
Technical Report -
43978
Bayesian-based simulation model validation for spacecraft thermal systems
Published 2015Get full text
Thesis -
43979
Smart three-dimensional machine vision
Published 2019“…With learning methods, the sample's shape can be reconstructed by computer without intensive iteration. Finally, an aluminum sample inspection results are shown to prove the performances of the proposed system scheme. …”
Get full text
Get full text
Thesis -
43980
Graph analysis techniques and applications to bitcoin forensics
Published 2019“…Based on the latter variant of (Markov) entropic centrality model, we next design a 2-stage clustering algorithm, which in the first stage is informed by the entropic centrality to detect local communities based on random walks, and then performs a bottom-up iterative aggregation. We furthermore explore graph clustering by using an entropic distance based approach as an alternative to distribution of flow based approach as described above. …”
Get full text
Get full text
Get full text
Thesis