Computational Engineering Commons^™

Algorithms For Assessing Soil Salinity Levels Based On Remote Sensing Imagery, Bobomurod Mamitjonovich Tojiboev

Chemical Technology, Control and Management

This article investigates methods for assessing soil salinity levels based on satellite (remote sensing) imagery and their calculation algorithms. Determining the degree of salinity plays a crucial role in the rational use of land resources and increasing agricultural efficiency. The study analyzes indices for determining soil salt content using remote sensing technologies, particularly multispectral images obtained from satellite systems such as Landsat and Sentinel (for example, SI - Salinity Index, NDVI - Normalized Difference Vegetation Index, and others). Furthermore, algorithms are developed based on these indices that enable automatic determination of salinity assessments. Artificial intelligence, machine learning, and geographic information …

A Data-Driven Approach To Smart Shopping: Optimizing Grocery Trips Using Geolocation And Store Inventory Data, Kien T. Giang

Honors Theses

This project presents a data-driven web-based application, Smart Shopping, designed to help customers optimize their grocery purchases based on location and store inventory information. The application allows users to add items to a shopping list and either enter an address or use their browser’s location services to identify nearby stores. It then retrieves product availability and prices from a mock database representing stores at user’s selected locations. The program compares prices across stores to provide users with two optimized options: the cheapest shopping bill from a single store, and the lowest individual item prices across multiple stores. Additionally, the …

Contextual Augmentation In Artificial Intelligence, Emmanuel Joshua Balogun

College of Graduate Studies: Theses & Dissertations

Contextual understanding is a significant challenge of Large Language Models (LLMs), which are typically trained on general-purpose datasets. Due to this, LLMs fail to capture nuanced or domain-specific information and may struggle to interpret user queries accurately. Consequently, prompt engineering can become complex in automating, and LLMs are prone to “hallucinating”—generating random or irrelevant texts—when they lack sufficient context. This undermines their ability to provide focused, accurate responses. Accordingly, this thesis seeks to enhance the contextual understanding capabilities of Artificial Intelligence systems to facilitate more precise and relevant answer generation. Study A looks into a new approach to combating misinformation …

Finding The Shortest Path Using Dijkstra’S Algorithm, Orit D. Gruber, Deborah Sturm

Open Educational Resources

This lab experiment explores an algorithm which is used to find the shortest path between two or more locations. After completing the lab, you will be able to answer the following questions in the final lab report:

1. What is an Algorithm?
2. What is a Graph ?
3. What is the purpose and operation of Dijkstra’s Algorithm ?

Comparative Analysis Of Fullstack Development Technologies: Frontend, Backend And Database, Qozeem Odeniran

College of Graduate Studies: Theses & Dissertations

Accessing websites with various devices has brought changes in the field of application development. The choice of cross-platform, reusable frameworks is very crucial in this era. This thesis embarks in the evaluation of front-end, back-end, and database technologies to address the status quo. Study-a explores front-end development, focusing on angular.js and react.js. Using these frameworks, comparative web applications were created and evaluated locally. Important insights were obtained through benchmark tests, lighthouse metrics, and architectural evaluations. React.js proves to be a performance leader in spite of the possible influence of a virtual machine, opening the door for additional research. Study b …

Phonetic Algorithm Performance, Aaron Schneidereit

Senior Honors Projects

AARON SCHNEIDEREIT (Computer Science BS) Phonetic Algorithm Performance Sponsors: Noah Daniels (Computer Science and Statistics) Phonetic Algorithms are used for classifying words based on their pronunciation. These algorithms are used in many text-to-speech technologies and spell-checkers to ensure that a word can be correctly recognized despite minor spelling/pronunciation errors. The process of encoding a word to its phonetic surname is known as Phonetic Matching. Since 1918, there have only been a handful of phonetic algorithms that have been created. The main three algorithms that other phonetic algorithms are built from are Soundex, New York State Identification and Intelligence System (NYSIIS), …

Recipe For Disaster, Zac Travis

MFA Thesis Exhibit Catalogs

Today’s rapid advances in algorithmic processes are creating and generating predictions through common applications, including speech recognition, natural language (text) generation, search engine prediction, social media personalization, and product recommendations. These algorithmic processes rapidly sort through streams of computational calculations and personal digital footprints to predict, make decisions, translate, and attempt to mimic human cognitive function as closely as possible. This is known as machine learning.

The project Recipe for Disaster was developed by exploring automation in technology, specifically through the use of machine learning and recurrent neural networks. These algorithmic models feed on large amounts of data as a …

Lattice Quantum Algorithm For The Schrodinger Wave Equation In 2+1 Dimensions With A Demonstration By Modeling Soliton Instabilities, Jeffrey Yepez, George Vahala, Linda L. Vahala

Electrical & Computer Engineering Faculty Publications

A lattice-based quantum algorithm is presented to model the non-linear Schrödinger-like equations in 2 + 1 dimensions. In this lattice-based model, using only 2 qubits per node, a sequence of unitary collide (qubit-qubit interaction) and stream (qubit translation) operators locally evolve a discrete field of probability amplitudes that in the long-wavelength limit accurately approximates a non-relativistic scalar wave function. The collision operator locally entangles pairs of qubits followed by a streaming operator that spreads the entanglement throughout the two dimensional lattice. The quantum algorithmic scheme employs a non-linear potential that is proportional to the moduli square of the wave function. …

Variable Step Size Lms Adaptive Filters With Delayed Coefficient Updating, Guixian Xu

Electrical & Computer Engineering Theses & Dissertations

A new approach to delayed LMS adaptive filtering is presented, which uses a variable step size for coefficient updating to increase convergence speed and improve tracking characteristics. The new algorithm, called delayed variable step size LMS (DVLMS), is explained, analyzed, and simulated to experimentally determine performance characteristics. Three different strategies for adjusting the step size are examined, and their performance is compared. Also, simulation results are presented to show that the proposed DVLMS systems provide faster convergence and lower mis-adjustment than previously proposed DLMS systems.

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).