MS defense: Problem selection of program tracing tasks in an intelligent tutoring system

Master's Thesis Defense Announcement

Problem Selection of Program Tracing Tasks in an Intelligent
Tutoring System and Visual Programming Environment

David Walser

2:00pm Thursday, 28 April 2011, ITE 325b

Intelligent tutoring systems (ITSs) have been shown to be an effective supplementary teaching tool or aid for many domains. Applying ITSs in open-ended domains such as computer programming is especially challenging, most notably when trying to assist with the process of programming itself. Existing ITSs for programming focus on a very limited set of problems and concepts and are only useful early in an introductory CS course and a few limited places afterward. Visual programming environments are another tool that have been used in introductory CS courses to help students learn basic concepts. The key idea behind my work is the recognition of the importance of students' ability to read, understand, and trace code in order to write programs successfully. A broader goal of my work is to show that an ITS based on a visual programming environment can be used to support students throughout an entire introductory CS course, without being severely constrained and limited to a small number of concepts and to low-level, simple tasks. In my system, called RUR-ITS, students are given a program and are asked to predict the robot's behavior when running this program in a given environment. RUR-ITS allows each problem to be assigned a difficulty level and multiple concepts that it involves within the conceptual model. RUR-ITS can then use a problem selection algorithm to choose a problem that is most able to help the student master the concepts that they have not yet mastered.

Thesis Committee:

  • Dr. Marie desJardins, Chair
  • Dr. Tim Finin
  • Dr. Tim Oates

     

Maryland Cyber Conference and Challenge (MDC3)

The Maryland Cyber Challenge and Conference site is up and student teams can now register for the competition, with the first qualifying round early in September. It is a chance to demonstrate your ability to work in a team and your cybersecurity and problem solving skills.

MDC3 is a joint effort between SAIC, UMBC, DBED, TCM and NCSA to bring people together to promote Maryland's commitment to cybersecurity and STEM education. The competition includes three levels: high school, collegiate and professionals from industry/government, providing opportunities to network with cybersecurity professionals, researchers, and scholars.

There will be orientation sessions at the UMBC Technology Center (1450 South Rolling Rd., 21224) on May 2, May 18 and June 21 at 4:30pm for professionals and 6:00pm for students.

Semantic Analysis of XML Schema Matching for B2B (Dissertation Defense)

PhD Dissertation Defense Announcement

A Semantic Analysis of XML Schema Matching
for B2B Systems Integration

Jaewook Kim

11:00am Thursday, 21 April 2011, ITE 346

One of the most critical steps to integrating heterogeneous e-Business applications using different XML schemas is schema matching, which is known to be costly and error-prone. Many automatic schema matching approaches have been proposed, but the challenge is still daunting because of the complexity of schemas and immaturity of technologies in semantic representation, measuring, and reasoning. The dissertation focuses on three challenging problems in the schema matching. First, the existing approaches have often failed to sufficiently investigate and utilize semantic information imbedded in the hierarchical structure of the XML schemas. Secondly, due to synonyms and polysemies found in natural languages, the meaning of a data node in the schema cannot be determined solely by the words in its label. Thirdly, it is difficult to correctly identify the best set of matching pairs for all data nodes between two schemas. To overcome these problems, we propose new innovative approaches for XML schema matching, particularly applicable to XML schema integration and data transformation between heterogeneous e-Business systems. Our research supports two different tasks: integration task between two different component schemas; and transformation task between two business documents which confirm to different document schemas.

Dissertation Committee:

  • Dr. Yun Peng, Chair
  • Dr. Charles Nicholas
  • Dr. Zary Segall
  • Dr. Milton Halem
  • Dr. Hyunbo Cho (POSTECH, Korea)
  • Dr. Nenad Ivezic (NIST)

talk: Cybersecurity Threat is Real (new time: 10am)

The Threat is Real

Sherri Ramsay
Director, NSA/CSS Threat Operations Center

10:00am Friday 22 April 2011, 229 ITE

Sherri Ramsay, the Director of the National Security Agency's National Threat Operations Center, will present an overview of contemporary issues in cybersecurity entitled "The Threat is Real". The NSA Threat Operations Center monitors the operations of the global network to identify network-based threats and protect U.S. and allied networks.

Sherri Ramsay serves as the Director of the National Security Agency/Central Security Service Threat Operations Center, an organization operating under Signals Intelligence and Information Assurance authorities simultaneously to establish real-time global network awareness and threat characterization. Ms. Ramsay most recently served in the Information Assurance Directorate as Deputy Chief of the Vulnerability Analysis and Operations Group. She began her career at NSA as a computer programmer and served as a Software Acquisition Manager, System Acquisition Manager, and Program Manager for several large-scale programs. She spend a year of extensive leadership training, research and developmental assignments while participating in OPM’s Executive Potential Program.

