Defense Notices


All students and faculty are welcome to attend the final defense of EECS graduate students completing their M.S. or Ph.D. degrees. Defense notices for M.S./Ph.D. presentations for this year and several previous years are listed below in reverse chronological order.

Students who are nearing the completion of their M.S./Ph.D. research should schedule their final defenses through the EECS graduate office at least THREE WEEKS PRIOR to their presentation date so that there is time to complete the degree requirements check, and post the presentation announcement online.

Upcoming Defense Notices

Asim Siddiqui

Region-Aware Optimization of Hierarchical Bloom Filters for Privacy-Preserving Face Membership Verification

When & Where:


Zoom defense, please email jgrisafe@ku.edu for defense information.

Committee Members:

Sumaiya Shomaji, Chair
David Johnson
Han Wang


Abstract

Face recognition systems typically store biometric templates that remain closely related to the original facial data. This creates privacy concerns because, unlike passwords, compromised biometric information cannot be replaced. Hierarchical Bloom Filters (HBFs) provide a privacy-preserving alternative by converting facial information into binary templates and storing only keyed hash-based representations. Matching is performed through membership testing, producing a similarity score without requiring storage of the original image or raw biometric template.

This thesis investigates how the internal structure of an HBF can be improved for face-based membership testing, with particular emphasis on whether facial regions provide a more effective organization than a uniform hierarchical layout. A series of controlled experiments examines the effects of Bloom filter parameters, hierarchy levels, template information, and the distribution of identity-related information across facial regions. Based on these findings, a compact region-based HBF design is proposed in which informative facial locations are selected according to their measured utility.

Two implementations of the proposed design are evaluated using different facial feature representations while maintaining the same HBF backend and storage constraints. Across five face datasets, the proposed region-based designs improve membership performance over the original HBF structure while substantially reducing template and database storage. The learned-feature variant also demonstrates improved robustness to variations in scale, pose, illumination, and expression.


Past Defense Notices

Dates

HAMID MAHMOUDI

Modulated Model Predictive Control for Power Electronic Converters

When & Where:


2001B Eaton Hall

Committee Members:

Reza Ahmadi, Chair
Chris Allen
Glenn Prescott
Alessandro Salandrino
Jim Stiles

Abstract

Advanced switching algorithms and modulation methods for power electronics converters controlled with model predictive control (MPC) strategies have been proposed in this work. The methods under study retain the advantage of conventional MPC methods in programing the nonlinear effects of the converter into the design calculations to improve the overall dynamic and steady state performance of the system and builds upon that by offering new modulation technique for MPC to minimize the voltage and current ripples through using a fixed switching frequency. The proposed method is easy to implement and provides flexibility to prioritize different objectives of the system against each other using the objective weighting factor. To demonstrate the effectiveness of the proposed method, it has been used to overcome the stability problems caused by a constant power load (CPL) in a multi converter system as a case study. 
In addition, to further evaluate the merits of the proposed method, it has been used to control modular multilevel converters (MMCs) in voltage source converter-high voltage DC (VSC-HVDC) systems. The proposed method considers the nonlinear properties of the MMC into the design calculations while minimizing the line total harmonic distortion (THD), circulating current ripple and steady-state error by generating modulated switching signals with a fixed switching frequency. In this work, the predictive modeling of the MMC is provided. Next, the proposed control method is described. Then, the application of the proposed method to a MMC system is detailed. Experimental results from the systems under study illustrate the effectiveness of proposed strategies. 


MD AMIMUL EHSAN

Enabling Technologies for 3D ICs: TSV Modeling and Analysis

When & Where:


246 Nichols Hall

Committee Members:

Yang Yi, Chair
Ron Hui
Lingjia Liu
Alessandro Salandrino
Judy Wu

Abstract

