Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. حسب Tehnan I. A. Mohamed (16846175)

A Practical Algorithm to Solve the Near-Congruence Problem for Rigid Molecules and Clusters حسب José Manuel Vásquez-Pérez (12843737)

"…The algorithm is formulated as a quasi-local optimization procedure with each optimization step involving a linear assignment (LAP) and a singular value decomposition (SVD). …"

Using Variable Data-Independent Acquisition for Capillary Electrophoresis-Based Untargeted Metabolomics حسب Saki Kiuchi (19374255)

"…Capillary electrophoresis coupled with tandem mass spectrometry (CE-MS/MS) offers advantages in peak capacity and sensitivity for metabolic profiling owing to the electroosmotic flow-based separation. However, the utilization of data-independent MS/MS acquisition (DIA) is restricted due to the absence of an optimal procedure for analytical chemistry and its related informatics framework. …"

Using Variable Data-Independent Acquisition for Capillary Electrophoresis-Based Untargeted Metabolomics حسب Saki Kiuchi (19374255)

"…Capillary electrophoresis coupled with tandem mass spectrometry (CE-MS/MS) offers advantages in peak capacity and sensitivity for metabolic profiling owing to the electroosmotic flow-based separation. However, the utilization of data-independent MS/MS acquisition (DIA) is restricted due to the absence of an optimal procedure for analytical chemistry and its related informatics framework. …"

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment حسب Jianfang Cao (1881379)

"…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …"

Sample image for illustration. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Quadratic polynomial in 2D image plane. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Comparison analysis of computation time. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Process flow diagram of CBFD. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Precision recall curve. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

LinearSolve.jl: because A\b is not good enough حسب Christopher Rackauckas (9197216)

"…What a great time for the SciML ecosystem to swoop in! This leads us to LinearSolve.jl, a common interface for linear solver libraries. …"

Fortran & C++: design fractal-type optical diffractive element حسب I-Lin Ho (13768960)

"…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …"

ECE6327_SmartGrid حسب Xingpeng Li (11825663)

Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf حسب Cecilia Lindig-León (7889777)

"…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …"

Predictive Analysis of Mushroom Toxicity Based Exclusively on Their Natural Habitat. حسب Enrico Bertozzi (22461709)

"…Optimization with GridSearchCV corroborated this stagnation, identifying a simple linear model (C=0.05, gamma='scale') as the optimal configuration, indicating that the additional complexity of nonlinear kernels did not confer predictive gains. …"

Thesis-RAMIS-Figs_Slides حسب Felipe Santibañez-Leal (10967991)

"…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…"

Supporting data for "clinical-oriented surgical planning based on finite element method and automate-generated surgical templates assisting the spinal surgery" حسب Tianchi Wu (11062323)

"…The offset algorithm was developed with normal vector of vertices and iterative bisection, outputting a solid layer of elements based on input triangle mesh and was validated against non-linear surface in vertebra body. …"

hIPPYlib: An Extensible Software Framework for Large-scale Inverse Problems حسب Olalekan A. Babaniyi (767286)

"…This Gaussian approximation is exact when the parameter-to-observable map is linear; otherwise it can serve as a proposal for Hessian-based MCMC methods. …"

Collaborative Research: SI2-SSI: ELSI-Infrastructure for Scalable Electronic Structure Theory حسب Volker Blum (3683170)

"…The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. …"

Collaborative Research: SI2-SSI: ELSI - Infrastructure for Scalable Electronic Structure Theory حسب Volker Blum (3683170)

"…The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. …"