Computational Methods and Modeling for Engineering Applications (GENG 8030) is a foundational graduate course in the Master of Engineering (MEng) program at the University of Windsor. This course ...
This paper proposes a family of line-search methods to deal with weighted orthogonal procrustes problems. In particular, the proposed family uses a search direction based on a convex combination ...
1 Laboratory of Computer Engineering, Data Science and Artificial Intelligence, National Higher Polytechnic School of Douala, University of Douala, Douala, Cameroon. 2 Laboratory of Electronics, ...
We demonstrate that a neural network automatically solves, explains, and generates university-level problems from the largest Massachusetts Institute of Technology (MIT) mathematics courses at a human ...
Time-delay stability (TDS) analysis is a method for quantifying interactions in multivariate systems by identifying stable temporal relationships in time series data [1]. This method has been used to ...
The Locally Competitive Algorithm (LCA) is a biologically plausible computational architecture for sparse coding, where a signal is represented as a linear combination of elements from an ...
In undergraduate physical chemistry, Schrödinger’s equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with ...
1 Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt. 2 Department of Mathematics and Statistics, College of Science, Al-Imam Mohammad Ibn Saud Islamic University (IMSIU), ...
In this article we describe a method that works to recover a parametrization for data lying on a manifold that is locally isometric to an open, connected subset Θ of Euclidean space ℝ d. Because this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results