首页 > 最新文献

Communications of the ACM最新文献

英文 中文
Finding the Right Mix of Creativity and Technology 找到创意和技术的正确组合
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3607823
Fiona Rivera
{"title":"Finding the Right Mix of Creativity and Technology","authors":"Fiona Rivera","doi":"10.1145/3607823","DOIUrl":"https://doi.org/10.1145/3607823","url":null,"abstract":"","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"7 - 7"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42675454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distilling What We Know 提炼我们所知道的
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3607891
Samuel Greengard
Researchers look to cut large GPT models down to size.
研究人员希望缩小大型GPT模型的大小。
{"title":"Distilling What We Know","authors":"Samuel Greengard","doi":"10.1145/3607891","DOIUrl":"https://doi.org/10.1145/3607891","url":null,"abstract":"Researchers look to cut large GPT models down to size.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"15 - 17"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47731824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How Many Ways Can You Teach a Robot? 你能教机器人几种方法?
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3608109
L. Hoffmann
ACM Prize recipient Pieter Abbeel is working to help robots learn, and learn to improve.
ACM奖获得者Pieter Abbeel正在努力帮助机器人学习,并学会改进。
{"title":"How Many Ways Can You Teach a Robot?","authors":"L. Hoffmann","doi":"10.1145/3608109","DOIUrl":"https://doi.org/10.1145/3608109","url":null,"abstract":"ACM Prize recipient Pieter Abbeel is working to help robots learn, and learn to improve.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"104 - ff"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49276397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough 历史算法帮助解锁最短路径问题突破
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3607866
C. Edwards
By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.
通过重新审视计算中的关键算法,一个团队解开了一个长期存在的计算机科学问题中隐藏的效率。
{"title":"Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough","authors":"C. Edwards","doi":"10.1145/3607866","DOIUrl":"https://doi.org/10.1145/3607866","url":null,"abstract":"By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"10 - 12"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42712844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cargo Cult AI 货物崇拜AI
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3606946
E. Levine
Is the ability to think scientifically the defining essence of intelligence?
科学思考的能力是智力的本质定义吗?
{"title":"Cargo Cult AI","authors":"E. Levine","doi":"10.1145/3606946","DOIUrl":"https://doi.org/10.1145/3606946","url":null,"abstract":"Is the ability to think scientifically the defining essence of intelligence?","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"46 - 51"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45474974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Coming of Age 成年的到来
3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3608965
Stefano Zanero
Stressing the importance of threat models.
强调威胁模型的重要性。
{"title":"Coming of Age","authors":"Stefano Zanero","doi":"10.1145/3608965","DOIUrl":"https://doi.org/10.1145/3608965","url":null,"abstract":"Stressing the importance of threat models.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135570502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Humble AI
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3587035
Bran Knowles, J. D’cruz, John T. Richards, Kush R. Varshney
An effort to bring artificial intelligence into better alignment with our moral aims and finally realize the vision of superior decision making through AI.
努力使人工智能更好地与我们的道德目标相一致,并最终通过人工智能实现卓越决策的愿景。
{"title":"Humble AI","authors":"Bran Knowles, J. D’cruz, John T. Richards, Kush R. Varshney","doi":"10.1145/3587035","DOIUrl":"https://doi.org/10.1145/3587035","url":null,"abstract":"An effort to bring artificial intelligence into better alignment with our moral aims and finally realize the vision of superior decision making through AI.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"73 - 79"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42132627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Tapping the Link between Algorithmic Model Counting and Streaming: Technical Perspective 挖掘算法模型计数和流媒体之间的联系:技术视角
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3607825
David P. Woodruff
algorithms for F0 estimation to algorithms for model counting. The authors also show a partial converse, namely, by framing F0 estimation as a special case of model counting, the authors obtain a very general algorithm for F0 estimation and variants. The resulting algorithms can be used to select a minimum cost query plan in database design and are also a key tool for detecting denial-of-service attacks in network monitoring. The starting point of the paper is the observation that a hashing-based technique for model counting1,3 uses the same techniques as an F0 estimation data stream algorithm.2 The idea behind both is to reduce the counting problem to a detection problem. For model counting, one chooses random subsets of possible solutions of geometrically varying size and checks if there is any satisfying assignment to φ in each subset. For F0 estimation in data streams, one chooses random subsets of universe items of geometrically varying size and checks if there is an item in one’s subset that occurs in the stream. In both cases, by finding the size of the smallest set for which there is a satisfying assignment (for model counting) or an element occurring in the stream (for F0 estimation), one can scale back up by the reciprocal of that set’s size to obtain a decent approximation to the number of solutions (for model counting) or number of distinct elements (for data streams).
从F0估计算法到模型计数算法。作者还展示了部分逆,即通过将F0估计作为模型计数的特殊情况,作者获得了F0估计和变量的非常一般的算法。所得算法可用于选择数据库设计中成本最小的查询计划,也是网络监控中检测拒绝服务攻击的关键工具。本文的出发点是观察到基于哈希的模型计数技术1,3使用与F0估计数据流算法相同的技术两者背后的思想都是将计数问题简化为检测问题。对于模型计数,选择大小几何变化的可能解的随机子集,并检查每个子集中是否存在对φ的满意赋值。对于数据流中的F0估计,您可以选择几何大小变化的宇宙项的随机子集,并检查在您的子集中是否存在出现在流中的项。在这两种情况下,通过找到满足分配(用于模型计数)或流中出现的元素的最小集合的大小(用于F0估计),可以通过该集合大小的倒数进行缩放,以获得解决方案数量(用于模型计数)或不同元素数量(用于数据流)的适当近似值。
{"title":"Tapping the Link between Algorithmic Model Counting and Streaming: Technical Perspective","authors":"David P. Woodruff","doi":"10.1145/3607825","DOIUrl":"https://doi.org/10.1145/3607825","url":null,"abstract":"algorithms for F0 estimation to algorithms for model counting. The authors also show a partial converse, namely, by framing F0 estimation as a special case of model counting, the authors obtain a very general algorithm for F0 estimation and variants. The resulting algorithms can be used to select a minimum cost query plan in database design and are also a key tool for detecting denial-of-service attacks in network monitoring. The starting point of the paper is the observation that a hashing-based technique for model counting1,3 uses the same techniques as an F0 estimation data stream algorithm.2 The idea behind both is to reduce the counting problem to a detection problem. For model counting, one chooses random subsets of possible solutions of geometrically varying size and checks if there is any satisfying assignment to φ in each subset. For F0 estimation in data streams, one chooses random subsets of universe items of geometrically varying size and checks if there is an item in one’s subset that occurs in the stream. In both cases, by finding the size of the smallest set for which there is a satisfying assignment (for model counting) or an element occurring in the stream (for F0 estimation), one can scale back up by the reciprocal of that set’s size to obtain a decent approximation to the number of solutions (for model counting) or number of distinct elements (for data streams).","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"94 - 94"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48742293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rebutting Rebuttals 反驳反驳
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3584664
N. Dershowitz, Rakesh M. Verma
Evaluating the impact of the conference review rebuttal process.
评估会议审查反驳程序的影响。
{"title":"Rebutting Rebuttals","authors":"N. Dershowitz, Rakesh M. Verma","doi":"10.1145/3584664","DOIUrl":"https://doi.org/10.1145/3584664","url":null,"abstract":"Evaluating the impact of the conference review rebuttal process.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"35 - 41"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47534752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
We Need to Focus on How Our Data Is Used, Not Just How It Is Shared 我们需要关注我们的数据是如何使用的,而不仅仅是如何共享的
IF 22.7 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-08-23 DOI: 10.1145/3572912
Katrina Ligett, Kobbi Nissim
Toward better understanding of the different ways data circulates between users and platforms.
为了更好地理解数据在用户和平台之间流通的不同方式。
{"title":"We Need to Focus on How Our Data Is Used, Not Just How It Is Shared","authors":"Katrina Ligett, Kobbi Nissim","doi":"10.1145/3572912","DOIUrl":"https://doi.org/10.1145/3572912","url":null,"abstract":"Toward better understanding of the different ways data circulates between users and platforms.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"32 - 34"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42064870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Communications of the ACM
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1