Solving the Search for Source Code

Total Page:16

File Type:pdf, Size:1020Kb

Solving the Search for Source Code University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Computer Science and Engineering: Theses, Computer Science and Engineering, Department Dissertations, and Student Research of 8-2013 Solving the Search for Source Code Kathryn T. Stolee University of Nebraska-Lincoln, [email protected] Follow this and additional works at: https://digitalcommons.unl.edu/computerscidiss Part of the Computer Engineering Commons, and the Software Engineering Commons Stolee, Kathryn T., "Solving the Search for Source Code" (2013). Computer Science and Engineering: Theses, Dissertations, and Student Research. 64. https://digitalcommons.unl.edu/computerscidiss/64 This Article is brought to you for free and open access by the Computer Science and Engineering, Department of at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Computer Science and Engineering: Theses, Dissertations, and Student Research by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. SOLVING THE SEARCH FOR SOURCE CODE by Kathryn T. Stolee A DISSERTATION Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfilment of Requirements For the Degree of Doctor of Philosophy Major: Computer Science Under the Supervision of Professor Sebastian Elbaum Lincoln, Nebraska August, 2013 SOLVING THE SEARCH FOR SOURCE CODE Kathryn T. Stolee, Ph.D. University of Nebraska, 2013 Adviser: Sebastian Elbaum Programmers frequently search for source code to reuse using keyword searches. When effective and efficient, a code search can boost programmer productivity, however, the search effectiveness depends on the programmer's ability to specify a query that captures how the desired code may have been implemented. Further, the results often include many irrelevant matches that must be filtered manually. More semantic search approaches could address these limitations, yet existing approaches either do not scale, are not flexible enough to find approximate matches, or require complex specifications. We propose a novel approach to semantic search that addresses some of these limitations and is designed for queries that can be described using an example. In this approach, programmers write lightweight specifications as inputs and expected output examples for the behavior of desired code. Using these specifications, an SMT solver identifies source code from a repository that matches the specifications. The repository is composed of program snippets encoded as constraints that approximate the semantics of the code. This research contributes the first work toward using SMT solvers to search for existing source code. In this dissertation, we motivate the study of code search and the utility of a more semantic approach to code search. We introduce and illustrate the generality of our approach using subsets of three languages, Java, Yahoo! Pipes, and SQL. Our approach is implemented in a tool, Satsy, for Yahoo! Pipes and Java. The evaluation covers various aspects of the approach, and the results indicate that this approach is effective at finding relevant code. Even with a small repository, our search is competitive with state-of-the-practice syntactic searches when searching for Java code. Further, this approach is flexible and can be used on its own, or in conjunction with a syntactic search. Finally, we show that this approach is adaptable to finding approximate matches when exact matches do not exist, and that programmers are capable of composing input/output queries with reasonable speed and accuracy. These results are promising and lead to several open research questions that we are only beginning to explore. iv DEDICATION To my loving spouse. v ACKNOWLEDGMENTS A tremendous amount of time and effort goes into the work behind and writing of a dissertation. I have been extremely fortunate to have a team of people behind me, providing support and guidance along the way. It would be impossible to list everyone and express exactly how much their support means to me. To my family, friends, and colleagues, thank you. To my husband, Derrick, for his unfailing love and support. To my advisor, Sebastian, for his support, guidance, and friendship. To my committee, Matt, Myra, Gregg, and Kent, for their time, effort, and interest. To my family, Mom, Dad, Colin, Dan, Ann, Lillie, Vivian, and Ethan. To my best friends, Aimee, Stephanie, and Elena. To my UNL colleagues, Brady, Zhihong, Josh, Eric, Javier, Tingting, and Pingyu. To the UNL CSE faculty and staff. To the Lincoln, NE community. Thank you for the past 9 years of hospitality. vi GRANT INFORMATION This work is supported in part by NSF SHF-1218265, NSF GRFP under CFDA-47.076, a Google Faculty Research Award, and AFOSR #9550-10-1-0406 vii Contents Contents vii List of Figures xvi List of Tables xviii 1 Introduction 1 1.1 Contributions . 5 1.2 Outline of Dissertation . 6 2 Background 8 2.1 Java .................................... 9 2.2 Yahoo! Pipes . 10 2.3 SQL . 12 2.4 Constraint Solvers . 13 2.5 Symbolic Execution . 14 3 Motivation 18 3.1 User Survey . 19 3.1.1 Participants . 19 3.1.2 Search Frequency . 21 viii 3.1.3 Why do Programmers Search for Source Code? . 22 3.1.4 Tools Used in Code Search Activities . 22 3.1.5 Summary . 24 3.2 State-of-the-Practice Code Search . 25 3.2.1 Java . 25 3.2.2 Yahoo! Pipes . 26 3.2.3 SQL . 28 3.3 Input/Output Examples in the Wild . 29 3.3.1 Sampling . 29 3.3.2 Analysis . 30 3.3.3 Results . 30 3.4 Summary . 33 4 Illustrative Examples 34 4.1 Semantic Search Approach Overview . 34 4.2 Java Source Code . 36 4.2.1 Refining the Search with Multiple I/O Pairs . 37 4.2.2 Mapping Input and Output . 37 4.2.3 Partial Matches . 38 4.2.4 Using the Solver for Symbolic Variables . 41 4.2.5 Poor Matches . 42 4.3 Yahoo! Pipes Mashups . 43 4.3.1 Assigning Inputs to Fetch Modules . 44 4.3.2 Yahoo! Pipes Example: Encoding a Pipe . 46 4.3.3 Abstracting String Values . 48 4.4 SQL Select Statements . 49 ix 4.4.1 Large Specifications . 49 4.4.2 Implicit Join on Inputs . 50 4.5 Summary . 51 5 Approach 52 5.1 Specifying Behavior . 52 5.1.1 Specification Refinement . 54 5.1.2 Specification Abstraction . 56 5.1.3 Specification Encoding . 57 5.2 Encoding . 58 5.2.1 Program Transformation . 59 5.2.2 Mapping Input and Output . 64 5.2.3 Abstraction Selection . 66 5.2.3.1 Weakening Example in Java . 68 5.2.3.2 Weakening Example in Yahoo! Pipes . 71 5.3 Solving . 72 5.3.1 Matching with Multiple I/O Pairs . 73 5.3.2 Ranking . 74 5.3.2.1 Path Matching . 75 5.3.2.2 Concrete Variable Density . 76 5.3.2.3 User Context . 78 5.3.3 Ambiguity . 78 5.4 Summary . 79 6 Implementation 80 6.1 Solving with Satsy . 81 6.2 Data Types . 82 x 6.3 Java Implementation Detail . 85 6.3.1 Language Support . 85 6.3.2 Program Transformation . 88 6.3.2.1 JPF Driver Creation . 88 6.3.2.2 JPF Listener . 89 6.3.2.3 Program Encoding . 90 6.3.2.4 Abstraction . 93 6.3.2.5 Limitations and Nuances . 93 6.3.3 Constraint Storage . 94 6.4 Yahoo! Pipes Implementation Detail . 95 6.4.1 Language Support . 95 6.4.2 Program Transformation . 97 6.4.2.1 List Implementation . 97 6.4.2.2 Program Encoding . 99 6.4.2.3 Abstraction . 101 6.4.3 Constraint Storage . 102 6.5 Summary . 102 7 Java Evaluation 104 7.1 Java Study 1 . 106 7.1.1 RQ2(a): Comparison to State-of-the-Practice . 107 7.1.1.1 Artifacts . 108 7.1.1.2 Metrics . 111 7.1.1.3 Implementation . 112 7.1.1.4 Results . 112 7.1.2 RQ2(b): Augmenting the State-of-the-Practice . 116 xi 7.1.2.1 Artifacts . 117 7.1.2.2 Metrics . 117 7.1.2.3 Implementation . 118 7.1.2.4 Results . 118 7.2 Java Study 2 . 120 7.2.1 Design . 122 7.2.1.1 Treatment Structure . 123 7.2.1.2 Experimental Design . 123 7.2.2 Artifacts . 124 7.2.2.1 Repository . 124 7.2.2.2 Programming Tasks . 125 7.2.2.3 Query Generation . 129 7.2.2.4 Snippet Retrieval . 130 7.2.3 Metrics . 134 7.2.4 Implementation . 135 7.2.4.1 Tasks . 135 7.2.4.2 Deployment . 137 7.2.4.3 Participants . 137 7.2.5 Results . 138 7.2.5.1 On Types of Problem . 142 7.2.5.2 MTurk participants . 142 7.2.5.3 On the Impact of Ranking on Results . 143 7.2.5.4 On the Influence of Repository Size on Results . 150 7.3 Summary.
Recommended publications
  • Jeffrey Scudder Google Inc. March 28, 2007 Google Spreadsheets Automation Using Web Services
    Jeffrey Scudder Google Inc. March 28, 2007 Google Spreadsheets Automation using Web Services Jeffrey Scudder Google Inc. March 28, 2007 2 Overview What is Google Spreadsheets? • Short Demo What is the Google Spreadsheets Data API? • Motivations (Why an API?) • Protocol design • Atom Publishing Protocols • GData • List feed deconstructed How do I use the Google Spreadsheets Data API? • Authentication • Longer Demo Questions 3 What is Google Spreadsheets? Let’s take a look 4 What is Google Spreadsheets? Why not ask why • Spreadsheets fits well with our mission… – “Organize My Information… and… – Make it Accessible and Useful… – With whomever I choose (and nobody else, thanks)” • In other words…. – Do-it-yourself Content Creation – Accepted/Familiar Interface of Spreadsheets and Documents – Accessibility from anywhere (…connected) – Easy-to-use Collaboration – Do-it-yourself Community Creation 5 What is the Google Spreadsheets Data API? Motivations • Foster development of specific-use apps • Allow users to create new UIs • To extend features offered • To integrate with 3rd party products • To offer new vertical applications 6 What is the Google Spreadsheets Data API? Protocol design based on existing open standards • Deciding on design principles – Use a RESTful approach – Reuse open standards – Reuse design from other Google APIs • The end result – REST web service based on GData – Data is in Atom XML and protocol based on the Atom Publishing Protocol (APP) – GData is based on Atom and APP and adds authentication, query semantics, and more
    [Show full text]
  • Query Expansion Based on Crowd Knowledge for Code Search
    IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 9, NO. X, XXXXX 2016 1 Query Expansion Based on Crowd Knowledge for Code Search Liming Nie, He Jiang, Zhilei Ren, Zeyi Sun, and Xiaochen Li Abstract—As code search is a frequent developer activity in software development practices, improving the performance of code search is a critical task. In the text retrieval based search techniques employed in the code search, the term mismatch problem is a critical language issue for retrieval effectiveness. By reformulating the queries, query expansion provides effective ways to solve the term mismatch problem. In this paper, we propose Query Expansion based on Crowd Knowledge (QECK), a novel technique to improve the performance of code search algorithms. QECK identifies software-specific expansion words from the high quality pseudo relevance feedback question and answer pairs on Stack Overflow to automatically generate the expansion queries. Furthermore, we incorporate QECK in the classic Rocchio’s model, and propose QECK based code search method QECKRocchio. We conduct three experiments to evaluate our QECK technique and investigate QECKRocchio in a large-scale corpus containing real-world code snippets and a question and answer pair collection. The results show that QECK improves the performance of three code search algorithms by up to 64 percent in Precision, and 35 percent in NDCG. Meanwhile, compared with the state-of-the-art query expansion method, the improvement of QECKRocchio is 22 percent in Precision, and 16 percent in NDCG. Index Terms—Code search, crowd knowledge, query expansion, information retrieval, question & answer pair Ç 1INTRODUCTION ODE search is a frequent developer activity in software Obviously, it is not an easy task to formulate a good query, Cdevelopment practices, which has been a part of soft- which depends greatly on the experience of the developer and ware development for decades [47].
    [Show full text]
  • Google Cheat Sheets [.Pdf]
    GOOGLE | CHEAT SHEET Key for skill required Novice This two page Google Cheat Sheet lists all Google services and tools as to understand the Intermediate well as background information. The Cheat Sheet offers a great reference underlying concepts to grasp of basic to advance Google query building concepts and ideas. Expert CHEAT SHEET GOOGLE SERVICES Google domains google.co.kr Google Company Information google.ae google.kz Public (NASDAQ: GOOG) and google.com.af google.li (LSE: GGEA) Google AdSense https://www.google.com/adsense/ google.com.ag google.lk google.off.ai google.co.ls Founded Google AdWords https://adwords.google.com/ google.am google.lt Menlo Park, California (1998) Google Analytics http://google.com/analytics/ google.com.ar google.lu google.as google.lv Location Google Answers http://answers.google.com/ google.at google.com.ly Mountain View, California, USA Google Base http://base.google.com/ google.com.au google.mn google.az google.ms Key people Google Blog Search http://blogsearch.google.com/ google.ba google.com.mt Eric E. Schmidt Google Bookmarks http://www.google.com/bookmarks/ google.com.bd google.mu Sergey Brin google.be google.mw Larry E. Page Google Books Search http://books.google.com/ google.bg google.com.mx George Reyes Google Calendar http://google.com/calendar/ google.com.bh google.com.my google.bi google.com.na Revenue Google Catalogs http://catalogs.google.com/ google.com.bo google.com.nf $6.138 Billion USD (2005) Google Code http://code.google.com/ google.com.br google.com.ni google.bs google.nl Net Income Google Code Search http://www.google.com/codesearch/ google.co.bw google.no $1.465 Billion USD (2005) Google Deskbar http://deskbar.google.com/ google.com.bz google.com.np google.ca google.nr Employees Google Desktop http://desktop.google.com/ google.cd google.nu 5,680 (2005) Google Directory http://www.google.com/dirhp google.cg google.co.nz google.ch google.com.om Contact Address Google Earth http://earth.google.com/ google.ci google.com.pa 2400 E.
    [Show full text]
  • Opensocialに見る Googleのオープン戦略 G オ 戦略
    OpenSocialに見る Googleのオオ戦略ープン戦略 Seasar Conference 2008 Autumn よういちろう(TANAKA Yoichiro) (C) 2008 Yoichiro Tanaka. All rights reserved. 08.9.6 1 Seasar Conference 2008 Autumn Self‐introduction • 田中 洋郎洋一郎(TANAKA Yoichiro) – Mash up Award 3rd 3部門同時受賞 – Google API Expert(OpenSocial) 天使やカイザー と呼ばれて 検索 (C) 2008 Yoichiro Tanaka. All rights reserved. 08.9.6 2 Seasar Conference 2008 Autumn Agenda • Impression of Google • What’s OpenSocial? • Process to open • Google now (C) 2008 Yoichiro Tanaka. All rights reserved. 08.9.6 3 Seasar Conference 2008 Autumn Agenda • Impression of Google • What’s OpenSocial? • Process to open • Google now (C) 2008 Yoichiro Tanaka. All rights reserved. 08.9.6 4 Seasar Conference 2008 Autumn Services produced by Google http://www.google.co.jp/intl/ja/options/ (C) 2008 Yoichiro Tanaka. All rights reserved. 08.9.6 5 Seasar Conference 2008 Autumn APIs & Developer Tools Android Google Web Toolkit Blogger Data API Chromium Feedbunner APIs Gadgets API Gmail Atom Feeds Google Account Google AdSense API Google AdSense for Audio Authentication API Google AdWords API Google AJAX APIs Google AJAX Feed API Google AJAX LAnguage API Google AJAX Search API Google Analytics Google App Engine Google Apps APIs Google Base Data API Google Book Search APIs Google Calendar APIs and Google Chart API Google Checkout API Google Code Search Google Code Search Data Tools API GlGoogle Custom ShSearch API GlGoogle Contacts Data API GlGoogle Coupon FdFeeds GlGoogle DkDesktop GdGadget GlGoogle DkDesktop ShSearch API APIs Google Documents List Google
    [Show full text]
  • Leveraging Social Coding Websites DISSERTATION Submitted in Partial
    UNIVERSITY OF CALIFORNIA, IRVINE Beyond Similar Code: Leveraging Social Coding Websites DISSERTATION submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Software Engineering by Di Yang Dissertation Committee: Professor Cristina V. Lopes, Chair Professor James A. Jones Professor Sam Malek 2019 c 2019 Di Yang DEDICATION To my loving husband, Zikang. ii TABLE OF CONTENTS Page LIST OF FIGURES vi LIST OF TABLES viii ACKNOWLEDGMENTS ix CURRICULUM VITAE x ABSTRACT OF THE DISSERTATION xiv 1 Introduction 1 1.1 Overview . .1 1.1.1 Background . .1 1.1.2 Research Questions . .2 1.2 Thesis Statement . .3 1.3 Methodology and Key Findings . .3 2 Usability Analysis of Stack Overflow Code Snippets 6 2.1 Introduction . .6 2.2 Related Work . .9 2.3 Usability Rates . 11 2.3.1 Snippets Processing . 12 2.3.2 Findings . 15 2.3.3 Error Messages . 18 2.3.4 Heuristic Repairs for Java and C# Snippets . 19 2.4 Qualitative Analysis . 24 2.5 Google Search Results . 27 2.6 Conclusion . 30 3 File-level Duplication Analysis of GitHub 32 3.1 Introduction . 33 3.2 Related Work . 37 3.3 Analysis Pipeline . 40 3.3.1 Tokenization . 40 3.3.2 Database . 41 iii 3.3.3 SourcererCC . 42 3.4 Corpus . 43 3.5 Quantitative Analysis . 45 3.5.1 File-Level Analysis . 45 3.5.2 File-Level Analysis Excluding Small Files . 47 3.6 Mixed Method Analysis . 48 3.6.1 Most Duplicated Non-Trivial Files . 49 3.6.2 File Duplication at Different Levels .
    [Show full text]
  • List of Search Engines
    A blog network is a group of blogs that are connected to each other in a network. A blog network can either be a group of loosely connected blogs, or a group of blogs that are owned by the same company. The purpose of such a network is usually to promote the other blogs in the same network and therefore increase the advertising revenue generated from online advertising on the blogs.[1] List of search engines From Wikipedia, the free encyclopedia For knowing popular web search engines see, see Most popular Internet search engines. This is a list of search engines, including web search engines, selection-based search engines, metasearch engines, desktop search tools, and web portals and vertical market websites that have a search facility for online databases. Contents 1 By content/topic o 1.1 General o 1.2 P2P search engines o 1.3 Metasearch engines o 1.4 Geographically limited scope o 1.5 Semantic o 1.6 Accountancy o 1.7 Business o 1.8 Computers o 1.9 Enterprise o 1.10 Fashion o 1.11 Food/Recipes o 1.12 Genealogy o 1.13 Mobile/Handheld o 1.14 Job o 1.15 Legal o 1.16 Medical o 1.17 News o 1.18 People o 1.19 Real estate / property o 1.20 Television o 1.21 Video Games 2 By information type o 2.1 Forum o 2.2 Blog o 2.3 Multimedia o 2.4 Source code o 2.5 BitTorrent o 2.6 Email o 2.7 Maps o 2.8 Price o 2.9 Question and answer .
    [Show full text]
  • Portfolio: a Search Engine for Finding Functions and Their Usages
    Portfolio: A Search Engine for Finding Functions and Their Usages Collin McMillan Mark Grechanik Denys Poshyvanyk Qing Xie, Chen Fu College of William & Mary Accenture and UIC College of William & Mary Accenture Technology Lab Williamsburg, VA 23185 Chicago, IL 60601 Williamsburg, VA 23185 Chicago, IL 60601 [email protected] [email protected] [email protected] [email protected] ABSTRACT Consider the situation where a programmer wants to accomplish In this demonstration, we present a code search system called Port- the complete task of editing and saving a PDF file. He or she may edit save pdf file folio that retrieves and visualizes relevant functions and their us- enter the query “ ” into a search engine. ages. We will show how chains of relevant functions and their us- Existing source code search engines would return some functions ages can be visualized to users in response to their queries. that create PDF files, some functions that write data in the PDF file format, and some functions that manipulate PDF files. Typi- Categories and Subject Descriptors cally, programmers investigate these functions to determine which D.2.13 [Reusable Libraries]: Reusable Libraries of them are relevant and to determine how to compose the concepts in these functions into complete tasks. Unfortunately, the results General Terms from existing engines do not show to programmers how isolated Algorithms, Experimentation functions interact in the context of other functions, despite the fact Keywords that the programmer wants to see the code for the whole task of how to edit PDF data and save it. A search engine can support pro- source code search engines, information retrieval grammers efficiently if it incorporates in its user ranking how these 1.
    [Show full text]
  • Programming the Cloud: the Internet As Platform
    Programming the Cloud: the Internet as Platform Gregor Hohpe Software Engineer www.EnterpriseIntegrationPatterns.com © 2008 Google, Inc. All rights reserved, Who’s Gregor? • Distributed systems, asynchronous messaging, service-oriented architectures • MQ, MSMQ, JMS, ESB’s • Software engineer at Google • Book: Enterprise Integration Patterns •Site: www.eaipatterns.com • Write code every day. Share knowledge through patterns. • “Starbucks does not use 2-phase commit” featured in Joel Spolsky’s Best Software Writing. © 2008 Google, Inc. All rights reserved, 2 1 Internet as a Platform: The Good Falling cost of Ubiquitous Democratized storage and broadband tools of computing connectivity production power © 2008 Google, Inc. All rights reserved, 3 Internet as a Platform: The Challenges Architect’s Dream Developer’s Nightmare •Loosely coupled •NO Call Stack •Extensible •NO Transactions •Standards-based •NO Promises •Fault tolerant •NO Certainty •Unlimited computing •NO Ordering power Constraints •Ubiquitous © 2008 Google, Inc. All rights reserved, 4 2 Isn’t This What Distributed Transactions Are For? •Require coordinator •Even 2 Phase Commit has windows of uncertainty •Not practical for long running interactions • Locks not practical / economical • Isolation not possible / practical •Usually not supported •Don’t scale “Life“Life BeyondBeyond DistributedDistributed TransactionsTransactions –– anan Apostate’sApostate’s Opinion”Opinion” --Pat Helland © 2008 Google, Inc. All rights reserved, 5 Still An Issue With HTTP •Hardware failure •Network
    [Show full text]
  • Entity-Based Message Bus for Saas Integration
    Entity-based Message Bus for SaaS Integration Yu-Jen John Sun Supervisor: Prof. Boualem Benatallah School of Computer Science and Engineering University of New South Wales Sydney, Australia A thesis submitted in fulfillment of the requirements for the degree of Masters of Science Sep 2015 Acknowledgments First of all, I would like to thank my supervisor Prof. Boualem Benatallah for this guidance and encouragement during my research. Without his support this work would not have been possible. I thank my co-authors, Dr. Moshe Chai Barukh and Dr. Amin Beheshti for their enjoyable collaborations. I would like to thank Moshe especially for his help in reviewing and editing our publishes. In addition, I would like to thank my fellow research colleagues for their kind encouragement and Denis Weerasiri, for giving me a lot of advices throughout the years. My final thanks go to my family for supporting me in pursuing an ad- vanced degree. I am especially grateful to my sister for her encouragement during my study in UNSW. ii Abstract The rising popularity of SaaS allows individuals and enterprises to leverage various services (e.g. Dropbox, Github, GDrive and Yammer) for everyday processes. Concequently, an enormous amount of Application Programming Interfaces (APIs) were generated since the demand of cloud services, allow- ing third-party developers to integrate these services into their processes. However, the explosion of APIs and the heterogeneous interfaces makes the discovery and integration of Web services a complex technical issue. More- over, these disparate services do not in general communicate with each other, rather used in an ad-hoc manner with little or no customizable process sup- port.
    [Show full text]
  • Google Annual Stockholders Meeting 2007
    Google, Inc. Annual Stockholders Meeting 2007 Eric: Good afternoon and we are delighted to have you all come to Google. I hope you enjoyed lunch. Female: Yes! Eric: Yes. The lunches are worth coming to Google for. And it’s a delight to have you all here. First thing is I noticed we have some people in the back who are standing. We have a wonderful overflow room downstairs which has all the same high quality food. So if you get tired of standing, please feel free to go downstairs. You can come right back up, no problem. What I wanted to do is first we’re going to have just a brief comment from myself and then we’re going to have David Drummond, who is our General Counsel, go ahead and conduct our formal meeting. And then after that we’ll have a short talk by myself and then some Q&A from everybody. I wanted to begin by introducing someone who is the best business technology partner that you could ever have in the world and I am fortunate to have him as my business partner, Larry Page. And Sergey’s out of town and is the other of the troika and is just unbelievable. I also wanted to take a minute to acknowledge that we have some of our very, very distinguished Board of Directors here. Of course, Larry and myself, but the ones that really do the work: Art Levinson, Paul Otellini and a number of others that I think are on the way. I wanted to take a special minute to acknowledge one board member for whom this is the last official time point in their board service and that’s Mike Morris.
    [Show full text]
  • "Olvidos" De Oncuba
    Síguenos en: www.ahora.cu www.facebook.com/periodico.ahora https://twitter.com/ahoracu ¡@hora! Holguín, 1 de julio de 2014 No. 628 Revelan detalles sobre la visita de ejecutivos de Google y los "olvidos" de OnCuba Por Miguel Fernández Martínez / Tomado del blog Cuba la isla infinita La visita que realizan por estos días a La Habana Eric Schmidt, Jared Cohen, Brett Perlmutter y Dan Keyserling, al- tos ejecutivos de Google Inc., ha le- vantado curiosidades y suspicacias en algunos medios digitales y jóvenes pe- riodistas. La presencia en Cuba de Schmidt, presidente ejecutivo de Google, una empresa transnacional estadouniden- se, especializada en productos y ser- vicios relacionados con Internet, soft- ware, dispositivos electrónicos y otras tecnologías, y su visita a la Universidad de Ciencias Informáticas (UCI) está generando especulaciones de todo tipo. Entre las preocupaciones destaca- das en el sitio digital OnCuba alrede- dor de la visita, están el supuesto si- lencio de la prensa cubana (como si la visita fuera todo un show o si los vi- da de experiencia académica/comer- El criminal bloqueo económico, sitantes fueran tan relevantes como cial/educativa de los empresarios; ni comercial y financiero de Estados para ocupar titulares), la solapada au- el intento de pasar por alto su pre- Unidos contra Cuba, establecido en torización de las autoridades cubanas sencia; ni el visto bueno de las autori- 1962, restringe la mayoría de las acti- para que pudieran visitar la UCI y si dades cubanas para que Schmidt y sus vidades comerciales, económicas o fi- detrás de la visita hay algo más que la acompañantes visitaran los sitios es- nancieras entre los dos países, e im- publicitada intención de "promover cogidos".
    [Show full text]
  • Google Labs Code Search James Bidwell, Amgen Ltd, Uxbridge, UK
    PhUSE 2010 CC08 Let me ‘Google’ that for you - Google Labs Code Search James Bidwell, Amgen Ltd, Uxbridge, UK ABSTRACT Google Labs Code Search is a free beta product from Google which debuted in Google Labs in 2006, allowing web users to search for open-source code on the Internet. Despite opinions to the contrary, this product can be utilised very effectively for finding SAS code snippets and syntax examples. Depending on how you personally learn, remember or improve your SAS knowledge, Google Labs Code Search should at least be tried once, and may turn out to be your number one SAS code resource. This paper will present the advantages, tips, tricks and annoyances of using the search engine on a daily basis for SAS code development. INTRODUCTION Google Labs is a website demonstrating and testing new Google projects. Widely used products which have graduated from the labs in the past include Google Maps, Google Suggest and Google Desktop. Google Labs Code Search is a free beta product from Google, allowing web users to search for open-source code on the Internet. This product can be used very effectively for finding SAS code snippets and syntax examples. Depending on how you personally learn, remember or improve your SAS knowledge, Google Labs Code Search should at least be tried once, and may turn out to be your number one SAS resource. The power of the search technology can identify certain syntax (e.g. % & = ) that would otherwise be ignored when using other online resources such as the SAS OnlineDoc Manual and the standard Google Search.
    [Show full text]