Unlike some operating systems, Linux doesn't try to hide the important bits from you—it gives you full control of your computer. But to truly master Linux, you need to understand its internals, like how the system boots, how networking works, and what the kernel actually does.
In this completely revised second edition of the perennial best seller How Linux Works, author Brian Ward makes the concepts behind Linux internals accessible to anyone curious about the inner workings of the operating system. Inside, you'll find the kind of knowledge that normally comes from years of experience doing things the hard way. You'll learn:
How Linux boots, from boot loaders to init implementations (systemd, Upstart, and System V)
* How the kernel manages devices, device drivers, and processes
* How networking, interfaces, firewalls, and servers work
* How development tools work and relate to shared libraries
* How to write effective shell scripts
You'll also explore the kernel and examine key system tasks inside user space, including system calls, input and output, and filesystems. With its combination of background, theory, real-world examples, and patient explanations, How Linux Works will teach you what you need to know to solve pesky problems and take control of your operating system.

Fun and functional Linux, Mac OS X and UNIX shell scripts The UNIX shell is the main scripting environment of every Linux, Mac OS X and UNIX system, whether a rescued laptop or a million-dollar mainframe. This cookbook of useful, customizable, and fun scripts gives you the tools to solve common Linux, Mac OS X and UNIX problems and personalize your computing environment. Among the more than 100 scripts included are an interactive calculator, a spell checker, a disk backup utility, a weather tracker, and a web logfile analysis tool. The book also teaches you how to write your own sophisticated shell scripts by explaining the syntax and techniques used to build each example scripts. Examples are written in Bourne Shell (sh) syntax.

This is a self-contained and systematic account of affine differential geometry from a contemporary view, not only covering the classical theory, but also introducing more modern developments. In order both to cover as much as possible and to keep the text of a reasonable size, the authors have concentrated on the significant features of the subject and their relationship and application to such areas as Riemannian, Euclidean, Lorentzian and projective differential geometry. In so doing, they also provide a modern introduction to the last. Some of the important geometric surfaces considered are illustrated by computer graphics, making this a physically and mathematically attractive book for all researchers in differential geometry, and for mathematical physicists seeking a quick entry to the subject.

Highly useful text studies the logarithmic measures of information and their application to testing statistical hypotheses. Topics include introduction and definition of measures of information, their relationship to Fisher's information measure and sufficiency, fundamental inequalities of information theory, much more. Numerous worked examples and problems. References. Glossary. Appendix. 1968 2nd, revised edition.

Expert coverage of the design and implementation of state estimation algorithms for tracking and navigation Estimation with Applications to Tracking and Navigation treats the estimation of various quantities from inherently inaccurate remote observations. It explains state estimator design using a balanced combination of linear systems, probability, and statistics. The authors provide a review of the necessary background mathematical techniques and offer an overview of the basic concepts in estimation. They then provide detailed treatments of all the major issues in estimation with a focus on applying these techniques to real systems. Other features include:* Problems that apply theoretical material to real-world applications* In-depth coverage of the Interacting Multiple Model (IMM) estimator* Companion DynaEst(TM) software for MATLAB(TM) implementation of Kalman filters and IMM estimators* Design guidelines for tracking filters Suitable for graduate engineering students and engineers working in remote sensors and tracking, Estimation with Applications to Tracking and Navigation provides expert coverage of this important area.

Be prepared for your next job interview with this tried-and-true advice In today's tight job market, competition for programming jobs is hotter than ever. This third edition of a popular guide to programming interviews includes new code examples, information on the latest languages, new chapters on sorting and design patterns, tips on using LinkedIn, and a downloadable app to help prepare applicants for the interview. Like its earlier editions, this guide covers what software companies and IT departments want their programmers to know and includes plenty of helpful hints to boost your confidence. Looks at current job search and hiring processes, such as the rise of LinkedIn and other social networks as recruiting resources Addresses the most important languages for a programmer to know and features examples in multiple languages Includes new programming questions designed to sharpen your knowledge Features all-new chapters on design patterns and sorting, including how to deal with memory constraints and mobility issues Walk into your next job interview with confidence, knowing you have thoroughly studied this newest edition of Programming Interviews Exposed .

