{"title":"CAPE: a framework for assessing equity throughout the computer science education ecosystem","authors":"Carol L. Fletcher, Jayce R. Warner","doi":"10.1145/3442373","DOIUrl":"https://doi.org/10.1145/3442373","url":null,"abstract":"","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"s3-1 1","pages":"23-25"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90806853","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}
At one extreme, Twitter rejects all political ads no matter how important the message. At the other extreme, Facebook accepts all political ads no matter how untruthful the message. As lies in political advertising become increasingly problematic, neither policy works. The former prevents us from hearing newcomers while the latter pollutes our discourse with misinformation.This short article proposes a "market for truth" that would allow social media platforms to take political ads, guarantee the ads are lie free, and at the same time absolve such platforms of responsibility for deciding what's true. Using mechanism design, it causes advertisers to either internalize their negative externalities or to signal that they are untrustworthy. It also provides a business model that should make fact-checking scalable and profitable.This short precis is a segment of a longer treatise on the problem of fake news.
{"title":"Proposal: a market for truth to address false ads on social media","authors":"Marshall W. Van Alstyne","doi":"10.1145/3401724","DOIUrl":"https://doi.org/10.1145/3401724","url":null,"abstract":"At one extreme, Twitter rejects all political ads no matter how important the message. At the other extreme, Facebook accepts all political ads no matter how untruthful the message. As lies in political advertising become increasingly problematic, neither policy works. The former prevents us from hearing newcomers while the latter pollutes our discourse with misinformation.This short article proposes a \"market for truth\" that would allow social media platforms to take political ads, guarantee the ads are lie free, and at the same time absolve such platforms of responsibility for deciding what's true. Using mechanism design, it causes advertisers to either internalize their negative externalities or to signal that they are untrustworthy. It also provides a business model that should make fact-checking scalable and profitable.This short precis is a segment of a longer treatise on the problem of fake news.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"15 1","pages":"23-25"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88061423","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}
Interactions with robotics teach us more about people.
与机器人的互动让我们更了解人。
{"title":"What makes a robot likable?","authors":"Gregory Mone","doi":"10.1145/3339470","DOIUrl":"https://doi.org/10.1145/3339470","url":null,"abstract":"Interactions with robotics teach us more about people.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"28 1","pages":"20-21"},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73779831","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}
Carnegie Mellon University's successful efforts enrolling, sustaining, and graduating women in computer science challenge the belief in a gender divide in CS education.
{"title":"How computer science at CMU is attracting and retaining women","authors":"C. Frieze, Jeria L. Quesenberry","doi":"10.1145/3300226","DOIUrl":"https://doi.org/10.1145/3300226","url":null,"abstract":"Carnegie Mellon University's successful efforts enrolling, sustaining, and graduating women in computer science challenge the belief in a gender divide in CS education.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"74 1","pages":"23-26"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91551904","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}
A new proof supports a 25-year-old claim of the unique power of quantum computing.
一项新的证据支持了25年前关于量子计算独特能力的说法。
{"title":"Quantum leap","authors":"D. Monroe","doi":"10.1145/3290407","DOIUrl":"https://doi.org/10.1145/3290407","url":null,"abstract":"A new proof supports a 25-year-old claim of the unique power of quantum computing.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"8 1","pages":"10-12"},"PeriodicalIF":0.0,"publicationDate":"2018-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87582030","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}
Items can be retrieved from binary trees grown with a form of the Algorithm Quicksort in an average time proportional to log n, where n is the number of items in the tree. The binary trees grown by this algorithm sometimes have some branches longer than others; therefore, it is possible to reduce the average retrieval time by restructuring the tree to make the branches as uniform in length as possible. An algorithm to do this is presented. The use of this algorithm is discussed, and it is compared with another which restructures the tree after each new item is added.
{"title":"Optimizing binary trees grown with a sorting algorithm","authors":"W. Martin, D. Ness","doi":"10.1145/361254.361259","DOIUrl":"https://doi.org/10.1145/361254.361259","url":null,"abstract":"Items can be retrieved from binary trees grown with a form of the Algorithm Quicksort in an average time proportional to log n, where n is the number of items in the tree. The binary trees grown by this algorithm sometimes have some branches longer than others; therefore, it is possible to reduce the average retrieval time by restructuring the tree to make the branches as uniform in length as possible. An algorithm to do this is presented. The use of this algorithm is discussed, and it is compared with another which restructures the tree after each new item is added.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"2 1","pages":"88-93"},"PeriodicalIF":0.0,"publicationDate":"2018-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79390016","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":"MAP","authors":"C. L. Moore, M. Ruwe","doi":"10.1145/366813.366830","DOIUrl":"https://doi.org/10.1145/366813.366830","url":null,"abstract":"","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"6 1","pages":"496"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75584707","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}
Digital effectiveness is not the same as mastering the ICTs, rather it is the art of using them in a purposeful, healthy way.
数字效能并不等同于掌握信息和通信技术，而是以一种有目的、健康的方式使用它们的艺术。
{"title":"The ABCs of effectiveness in the digital society","authors":"Carlo Gabriel Porto Bellini","doi":"10.1145/3205945","DOIUrl":"https://doi.org/10.1145/3205945","url":null,"abstract":"Digital effectiveness is not the same as mastering the ICTs, rather it is the art of using them in a purposeful, healthy way.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"150 1","pages":"84-91"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77383846","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":"ACM's 2018 general election: please take this opportunity to vote","authors":"Cacm Staff","doi":"10.1145/3196943","DOIUrl":"https://doi.org/10.1145/3196943","url":null,"abstract":"","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"34 1","pages":"13-21"},"PeriodicalIF":0.0,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81038866","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}
It's not magic, it just requires continuous, daily improvement at all levels.
这不是魔法，它只是需要在各个层面上不断地、每天地改进。
{"title":"Continuous delivery sounds great, but will it work here?","authors":"Jez Humble","doi":"10.1145/3173553","DOIUrl":"https://doi.org/10.1145/3173553","url":null,"abstract":"It's not magic, it just requires continuous, daily improvement at all levels.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"133 1","pages":"34-39"},"PeriodicalIF":0.0,"publicationDate":"2018-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75761598","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
扫码关注我们
求助内容：
应助结果提醒方式：