# Computer Science

## BCData 2018 Career Panel

### Moderated Questions

- What was the first job you had after graduation and how did you get it?
- What do you like most/least about your current work?
- If you could go back in time and change one thing about your career choices what would you do?
- What advice do you have for the students in the audience looking for their first job?

### Speaker Bios

**Bernard Chan**is currently a data scientist at BuildDirect.com (BD), an e-commerce platform in flooring, tiles and other home improvement products. At BD, Bernard is part of the analytics team and he specializes in logistics related data problems such as freight rate and route planning. Prior to working at BD, Bernard was a applied mathematics researcher in dynamical systems and bifurcation theory.

**Soyean Kim**is a professional statistician (P.STAT) who is passionate about ethical use of data and algorithms to contribute to the betterment of society. She currently leads a team of data scientists at Technical Safety BC, a safety regulator in Canada. Her key contribution includes advancing ethics roadmap in predictive system and deployment of AI and machine learning to help safety inspection process. Her previous leadership roles include her tenure at PricewaterhouseCoopers and Fortis as a rate design manager. She is an advocate for “Data for Good” and a speaker on the topic of real world applications of AI. Her latest speaking engagement includes PAPIs in London, UK which is a series of international AI conferences, and BC Tech Summit in Vancouver.

**Michael Reid**received a Bachelor’s in Mathematics from UMBC before starting work as junior web developer for a US federal government consulting agency. After moving to Vancouver, he’s worked in software engineering at companies ranging from small consulting firms to Amazon Web Services. He recently co-founded Nautilus Technologies, a machine learning and data privacy startup in Vancouver.

**Parin Shah**is a Data Scientist at KPMG focused on solving machine learning and data engineering problems in the space of mining, gaming, insurance and social media. Previously, he spent 2.5 years helping develop the digital analytics practice for an e-commerce firm, Natural Wellbeing, where he worked on setting up data infrastructure, building consumer analytics models and website experimentation. Parin was a fellow at a UBC machine learning workshop and has an undergraduate degree from the University of British Columbia (UBC) with a coursework concentrated in economics with statistics and computer science electives.

**Dr. Aanchan Mohan**is a machine learning scientist and software engineer at Synaptitude Brain Health. He is currently working on software and machine learning methods to encourage circadian regulation with the goal of improving an individual’s brain health. His current research interests include problems in natural language processing. Dr. Mohan has worked on Bayesian and deep learning methods applied to time series signals across multiple domains. He holds a PhD from McGill University where he focused on transfer learning and parameter sharing in acoustic models for speech recognition. He supervises students and actively publishes in the area of speech processing. He is a named co-inventor on two issued patents in the area of speech processing, and one filed patent in the area of wearable devices. He is a co-organizer of the AI in Production, and Natural Language Processing meetups in Vancouver.

## Reconfiguration of Triangulations of a Planar Point Set

## Using physical metaphors to understand networks

## Using physical metaphors to understand networks

## PIMS-SFU 20th Anniversary Celebration: Nataša Pržulj - Data Driven Medicine

The Pacific Institute for the Mathematical Sciences (PIMS) was founded in 1996, and Simon Fraser University is a founding member. The members of PIMS now include all the major Canadian research universities west of Ontario, as well as universities in Washington and Oregon. Please join us to celebrate 20 years of productive collaboration, with a lecture by SFU alumna and professor at UCL Nataša Pržulj on Data Driven Medicine followed by a reception.

We are faced with a flood of molecular and clinical data. Various biomolecules interact in a cell to perform biological function, forming large, complex systems. Large amounts of patient-specific datasets are available, providing complementary information on the same disease type. The challenge is how to model and mine these complex data systems to answer fundamental questions, gain new insight into diseases and improve therapeutics. Just as computational approaches for analyzing genetic sequence data have revolutionized biological and medical understanding, the expectation is that analyses of networked “omics” and clinical data will have similar ground-breaking impacts. However, dealing with these data is nontrivial, since many questions we ask about them fall into the category of computationally intractable problems, necessitating the development of heuristic methods for finding approximate solutions.

We develop methods for extracting new biomedical knowledge from the wiring patterns of large networked biomedical data, linking network wiring patterns with function and translating the information hidden in the wiring patterns into everyday language. We introduce a versatile data fusion (integration) framework that can effectively integrate somatic mutation data, molecular interactions and drug chemical data to address three key challenges in cancer research: stratification of patients into groups having different clinical outcomes, prediction of driver genes whose mutations trigger the onset and development of cancers, and re-purposing of drugs for treating particular cancer patient groups. Our new methods stem from network science approaches coupled with graph-regularised non-negative matrix tri-factorization, a machine learning technique for co-clustering heterogeneous datasets.

## Sparsity, Complexity and Practicality in Symbolic Computation

Modern symbolic computation systems provide an expressive language for describing mathematical objects. For example, we can easily enter equations such as

into a computer algebra system. However, to determine the factorization

with traditional methods would incur huge expression swell and high complexity. Indeed, many problems related to this one are provably intractable under various reasonable assumptions, or are suspected to be so. Nonetheless, recent work has yielded exciting new algorithms for computing with sparse mathematical expressions. In this talk, we will attempt to navigate this hazardous computational terrain of sparse algebraic computation. We will discuss new algorithms for sparse polynomial root finding and functional decomposition. We will also look at the "inverse" problem of interpolating or reconstructing sparse mathematical functions from a small number of sample points. Computations over both traditional" exact and symbolic domains, such as the integers and finite fields, as well as approximate (floating point) data, will be considered.

## Foundational Methods in Computer Science

## The Mathematics of Lattice-based Cryptography

TBA

## High dimensional expanders and Ramanujan complexes

Expander graphs have played, in the last few decades, an important role in computer science, and in the last decade, also in pure mathematics. In recent years a theory of "high-dimensional expanders" is starting to emerge - i.e., simplical complexes which generalize various properties of expander graphs. This has some geometric motivations (led by Gromov) and combinatorial ones (started by Linial and Meshulam). The talk will survey the various directions of research and their applications, as well as potential applications in math and CS. Some of these lead to questions about buildings and representation theory of p-adic groups.

We will survey the work of a number of people. The works of the speaker in this direction are with various subsets of { S. Evra, K. Golubev, T. Kaufman, D. Kazhdan , R. Meshulam, S. Mozes }

## High Dimensional Expanders and Ramanujan Complexes

Expander graphs have played, in the last few decades, an important role in computer science, and in the last decade, also in pure mathematics. In recent years a theory of "high-dimensional expanders" is starting to emerge - i.e., simplical complexes which generalize various properties of expander graphs. This has some geometric motivations (led by Gromov) and combinatorial ones (started by Linial and Meshulam). The talk will survey the various directions of research and their applications, as well as potential applications in math and CS. Some of these lead to questions about buildings and representation theory of p-adic groups.

We will survey the work of a number of people. The works of the speaker in this direction are with various subsets of { S. Evra, K. Golubev, T. Kaufman, D. Kazhdan , R. Meshulam, S. Mozes }