If you've asked someone the secret to writing efficient, well-written software, the answer that you've probably gotten is "learn assembly language programming." By learning assembly language programming, you learn how the machine really operates and that knowledge will help you write better high-level language code. A dirty little secret assembly language programmers rarely admit to, however, is that what you really need to learn is machine organization, not assembly language programming. Write Great Code Vol I, the first in a series from assembly language expert Randall Hyde, dives right into machine organization without the extra overhead of learning assembly language programming at the same time. And since Write Great Code Vol I concentrates on the machine organization, not assembly language, the reader will learn in greater depth those subjects that are language-independent and of concern to a high level language programmer. Write Great Code Vol I will help programmers make wiser choices with respect to programming statements and data types when writing software, no matter which language they use.

The second volume in the Write Great Code series supplies the critical information that today's computer science students don't often get from college and university courses: How to carefully choose their high-level language statements to produce efficient code. Write Great Code, Volume 2: Thinking Low-Level, Writing High-Level, teaches software engineers how compilers translate high-level language statements and data structures into machine code. Armed with this knowledge, a software engineer can make an informed choice concerning the use of those high-level structures to help the compiler produce far better machine code--all without having to give up the productivity and portability benefits of using a high-level language.

The computing world today is in the middle of a revolution: mobile clients and cloud computing have emerged as the dominant paradigms driving programming and hardware innovation today. The Fifth Edition of Computer Architecture focuses on this dramatic shift, exploring the ways in which software and technology in the cloud are accessed by cell phones, tablets, laptops, and other mobile computing devices. Each chapter includes two real-world examples, one mobile and one datacenter, to illustrate this revolutionary change. Updated to cover the mobile computing revolution Emphasizes the two most important topics in architecture today: memory hierarchy and parallelism in all its forms. Develops common themes throughout each chapter: power, performance, cost, dependability, protection, programming models, and emerging trends ("What's Next") Includes three review appendices in the printed text. Additional reference appendices are available online. Includes updated Case Studies and completely new exercises.

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).

The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich, Tomassia and Goldwasser's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.

You've learned the basics of Python, but how do you take your skills to the next stage? Even if you know enough to be productive, there are a number of features that can take you to the next level in Python. Pro Python explores concepts and features normally left to experimentation, allowing you to be even more productive and creative. In addition to pure code concerns, Pro Python will develop your programming techniques and approaches, which will help make you a better Python programmer. Not only will this book help your code, it will also help you understand and interact with the many established Python communities, or even start your own. * Take your Python knowledge and coding skills to the next level. * Write clean, innovative code that will be respected among your peers. * Make your code do more with introspection and metaprogramming. * Design complete frameworks and libraries (two are included in the book!). What you'll learn * Write strong Python code that will be respected in the Python community. * Understand the reasons behind big design decisions in Python. * Write programs that can reconfigure themselves in Python. * Disguise your code as different types of objects in Python. * Inspect just about any object in Python. * Prepare your code for international audiences. * Ensure code quality with rigorous testing. Who this book is for This book is for intermediate to advanced Python programmers who are looking to understand how and why Python works the way it does and how they can take their code to the next level. Table of Contents * Principles and Philosophy * Advanced Basics * Functions * Classes * Common Protocols * Object Management * Strings * Documentation * Testing * Distribution * Sheets: A CSV Framework