Ms. Ramsay graduated Magna Cum Laude with General Honors from the University of Georgia in 1977 with a Bachelor of Science degree majoring in Mathematics and Education. She graduated with Honors from the Johns Hopkins University in 1984 with a Masters Degree in Computer Science. In 1992, she graduated from OPM’s Executive Potential Program. She graduated in 1998 form the Industrial College of the Armed Forces, National Defense University, Ft. McNair, with a Mater’s Degree in National Resource Strategy. Prior to joining NSA, Ms. Ramsay taught high school mathematics. She received the NSA Meritorious Civilian Service Award in 1998 and 2000, the National Intelligence Meritorious Unit Citation in 1998, the Louis Tordella Award in 2003, and the Presidential Meritorious Executive Award in 2009.

· directions · talks · events ·

Dissertation Defense: Towards Relational Theory Formation from Undifferentiated Sensor Data

Dissertation Defense

Towards Relational Theory Formation
from Undifferentiated Sensor Data

Marc Pickett

10:00am Monday, 18 April 2011
ITE 325b, UMBC

Human adults have rich theories in their heads of how the world works. These theories include objects and relations for both concrete and abstract concepts. Everything we know either must be innate or learned through experience. Yet it's unclear how much of this model needs to be innate for a computer. The core question this dissertation addresses is how a computer can develop rich relational theories using only its raw sensor data. We address this by outlining a "bridge" between raw sensors and a rich relational theory. We have implemented parts of this bridge, with other parts as feasibility studies, while others remain conceptual.

At the core of this bridge is Ontol, a system that constructs a conceptual structure or "ontology" from feature-set data. Ontol is inspired by cortical models that have been shown to be able to express invariant concepts, such as images independent of any translation or rotation. As a demonstration of the utility of the ontologies created by Ontol, we present a novel semi-supervised learning algorithm that learns from only a handful of positive examples. Like humans, this algorithm doesn't require negative examples. Instead, this algorithm uses the ontologies created by Ontol from unlabeled data, and searches for a Bayes-optimal theory given this "background knowledge".

The rest of the dissertation shows in principle how Ontol can be used as the "workhorse" for a system that finds analogies, discovers useful mappings, and might ultimately create theories, such as a "gisty" theory of "number".

Committee:

  • Tim Oates, Associate Professor, UMBC
  • Tim Finin, Professor, UMBC
  • Rob Goldstone, Professor, Indiana University
  • Sergei Nirenburg, Professor, UMBC
  • Matt Schmill, Research Faculty, UMBC

Linux is twenty years old this year

Click to see and download full infographic

 

Linux will be twenty years old this summer. On August 26, 1991 Linus Torvalds posted a message to the comp.os.minix newsgroup that started like this.

"Hello everybody out there using minix. I'm doing a (free) operating system (just a hobby, won't be big and professional like gnu) for 386(486) AT clones. This has been brewing since april, and is starting to get ready. I'd like any feedback on things people like/dislike in minix, as my OS resembles it somewhat (same physical layout of the file-system (due to practical reasons) among other things).

What resulted has been truly astounding.  We congratulate Linus Torvald, the Linux Foundation and the entire Linux community for their contributions to computer science and the world.

I am not sure when we began to use Linux here at UMBC.  Most of the machines running Unix in our labs in the 1990s were from Sun or SGI, so we used Solaris and Irix.  Sometime in the early 2000s we started replacing the SGIs with Intel boxes and switched to Linux.

The Linux Foundation is celebrating the 20th anniversary and commissioned this nicely done video that tells the story of Linux in under four minutes.


Visit our Web site if the video is not visible above.

Check out their Linux 20th Celebration page for more information about Linux, its history and how pervasive it has become.

CSEE undergraduates present work at URCAD

