Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

Optimization

Computer Sciences

Electronic Theses and Dissertations

Articles 1 - 7 of 7

Full-Text Articles in Physical Sciences and Mathematics

Novel Approach For Non-Invasive Prediction Of Body Shape And Habitus, Emma Young Jun 2023

Novel Approach For Non-Invasive Prediction Of Body Shape And Habitus, Emma Young

Electronic Theses and Dissertations

While marker-based motion capture remains the gold standard in measuring human movement, accuracy is influenced by soft-tissue artifacts, particularly for subjects with high body mass index (BMI) where markers are not placed close to the underlying bone. Obesity influences joint loads and motion patterns, and BMI may not be sufficient to capture the distribution of a subject’s weight or to differentiate differences between subjects. Subjects in need of a joint replacement are more likely to have mobility issues or pain, which prevents exercise. Obesity also increases the likelihood of needing a total joint replacement. Accurate movement data for subjects with …


Multi-Agent Pathfinding In Mixed Discrete-Continuous Time And Space, Thayne T. Walker Jan 2022

Multi-Agent Pathfinding In Mixed Discrete-Continuous Time And Space, Thayne T. Walker

Electronic Theses and Dissertations

In the multi-agent pathfinding (MAPF) problem, agents must move from their current locations to their individual destinations while avoiding collisions. Ideally, agents move to their destinations as quickly and efficiently as possible. MAPF has many real-world applications such as navigation, warehouse automation, package delivery and games. Coordination of agents is necessary in order to avoid conflicts, however, it can be very computationally expensive to find mutually conflict-free paths for multiple agents – especially as the number of agents is increased. Existing state-ofthe- art algorithms have been focused on simplified problems on grids where agents have no shape or volume, and …


Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3d Indoor Monitoring, Tisha Lafaye Brown Jan 2017

Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3d Indoor Monitoring, Tisha Lafaye Brown

Electronic Theses and Dissertations

As a result of extensive research over the past decade or so, wireless sensor networks (wsns) have evolved into a well established technology for industry, environmental and medical applications. However, traditional wsns employ such sensors as thermal or photo light resistors that are often modeled with simple omni-directional sensing ranges, which focus only on scalar data within the sensing environment. In contrast, the sensing range of a wireless video sensor is directional and capable of providing more detailed video information about the sensing field. Additionally, with the introduction of modern features in non-fixed focus cameras such as the pan, tilt …


Genetic Algorithm For University Course Timetabling Problem, Achini Kumari Herath Jan 2017

Genetic Algorithm For University Course Timetabling Problem, Achini Kumari Herath

Electronic Theses and Dissertations

Creating timetables for institutes which deal with transport, sport, workforce, courses, examination schedules, and healthcare scheduling is a complex problem. It is difficult and time consuming to solve due to many constraints. Depending on whether the constraints are essential or desirable they are categorized as ‘hard’ and ‘soft’, respectively. Two types of timetables, namely, course and examination are designed for academic institutes. A feasible course timetable could be described as a plan for the movement of students and staff from one classroom to another, without conflicts. Being an NP-complete problem, many attempts have been made using varying computational methods to …


Optimizing Vehicle Usage Using Csp, Sat And Max-Sat, Raheem T. Al Rammahi Jan 2016

Optimizing Vehicle Usage Using Csp, Sat And Max-Sat, Raheem T. Al Rammahi

Electronic Theses and Dissertations

Most of the companies in Iraq spend significant amounts of time and money when transferring employees between home and work. In this thesis, we model the problem of the Dhi Qar Oil company (DQOC) transportations using three modeling languages from AI: Constraint Programing (CP), Boolean Satisfiability (SAT), and Maximum Satisfiability (MAX-SAT). We then use solvers to find optimal solutions to this problem.

We show which of these solvers is more efficient when finding optimal solutions. For this purpose, we create a test suite of 360 problems to test these solvers. All solvers are applied to these problems and the final …


Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam Jan 2012

Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam

Electronic Theses and Dissertations

Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called "smart vehicles") are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other …


A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil Jan 2012

A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil

Electronic Theses and Dissertations

The modern view of optimization is that optimization algorithms are not designed in a vacuum, but can make use of information regarding the broad class of objective functions from which a problem instance is drawn. Using this knowledge, we want to design optimization algorithms that execute quickly (efficiency), solve the objective function with minimal samples (performance), and are applicable over a wide range of problems (abstraction). However, we present a new theory for blackbox optimization from which, we conclude that of these three desired characteristics, only two can be maximized by any algorithm. We put forward an alternate view of …