发布求助
文献互助 智能选刊 最新文献

Chicago Journal of Theoretical Computer Science最新文献

筛选
英文 中文
A Turing Machine Resisting Isolated Bursts Of Faults 图灵机抗故障孤立爆发
Chicago Journal of Theoretical Computer Science Pub Date : 2012-01-21 DOI: 10.1007/978-3-642-27660-6_14
Ilir Çapuni, P. Gács
{"title":"A Turing Machine Resisting Isolated Bursts Of Faults","authors":"Ilir Çapuni, P. Gács","doi":"10.1007/978-3-642-27660-6_14","DOIUrl":"https://doi.org/10.1007/978-3-642-27660-6_14","url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127027821","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}
引用次数: 8
Quantum Adversary (Upper) Bound 量子对手(上)界
Chicago Journal of Theoretical Computer Science Pub Date : 2011-01-04 DOI: 10.4086/cjtcs.2013.004
S. Kimmel
{"title":"Quantum Adversary (Upper) Bound","authors":"S. Kimmel","doi":"10.4086/cjtcs.2013.004","DOIUrl":"https://doi.org/10.4086/cjtcs.2013.004","url":null,"abstract":"We describe a method for upper bounding the quantum query complexity of certain boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method gives an upper bound on query complexity without producing an algorithm. For example, we describe an oracle problem that we prove (non-constructively) can be solved in O(1) queries, where the previous best quantum algorithm uses a polynomial number of queries. We then give an explicit O(1) query algorithm based on span programs, and show that for a special case of this problem, there exists a O(1) query algorithm that uses the quantum Haar transform. This special case is a potentially interesting problem in its own right, which we call the Haar Problem.","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125494558","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}
引用次数: 24
Notes on Large Angle Crossing Graphs 关于大角度交叉图的注意事项
Chicago Journal of Theoretical Computer Science Pub Date : 2009-08-24 DOI: 10.4086/cjtcs.2011.004
V. Dujmovic, Joachim Gudmundsson, Pat Morin, T. Wolle
{"title":"Notes on Large Angle Crossing Graphs","authors":"V. Dujmovic, Joachim Gudmundsson, Pat Morin, T. Wolle","doi":"10.4086/cjtcs.2011.004","DOIUrl":"https://doi.org/10.4086/cjtcs.2011.004","url":null,"abstract":"A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any RAC graph with n vertices has at most 4n-10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n-10 edges. In this paper, we give upper and lower bounds for the number of edges in aAC graphs for all 0 < a < Pi/2.","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115827313","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}
引用次数: 46
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches 缓冲Crossbar交换机的最佳努力和优先排队策略
Chicago Journal of Theoretical Computer Science Pub Date : 2008-06-17 DOI: 10.1007/978-3-540-69355-0_15
A. Kesselman, Kirill Kogan, M. Segal
{"title":"Best Effort and Priority Queuing Policies for Buffered Crossbar Switches","authors":"A. Kesselman, Kirill Kogan, M. Segal","doi":"10.1007/978-3-540-69355-0_15","DOIUrl":"https://doi.org/10.1007/978-3-540-69355-0_15","url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127601434","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}
引用次数: 24
The Query Complexity of Program Checking by Constant-Depth Circuits 恒深度电路程序检测的查询复杂度
Chicago Journal of Theoretical Computer Science Pub Date : 1999-12-16 DOI: 10.1007/3-540-46632-0_13
V. Arvind, K. Subrahmanyam, N. V. Vinodchandran
{"title":"The Query Complexity of Program Checking by Constant-Depth Circuits","authors":"V. Arvind, K. Subrahmanyam, N. V. Vinodchandran","doi":"10.1007/3-540-46632-0_13","DOIUrl":"https://doi.org/10.1007/3-540-46632-0_13","url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117196886","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}
引用次数: 3
Planning by minimum consensus: Austrian co-operative federalism as a model for Europe? 最小共识规划:奥地利合作联邦制是欧洲的典范?
Chicago Journal of Theoretical Computer Science Pub Date : 1998-10-01 DOI: 10.1080/09654319808720477
A. Faludi
{"title":"Planning by minimum consensus: Austrian co-operative federalism as a model for Europe?","authors":"A. Faludi","doi":"10.1080/09654319808720477","DOIUrl":"https://doi.org/10.1080/09654319808720477","url":null,"abstract":"Abstract Austria joined the European Union as late as 1995, so it may seem far‐fetched to present her as a model. However, Austria has a federal planning system. In the European Union, too, Member States have ceded powers to Brussels, so the European Union resembles federal planning systems. However, neither the Austrian federal government nor the European Union has a formal planning mandate, and so both have developed para‐constitutional planning institutions. Thus, in Austria there is the Austrian Conference on Spatial Planning where representatives of federal, state and local government co‐operate on a voluntary basis. In the European Union, also, planning co‐operation between Member States is voluntary. Part 1 puts the Conference on Spatial Planning within the context of Austria's evolving ‘co‐operative federal state’. Part 2 focuses on the Conference itself. Part 3 compares the Austrian arrangements with those for European planning. The conclusions draw lessons for European planning. The first is tha...","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127223214","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}
引用次数: 11
Polynucleated regions in Northwest Europe 欧洲西北部多核地区
Chicago Journal of Theoretical Computer Science Pub Date : 1998-08-01 DOI: 10.1080/09654319808720468
A. Faludi, F. Dieleman
{"title":"Polynucleated regions in Northwest Europe","authors":"A. Faludi, F. Dieleman","doi":"10.1080/09654319808720468","DOIUrl":"https://doi.org/10.1080/09654319808720468","url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116137017","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}
引用次数: 117
Randstad, Rhine-Ruhr and Flemish diamond as one polynucleated macro-region? 任仕达、莱茵-鲁尔和佛兰德钻石作为一个多核宏观区域?
Chicago Journal of Theoretical Computer Science Pub Date : 1998-08-01 DOI: 10.1111/1467-9663.00031
F. Dieleman, A. Faludi
{"title":"Randstad, Rhine-Ruhr and Flemish diamond as one polynucleated macro-region?","authors":"F. Dieleman, A. Faludi","doi":"10.1111/1467-9663.00031","DOIUrl":"https://doi.org/10.1111/1467-9663.00031","url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127660727","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}
引用次数: 34
Asymptotically minimax estimation of a function with jumps 带跳跃函数的渐近极大极小估计
Chicago Journal of Theoretical Computer Science Pub Date : 1998-03-01 DOI: 10.2307/3318530
C. Oudshoorn
{"title":"Asymptotically minimax estimation of a function with jumps","authors":"C. Oudshoorn","doi":"10.2307/3318530","DOIUrl":"https://doi.org/10.2307/3318530","url":null,"abstract":"Asymptotically minimax nonparametric estimation of a regression function observed in white Gaussian noise over a bounded interval is considered, with respect to a L2-loss function. The unknown function f is assumed to be m times differentiable except for an unknown although finite number of jumps, with piecewise mth derivative bounded in L2 norm. An estimator is constructed, attaining the same optimal risk bound, known as Pinsker's constant, as in the case of smooth functions (without jumps).","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121848431","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}
引用次数: 19
On the countable generator theorem 关于可数生成定理
Chicago Journal of Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.4064/fm-157-2-3-255-259
M. Keane, J. Serafin
{"title":"On the countable generator theorem","authors":"M. Keane, J. Serafin","doi":"10.4064/fm-157-2-3-255-259","DOIUrl":"https://doi.org/10.4064/fm-157-2-3-255-259","url":null,"abstract":"Let T be a finite entropy, aperiodic automorphism of a nonatomic probability space. We give an elementary proof of the existence of a finite entropy, countable generating partition for T . In this short article we give a simple proof of Rokhlin’s countable generator theorem [Ro], originating from considerations in [Se] which use standard techniques in ergodic theory. We hope that these considerations will be useful for elementary expositions in the future. For other proofs see [Pa]. Let (X,A, μ) be a nonatomic probability space whose σ-algebra A is generated modulo μ by a countable collection {A1, A2, . . .} of elements of A. Let T be an aperiodic automorphism of (X,A, μ) with finite entropy. For the definitions and properties of entropy and generators used in the sequel, we refer the reader to Billingsley [Bill] and Walters [Wa]. Theorem. (X,A, μ, T ) has a countable generating partition of finite entropy. Our proof is based on the following lemma. Lemma. Let P be a finite partition of (X,A, μ, T ), A an element of A, and e > 0. Set P := P ∨ {A,Ac} and g := h− h, where h := h(T,P) and h := h(T, P) denote the respective mean entropies of the partitions P and P. Then there exists a finite partition Q of (X,A, μ, T ) such that (1) P Q, 1991 Mathematics Subject Classification: 28D05, 28D20.","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"24 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":"122339406","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信