Vehicle Detection and Tracking in Car Video Based on Motion Model

Vehicle Detection and Tracking in Car Video Based on Motion Model--This work aims at real-time in-car video analysis to detect and track vehicles ahead for safety, auto-driving, and target tracing. This paper describes a comprehensive approach to localize target vehicles in video under various environmental conditions. The extracted geometry features from the video are projected onto a 1D profile continuously and are tracked constantly. We rely on temporal information of features and their motion behaviors for vehicle identification, which compensates for the complexity in recognizing vehicle shapes, colors, and types. We model the motion in the field of view probabilistically according to the scene characteristic and vehicle motion model. The Hidden Markov Model is used for separating target vehicles from background, and tracking them probabilistically. We have investigated videos of day and night on different types of roads, showing that our approach is robust and effective in dealing with changes in environment and illumination, and that real time processing becomes possible for vehicle borne cameras.

Tracking Multiple People with a Multi-Camera System

We present a multi-camera system based on Bayesian modality fusion to track multiple people in an indoor environment. Bayesian networks are used to combine multiple modalities for matching subjects between consecutive imge frames and between multiple camera views. Unlike other occlusion reasoning methods, we use multiple cameras in order to obtain continuous visual information of people in either or both cameras so that they can be tracked through interactions. Results demonstrate that the system can maintain people’s identities by using multiple cameras cooperatively.

Detection and Tracking of Moving Objects Using a Network of Laser Scanners

In our previous work,we reported a system that monitors an intersection using a network of horizontal laser scanners.This paper focuses on an algorithm for moving-object detection and tracking,given a sequence of distributed laser scan data of an intersection.The goal is to detect each moving object that enters the intersection;estimate state parameters such as size;and track its location,speed,and direction while it passes through the intersection.This work is unique,to the best of the authors’knowledge,in that the data is novel,which provides new possibilities but with great challenges;the algorithm is the first proposal that uses such data in detecting and tracking all moving objects that pass through a large crowded intersection with focus on achieving robustness to partial observations,some of which result from occlusions,and on performing correct data associa- tions in crowded situations.Promising results are demonstrated using experimental data from real intersections,whereby,for 1063 objects moving through an intersection over 20 min,988 are perfectly tracked from entrance to exit with an excellent tracking ratio of 92.9%.System advantages,limitations,and future work are discussed.

Multi-emotional single-track music generating model based on LSTM

基于LSTM的多情感单音轨音乐生成模型，王希成，李炜，随着短视频平台的普及，用户通过自己创作视频进行分享的现象已经十分普遍。背景音乐作为短视频中不可或缺的部分，在情感表达上起

Singular Value Decomposition (SVD) A Fast Track Tutorial

Singular Value Decomposition (SVD) A Fast Track Tutorial

Camera Path Animator 3.61

Camera Path Animator - Animate Cutscenes with Splines 3.61 Unity 5 compatible Create, edit and preview camera animation within the editor and avoid having to compile the scene to see every change. Animate a Camera or GameObject in Unity with ease and no need to touch code Perfect for creating cutscenes, architectural visualisations, fly throughs and cinematics Preview your camera animation within the Unity editor, no need to press play Custom made GUI to assist you creating your camera/gameobject animation Powerful implementation of Bezier and Hermite curves, fully normalised for complete control. Suitable for mobile and 2D Includes an integrated C# event system Multiple modes including mouse look, track target, loop, ping pong Mature, stable codebase. No DLLs, full source included

Camera实时预览 faceTrack实现动态人脸识别106个特征点

实现Camera实时预览 facetrack动态识别视频流中的人脸 并标记出106个特征点

Android代码-GeoLog位置跟踪器

GeoLog is a new kind of location tracker which changes tracking characteristics based on where you are and what you are doing. On foot, you travel slower than by car, and you may not want to gather location data as often. If you're standing still, why track location at all - it's just a waste of power. If you're on a photo walk, you might only want to track location while walking, and not when doing anything else - like driving to the where the walk starts. When on a long trip, you may wish to u

The Craft of System Security

