- About Oregon State EECS
- Secret Sauce
- News & Publications
- Life in Corvallis
- Our Building
- Visit Us
- Building a CS Online Degree Program for Post-Baccs
- Research and Innovation
- Research Overview
- Research Areas
- Faculty Research Profiles
- Technology Transfer
- Research Opportunities for Undergraduates
- Online Library
- Industry Relations
- My EECS
Once every week while school is in session, EECS invites a distinguished researcher or practitioner in a computer science or electrical and computer engineering-related field to present their ideas and/or work. Talks are generally targeted to Electrical Engineering and Computer Science graduate students. This colloquium series is free and open to everyone.
Monday, April 28, 2014 - 4:00pm - 4:50pm
The first part of this presentation will give a brief overview of research at Connection One on RF, Analog and PMIC. This will be followed by a presentation on Digital Linear Drop-out Regulators and the development of Power Management IC. The development of multi-core highly integrated systems-on-a-chip has created the need for small, fully integrated voltage regulators that operate on a per-core basis. In order to maximize efficiency, most SOC's apply dynamic voltage and frequency scaling (DVFS) on each block of the system to adjust the power based on performance demands. Analog regulators are poorly suited to this task as they are difficult to integrate on sub-micron processes, consume more power, and require precision external capacitors to ensure stability. The development of Digital LDO regulators is intended to address these drawbacks of analog regulators.
Monday, May 12, 2014 - 4:00pm - 4:50pm
Consider the inverse problem of machine learning: a teacher knows a learner's learning algorithm and wants to construct the smallest (non-iid) training set to guide the learner to a specific target model. This problem, which we call machine teaching, is about designing the optimal "lesson" to maximally influence the learner. One application of machine teaching is in the security of machine learning systems that accept online training data. Here, the teacher is an attacker who can manipulate the training data. The computational problem is for the attacker to identify the minimum-cost manipulation so that the machine learner will be misled to a model that is beneficial to the attacker. A more friendly application of machine teaching is in education, where the teacher wishes to design the best lesson for a human student. Note that in both applications the teacher may only interact with the learner via the training data. I will introduce an optimization-based framework for machine teaching, balancing the goals of "teaching well" and "minimizing teaching effort." For certain learners, machine teaching has a closed-form solution. But in general the optimization problem is combinatorial. I will discuss two approximate solution techniques based on conjugate duality and submodularity. I will also discuss the relation between machine teaching, active learning, and teaching dimensions. Finally, I demonstrate the application of machine teaching with attacks on several popular machine learning models.
Monday, May 19, 2014 - 4:00pm - 4:50pm
Current research on web search has focused on optimizing and evaluating single queries. However, a significant fraction of user queries are part of more complex tasks which span multiple queries across one or more search sessions. An ideal search engine would not only retrieve relevant results for a user's particular query but also be able to identify when the user is engaged in a more complex task and aid the user in completing that task. Toward optimizing whole-session or task relevance, we characterize and address the problem of intrinsic diversity (ID) in retrieval, a type of complex task that requires multiple interactions with current search engines. Unlike existing work on extrinsic diversity that deals with ambiguity in intent
across multiple users, ID queries often have little ambiguity in intent but seek content covering a variety of aspects on a shared theme. In such scenarios, the underlying needs are typically exploratory, comparative, or breadth-oriented in nature. We identify and address three key problems for ID retrieval: identifying authentic examples of ID tasks from post-hoc analysis of behavioral signals in search logs; learning to identify initiator queries that mark the start of an ID search task; and given an initiator query, predicting which content to pre-fetch and rank.
This is joint work with Karthik Raman and Kevyn Collins-Thompson and was the winner of the SIGIR 2013 Best Student Paper Award
Monday, April 21, 2014 - 4:00pm - 4:50pm
Jim Kemerling and Darrell Teegarden
Triad Semiconductor, Founder, CTO, Executive VP (Jim Kemerling)
Mentor Graphics, Business Unit Director, System Modeling & Analysis (Darrell Teegarden)
Friday, April 18, 2014 - 12:00pm - 1:00pm
Douglas W. Fisher
General Manager, Software and Services Group
Friday, April 18, 2014 - 8:45am - 10:00am
Secure Software Systems Lab
Friday, April 11, 2014 - 8:45am - 10:00am
Cryptography and Information Security Group
Thursday, April 10, 2014 - 8:45am - 10:00am
University of Southern California
Wednesday, April 9, 2014 - 8:45am - 10:00am
Computer Science Department
Brigham Young University
Thursday, April 3, 2014 - 8:45am - 10:00am
School of Electrical and Computer Engineering
Directions to Oregon State and parking information
The colloquium series takes place on the main Oregon State campus. The colloquium is held usually in KEC 1001, 4:00 - 4:50 pm. [map and catalog listing]. However, please be sure to check the schedule, as room changes occur with some frequency.
Speaking in the colloquium series
Speaking in the EECS Colloquium series provides an excellent opportunity to meet and interact with faculty and students of the Oregon State School of EECS. Our faculty are always interested in exploring new possibilities of collaboration. If you would be interested in being invited to speak, please contact the colloquium director.
Visiting the School of EECS before or after a colloquium
If you are planning on attending a colloquium, consider taking the opportunity to visit the School of EECS before or after the colloquium. To make arrangements for your visit, please contact Tina Batten via e-mail or phone (541-737-8613).
Groups attending the colloquium series
If you intend to bring a substantial size group (10 people or more), please notify the colloquium director so that we can ensure that we schedule a lecture room with sufficient capacity.
For more information
School of EECS
Oregon State University
1148 Kelley Engineering Center
Corvallis, OR 97331-5501
Phone: +1 541-737-4544