Computational Engineering Commons^™

Problem Solving / Javascript Programming, Sarah Zelikovitz, Orit D. Gruber

Open Educational Resources

This Lab Experiment focuses on JavaScript Programming. Upon completing the lab, you will be able to understand the following:

· The definition of Algorithmic Problem Solving.

· The role of JavaScript in web pages.

· The concept of Iteration in computer programming.

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 ?

Development And Simulation Of A Damage Assessment And Recovery Method For Critical Database Systems, Anthony Pham

Computer Science and Computer Engineering Undergraduate Honors Theses

With how much the world relies on technology and the critical database infrastructure that supports it, the infrastructures require efficient methods to detect and resolve suspicious database transactions, whether malicious or not. This paper focuses on an algorithm that detects and resolves malicious transactions in a database. The process begins with identifying suspicious transactions based on common patterns. When a transaction is flagged, the algorithm segments groups of suspicious transactions in separate log files, separating them for easy access. Within these segments, any dependent transactions that use data affected by the suspicious transactions will be stored there. After the transaction …

Smart System For Wheat Diseases Early Detection, Rustam Baratov, Himola Sunnatillayeva, Almardon Mamatovich Mustafoqulov

Chemical Technology, Control and Management

This paper presents a smart system for early detection of wheat plant diseases in the vegetation period. The proposed smart system allows detecting three types of wheat diseases, particularly yellow rust, powdery mildew and septoria at early stage and significantly improves the soil and ecology by locally spraying harmful chemicals just to sickness plants. The proposed diagnostic program is created in the C++ programming language. The basic structure of the smart system consists of Raspberry PI 4 MODULE, Logitech HD Pro Webcam C920, buzzer, HC-SR04 distance sensor, DC motor driver, AC motor, power supply, relay and some digital devices.

A New Heuristic Algorithm For Accuracy And Computational Efficiency For Solving Minimum Cost Flow Problems, Timothy Michael Chávez

Computational Modeling & Simulation Engineering Theses & Dissertations

While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort has been devoted to explaining the algorithms for identifying loop formation and computing the θ value needed to solve MCF network problems. This paper proposes efficient numerical procedures and MATLAB computer implementation for computing the θ value. Furthermore, this paper also proposes a mixed heuristic, shortest path (SP) Chavez-Nguyen (or Chayen) Algorithm in Phase 1 (to obtain the basic feasible solution) and, either the conventional MCF or MATLAB’s built-in Linprog() function, in Phase 2 (to obtain the …

Blokus Game Solver, Chin Chao

Computer Engineering

Blokus (officially pronounced as “Block us”) is an abstract strategy board game with transparent Tetris-shaped, color pieces that players are trying to place onto the board. However, the players can only place a piece that touches at least one corner of their own pieces on the board. The ultimate goal of the game is to place as many pieces onto the board as a player can while blocking off the opponent’s ability to place more pieces onto the board. Each player has pieces with different shapes and sizes that can be placed onto the board, where each block within a …

Cooking Up The Optimal Baking Algorithm, Tony Burand, Michael Tetzlaff, Jacob Smith

Math and Computer Science Student Works

Many conventional rectangular baking pans have a problem in that they bake the corners of the batter faster than the rest of the pan. Circular baking pans eliminate this problem, but take up more space in the oven. We propose a solution that given weights for baking consistency and space efficiency based on the importance of each will provide the optimal baking pan shape. We have come up with an algorithm for sorting the pans of area A effectively and formed a model that describes the heat flow into the pan as well as the baking mix itself. The model …