The Craft of System Security by Sean Smith; John Marchesini List of Figures 1.1 An access control matrix 7 1.2 Security and state spaces 10 2.1 Example clearance order 26 2.2 Example categories order 27 2.3 Example MLS lattice 28 2.4 The *-Property 30 2.5 The Chinese Wall 32 2.6 Functionality versus assurance 33 2.7 Object reuse with local variables 37 2.8 The Orange Book's path through the functionality/assurance space 41 4.1 Basic computer architecture 62 4.2 The memory management unit 65 4.3 Address spaces 66 4.4 System call architecture 67 5.1 LANs and WANs 89 5.2 Switched Ethernet 90 5.3 Network address translation 91 5.4 Resolution and routing in the net 93 5.5 Network ports 93 5.6 Network protocol layers 94 5.7 Network protocol stack 95 5.8 Firewall 98 5.9 BGP 103 5.10 Subnets 110 5.11 DMZ 111 5.12 Basic WLAN architecture 113 5.13 Sniffing Web traffic on WLANs 114 5.14 Sniffing e-mail traffic on WLANs 115 5.15 A common enterprise WLAN strategy 117 5.16 WLAN authorization architecture 117 6.1 A process's address space 126 6.2 Stackframe 127 6.3 Integer overflow 135 6.4 Integer overflow with signed integers 136 6.5 Errors in signed/unsigned conversion 137 6.6 Type-safety and memory-safety 146 7.1 Framing cryptography as a pair of transformations 158 7.2 Explicit privileges 159 7.3 RNG 161 7.4 PRNG 162 7.5 Symmetric cryptography 163 7.6 Stream cipher 166 7.7 Block cipher 167 7.8 Block ciphers with CBC 168 7.9 Meet-in-the-middle attack 170 7.10 Inner-CBC EDE for a block cipher in triple mode 171 7.11 Outer-CBC EDE for a block cipher in triple mode 171 7.12 CBC residue MAC 173 7.13 Public-key cryptography 175 7.14 Encrypting with public key 175 7.15 Digital signatures 176 7.16 Signatures with public key 176 7.17 Diffie-Hellman 179 7.18 The Merkle-Damgard approach 181 7.19 A Merkle tree 182 7.20 Iterated hash functions 182 7.21 Square and multiply 184 7.22 Public-key encryption, in practice 185 7.23 Digital signatures, in practice 186 8.1 The Birthday Paradox on hash values 200 8.2 The Wang attack on MD5 201 8.3 Timing attack on RSA 204 9.1 A "ladder diagram" 216 9.2 A CAPTCHA 218 9.3 Example ROC curve 219 9.4 One-time passwords based on time 227 9.5 One-time passwords based on iterated hashing 228 9.6 The small-n attack 229 9.7 The DND authentication protocol 231 9.8 Key derivation in DND 232 9.9 How the adversary can choose the challenge 232 9.10 The ISO SC27 protocol 233 9.11 Chess Grandmaster attack 234 9.12 Reflection attack 234 9.13 Using graph isomorphism for zero-knowledge authentication 236 9.14 Getting a server ticket in Kerberos 239 9.15 Getting a ticket-granting ticket in Kerberos 240 9.16 SSH 242 9.17 The Ellison triangle 245 10.1 Basic PKI architecture 251 10.2 Using a hamster to keep the CA offline 255 10.3 Cross-certification 260 10.4 Bridge CAs 261 11.1 Timeline of standards 277 12.1 Framesets 312 12.2 Server-side SSL 319 12.3 Client-side SSL 325 12.4 Devious frameset 329 12.5 JavaScript to sneakily send POSTs 330 13.1 Example sequence of letters 341 13.2 Looking at Word documents with emacs 342 13.3 Interesting relics in the binary 342 13.4 Turning Fast Save off 343 13.5 File history in the binary 343 13.6 Craptastic! 345 13.7 Memo purportedly released by Alcatel 346 13.8 A physics paper in Word format 346 13.9 Turning "Track Changes" on 347 13.10 Careful with that Distinguished Name! 350 13.11 Altering a boarding pass 354 13.12 Excel relics in PowerPoint 356 13.13 End-of-line misinterpretation 358 14.1 Secret sharing 371 14.2 Fewer than k points 372 14.3 The basic electronic token cash scheme 373 14.4 Digital timestamping 378 14.5 Renewing old timestamps 379 14.6 Multicollisions 380 14.7 Steganography 384 15.1 State transitions 393 15.2 Partial correctness 394 15.3 Propositional logic 396 15.4 First-order logic 397 15.5 Temporal logic 398 15.6 BAN logic 401 15.7 Sample bank account code 405 15.8 Promela specification for bank withdrawals 406 15.9 Spin reveals a race condition 407 15.10 Promela specification for fixed code 408 16.1 The boot-time execution sequence 428 16.2 Checking integrity at boot time 429 16.3 Separation in conventional system 437 16.4 Separation with Type I virtualization 438 16.5 Separation with Type II virtualization 441 16.6 Separation with OS-level virtualization 442 17.1 The general machine learning framework 453 17.2 A neural network 454 18.1 Conceptual models 474 18.2 A Norman door 479 18.3 ROI and security 481 A.1 A simple lattice 491 A.2 If the real numbers were countable 493 A.3 Cantor's diagonalization 494 A.4 An enumeration of Turing machines 495 A.5 An uncomputable function

Obstacle Detection and Tracking for the Urban Challenge 障碍物检测跟踪

