ColaHacks

Saturday, April 14, 2018 - 09:00 am
The Zone (Williams Bryce Stadium)
It is our pleasure to invite you to ColaHacks, USC's first student hackathon, taking place Saturday, April 14th from 9am-9pm at the Zone at Williams-Brice Stadium. Participation is limited to 160 students so if interested, please register as soon as possible at www.colahacks.com. Registration is free and open to all undergraduate/graduate students currently attending USC. Major League Hacking (MLH) defines hackathon as an invention marathon. Anyone who has an interest in technology attends a hackathon to learn, build and share their creations over the course of a weekend in a relaxed and welcoming atmosphere. You don’t have to be a programmer, and you certainly don’t have to be a Computer Science major. All you need is a passion for solving unique challenges our generation faces and a love for technology. ColaHacks gives students almost 12 hours to work on a project they feel betters Columbia, SC in some way; be it an app, website, or any other technology. Teams of students (1-4) will then demo and present their ideas to judges for the chance to compete for cash prizes as well as other gifts and awards. There are many reasons you should want to attend a hackathon, but here are just a few benefits that ColaHacks will be offering:
  • Free catered food and refreshments all day long
  • Awards of up to $750, as well as gifts such as Google Homes, Amazon Echos, 3D printing pens and more!
  • Door prizes and giveaways
  • Opportunities to network with students and technologists in the local area
  • Growth in technical skills, presentation abilities, and leadership.
  • Access to engineers and recruiters from top local tech companies, including 52Inc, Swampfox, Boeing, AgFirst, and more
  • If you have any questions, feel free to reach out to the organizing team at colahacks@gmail.com. Make sure to register soon at: www.colahacks.com. Thank you for your time, and we look forward to seeing you on April 14!
Best, ColaHacks 2018

Organizers

Colahacks is being organized by two of the Unversity of South Carolina's largest CS organizations: UofSC's Chapter of the Assocation of Computing Machinery and Women in Computing. Both clubs strive to provide out of the classroom learning experiences for students.

Bytecode-based Multiple Condition Coverage: an Initial Investigation

Wednesday, April 11, 2018 - 01:30 pm
Meeting room 2267, Innovation Center
THESIS DEFENSE Author : Srujana Bollina Advisor : Dr. Gregory Gay Abstract Masking occurs when one condition prevents another condition from influencing the output of a Boolean expression. Logic-based adequacy criteria such as Multiple Condition Coverage (MCC) are designed to overcome masking at the within-expression level, but can offer no guarantees about masking in subsequent expressions. As a result, a Boolean expression written as a single complex statement will yield test cases that are more likely to overcome masking than when the expression is written as series of simple statements. Many approaches to automated analysis and test case generation for Java systems operate not on the source code representation of code, but on the bytecode. The transformation from source code to bytecode requires simplifying code elements, introducing the risk of masking. We propose Bytecode-MCC, designed to group related Boolean expressions from the bytecode, reformulate the expressions into a single complex expression, and produce test cases satisfying each combination of conditions in the constructed expression. Bytecode-MCC should produce test obligations that—when satisfied—are more likely to reveal faults in the program logic than tests providing coverage of existing criteria over the simplified bytecode. A preliminary study has hinted at the potential of this approach. However, Bytecode-MCC is more difficult to achieve than Branch Coverage, and means of increasing coverage are needed to truly test the fault-detection potential of this technique. We propose methods of improving Bytecode-MCC coverage through automated generation that we will explore in future work. Date : April 11th , 2018 Time : 1:30 pm – 2:30 pm Place : Meeting Room 2267, Innovation Center

Ontology-Guided Pre-Release Inference Disruption

