1  20
Next
1. 1, 2, 3 [1995]
 Wegman, William.
 1st ed.  New York : Hyperion Books for Children, c1995.
 Description
 Book — 1 v. (unpaged) : col. ill. ; 21 cm.
 Summary

Photographs of dogs introduce the numbers one to ten.
 Online
 Fachtagung über Automatentheorie und Formale Sprachen (1st : 1973 : Bonn, Germany)
 Berlin ; New York : Springer, 1973.
 Description
 Book — 1 online resource (vii, 322 pages) : illustrations
 Summary

 On the structure of algorithmic problems
 A mathematical model of digital computers
 On some recent problems concerning developmental languages
 Faulttolerance and stability of fuzzystate automata
 Bemerkungen über Homomorphismen endlicher in lineare Automaten
 Der Kaskadenzerlegungssatz für Halbautomaten
 Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme
 Ketten und arithmetische Prädikate von endlichen Automaten
 Une hierarchie infinie de cones d'Accepteurs verificateurs
 Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten
 Ein automatentheoretisches Modell einer Speicherhierarchie
 Deterministic onecounter automata
 The use of metric and uniform spaces for the formalization of behavioral proximity of states
 Quelques generateurs des langages algebriques
 Une caracterisation des langages quasirationnels standards
 Der Einfluss von Kontext auf spezielle CFGrammatiken
 Zur Komplexität gesteuerter kontextfreier Ersetzungen
 Characterization of derivation sets of formal systems
 Die Darstellung indizierter Sprachen durch Ausdrücke
 Codes and aperiodic languages
 The characterization of certain classes of languages in the context sensitive area by automata
 A characterization of boolean closures of families of languages
 Zufällige Folgen und BiImmunität
 Die mittler Additionsdauer eines Paralleladdierwerks
 On the number of multiplications required by the product of two matrices
 Elementare und subelementare Funktionenklassen über binären Bäumen
 Über die Vernetzungsstruktur von Maschinen
 On the simulation of time bounded machines
 Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen
 Über eine Hierarchie von PushDownEntscheidbaren Mengen
 A characterization of the classes L1 and R1 of primitive recursive word functions
 A drum scheduling algorithm
 Some considerations about classes of mappings between contextfree derivation systems
 On ianov schemas with one memory location
 Reduction goals in bottomup recognition
 Un modele semantique pour un langage simple de programmation
 Erweiterungen subrekursiver Programmiersprachen.
 Fachtagung über Programmiersprachen (1st : 1971 : Munich, Germany)
 Berlin, New York, Springer, 1972.
 Description
 Book — vi,280 p. 26cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.7 .F3 1971  Available 
4. 1 the road [2018]
 Première édition  [Paris] : Jean Boite Éditions, [2018]
 Description
 Book — 143 pages : illustrations ; 24 cm
 Summary

This book is about how Ross Goodwin outfitted a Cadillac with a surveillance camera, a GPS unit, a microphone and a clock, all connected to a portable AIwritingmachine designed to input data in real time. He then travelled from New York to New Orleans using this technology to selfgenerate and print textual data (prose) in response to the journey
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.9 .N38 A14 2018  Available 
5. 10 [2010]
 Bataille, Marion.
 Paris : Albin Michel Jeunesse, c2010.
 Description
 Book — 1 v. (unpaged) : all ill. ; 14 cm.
 Online
Green Library
Green Library  Status 

Find it Locked stacks: Ask at circulation desk  
QA113 .B38 2010 T  Unknown 
6. 10 best practices for quality software development : creating software that works and keeps working [2016]
 Lubsen, Zeeger, onscreen presenter.
 [Place of publication not identified] : O'Reilly, [2016]
 Description
 Video — 1 online resource (1 streaming video file (2 hr., 43 min., 28 sec.)) : digital, sound, color
 Summary