This paper describes the obstacle detection and tracking algorithms developed for Boss, which is Carnegie Mellon University ’s winning entry in the 2007 DARPA Urban Challenge. We describe the tracking subsystem and show how it functions in the context of the larger perception system. The tracking subsystem gives the robot the ability to understand complex scenarios of urban driving to safely operate in the proximity of other vehicles. The tracking system fuses sensor data from more than a dozen sensors with additional information about the environment to generate a coherent situational model. A novel multiple-model approach is used to track the objects based on the quality of the sensor data. Finally, the architecture of the tracking subsystem explicitly abstracts each of the levels of processing. The subsystem can easily be extended by adding new sensors and validation algorithms.

Tracking Component-Based Software

Component engineering is gaining substantial interest<br/>in the software engineering community. A lot of<br/>research efforts have been devoted to analysis and<br/>design methods for component-based software.<br/>However, only very few papers address the testing<br/>and maintenance problems of component-based<br/>software. The paper focuses on the component<br/>traceability, related issues and solutions in testing and<br/>maintenance of component-based software. To<br/>increase component traceability in a distributed<br/>program, we proposes a systematic approach to<br/>adding the component traceability in a distributed<br/>component-based program so that we can check,<br/>track, and monitor the diverse component behaviors<br/>and their performance in a distributed environment.<br/>Moreover, we introduce the concept of traceable<br/>components, and use examples to demonstrate how<br/>to construct them in a systematic way.

复旦大学人工智能car答案

This assignment is a modified version of the Driverless Car assignment written by Chris Piech. A study by the World Health Organization found that road accidents kill a shocking 1.24 million people a year worldwide. In response, there has been great interest in developing autonomous driving technology that can drive with calculated precision and reduce this death toll. Building an autonomous driving system is an incredibly complex endeavor. In this assignment, you will focus on the sensing system, which allows us to track other cars based on noisy sensor readings.

Fault Diagnosis for Compensating Capacitors of Jointless Track Circuit Based on Dynamic Time Warping

Fault Diagnosis for Compensating Capacitors of Jointless Track Circuit Based on Dynamic Time Warping

Pavement structural optimization based on multiaxial Mohr-Coulomb yield criterion and its case study on Chongqing test track

基于多轴摩尔-库伦屈服准则的路面结构优化及重庆环岛案例分析，刘婉秋，赵延庆，路面结构的力学分析是经济有效的路面结构的设计和破坏预测途径。由于数值模拟的精度不高以及缺乏有效的验证手段使其在工程实际中

Efficiency and Privacy Enhancement for a Track and Trace System of RFID-based Supply Chains

Efficiency and Privacy Enhancement for a Track and Trace System of RFID-based Supply Chains

Camera Path Animator v3.5c.zip

在Editor里面直接建立，编辑与预览摄影机的路径是这个插件的最主要功能。 Animate a Camera or GameObject in Unity with ease and no need to touch code Perfect for creating cutscenes, architectural visualisations, fly throughs and cinematics Preview your camera animation within the Unity editor, no need to press play Custom made GUI to assist you creating your camera/gameobject animation Powerful implementation of Bezier and Hermite curves, fully normalised for complete control. Suitable for mobile and 2D Includes an integrated C# event system Multiple modes including mouse look, track target, loop, ping pong Mature, stable codebase. No DLLs, full source included The package provides you with all the tools to build, edit, and preview the animation spline within the editor.

Web Data Mining and the Development of Knowledge-Based Decision Systems2017

This book presents recent investigations and enhancements in the field of Decision Support Systems, Web Data Mining, web engineering, with specific emphasis on development of Decision Support Sys- tems based on web applications. Today, web is a major information resource and is becoming an obvious automated tool in various applications. Due to increased growth and popularity of WWW, one needs to be very cautious in designing the website as per standard and norms. An estimated 90% of websites from projected growth of 196 million websites severely suffered with usability and accessibility issues. Web Engineering must be explored in a systematic, disciplined way for development, operation and mainte- nance of web based applications using certain guidelines. The data on World Wide Web are available in three different formats: web content, web structure and web usage. Web mining is usually defined as the use of data mining techniques to automatically discover and extract information from web documents and services. Web mining is the application of data mining techniques to extract knowledge from web data, i.e. web content, web structure, and web usage data. A decision support system is a computer-based information system that supports business and organizational decision-making activities. The book comprises of the ideas of various researchers, scholars, website design experts and others to develop and evaluate decision support systems based on web data mining. Web Data Mining focuses on Web content which includes text, HTML pages, images, audio, videos etc. Also Web Data Mining investigates the linkages and relationships among web pages based on website structure. Further Web Data Mining extracts web data by web server to track various types of transactions through website and web usage is mainly focuses for decision making. The book is organized in five sections that cover the main concepts and studies for the development of decision support system through web data mining. The Section 1 consists of chapters which describe the development of decision support systems. The Section 2 deals with development of web mining systems. The Section 3 covers details about the development of knowledge based systems from web mining process. The Section 4 provides research insights of various authors about mining aspects of social media, graph mining techniques and aspects of social network web mining. Finally, Section 5 introduces the importance of data mining and text mining aspects of various authors’ contributions. The present book is an attempt to investigate various solutions for the development of decision support systems through web data mining. In this book, all areas of web data mining, decision support systems, knowledge based systems, social media mining and text mining are thoroughly discussed for finding desired solutions for the web data mining and the development of deci- sion support systems for knowledge representation. The book is a step forward towards presenting recent studies for decision support systems and web data mining and serves the purpose for the present trend in web engineering. Hence the book focuses important aspects of web designing process to improve the business intelligence through web mining.