Through silicon via (TSV) based three-dimensional (3D) integrated circuit (IC) aims to stack and interconnect dies or wafers vertically. This forefront technology offers a promising near-term solution for further miniaturization and the performance improvement of electronic systems and follows a more than Moore strategy. 
Along with the need for low-cost and high-yield process technology, the successful application of TSV technology requires further optimization of the TSV electrical modeling and design. In the millimeter wave (mmW) frequency range, the root mean square (rms) height of the TSV sidewall roughness is comparable to the skin depth and hence becomes a critical factor for TSV modeling and analysis. The impact of TSV sidewall roughness on electrical performance, such as the loss and impedance alteration in the mmW frequency range, is examined and analyzed following the second order small perturbation method. Then, an accurate and efficient electrical model for TSVs has been proposed considering the TSV sidewall roughness effect, the skin effect, and the metal oxide semiconductor (MOS) effect. 
However, the emerging application of 3D integration involves an advanced bio-inspired computing system which is currently experiencing an explosion of interest. In neuromorphic computing, the high density membrane capacitor plays a key role in the synaptic signaling process, especially in the spike firing analog implementation of neurons. We proposed a novel 3D neuromorphic design architecture in which the redundant and dummy TSVs are reconfigured as membrane capacitors. This modification has been achieved by taking advantage of the metal insulator semiconductor (MIS) structure along the sidewall, strategically engineering the fixed oxide charges in depletion region surrounding the TSVs, and the addition of oxide layer around the bump without changing any process technology. Without increasing the circuit area, this reconfiguration of TSVs can result in substantial power consumption reduction and a significant boost to chip performance and efficiency. Also, depending on the availability of the TSVs, we proposed a novel CAD framework for TSV assignments based on the force-directed optimization and linear perturbation. 


SANTOSH MALYALA

Estimation of Ice Basal Reflectivity of Byrd Glacier using RES Data

When & Where:


317 Nichols Hall

Committee Members:

Carl Leuschen, Chair
Jilu Li
Chris Allen
John Paden

Abstract

Ice basal reflectivity is much needed for the determination of ice basal conditions and for the accurate modeling of ice sheet to estimate the future global mean sea level rise. Reflectivity values can be determined from the received radio echo sounding data if the power loss caused by different components along the two-way transmission of EM wave are accurately compensated. 

For the large volume of received radio echo sounding data collected over Byrd glacier in 2011-2012 with multichannel radar, the spherical spreading loss caused due to two-way propagation, power reduction due to roughness and relative englacial attenuation are compensated to estimate the relative reflectivity values of the Byrd glacier. 
In order to estimate the scattered incoherent power component due to roughness, the distributions of echo amplitudes returned from air-firn interface and from ice – bed interface are modeled to estimate RMS height variations. The englacial attenuation rate of wave for two-way propagation along the ice depth is modeled using the observed data. The estimated air-firn interface roughness parameters are relatively cross verified using the Neal’s method and with the correlations from the Landsat image mosaic of Antarctica. Estimated relative basal reflectivity values are validated using the cross-over analysis and abruptness index measurements. From the Byrd relative reflectivity map, the corresponding echograms at the locations of potential subglacial water systems are checked for the observable lake features. 
The obtained results are checked for correlations with previously predicted lake locations and subglacial flow paths. While the results doesn’t exactly match with the previously identified locations with elevation changes, high relative reflectivity values are observed close to those locations, aligning exactly or close to previously predicted flow paths providing a new window into the hydrological network of the glacial. Relative reflectivity values are clustered to indicate the different potential basal conditions beneath the Byrd glacier 


RAVALI GINJUPALLI

A Rule Checker and K-Fold Cross Validation for Incomplete Data Sets

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Gary Minden
Suzanne Shontz


Abstract

Rule induction is an important technique of data mining or machine learning. Knowledge is frequently expressed by rules in many areas of AI, including rule based expert systems. The machine learning/ data mining system LERS (Learning from Examples based on Rough Sets) induces a set of rules from examples and classifies new examples using the set of rules induced previously by LERS. LERS induces rules based on supervised learning. The MLEM2 algorithm is a rule induction algorithm in which rule induction, discretization, and handling missing attribute values are all conducted simultaneously. A rule checker is implemented to classify new cases using the rules induced by MLEM2 algorithm. MLEM2 algorithm induces certain and possible rule sets. Bucket Brigade algorithm is implemented to 
classify new examples. K-fold cross-validation technique is implemented to measure the performance of MLEM2 algorithm. The objective of this project is to find out the efficiency of the MLEM2 rule induction method for incomplete data set. 


DHWANI SAXENA

A Modification of the Characteristic Relation for Incomplete Data Sets

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Perry Alexander
Prasad Kulkarni


Abstract

Rough set theory is a popular approach for decision rule induction. However, it requires the objects in the information system to be completely described. Many real life data sets are incomplete, so we cannot directly apply rough set theory for rule induction. A characteristic relation is used to deal with incomplete information systems in which ‘do not care’ data coexist with lost data. There are scenarios in which two objects that do not have the same known value are indiscernible and on the other hand the two objects which have a lot of equivalent known values are very likely to be in different classes. To rectify such situations, a modification of the characteristic relation was introduced. This project implements rule induction from the modification of the characteristic relation for incomplete data sets.


