Numerical Analysis and Computation Commons^™

Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)

Library Philosophy and Practice (e-journal)

Abstract

Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …

Computational Modelling Enables Robust Multidimensional Nanoscopy, Matthew D. Lew

Electrical & Systems Engineering Publications and Presentations

The following sections are included:

• Present State of Computational Modelling in Fluorescence Nanoscopy

• Recent Contributions to Computational Modelling in Fluorescence Nanoscopy

• Outlook on Computational Modelling in Fluorescence Nanoscopy

• Acknowledgments

• References

A Computationally-Efficient Bound For The Variance Of Measuring The Orientation Of Single Molecules, Tingting Wu, Tianben Ding, Hesam Mazidi, Oumeng Zhang, Matthew D. Lew

Electrical & Systems Engineering Publications and Presentations

Modulating the polarization of excitation light, resolving the polarization of emitted fluorescence, and point spread function (PSF) engineering have been widely leveraged for measuring the orientation of single molecules. Typically, the performance of these techniques is optimized and quantified using the Cramér-Rao bound (CRB), which describes the best possible measurement variance of an unbiased estimator. However, CRB is a local measure and requires exhaustive sampling across the measurement space to fully characterize measurement precision. We develop a global variance upper bound (VUB) for fast quantification and comparison of orientation measurement techniques. Our VUB tightly bounds the diagonal elements of the …

Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera

Publications

In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.

Efficient Thermal Image Segmentation Through Integration Of Nonlinear Enhancement With Unsupervised Active Contour Model, Fatema Albalooshi, Evan Krieger, Paheding Sidike, Vijayan K. Asari

Electrical and Computer Engineering Faculty Publications

Thermal images are exploited in many areas of pattern recognition applications. Infrared thermal image segmentation can be used for object detection by extracting regions of abnormal temperatures. However, the lack of texture and color information, low signal-to-noise ratio, and blurring effect of thermal images make segmenting infrared heat patterns a challenging task. Furthermore, many segmentation methods that are used in visible imagery may not be suitable for segmenting thermal imagery mainly due to their dissimilar intensity distributions.

Thus, a new method is proposed to improve the performance of image segmentation in thermal imagery. The proposed scheme efficiently utilizes nonlinear intensity …

A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky

Publications

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having O(n2) complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we …

Reformulation Of The Muffin-Tin Problem In Electronic Structure Calculations Within The Feast Framework, Alan R. Levin

Masters Theses 1911 - February 2014

This thesis describes an accurate and scalable computational method designed to perform nanoelectronic structure calculations. Built around the FEAST framework, this method directly addresses the nonlinear eigenvalue problem. The new approach allows us to bypass traditional approximation techniques typically used for first-principle calculations. As a result, this method is able to take advantage of standard muffin-tin type domain decomposition techniques without being hindered by their perceived limitations. In addition to increased accuracy, this method also has the potential to take advantage of parallel processing for increased scalability.

The Introduction presents the motivation behind the proposed method and gives an overview …

Electrostatic Positioning Of Droplets In Turbulent Flows (Lstm 375/Te/93), Nihad E. Daidzic, Adrian Melling

Aviation Department Publications

Report LSTM 375/TE/93, Lehrstuhl fuer Stroemungsmechanik Universitaet Erlangen-Nuernberg Cauerstr. 4, 8520 Erlangen Germany.