Congratulations to the CSEE undergraduate students and groups who will be presenting posters on their research as part of the Fifteenth Annual UMBC Undergraduate Research and Creative Achievement Day. UCRAD features research, scholarship, and creative work carried out by UMBC undergraduates.

  • Natée Johnson, X-Ray Study of Nano-Scale Superlattice Materials, 3:15pm-3:30pm, UC 310, Mentor: Dr. Fow-Sen Choa
     
  • Sheriff Jolaoso, Spectrogram Analysis and Evaluation and Brainwave Appreciation of Music, 10:00am-12:30pm UC Ballrooom, Mentor: Dr. Fow-Sen Choa
     
  • Morgan Madeira and Rachel Sweeton, Finding Communities through Social Media, 10:00am-12:30pm, Mentor: Dr. Anupam Joshi
     
  • Ross Pokorny, 12:30pm-3:00pm, UC Ballroom, TweetCollector: A Framework for Retrieving, Processing, and Storing Live Data from Twitter, Mentors: Dr. Timothy Finin and Dr. Anupam Joshi
     
  • David Shyu, Patient Identification and Diagnosis Using Fourier Analysis and Beam Forming of Multi-electrode Brain Wave Signals, 12:30pm-3:00pm, Mentors: Dr. Fow-Sen Choa and Dr. Elliott Hong
     
  • UMBC Game Developers Club, Innovations in Computer Game Development, 12:30pm-3:00pm, Mentor: Mr. Neal McDonald

Computing enrollments up 10% nationwide

The CRA reports that total enrollments among U.S. computer science undergraduates increased 10% in 2010 based on data from its most recent annual Taulbee Survey. This is the third straight year of increases in total enrollment and indicates that the post “dot-com crash” decline in undergraduate computing program enrollments is over. The Taulbee Survey is conducted annually to document trends in student enrollment, degree production, employment of graduates, and faculty salaries in Ph.D-granting departments of computer science, computer engineering and information systems in the United States and Canada. You can find the data in a CRA report on Computing Degree and Enrollement Trends.  The full data from the Taulbee report will be available later in May from the CRA Web site.

The data for UMBC computing majors shows similar increases in the past three years.

Subjects sought for Python programming study

Participate in a Python programming study and win a iPod

Last chance to participate & enter drawing for a free iPod Nano!

We are a group of students who are performing a research study to investigate how students learn and improve their performance at different aspects of Python programming. For the study, we are looking for students who are currently enrolled in CMSC 201 or who took CMSC 201 in the last semester or two and have not yet completed CMSC 202.

In exchange for your participation in the study, we will provide pizza for the participants, and each student will also be entered into a drawing for an 8G iPod Nano, in the color of your choice. One participant, of the 24 to 32 students that we recruit, will win the Nano.  We are currently signing students up for the following three time slots:

  • Wed 4/6, 7pm-10pm: free pizza will be available for registered participants at 6:45
  • Fri 4/8, 10am-2pm: Show up *any time* between 10am and 2pm — whatever works for you! Pizza will be ordered around noon.
  • Mon 4/11, 10:30am-8pm: Show up any time between 10:30am and 8pm! Pizza will be provided around noon and again around 6:30 if there are participants there to eat it!

The study will take place in ITE 240. Please sign up in advance if at all possible, and let us know what time you expect to arrive during the open sessions, so that we know how many students to expect and how much pizza to order!

The study involves four stages: first, you will be given a brief tutorial in the Python-based RUR-PLE visual programming environment and be asked to answer some warm-up questions to help familiarize you with the RUR-PLE environment. You will then be given a pretest that asks you to answer some basic multiple-choice programming questions. Next, you will be given a series of problems to solve within RUR-PLE, either by writing Python programs to perform a specified task, or by predicting the output and behavior of a given program. Finally, you will take a posttest that is similar to the pretest. We will record your answers to help us understand how to predict student programming performance and learning, based on their starting knowledge. The length of time to complete these tasks will vary, depending on the student, from one to two hours. Your data will be completely anonymized, and no information about you personally will be stored with the results of the study.

If you have any questions or wish to volunteer for the study, please contact Amy Ciavolino at . Prof. Marie desJardins () is the faculty advisor for this project, and you may also contact her with any questions or concerns.

Amy Ciavolino (), Robert Deloatch (), Eliana Feasley () and David Walser ()

Cyber Defense Team meeting, Noon 4/4 ITE 325b

cyberdawgs

The UMBC Cyber Defense Team, aka the Cyberdawgs, will host a technical briefing on Monday April 4 featuring two guest speakers from the DoD. The topic will be the cyber competitions between the service academies, and other cyber-related topics may come up as well. The meeting will be held in the CSEE conference room, ITE 325b, from Noon to 2:00pm.

The Cyber Defense Team is a SGA recognized student organization whose members share a common interest in computer and network security and participating in cybersecurity competitions and events. It is open to everyone regardless of your major or current knowledge level. If you are interested in joining come to this meeting or any of the weekly meetings held on Monday's from Noon to 2:00pm. You can also subscribe to its mailing list by sending a message to .

1 96 97 98 99 100