{"id":30,"date":"2021-04-25T11:15:24","date_gmt":"2021-04-25T11:15:24","guid":{"rendered":"http:\/\/140.114.54.13\/aaac2021\/?page_id=30"},"modified":"2023-07-28T16:44:58","modified_gmt":"2023-07-28T08:44:58","slug":"invited-talk","status":"publish","type":"page","link":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/invited-talk\/","title":{"rendered":"INVITED TALK"},"content":{"rendered":"<h5 style=\"text-align: justify;\"><strong>Keynote Speeches<\/strong><\/h5>\n<table style=\"width: 100%; table-layout: fixed;\" border=\"none\" align=\"left\">\n<tbody>\n<tr>\n<td><a href=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama.png\"><img loading=\"lazy\" class=\"size-thumbnail wp-image-33 alignnone\" src=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama-150x150.png\" alt=\"\" width=\"150\" height=\"150\" srcset=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama-150x150.png 150w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama-300x300.png 300w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama-50x50.png 50w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Kazuo_Iwama.png 342w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/p>\n<ul>\n<li>Kazuo Iwama<br \/>\n(RIMS, Kyoto University)<\/li>\n<li><span style=\"font-size: small;\" title=\"Abstract: The classic Tower of Hanoi puzzle involves moving a set of disks on\nthree pegs.  The number of moves required for a given number of disks\nis easy to determine, but when the number of pegs is increased to four\nor more this becomes more challenging.  After 75 years the answer for\nfour pegs was resolved only recently, and this \\emph{time complexity}\nquestion remains open for five or more pegs.  In this article the\n\\emph{space complexity}, i.e., how many disks need to be accommodated\non the pegs involved in the transfer, is considered for the first\ntime.  Suppose $m$ disks are to be transferred from some peg $L$ to\nanother peg $R$ using $k$ intermediate \\emph{work pegs} of sizes\n$j_1,\\ldots,j_k$, then how large can $m$ be? We denote this value by\n$H(j_1,\\ldots,j_k)$.  If $k=1$, as in the classic problem, the answer\nis easy: $H(j)=j+1$.  We have the exact value for two work pegs, but\nso far only very partial results for three or more pegs. For example,\n$H(10!,10!)=26336386137601$ and $H(0!,1!,2!,...,10!)=16304749471397$,\nbut we still do not know the value for $H(1,i,j)$ except for very\nsmall $i$ and $j$. This is a joint work with Mike Paterson, University\nof Warwick and will appear in AMM.\"> Title: Bounded Hanoi <\/span><\/li>\n<\/ul>\n<\/td>\n<td><a href=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan.png\"><img loading=\"lazy\" class=\"size-thumbnail wp-image-31 alignnone\" src=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan-150x150.png\" alt=\"\" width=\"150\" height=\"150\" srcset=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan-150x150.png 150w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan-300x300.png 300w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan-50x50.png 50w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Luca_Trevisan.png 342w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/p>\n<ul>\n<li>Luca Trevisan<br \/>\n(Bocconi University, Italy)<\/li>\n<li><span style=\"font-size: small;\" title=\"Abstract: we discuss two processes on random networks. First we discuss the flooding process, in which information is broadcast in a network in such a way that every informed node immediately informs all the neighbors. In dynamic networks in which nodes continually enter and exit the network, activating and deactivating random network links, we present a result showing that the process quickly converges to a state in which almost all nodes, or even all nodes, are informed, depending on whether or not dropped connections are replaced by new connections. Then we discuss the SIR process of epidemic spreading applied to a model of random networks similar to the Watts-Strogatz model, in which there is a mix of \"> Title: Broadcast and Epidemics on Random Networks<\/span><\/li>\n<\/ul>\n<\/td>\n<td><a href=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong.png\"><img loading=\"lazy\" class=\"size-thumbnail wp-image-32 alignnone\" src=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong-150x150.png\" alt=\"\" width=\"150\" height=\"150\" srcset=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong-150x150.png 150w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong-300x300.png 300w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong-50x50.png 50w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Prudence_Wong.png 342w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/p>\n<ul>\n<li>Prudence Wong<br \/>\n(University of Liverpool, UK)<\/li>\n<li><span style=\"font-size: small;\" title=\"Abstract: Energy usage is a big concern these days in terms of computation and household usage. This motivates the revisit of classical scheduling problems to take energy into concern. In this talk, we will give an overview of several scheduling problems that attempt to optimize energy and electricity cost. In terms of processor scheduling, we investigate how to use speed scaling and sleep management to reduce energy usage effectively while providing certain level of quality of service. We also investigate how multi-processor scheduling can help reducing energy usage. In terms of household usage, we investigate the so called demand response management in electricity grid. We will also explore the relations of electricity grid scheduling and classical machine scheduling.\"> Title: Scheduling to Optimize Energy and Electricity Cost<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h5><strong>Tutorial Talk<\/strong><\/h5>\n<table style=\"width: 100%;\" border=\"none\" align=\"left\">\n<tbody>\n<tr>\n<td><a href=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou.png\"><img loading=\"lazy\" class=\"size-thumbnail wp-image-34 alignnone\" src=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou-150x150.png\" alt=\"\" width=\"150\" height=\"150\" srcset=\"https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou-150x150.png 150w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou-300x300.png 300w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou-50x50.png 50w, https:\/\/aaac2021.ee.ntu.edu.tw\/wp-content\/uploads\/2021\/04\/Evanthia_Papadopoulou.png 362w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/p>\n<ul>\n<li>Evanthia Papadopoulou<br \/>\n(University of Lugano, Switzerland)<\/li>\n<li><span style=\"font-size: small;\" title=\"Abstract: Voronoi diagrams are versatile geometric partitioning structures that find diverse applications in Science and Engineering. Given a set of n simple geometric objects, called sites, their Voronoi diagram subdivides the surrounding space into regions of influence exerted by the given sites. These sites are often considered to be points, however, non-points such as line segments, circles, polygons, or polyhedra often model various realistic scenarios. Abstract Voronoi diagrams (AVDs) offer a unifying framework for many such constructs in the plane. In this talk, I will first survey fundamental differences between Voronoi diagrams of points and their counterparts of segments, circles, or AVDs. Because of these differences, some surprising open problems may still remain. For example, although linear-time algorithms for site-deletion in planar point Voronoi diagrams had been well-known to exist since the late 80's, until recently no corresponding algorithms existed for non-point diagrams. Towards bridging such gaps, I will introduce abstract Voronoi-like diagrams, a relaxed Voronoi structure, whose flexibility can help design simple, yet efficient algorithms. A Voronoi-like diagram is a graph on the arrangement of the underlying bisector system whose (non-leaf) vertices are locally Voronoi, i.e., they are vertices in a Voronoi diagram of three sites. Using Voronoi-like graphs we can devise simple randomized incremental constructions under the general AVD framework. I will show this technique and also its analysis, which introduces a simple alternative to the standard backwards analysis, applicable to order-dependent structures. We envision that Voronoi-like graphs will turn out useful in various generalized scenarios, including Voronoi diagrams with disconnected regions and Voronoi diagrams in 3D.\"> Title: Voronoi and Voronoi-like Diagrams <\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>Keynote Speeches Kazuo Iwama (RIMS, Kyoto University) Title: Bounded Hanoi Luca Trevisan (Bocconi University, Italy) Title: Broadcast and Epidemics on Random Networks Prudence Wong (University of Liverpool, UK) Title: Scheduling to Optimize Energy and Electricity Cost Tutorial Talk Evanthia Papadopoulou (University of Lugano, Switzerland) Title: Voronoi and Voronoi-like Diagrams<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/30"}],"collection":[{"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/comments?post=30"}],"version-history":[{"count":28,"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/30\/revisions"}],"predecessor-version":[{"id":375,"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/30\/revisions\/375"}],"wp:attachment":[{"href":"https:\/\/aaac2021.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/media?parent=30"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}