Wednesday, April 11, 2018 - 10:00 am
Meeting room 2267, Innovation Center
DISSERTATION DEFENSE Author: Mark Daniels Advisor: Dr. Csilla Farkas Abstract An individual’s healthcare data may be the most private information a person possesses. Current regulations, such as the Health Insurance Portability and Accountability Act of 1996 (HIPAA), safeguard patient data by assigning a sensitivity level to data items. However, this approach is limited when domain knowledge is used to infer additional patient data. In our research, we investigate privacy violations occurring when non-confidential patient data is combined with medical domain ontologies to disclose a patient’s protected health information (PHI). We developed a framework that detects privacy violations and eliminates undesired inferences. Our inference channel removal process is based on controlling the release of the data items that lead to undesired inferences. These data items are either blocked from release or generalized to eliminate the disclosure of the PHI. We first developed an exhaustive framework to disrupt the undesired inferences, then improved on the methods using a heuristic-based approach. Our privacy model includes traditional security assessments (i.e., HIPAA) as well as considering safety and patient privacy preferences. We developed a graphic user interface that allows patients to control the release of their data. We also visualize the inferred data using the healthcare domain knowledge. Date: April 11th, 2018 Time: 10:00 am Place: Meeting room 2267, Innovation Center

The Design, Development, and Evaluation of an Usable and Privacy-Enhanced Telepresence Interface for Older Adults

Tuesday, April 3, 2018 - 10:00 am
Meeting room 2265, Innovation Center
DISSERTATION DEFENSE Author : Xian Wu Advisor : Dr. Jenay Beer Abstract Maintaining health and wellness while aging-in-place independently is crucial for older adults. Telepresence technology can be potentially beneficial for this target population to stay socially connected. However, this technology is not specifically designed for older adults. For this target population to adopt such technology successfully, it is important to ensure that they do not experience usability barriers. This research uses HCI/HRI concepts and technology design principles for older adults to design, develop and test telepresence user interfaces (UI). This addresses the following research questions: 1): What are the essential usability and privacy-enhanced features needed to inform the design and development of a new telepresence UI for aging population? 2): Is the new telepresence UI perceived as more usable and private by older users compared to traditional telepresence UI design? Thirty older adults aged above 60 in South Carolina and Georgia participated in a within-subjects user-testing with two UIs: 1) a generic UI called Presence designed based on currently available telepresence robots; and 2) a privacy-enhanced usable telepresence UI named InTouch. Participants tested both UIs in a virtual home environment developed in Unity. Results of this study suggest that older adults perceived InTouch to be more usable and private. This study provides insight on what usability and privacy features are critical for the aging population to use such telepresence technology. By investigating the design of telepresence robots for older users, and applying those findings to design recommendations, the final goal is to improve the ease of use and privacy level of telepresence robots – not only for our target users, but for all users who wish to enhance their social connectedness. Date : April 3rd , 2018 Time : 10:00 am Place : Meeting room 2265, Innovation Center

Complex Models to Understand Complex Health Behaviors

Friday, March 30, 2018 - 10:15 am
Innovation Center, Room 2277
COLLOQUIUM Rahmatollah Beheshti Abstract Most of the health conditions are directly or indirectly resulted from humans’ decisions. These decisions are affected by a wide range of personal and environmental factors. While understanding health decision- making processes can lead to significant breakthroughs in both treatment and prevention of different diseases, due to their complex nature, our knowledge about many of these processes is very limited. Computational and data-driven techniques are increasingly considered as powerful options to fuse various types of data (such as biological and behavioral data) to understand these complexities. In this talk, Dr. Beheshti will present several projects from the areas of smoking and obesity research in which he has used complex systems and AI methods to study health behaviors. Specifically, he will talk about one of his recent projects studying the role of price in food decision-making. Dr. Rahmatollah Beheshti is a fourth-year postdoctoral fellow at the Johns Hopkins Bloomberg School of Public Health, with a joint appointment in the Department of Applied Math & Statistics at Johns Hopkins. He has a PhD in Computer Science and a Master in Artificial Intelligence and has been working in the area of Computational Epidemiology and Health Data Analytics for the past eight years. He has close to 20 first author full articles in these areas. Specifically, he has worked extensively on two major public health epidemics: smoking and obesity and has focused on very different aspects of these two, including the social, economic, environmental, and lately biological factors that affect those epidemics. Date: Mar. 30 2018 Time: 10:15-11:15 am Place: Innovation Center, Room 2277

