עוד בפרק זה:
ינואר 2021
הספרייה מציעה לקוראיה מידי חודש רשימת ספרים וכתבי-עת חדשים שנוספו לאוספיה כל רשומה מכילה:
מס' מיון, מחבר, כותר, מוציא לאור, שנת הוצאה , נושאים, מס' מערכת תוכן עיניינים ותקציר.
כדי לראות מצב ההשאלות יש ללחוץ על כותר.
 |
Dewey Number 005.1 VAZ Vazirani, Vijay V. Approximation algorithms / Corrected second printing Berlin : Springer, [2003] Contents Combinatorial algorithms -- Set cover -- Steiner tree and TSP -- Multiway cut and k-cut -- k-center -- Feedback vertex set -- Shortest superstring -- Knapsack -- Bin packing -- Minimum makespan scheduling -- Euclidean TSP -- LP-based algorithms -- Introduction to LP-Duality -- Set cover via dual fitting -- Rounding applied to set cover -- Set cover via the primal-dual schema -- Maximum satisfiability -- Scheduling on unrelated parallel machines -- Multicut and integer multicommodity flow in trees -- Multiway cut -- Multicut in general graphs -- Sparsest cut -- Steiner forest -- Steiner network -- Facility location -- k-median -- Semidefinite programming -- Other topics -- Shortest vector -- Counting problems -- Hardness of approximation -- Open problems -- An overview of complexity theory for the algorithm designer -- Basic facts from probability theory Abstract The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs, by writing algorithms in plain English, and by providing numerous critical examples and illustrations." "This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms Subject Computer algorithms Mathematical optimization 44026
|
 |
Dewey Number 155.937 ליב ליבליך, עמיה קפה מוות Abstract "מי מפחד מ"קפה מוות"? מדי כמה שבועות לאחר השקיעה נפגשים ארבעה־עשר איש ואישה כדי לשתות קפה ולדבר על מוות.זאת לא התחלה של רומן בדיוני אפל כי אם תיאור של מפגשים אמיתיים בהחלט שהתקיימו בביתה של הפרופסור עמיה ליבליך כדי לשוחח בצוותא על הטאבו הגדול האחרון של החברה המערבית: המוות הבלתי נמנע של כל אחד ואחת מאיתנו. מפגשי־שיח קבוצתיים תחת הכותרת "קפה מוות" מלבלבים ברחבי העולם זה כעשור. לאחר שהתוודעה לרעיון אימצה אותו עמיה ליבליך מיד: כן לדבר על המוות, כן להתריס כנגד חשאיותו, אולי אפילו להגיע ליחסים נינוחים איתו. היא פירסמה הזמנה לקבוצת "קפה מוות" בביתה, הוצפה בעשרות פניות – אנשים משלל גילים, מקצועות, תחומי עניין ונסיבות חיים – ועד מהרה יצאו המפגשים לדרך. קפה מוות מתעד סדרת מפגשים כאלה, שמרביתה נערכה במהלך שנת 2016: קבוצה של נשים וגברים שיצאו למסע נפשי משותף, עמוק וסוער, שהתרחש בתוך חדר אחד; מסע של שנה שהוקלט ותומלל, ושבמהלכו שיתפו המשתתפים זה את זה – ובעיקר את עצמם – במחשבותיהם על המוות ועל משמעויותיו. איננו מכירים את המוות, איש לא חזר ממנו כדי לספר עליו; החברה המערבית הרחיקה אותו אל בתי החולים ואל המוסדות הסיעודיים, והקסם האופף אותו דומה בעוצמתו לפחד שהוא שהוא מעורר. השיחות המעמיקות והכנות, המצחיקות והעצובות המכונסות בספר זה מזכירות לנו כי המוּדעוּת למוות יכולה גם לחדד את החיים, להעצים את יופיים ואת ערכם, ובעצם ללמד אותנו כיצד לחיות Subject Death -- Psychological aspects Death -- Social aspects Mortality -- Psychological aspects Mortality -- Social aspects Small groups Life and death, Power over. 44227
|
 |
Dewey Number 158.12 אלר אלרדיס, פמלה להרגיש נפלא : השינויים הקטנים שיכניסו קצת פשטות לחייכם המסובכים תל-אביב : ידיעות אחרונות ; ספרי חמד, [2004] Abstract כולנו רוצים להרגיש נפלא. כשאנו מרגישים טוב מערכות היחסים שלנו מתפקדות, אנו חשים סיפוק בעבודה, אוכלים אוכל בריא יותר, נראים טוב יותר ונהנים מבריאות טובה. הרגשה טובה תלויה פחות במה שקורה לנו ויותר במה שאנו חושבים ומרגישים, לכן, גם שינויים קטנים יכולים להשפיע על הדרכים שבהן אנו מתמודדים עם הטרדות והמועקות של החיים.להרגיש נפלא כולל עצות מעשיות וטיפים מעודדים שיסייעו לכם לפשט את החיים ולשפר את איכותם, יום אחר יום.לא משנה עד כמה אתם עסוקים, לעולם אינכם עסוקים מכדי להרגיש נפלא. Subject Health Hygiene Naturopathy Positive thinking Mind and body 44206
|
 |
