|Project Name||Project Program||Team Lead Name||Team Lead E-mail||Briefly describe your project|
|Scale Dependent Dynamic Alignment||Space Sciences||Karly lorenzini||Klorenzini2016@my.fit.edu||Investigate the dependence of solar wind velocity with respect to local mean magnetic fields.|
|Implementation of Immersed Boundary Method to solve swimmer/fluid interactions common in Biological Systems||Mathematical Sciences||Bindi Mahesh Nagdafirstname.lastname@example.org||This is a math research poster presentation that involves implementing numerical methods in order to solve the complex fluid dynamics equations involved during swimmer (or microbe) interaction with a Low Reynold's number two-phase fluid. The immersed boundary framework is applied as the numerical scheme and implemented using GMRES in PetsC software. Results are presented in the form of graphs to show the effect of changing fluid elasticity and swimming stroke (i.e. kicker or burrower motion) on the swimming speed of the microorganism.|
|Identification of Style-Markers and Composer Attribution in Classical Music||Mathematical Sciences||Shelley Mitchellemail@example.com||Stylometry is the quantitative study of literary style. It is based on the|
observation that authors tend to write in relatively consistent, recognizable and unique ways. In this project we investigate the current approaches in stylometric analysis and apply machine learning methodology to identify style-markers and composer attribution in classical music.
|An Efficient Genetic Algorithm and User-Friendly Software to Solve the Traveling Salesman Problem||Mathematical Sciences||Paul Arbicfirstname.lastname@example.org||The Traveling Salesman Problem (TSP) introduced in the 18th century by Hamilton is one of the most intensively studied NP-complete problems. TSP can be applied to various real-world problems such as routing, drilling of printed circuit boards, overhauling gas turbine engines, transportation and telecommunication networks. Since the problem is of practical importance and computationally challenging several research efforts are channeled to the area of developing efficient and effective techniques for its solution. These methods vary from most efficient but less effective greedy-type heuristics to more sophisticated algorithmic approaches including genetic algorithms inspired by Darwin’s theory of natural evolution.|
|Mapping Genetic Sequences – Theory & Application||Mathematical Sciences||Gyorgy Haloemail@example.com||A reliable and traceable method based on linear algebra to compare and contrast genomic sequences was developed by Randić et al. (2000). His mapping technique stores exons of the genomic map in a matrix to represent the nucleic acid bases by their totality. In this research we adopt Randić et al.'s approach and apply it to full mitochondrial genome of the Human Neuroblastoma Cell Line 751-NA to compare a cancerous genotype sequence with a noncancerous genotype sequence. The mapping technique proposed by Randić et al. (2000) is a valuable tool to compare large sets of DNA sequences together. Genetic analysis techniques could be made easily with a superimposed DNA graph so any mismatches between any two DNA sequences could immediately be recognized. Either comparing different species genomic sequences with same function, or comparing a disease causing gene sequence to a healthy genotype could be inspected without any degree of degeneracy on the graph. Applying such a computational tool in clinical research is a valuable technique that could save time and if time matters then it could eventually save life as well.|
|Design and Analysis of Travelling Salesman Problem||Mathematical Sciences||Paul Arbicfirstname.lastname@example.org||We are using genetic learning algorithms to find a semi-optimal solution to the travelling salesman problem, and want to build a board of lights to demonstrate the solutions found to various sets of data-points in a fun and interactive way.|