DOCSLIB.ORG

A Complete Bibliography of Publications in Communications of the ACM : 2010–2019

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Complete Bibliography of Publications in Communications of the ACM : 2010–2019 A Complete Bibliography of Publications in Communications of the ACM : 2010{2019 Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 11 December 2019 Version 1.130 Title word cross-reference [2146]. 2017 [2336, 2313]. 21st [2065, 2833, 2656, 1052, 2499, 141]. 3 [2677]. 30-year [2751]. 33 [343]. 3G [352]. #1 [667]. 50th [2359]. + [859, 2507]. $1 [1598, 1575]. 10 2 [166]. 3 [1290, 962, 2165, 1291, 2659, 2164,± 1339, 600km [2693]. 2381, 2572, 250, 2747, 2158]. = [859, 378]. b [614]. λ>4 [2041]. n [857]. n = me [1398]. = [377]. = [2507]. 6 Aadhaar [2995]. abbey [2716]. ABCs -bit [614]. -gram [857]. -Spectre [2728]. [2607]. abductive [67]. abilities [2670]. -sweep [2165]. Ability [2582]. Ability-based [2582]. Abolish [1680]. abound [738]. above 12 [337, 1421, 2056, 1824]. 14th [564]. [2633, 186]. abstract [642, 643]. Abstracting [2459, 642, 643]. Abstraction 2.0 [373, 473, 1306, 1650, 33, 501]. 2008 [661, 1020, 2153, 403]. Abstractions [382]. 2009 [12]. 2011 [626, 711]. 2016 1 2 [1060, 1541]. abstracts [1638]. abuse [104, 694, 207, 237]. adults [2332]. advance [552, 1123]. academia [2194, 992]. [1277, 2217]. advanced [1681]. Advances Academic [1098, 2435, 2437, 2071, 2644, [780]. Advancing [1840, 553]. advantage 2284, 2128, 2232, 1159, 2118, 2023, 170]. [2341]. Adventures [1156]. adversarial academic-unit [2023]. academics [1228]. [2604]. Advertising academies [3016]. academy [2168, 242]. [923, 531, 702, 514, 2046, 2323, 2394]. Accelerating [2444, 2028, 2630, 2643, 2140]. Advice [1640, 2434, 225, 2911, 2030, 1661, acceleration [1613, 2139]. accelerators 357, 388, 1881, 141]. advocates [2561]. [2138]. Access [2900, 1171, 1905, 49, 1067, AdWords [395]. affect [1964]. affects [320]. 1114, 2284, 2544, 1115, 367, 2677, 2619, 1240, Africa [2561]. African [1734, 364]. after 1607, 2410, 1019, 840, 2522, 1082]. [2843, 1804, 1692, 419]. again [2177]. access-control [1082]. accessibility Against [993, 2215, 1310, 2966]. accessible [2478]. [424, 150, 1431, 341, 2604, 769, 866, 247, 2910]. accomplishments [1699]. according [662]. age [1846, 1161, 221, 2262, 2741, 2207, 1510, account [956]. Accountability 1519, 2754, 2779, 2275, 1109, 1603, 464, 2641, [1508, 1911, 1547, 2351, 1250]. 935, 43, 443]. agenda [1840, 2759, 48, 2825]. Achievements [503]. Achieving agendas [1954]. Agent [2857, 2470]. ACM [106, 2719, 218, 1586]. Agent-oriented [422, 648, 1067, 2143, 2282, 1136, 1068, 1481, [106]. agents [259, 92, 2411, 24, 2734]. ages 1434, 1840, 304, 736, 735, 1045, 2329, 371, [2332]. aggregates [569]. aggregator 635, 1028, 569, 478, 680, 651, 508, 738, 1729, [1772]. Agile [1285, 400, 2388, 2364, 315, 1598, 1956, 762, 285, 107, 2469, 1637, 13, 4, 2953, 2157, 920, 832]. agility [202]. 387, 1017, 2048, 2168, 2215, 2830, 2611, 816, agreement [1440]. agriculture [2770]. 1293, 2866, 3008, 2908, 2951, 1436, 593, 996, ahead [8, 1011, 307]. AI 172, 1813, 846, 225, 2317, 147, 45, 573, 423, [2369, 2658, 2849, 2952, 1803, 2904, 2203, 706, 771, 1096, 1165, 1320, 1348, 1413, 1575, 2746, 2080, 2725, 1781, 2335, 2722, 2000, 1319, 1593, 1923, 1975, 1902, 2222, 2546, 2613, 2704, 2682, 2638, 2726, 2701, 791, 1897, 2217, 2547, 2496, 2470, 944, 1745, 2214, 2522, 1248, 2240, 2472, 2591]. AI-supported [1897]. 1523, 2399, 1545, 1722, 2142, 2307, 2283]. aided [1496]. AIDS [90]. aim [3013]. aims ACM-W [2470]. ACM's [1870, 2546, 1871]. [1209]. air [1212, 484, 1166, 2539, 410, 168]. acquisition [2562]. across air-gap [2539]. airbags [958]. Alan [1714, 2922, 2188, 1220]. act [159, 1238]. [902, 2438, 950, 1029, 956, 1255]. algebra action [2469, 1694, 2800, 2142]. active [2017, 2864]. Algebraic [1889]. Algol [1842]. Activism [709]. activities [1880]. algorithm [1323, 700, 2812, 2912, [1645, 2809]. Activity [2924, 1861]. 1179, 2197, 624, 2135, 1362, 790]. Activity-centric [2924]. actor [1897]. acts Algorithmic [2862, 582, 231, 1288, 1817, [775]. Actually [1328]. ad [724, 1148, 2562]. 1911, 1035, 2351, 2099, 1343]. Algorithms Ada [1924, 1773]. Adam [281]. adapt [2623, 2981, 2841, 1195, 158, 57, 1223, 2065, [1469]. Adaptation [1289, 1031]. Adaptive 1743, 1039, 1742, 2490, 1108, 2748, 1497, 859, [2063, 961, 860]. addiction [151]. Adding 2967, 1038, 2099, 2891, 1889, 920, 1262, 2114, [2096]. Address [2217, 1349, 2269, 2613]. 2820, 2467, 445, 497]. Alice [1156]. administration [459, 399, 432]. Aligning [105]. alive [601, 2489]. all-seeing administrators [1661]. admissions [134]. [1423]. Allan [2843]. Allen [2369, 398]. Adopting [1283]. adoption alliances [457, 2293]. allow [2726]. Alloy 3 [2945]. almanac [1733]. alone [2470]. applications Alphabet [2174]. Alternate [42]. [2458, 1736, 638, 1131, 412, 1107, 1382, 1379, alternative [25]. Always 2977, 1784, 614, 1696, 2910, 433, 1757]. [2606, 2525, 2780, 1341]. amateurs [2918]. Approach [2443, 282, 66, 680, 1993, 1207, Amazon [2384, 1673]. ambassador [471]. 2551, 2953, 2906, 1428, 103, 889, 2882, 2756, ambient [168]. ambitions [2692]. 319, 903, 643, 1944, 1200, 1351]. approaches ambitious [2825]. ambivalent [694]. [1083]. appropriating [616]. approved Amdahl [2627, 1876]. Amendment [2531]. [222]. approximate [1613, 1612]. Apps America [1868]. American [1896, 625, 1772, 2054, 1887, 2416, 1217, [2455, 627, 1270]. Americans [1734]. Amir 2087, 1990]. April [2509]. Arab [1367]. [8]. among [2571, 114, 1970]. amplification arbitrariness [1661]. arbitrary [1492, 94]. [988]. analog [2343, 1117, 2310, 2373]. Archimedes [1242]. architect [2719]. analyses [2923]. Analysis [2518, 1176, 1268, architectural [318]. Architecture 858, 55, 639, 2558, 1446, 270, 404, 1131, 559, [2444, 2299, 2633, 691, 273, 2779, 2649, 235, 2583, 725, 829, 269, 1739, 1339, 299, 560, 780, 2875, 2084, 291, 1609, 407, 2807]. 2808, 2537, 857, 1848, 643, 2186]. Analytics Architecture-Compiler [2444]. [2840, 1794, 2201, 1903, 1451, 1103, 1989, Architectures 2033, 1914]. analyze [30]. Analyzing [1866, 1508, 344, 2188, 1880, 2062, 860, 1272]. [868, 1609, 743, 2781, 2569]. anarchy archive [2665]. archives [721, 2446]. [914, 915]. Anatomy [1032]. ancient archiving [680]. area [784]. argument [1254, 712]. Andrew [2939, 130]. Android [1264]. arithmetic [2342, 2305, 2304]. arms [651]. anew [2117]. animal [2670, 1394]. [1872, 2178]. Array [587, 586]. arrived animal-like [2670]. Animals [2615]. [1603]. Arrogance [633]. art animation [2159, 1454]. anniversary [730, 2096, 722, 1986, 183, 2710, 2]. artifacts [2359]. annotate [277]. announces [1729]. [1767]. Artificial annual [736, 1045, 4, 387, 1320, 1593, 1871]. [2312, 2177, 2527, 2193, 1118, 733, 2870, 259, Anonymity [729, 1515, 1807]. 1786, 1193, 2733, 2886, 2480, 480, 598, 2526, anonymization [2268, 2577]. anonymized 1511, 2385, 2232, 834, 2448, 1972, 2694]. [730]. anonymous [763]. Answer [726]. artificiality [802]. arts Answering [2744, 1893]. answers [1472, 2194, 955, 2244]. Ashenhurst [12]. [1180, 2077]. Ant [1156]. Anti Ask [2457, 704]. aspects [1310]. [1730, 1929, 2765]. Anti-circumvention Aspirations [1304]. aspirin [2352]. ASPs [1730, 1929]. anti-counterfeiting [2765]. [66]. ASR [343]. ASR-33 [343]. assemble anticipates [2472]. Anticipating [2160]. [1773]. assemblies [1063]. assembly [1035]. antifragile [1216]. any Asserting [196]. Assessing [2238, 2737, 2837, 2688, 930]. anybody [56, 2153, 2614, 2733, 68]. assessment [2252]. anymore [1810, 248]. AP [1898]. [603, 1109, 2651]. assessments [618]. asset Apache [2132]. API [69]. assignment [521]. assist [1953]. [1903, 3020, 2015, 2894, 1378, 1933]. APIs assistance [2960]. assistant [2152]. [2846, 804, 1001, 1644]. Apollo [2750]. app assistants [2708]. assumptions [1895]. [2416, 2702]. appearance [1566]. assurance [100, 1821, 1283]. assurances appearances [1057]. apple [63]. Assuring [2355]. astonishing [559]. [1473, 312, 1050, 2416, 2031, 2223, 743]. astronaut [3013]. astronomical [143]. Application [2440, 237, 546, 520]. astronomy [721]. Asymmetries [487]. 4 asymmetry [527]. Asynchronous [836]. [1326]. Balloon [493]. Ban [1793, 2270]. Atomic [947]. Atomic-level [947]. bandage [1844]. banking [99]. banks [490]. attached [2921]. Attack [2253, 289, 2479]. banning [1854, 1853]. bar [128]. Barbara Attacking [2763, 1542]. Attacks [623]. Barbarians [1261]. Barcelona [2536]. [267, 1000, 1431, 2760, 2803, 2016, 753]. Bare [1891]. Bare-metal [1891]. barrier attendees [2081]. attitudes [2393, 157]. [2758]. Barriers [205, 2392, 1806, 104]. bars attracting [2773]. attraction [1296]. [62]. base [2706, 2280]. baseball [1311]. Auction [1838, 2323]. auctions [1360, 772]. based [2735, 2021, 1630, 529, 2206, 92, 531, audience [1861]. audio [1173]. audiovisual 167, 725, 810, 1496, 1701, 1379, 103, 131, [1289]. auditing [2005, 2073]. Augmented 2039, 2965, 2462, 433, 168, 2915, 2582, 1351]. [2935, 1502, 1163, 1282, 216, 1406]. basement [1900]. bases [2279]. basics Augmented-reality [1163]. [1655]. batches [2037]. bathwater [867]. authenticating [2717]. Authentication batteries [2163, 2162]. battery [2793]. [2871, 2212, 1740, 2250]. Author [955]. battle [824]. battlefield [801]. Battling authoritative [1492]. authors [1817]. [2099]. Bayes [436]. Bayesian [374, 1595]. AutoMan [2021]. automata [639, 1634]. bazaar [983]. Bazel [2753]. BBR [2206]. automate [2809]. Automated BCS [371]. Be [116, 60, 1600, 2466, 687, [1632, 1472, 9, 1776, 161, 3022, 953, 1988, 936, 597, 492, 155, 2725, 1058, 2979, 2268, 430, 2611, 24, 3006, 728]. Automatic 1160, 1054, 1938, 2704, 2368, 931, 310, 342, [1359,
Load more

Recommended publications
  • SIGCSE FY15 Annual Report July 2014 - June 2015 Submitted By: Susan H
    SIGCSE FY15 Annual Report July 2014 - June 2015 Submitted by: Susan H. Rodger, Chair 1. Awards that were given out: The SIGCSE Award for Outstanding Contribution to Computer Science Education was presented to Mark Allen Weiss from Florida International University for authoring textbooks on introductory programming and data structures that have had a profound impact on generations of students, and for dedicated service contributions regarding the Advanced Placement Computer Science program. The SIGCSE Award for Lifetime Service to the Computer Science Education Commu- nity was presented to Frank Young, Emeritus Professor of Rose-Hulman Institute, for dedicated service to the computing education community. He especially had many con- tributions to SIGCSE including co-chairing the Symposium, leading efforts for many years with the registration system for the Symposium and most recently spent many years as the SIGCSE Information Co-Director. 2. Significant papers on new areas that were published in proceedings ICER 2014 had two best paper awards. The Chair's award is selected by the organizing committee and was presented to: Leo Porter, Daniel Zingaro and Raymond Lister, Predicting student success using the fine grain clicker, ICER '14, Proceedings of the tenth annual conference on international computing education research, pages 51-58, 2014. The ICER 2014 John Henry Award is selected by the conference delegates and was presented to: Josh Tenenberg and Yifat Ben-David Kolikant, Computer programs, dialogicality and intentionality, ICER '14, Proceedings of the tenth annual conference on international computing education research, pages 99-106, 2014. The best paper selected at ITiCSE 2015 was: Insa, David and Silva, Josep, Semi-Automatic Assessment of Unrestrained Java Code: A Library, a DSL, and a Workbench to Assess Exams and Exercises, ITiCSE '15 Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, pages 39-44, 2015.
    [Show full text]
  • Arguments for an End-Middle-End Internet
    CHASING EME: ARGUMENTS FOR AN END-MIDDLE-END INTERNET A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Saikat Guha August 2009 c 2009 Saikat Guha ALL RIGHTS RESERVED CHASING EME: ARGUMENTS FOR AN END-MIDDLE-END INTERNET Saikat Guha, Ph.D. Cornell University 2009 Connection establishment in the Internet has remained unchanged from its orig- inal design in the 1970s: first, the path between the communicating endpoints is assumed to always be open. It is assumed that an endpoint can reach any other endpoint by simply sending a packet addressed to the destination. This assumption is no longer borne out in practice: Network Address Translators (NATs) prevent all hosts from being addressed, firewalls prevent all packets from being delivered, and middleboxes transparently intercept packets with- out endpoint knowledge. Second, the Internet strives to deliver all packets ad- dressed to a destination regardless of whether the packet is ultimately desired by the destination or not. Denial of Service (DoS) attacks are therefore common- place, and the Internet remains vulnerable to flash worms. This thesis presents the End-Middle-End (EME) requirements for connec- tion establishment that the modern Internet should satisfy, and explores the de- sign space of a signaling-based architecture that meets these requirements with minimal changes to the existing Internet. In so doing, this thesis proposes so- lutions to three real-world problems. First, it focuses on the problem of TCP NAT Traversal, where endpoints behind their respective NATs today cannot es- tablish a direct TCP connection with each other due to default NAT behavior.
    [Show full text]
  • Curriculum Vitae Bradley E. Richards December 2010
    Curriculum Vitae Bradley E. Richards December 2010 Office: Home: Department of Mathematics and Computer Science 13446 108th Ave SW University of Puget Sound Vashon, WA 98070 1500 N. Warner St. (206) 567-5308 Tacoma, WA 98416 (206) 234-3560 (cell) (253) 879{3579 (253) 879{3352 (fax) [email protected] Degrees Ph.D. in Computer Science, August 1996 and M.S. in Computer Science, May 1992 University of Wisconsin, Madison, WI Advisor: James R. Larus Thesis: \Memory Systems for Parallel Programming" M.Sc. in Computer Science, April 1990 University of Victoria, Victoria B.C., Canada Advisor: Maarten van Emden Thesis: \Contributions to Functional Programming in Logic" B.A. Degrees, magna cum laude, in Computer Science and Physics, May 1988 Gustavus Adolphus College, St. Peter, MN Advisor: Karl Knight Positions Held University of Puget Sound, Tacoma, Washington Professor (7/2010{present) Associate Professor (7/2005{6/2010) Vassar College, Poughkeepsie, New York Associate Professor, tenured (6/2004{8/2005) Assistant Professor (9/1997{6/2004) Visiting Assistant Professor (9/1996{8/1997) University of Wisconsin, Madison, Wisconsin Graduate Research Assistant (6/1993{8/1996) Graduate Teaching Assistant (9/1990{5/1993) University of Victoria, Victoria, B.C., Canada Graduate Research Assistant (9/1988{4/1990) Graduate Teaching Assistant (9/1988{4/1990) Grants and Awards Co-PI, NSF Computing Research Infrastructure (CRI) grant #0734761, titled \Workshop for investigating the issues involved in implementing a data repository for empirical CS education data." Total grant amount $19,070, awarded 7/2007. With PI Kathryn Sanders, Associate Professor of Mathematics and Computer Science, Rhode Island College.
    [Show full text]
  • Democratizing Content Distribution
    Democratizing content distribution Michael J. Freedman New York University Primary work in collaboration with: Martin Casado, Eric Freudenthal, Karthik Lakshminarayanan, David Mazières Additional work in collaboration with: Siddhartha Annapureddy, Hari Balakrishnan, Dan Boneh, Nick Feamster, Scott Garriss, Yuval Ishai, Michael Kaminsky, Brad Karp, Max Krohn, Nick McKeown, Kobbi Nissim, Benny Pinkas, Omer Reingold, Kevin Shanahan, Scott Shenker, Ion Stoica, and Mythili Vutukuru Overloading content publishers Feb 3, 2004: Google linked banner to “julia fractals” Users clicked onto University of Western Australia web site …University’s network link overloaded, web server taken down temporarily… Adding insult to injury… Next day: Slashdot story about Google overloading site …UWA site goes down again Insufficient server resources Browser Browser Origin Server Browser Browser Browser Browser Browser Browser Many clients want content Server has insufficient resources Solving the problem requires more resources Serving large audiences possible… Where do their resources come from? Must consider two types of content separately • Static • Dynamic Static content uses most bandwidth Dynamic HTML: 19.6 KB Static content: 6.2 MB 1 flash movie 5 style sheets 18 images 3 scripts Serving large audiences possible… How do they serve static content? Content distribution networks (CDNs) Centralized CDNs Static, manual deployment Centrally managed Implications: Trusted infrastructure Costs scale linearly Not solved for little guy Browser Browser Origin Server Browser Browser Browser Browser Browser Browser Problem: Didn’t anticipate sudden load spike (flash crowd) Wouldn’t want to pay / couldn’t afford costs Leveraging cooperative resources Many people want content Many willing to mirror content e.g., software mirrors, file sharing, open proxies, etc.
    [Show full text]
  • Enterprise Tech 30—The 2021 List
    Enterprise Tech 30—The 2021 List Rajeev Chand Partner Head of Research The Enterprise Tech 30 is an exclusive list of the most promising private Peter Wagner companies in enterprise technology. The list, which is in its third year, is Founding Partner based on an institutional research and survey process with 103 leading venture capitalists, who are identified and invited based on their track Jake Flomenberg Partner record, expertise, and reputation for discernment. Olivia Rodberg The Enterprise Tech 30 is now a platform for the startup community: a Research Associate watershed recognition for the 30 companies and a practical and February 24, 2021 invaluable resource for customers, partners, journalists, prospective team members, service providers, and deal makers, among others. We are pleased to present the Enterprise Tech 30 for 2021. Wing Venture Capital 480 Lytton Avenue Palo Alto, CA 94301 Early Mid Late 1. Modern Treasury 1. Zapier 1. HashiCorp 2. Privacera 2. Fishtown Analytics 2. Stripe 3. Roam Research 3. Retool 3. Databricks 4. Panther Labs 4. Netlify 4. GitLab 5. Snorkel AI 5. Notion 5. Airtable 6. Linear 6. Grafana Labs 6. Figma 7. ChartHop 7. Abnormal Security 7. Confluent 8. Substack 8. Gatsby 8. Canva 9. Monte Carlo 9. Superhuman 9. LaunchDarkly 10. Census 10. Miro 10. Auth0 Special Calendly 1 2021 The Curious Case of Calendly This year’s Enterprise Tech 30 has 31 companies rather than 30 due to the “curious case” of Calendly. Calendly, a meeting scheduling company, was categorized as Early-Stage when the ET30 voting process started on January 11 as the company had raised $550,000.
    [Show full text]
  • Kent Academic Repository Full Text Document (Pdf)
    Kent Academic Repository Full text document (pdf) Citation for published version Tenenberg, Josh and Fincher, Sally (2007) Opening the Door of the Computer Science Classroom: The Disciplinary Commons. In: Proceedings of the 38th SIGCSE Symposium on Computer Science Education. Association for Computing Machinery, United States pp. 514-518. ISBN 1-59593-361-1. DOI https://doi.org/10.1145/1227504.1227484 Link to record in KAR https://kar.kent.ac.uk/14604/ Document Version UNSPECIFIED Copyright & reuse Content in the Kent Academic Repository is made available for research purposes. Unless otherwise stated all content is protected by copyright and in the absence of an open licence (eg Creative Commons), permissions for further reuse of content should be sought from the publisher, author or other copyright holder. Versions of research The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record. Enquiries For any further enquiries regarding the licence status of this document, please contact: [email protected] If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Opening the Door of the Computer Science Classroom: The Disciplinary Commons Josh Tenenberg Sally Fincher University of Washington, Tacoma Computing Laboratory Instute of Technology University of Kent Tacoma, WA 98402 Canterbury, Kent, UK +1-253-692-5860 +44 1227 824061 [email protected] [email protected] ABSTRACT starting their lives within the profession, practitioners have essentially no experience of what will be their daily tasks.
    [Show full text]
  • Nil Ib N O Ir Ali Mi S Na El Oo B Ilp Itl
    ecneicS retupmoC retupmoC ecneicS ecneicS - o t- o l t aA l aA DD DD 9 9 / / OOnn BBiilliinneeaarr TTeecchhnniiqquueess ffoorr 0202 0202 a p pa p r p a r K a K ii t t t aM t aM SSiimmiillaarriittyy SSeeaarrcchh aanndd BBoooolleeaann MMaattrriixx M ultiplication Multiplication MMaatttit iK Kaarprpppaa noi taci lpi t luM xi r taM naelooB dna hcraeS yt i ral imiS rof seuqinhceT raeni l iB nO noi taci lpi t luM xi r taM naelooB dna hcraeS yt i ral imiS rof seuqinhceT raeni l iB nO BBUUSSININESESS + + ECECOONNOOMMY Y NSI I NBS NBS 879 - 879 - 259 - 259 - 06 - 06 - 5198 - 5198 7 - 7 ( p ( r p i n r t i n t de ) de ) AARRT T+ + NSI I NBS NBS 879 - 879 - 259 - 259 - 06 - 06 - 6198 - 6198 4 - 4 ( ( dp f dp ) f ) DDESESIGIGNN + + NSI I NSS NSS 9971 - 9971 - 4394 4394 ( p ( r p i n r t i n t de ) de ) AARRCCHHITIETCECTUTURRE E NSI I NSS NSS 9971 - 9971 - 2494 2494 ( ( dp f dp ) f ) SSCCIEINENCCE E+ + TETCECHHNNOOLOLOGGY Y tirvn tlaA ot laA ot isrevinU yt isrevinU yt CCRROOSSSOOVEVRE R ceic fo o oohcS f l cS o oohcS i f l cS i ecne ecne DDOOCCTOTORRAAL L ecneicS retupmoC retupmoC ecneicS ecneicS DDISISSERERTATTAITOIONNS S DDOOCCTOTORRAAL L +hfbjia*GMFTSH9 +hfbjia*GMFTSH9 fi.otlaa.www . www a . a a l a t o l t . o fi . fi DDISISSERERTATTAITOIONNS S ot laA ytot laA isrevinU yt isrevinU 0202 0202 Aalto University publication series DOCTORAL DISSERTATIONS 9/2020 On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication Matti Karppa A doctoral dissertation completed for the degree of Doctor of Science (Technology) to be defended, with the permission of the Aalto University School of Science, at a public examination held at the lecture hall T2 of the school on 24 January 2020 at 12.
    [Show full text]
  • Computer Science Curricula 2013
    Computer Science Curricula 2013 Strawman Draft (February 2012) The Joint Task Force on Computing Curricula Association for Computing Machinery IEEE-Computer Society CS2013 Steering Committee ACM Delegation IEEE-CS Delegation Mehran Sahami, Chair (Stanford University) Steve Roach, Chair (Univ. of Texas, El Paso) Andrea Danyluk (Williams College) Ernesto Cuadros-Vargas (Univ. Catolica San Pablo) Sally Fincher (University of Kent) Ronald Dodge (US Military Academy) Kathleen Fisher (Tufts University) Robert France (Colorado State University) Dan Grossman (University of Washington) Amruth Kumar (Ramapo Coll. of New Jersey) Beth Hawthorne (Union County College) Brian Robinson (ABB Corporation) Randy Katz (UC Berkeley) Remzi Seker (Univ. of Arkansas, Little Rock) Rich LeBlanc (Seattle University) Alfred Thompson (Microsoft) Dave Reed (Creighton University) - 2 - Table of Contents Chapter 1: Introduction ................................................................................................................... 5 Charter......................................................................................................................................... 6 High-level Themes ...................................................................................................................... 6 Knowledge Areas ........................................................................................................................ 7 Previous Input ............................................................................................................................
    [Show full text]
  • Managing Large-Scale, Distributed Systems Research Experiments with Control-Flows Tomasz Buchert
    Managing large-scale, distributed systems research experiments with control-flows Tomasz Buchert To cite this version: Tomasz Buchert. Managing large-scale, distributed systems research experiments with control-flows. Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Lorraine, 2016. English. tel- 01273964 HAL Id: tel-01273964 https://tel.archives-ouvertes.fr/tel-01273964 Submitted on 15 Feb 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. École doctorale IAEM Lorraine MANAGINGLARGE-SCALE,DISTRIBUTED SYSTEMSRESEARCHEXPERIMENTSWITH CONTROL-FLOWS THÈSE présentée et soutenue publiquement le 6 janvier 2016 pour l’obtention du DOCTORATDEL’UNIVERSITÉDELORRAINE (mention informatique) par TOMASZBUCHERT Composition du jury : Rapporteurs Christian Pérez, Directeur de recherche Inria, LIP, Lyon Eric Eide, Research assistant professor, Univ. of Utah Examinateurs François Charoy, Professeur, Université de Lorraine Olivier Richard, Maître de conférences, Univ. Joseph Fourier, Grenoble Directeurs de thèse Lucas Nussbaum, Maître de conférences, Université de Lorraine Jens Gustedt, Directeur de recherche Inria, ICUBE, Strasbourg Laboratoire Lorrain de Recherche en Informatique et ses Applications – UMR 7503 ABSTRACT(ENGLISH) Keywords: distributed systems, large-scale experiments, experiment control, busi- ness processes, experiment provenance Running experiments on modern systems such as supercomputers, cloud infrastructures or P2P networks became very complex, both technically and methodologically.
    [Show full text]
  • Multi-Institutional Teaching Communities in Computer Education
    Multi-Institutional Teaching Communities in Computer Education Sally Fincher Raymond Lister Arnold Pears Computing Laboratory, Faculty of Information Technology, Dept of Information Technology, University of Kent, University of Technology, Sydney, Uppsala University, United Kingdom Australia Sweden [email protected] [email protected] [email protected] Judy Sheard Josh Tenenberg Alison Young School of Computer Science and Computing and Software Systems Computing and Information Software Engineering Institute of Technology Technology Monash University University of Washington, Unitec, Auckland Australia United States of America New Zealand [email protected] [email protected] [email protected] 1 Raymond Lister: the Chair’s Introduction 2 Sally Fincher: The Computer Science Most Information Technology academics lead double Discipline Network (CSDN) lives. In our research lives, we are involved in a The UK Computer Science Discipline Network (CSDN) community that exists primarily beyond our own was initially funded for one year (1994-95) in the first- university. We read the literature, we attend conferences, phase of the governmental Discipline Networks' we work within well defined theoretical or empirical Initiative. It subsequently succeeded in gaining funding frameworks, we publish, and the cycle repeats, with for another year (1995-96) in the second round of first- community members building upon each other's work. phase bidding. One of the major aims of CSDN was to In contrast, for most of us, our teaching lives are engage, develop, support and sustain a community of relatively private, and primarily confined to our own interested practitioners. university. We tend not to read teaching literature, we are I’ll examine the needs which CSDN set out to fulfil, the guided primarily by our direct experiences, intuitions, and mechanisms by which we tried to achieve our aims and introspections.
    [Show full text]
  • On-Device Machine Learning: an Algorithms and Learning Theory Perspective
    On-Device Machine Learning: An Algorithms and Learning Theory Perspective SAUPTIK DHAR, America Research Center, LG Electronics JUNYAO GUO, America Research Center, LG Electronics JIAYI (JASON) LIU, America Research Center, LG Electronics SAMARTH TRIPATHI, America Research Center, LG Electronics UNMESH KURUP, America Research Center, LG Electronics MOHAK SHAH, America Research Center, LG Electronics The predominant paradigm for using machine learning models on a device is to train a model in the cloud and perform inference using the trained model on the device. However, with increasing number of smart devices and improved hardware, there is interest in performing model training on the device. Given this surge in interest, a comprehensive survey of the field from a device-agnostic perspective sets the stage for both understanding the state-of-the-art and for identifying open challenges and future avenues of research. However, on-device learning is an expansive field with connections to a large number of related topics in AI and machine learning (including online learning, model adaptation, one/few-shot learning, etc.). Hence, covering such a large number of topics in a single survey is impractical. This survey finds a middle ground by reformulating the problem of on-device learning as resource constrained learning where the resources are compute and memory. This reformulation allows tools, techniques, and algorithms from a wide variety of research areas to be compared equitably. In addition to summarizing the state-of-the-art, the survey also identifies a number of challenges and next steps for both the algorithmic and theoretical aspects ofon-device learning. ACM Reference Format: Sauptik Dhar, Junyao Guo, Jiayi (Jason) Liu, Samarth Tripathi, Unmesh Kurup, and Mohak Shah.
    [Show full text]
  • Algorithms and Data Structures for Strings, Points and Integers Or, Points About Strings and Strings About Points
    Downloaded from orbit.dtu.dk on: Sep 23, 2021 Algorithms and Data Structures for Strings, Points and Integers or, Points about Strings and Strings about Points Vind, Søren Juhl Publication date: 2015 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Vind, S. J. (2015). Algorithms and Data Structures for Strings, Points and Integers: or, Points about Strings and Strings about Points. Technical University of Denmark. DTU Compute PHD-2015 No. 366 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Algorithms and Data Structures for Strings, Points and Integers or, Points about Strings and Strings about Points Søren Vind Ph.D. Thesis PHD-2015-366 ISSN: 0909-3192 DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Richard Petersens Plads Building 324 2800 Kongens Lyngby, Denmark Phone +45 4525 3031 [email protected] www.compute.dtu.dk PHD-2015-366 ISSN: 0909-3192 Abstract This dissertation presents our research in the broad area of algorithms and data struc- tures.
    [Show full text]