MS defense: Multicast Routing with Byzantine Robustness, D. Mukherjee, 2:30 7/23

network cables

Computer Science and Electrical Engineering
MS Thesis Defense

Multicast Routing with Byzantine Robustness

Debdatta Mukherjee

2:30-4:30 Tuesday, july 23, 2013, ITE 346

Network problems arise when nodes behave in arbitrary ways such as sending malformed messages, sending incorrect messages or not forwarding messages at all to other nodes in the network. These faults are called Byzantine failures. In a real network, these faults can be a result of hardware failure, cyber-attacks or network congestion. Due to the serious problems these faults can cause, it becomes important to make the network robust against them, so that the network continues to operate properly or degrades in an acceptable way in the presence of such faults. In this thesis, we propose methods that include multiple node disjoint path calculations and robust flooding to find byzantine-free multicast trees. By finding such trees, we can guarantee the delivery of the messages from a source to a particular multicast group.

Committee: Professors Deepinder Sidhu (chair), Kostas Kalpakis and Sergei Nirenburg

MS defense: linked data for cybersecurity, Arnav Joshi, 9am 7/22

MS Defense
Computer Science and Electrical Engineering

Linked Data for Cybersecurity Vulnerability Descriptions

Arnav Joshi

9:00-11:00 Monday, 22 July 2013, 325b ITE

The Web is typically our first source of information about new software vulnerabilities, exploits and cyber-attacks. Information is found in semi-structured vulnerability databases as well as in text from security bulletins, news reports, cybersecurity blogs and Internet chat rooms. It can be useful to cybersecurity systems if there is a way to recognize and extract relevant information and represent it as easily shared and integrated semantic data. We describe such an automatic framework that generates and publishes a RDF linked data representation of cybersecurity concepts and vulnerability descriptions extracted from the National Vulnerability Database and other text sources. Entities, relations and concepts are represented using custom ontologies for the cybersecurity domain and also mapped to objects in the DBpedia knowledge base, producing a rich resource of machine-understandable linked data. The resulting cybersecurity linked data collection can be used for many purposes, including automating early vulnerability identification, mitigation and prevention efforts.

Committee: Professors Tim Finin (chair), Anupam Joshi and Tim Oates

CYBR student places 3rd in Microsoft Cybersecurity Essay Contest

First-year Cybersecurity MPS student Andrew Shiffer placed third in Microsoft's "Cybersecurity 2020" student essay contest.  The contest allows Microsoft to solicit original research about cybersecurity policy challenges from university students at any stage in their educational careers.  Andrew's paper is entitled "A Cybersecurity Triumvirate: Policies, Outcomes, and Emerging Trends."

Andrew will receive $2,000 prize (which he is applying toward his studies at UMBC) and the opportunity for his work to be published by Microsoft at a later date. According to a follow-up note from Microsoft, it appears that Andrew is the only American finalist — the first and second place students both came from Canadian universities.

Well done, Andrew!

 

PhD defense: On Prediction and Estimation for Datastreams Utilizing Sparsity and Structure, 6/6

Ph.D. Dissertation Defense

On Prediction and Estimation for Datastreams

Utilizing Sparsity and Structure

Shiming Yang

10:00am-12:00pm, 6 June 2013, ITE 325b, UMBC

With the unprecedented fast growth of data, we have better opportunities to understand our complex world, and simultaneously face pervasive challenges in efficiently inferring the meaning behind these vast amounts of data. It is particularly important to explore the intrinsic structures in data to increase our rational understanding of the latent mechanisms that generate them. In modeling, structures are features used to characterize the underlying systems, such as the rank of a system, the number of clusters, the levels of hierarchy, and the order of spatio-temporal correlations in multiple measurements.

In this thesis, we present our research contributions on utilizing structures and sparsity in observed data to improve estimation and prediction of trajectories of system states for two systems: the highway traffic system and the human physiology systems. Both systems exhibit features that are seen in many other applications.