Dewey Number 371.33 SLA Slade, Tim [ ©2020 Contents Step one: Plan the project -- Step two: Draft a storyboard -- Step three: Develop the course -- Step four: Review the course -- Step five: Deliver the course. Abstract With "The eLearning Designer’s Handbook", you’ll discover how to: 1. Plan your eLearning project by conducting a kickoff meeting with your stakeholders. 2. Draft an eLearning project plan and development timeline. 3. Collect and organize your learning content into an eLearning storyboard. 4. Create a prototype and develop your course with an eLearning authoring tool. 5. Review your eLearning course with your stakeholders and subject matter experts. 6. Implement your eLearning course. 7. Conduct an eLearning project retrospective Subject Computer-assisted instruction Instructional systems -- Design. Educational technology Web-based instruction 44202
|
 |
Dewey Number 515/.7 BUH Theo Bühler, Dietmar A. Salamon. Functional analysis Providence, Rhode Island : American Mathematical Society, [2018] Contents Introduction -- Foundations -- Principles of functional analysis -- The weak and weak* topologies -- Fredholm theory -- Spectral theory -- Unbounded operators -- Semigroups of operators Abstract Functional analysis is a central subject of mathematics with applications in many areas of geometry, analysis, and physics. This book provides a comprehensive introduction to the field for graduate students and researchers. It begins in Chapter 1 with an introduction to the necessary foundations, including the Arzela-Ascoli theorem, elementary Hilbert space theory, and the Baire Category Theorem. Chapter 2 develops the three fundamental principles of functional analysis (uniform boundedness, open mapping theorem, Hahn-Banach theorem) and discusses reflexive spaces and the James space. Chapter 3 introduces the weak and weak* topologies and includes the theorems of Banach-Alaoglu, Banach-Dieudonne, Eberlein-Smulyan, Krein-Milman, as well as an introduction to topological vector spaces and applications to ergodic theory. Chapter 4 is devoted to Fredholm theory. It includes an introduction to the dual operator and to compact operators, and it establishes the closed image theorem. Chapter 5 deals with the spectral theory of bounded linear operators. It introduces complex Banach and Hilbert spaces, the continuous functional calculus for self-adjoint and normal operators, the Gelfand spectrum, spectral measures, cyclic vectors, and the spectral theorem. Chapter 6 introduces unbounded operators and their duals. It establishes the closed image theorem in this setting and extends the functional calculus and spectral measure to unbounded self-adjoint operators on Hilbert spaces. Chapter 7 gives an introduction to strongly continuous semigroups and their infinitesimal generators. It includes foundational results about the dual semigroup and analytic semigroups, an exposition of measurable functions with values in a Banach space, and a discussion of solutions to the inhomogeneous equation and their regularity properties. The appendix establishes the equivalence of the Lemma of Zorn and the Axiom of Choice, and it contains a proof of Tychonoff’s theorem. With 10 to 20 elaborate exercises at the end of each chapter, this book can be used as a text for a one-or-two-semester course on functional analysis for beginning graduate students. Prerequisites are first-year analysis and linear algebra, as well as some foundational material from the second-year courses on point set topology, complex analysis in one variable, and measure and integration. Subject Functional analysis Spectral theory (Mathematics) Semigroups of operators. 44021
|
 |
Dewey Number 518/.5 WIL David P. Williamson, David B. Shmoys. The design of approximation algorithms New York : Cambridge University Press, [2011] Contents Part I. An Introduction to the Techniques: 1. An introduction to approximation algorithms; 2. Greedy algorithms and local search; 3. Rounding data and dynamic programming; 4. Deterministic rounding of linear programs; 5. Random sampling and randomized rounding of linear programs; 6. Randomized rounding of semidefinite programs; 7. The primal-dual method; 8. Cuts and metrics; Part II. Further uses of the techniques: 9. Further uses of greedy and local search algorithms; 10. Further uses of rounding data and dynamic programming; 11. Further uses of deterministic rounding of linear programs; 12. Further uses of random sampling and randomized rounding of linear programs; 13. Further uses of randomized rounding of semidefinite programs; 14. Further uses of the primal-dual method; 15. Further uses of cuts and metrics; 16. Techniques in proving the hardness of approximation; 17. Open problems; Appendix A. Linear programming; Appendix B. NP-completeness Abstract Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems P Subject Approximation theory Mathematical optimization 44024
|
 |
Dewey Number 519.3 ROU Roughgarden, Tim Twenty lectures on algorithmic game theory Cambridge : Cambridge University Press, [2016] Contents Introduction and examples -- Mechanism design basics -- Myerson’s Lemma -- Algorithmic mechanism design -- Revenue-maximizing auctions -- Simple near-optimal auctions -- Multi-parameter mechanism design -- Spectrum auctions -- Mechanism design with payment constraints -- Kidney exchange and stable matching -- Selfish routing and the price of anarchy -- Over-provisioning and atomic selfish routing -- Equilibria : definitions, examples, and existence -- Robust price-of-anarchy bounds in smooth games -- Best-case and strong Nash equilibria -- Best-response dynamics -- No-regrets dynamics -- Swap regret and the Minimax theorem -- Pure Nash equilibria and the PLS-Completeness -- Mixed Nash equilibria and PPAD-completeness Abstract Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author’s Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management Subject Game theory Algorithms 44023
|
 |
519.3 KAR Anna R. Karlin, Yuval Peres. Providence, Rhode Island : American Mathematical Society, [2017] Contents Part I. Analyzing games : strategies and equilibria. Combinatorial games -- Two-person zero-sum games -- Zero-sum games on graphs -- General-sum games -- Existence of Nash equilibria and fixed points -- Games in extensive form -- Evolutionary and correlated equilibria -- The price of anarchy -- Random-turn games -- Part II. Designing games and mechanisms. Stable matching and allocation -- Fair division -- Cooperative games -- Social choice and voting -- Auctions -- Truthful actions in win/lose settings -- VCG and scoring rules -- Matching markets -- Adaptive decision making -- Appendix A. Linear programming -- Appendix B. Some useful probability tools Abstract This book presents a rigorous introduction to the mathematics of game theory without losing sight of the joy of the subject. This is done by focusing on theoretical highlights (e.g., at least six Nobel Prize winning results are developed from scratch) and by presenting exciting connections of game theory to other fields such as computer science, economics, social choice, biology, and learning theory. Both classical topics, such as zero-sum games, and modern topics, such as sponsored search auctions, are covered. Along the way, beautiful mathematical tools used in game theory are introduced, including convexity, fixed-point theorems, and probabilistic arguments. The book is appropriate for a first course in game theory at either the undergraduate or graduate level, whether in mathematics, economics, computer science, or statistics. Subject Game theory 44022
|
 |
Dewey Number 621.381.53 TAU Yuan Taur, Tak H. Ning. Fundamentals of modern VLSI devices / Second edition Cambridge, UK : Cambridge University Press, [2013] Contents Basic device physics -- MOSFET devices -- CMOS device design -- CMOS performance factors -- Bipolar devices -- Bipolar device design -- Bipolar performance factors -- Memory devices -- Silicon-on-insulator devices Abstract Learn the basic properties and designs of modern VLSI devices, as well as the factors affecting performance, with this thoroughly updated second edition. The first edition has been widely adopted as a standard textbook in microelectronics in many major US universities and worldwide. The internationally renowned authors highlight the intricate interdependencies and subtle trade-offs between various practically important device parameters, and provide an in-depth discussion of device scaling and scaling limits of CMOS and bipolar devices. Equations and parameters provided are checked continuously against the reality of silicon data, making the book equally useful in practical transistor design and in the classroom. Every chapter has been updated to include the latest developments, such as MOSFET scale length theory, high-field transport model and SiGe-base bipolar devices Subject Metal oxide semiconductors, Complementary Bipolar transistors Integrated circuits -- Very large scale integration. 44223
|
 |
Dewey Number 621.382 SPR Springer handbook of optical networks Cham : Springer, [2020] Contents Introduction -- The Evolution of Optical Transport Networks -- Part A: Optical Subsystems for Transmission and Switching -- Optical fiber and cables -- Optical amplifiers -- Optical transponders -- Optical transponder components -- Digital signal processing for optical transceivers -- Forward Error Correction for optical transponders -- Optical node architectures -- Fiber Nonlinearity and Optical System Performance -- Space-division multiplexing -- Part B: Core Networks -- Carrier network architectures and resiliency -- Standards for optical transport networks -- Routing and wavelength (spectrum) assignment -- Traffic grooming -- Dynamic control of optical networks -- Cross-layer design -- Optical network virtualization -- Metro networks architectures -- Energy efficiency in optical networks -- Packet- and burst-switched optical network architectures -- Part C: Datacenter and Super-Computer Networking -- Evolving requirements and trends of datacenters networks -- Evolving requirements and trends of HPC -- Intra-Datacenter network architectures -- System aspects for optical interconnect transceivers -- Optical switching for Data Center Networks -- Part D: Optical Access and Wireless Networks -- Introduction to Optical Access Networks -- Current TDM PONs -- Emerging PONs -- Advanced PON Architectures -- Long-reach PON and access/metro integration -- Digital optical front-haul technologies and architectures -- Analog optical front-haul technologies and architectures -- Optical networking for 5G and fiber-wireless convergence -- Free-space optical links for communication networks -- Visible Light Communications -- Optical communications for avionics and autonomous vehicles. Abstract This handbook is an authoritative, comprehensive reference on optical networks, the backbone of today’s communication and information society. The book reviews the many underlying technologies that enable the global optical communications infrastructure, but also explains current research trends targeted towards continued capacity scaling and enhanced networking flexibility in support of an unabated traffic growth fueled by ever-emerging new applications. The book is divided into four parts: Optical Subsystems for Transmission and Switching, Core Networks, Datacenter and Super-Computer Networking, and Optical Access and Wireless Networks. Each chapter is written by world-renown experts that represent academia, industry, and international government and regulatory agencies. Every chapter provides a complete picture of its field, from entry-level information to a snapshot of the respective state-of-the-art technologies to emerging research trends, providing something useful for the novice who wants to get familiar with the field to the expert who wants to get a concise view of future trends. Subject Optical communications Electrical engineering. Computer networks Microwaves Optical engineering 44009
|
 |
Dewey Number 745.2/092 FOR Forms and feelings : Arik Levy and Pippo Lionni [Paris] : Isthme Editions, [2003]. Per.Sub. Levy, Arik 1963- Lionni, Pippo 1954- Subject Design -- France -- 20th century. 44219
|
 |
Dewey Number 746.9/2092 SMI Smith, Paul London : Phaidon Press, [2020] Contents Dedication / by Paul Smith -- Foreword / by Jony Ive -- A portrait through 50 objects / by Tony Chambers -- 50 objects Abstract A timely celebration of British design legend Sir Paul Smith and his one-of-a-kind creativity. This new monograph captures the unique spirit of British fashion icon Sir Paul Smith through 50 objects chosen by Sir Paul himself for the inspiration they have provided him over the years - from a wax plate of spaghetti and a Dieter Rams radio to a Mario Bellini Cab chair and a bicycle seat. Each object has impacted his worldview, his creative process, and his adherence to a design approach that’s always imbued with distinctly British wit and eccentricity Per.Sub. Smith, Paul 1946- Corp.Sub. Paul Smith (Firm) Subject Fashion designers -- Great Britain. Fashion designers -- Great Britain Biography Fashion designers -- Great Britain -- Anecdotes. Fashion design -- Great Britain -- History -- 20th century. Book design Book cover art Layout (Printing) 44211
|
 |
Dewey Number 75.74 CLI London : Endeavour ; Praha : Slovart, [2009] Subject Photography -- 20th century. Photography -- History. Portraits 44215
|
 |
Dewey Number 751.73 MAN Manco, Tristan New York : Thames & Hudson, [2004] Contents Incoming -- History of stencil art -- History of stencil graffiti -- Stencil style -- On the Street-- Pop Art --Objects --Sex objects -- Comicbook heroes -- Cult heroes music legends -- Screen stars -- Tribal -- Zoo -- Make Your Mark -- Blek -- Nemo & jerome mesnager -- Miss-tic -- Nylon bananensprayer -- Faces -- Life & birth -- Good & evil on the edge -- Skates -- Djs -- Comics -- Soccer -- Protest obey campaign -- Codes -- The toasters -- Words -- Poetry -- On [left and right arrow] Off the Street -- Banksy -- Bonehead -- Nano4814 -- Gerardo yepiz -- Bernie reid & paris -- Off the Street -- Swifty & ian wright -- Iogan hicks -- Sunil pawar -- Nick walker mitch -- Christopher bettig -- Shepard fairey -- Chris francis dave kinsey -- Steff plaetz -- Chris stain -- Outgoing Abstract City streets abound with billboards, posters, and corporate advertising that almost invite a subversive response . . . and increasingly are getting one. Many of today’s graffiti artists have adopted the stencil and spray can, and are using the street as a giant creative forum for their arresting artwork. "The image," says San Diego artist Shepard Fairey, "is integrated with the texture of the street."" "Tristan Manco has chosen over 400 of the most visually exuberant, subtle, and creative examples of the genre from cities all over the world. With subject matter ranging from the political to the poetic, from the funky to the frankly curious, stencil graffiti is graphic innovation on an international scale. Inspirational in form and content, this book is an essential record for everyone with an interest in design or in contemporary urban culture Subject Graffiti Stencil work Street art 43693
|
- כתבות, חדשות ואירועים