"Why do best practices in software development matter? What are those practices in the first place? This video presents 10 key best practices for quality software development, explains why they are important to how you develop software, and shows how each practice relates to each other and the big picture of software development. You'll learn how to set software development goals and metrics, how to determine if your software is 'done', and more in this theory and practice course that uses running software examples to illustrate how these best practices are deployed in real life."Resource description page.
 Walter, Nick, onscreen presenter.
 [Place of publication not identified] : Packt Publishing, 2019.
 Description
 Video — 1 online resource (1 streaming video file (11 hr., 54 min., 53 sec.))
 Summary

"In 10 days' you can have your own app in the App Store! Learn how to make apps using Swift 4.2' Xcode 10' and iOS 12"Resource description page
8. 10 don'ts on your digital devices : the nontechie's survival guide to cyber security and privacy [2014]
 Bachrach, Daniel G., author.
 Berkeley, CA : Apress, [2014]
 Description
 Book — 1 online resource (xx, 180 pages) : illustrations Digital: text file.PDF.
 Summary

 Chapter 1. Don't Get Phished Chapter 2. Don't Give Up Your Password Chapter 3. Don't Get Lost in the Cloud Chapter 4. Don't Look for a Free Lunch Chapter 5. Don't Do Secure Things from Insecure Places Chapter 6. Don't Let the Snoops In Chapter 7. Don't Be Careless When Going Mobile Chapter 8. Don't Use Dinosaurs
 Chapter 9. Don't Trust Anyone Over...Anything Chapter 10. Don't Forget the Physical.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
9. 10 don'ts on your digital devices : the nontechie's survival guide to cyber security and privacy [2014]
 Bachrach, Daniel G., author.
 Berkeley, CA : Apress, [2014]
 Description
 Book — 1 online resource (xx, 180 pages) : illustrations Digital: text file.PDF.
 Summary

 Chapter 1. Don't Get Phished Chapter 2. Don't Give Up Your Password Chapter 3. Don't Get Lost in the Cloud Chapter 4. Don't Look for a Free Lunch Chapter 5. Don't Do Secure Things from Insecure Places Chapter 6. Don't Let the Snoops In Chapter 7. Don't Be Careless When Going Mobile Chapter 8. Don't Use Dinosaurs
 Chapter 9. Don't Trust Anyone Over...Anything Chapter 10. Don't Forget the Physical.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Document version 1.0.  Mountain View, Calif. : Silicon Graphics, c1991.
 Description
 Book — 1 v. (various pagings)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.73 .I75 .A111 1991  Available 
 Oak, Rajvardhan.
 1st edition.  Birmingham : Packt Publishing, Limited, 2023.
 Description
 Book — 1 online resource (330 p.)
 Summary

