Structural and surface property characterization of titanium dioxide nanotubes for orthopedic implants

This research focused on the to modification of the surface structure of titanium implants with nanostructured morphology of TiO2 nanotubes and studied the interaction of nanotubes with osteoblast cells to understand the parameters that affect the cell growth. The electrical, mechanical, and structural properties of TiO2 nanotubes were characterized to establish a better understanding on the properties of such nanoscale morphological structures. To achieve the objectives of this research work I transformed the titanium and its alloys, either in bulk sheet form, bulk machined form, or thin film deposited on another substrate into a surface of titania nanotubes using a low cost and environmentally friendly process. The process requires only a simple electrolyte, low cost electrode, and a DC power supply. With this simple approach of scalable nanofabrication, a typical result is nanotubes that are each approximately 100nm in diameter and have a wall thickness of about 20nm. By changing the fabrication parameters, independent nanotubes can be fabricated with open volume between them. Titanium in this form is termed onedimensional since electron transport is narrowly confined along the length of the nanotube. My Ph.D. accomplishments have successfully shown that osteoblast cells, the cells that are the precursors to bone, have a strong tendency to attach to the inside and outside of the titanium nanotubes onto which they are grown using their filopodia – cell’s foot used for locomotion – anchored to titanium nanotubes. In fact it was shown that the cell prefers to find many anchoring sites. These sites are critical for cell locomotion during the first several weeks of maturity and upon calcification as a strongly anchored bone cell. In addition I have shown that such a surface has a greater cell density than a smooth titanium surface. My work also developed a process that uses a focused and controllably rastered ion beam as a nano-scalpel to cut away sections of the osteoblast cells to probe the attachment beneath the main cell body. Ultimately the more rapid growth of osteoblasts, coupled with a stronger cell-surface interface, could provide cost reduction, shorter rehabilitation, and fewer follow-on surgeries due to implant loosening.

A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS

Heuristic optimization algorithms are of great importance for reaching solutions to various real world problems. These algorithms have a wide range of applications such as cost reduction, artificial intelligence, and medicine. By the term cost, one could imply that that cost is associated with, for instance, the value of a function of several independent variables. Often, when dealing with engineering problems, we want to minimize the value of a function in order to achieve an optimum, or to maximize another parameter which increases with a decrease in the cost (the value of this function). The heuristic cost reduction algorithms work by finding the optimum values of the independent variables for which the value of the function (the “cost”) is the minimum. There is an abundance of heuristic cost reduction algorithms to choose from. We will start with a discussion of various optimization algorithms such as Memetic algorithms, force-directed placement, and evolution-based algorithms. Following this initial discussion, we will take up the working of three algorithms and implement the same in MATLAB. The focus of this report is to provide detailed information on the working of three different heuristic optimization algorithms, and conclude with a comparative study on the performance of these algorithms when implemented in MATLAB. In this report, the three algorithms we will take in to consideration will be the non-adaptive simulated annealing algorithm, the adaptive simulated annealing algorithm, and random restart hill climbing algorithm. The algorithms are heuristic in nature, that is, the solution these achieve may not be the best of all the solutions but provide a means to reach a quick solution that may be a reasonably good solution without taking an indefinite time to implement.

A Cost Analysis Of Carbon Dioxide Emission Reduction Strategies For New Plants In Michigan's Electric Power Sector

This thesis attempts to find the least-cost strategy to reduce CO2 emission by replacing coal by other energy sources for electricity generation in the context of the proposed EPA’s regulation on CO2 emissions from existing coal-fired power plants. An ARIMA model is built to forecast coal consumption for electricity generation and its CO2 emissions in Michigan from 2016 to 2020. CO2 emission reduction costs are calculated under three emission reduction scenarios- reduction to 17%, 30% and 50% below the 2005 emission level. The impacts of Production Tax Credit (PTC) and the intermittency of renewable energy are also discussed. The results indicate that in most cases natural gas will be the best alternative to coal for electricity generation to realize CO2 reduction goals; if the PTC for wind power will continue after 2015, a natural gas and wind combination approach could be the best strategy based on the least-cost criterion.

Computational fluids domain reduction to a simplified fluid network

The primary goal of this project is to demonstrate the practical use of data mining algorithms to cluster a solved steady-state computational fluids simulation (CFD) flow domain into a simplified lumped-parameter network. A commercial-quality code, “cfdMine” was created using a volume-weighted k-means clustering that that can accomplish the clustering of a 20 million cell CFD domain on a single CPU in several hours or less. Additionally agglomeration and k-means Mahalanobis were added as optional post-processing steps to further enhance the separation of the clusters. The resultant nodal network is considered a reduced-order model and can be solved transiently at a very minimal computational cost. The reduced order network is then instantiated in the commercial thermal solver MuSES to perform transient conjugate heat transfer using convection predicted using a lumped network (based on steady-state CFD). When inserting the lumped nodal network into a MuSES model, the potential for developing a “localized heat transfer coefficient” is shown to be an improvement over existing techniques. Also, it was found that the use of the clustering created a new flow visualization technique. Finally, fixing clusters near equipment newly demonstrates a capability to track temperatures near specific objects (such as equipment in vehicles).

Sediment yield reduction in an agricultural watershed

With proper application of Best Management Practices (BMPs), the impact from the sediment to the water bodies could be minimized. However, finding the optimal allocation of BMP can be difficult, since there are numerous possible options. Also, economics plays an important role in BMP affordability and, therefore, the number of BMPs able to be placed in a given budget year. In this study, two methodologies are presented to determine the optimal cost-effective BMP allocation, by coupling a watershed-level model, Soil and Water Assessment Tool (SWAT), with two different methods, targeting and a multi-objective genetic algorithm (Non-dominated Sorting Genetic Algorithm II, NSGA-II). For demonstration, these two methodologies were applied to an agriculture-dominant watershed located in Lower Michigan to find the optimal allocation of filter strips and grassed waterways. For targeting, three different criteria were investigated for sediment yield minimization, during the process of which it was found that the grassed waterways near the watershed outlet reduced the watershed outlet sediment yield the most under this study condition, and cost minimization was also included as a second objective during the cost-effective BMP allocation selection. NSGA-II was used to find the optimal BMP allocation for both sediment yield reduction and cost minimization. By comparing the results and computational time of both methodologies, targeting was determined to be a better method for finding optimal cost-effective BMP allocation under this study condition, since it provided more than 13 times the amount of solutions with better fitness for the objective functions while using less than one eighth of the SWAT computational time than the NSGA-II with 150 generations did.