For the traffic problem, it is useful to know the near–term traffic conditions after the occurrence of some events which have noticeable impact on the road traffic. Often used macroscopic models, which view road traffic as fluid flowing in pipes, suffer from various inaccuracies, which could be mitigated by incorporating past observations to correct predictions. However, we often have limited observation and computing resources (e.g., probe vehicles, smartphones, bandwidth, sensors) to gather and process past observations. We describe a novel low-overhead strategy to adaptively select observation sites in real-time by using the density of the mesh of the numerical solution of the underlying mathematical model to capture the variability of that solution. We show that our proposed strategy improves the numerical accuracy of near–term traffic forecasting with limited observation resources as compared with with uniform deployment of the observation resources. In addition to deploying limited observation resources, one is often concerned with detecting special traffic events. To this end, we propose a novel method to decompose traffic observations into normal background and sparse events. Our method couples multiple traffic datastreams so that they share a certain sparse spatio–temporal structure.

We also study the utility of sparseness and structure in physiological datastreams. Missing values hinder the use of many machine learning methods. We show how to incorporate ideas from compressive sensing into handling the missing values problem in continuous intracranial pressure (ICP) datastreams from patients with traumatic brain injury. We experimentally evaluate the proposed method in experiments where randomly selected ICP values are marked as missing. We find our method gives estimated missing values that are in better agreement with the true values as compared with k–nearest neighbor and expectation maximization data imputation methods.

Moreover, predicting the near–term intracranial pressure for traumatic brain injury patients is of great importance to clinicians. Traditional regression methods, need an explicit parametric form of the model to fit. However, due to our limited knowledge of the complex brain physiology, it is difficult to specify an accurate parametric model. To overcome this difficulty, our model uses Gaussian processes to quantify our prior beliefs on the smoothness of the regression model, and performs regression in an infinite dimensional space. We show that the proposed Gaussian process regression model shows predicts ICP changes in clinically useful timeframes and may support future development of minimally-invasive ICP monitoring systems, earlier intervention strategies, and better patient outcomes.

Committee: Drs. K. Kalpakis (Chair), Alain Biem (IBM TJ Watson), Chein-I Chang, Colin MacKenzie, Dhananjay Phatak, Yaacov Yesha

Phd Defense: Dingkai Guo, Mid-Infrared Photonic Integration 6/4

Ph.D. Dissertation Defense

Mid-Infrared Photonic Integration

Dingkai Guo

10:00am Tuesday, 4 June 2013, TRC CASPR conference room

The mid-Infrared (Mid-IR) wavelength range is important for applications including medical and security imaging, environmental trace gas sensing and free space communications. However, photonic integrated circuits (PICs) in the mid-IR range are completely under-developed which significantly slows the reduction of mid-IR system size, weight, and coupling losses and limits the development of highly functional mid-IR photonic modules with lower cost. In this dissertation, a solution to mid-IR photonic integration was demonstrated using a compact widely tunable mid-IR transmitter and a mid-IR amplifying photo-detector, which can be integrated with the mid-IR source.

This integrated widely tunable mid-IR source is fabricated by incorporating super structure grating (SSG) to the mid-IR quantum cascade laser (QCL) waveguide. The emission wavelength of the fabricated SSG-DBR QCL can be well controlled by varying the injection currents to the two grating sections. The wavelength can be tuned from 4.58μm to 4.77μm (90cm-1) with a supermode spacing of 30nm. This SSG-DBR QCL can be a compact replacement for the external cavity QCL used in current mid-IR sensors.

Mid-IR amplification and detection can be achieved using the same material as the mid-IR source. This QCL amplifier has an adjustable bandwidth and tunable gain peak, so it can function as a tunable mid-IR filter. By biasing the QCL just below its threshold, we demonstrated more than 11dB optical gain and over 28dB electrical gain at specified wavelengths. In the electrical gain measurement process, the resonant amplifier also functioned as a detector. This indicates that intersubband-based gain materials are ideal candidates for mid-IR photonic integrations.

Beside the optimized fabrication processes, new characterization technique based on the electrical derivative of the QCL I-V curves is used to quickly acquire the QCL threshold and leakage current, and explore the device carrier transport. The leakage currents present in different QCL waveguide structures are also studied and compared using this technique.

