Pub Date : 1900-01-01DOI: 10.17704/1944-6187-37.2.ii
P. Spirakis
Members of the Executive Committee CHARLES R. DANNENBERG .................................... Merion Golf Club WILLIAM R. DAVIS, JR. .......................... Chambersburg Country Club *DR. JOSEPH E. GREEN, III .............................. Carlisle Country Club C. TALBOT HEPPENSTALL, JR. ........................ Fox Chapel Golf Club KING T. KNOX .................................................Lancaster Country Club DR. JAMES J. MAHONEY ............................. Lake View Country Club JOHN W. McMURDY, JR. .................................... Indiana Country Club JOSEPH A. PESAVENTO........................................... Longue Vue Club DR. PETER G. RICHTER ................................... Hershey Country Club DR. PAUL RINGIEWICZ.................................. Rolling Green Golf Club PAUL S. ROMANO ............................................ Colonial Country Club RENARD M. SACCO..................................... Philadelphia Publinks GA VINCENT A SCARPETTA, JR. ............. Glenmaura National Golf Club JAMES R. SHERRATT............................ Old York Road Country Club DR. TERRY L. SMITH............................................. Huntsville Golf Club *JOHN P. TRACH.......................................Country Club of Harrisburg JACK W. WOLFORD, JR. ................. Huntingdon Valley Country Club JOHN F. YERGER, III .................................. Sunnehanna Country Club
社区the Executive进行名攻击Committee查尔斯·r。DANNENBERG ....................................威廉·r·戴维斯,那个Merion高尔夫俱乐部JR . ..........................张伯斯堡乡村俱乐部*博士约瑟夫e GREEN,三世 ..............................卡莱尔Country Club c·塔尔博特HEPPENSTALL, JR . ........................福克斯起居室高尔夫俱乐部联合举办了拼写·金T. KNOX .................................................也是詹姆斯·j。MAHONEY博士Lancaster Country Club .............................雷克View Country Club约翰w McMURDY, JR . ....................................印第安纳Country Club JOSEPH a。PESAVENTO ...........................................合作也是彼得我们只是博士Longue Vue Club ...................................也是PAUL RINGIEWICZ博士。贺喜Country Club ..................................他们已经Rolling Green高尔夫俱乐部联合举办了拼写PAUL立刻 ............................................Colonial Country Club RENARD m。·萨科 .....................................费城的酒吧由VINCENT A scarpetta，jr.。便利便利便利便利…詹姆斯·r SHERRATT那个高尔夫俱乐部边的Glenmaura National ............................现在,老纽约也是阴道泰瑞·史密斯博士这辆Country Club .............................................那个Huntsville高尔夫俱乐部*约翰p TRACH .......................................Country Club哈里斯堡杰克w WOLFORD, JR译本史》(英语) . .................Huntingdon裂谷Country Club约翰主人是YERGER,三世 ..................................Sunnehanna乡村俱乐部
{"title":"Letter from the President","authors":"P. Spirakis","doi":"10.17704/1944-6187-37.2.ii","DOIUrl":"https://doi.org/10.17704/1944-6187-37.2.ii","url":null,"abstract":"Members of the Executive Committee CHARLES R. DANNENBERG .................................... Merion Golf Club WILLIAM R. DAVIS, JR. .......................... Chambersburg Country Club *DR. JOSEPH E. GREEN, III .............................. Carlisle Country Club C. TALBOT HEPPENSTALL, JR. ........................ Fox Chapel Golf Club KING T. KNOX .................................................Lancaster Country Club DR. JAMES J. MAHONEY ............................. Lake View Country Club JOHN W. McMURDY, JR. .................................... Indiana Country Club JOSEPH A. PESAVENTO........................................... Longue Vue Club DR. PETER G. RICHTER ................................... Hershey Country Club DR. PAUL RINGIEWICZ.................................. Rolling Green Golf Club PAUL S. ROMANO ............................................ Colonial Country Club RENARD M. SACCO..................................... Philadelphia Publinks GA VINCENT A SCARPETTA, JR. ............. Glenmaura National Golf Club JAMES R. SHERRATT............................ Old York Road Country Club DR. TERRY L. SMITH............................................. Huntsville Golf Club *JOHN P. TRACH.......................................Country Club of Harrisburg JACK W. WOLFORD, JR. ................. Huntingdon Valley Country Club JOHN F. YERGER, III .................................. Sunnehanna Country Club","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"34 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114090117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812562494_0068
C. Martín-Vide, G. Paun
{"title":"Language Generating by Means of Membrane Systems","authors":"C. Martín-Vide, G. Paun","doi":"10.1142/9789812562494_0068","DOIUrl":"https://doi.org/10.1142/9789812562494_0068","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125665510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integration of Software Specification Techniques for Applications in Engineering","authors":"Martin Große-Rhode","doi":"10.1007/b100778","DOIUrl":"https://doi.org/10.1007/b100778","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117318437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794499_0041
L. Kari, S. Marcus, G. Paun, A. Salomaa
The problem proposed by Gauss of characterizing the code of a simple crossing closed curve (SCCC, for short) can be considered a formal language question. We define three related infinite languages. Two of them are regular; the type of the third is an open problem.
{"title":"In the prehistory of formal language theory: Gauss Languages","authors":"L. Kari, S. Marcus, G. Paun, A. Salomaa","doi":"10.1142/9789812794499_0041","DOIUrl":"https://doi.org/10.1142/9789812794499_0041","url":null,"abstract":"The problem proposed by Gauss of characterizing the code of a simple crossing closed curve (SCCC, for short) can be considered a formal language question. We define three related infinite languages. Two of them are regular; the type of the third is an open problem.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128514250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the first part of this dissertation, we study the fundamental problem of sampling from a discrete probability distribution. Specifically, given non-negative numbers p1, . . . , pn the task is to draw i with probability proportional to pi. We extend the classic solution to this problem, Walker’s alias method, in various directions: 1. We improve upon its space requirements by presenting optimal succinct sampling data structures. 2. We present improved trade-offs between preprocessing and query time for sorted inputs, and generalize this from proportional sampling to sampling subsets. 3. For Bernoulli, geometric, and binomial random variates we present optimal sampling algorithms on a bounded precision machine. 4. As an application, we speed up sampling of internal diffusion limited aggregation. The second part of this dissertation belongs to the area of computational geometry and deals with algorithms for the Frechet distance, which is a popular measure of similarity of two curves and can be computed in quadratic time (ignoring logarithmic factors). We provide the first conditional lower bound for this problem: No polynomial factor improvement over the quadratic running time is possible unless the Strong Exponential Time Hypothesis fails. Our various extensions of this main result include conditional lower bounds under realistic input assumptions, which do not match the known algorithms. We close this gap by presenting an improved approximation algorithm for the Frechet distance.
{"title":"Sampling from Discrete Distributions and Computing Frechet Distances","authors":"K. Bringmann","doi":"10.22028/D291-25417","DOIUrl":"https://doi.org/10.22028/D291-25417","url":null,"abstract":"In the first part of this dissertation, we study the fundamental problem of sampling from a discrete probability distribution. Specifically, given non-negative numbers p1, . . . , pn the task is to draw i with probability proportional to pi. We extend the classic solution to this problem, Walker’s alias method, in various directions: 1. We improve upon its space requirements by presenting optimal succinct sampling data structures. 2. We present improved trade-offs between preprocessing and query time for sorted inputs, and generalize this from proportional sampling to sampling subsets. 3. For Bernoulli, geometric, and binomial random variates we present optimal sampling algorithms on a bounded precision machine. 4. As an application, we speed up sampling of internal diffusion limited aggregation. The second part of this dissertation belongs to the area of computational geometry and deals with algorithms for the Frechet distance, which is a popular measure of similarity of two curves and can be computed in quadratic time (ignoring logarithmic factors). We provide the first conditional lower bound for this problem: No polynomial factor improvement over the quadratic running time is possible unless the Strong Exponential Time Hypothesis fails. Our various extensions of this main result include conditional lower bounds under realistic input assumptions, which do not match the known algorithms. We close this gap by presenting an improved approximation algorithm for the Frechet distance.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"38 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5075/EPFL-THESIS-4664
R. Guerraoui, M. Kapalka
Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. The TM paradigm has raised a lot of hope for mastering the complexity of concurrent programming. The aim is to provide programmers with an abstraction, i.e., the transaction, that makes handling concurrency as easy as with coarse-grained locking, while exploiting the parallelism of the underlying multi-core or multi-processor hardware as well as hand-crafted fine-grained locking (which is typically an engineering challenge). It is thus not surprising to see a large body of work devoted to implementing this paradigm efficiently, and integrating it with common programming languages. Very little work, however, was devoted to the underlying theory and principles. The aim of this thesis is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what the power and limitations of a TM are, and what inherent trade-offs are involved in designing a TM algorithm. In particular, this manuscript contains precise definitions of properties that capture the safety and progress semantics of TMs, as well as several fundamental results related to computability and complexity of TM implementations. While the focus of the thesis is on theory, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations.
{"title":"The Theory of Transactional Memory","authors":"R. Guerraoui, M. Kapalka","doi":"10.5075/EPFL-THESIS-4664","DOIUrl":"https://doi.org/10.5075/EPFL-THESIS-4664","url":null,"abstract":"Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. The TM paradigm has raised a lot of hope for mastering the complexity of concurrent programming. The aim is to provide programmers with an abstraction, i.e., the transaction, that makes handling concurrency as easy as with coarse-grained locking, while exploiting the parallelism of the underlying multi-core or multi-processor hardware as well as hand-crafted fine-grained locking (which is typically an engineering challenge). It is thus not surprising to see a large body of work devoted to implementing this paradigm efficiently, and integrating it with common programming languages. Very little work, however, was devoted to the underlying theory and principles. The aim of this thesis is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what the power and limitations of a TM are, and what inherent trade-offs are involved in designing a TM algorithm. In particular, this manuscript contains precise definitions of properties that capture the safety and progress semantics of TMs, as well as several fundamental results related to computability and complexity of TM implementations. While the focus of the thesis is on theory, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：