“You don’t have to leave your campus to become an activist.” – Marisela B. Gomez

The study (IRB Protocol: Y15RK12082) will take approximately one hour. You will be interviewed about your opinions and experiences with common authentication methods and mobile technology security issues.

All participants must be aged over 18, and use a mobile device (e.g. smartphone).

If you are interested and meet the requirements, please contact the researcher (flynn.wolf@umbc.edu). Your participation is very important for our research and will be highly appreciated.

Red Cross Blood Drive

Ph.D. Dissertation Defense
Computer Science and Electrical Engineering
University of Maryland, Baltimore County

Rapid Plan Adaptation Through Offline
Analysis of Potential Plan Disruptors

Robert H. Holder, III

9:00am Wednesday, 9 December 2015, ITE 325b

Computing solutions to intractable planning problems is particularly problematic in dynamic, real-time domains. For example, visitation planning problems, such as a delivery truck that must deliver packages to various locations, can be mapped to a Traveling Salesman Problem (TSP). The TSP is an NP-complete problem, requiring planners to use heuristics to find solutions to any significantly large problem instance, and can require a lengthy amount of time. Planners that solve the dynamic variant, the Dynamic Traveling Salesman Problem (DTSP), calculate an efficient route to visit a set of potentially changing locations. When a new location becomes known, DTSP planners typically use heuristics to add the new locations to the previously computed route. Depending on the placement and quantity of these new locations, the efficiency of this adapted, approximated solution can vary significantly. Solving a DTSP in real time thus requires choosing between a TSP planner, which produces a relatively good but slowly generated solution, and a DTSP planner, which produces a less optimal solution relatively quickly.

Instead of quickly generating approximate solutions or slowly generating better solutions at runtime, this dissertation introduces an alternate approach of precomputing a library of high-quality solutions prior to runtime. One could imagine a library containing a high-quality solution for every potential problem instance consisting of potential new locations, but this approach obviously does not scale with increasing problem complexity. Because complex domains preclude creating a comprehensive library, I instead choose a subset of all possible plans to include. Strategic plan selection will ensure that the library contains appropriate plans for future scenarios.

Committee: Drs. Marie desJardins (co-chair), Tim Finin (co-chair), Tim Oates, Donald Miner, R. Scott Cost

Ph.D. Dissertation Defense
Computer Science and Electrical Engineering
University of Maryland, Baltimore County

Rapid Plan Adaptation Through Offline
Analysis of Potential Plan Disruptors

Robert H. Holder, III

9:00am Wednesday, 9 December 2015, ITE 325b

Computing solutions to intractable planning problems is particularly problematic in dynamic, real-time domains. For example, visitation planning problems, such as a delivery truck that must deliver packages to various locations, can be mapped to a Traveling Salesman Problem (TSP). The TSP is an NP-complete problem, requiring planners to use heuristics to find solutions to any significantly large problem instance, and can require a lengthy amount of time. Planners that solve the dynamic variant, the Dynamic Traveling Salesman Problem (DTSP), calculate an efficient route to visit a set of potentially changing locations. When a new location becomes known, DTSP planners typically use heuristics to add the new locations to the previously computed route. Depending on the placement and quantity of these new locations, the efficiency of this adapted, approximated solution can vary significantly. Solving a DTSP in real time thus requires choosing between a TSP planner, which produces a relatively good but slowly generated solution, and a DTSP planner, which produces a less optimal solution relatively quickly.

Instead of quickly generating approximate solutions or slowly generating better solutions at runtime, this dissertation introduces an alternate approach of precomputing a library of high-quality solutions prior to runtime. One could imagine a library containing a high-quality solution for every potential problem instance consisting of potential new locations, but this approach obviously does not scale with increasing problem complexity. Because complex domains preclude creating a comprehensive library, I instead choose a subset of all possible plans to include. Strategic plan selection will ensure that the library contains appropriate plans for future scenarios.

Committee: Drs. Marie desJardins (co-chair), Tim Finin (co-chair), Tim Oates, Donald Miner, R. Scott Cost

The study (IRB Protocol: Y15RK12082) will take approximately one hour. You will be interviewed about your opinions and experiences with common authentication methods and mobile technology security issues.

All participants must be aged over 18, and use a mobile device (e.g. smartphone).

If you are interested and meet the requirements, please contact the researcher (flynn.wolf@umbc.edu). Your participation is very important for our research and will be highly appreciated.

Below are featured events and internship/employment opportunities that have recently been posted or have application deadline dates that are quickly approaching!  To see all that the UMBC Career Center has to offer YOU, please visit our myUMBC group page HERE or log into your UMBCworks account!

FEATURED EVENTS AND OPPORTUNITIES….

NEW! Spring Internship Registration Drop-in DayWednesday, December 2, 2015, 11 am – 2 pm

NEW! $15K Scholarship & Summer Internship at Morgan Stanley, Early deadline to apply:  Monday, November 30, 2015; Regular deadline to apply:  Monday, February 1, 2016

NEW! The Universum Career Test

Information Sessions

NEW! Information Session: IBM Wednesday, December 2, 2015, 5:30 pm – 7 pm

NEW! Information Session: United States FBIThursday December 3, 2015, 5 pm – 7 pm
****************************************************************************************************

FEATURED FULL-TIME & PART-TIME JOBS, INTERNSHIPS, AND RESEARCH POSITIONS

$15K Scholarship & Summer Internship at Morgan Stanley

New Post Maternal Child Health Careers/Research Initiatives

Health IT Summer Internships with Northrop Grumman

Keep an eye on the Career Center website (http://careers.umbc.edu/) for all upcoming events and programs!  Freshmen, Sophomores, Juniors, and Seniors….this is an excellent opportunity for you to learn more about career paths…whether you are exploring possibilities or searching for an internship or full-time opportunity!

*************************************************************************************************

All UMBC students registered for classes within the past year are included in the job-internships email list. Because the list is auto-populated by the Registrar, you cannot unsubscribe, but you can change your reception mode to not receive any more messages.

1. Go to https://lists.umbc.edu

2. Login with your myUMBC account or email address

3. Go to https://lists.umbc.edu/sympa/suboptions/jobs-internships

4. Under "Your list options" change the "Receiving mode" to "no mail"

5. Hit the Update button