Ms. An (Meeting Students’ Academic Needs): A socially adaptive robot Tutor for Student Engagement in Math Education

Tuesday, March 27, 2018 - 10:00 am
Meeting room 2265, Innovation Center
DISSERTATION DEFENSE Author : Karina Liles Advisor : Dr. Jenay Beer Abstract This research presents a new, socially adaptive robot tutor, Ms. An (Meeting Students’ Academic Needs). The goal of this research was to use a decision tree model to develop a socially adaptive robot tutor that predicted and responded to student emotion and performance to actively engage students in math education. The novelty of this multi-disciplinary project is the combination of the fields of HRI, AI, and education. In this study we 1) implemented a decision tree model to classify student emotion and performance for use in adaptive robot tutoring-an approach not applied to educational robotics; 2) presented an intuitive interface for seamless robot operation by novice users; and 3) applied direct human teaching methods (guided practice and progress monitoring) for a robot tutor to engage students in math education. Twenty 4th and 5th grade students in rural South Carolina participated in a between subjects study with two conditions: A) with a non-adaptive robot (control group); and B) with a socially adaptive robot (adaptive group). Students engaged in two one-on-one tutoring sessions to practice multiplication per the South Carolina 4th and 5th grade math state standards. Although our decision tree models were less optimal than we had hoped, the results gave answers to our current questions and clarity for future directions. Our adaptive strategies to engage students academically were effective. Further, all students enjoyed working with the robot and we did not see a difference in emotional engagement across the two groups. Our adaptive strategies made students think more deeply about their work and focus more. This study offered insight for developing a socially adaptive robot tutor to engage students academically and emotionally while practicing multiplication. Results from this study will inform the human-robot interaction (HRI) and artificial intelligence (AI) communities on best practices and techniques within the scope of this work. Date : March 27th, 2018 Time : 10:00 am Place : Meeting room 2265, Innovation Center

Computational Brain Connectome: From Reverse Engineering the Brain to Understand Brain Connectivity

Monday, March 26, 2018 - 10:15 am
Innovation Center, Room 2277
COLLOQUIUM Guorong Wu Abstract Neuroimaging research has developed rapidly in last decade, with various applications of brain mapping technologies that provide mechanisms for discovering neuropsychiatric disorders in vivo. The human brain is something of an enigma. Much is known about its physical structure, but how it manages to marshal its myriad components into a powerhouse capable of performing so many different tasks remains a mystery. In this talk, I will demonstrate that it is more important to understand how the brain regions are connected rather than study each brain region individually. I will introduce my recent research on human brain connectome, with the focus on revealing high-order brain connectome and functional dynamics using learning-based approaches, and the successful applications in identifying neuro-disorder subjects such as Autism and Alzheimer’s disease. Dr. Guorong Wu is an Assistant Professor in Department of Radiology at the University of North Carolina, Chapel Hill. His primary research interests are medical image analysis, big data mining, scientific data visualization, and computer-assisted diagnosis. He has been working on medical image analysis since he started my Ph.D. study in 2003. In 2007, he received the Ph.D. degree in computer science and engineering from Shanghai Jiao Tong University, Shanghai, China. He has developed many image processing methods for brain magnetic resonance imaging (MRI), diffusion tensor imaging, breast dynamic contrast-enhanced MRI (DCE-MRI), and computed tomography (CT) images. These cutting-edge computational methods have been successfully applied to the early diagnosis of Alzheimer’s disease, infant brain development study, and image-guided lung cancer radiotherapy. Meanwhile, Dr. Wu lead a multi- discipline research team in UNC which aims to translate the cutting-edge intelligent techniques to the imaging-based biomedical applications, for the sake of boosting translational medicine. Dr. Wu has released more than ten image analysis software packages to the medical imaging community, which count to totally more than 15,000 downloads since 2009. Dr. Wu is the recipient of NIH Career Development Award (K01) and PI of NIH Exploratory/Developmental Research Grant Award (R21). He also serves as the Co-PI and Co-Investigator in other NSF and NIH grants. Date: Mar. 26 2018 Time: 10:15-11:15 am Place: Innovation Center, Room 2277