Finally, we report that the telecom wavelengths induced optical quenching effects on mid-IR QCLs when the QCLs are operated well above their threshold. The quenching effect is a result of intersubband bandbending and it depends on the coupled near-IR intensity, wavelength, and the QCL voltage bias. The quenching effects not only can be used for mid-IR QCL optical switching and modulation but also reveal that the mid-IR QCLs can function as “converters” to convert the telecom optical signal into the mid-IR optical signal at the near-IR fiber end.

A coherent mid-IR transceiver with both transmitting and receiving functions can be realized based on each integrated component introduced in this dissertation. This compact transceiver includes an integrated widely tunable mid-IR source, a mid-IR filter, amplifier, and detector based on the same material system.

Committee: Drs. Fow-Sen Choa (Chair), Anthony Johnson, Terrance Worchesky (Physics) , Li Yan, Gymama Slaughter

MS defense: A Multilayer Framework to Catch Data Exfiltration

MS Thesis Defense

A Multilayer Framework to Catch Data Exfiltration

Puneet Sharma

10:30am Wednesday, 5 June 2013, 325b ITE, UMBC

Data exfilteration is the unauthorized leakage of confidential data from a particular system. It is a specific form of intrusion that is particularly hard to catch due to the most common cause: an insider entity who is responsible for the leak. That entity could be a person employed in the organization or a malicious hardware component bought from an unreliable third party. Catching such intrusions, therefore, can be extremely difficult. We describe a framework comprising multiple parameters that are constantly monitored in a system. These parameters can cover the entire stack of the computer architecture, from the hardware up to the application layer. Malicious behavior is detected by different modules monitoring these parameters and an aggregated attack alert is produced if multiple modules detect malicious activity within a short period of time. A more distributed and comprehensive monitoring framework should ensure that designing an attack becomes extremely difficult since an attack must go through multiple detectors present in the system without raising any alarms.

Committee: Drs. Anupam Joshi (chair), Tim Finin, Chintan Patel

PhD proposal: Yu Wang, Solving the Physically-Based Modeling and Animation Problem with a Unified Solution

Ph.D. Dissertation Proposal

The Modeling Equation: Solving the Physically-Based

Modeling and Animation Problem with a Unified Solution

Yu Wang

11:00am Monday, June 3, 2013, VANGOGH Lab, ITE 352

Physically-based modeling, i.e. the ability to model sophisticated geometrical shapes and objects in complex physical environments, is an important and popular research area in computer graphics, especially in animation and modeling. Rigid body dynamics studies how solid objects react to external forces without considering collisions (unconstrained), or the interaction between rigid bodies without inter-penetration (constrained). Deformable object modeling accounts for the effects of material properties, external forces, and environment constrains on object deformation. Fluid simulation in computer graphics heavily studies efficient way of solving and/or approximating the physically-based Navier-Stokes equations.

It’s difficult to account for these behaviors from a mechanics point of view, but they have analogous rheological equations. To be exact, rheology studies deformation and flow of matters by accounting for the movements of particles that comprise the material relative to each other. There are three different rheological properties: if we apply definite forces to a material to make it reach a definite deformation, and the deformation goes back when the forces are removed, the material is elastic; if the deformation remains permanent, the material is plastic; or under definite forces, the deformation keeps increase without a limit, the material flows.

I’m proposing to create physically-accurate material behaviors using a generalized formulation based on rheological theories, i.e. kinematic and dynamic properties of rigid bodies, deformable objects, fluid-like materials can be represented by the same formulation with different weights to their rheological properties.

Committee: Drs. Marc Olano (Chair and Advisor), Matthias K. Gobbert (Mathematics and Statistics), Penny Rheingans, Lynn Sparling (Physics), Jian Chen

PhD proposal: A Semantic Resolution Framework for Manufacturing Capability Data Integration

Ph.D. Dissertation Proposal

A Semantic Resolution Framework for
Manufacturing Capability Data Integration

10:30am Tuesday, May 14, 2013, ITE 346, UMBC

Yan Kang

