- Table View
- List View
The preparation you need for the new CompTIA Security+ exam SY0-301This top-selling study guide helps candidates prepare for exam SY0-301 and certification as a CompTIA Security+ administrator. Inside the new, CompTIA Authorized edition, you'll find complete coverage of all Security+ exam objectives, loads of real-world examples, and a CD packed with cutting-edge exam prep tools. The book covers key exam topics such as general security concepts, infrastructure security, the basics of cryptography, and much more.Provides 100% coverage of all exam objectives for the new CompTIA Security+ exam SY0-301 including: Network security Compliance and operational security Threats and vulnerabilities Application, data and host security Access control and identity management Cryptography Covers key topics such as general security concepts, communication and infrastructure security, the basics of cryptography, operational security, and more Offers practical examples and insights drawn from the real world Includes a CD with two practice exams, all chapter review questions, electronic flashcards, and more Obtain your Security+ certification and jump-start your career. It's possible with the kind of thorough preparation you'll receive from CompTIA Security+ Study Guide, 5th Edition.
An authoritative guide that prepares you for the Strata examThe CompTIA Strata certification relates to computer systems maintenance and is often the stepping stone for progression to CompTIA A+ certification. This study guide offers complete, authoritative coverage of the Strata exam objectives in clear and concise language. With this resource, you'll find all you need to know in order to succeed in the exam. Along with gaining preventative maintenance skills, you will also develop the tools to complete troubleshooting and resolve common issues.Addresses the five key parts of the CompTIA Strata certificationOffers thorough coverage of the Strata exam in a clear and concise mannerPrepares you for troubleshooting and resolving common user issuesFeatures practical examples, exam highlights, and review questions to enhance your learning experienceCompTIA Strata Study Guide is essential reading if you are preparing to take the Strata certification exam.
BONUS: This edition contains an excerpt from Jonathan Kellerman's Victims.Once again, the depths of the criminal mind and the darkest side of a glittering city fuel #1 New York Times bestselling author Jonathan Kellerman's brilliant storytelling. And no one conducts a more harrowing and suspenseful manhunt than the modern Sherlock Holmes of the psyche, Dr. Alex Delaware. A tipsy young woman seeking aid on a desolate highway disappears into the inky black night. A retired schoolteacher is stabbed to death in broad daylight. Two women are butchered after closing time in a small-town beauty parlor. These and other bizarre acts of cruelty and psychopathology are linked only by the killer's use of luxury vehicles and a baffling lack of motive. The ultimate whodunits, these crimes demand the attention of LAPD detective Milo Sturgis and his collaborator on the crime beat, psychologist Alex Delaware. What begins with a solitary bloodstain in a stolen sedan quickly spirals outward in odd and unexpected directions, leading Delaware and Sturgis from the well-heeled center of L.A. society to its desperate edges; across the paths of commodities brokers and transvestite hookers; and as far away as New York City, where the search thaws out a long-cold case and exposes a grotesque homicidal crusade. The killer proves to be a fleeting shape-shifter, defying identification, leaving behind dazed witnesses and death-and compelling Alex and Milo to confront the true face of murderous madness.
Judd Steiner and Artie Straus have it all: wealth, intelligence, and the world at their feet as part of the elite, upper-crust Jewish community of 1920s Chicago. Artie is handsome, athletic, and popular, but he possesses a hidden, powerful sadistic streak and a desire to dominate. Judd is a weedy introvert, a genius who longs for a companion whom he can idolize and worship. Obsessed with Nietzsche's idea of the superhuman, both boys decide to prove that they are above the laws of man by arbitrarily picking and murdering a Jewish boy in their neighborhood. This new edition of Meyer Levin's classic literary thriller Compulsion reintroduces the fictionalized case of Leopold and Loeb - once considered the "crime of the century" - to a new generation. This incisive psychological portrait of two young murderers seized the imagination of an era and is generally recognized as paving the way for the first non-fiction novel. Compulsion forces us to ask what drives some further into darkness, and some to seek redemption. Heartbreaking as it is gripping, Compulsion is written with a tense and penetrating force that led the Los Angeles Times to call Levin, "the most significant Jewish writer of his times. "
Today has to be perfect. Magic. I look at the clock. 10:14 AM. Ten fourteen. One plus one is two plus four is six plus ten is sixteen minus one is fifteen minus two is thirteen. OK. I turn from the clock and walk into the hallway. "Ready." Saturday will be the third state soccer championship in a row for Jake Martin. Three. A good number. Prime. With Jake on the field, Carson City High can't lose because Jake has the magic: a self-created protection generated by his obsession with prime numbers. It's the magic that has every top soccer university recruiting Jake, the magic that keeps his family safe, and the magic that suppresses his anxiety attacks. But the magic is Jake's prison, because sustaining it means his compulsions take over nearly every aspect of his life. Jake's convinced the magic will be permanent after Saturday, the perfect day, when every prime has converged. Once the game is over, he won't have to rely on his sister to concoct excuses for his odd rituals. His dad will stop treating him like he is some freak. Maybe he'll even make a friend other than Luc. But what if the magic doesn't stay? What if the numbers never leave? Acclaimed author Heidi Ayarbe has created an honest and riveting portrait of a teen struggling with obsessive compulsive disorder in this breathtaking and courageous novel.
Beautiful Creatures meets The Body Finder in Compulsion, the first novel in a spellbinding new trilogy.All her life, Barrie Watson has been a virtual prisoner in the house where she lived with her shut-in mother. When her mother dies, Barrie promises to put some mileage on her stiletto heels. But she finds a new kind of prison at her aunt's South Carolina plantation instead--a prison guarded by an ancient spirit who long ago cursed one of the three founding families of Watson Island and gave the others magical gifts that became compulsions. Stuck with the ghosts of a generations-old feud and hunted by forces she cannot see, Barrie must find a way to break free of the family legacy. With the help of sun-kissed Eight Beaufort, who knows what Barrie wants before she knows herself, the last Watson heir starts to unravel her family's twisted secrets. What she finds is dangerous: a love she never expected, a river that turns to fire at midnight, a gorgeous cousin who isn't what she seems, and very real enemies who want both Eight and Barrie dead.
Once again, the depths of the criminal mind and the darkest side of a glittering city fuel #1 New York Times bestselling author Jonathan Kellerman's brilliant storytelling. And no one conducts a more harrowing and suspenseful manhunt than the modern Sherlock Holmes of the psyche, Dr. Alex Delaware. A tipsy young woman seeking aid on a desolate highway disappears into the inky black night. A retired schoolteacher is stabbed to death in broad daylight. Two women are butchered after closing time in a small-town beauty parlor. These and other bizarre acts of cruelty and psychopathology are linked only by the killer's use of luxury vehicles and a baffling lack of motive. The ultimate whodunits, these crimes demand the attention of LAPD detective Milo Sturgis and his collaborator on the crime beat, psychologist Alex Delaware.What begins with a solitary bloodstain in a stolen sedan quickly spirals outward in odd and unexpected directions, leading Delaware and Sturgis from the well-heeled center of L.A. society to its desperate edges; across the paths of commodities brokers and transvestite hookers; and as far away as New York City, where the search thaws out a long-cold case and exposes a grotesque homicidal crusade. The killer proves to be a fleeting shape-shifter, defying identification, leaving behind dazed witnesses and death-and compelling Alex and Milo to confront the true face of murderous madness.From the Trade Paperback edition.
In cool, precise prose, and with an unerring sense of the absurd, the four novellas ofCompulsory Happinesscreate a picture of everyday life in a grotesque police state, expressing terror and hope, fear and solidarity, the humorous triviality of the ordinary, and the painful search for an ideal. "Norman Manea's four novellas, written during the later Ceausescu years, offer a comparable contrast to other Eastern European dissident writing. Instead of the energetic irony, the ebullient absurdism, the sharp-eyed wit, we find a dreamy disconnection, a voice that shock has lowered, an air of sweetness driven mad. "--Richard Eder,Los Angeles Times "Mr. Manea's voice is radically new, and we are blessedly awakened and alerted by the demand his fiction makes on our understanding. "--Lore Segal,New York Times Book Review
What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes
This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.<P> Advisory: Bookshare has learned that this book offers only partial accessibility. We have kept it in the collection because it is useful for some of our members. To explore further access options with us, please contact us through the Book Quality link on the right sidebar. Benetech is actively working on projects to improve accessibility issues such as these.
¡Conozca a fondo su computadora y todo lo que puede hacer con ella! ¿Necesita saber usar las computadoras para mejorar su empleo y nivel de vida, pero no sabe por dónde empezar? ¿No entiende la terminología de lengua inglesa que se usa en la computación? ¿Quiere comunicarse con sus amigos y su pa's de origen por correo electrónico o por llamadas telefónicas por Internet pero no sabe cómo hacerlo? ¿Sabe ya cómo entrar en el Internet pero le cuesta trabajo aprovecharse de todo lo que ofrece? Computadoras para todos, 2 a ediciónes su entrada al mundo de la informática, educación, negocios y diversión para la familia hispana. Jaime Restrepo le brinda al lector--tanto el principiante como el más conocedor--la guía más práctica y actualizada para aquel que quisiera saber lo que es una computadora, cómo funciona, y cómo usarla y sacarle provecho. En esta edición actualizada,Computadoras para todos, 2 a ediciónle enseña lo œltimo en: Cómo usar los sistemas operativos Microsoft® Windows® 98/Me, 2000 y XP, y las ventajas de cada uno Cómo funciona el programa de computación Microsoft® Office 2003, incluyendo los programas Word®, Excel® y PowerPoint® Cómo utilizar los navegadores más populares: Internet Explorer y Safari Cómo enviar y recibir correo electrónico mediante los programas Microsoft® Outlook® y Hotmail Cómo utilizar el programa de mensajero instantáneo Windows Messenger para realizar llamadas gratis a cualquier parte del mundo Además, el autor esclarece el vocabulario de lengua inglesa que domina la computación al presentarlo de una manera comprensible para cualquiera que no se siente cómodo con ese idioma. Escrito para el público hispanoparlante y con ilustraciones detalladas,Computadoras para todos, 2 a ediciónes un recurso imprescindible que esclarece todos los pormenores que se necesita saber para usar todos los componentes de una computadora de forma eficaz. From the Trade Paperback edition.
Computational Analysis of Terrorist Groups: Lashkar-e-Taiba provides an in-depth look at Web intelligence, and how advanced mathematics and modern computing technology can influence the insights we have on terrorist groups. This book primarily focuses on one famous terrorist group known as Lashkar-e-Taiba (or LeT), and how it operates. After 10 years of counter Al Qaeda operations, LeT is considered by many in the counter-terrorism community to be an even greater threat to the US and world peace than Al Qaeda. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is the first book that demonstrates how to use modern computational analysis techniques including methods for "big data" analysis. This book presents how to quantify both the environment in which LeT operate, and the actions it took over a 20-year period, and represent it as a relational database table. This table is then mined using sophisticated data mining algorithms in order to gain detailed, mathematical, computational and statistical insights into LeT and its operations. This book also provides a detailed history of Lashkar-e-Taiba based on extensive analysis conducted by using open source information and public statements. Each chapter includes a case study, as well as a slide describing the key results which are available on the authors' web sites. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is designed for a professional market composed of government or military workers, researchers and computer scientists working in the web intelligence field. Advanced-level students in computer science will also find this valuable as a reference book.
Scientists need statistics. Increasingly this is accomplished using computational approaches. Freeing readers from the constraints, mysterious formulas and sophisticated mathematics of classical statistics, this book is ideal for researchers who want to take control of their own statistical arguments. It demonstrates how to use spreadsheet macros to calculate the probability distribution predicted for any statistic by any hypothesis. This enables readers to use anything that can be calculated (or observed) from their data as a test statistic and hypothesize any probabilistic mechanism that can generate data sets similar in structure to the one observed. A wide range of natural examples drawn from ecology, evolution, anthropology, palaeontology and related fields give valuable insights into the application of the described techniques, while complete example macros and useful procedures demonstrate the methods in action and provide starting points for readers to use or modify in their own research.
Mathematical modelling and computer simulation have proved tremendously successful in engineering. One of the greatest challenges for mechanists is to extend the success of computational mechanics to fields outside traditional engineering, in particular to biology, biomedical sciences, and medicine. The proposed workshop will provide an opportunity for computational biomechanics specialists to present and exchange opinions on the opportunities of applying their techniques to computer-integrated medicine. For example, continuum mechanics models provide a rational basis for analysing biomedical images by constraining the solution to biologically reasonable motions and processes. Biomechanical modelling can also provide clinically important information about the physical status of the underlying biology, integrating information across molecular, tissue, organ, and organism scales. The main goal of this workshop is to showcase the clinical and scientific utility of computational biomechanics in computer-integrated medicine.
This brief introduces people with a basic background in probability theory to various problems in cancer biology that are amenable to analysis using methods of probability theory and statistics. The title mentions "cancer biology" and the specific illustrative applications reference cancer data but the methods themselves are more broadly applicable to all aspects of computational biology. Aside from providing a self-contained introduction to basic biology and to cancer, the brief describes four specific problems in cancer biology that are amenable to the application of probability-based methods. The application of these methods is illustrated by applying each of them to actual data from the biology literature. After reading the brief, engineers and mathematicians should be able to collaborate fruitfully with their biologist colleagues on a wide variety of problems.
Computational Colour Science Using MATLAB 2nd Edition offers a practical, problem-based approach to colour physics. The book focuses on the key issues encountered in modern colour engineering, including efficient representation of colour information, Fourier analysis of reflectance spectra and advanced colorimetric computation. Emphasis is placed on the practical applications rather than the techniques themselves, with material structured around key topics. These topics include colour calibration of visual displays, computer recipe prediction and models for colour-appearance prediction.Each topic is carefully introduced at three levels to aid student understanding. First, theoretical ideas and background information are discussed, then explanations of mathematical solutions follow and finally practical solutions are presented using MATLAB. The content includes:A compendium of equations and numerical data required by the modern colour and imaging scientist.Numerous examples of solutions and algorithms for a wide-range of computational problems in colour science.Example scripts using the MATLAB programming language.This 2nd edition contains substantial new and revised material, including three innovative chapters on colour imaging, psychophysical methods, and physiological colour spaces; the MATLAB toolbox has been extended with a professional, optimized, toolbox to go alongside the current teaching toolbox; and a java toolbox has been added which will interest users who are writing web applications and/or applets or mobile phone applications.Computational Colour Science Using MATLAB 2nd Edition is an invaluable resource for students taking courses in colour science, colour chemistry and colour physics as well as technicians and researchers working in the area. In addition, it acts a useful reference for professionals and researchers working in colour dependent industries such as textiles, paints, print & electronic imaging.Review from First Edition:"...highly recommended as a concise introduction to the practicalities of colour science..." (Color Technology, 2004)
An overview of the emerging discipline of computational developmental psychology, emphasizing the use of constructivist neural networks.
This book was first published in 2003. Combinatorica, an extension to the popular computer algebra system Mathematica®, is the most comprehensive software available for teaching and research applications of discrete mathematics, particularly combinatorics and graph theory. This book is the definitive reference/user's guide to Combinatorica, with examples of all 450 Combinatorica functions in action, along with the associated mathematical and algorithmic theory. The authors cover classical and advanced topics on the most important combinatorial objects: permutations, subsets, partitions, and Young tableaux, as well as all important areas of graph theory: graph construction operations, invariants, embeddings, and algorithmic graph theory. In addition to being a research tool, Combinatorica makes discrete mathematics accessible in new and exciting ways to a wide variety of people, by encouraging computational experimentation and visualization. The book contains no formal proofs, but enough discussion to understand and appreciate all the algorithms and theorems it contains.
The ability to conceptualize an economic problem verbally, to formulate it as a mathematical model, and then represent the mathematics in software so that the model can be solved on a computer is a crucial skill for economists. Computational Economics contains well-known models--and some brand-new ones--designed to help students move from verbal to mathematical to computational representations in economic modeling. The authors' focus, however, is not just on solving the models, but also on developing the ability to modify them to reflect one's interest and point of view. The result is a book that enables students to be creative in developing models that are relevant to the economic problems of their times. Unlike other computational economics textbooks, this book is organized around economic topics, among them macroeconomics, microeconomics, and finance. The authors employ various software systems--including MATLAB, Mathematica, GAMS, the nonlinear programming solver in Excel, and the database systems in Access--to enable students to use the most advantageous system. The book progresses from relatively simple models to more complex ones, and includes appendices on the ins and outs of running each program.The book is intended for use by advanced undergraduates and professional economists and even, as a first exposure to computational economics, by graduate students. Organized by economic topics Progresses from simple to more complex models Includes instructions on numerous software systems Encourages customization and creativity
This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
This clearly-structured, classroom-tested textbook/reference presents a methodical introduction to the field of CI. Providing an authoritative insight into all that is necessary for the successful application of CI methods, the book describes fundamental concepts and their practical implementations, and explains the theoretical background underpinning proposed solutions to common problems. Only a basic knowledge of mathematics is required. Features: provides electronic supplementary material at an associated website, including module descriptions, lecture slides, exercises with solutions, and software tools; contains numerous examples and definitions throughout the text; presents self-contained discussions on artificial neural networks, evolutionary algorithms, fuzzy systems and Bayesian networks; covers the latest approaches, including ant colony optimization and probabilistic graphical models; written by a team of highly-regarded experts in CI, with extensive experience in both academia and industry.
The practical benefits of computational logic need not be limited to mathematics and computing. As this book shows, ordinary people in their everyday lives can profit from the recent advances that have been developed for artificial intelligence. The book draws upon related developments in various fields from philosophy to psychology and law. It pays special attention to the integration of logic with decision theory, and the use of logic to improve the clarity and coherence of communication in natural languages such as English. This book is essential reading for teachers and researchers who may be out of touch with the latest developments in computational logic. It will also be useful in any undergraduate course that teaches practical thinking, problem solving or communication skills. Its informal presentation makes the book accessible to readers from any background, but optional, more formal, chapters are also included for those who are more technically oriented.
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn's lemma.
The book covers the application of numerical methods to reinforced concrete structures. To analyze reinforced concrete structures linear elastic theories are inadequate because of cracking, bond and the nonlinear and time dependent behavior of both concrete and reinforcement. These effects have to be considered for a realistic assessment of the behavior of reinforced concrete structures with respect to ultimate limit states and serviceability limit states. The book gives a compact review of finite element and other numerical methods. The key to these methods is through a proper description of material behavior. Thus, the book summarizes the essential material properties of concrete and reinforcement and their interaction through bond. These basics are applied to different structural types such as bars, beams, strut and tie models, plates, slabs and shells. This includes prestressing of structures, cracking, nonlinear stress?strain relations, creeping, shrinkage and temperature changes. Appropriate methods are developed for each structural type. Large displacement and dynamic problems are treated as well as short-term quasi-static problems and long-term transient problems like creep and shrinkage. Most problems are illustrated by examples which are solved by the program package ConFem, based on the freely available Python programming language. The ConFem source code together with the problem data is available under open source rules at concrete-fem.com. The author aims to demonstrate the potential and the limitations of numerical methods for simulation of reinforced concrete structures, addressing students, teachers, researchers and designing and checking engineers.
Select your format based upon: 1) how you want to read your book, and 2) compatibility with your reading tool. To learn more about using Bookshare with your device, visit the Help Center.
Here is an overview of the specialized formats that Bookshare offers its members with links that go to the Help Center for more information.
- Bookshare Web Reader - a customized reading tool for Bookshare members offering all the features of DAISY with a single click of the "Read Now" link.
- DAISY (Digital Accessible Information System) - a digital book file format. DAISY books from Bookshare are DAISY 3.0 text files that work with just about every type of access technology that reads text. Books that contain images will have the download option of ‘DAISY Text with Images’.
- BRF (Braille Refreshable Format) - digital Braille for use with refreshable Braille devices and Braille embossers.
- MP3 (Mpeg audio layer 3) - Provides audio only with no text. These books are created with a text-to-speech engine and spoken by Kendra, a high quality synthetic voice from Ivona. Any device that supports MP3 playback is compatible.
- DAISY Audio - Similar to the Daisy 3.0 option above; however, this option uses MP3 files created with our text-to-speech engine that utilizes Ivonas Kendra voice. This format will work with Daisy Audio compatible players such as Victor Reader Stream and Read2Go.