Protein Structure Determination as a Computational Problem

Friday, March 23, 2018 - 10:15 am
Innovation Center, Room 2277
COLLOQUIUM Kamal Al Nasr Abstract The development process of new drugs can cost on average $4 billion. Therefore, it is strategic to apply robust computational approaches to cover a broader chemical space like computer-aided drug design while reducing the number of compounds that must be synthesized and tested in vitro to keep costs low. Protein structural information is a crucial input for computer-aided drug design. Conventional determination techniques such as X-ray crystallography are time consuming and fail with proteins that are hard to crystallize. Likewise, traditional computational techniques are unsuccessful with many types of proteins such as membrane and macromolecular proteins that make up more than the half of contemporary drug targets. In contrast, Cryo-Electron Microscopy (cryo-EM) is a biophysics technique that generates volumetric images to determine structures of macromolecular complexes and assembles. However, it is challenging to determine the atomic structures from images generated at sub-nanometer resolution using cryo-EM. In addition, the volume of prospective sub-nanometer EM images to be analyzed has rapidly grown. Therefore, powerful computational methods such as de novo modeling are thus needed to make use of the available cryo-EM data. In this presentation, I will present some challenging problems and computational approaches to use the non-atomic images of cryo-EM to model protein structures. Novel algorithms, image processing techniques, and data analysis will be presented to overcome the hinder of resolution problem of cryo-EM. Dr. Kamal Al Nasr is an assistant professor of Computer Science at Tennessee State University since August 2013. He received his Bachelor's and Master's degree in Computer Science from Yarmouk University, Jordan in 2003 and 2005, respectively. Dr. Al Nasr received another Master's degree in Computer Science from New Mexico State University, Las Cruces, NM in 2011. He received his Ph.D. in Computer Science from Old Dominion University, Norfolk, VA in 2012. During his Ph.D. study, he was awarded College of Science's university fellowship on July 2010. He Joined the Department of Systems and Computer Science at Howard University, Washington, D.C. as a postdoctoral research scientist in 2012. His research interest is centered on developing efficient computational methods for protein structure prediction in de novo modeling. Specifically, he focuses on using Electron Cryo-Microscopy (cryo-EM), high performance computing, data analytics, and graph theory to design algorithms, which efficiently predict the 3-dimensional structure of proteins. During his structural bioinformatics research, Dr. Al Nasr has written several peer-reviewed papers in national and international journals and proceedings. Further, Dr. Al Nasr has two active grants from national agencies (i.e., NSF and NIH) to support his research. Date: Mar. 23 2018 Time: 10:15-11:15 am Place: Innovation Center, Room 2277

Cross-Area Approaches to Innovative Security Solutions

