Loading AI tools
American electrical engineer From Wikipedia, the free encyclopedia
Bruce Edward Hajek (born August 20, 1955) is a Professor in the Coordinated Science Laboratory, the head of the Department of Electrical and Computer Engineering, and the Leonard C. and Mary Lou Hoeft Chair in Engineering at the University of Illinois Urbana–Champaign.[4][5][6] He does research in communication networking, auction theory, stochastic analysis, combinatorial optimization, machine learning, information theory, and bioinformatics.
Bruce Hajek | |
---|---|
Born | Bruce Edward Hajek August 20, 1955 |
Title | Head of ECE department Leonard C. and Mary Lou Hoeft Endowed Chair in Engineering Professor, ECE Professor, CSL Professor, Center for Advanced Study[2] |
Spouse | Beth Scheid[3] |
Awards |
|
Academic background | |
Education |
|
Alma mater | UC Berkeley (PhD) |
Thesis | Stochastic Integration, Markov Property and Measure Transformation of Random Fields (1979) |
Doctoral advisor | Eugene Wong |
Academic work | |
Discipline | Electrical and computer engineering |
Sub-discipline | Communication networks Random processes |
Institutions | UIUC |
Doctoral students | |
Website | http://hajek.ece.illinois.edu/ |
Bruce Hajek attended Willowbrook High School in Villa Park, Illinois. In 1973, he won the USA Mathematical Olympiad.[7][8] In the same year, he graduated from high school. He entered the University of Illinois Urbana–Champaign (UIUC) to study computer science, but later he switched his major to mathematics.[9] After working in Summer 1975 at Brookhaven National Laboratory[1] with Herbert Robbins,[10] he graduated in 1976 with a BS in mathematics from UIUC and received an NSF Graduate Research Fellowship. He completed his MS degree in electrical engineering in 1977, again from UIUC, and then took his Fellowship to UC Berkeley, where he received his PhD in 1979 under Eugene Wong.[11][12] The same year, he returned to the department of UIUC in Electrical & Computer Engineering, starting as an assistant professor and then becoming an associate professor (1982) and then a professor (1985).[5] He was named the Leonard C. and Mary Lou Hoeft Chair in Engineering in 2006.[13]
Since 1986, he has been a recurring visitor at Cambridge University.[14] In the 2009-2010 academic year, he was appointed a Rothschild Distinguished Visiting Fellow at the Isaac Newton Institute for Mathematical Sciences at Cambridge.[15]
In 1989, Bruce Hajek was elevated to IEEE fellow for contributions to stochastic systems, communication networks, and control systems.[16]
From 1990 to 1993, Hajek served as the editor-in-chief for the IEEE Transactions on Information Theory.[17] In 1995, he served as the president of the IEEE Information Theory Society.[18] He has mentored 18 PhD students, including IBM CEO Arvind Krishna.[19][20]
Bruce Hajek's PhD dissertation, titled Stochastic Integration, Markov Property and Measure Transformation of Random Fields,[21][22] studied random fields of three types: continuous-parameter Markov random fields, continuous-parameter random fields admitting stochastic-integral representations, and random fields "arising from transformations of absolutely continuous measures". This work on random fields has been recognized by others.[23] In 1987, Hajek and Toby Berger showed that, under weak assumptions, a Markov random field whose entries take values in a finite-order field (F,+,·) can be written as a component-wise sum of two independent random fields with F-valued components, with one of these two random fields being independent and identically distributed according to a nondegenerate probability measure.[24]
Hajek's work has significantly furthered the integration of computers and communications systems. His many papers have taken the chaotic field of communication networking and given it a coherence and conceptual structure that it previously lacked. In the early 1980s, he led research that proved the stability of dynamically controlled ALOHA multiple access. He and his students also developed algorithms for dynamic routing and transmission scheduling. These innovations showed that determinism in service time minimizes waiting time in network queues.[25] In relation to these achievements, he was inducted to the National Academy of Engineering in 1999 "for contributions to stochastic systems, communication networks, and control".[26] In 2003, he received the IEEE Kobayashi Award "for the application of stochastic and probabilistic theory to improved understanding of computer-network behavior, particularly, the modeling and performance optimization of multiple-access channels."
The citation for the 2015 ACM SIGMETRICS Achievement Award says,[27]
Dr. Hajek has contributed to understanding fundamentally important issues such as how burstiness creates delays in queuing systems, and how burstiness can be mitigated. In several contexts he elaborated the consequences of drift towards desireable equlibria in networks, with applications to simulated annealing for discrete optimization problems. His work on the structure of optimal control mechanisms for routing and load balancing led to proofs of threshold structure, and invention of the concepts of load percolation and multimodular functions. He also introduced novel applications of game theory within network analysis, such as a jamming game for timing channels and truthful mechanisms for flow control.
A large fraction of Hajek's citations[28] comes from his work on simulated annealing.[29][10][30][31][32][33] His most cited paper, Cooling schedules for optimal annealing,[32][10] gives a nice condition for convergence of simulated annealing to global minima, depending on the annealing schedule.
In 2015, Hajek collaborated with Cambridge University Press to publish as a book his course notes for his Random Processes course, ECE 534, at UIUC. The book is titled Random Processes for Engineers.[34] He is also a co-author on the second edition of a more advanced book, Eugene Wong's Stochastic Processes in Engineering Systems (Springer, 1985).[35]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.