April 24, 2014
About Us
Chair's Welcome
Mathematics Major
Computer Sc. Major
Comp. Info. Sys. Major
Faculty and Staff
Math/Computing Alumni
Mathematics Courses
Computing Courses
Gen. Math Requirement
Other Links
Why Math/CS at SU?
Student Research
Mathematics Clinic
Computer Labs
Colloquium Series
ACM Student Chapter
QED Math Club
Recent/Upcoming Events Colloquium Series
Sr. Research Talks (Apr. 29, 2013)
Who : Sammi Smith, Evan Foley, Dan Marulanda, Buhang Wang
Location : EH 205 2:30-$;30
2:30pm Sammi Smith The Choking Index: An Analysis of Performance Under Pressure on the PGA Tour 3:00pm Evan Foley Simulating Solitons of the Sine-Gordon Equation Using Variational Approximations and Hamiltonian Principles 3:30pm Dan Marulanda An Analysis of the Growth and Fan Interaction of Major League Soccer 4:00pm Buhang Wang Finding a Perturbation Solution to a Forced Kdv Equation as a Model for the Morning Glory Cloud Phenomenon

SR Research talks! (Dec. 06, 2012)...
First Prize! (Nov. 06, 2012)...
On Modeling, Simulating and Verifying a Decentralized Mission Control Algorithm for a Fleet of Collaborative UAVs (Mar. 20, 2013)
Who : Dr. Hong Liu
Location : 205 Eliz @ 3:00
It can be relatively easy to correctly design a centralized mission control algorithm for a fleet of unmanned aerial vehicles (UAV) to achieve optimal mission efficiency. However, the fault intolerance of the algorithm makes the fleet risky for the missions in noisy communications environment. This talk presents a Decentralized Mission Control (DMC) algorithm for coordinating a fleet of UAVs to accomplish a specific mission. The symbolic model of the UAV fleet configuration and the software processes are imitated to the Berkley UAV systems, which facilitate the peer-to-peer communication and the environment awareness. The design goal of the DMC algorithm is that the UAVs work either cooperatively to achieve the highest efficiency under normal communication modes or adaptively to guarantee the safety of UAVs under various fault modes. The communication protocol of DMC algorithm mostly depends on message broadcasting in order to minimize the dependency on ground station. The task assignment schema of DCM algorithm depends on the modes of the environment variables. It is derived from the Hungary Algorithm, which attains the optimal assignment for equal numbers of tasks and agents. Formal method is used to verify the safety and progress properties such as tolerance to faults and free of deadlocks. The real-time interactions of the system are modeled as a nexus of UPPAAL automata and verified against the expected properties specified as a list of temporal CTL queries. A C# program is used to simulate and measure the mission efficiency.

Harmonic Rearrangements, Recurrence Relations, (Nov. 14, 2012)...
Bistable Waves in Discrete Inhomogeneous Media (Nov. 13, 2012)...
Stetson University, 421 North Woodland Boulevard, Unit 8332, Deland, FL 32723 - 3757, USA
Page Last Updated: March 12, 2008
Stetson University Home Page Contact Us