Wednesday, March 21, 2018 - 10:15 am
Innovation Center, Room 2277
COLLOQUIUM Qiang Zeng Abstract By applying out-of-the-box thinking and cross-area approaches, novel solutions can be innovated to solve challenging problems. In this talk, I will share my experiences in applying cross-area approaches, and present creative designs to solve two difficult security problems. Problem 1: Decentralized Android Application Repackaging Detection. An unethical developer can download a mobile application, make arbitrary modifications (e.g., inserting malicious code and replacing the advertisement library), repackage the app, and then distribute it; the attack is called application repackaging. Such attacks have posed severe threats, causing $14 billion monetary loss annually and propagating over 80% of mobile malware. Existing countermeasures are mostly centralized and imprecise. We consider building the repackaging detection capability into apps, such that user devices are made use of to detect repackaging in a decentralized fashion. In order to protect repackaging detection code from attacks, we propose a creative use of logic bombs, which are commonly used in malware. The use of hacking techniques for benign purposes has delivered an innovative and effective defense technique. Problem 2: Precise Binary Code Semantics Extraction. Binary code analysis allows one to analyze a piece of binary code without accessing the corresponding source code. It is widely used for vulnerability discovery, dissecting malware, user-side crash analysis, etc. Today, binary code analysis becomes more important than ever. With the booming development of the Internet-of-Things industry, a sheer number of firmware images of IoT devices can be downloaded from the Internet. It raises challenges for researchers, third-party companies, and government agents to analyze these images at scale, without access to the source code, for identifying malicious programs, detecting software plagiarism, and finding vulnerabilities. I will introduce a brand new binary code analysis technique that learns from Natural Language Processing, an area remote from code analysis, to extract useful semantic information from binary code. Dr. Qiang Zeng is an Assistant Professor in the Department of Computer & Information Sciences at Temple University. He received his Ph.D. in Computer Science and Engineering from the Pennsylvania State University, and his B.E. and M.E. degrees in Computer Science and Engineering from Beihang University, China. He has rich industry experiences and ever worked in the IBM T.J. Watson Research Center, the NEC Lab America, Symantec and Yahoo. Dr. Zeng’s main research interest is Systems and Software Security. He currently works on IoT Security, Mobile Security, and deep learning for solving security problems. He has published papers in PLDI, NDSS, MobiSys, CGO, DSN and TKDE. Date: Mar. 21 2018 Time: 10:15-11:15 am Place: Innovation Center, Room 2277

Signal processing and other forms of computation with biomolecular (DNA) reactions

Monday, March 19, 2018 - 10:15 am
Innovation Center, Room 2277
COLLOQUIUM Sayed Ahmad Salehi Abstract With the recent advances in the field of synthetic biology, molecular computing has emerged as a non- conventional computing technology and a broad range of computational processes has been considered for molecular implementation. In contrast to electronic systems where signals are represented by time-varying voltage values, in molecular computing systems signals are represented by time-varying concentrations of molecular types. The field aims for the design of custom, embedded biological “controllers” – DNA molecules that are engineered to perform useful tasks in situ, such as cancer detection and smart drug therapy. The past few decades have seen remarkable progress in the design of integrated electronic circuits for digital signal processing and other forms of computation. Nowadays, in terms of circuit complexity, the pace of progress in biotechnology is similar to, even faster than, integrated circuits; it’s like a golden age of molecular circuit design. This seminar presents how the knowledge and expertise in circuit design can be applied and extended to the domain of molecular computing. The talk has two main parts. First, some frameworks are explained for the development of molecular systems computing signal processing operations such as frequency filters. Second, a new molecular encoding, called fractional coding, is introduced to map digital stochastic computing circuits into molecular circuits. Based on this approach, molecular computation of complex mathematical functions and a single-layer neural network (perceptron) is described. Dr. Sayed Ahmad Salehi received his MSc. and Ph.D. in Electrical and Computer Engineering (with minor in Computer Science) from the University of Minnesota in 2015 and 2017, respectively. Dr. Salehi is currently an assistant professor in the Computer Science and Engineering Department at Utah Valley University. His research interests include low-power VLSI architectures for signal processing, embedded systems, stochastic computing, and molecular (DNA) computing. He is the recipient of the University of Minnesota Doctoral Dissertation Fellowship in 2016 and the finalist for the best paper award in DSP2015 conference. Date: Mar. 19 2018 Time: 10:15-11:15 am Place: Innovation Center, Room 2277