Modern Operating System 2nd 现代操作系统第二版 英文原版

Modern Operating System 2nd 现代操作系统第二版 英文原版 PREFACE 1 INTRODUCTION 1.1 WHAT IS AN OPERATING SYSTEM? 1.1.1 The Operating System as an Extended Machine 1.1.2 The Operating System as a Resource Manager 1.2 HISTORY OF OPERATING SYSTEMS 1.2.1 The First Generation (1945-55) Vacuum Tubes and Plugboards 1.2.2 The Second Generation (1955-65) Transistors and Batch Systems 1.2.3 The Third Generation (1965-1980) ICs and Multiprogramming 1.2.4 The Fourth Generation (1980-Present) Personal Computers 1.2.5 Ontogeny Recapitulates Phytogeny 1.3 THE OPERATING SYSTEM ZOO 1.3.1 Mainframe Operating Systems 1.3.2 Server Operating Systems 1.3.3 Multiprocessor Operating Systems 1.3.4 Personal Computer Operating Systems 1.3.5 Real-Time Operating Systems 1.3.6 Embedded Operating Systems 1.3.7 Smart Card Operating Systems 1.4 COMPUTER HARDWARE REVIEW 1.4.1 Processors 1.4.2 Memory 1.4.3 I/O Devices 1.4.4 Buses 1.5 OPERATING SYSTEM CONCEPTS 1.5.1 Processes 1.5.3 Memory Management 1.5.4 Input/Output 1.5.5 Files 1.5.6 Security 1.5.8 Recycling of Concepts 1.6 SYSTEM CALLS 1.6.1 System Calls for Process Management 1.6.2 System Calls for File Management 1.6.3 System Calls for Directory Management 1.6.4 Miscellaneous System Calls 1.6.5 The Windows Win32 API 1.7 OPERATING SYSTEM STRUCTURE 1.7.1 Monolithic Systems 1.7.2 Layered Systems 1.7.3 Virtual Machines 1.7.4 Exokernels 1.7.5 Client-Server Model 1.8 RESEARCH ON OPERATING SYSTEMS 1.9 OUTLINE OF THE REST OF THIS BOOK 1.10 METRIC UNITS 1.11 SUMMARY 2 PROCESSES AND THREADS 2.1 PROCESSES 2.1.1 The Process Model 2.1.2 Process Creation 2.1.3 Process Termination 2.1.4 Process Hierarchies 2.1.5 Process States 2.1.6 Implementation of Processes 2.2 THREADS 2.2.1 The Thread Model 2.2.2 Thread Usage 2.2.3 Implementing Threads in User Space 2.2.4 Implementing Threads in the Kernel 2.2.5 Hybrid Implementations 2.2.6 Scheduler Activations 2.2.7 Pop-Up Threads 2.2.8 Making Single-Threaded Code Multithreaded 2.3 INTERPROCESS COMMUNICATION 2.3.1 Race Conditions 2.3.2 Critical Regions 2.3.3 Mutual Exclusion with Busy Waiting Disabling Interrupts Lock Variables Strict Alternation Peterson’s Solution The TSL Instruction 2.3.4 Sleep and Wakeup The Producer-Consumer Problem 2.3.5 Semaphores Solving the Producer-Consumer Problem using Semaphores 2.3.6 Mutexes 2.3.7 Monitors 2.3.8 Message Passing Design Issues for Message Passing Systems The Producer-Consumer Problem with Message Passing 2.3.9 Barriers 2.4 CLASSICAL IPC PROBLEMS 2.4.1 The Dining Philosophers Problem 2.4.2 The Readers and Writers Problem 2.4.3 The Sleeping Barber Problem 2.5 SCHEDULING 2.5.1 Introduction to Scheduling Process Behavior When to Schedule Categories of Scheduling Algorithms Scheduling Algorithm Goals 2.5.2 Scheduling in Batch Systems First-Come First-Served Shortest Job First Shortest Remaining Time Next Three-Level Scheduling 2.5.3 Scheduling in Interactive Systems Round-Robin Scheduling Priority Scheduling Multiple Queues Shortest Process Next Guaranteed Scheduling Lottery Scheduling Fair-Share Scheduling 2.5.4 Scheduling in Real-Time Systems 2.5.5 Policy versus Mechanism 2.5.6 Thread Scheduling 2.6 RESEARCH ON PROCESSES AND THREADS 2.7 SUMMARY 3 DEADLOCKS 3.1 RESOURCES 3.1.1 Preemptable and Nonpreemptable Resources 3.1.2 Resource Acquisition 3.2 INTRODUCTION TO DEADLOCKS 3.2.1 Conditions for Deadlock 3.2.2 Deadlock Modeling 3.3 THE OSTRICH ALGORITHM 3.4 DEADLOCK DETECTION AND RECOVERY 3.4.1 Deadlock Detection with One Resource of Each Type 3.4.2 Deadlock Detection with Multiple Resource of Each Type 3.4.3 Recovery from Deadlock Recovery through Preemption Recovery through Rollback Recovery through Killing Processes 3.5 DEADLOCK AVOIDANCE 3.5.1 Resource Trajectories 3.5.2 Safe and Unsafe States 3.5.3 The Banker’s Algorithm for a Single Resource 3.5.4 The Banker’s Algorithm for Multiple Resources 3.6 DEADLOCK PREVENTION 3.6.1 Attacking the Mutual Exclusion Condition 3.6.2 Attacking the Hold and Wait Condition 3.6.3 Attacking the No Preemption Condition 3.6.4 Attacking the Circular Wait Condition 3.7 OTHER ISSUES 3.7.1 Two-Phase Locking 3.7.2 Nonresource Deadlocks 3.7.3 Starvation 3.8 RESEARCH ON DEADLOCKS 3.9 SUMMARY 4 MEMORY MANAGEMENT 4.1 BASIC MEMORY MANAGEMENT 4.1.1 Monoprogramming without Swapping or Paging 4.1.2 Multiprogramming with Fixed Partitions 4.1.3 Modeling Multiprogramming 4.1.4 Analysis of Multiprogramming System Performance 4.1.5 Relocation and Protection 4.2 SWAPPING 4.2.1 Memory Management with Bitmaps 4.2.2 Memory Management with Linked Lists 4.3 VIRTUAL MEMORY 4.3.1 Paging 4.3.2 Page Tables Multilevel Page Tables Structure of a Page Table Entry 4.3.3 TLBs—Translation Lookaside Buffers Software TLB Management 4.3.4 Inverted Page Tables 4.4 PAGE REPLACEMENT ALGORITHMS 4.4.1 The Optimal Page Replacement Algorithm 4.4.2 The Not Recently Used Page Replacement Algorithm 4.4.3 The First-In, First-Out (FIFO) Page Replacement Algorithm 4.4.4 The Second Chance Page Replacement Algorithm 4.4.5 The Clock Page Replacement Algorithm 4.4.6 The Least Recently Used (LRU) Page Replacement Algorithm 4.4.7 Simulating LRU in Software 4.4.8 The Working Set Page Replacement Algorithm 4.4.9 The WSClock Page Replacement Algorithm 4.4.10 Summary of Page Replacement Algorithms 4.5 MODELING PAGE REPLACEMENT ALGORITHMS 4.5.1 Belady’s Anomaly 4.5.2 Stack Algorithms 4.5.3 The Distance String 4.5.4 Predicting Page Fault Rates 4.6 DESIGN ISSUES FOR PAGING SYSTEMS 4.6.1 Local versus Global Allocation Policies 4.6.2 Load Control 4.6.3 Page Size 4.6.4 Separate Instruction and Data Spaces 4.6.5 Shared Pages 4.6.6 Cleaning Policy 4.6.7 Virtual Memory Interface 4.7 IMPLEMENTATION ISSUES 4.7.1 Operating System Involvement with Paging 4.7.2 Page Fault Handling 4.7.3 Instruction Backup 4.7.4 Locking Pages in Memory 4.7.5 Backing Store 4.7.6 Separation of Policy and Mechanism 4.8 SEGMENTATION 4.8.1 Implementation of Pure Segmentation 4.8.2 Segmentation with Paging: MULTICS 4.8.3 Segmentation with Paging: The Intel Pentium 4.9 RESEARCH ON MEMORY MANAGEMENT 4.10 SUMMARY 5 INPUT/OUTPUT 5.1 PRINCIPLES OF I/O HARDWARE 5.1.1 I/O Devices 5.1.2 Device Controllers 5.1.3 Memory-Mapped I/O 5.1.4 Direct Memory Access (DMA) 5.1.5 Interrupts Revisited 5.2 PRINCIPLES OF I/O SOFTWARE 5.2.1 Goals of the I/O Software 5.2.2 Programmed I/O 5.2.3 Interrupt-Driven I/O 5.2.4 I/O Using DMA 5.3 I/O SOFTWARE LAYERS 5.3.1 Interrupt Handlers 5.3.2 Device Drivers 5.3.3 Device-Independent I/O Software Uniform Interfacing for Device Drivers Buffering Error Reporting Allocating and Releasing Dedicated Devices Device-Independent Block Size 5.3.4 User-Space I/O Software 5.4 DISKS 5.4.1 Disk Hardware Magnetic Disks RAID CD-ROMs CD-Recordables CD-Rewritables DVD 5.4.2 Disk Formatting 5.4.3 Disk Arm Scheduling Algorithms 5.4.4 Error Handling 5.4.5 Stable Storage 5.5 CLOCKS 5.5.1 Clock Hardware 5.5.2 Clock Software 5.5.3 Soft Timers 5.6 CHARACTER-ORIENTED TERMINALS 5.6.1 RS-232 Terminal Hardware 5.6.2 Input Software 5.6.3 Output Software 5.7 GRAPHICAL USER INTERFACES 5.7.1 Personal Computer Keyboard, Mouse, and Display Hardware 5.7.2 Input Software 5.7.3 Output Software for Windows BitMaps Fonts 5.8 NETWORK TERMINALS 5.8.1 The X Window System 5.8.2 The SLIM Network Terminal 5.9 POWER MANAGEMENT 5.9.1 Hardware Issues 5.9.2 Operating System Issues The Display The Hard Disk The CPU The Memory Wireless Communication Thermal Management Battery Management Driver Interface 5.9.3 Degraded Operation 5.10 RESEARCH ON INPUT/OUTPUT 5.11 SUMMARY 6 FILE SYSTEMS 6.1 FILES 6.1.1 File Naming 6.1.2 File Structure 6.1.3 File Types 6.1.4 File Access 6.1.5 File Attributes 6.1.6 File Operations 6.1.7 An Example Program Using File System Calls 6.1.8 Memory-Mapped Files 6.2 DIRECTORIES 6.2.1 Single-Level Directory Systems 6.2.2 Two-level Directory Systems 6.2.3 Hierarchical Directory Systems 6.2.4 Path Names 6.2.5 Directory Operations 6.3 FILE SYSTEM IMPLEMENTATION 6.3.1 File System Layout 6.3.2 Implementing Files Contiguous Allocation Linked List Allocation Linked List Allocation Using a Table in Memory I-nodes 6.3.3 Implementing Directories 6.3.4 Shared Files 6.3.5 Disk Space Management Block Size Keeping Track of Free Blocks Disk Quotas 6.3.6 File System Reliability Backups File System Consistency 6.3.7 File System Performance Caching Block Read Ahead Reducing Disk Arm Motion 6.3.8 Log-Structured File Systems 6.4 EXAMPLE FILE SYSTEMS 6.4.1 CD-ROM File Systems The ISO 9660 File System Rock Ridge Extensions Joliet Extensions 6.4.2 The CP/M File System 6.4.3 The MS-DOS File System 6.4.4 The Windows 98 File System 6.4.5 The UNIX V7 File System 6.5 RESEARCH ON FILE SYSTEMS 6.6 SUMMARY 7 MULTIMEDIA OPERATING SYSTEMS 7.1 INTRODUCTION TO MULTIMEDIA 7.2 MULTIMEDIA FILES 7.2.1 Audio Encoding 7.2.2 Video Encoding 7.3 VIDEO COMPRESSION 7.3.1 The JPEG Standard 7.3.2 The MPEG Standard 7.4 MULTIMEDIA PROCESS SCHEDULING 7.4.1 Scheduling Homogeneous Processes 7.4.2 General Real-Time Scheduling 7.4.3 Rate Monotonic Scheduling 7.4.4 Earliest Deadline First Scheduling 7.5 MULTIMEDIA FILE SYSTEM PARADIGMS 7.5.1 VCR Control Functions 7.5.2 Near Video on Demand 7.5.3 Near Video on Demand with VCR Functions 7.6 FILE PLACEMENT 7.6.1 Placing a File on a Single Disk 7.6.2 Two Alternative File Organization Strategies 7.6.3 Placing Files for Near Video on Demand 7.6.4 Placing Multiple Files on a Single Disk 7.6.5 Placing Files on Multiple Disks 7.7 CACHING 7.7.1 Block Caching 7.7.2 File Caching 7.8 DISK SCHEDULING FOR MULTIMEDIA 7.8.1 Static Disk Scheduling 7.8.2 Dynamic Disk Scheduling 7.9 RESEARCH ON MULTIMEDIA 7.10 SUMMARY 8 MULTIPLE PROCESSOR SYSTEMS 8.1 MULTIPROCESSORS 8.1.1 Multiprocessor Hardware UMA Bus-Based SMP Architectures UMA Multiprocessors Using Crossbar Switches UMA Multiprocessors Using Multistage Switching Networks NUMA Multiprocessors 8.1.2 Multiprocessor Operating System Types Each CPU Has Its Own Operating System Master-Slave Multiprocessors Symmetric Multiprocessors 8.1.3 Multiprocessor Synchronization Spinning versus Switching 8.1.4 Multiprocessor Scheduling Timesharing Space Sharing Gang Scheduling 8.2 MULTICOMPUTERS 8.2.1 Multicomputer Hardware Interconnection Technology Network Interfaces 8.2.2 Low-Level Communication Software Node to Network Interface Communication 8.2.3 User-Level Communication Software Send and Receive Blocking versus Nonblocking Calls 8.2.4 Remote Procedure Call Implementation Issues 8.2.5 Distributed Shared Memory Replication False Sharing Achieving Sequential Consistency 8.2.6 Multicomputer Scheduling 8.2.7 Load Balancing A Graph-Theoretic Deterministic Algorithm A Sender-Initiated Distributed Heuristic Algorithm A Receiver-Initialed Distributed Heuristic Algorithm A Bidding Algorithm 8.3 DISTRIBUTED SYSTEMS 8.3.1 Network Hardware Ethernet The Internet 8.3.2 Network Services and Protocols Network Services Network Protocols 8.3.3 Document-Based Middleware 8.3.4 File System-Based Middleware Transfer Model The Directory Hierarchy Naming Transparency Semantics of File Sharing AFS 8.3.5 Shared Object-Based Middleware CORBA Globe 8.3.6 Coordination-Based Middleware Linda Publish/Subscribe Jini 8.4 RESEARCH ON MULTIPLE PROCESSOR SYSTEMS 8.5 SUMMARY 9 SECURITY 9.1 THE SECURITY ENVIRONMENT 9.1.1 Threats 9.1.2 Intruders 9.1.3 Accidental Data Loss 9.2 BASICS OF CRYPTOGRAPHY 9.2.1 Secret-Key Cryptography 9.2.2 Public-Key Cryptography 9.2.3 One-Way Functions 9.2.4 Digital Signatures 9.3 USER AUTHENTICATION 9.3.1 Authentication Using Passwords How Crackers Break In UNIX Password Security Improving Password Security One-Time Passwords Challenge-Response Authentication 9.3.2 Authentication Using a Physical Object 9.3.3 Authentication Using Biometrics 9.3.4 Countermeasures 9.4 ATTACKS FROM INSIDE THE SYSTEM 9.4.1 Trojan Horses 9.4.2 Login Spoofing 9.4.3 Logic Bombs 9.4.4 Trap Doors 9.4.5 Buffer Overflow 9.4.6 Generic Security Attacks 9.4.7 Famous Security Flaws Famous Security Flaws in UNIX Famous Security Flaws in TENEX Famous Security Flaws in OS/360 9.4.8 Design Principles for Security 9.5 ATTACKS FROM OUTSIDE THE SYSTEM 9.5.1 Virus Damage Scenarios 9.5.2 How Viruses Work Companion Viruses Executable Program Viruses Memory Resident Viruses Boot Sector Viruses Device Driver Viruses Macro Viruses Source Code Viruses 9.5.3 How Viruses Spread 9.5.4 Antivirus and Anti-Antivirus Techniques Virus Scanners Integrity Checkers Behavioral Checkers Virus Avoidance Recovery from a Virus Attack 9.5.5 The Internet Worm 9.5.6 Mobile Code Sandboxing Interpretation Code signing 9.5.7 Java Security 9.6 PROTECTION MECHANISMS 9.6.1 Protection Domains 9.6.2 Access Control Lists 9.6.3 Capabilities 9.7 TRUSTED SYSTEMS 9.7.1 Trusted Computing Base 9.7.2 Formal Models of Secure Systems 9.7.3 Multilevel Security The Bell-La Padula Model The Biba Model 9.7.4 Orange Book Security 9.7.5 Covert Channels 9.8 RESEARCH ON SECURITY 9.9 SUMMARY 10 CASE STUDY 1: UNIX AND LINUX 10.1 HISTORY OF UNIX 10.1.1 UNICS 10.1.2 PDP-11 UNIX 10.1.3 Portable UNIX 10.1.4 Berkeley UNIX 10.1.5 Standard UNIX 10.1.6 MINIX 10.1.7 Linux 10.2 OVERVIEW OF UNIX 10.2.1 UNIX Goals 10.2.2 Interfaces to UNIX 10.2.3 The UNIX Shell 10.2.4 UNIX Utility Programs 10.2.5 Kernel Structure 10.3 PROCESSES IN UNIX 10.3.1 Fundamental Concepts 10.3.2 Process Management System Calls in UNIX Thread Management System Calls 10.3.3 Implementation of Processes in UNIX Threads in UNIX Threads in Linux Scheduling in UNIX Scheduling in Linux 10.3.4 Booting UNIX 10.4 MEMORY MANAGEMENT IN UNIX 10.4.1 Fundamental Concepts 10.4.2 Memory Management System Calls in UNIX 10.4.3 Implementation of Memory Management in UNIX Swapping Paging in UNIX The Page Replacement Algorithm Memory Management in Linux 10.5 INPUT/OUTPUT IN UNIX 10.5.1 Fundamental Concepts Networking 10.5.2 Input/Output System Calls in UNIX 10.5.3 Implementation of Input/Output in UNIX 10.5.4 Streams 10.6 THE UNIX FILE SYSTEM 10.6.1 Fundamental Concepts 10.6.2 File System Calls in UNIX 10.6.3 Implementation of the UNIX File System The Berkeley Fast File System The Linux File System 10.6.4 NFS: The Network File System NFS Architecture NFS Protocols NFS Implementation 10.7 SECURITY IN UNIX 10.7.1 Fundamental Concepts 10.7.2 Security System Calls in UNIX 10.7.3 Implementation of Security in UNIX 10.8 SUMMARY 11 CASE STUDY 2: WINDOWS 2000 11.1 HISTORY OF WINDOWS 2000 11.1.1 MS-DOS 11.1.2 Windows 95/98/Me 11.1.3 Windows NT 11.1.4 Windows 2000 11.2 PROGRAMMING WINDOWS 2000 11.2.1 The Win32 Application Programming Interface 11.2.2 The Registry 11.3 SYSTEM STRUCTURE 11.3.1 Operating System Structure The Hardware Abstraction Layer The Kernel Layer The Executive The Device Drivers 11.3.2 Implementation of Objects The Object Name Space 11.3.3 Environment Subsystems 11.4 PROCESSES AND THREADS IN WINDOWS 2000 11.4.1 Fundamental Concepts 11.4.2 Job, Process, Thread and Fiber Management API Calls Interprocess Communication 11.4.3 Implementation of Processes and Threads Scheduling 11.4.4 MS-DOS Emulation 11.4.5 Booting Windows 2000 11.5 MEMORY MANAGEMENT 11.5.1 Fundamental Concepts 11.5.2 Memory Management System Calls 11.5.3 Implementation of Memory Management Page Fault Handling The Page Replacement Algorithm Physical Memory Management 11.6 INPUT/OUTPUT IN WINDOWS 2000 11.6.1 Fundamental Concepts 11.6.2 Input/Output API Calls 11.6.3 Implementation of I/O 11.6.4 Device Drivers 11.7 THE WINDOWS 2000 FILE SYSTEM 11.7.1 Fundamental Concepts 11.7.2 File System API Calls in Windows 2000 11.7.3 Implementation of the Windows 2000 File System File System Structure File Name Lookup File Compression File Encryption 11.8 SECURITY IN WINDOWS 2000 11.8.1 Fundamental Concepts 11.8.2 Security API Calls 11.8.3 Implementation of Security 11.9 CACHING IN WINDOWS 2000 11.10 SUMMARY 12 OPERATING SYSTEM DESIGN 12.1 THE NATURE OF THE DESIGN PROBLEM 12.1.1 Goals 12.1.2 Why is it Hard to Design an Operating System? 12.2 INTERFACE DESIGN 12.2.1 Guiding Principles Principle 1: Simplicity Principle 2: Completeness Principle 3: Efficiency 12.2.2 Paradigms User Interface Paradigms Execution Paradigms Data Paradigms 12.2.3 The System Call Interface 12.3 IMPLEMENTATION 12.3.1 System Structure Layered Systems Exokernels Client-Server Systems Extensible Systems Kernel Threads 12.3.2 Mechanism versus Policy 12.3.3 Orthogonality 12.3.4 Naming 12.3.5 Binding Time 12.3.6 Static versus Dynamic Structures 12.3.7 Top-Down versus Bottom-Up Implementation 12.3.8 Useful Techniques Hiding the Hardware Indirection Reusability Reentrancy Brute Force Check for Errors First 12.4 PERFORMANCE 12.4.1 Why Are Operating Systems Slow? 12.4.2 What Should Be Optimized? 12.4.3 Space-Time Trade-offs 12.4.4 Caching 12.4.5 Hints 12.4.6 Exploiting Locality 12.4.7 Optimize the Common Case 12.5 PROJECT MANAGEMENT 12.5.1 The Mythical Man Month 12.5.2 Team Structure 12.5.3 The Role of Experience 12.5.4 No Silver Bullet 12.6 TRENDS IN OPERATING SYSTEM DESIGN 12.6.1 Large Address Space Operating Systems 12.6.2 Networking 12.6.3 Parallel and Distributed Systems 12.6.4 Multimedia 12.6.5 Battery-Powered Computers 12.6.6 Embedded Systems 12.7 SUMMARY 13 READING LIST AND BIBLIOGRAPHY 13.1 SUGGESTIONS FOR FURTHER READING 13.1.1 Introduction and General Works 13.1.2 Processes and Threads 13.1.3 Deadlocks 13.1.4 Memory Management 13.1.5 Input/Output 13.1.6 File Systems 13.1.7 Multimedia Operating Systems 13.1.8 Multiple Processor Systems 13.1.9 Security 13.1.10 UNIX and Linux 13.1.11 Windows 2000 13.1.12 Design Principles 13.2 ALPHABETICAL BIBLIOGRAPHY ABOUT THE AUTHOR