Building flexible manufacturing supply chains requires interoperable and accurate manufacturing service capability (MSC) information of all supply chain participants. Today, MSC information, which is typically published either on the supplier’s web site or registered at an e-marketplace portal, has been shown to fall short of the interoperability and accuracy requirements. This issue can be addressed by annotating the MSC information using shared ontologies. However, ontology-based approaches face two main challenges: 1) lack of an effective way to transform a large amount of complex MSC information hidden in the web sites of manufacturers into a representation of shared semantics and 2) difficulties in the adoption of ontology-based approaches by the supply chain managers and users because of their unfamiliar of the syntax and semantics of formal ontology languages such as OWL and RDF and the lack of tools friendly for inexperienced users.

The objective of our research is to address the main challenges of ontology-based approaches by developing an innovative approach that can effectively extract a large volume of manufacturing capability instance data, accurately annotate these instance data with semantics and integrate these data under a formal manufacturing domain ontology. To achieve the objective, a Semantic Resolution Framework is proposed to guides every step of the manufacturing capability data integration process and to resolve semantic heterogeneity with minimal human supervision. The key innovations of this framework includes 1) three assisting systems, including a Triple Store Extractor, a Triple Store to Ontology Mapper and a Ontology-based Extensible Dynamic Form, that can efficiently and effectively perform the automatic processes of extracting, annotating and integrating manufacturing capability data.; 2) a Semantic Resolution Knowledge Base (SR-KB) that incrementally filled with, among other things, rules/patterns learned from errors. This SR-KB together with an Upper Manufacturing Domain Ontology (UMO) provide knowledge for resolving semantic differences in the integration process; 3) an evolution mechanism that enables SR-KB to continuously improve itself and gradually reduce the human involvement by learning from mistakes.

Committee: Yun Peng (chair), Charles Nicholas, Tim Finin, Yaacov Yesha, Boonserm Kulvatunyou (NIST)

UMBC's 2013 summer cybersecurity courses

The UMBC Cybersecurity Masters in Professional Studies (MPS) program will offer the following courses over the Summer 2013 session:

  • CYBR 620: Introduction to Cybersecurity
  • CYBR 621: Cyber Warfare
  • CYBR 691: Special Topics in Cybersecurity: Application Security Principles/Practices

Each class will meet one or two days a week in the late afternoon or evening, depending on the length of the session where the course is offered.

For those living in Washington, D.C., Northern Virginia, Frederick, MD, and points west, UMBC's Cybersecurity MPS will launch at the Universities at Shady Grove (USG) in Fall 2013.  Courses offered the first semester at that campus will be:

  • CYBR 620: Introduction to Cybersecurity
  • CYBR 623: Cybersecurity Law & Policy

The deadline to apply for Fall 2013 admission to the UMBC Graduate Cybersecurity Program is August 1, 2013.

Omar Shehab (CS Ph.D) awarded NSF travel grants for upcoming conferences

shehab-front-face

Congratulations to Omar Shehab (CS Ph.D.), who has been awarded two NSF travel grants to attend research conferences this June.

First, Omar has received an NSF travel grant to attend the IEEE Conference on Computational Complexity. The conference celebrates research in all areas of computation complexity theory, taking a look at the absolute and relative power of computational models under resource constraints. Specific topics include probalistic and interactive proof systems, proof complexity, and descriptive complexity. The conference will be held in Palo Alto California, June 5-7.

Omar has also received an NSF travel grant to attend the 45th ACM Symposium on the Theory of Computing (STOC 2013). Here, he will be presenting a poster entited: "Hamiltonian complexity of Trefoil knot transformations." The conference is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). It will explore original research on the theory of computation. The conference will be held in Palo Alto California, June 1-4.

Omar started UMBC’s Computer Science Ph.D. program in 2010. He is currently pursuing research under the supervision of Dr. Samuel J. Lomonaco Jr. Omar’s doctoral work exlpores adiabatic quantum Hamiltonian complexity, quantum computational simulation of topology and use of quantum optics to understand device independent cryptography. He is currently a Teaching Assistant for CMSC 641: Design and Analysis of Algorithms.

1 15 16 17 18 19 37