Work on 10 practical projects, each with a blueprint for a different machine learning technique, and apply them in the real world to fight against cybercrime Purchase of the print or Kindle book includes a free PDF eBook Key Features Learn how to frame a cyber security problem as a machine learning problem Examine your model for robustness against adversarial machine learning Build your portfolio, enhance your resume, and ace interviews to become a cybersecurity data scientist Book Description Machine learning in security is harder than other domains because of the changing nature and abilities of adversaries, high stakes, and a lack of groundtruth data. This book will prepare machine learning practitioners to effectively handle tasks in the challenging yet exciting cybersecurity space. The book begins by helping you understand how advanced ML algorithms work and shows you practical examples of how they can be applied to securityspecific problems with Python  by using open source datasets or instructing you to create your own. In one exercise, you'll also use GPT 3.5, the secret sauce behind ChatGPT, to generate an artificial dataset of fabricated news. Later, you'll find out how to apply the expert knowledge and humanintheloop decisionmaking that is necessary in the cybersecurity space. This book is designed to address the lack of proper resources available for individuals interested in transitioning into a data scientist role in cybersecurity. It concludes with case studies, interview questions, and blueprints for four projects that you can use to enhance your portfolio. By the end of this book, you'll be able to apply machine learning algorithms to detect malware, fake news, deep fakes, and more, along with implementing privacypreserving machine learning techniques such as differentially private ML. What you will learn Use GNNs to build featurerich graphs for bot detection and engineer graphpowered embeddings and features Discover how to apply ML techniques in the cybersecurity domain Apply stateoftheart algorithms such as transformers and GNNs to solve securityrelated issues Leverage ML to solve modern security issues such as deep fake detection, machinegenerated text identification, and stylometric analysis Apply privacypreserving ML techniques and use differential privacy to protect user data while training ML models Build your own portfolio with endtoend ML projects for cybersecurity Who this book is for This book is for machine learning practitioners interested in applying their skills to solve cybersecurity issues. Cybersecurity workers looking to leverage ML methods will also find this book useful. An understanding of the fundamental machine learning concepts and beginnerlevel knowledge of Python programming are needed to grasp the concepts in this book. Whether you're a beginner or an experienced professional, this book offers a unique and valuable learning experience that'll help you develop the skills needed to protect your network and data against the everevolving threat landscape.
12. 10 minute guide to Access 97 [1997]
 Wempen, Faithe.
 Indianapolis, Ind. : Que Corp., ©1997.
 Description
 Book — 1 online resource (x, 214 pages) : illustrations
 Summary

 1. What Is a Database?
 2. Planning your Database
 3. Starting and Exiting Access
 4. Getting Help
 5. Creating a New Database
 6. Saving, Closing, and Opening a Database
 7. Creating a Table with the Table Wizard
 8. Creating a Table Without a Wizard
 9. Modifying a Table
 10. Entering Data Into a Table
 11. Editing Data in a Table
 12. Formatting a Table
 13. Creating a Simple Form
 14. Modifying Your Form
 15. Creating Special Data Entry Fields on a Form
 16. Adding Graphics to Forms
 17. Searching for Data
 18. Sorting and Filtering Data
 19. Creating a Query
 20. Modifying a Query
 21. Creating a Simple Report
 22. Customizing a Report
 23. Creating a Chart
 24. Creating Mailing Labels
 25. Creating Relationships Between Tables
 26. Analyzing How Well Your Database Works
 27. Using Access on the Internet
 28. Keeping Your Data Safe
 29. Importing and Exporting Data.
(source: Nielsen Book Data)
 Providence, Rhode Island : American Mathematical Society, 1963.
 Description
 Book — 1 online resource (1 online resource (iii, 358 pages).)
 Summary

 Topological duality theorems. I. Closed sets / P. S. Aleksandrov
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/01 Topological duality theorems. II. Nonclosed sets / P. S. Aleksandrov
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/02 On continuous decompositions of bicompacta / V. I. Ponomarev
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/03 Algebraic methods in settheoretic topology / G. S. Čogošvili
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/04 Intrinsic homology theory / V. A. Rohlin
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/05 The semigroup of homeomorphic mappings of an interval / L. M. Gluskin
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/06 On closed mappings / A. D. Taĭmanov
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/07 Some generalizations of imbedding theorems / S. L. Sobolev
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/08 Embedding of locally compact Abelian topological groups in Euclidean spaces / M. Bognar
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/09 On the completeness of a partially ordered space / D. A. Vladimirov
 http://www.ams.org/trans2/030 https://doi.org/10.1090/trans2/030/10
14. 10 print chr$205.5+rnd(1) :goto 10 [2013]
 Cambridge, Mass. : MIT Press, ©2013.
 Description
 Book — 1 online resource
 Summary

 REM Variations in BASIC
 Mazes
 Rem Ports to other platforms
 Regularity
 REM Variations in processing
 Randomness
 REM Oneliners
 BASIC
 REM A port to the Atari VCS
 The Commodore 64
 REM Maze walker in BASIC
 Conclusion
 End.
(source: Nielsen Book Data)
15. 10 PRINT CHR$205.5+RND(1);:GOTO 10 [2013]
 Cambridge, Mass. : MIT Press, c2013.
 Description
 Book — xi, 309 p. : ill. ; 24 cm.
 Summary

 REM Variations in BASIC
 Mazes
 Rem Ports to other platforms
 Regularity
 REM Variations in processing
 Randomness
 REM Oneliners
 BASIC
 REM A port to the Atari VCS
 The Commodore 64
 REM Maze walker in BASIC
 Conclusion
 End.