AHMED SYED

Maximal Consistent Block Technique for Rule Acquisition in Incomplete Information Systems

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Perry Alexander
Prasad Kulkarni


Abstract

In this project, an idea of the maximal consistent block is applied to formulate a new approximation to a concept in incomplete data sets. The maximal consistent blocks have smaller cardinality compared to characteristic sets. Because of this, the generated upper approximations will be smaller in size. Two interpretations of missing attribute values are discussed: lost values and “do not care” conditions. Four incomplete data sets are used for experiments with varying levels of missing information. Maximal Consistent Blocks and Characteristics Sets are compared in terms of cardinality of lower and upper approximations. The next objective is to compare the decision rules induced and cases covered by both techniques. The experiments show that both techniques provide the same lower approximations for all the datasets with “do not care” conditions. The best results are achieved by maximal consistent blocks for upper approximations for three datasets.


AMUKTHA CHAKILAM

A Modified ID3 Algorithm for Continuous Numerical Attributes Using Cut Point Approach

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Perry Alexander
Prasad Kulkarni


Abstract

Data classification is a methodology of data mining used to organize data by relevant categories to obtain meaningful information. A model is generated from the input training set which is used to classify the test data into predetermined groups or classes. One of the most widely used models is a decision tree which uses a tree like structure to list all possible outcomes. Decision tree is an important predictive analysis method in Data Mining as it requires minimum effort from the users for data interpretation. 

This project implements ID3, an algorithm for building decision tree using information gain metric. Furthermore, through illustrating the basic ideas of ID3, this project also addresses the inefficiency of ID3 in handling continuous numerical attributes. A cut point approach is presented to discretize the numeric attributes into discrete intervals and enable ID3 functionality for them. Experiments show that such decision trees contain fewer number of nodes and branches in contrast to a tree obtained by basic ID3 algorithm. This modified algorithm can be used to classify real valued domains containing symbolic and numeric attributes with multiple discrete outcomes. 


LUKE DODGE

Rule Induction on Data Sets with Set-Value Attributes

When & Where:


1 Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Arvin Agah
Bo Luo


Abstract

Data sets may have instances where multiple values are possible which are described as set-value attributes. The established LEM2 algorithm does not handle data sets with set-value attributes. To solve this problem, a parallel approach was used during LEM2's execution to avoid preprocessing data. Changing the creation of characteristic sets and attribute-value blocks to include all values for each case allows LEM2 to induce rules on data sets with set-value attributes. The ability to create a single local covering for set-value data sets increases the variety of data LEM2 can process.


SIRISHA THIPPABHOTLA

Applying Machine Learning Algorithms for Predicting Gender based on Voice

When & Where:


1415A LEEP2

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

Machine learning is being applied in many domains of research. One such research area is the automation of gender prediction. The goal of this project is to determine a person’s gender based on his/her voice. Although it may seem like a simple task for any human to recognize this, the difficulty lies in the process of training a computer to do this job for us. This project is implemented by training models based on input data of voice samples from both male and female voices. The voice samples considered were from different datasets, with varying frequencies, noise ratios etc. This input data is passed through various machine learning models, with/without parameter tuning, to compare results. A comparative analysis of multiple machine learning algorithms was conducted, and the prediction with the highest accuracy is displayed as output for the given input voice sample.

 

 


SUNDEEP GANJI

A Hybrid Web Application For Conducting In Class Quizzes

When & Where:


1415A LEEP2

Committee Members:

Prasad Kulkarni, Chair
Jerzy Grzymala-Busse
Gary Minden


Abstract

Every student comes to the class with a smart phone, and they are constantly distracted. It has become a tough challenge for the instructors to keep the students focused on the lectures. The idea of this project is to build a hybrid responsive web application which helps the instructors to post questions between their discussions. The students can give their responses through their smart phones instantly. This enables the instructor to analyze the understanding of the students on the current topic through various statistics which are generated instantly. The instructors can improve their teaching methods while the students who are less interactive can give their voice along with others in the class and check their understanding. 

This application allows the instructor to add or edit courses in their account, add students to their courses, create or edit quizzes beforehand, post questions in different formats to the students, and analyze results through various kinds of plots. On the otherhand, a Student can view the courses he is added in to by his/her instructor, submit his/her responses for the quizzes posted. This application simplifies the process of conducting in-class quizzes and offers the students and the instructors an enhanced classroom experience.