Pattern Theory: From Representation to Inference provides a comprehensive and accessible overview of the modern challenges in signal, data and pattern analysis in speech recognition, computational linguistics, image analysis and computer vision. Aimed at graduate students in biomedical engineering, mathematics, computer science and electrical engineering with a good background in mathematics and probability, the text includes numerous exercises and an extensive bibliography. Additional resources including extended proofs, selected solutions and examples are available on a companion website. The book commences with a short overview of pattern theory and the basics of statistics and estimation theory. Chapters 3-6 discuss the role of representation of patterns via conditioning structure and Chapters 7 and 8 examine the second central component of pattern theory: groups of geometric transformation applied to the representation of geometric objects. Chapter 9 moves into probabilistic structures in the continuum, studying random processes and random fields indexed over subsets of Rn, and Chapters 10, 11 continue with transformations and patterns indexed over the continuum.Chapters 12-14 extend from the pure representations of shapes to the Bayes estimation of shapes and their parametric representation. Chapters 15 and 16 study the estimation of infinite dimensional shape in the newly emergent field of Computational Anatomy, and finally Chapters 17 and 18 look at inference, exploring random sampling approaches for estimation of model order and parametric representing of shapes.

A systematic account of the theory of probability for certain sample spaces with algebraic structure, this text covers semi-groups, groups, linear vector spaces, and algebra. It states and studies fundamental probabilistic problems for these spaces, focusing on concrete results rather than on general and complete answers. 1963 edition.

In this groundbreaking work, computer scientist Leslie G. Valiant details a promising new computational approach to studying the intricate workings of the human brain. Focusing on the brain's enigmatic ability to access quickly a massive store of accumulated information during reasoning processes, the author asks how such feats are possible given the extreme constraints imposed by the brain's finite number of neurons, their limited speed of communication, and their restricted interconnectivity. Valiant proposes a "neuroidal model" that serves as a vehicle to explore these fascinating questions. While embracing the now classical theories of McCulloch and Pitts, the neuroidal model also accommodates state information in the neurons, more flexible timing mechanisms, a variety of assumptions about interconnectivity, and the possibility that different areas perform different functions. Programmable so that a wide range of algorithmic theories can be described and evaluated, the model provides a concrete computational language and a unified framework in which diverse cognitive phenomena--such as memory, learning, and reasoning--can be systematically and concurrently analyzed. Requiring no specialized knowledge, Circuits of the Mind masterfully offers an exciting new approach to brain science for students and researchers in computer science, neurobiology, neuroscience, artificial intelligence, and cognitive science.

This book is an introduction to pattern theory, the theory behind the task of analyzing types of signals that the real world presents to us. It deals with generating mathematical models of the patterns in those signals and algorithms for analyzing the data based on these models. It exemplifies the view of applied mathematics as starting with a collection of problems from some area of science and then seeking the appropriate mathematics for clarifying the experimental data and the underlying processes of producing these data. An emphasis is placed on finding the mathematical and, where needed, computational tools needed to reach those goals, actively involving the reader in this process. Among other examples and problems, the following areas are treated: music as a realvalued function of continuous time, character recognition, the decomposition of an image into regions with distinct colors and textures, facial recognition, and scaling effects present in natural images caused by their statistical selfsimilarity.

500個與「人」有關的漢字＋超過5,000個甲骨文、金文、篆文
收納在2張漢字樹狀圖！
一個台大電機系畢業、專精於電腦的「理工人」，在偶然的機會接觸了被認為許多從事文學創作研究的作家、專家也視為畏途的「文字學」，產生了濃厚的興趣；順著歷來各家的研究，進入了漢字構型的世界，流連忘返。隨著心得漸增，心頭的不解疑團也越來越多。
於是，他引入電腦強大的彙編整理能力，有系統地梳理漢字的構件，試圖找出解釋力更強的說法，在這個過程中，也越加感受到部首的限制與誤導。
部首是一個字組成的構件之一，因為有許多字都有，因而成為漢字分類的標記。但是，屬於同一個部首的字，彼此之間卻未必有關連。反之，有些看似不同的字，從漢字的演化發展來看，卻是關係密切。
作者長年浸淫在文字學的天地，尋索字與字之間的邏輯關連，濃縮在書中的「漢字樹狀圖」中。再透過作者清晰簡要的說明，即使對於在文字學毫無根基的讀者，也可以憑著自身對中文母語的使用經驗，得到許多新奇的發現與樂趣。