(source: Nielsen Book Data)
16. 10 PRINT CHR$205.5+RND(1);:GOTO 10 [2013]
 Cambridge, Mass. : MIT Press, c2013.
 Description
 Book — xi, 309 p. : ill. ; 24 cm.
 Summary

 Introduction
 REM variations in BASIC
 Mazes
 REM ports to other platforms
 Regularity
 REM variations in processing
 Randomness
 REM Oneliners
 BASIC
 REM A port to the Atari VCS
 The Commodore 64
 REM Maze walker in BASIC
 Conclusion
 End.
(source: Nielsen Book Data)
 Online
Law Library (Crown)
Law Library (Crown)  Status 

Basement  Request (opens in new tab) 
QA76.73 .B3 A14 2013  Unknown 
 Negrino, Tom.
 Berkeley, CA : Peachpit Press, ©2013.
 Description
 Book — 1 online resource ([24] pages) : illustrations
18. 10 UX principles every developer must know [2019]
 Clark, Josh, onscreen presenter.
 [Place of publication not identified] : O'Reilly Media, [2019]
 Description
 Video — 1 online resource (1 streaming video file (40 min., 51 sec.)) Digital: video file.
 Summary

"Josh Clark and Mike Biglan (Twenty Ideas) give you some tools to use so that you, as a developer, can be a UX beast. They explore how to nurture curiosity as a means of understanding the user; how to leverage psychology, including decision science, in the process of developing workflows; how to communicate and argue well; and how to become a UX developer unicornwinning friends and influencing people (including your boss) to become a more valuable and critical member of any team. This session was recorded at the 2019 O'Reilly Open Source Software conference in Portland."Resource description page
19. 100 algorithms challenge [2022]
 [First edition].  [Place of publication not identified] : Manning Publications, [2022]
 Description
 Video — 1 online resource (1 video file (7 hr., 53 min.)) : sound, color. Sound: digital. Digital: video file.
 Summary

