BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190505T210834Z
DTSTART;TZID=America/Los_Angeles:20190510T150000
DTEND;TZID=America/Los_Angeles:20190510T160000
TRANSP:OPAQUE
SUMMARY:Solving Hard Computational Problems using Oscillator Networks: PhD Dissertation Talk
UID:125647-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:540 Cory Hall
DESCRIPTION:Tianshi Wang\, Graduate Student\, EECS Department\, UC Berkeley\n\nOver the last few years\, there has been considerable interest in Ising machines\, ie\, analog hardware for solving difficult (NP hard/complete) computational problems effectively. \nWe present a new way to make Ising machines using networks of coupled self-sustaining nonlinear oscillators. \nOur scheme is theoretically rooted in a novel result that connects the phase dynamics of coupled oscillator systems with the Ising Hamiltonian.\nWe show that oscillators can be designed to take on a binary phase\, and a network of such binary oscillators has phase dynamics evolving naturally towards local minima of the Ising Hamiltonian. \nTwo simple additional steps (ie\, adding noise\, and tuning the binarization strength up and down) enable the network to find excellent solutions of Ising problems. \nWe evaluate our method on Ising versions of the MAX-CUT problems\, showing that it improves on previously published results on several benchmark problems. \nOur scheme\, which is amenable to realization using many kinds of oscillators from different physical domains\, is particularly well suited for CMOS\, in which it offers significant practical advantages over previous techniques for making Ising machines. \nWe have demonstrated several working hardware prototypes using CMOS electronic oscillators\, built on breadboards and PCBs\, implementing Ising machines consisting of 4\, 8\, 32\, 64 and 240 spins.\n\nIn this talk\, we will also go over my other Ph.D. work that has led to the development of oscillator-based Ising machines. \nIn particular\, we show that binary oscillators are not only useful for Ising\, but can also be used to devise Finite State Machines for general-purpose Boolean computation with phase-based logic encoding\, extending a scheme originally proposed by John von Neumann.\nWe also briefly show my other research topics that have enabled the above work on oscillators\, particularly those on the modelling of multi-domain nonlinear devices/systems\, and those on advanced simulation analyses (eg\, oscillator-specific analyses based on linear periodically time-varying system theory).\n\nAt the end of this talk\, there will be a lab demonstration of a prototype oscillator-based Ising machine of 240 spins with programmable couplings.\nThe prototype is built using off-the-shelf components on PCBs\, roughly 10"x6"x4" in size\, and interfaces with a laptop through USB.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=125647&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20190505T210834Z
LAST-MODIFIED:20190506T164247Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR