DOCSLIB.ORG

Curriculum Vitae

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

1 CURRICULUM VITAE Name: StevenSkiena Date of birth: January 30, 1961 Office: Dept. of Computer Science Home: 6Storyland Lane StonyBrook University Setauket, NY 11733 StonyBrook, NY 11794 Tel.: (631) 689-5477 Tel.: (631)-632-8470/9026 email: [email protected] URL: http://www.cs.stonybrook.edu/˜skiena Education University of Illinois at Urbana-Champaign, Fall 1983 to Spring 1988. M.S. in Computer Science May 1985, Ph.D in Computer Science May 1988. Cumulative GPA 4.87/5.00. University of Virginia, Charlottesville VA, Fall 1979 to Spring 1983. B.S. in Computer Science with High Distinction, May 1983. Final GPA3.64/4.0, with 4.0+ GPAinComputer Science. Rodman Scholar,Intermediate Honors, Tau Beta Pi. Employment Founding Director,Institute for AI-DrivenDiscovery and Innovation (IAIDDI), August 2018 to date. College of Engineering and Applied Science, StonyBrook University. StonyBrook University,Empire Innovation Professor,fall 2018 to date. Distinguished Teaching Pro- fessor of Computer Science, spring 2009 to date. Professor of Computer Science, fall 2001 to spring 2009. Associate Professor of Computer Science, fall 1994 to spring 2001. Assistant Professor of Computer Science, fall 1988 to spring 1994. Also, Adjunct Professor of Applied Mathematics, spring 1991 to date. Affiliated faculty,Dept. of Biomedical Engineering, Institute for Advanced Computa- tional Science (IACS), and Graduate Program in Genetics. Yahoo Labs/Research, Visiting Scientist, NewYork, NY.summer 2015 to summer 2016. Chief Scientist, General Sentiment Inc. (www.generalsentiment.com) Woodbury NY spring 2009 to spring 2015. Hong Kong University of Science and Technology (HKUST), Visiting Professor,Dept. of Computer Science and Engineering, fall 2008 to summer 2009. Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science, University of Haifa, Israel, fall 2001 to spring 2002. DIMACS, Rutgers University,visitor,fall 1994 to spring 1995. Apple Computer,Advanced Technology Group, Cupertino CA, summer 1988. University of Illinois, Urbana IL, teaching assistant, fall 1983 to spring 1987. fellowship, summer 1987. research assistant, fall 1987 to spring 1988. MIT Lincoln Laboratories, Lexington MA, summers 1984 and 1986. Weizmann Institute of Science, RehovotIsrael, visitor,summer 1985. Western Electric Engineering Research Center,Princeton NJ, summer 1983. Bell Telephone Laboratories, Holmdel NJ, summer 1982. MiddlesexCounty College, Edison NJ, instructor,summer 1981. 2 Princeton Gamma-Tech, Princeton NJ, programmer,summer 1980, winters 1980 and 1981. Awards Distinguished Alumni Award, School of Engineering and Applied Science, University of Virginia, 2019. Fellow, American Association for the Advancement of Science, 2019. Communication, Information Technologies, and Media Sociology (CITAMS) Paper Award, 2017. Clifford James Geertz Prize for Best Article, American Sociological Association, 2014. Fulbright Scholar,2001-2002. IEEE Computer Science and Engineering Undergraduate Teaching Award, 2001. President’sand Chancellor’sAward for Excellence in Teaching, SUNY StonyBrook, 2000. ONR Young Investigator Award, 1993. EDUCOM Higher Education Software Award for Distinguished Mathematics Software, 1991. NSF Research Initiation Award, 1991. Fourth Prize, First International Design the Future Competition, Tokyo Japan, 1989. First Place, Apple Personal Computer of the Year 2000 Competition, 1988. University of Illinois Summer Fellowship in Computer Science, 1987. Honeywell Futurist Award, 1985. Winner,ACM ’85 Computer Chess Turing Test. The Daily Illini “Incomplete List of Teachers Ranked as Excellent by Their Students,”spring 1984 and 1985. First place, 21st Southeast ACM Student Papers Competition, 1983. U.VaSigma Xi Anniversary award for undergraduate research in Engineering Science, 1983. Research Interests Data science, algorithm design and applications, computational biology,natural language processing and social media analysis. Publications in Journals (1) Diet Modulates Brain Network Stability,aBiomarker for Brain Aging, in Young Adults (with. L. Mujica-Parodi, A. Amgalan, F.Sultan, B. Antal, X. Sun, A. Lithen, N. Adra, E. Ratai, C. Weistuch, S. Govindarajan, H. Strey, K.Dill, S. Stufflebeam, R. Veech, and K. Clarke) Proc. National Academy of Sciences (PNAS). March 3, 2020. www.pnas.org/cgi/doi/10.1073/pnas.1913042117 (2) Maximizing the Expected Value of a Lottery Ticket: HowtoSell and When to Buy (with A. Kim). Toappear in Chance. (3) Stereotypical Gender Associations in Language have Decreased Over Time (with J. Jones, R. Amin, and J. Kim) Sociological Science.January 7, 2020. 10.15195/v7.a1 Also Eastern So- ciological Society (ESS) Annual Meeting.Boston, MA, March 14-17, 2019 and 6th Interna- tional Conference on Computational Social Science (IC2S2 2020). (4) Prokaryotic Coding Regions have Little if anySpecific Depletion of Shine-Dalgarno Motifs (with Y.Yurovsky, M.Amin, J. Gardin, Y.Chen and B. Futcher). PLOS One,August 23, 3 2018. https://doi.org/10.1371/journal.pone.0202768 (5) Re-annotation of 12,495 16S rRNA3’ends and analysis of Shine-Dalgarno and anti-Shine- Dalgarno sequences (with M. Amin, Y.Yurovsky, Y.Chen and B. Futcher). PLOS One,Au- gust 23, 2018. https://doi.org/10.1371/journal.pone.0202767 (6) Latent Human Traits in the Language of Social Media: An Open-Vocabulary Approach (with V. Kulkarni, M. Kern, M. Kosinski, S. Matz, L. Unger and H. A. Schwartz). PLOS One, November 28 2018. https://doi.org/10.1371/journal.pone.0201703. (7) DeepBrowse: Serendipitous Browsing through Large Lists (with H. Chen and A. Anan- tharam). Information Systems (to appear). Invited paper from Tenth Int. Conf Similarity Search and Applications (SISAP 2017), Munich, Germany, October 4-6, 2017. (8) Who’sBigger? Where Computer Scientists Really Rank (with C. Ward). BSHM Bulletin: Journal of the British Society for the History of Mathematics 32 (2017) 257-264. (invited pa- per) Special issue, St. Andrews Mathematical Biographyconference. (9) A Codon-Shuffling-based method to Prevent Reversion During Production of Replication-De- fective Herpesvirus Stocks (with G. Li, C. Ward, R. Yeasmin, L. Krug, and J. C. Forrest). Na- tureScientific Reports 7, 44404 doi: 10.1038/sep44404 (2017). (10) Vector-Based Similarity Measurements for Historical Figures (with Y.Chen and B. Perozzi) Information Systems 2016) doi:10.1016/j.is.2016.07.001. Invited paper from Eighth Int. Conf Similarity Search and Applications (SISAP 2015), Springer-Verlag LNCS 9371, 179-190. Glasgow, Scotland. October 12-14, 2015. (11) The Books of Numbers: Quantifying Historical Trends in Numeracy(with Y.Chen). The Mathematical Intelligencer.38(2016) 67-73. (12) A Paper Ceiling: Explaining the Persistent Underrepresentation of Female Names in Printed News. (with E. Shor,A.van de Rijt, A. Miltsov, and V.Kulkarni), American Sociological Re- view 80 (2015) 960-984. DOI: 10.1177/0003122415596999 (13) Measurement of Average Decoding Rates of the 61 Sense Codons in Viv o.(with J. Gardin, R. Yeasmin, A. Yurovsky, Y.Cai, and B. Futcher). eLife 2014;10.7554/eLife.03735. Published October 27, 2014. DOI: http://dx.doi.org/10.7554/eLife.03735 (14) Is there a Political Bias? Female Subjects’sCoverage in Liberal and Conservative Newspa- pers. (with E. Shor,A.van de Rijt, C. Ward, and S. Askar). Social Science Quarterly 95 (2014) 1213-1228. DOI: 10.1111/ssqu.12091. (15) Deliberate reduction of glycoproteins HA and NAexpression of influenza virus leads to an ul- tra-protective liv e vaccine candidate in mice. (with C. Yang, B. Futcher,S.Mueller,and E. Wimmer). roc. National Academy of Sciences. (2013) 9481-9486. (16) Only Fifteen Minutes? The Social Stratification of Fame in Printed Media (with A. van de Ri- jt, C. Ward, and E. Shor). American Sociological Review 78 (2013) 266-289. Also, presented at the 106th Annual Meeting of the American Sociological Association. Las Veg as, August 20-23, 2011. (17) Time Trends in Printed News Coverage of Women, 1880-2008 (with E. Shor,A.van de Rijt, C. Ward, and A. Blank-Gomel) Journalism Studies,2013. Also, presented at the 106th Annu- al Meeting of the American Sociological Association. Las Veg as, August 20-23, 2011 and the 107th Annual Meeting of the American Sociological Association, Denver, CL, August 17-21, 2012. (18) Synthetic Sequence Design for Signal Location Search (with Y.-L. Lin and C. Ward) Algorith- mica 67(3): 368-383 (2013). Also, Proc. 16th International Conf.onComputational Molecu- lar Biology (RECOMB 2012).Barcelona Spain, April 21-24, 2012. (19) Identification of twofunctionally redundant RNAelements in the coding sequence of the po- liovirus RNApolymerase using computer generated designs and synthetic DNAsynthesis 4 (with Y.Song, Y.Liu, C. Ward, S. Mueller,B.Futcher,A.Paul, and E. Wimmer). Proc. Na- tional Academy of Sciences (PNAS) 109 (2012) 14301-14307. (20) Phase Balancing Algorithms (with K. Wang and T.Robertazzi) Electric Power Systems Re- search.96(2013) 218-224. (21) Redesigning Viral Genomes IEEE Computer (invited paper) special issue on Computational- ly-DrivenExperimental Biology.45(March 2012) 47-53. (22) Computationally-recoded AAVRep 78 is Efficiently Maintained within an Adenovirus Vector (with V.Sitaraman, P.Hearing, C. Ward, D. Gnatenko, E. Wimmer,S.Mueller,and W.Bahou) Proc. National Academy of Sciences (PNAS), 108 (2011) 14294-14299. (23) Live Attenuated Influenza Vaccines by Computer-Aided Rational Design (with S. Mueller,R. Coleman, D. Papamichail, C. Ward, A. Nimnual, B. Futcher,and
Recommended publications
  • Curriculum Vitae 01/13/2014

    Curriculum Vitae 01/13/2014

    Curriculum Vitae 01/13/2014 Dimitris Papamichail Assistant Professor Department of Computer Science The College of New Jersey P.O. Box 7718 Ewing, NJ 08628-0718, USA Phone (office): (609) 771-2268 E-mail: [email protected] Webpage: www.tcnj.edu/~papamicd RESEARCH INTERESTS Applied algorithms, data structures, computational biology. EDUCATION Ph.D. Computer Science, SUNY at Stony Brook, USA, 8/02-8/07 M.S. Computer Science, University of Arizona, USA, 8/96-5/98 B.E. Computer Engineering and Informatics, University of Patras, Greece, 9/91-6/96 WORK EXPERIENCE • Assistant Professor, Department of Computer Science, The College of New Jersey, 8/13 – present. • Assistant Professor, Department of Computer Science, University of Miami, 8/07 – 8/13 • Research Assistant, Brookhaven National Laboratory, Upton, USA, 10/04 - 8/07 • Research Assistant, Computer Science department, SUNY at Stony Brook, Stony Brook, USA, 9/03 - 8/07 • Teaching Assistant, Computer Science department, SUNY at Stony Brook, Stony Brook, USA, 8/02 - 7/03 • Computer Programmer, Division of Research and Informatics, Greek Army, Greece, 9/00 - 3/02 • Site Engineer, Modular Mining Systems Inc., Tucson, Arizona, USA, 8/98 - 4/00 • Teaching assistant, Computer Science department, University of Arizona, Arizona, USA, 8/97 - 5/98 • Programmer, Lunar and Planetary Laboratory, University of Arizona, Tucson, Arizona, USA, 1/97 - 6/97 • Programmer, National Electric Company of Greece, Athens, Greece, 6/94 - 8/94 • Systems Operator, Computer Institute of Technology, Patras, Greece, 6/92 - 9/93 AWARDS/DISTINCTIONS • University of Miami Faculty Learning Community (FLC) Fellow, 2010. • Best paper award, Graduate Research Conference 2004, Computer Science Department, Stony Brook University.
  • On Some Fine-Grained Questions in Algorithms and Complexity

    On Some Fine-Grained Questions in Algorithms and Complexity

    On some fine-grained questions in algorithms and complexity Virginia Vassilevska Williams Massachusetts Institute of Technology, EECS and CSAIL Abstract In recent years, a new “fine-grained” theory of computational hardness has been developed, based on “fine-grained reductions” that focus on exact running times for problems. Mimicking NP-hardness, the approach is to (1) select a key problem X that for some function t, is conjectured to not be solvable by any O(t(n)1−") time algorithm for " > 0, and (2) reduce X in a fine-grained way to many impor- tant problems, thus giving tight conditional time lower bounds for them. This approach has led to the discovery of many meaningful relationships between problems, and to equivalence classes. The main key problems used to base hardness on have been: the 3-SUM problem, the CNF-SAT problem (based on the Strong Exponential Time Hypothesis (SETH)) and the All Pairs Shortest Paths Problem. Research on SETH-based lower bounds has flourished in particular in recent years showing that the classical algorithms are optimal for problems such as Approximate Diameter, Edit Distance, Frechet Distance and Longest Common Subsequence. This paper surveys the current progress in this area, and highlights some exciting new developments. 1 Introduction Arguably the main goal of the theory of algorithms is to study the worst case time complexity of fundamental computational problems. When considering a problem P , we fix a computational model, such as a Random Access Machine (RAM) or a Turing machine (TM). Then we strive to develop an efficient algorithm that solves P and to prove that for a (hopefully slow growing) function t(n), the algorithm solves P on instances of size n in O(t(n)) time in that computational model.

  • Curriculum Vitae

    Curriculum Vitae Dimitris Papamichail Assistant Professor Department of Computer Science 6000 SW 76th St University of Miami South Miami, FL 33143, USA P.O. Box 248154 Phone (cell): (631) 428-4962 Coral Gables, FL 33124-4245, USA Phone (home): (305) 667-7042 Phone (office): (305) 284-4189 e-mail: [email protected] webpage: www.cs.miami.edu/~dimitris Research Interests Bioinformatics, algorithms and data structures, optimization, decision support systems. Education Ph.D. Computer Science, SUNY at Stony Brook, USA, 8/02-8/07 M.S. Computer Science, University of Arizona, USA, 8/96-5/98 B.E. Computer Engineering and Informatics, University of Patras, Greece, 9/91-6/96 Work Experience Assistant Professor, Department of Computer Science, University of Miami, 08/07-date Research Assistant, Brookhaven National Laboratory, Upton, USA, 10/04-8/07 Research Assistant, Computer Science department, SUNY at Stony Brook, Stony Brook, USA, 9/03-8/07 Teaching Assistant, Computer Science department, SUNY at Stony Brook, Stony Brook, USA, 8/02-7/03 Computer Programmer, Division of Research and Informatics, Greek Army, Greece, 9/00-3/02 Site Engineer, Modular Mining Systems Inc., Tucson, Arizona, USA, 8/98-4/00 Teaching assistant, Computer Science department, University of Arizona, Arizona, USA, 8/97-5/98 Programmer, Lunar and Planetary Laboratory, University of Arizona, Tucson, Arizona, USA, 1/97- 6/97 Programmer, National Electric Company of Greece, Athens, Greece, 6/94-8/94 Systems Operator, Computer Institute of Technology, Patras, Greece, 6/92-9/93 Awards/Distinctions Best paper award, Graduate Research Conference 2004, Computer Science Dept. SUNY at Stony Brook.
  • Who's Bigger? a Quantitative Analysis of Historical Fame

    Who's Bigger? a Quantitative Analysis of Historical Fame

    Who's Bigger? A Quantitative Analysis of Historical Fame Who's Bigger? A Quantitative Analysis of Historical Fame Steven Skiena1 Charles Ward1 1 Department of Computer Science Stony Brook University Stony Brook, NY 11794-4400 September 5, 2012 Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Outline 1 Warmup 2 Methodology 3 Applications Trends Analysis Evaluating Human Selection Processes Gender Imbalance in Wikipedia 4 Conclusions Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Who's Bigger: Historical Rankings Numerical ratings/rankings provide a way to focus greater attention on the best/most important things. Rankings are highly subjective and culturally biased, yet rankings provide a popular mix of education and entertainment. We seek algorithms to construct informative and meaningful historical rankings of all the people described in Wikipedia. George Washington (1732{1799) [6] Abraham Lincoln (1809{1865) [5]* Chester A. Arthur (1829{1886) [490] Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Who's Bigger? (Presidents) Battle: George Washington vs. Abraham Lincoln Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Who's Bigger? (Presidents) Battle: George Washington vs. Abraham Lincoln George Washington (1732{1799) [6] Abraham Lincoln (1809{1865) [5]* Chester A. Arthur (1829{1886) [490] Jesus (7 B.C.{30 A.D.) [1]* John Lennon (1940{1980) [141] Paul McCartney (1942{ ) [399] George Harrison (1943{2001) [615] Ringo Starr (1940{ ) [1729] Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Are the Beatles \Bigger than Jesus"? Battle: Jesus vs. John Lennon Who's Bigger? A Quantitative Analysis of Historical Fame Warmup Are the Beatles \Bigger than Jesus"? Battle: Jesus vs.
  • Programming Challenges (PDF)

    Programming Challenges (PDF)

    TEXTS IN COMPUTER SCIENCE Editors David Gries Fred B. Schneider Springer New York Berlin Heidelberg Hong Kong London Milan Paris Tokyo This page intentionally left blank Steven S. Skiena Miguel A. Revilla PROGRAMMING CHALLENGES The Programming Contest Training Manual With 65 Illustrations Steven S. Skiena Miguel A. Revilla Department of Computer Science Department of Applied Mathematics SUNY Stony Brook and Computer Science Stony Brook, NY 11794-4400, USA Faculty of Sciences [email protected] University of Valladolid Valladolid, 47011, SPAIN [email protected] Series Editors: David Gries Fred B. Schneider Department of Computer Science Department of Computer Science 415 Boyd Graduate Studies Upson Hall Research Center Cornell University The University of Georgia Ithaca, NY 14853-7501, USA Athens, GA 30602-7404, USA Cover illustration: “Spectator,” by William Rose © 2002. Library of Congress Cataloging-in-Publication Data Skeina, Steven S. Programming challenges : the programming contest training manual / Steven S. Skiena, Miguel A. Revilla. p. cm. — (Texts in computer science) Includes bibliographical references and index. ISBN 0-387-00163-8 (softcover : alk. paper) 1. Computer programming. I. Revilla, Miguel A. II. Title. III. Series. QA76.6.S598 2003 005.1—dc21 2002044523 ISBN 0-387-00163-8 Printed on acid-free paper. © 2003 Springer-Verlag New York, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden.
  • Lecture 1: Introduction to Finance Steven Skiena Department Of

    Lecture 1: Introduction to Finance Steven Skiena Department Of

    Lecture 1: Introduction to Finance Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794–4400 http://www.cs.sunysb.edu/∼skiena Why Computational Finance? It is hard to overstate the importance of the financial industry to the state, national, and world economies. The financial industry relies on a wide variety of advanced computing technologies and mathematical modeling tech- niques. The availability, volume and significance of financial data lends itself to many interesting research problems. There are interesting and relevant theories of how markets work which lend themselves to formal analysis. Why Are You Interested in this Course? • Have a general interest in finance? • Avoiding a more undesirable course? • Want a job in the financial industry? • Want to apply your research expertise to financial data? • Other? Who am I? I am a visiting professor from Stony Brook University. My primary research is in combinatorial algorithms and their applications, particularly to biology and news/blog analysis. Why am I teaching this? I have a side interest in gambling systems, which has made me somewhat known in the hedge fund community. I’ve been an invited speaker at Barra’s Research Conference and O’Reilly Money:Tech, and at certain hedge funds. I’ve previously taught a seminar in computational finance at Stony Brook. Why this Course? Much of this material (e.g. financial engineering and time-series data analysis) is traditionally taught in business schools, and practiced by quantitative researchers from economics, finance, and the mathematical sciences. Computer science researchers have not been as engaged with conceptual problems in finance so much as technological problems like encryption and transaction processing.
  • Kent D. Lee Steve Hubbard Data Structures and Algorithms with Python Undergraduate Topics in Computer Science

    Kent D. Lee Steve Hubbard Data Structures and Algorithms with Python Undergraduate Topics in Computer Science

    Undergraduate Topics in Computer Science Kent D. Lee Steve Hubbard Data Structures and Algorithms with Python Undergraduate Topics in Computer Science This copy belongs to 'acha04' Undergraduate Topics in Computer Science (UTiCS) delivers high-quality instructional content for undergraduates studying in all areas of computing and information science. From core foundational and theoretical material to final-year topics and applications, UTiCS books take a fresh, concise, and modern approach and are ideal for self-study or for a one- or two-semester course. The texts are all authored by established experts in their fields, reviewed by an international advisory board, and contain numerous examples and problems. Many include fully worked solutions. More information about this series at http://www.springer.com/series/7592 This copy belongs to 'acha04' Kent D. Lee • Steve Hubbard Data Structures and Algorithms with Python 123 This copy belongs to 'acha04' Kent D. Lee Steve Hubbard Luther College Decorah, IA USA Series editor Ian Mackie Advisory Board Samson Abramsky, University of Oxford, Oxford, UK Karin Breitman, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil Chris Hankin, Imperial College London, London, UK Dexter Kozen, Cornell University, Ithaca, USA Andrew Pitts, University of Cambridge, Cambridge, UK Hanne Riis Nielson, Technical University of Denmark, Kongens Lyngby, Denmark Steven Skiena, Stony Brook University, Stony Brook, USA Iain Stewart, University of Durham, Durham, UK ISSN 1863-7310 ISSN 2197-1781 (electronic) ISBN 978-3-319-13071-2 ISBN 978-3-319-13072-9 (eBook) DOI 10.1007/978-3-319-13072-9 Library of Congress Control Number: 2014953918 Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2015 This work is subject to copyright.
  • Select Research Projects

    Select Research Projects

    Select Research Projects CEWIT | Center of Excellence in Wireless and Information Technology Table of Contents Security Securing Mobile Apps and Platforms .........................................................................................6 National Security Institute .........................................................................................................6 Cloud Computing Security .........................................................................................................6 Security Policy Mining ...............................................................................................................7 Security Policy Analysis .............................................................................................................7 Fast, Architecture-neutral Static Binary Instrumentation for Security Applications.......................7 Security and Privacy in Geo-Social Networks .............................................................................8 NFS4Sec: An Extensible Security Layer for Network Storage ......................................................8 Leadership Security and Privacy in Geo-Social Networks .............................................................................8 NFS4Sec: An Extensible Security Layer for Network Storage ......................................................8 Yacov Shamash, PhD UID: A Strongly-Secure Usable Identity Ecosystem with Privacy .................................................9 Vice President of Economic Cloudtracker: Transparent,
  • BIOGRAPHICAL SKETCH Steven Skiena Distinguished Teaching

    BIOGRAPHICAL SKETCH Steven Skiena Distinguished Teaching

    Program Director/Principal Investigator (Last, First, Middle): BIOGRAPHICAL SKETCH Provide the following information for the Senior/key personnel and other significant contributors in the order listed on Form Page 2. Follow this format for each person. DO NOT EXCEED FOUR PAGES. NAME POSITION TITLE Steven Skiena Distinguished Teaching Professor eRA COMMONS USER NAME (credential, e.g., agency login) Dept. of Computer Science Stony Brook University EDUCATION/TRAINING (Begin with baccalaureate or other initial professional education, such as nursing, include postdoctoral training and residency training if applicable.) DEGREE INSTITUTION AND LOCATION MM/YY FIELD OF STUDY (if applicable) University of Virginia, Charlottesville, VA B.S. 05/83 Computer Science University of Illinois at Urbana-Champaign Ph.D 05/88 Computer Science A. Personal Statement I have worked in computational biology / bioinformatics for almost twenty years, since the very start of the genomics revolution. My interests over the years have ranged from genome assembly algorithms, microrarray design and analysis, and meta-genomic sequence analysis. My primary interest lies in sequence design algorithms for synthetic biology. My students and I pioneered the study of algorithms coding for given protein sequencing while optimizing specific criteria such as RNA secondary structure, pattern placement / avoidance, and coding in alternate reading strands. This work forms the foundation of my current collaborations on sequence design for live attenuated vaccines, multiplex sequence design algorithms for large-scale synthesis technologies, and design/synthesis approaches to signal-detection in coding sequences. B. Positions and Honors Positions and Employment 2009-date Distinguished Teaching Professor of Computer Science, Stony Brook University 2008-2009 Visiting Professor of Computer Science, Hong Kong University of Science and Technology 2001-2009 Professor of Computer Science, Stony Brook University Affiliated faculty, Dept.
  • Representation Learning for Natural Language Processing Representation Learning for Natural Language Processing Zhiyuan Liu • Yankai Lin • Maosong Sun

    Representation Learning for Natural Language Processing Representation Learning for Natural Language Processing Zhiyuan Liu • Yankai Lin • Maosong Sun

    Zhiyuan Liu · Yankai Lin · Maosong Sun Representation Learning for Natural Language Processing Representation Learning for Natural Language Processing Zhiyuan Liu • Yankai Lin • Maosong Sun Representation Learning for Natural Language Processing 123 Zhiyuan Liu Yankai Lin Tsinghua University Pattern Recognition Center Beijing, China Tencent Wechat Beijing, China Maosong Sun Department of Computer Science and Technology Tsinghua University Beijing, China ISBN 978-981-15-5572-5 ISBN 978-981-15-5573-2 (eBook) https://doi.org/10.1007/978-981-15-5573-2 © The Editor(s) (if applicable) and The Author(s) 2020. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adap- tation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publi- cation does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.