Technical interviews are the filter between good and great developers. At least that is how the industry sees them. In this course, we will improve your problem solving ability as well as your speed with 100 algorithm problems and solutions. These questions are some of the most commonly asked in interviewsincluding interviews with Google, Facebook, Uber, Amazon, and other top tech companies. By the end of the course you will: Have a handle on higher order functions in JavaScript Understand the basics of TypeScript Have a 100algorithm portfolio item Be ready to ace the JavaScript technical interview.
 Posamentier, Alfred S.
 Thousand Oaks, California : Corwin, [2013]
 Description
 Book — xiv, 217 pages : illustrations ; 26 cm
 Summary

 About the Authors Introduction Chapter One. General Questions
 1. Why do I have to learn mathematics?
 2. Is there a language connection between mathematical terms and common English words?
 3. How many leaves are on a tree?
 4. Why do we have to learn about the history of mathematics?
 5. Who introduced the HinduArabic numbers to the Western world, and when?
 6. What are the three famous problems of antiquity?
 7. What are the Fibonacci numbers?
 8. What is the golden ratio?
 9. Is there a smallest number, and is there a largest number?
 10. Why is infinity not a number?
 11. How large is infinity?
 12. Is there anything larger than infinity?
 13. Can the union of two sets ever be equal to the intersection of the two sets?
 14. How can we determine how many subsets a given set has?
 15. How can we avoid making an error in a "proof" that leads to a generalization?
 16. How does a calculator function?
 17. Which is correctmy calculating, the calculator, or the computer?
 18. What are conic sections?
 19. What is a mathematical group?
 20. What is a mathematical ring?
 21. What is a mathematical field?
 22. What are the three famous laws that Johannes Kepler discovered about planetary motion involving the ellipse? Notes Chapter Two. Arithmetic Questions
 23. What is the difference between a number and a digit?
 24. What are the differences between cardinal, ordinal, and nominal numbers?
 25. What are the natural numbers, and does the number zero belong to the natural numbers?
 26. How can we remember the order of operations using PEMDAS?
 27. What is a fraction?
 28. What is a rational number?
 29. How can one convert a decimal number to a fraction?
 30. What is so special about the Pascal triangle?
 31. How can the product of two numbers be smaller than both of its factors?
 32. If the temperature rises from 80 degrees F to a temperature of 88 degrees F, why is it wrong to say it became 10% warmer?
 33. How do the values of the following differ? (order of operations)
 34. Why is division by zero not permissible?
 35. Why is x multiplied by 0 = 0?
 36. What is 0!?
 37. What is the largest number that can be represented in the decimal system with three digits (and without using any other symbols)?
 38. What is a prime number?
 39. Does the number 1 belong to the prime numbers?
 40. How many prime numbers are there?
 41. What is a palindrome?
 42. What are successive percentages? Notes Chapter Three. Algebra Questions
 43. Why is the product of two negative numbers positive?
 44. Why must a and b be positive in order for the following to hold true?
 45. Why is it advantageous to rationalize the denominator?
 46. What is meant by the "absolute value" of a variable?
 47. What is a variable? A term? An expression? An equation?
 48. How can we have students realize that the average of rates is not simply the arithmetic mean?
 49. Why does 0.99999 ... = 1?
 50. Is a road with a slope of 20% twice as steep as a road with a 10% slope?
 51. Is there a number that differs from its reciprocal by 1?
 52. What is a determinant, and how can it be used to solve a system of linear equations?
 53. How do the arithmetic, geometric, and harmonic means compare in magnitude?
 54. What is a function?
 55. What is meant by the inverse of a function?
 56. Can a function be equal to its inverse?
 57. What is a 11 onto function?
 58. Where does the quadratic formula come from?
 59. What is a parabola?
 60. How can you find the turning point of a parabola?
 61. What is an ellipse?
 62. What is a hyperbola?
 63. When does one use the Law of Sines?
 64. When does one use the Law of Cosines?
 65. What is the difference between y = arccos x and y = cos1 x?
 66. What is a vector?
 67. Why can a vector not be divided by a vector?
 68. What is i?
 69. What is e? Notes Chapter Four. Geometry Questions
 70. Why is the diagonal of a square longer than its side?
 71. How can you demonstrate that the circumference of a circle is 2 pi r?
 72. How can you demonstrate that the area of a circle is equal to pi r squared?
 73. Can a triangle contain two right angles?
 74. Why must the sum of any two sides of a triangle be greater than the third side?
 75. How do the terms "acute angle" and "obtuse angle" relate to the English language?
 76. Can trigonometry be used to prove the Pythagorean theorem?
 77. How is the distance formula derived?
 78. How can the Pythagorean theorem be used to determine if an angle of a triangle is acute or obtuse?
 79. What is a Platonic solid?
 80. What is a golden rectangle?
 81. What is a golden triangle?
 82. From which point in a triangle is the sum of the distances to the three vertices smallest?
 83. What is the sum of the distances from a point in a triangle to its three sides?
 84. What is President James A. Garfield's proof of the Pythagorean theorem?
 85. What is the ninepoint circle?
 86. How can the Pythagorean theorem be proved by paper folding?
 87. How can we prove that the sum of the measures of the angles of any triangle is 180 degrees using paper folding?
 88. What figure is created by joining the midpoints of any quadrilateral?
 89. How can the concurrency of the medians of a triangle be proved in one step? Notes Chapter Five. Probability Questions
 90. What is the fundamental principle of counting?
 91. What does it mean when the probability of an event is 1? Is 0?
 92. What are mutually exclusive events?
 93. What is the probability of either or both of two events happening?
 94. What is the difference between combinations and permutations?
 95. What is the difference between correlation and causation?
 96. What is the Pascal triangle?
 97. What is binomial probability?
 98. What is the birthday problem?
 99. How can algebra help us to understand a probability question?
 100. What kind of averages are batting averages? Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
Education Library (Cubberley)
Education Library (Cubberley)  Status 

Stacks  Request (opens in new tab) 
QA139 .P65 2013  Unknown 