Introduction to 3G Mobile Communications

Preface xv Acknowledgments xvii 1 Overview 1 1.1 History of Mobile Cellular Systems 1 1.1.1 First Generation 1 1.1.2 Second Generation 2 1.1.3 Generation 2.5 5 1.2 Overview of 3G 8 1.3 Proposals for 3G Standard 10 1.3.1 WCDMA 10 1.3.2 Advanced TDMA 11 1.3.3 Hybrid CDMA/TDMA 12 1.3.4 OFDM 12 1.3.5 IMT-2000 13 1.4 3GPP 14 1.4.1 TDD 15 1.4.2 TD-SCDMA 18 1.5 3GPP2 20 1.6 3G Evolution Paths 23 References 24 2 Principles of CDMA 25 2.1 Radio-Channel Access Schemes 25 2.2 Spread Spectrum 28 2.3 RAKE Receiver 32 2.4 Power Control 32 2.5 Handovers 37 2.5.1 Soft Handover 38 2.5.2 Relocation 41 2.5.3 Hard Handover 44 2.5.4 Intersystem Handovers 45 2.6 Multiuser Detection 47 References 48 v 3 WCDMA Air Interface: Physical Layer 49 3.1 General 49 3.1.1 Forward Error Correction Encoding/Decoding 52 3.1.2 Radio Measurements and Indications to Higher Layers 53 3.1.3 Macrodiversity Distribution/Combining and Soft Handover Execution 55 3.1.4 Error Detection on Transport Channels 56 3.1.5 Multiplexing of Transport Channels and Demultiplexing of CCTrCHs 57 3.1.6 Rate Matching 57 3.1.7 Mapping of CCTrCHs on Physical Channels 57 3.1.8 Modulation, Spreading/Demodulation, and Despreading of Physical Channels 58 3.1.9 Frequency and Time Synchronization 60 3.1.10 Inner-Loop Power Control 61 3.1.11 Power Weighting and Combining of Physical Channels 64 3.1.12 RF Processing 66 3.1.13 Timing Advance on Uplink Channels 69 3.1.14 Support of Uplink Synchronization 70 3.2 Channels 70 3.2.1 Logical Channels 71 3.2.2 Transport Channels 72 3.2.3 Physical Channels 74 3.2.4 Shared Channels 78 3.2.5 Channel Mapping 80 3.3 Spreading and Scrambling Codes 81 3.4 Diversity 83 3.4.1 Time Diversity 83 3.4.2 Multipath Diversity 84 3.4.3 Macrodiversity 85 3.4.4 Antenna Diversity 87 3.5 Transport Formats 92 3.6 Data Through Layer 1 97 References 99 4 Modulation Techniques and Spread Spectrum 101 4.1 Spreading Techniques 101 4.1.1 DS-CDMA 101 4.1.2 Frequency-Hopping CDMA 101 4.1.3 Time-Hopping CDMA 102 4.1.4 Multicarrier CDMA 102 4.2 Data Modulation 104 References 109 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s vi CONTENTS 5 Spreading Codes 111 5.1 Orthogonal Codes 112 5.2 PN Codes 114 5.3 Synchronization Codes 117 5.4 Autocorrelation and Cross-Correlation 118 5.5 Intercell Interference 119 References 119 6 Channel Coding 121 6.1 Coding Processes 121 6.2 Coding Theory 122 6.3 Block Codes 123 6.4 Convolutional Codes 125 6.5 Turbo Codes 127 6.6 Channel Coding in UTRAN 129 References 129 7 Wideband CDMA Air Interface: Protocol Stack 131 47.1 General Points 131 7.2 Control Plane 133 7.3 MAC 135 7.3.1 MAC Services 137 7.3.2 MAC Functions 137 7.3.3 TFC Selection 142 7.4 RLC 143 7.4.1 RLC Services 145 7.4.2 RLC Functions 147 7.5 RRC 148 7.5.1 RRC Services 148 7.5.2 RRC Functions 148 7.6 RRC Protocol States 183 7.7 Location Management in UTRAN 187 7.8 Core Network Protocols in the Air Interface 190 7.8.1 Circuit-Switched Core Network 190 7.8.2 Packet-Switched Core Network 195 7.9 User Plane 196 7.10 Packet Data Convergence Protocol 196 7.11 Broadcast/Multicast Control 198 7.12 Data Protocols 200 7.13 Dual-System Protocol Stack in UE 201 References 202 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s CONTENTS vii 8 Network 203 8.1 General Discussion 203 8.2 Evolution from GSM 204 8.3 UMTS Network Structure 206 8.4 Core Network 208 8.4.1 Mobile Switching Center 208 8.4.2 Visitor Location Register 209 8.4.3 Home Location Register 210 8.4.4 Equipment Identity Register 211 8.4.5 Authentication Center 212 8.4.6 Gateway MSC 212 8.4.7 Serving GPRS Support Node 212 8.4.8 Gateway GPRS Support Node 213 8.5 UMTS Terrestrial Radio Access Network 213 8.5.1 Radio Network Controller 214 8.5.2 Node B 215 8.6 GSM Radio Access Network 216 8.6.1 Base Station Controller 216 8.6.2 Base Transceiver Station 217 8.6.3 Small Base Transceiver Stations 218 8.7 Interfaces 221 8.7.1 A Interface 221 8.7.2 Gb Interface 222 8.7.3 Iu Interface 222 8.7.4 Iub Interface 226 8.7.5 Iur Interface 228 8.7.6 MAP Interfaces 230 8.8 Network Protocols 233 8.8.1 Asynchronous Transfer Mode 235 8.8.2 AAL2 and AAL5 235 8.8.3 Iu User Plane Protocol Layer 235 8.8.4 GPRS Tunnelling Protocol-User 236 8.8.5 SS7 MTP3-User Adaptation Layer 237 8.8.6 MAP (MAP-A Through MAP-M) 237 8.8.7 Message Transfer Part 237 8.8.8 Node B Application Part 237 8.8.9 Physical Layer (Below ATM) 238 8.8.10 Q.2150.1 239 8.8.11 Q.2630.1 239 8.8.12 Radio Access Network Application Part 239 8.8.13 Radio Network Subsystem Application Part 241 8.8.14 Signaling ATM Adaptation Layer 242 8.8.15 Service-Specific Coordination Function 242 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s 8.8.16 Service-Specific Connection-Oriented Protocol 242 8.8.17 Signaling Connection Control Part 243 8.8.18 Stream Control Transmission Protocol 243 8.8.19 UDP/IP 243 8.9 UMTS Network Evolution—Release 5 243 References 247 9 Network Planning 251 9.1 Importance of Network Planning 251 9.2 Differences Between TDMA and CDMA 251 9.3 Network Planning Terminology 255 9.4 Network Planning Process 256 9.4.1 Preparation Phase 256 9.4.2 Network Dimensioning 258 9.4.3 Detailed Radio-Network Planning 262 9.5 Network Planning in WCDMA 262 9.5.1 Pilot Pollution 263 9.5.2 SHO Parameters 263 9.5.3 HO Problems 263 9.5.4 Hierarchical Cells 264 9.5.5 Microcell Deployment 266 9.5.6 Picocell Deployment and Indoor Planning 267 9.5.7 Sectorization and Adaptive Antennas 269 9.5.8 Other Network Elements 271 9.6 Admission Control 272 9.7 Congestion Control 276 References 277 10 Network Management 279 10.1 Telecommunication-Management Architecture 279 10.1.1 Fault Management 280 10.1.2 Configuration Management 281 10.1.3 Performance Management 283 10.1.4 Roaming Management 284 10.1.5 Accounting Management 285 10.1.6 Subscription Management 285 10.1.7 QoS Management 286 10.1.8 User Equipment Management 286 10.1.9 Fraud Management 286 10.1.10 Security Management 287 10.1.11 Software Management 288 10.2 Charging 289 10.2.1 Charging of Circuit-Switched Services 291 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s CONTENTS ix 10.2.2 Charging of Packet-Switched Services 292 10.3 Billing 293 10.4 Service Providers Versus Operators 298 References 300 11 Procedures 303 11.1 RRC Connection Procedures 303 11.1.1 RRC Connection Establishment 304 11.1.2 Signaling Connection Establishment 304 11.1.3 RRC Connection Release 304 11.2 Radio Bearer Procedures 306 11.2.1 Radio Bearer Establishment 306 11.2.2 Radio Bearer Release 313 11.2.3 Radio Bearer Reconfiguration 315 11.2.4 Transport Channel Reconfiguration 315 11.2.5 Physical Channel Reconfiguration 317 11.2.6 Control of Requested QoS 319 11.3 Data Transmission 323 11.4 Handovers 329 11.4.1 Soft Handover 329 11.4.2 Hard Handover 330 11.4.3 Intersystem Handovers 332 11.5 Random Access Procedure 340 References 342 12 New Concepts in the UMTS Network 343 12.1 Location Services 343 12.1.1 Cell-Coverage-Based Method 345 12.1.2 Observed Time Difference of Arrival 346 12.1.3 Network-Assisted Global Positioning System 349 12.1.4 Other Methods 351 12.1.5 Comparison of Location Methods 352 12.1.6 Service Categories 354 12.2 High-Speed Downlink Packet Access 355 12.3 Multimedia Broadcast/Multicast Service 358 12.3.1 Broadcast Service 360 12.3.2 Multicast Service 360 12.4 Multimedia Messaging Service 361 12.4.1 The Service 361 12.4.2 MMS Elements 363 12.4.3 MMS Protocols 366 12.5 Supercharger 367 12.6 Prepaging 370 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s x CONTENTS TEAMFLY Team-Fly® 12.7 Gateway Location Register 374 12.8 Optimal Routing 378 12.9 Adaptive Multirate Codec 381 12.10 Support of Localized Service Area 384 12.11 Smart Antennas 386 References 392 13 3G Services 395 13.1 Service Categories 395 13.2 Teleservices 395 13.3 Bearer Services 397 13.4 Supplementary Services 399 13.5 Service Capabilities 399 13.6 QoS Classes 402 13.6.1 Conversational Real-Time Services 402 13.6.2 Interactive Services 403 13.6.3 Streaming Services 404 13.6.4 Background Services 405 13.6.5 QoS Service Classes and 3G Radio Interface 405 References 406 14 3G Applications 407 14.1 Justification for 3G 407 14.2 Path into the Market 409 14.3 Applications As Competition Tools 410 14.4 Application Technologies 411 14.4.1 Wireless Application Protocol 412 14.4.2 Java 412 14.4.3 BREW 412 14.4.4 Bluetooth 413 14.4.5 I-mode 413 14.4.6 Electronic Payment 413 14.4.7 IPv6 416 14.5 Multimedia 419 14.5.1 Application Types 419 14.5.2 Technical Problems 419 14.6 Traffic Characteristics of 3G Applications 422 14.7 M-commerce 424 14.8 Examples of 3G Applications 427 14.8.1 Voice 427 14.8.2 Messaging 428 14.8.3 Internet Access 429 14.8.4 Location-Based Applications 430 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s CONTENTS xi 14.8.5 Games 431 14.8.6 Advertising 432 14.8.7 Betting and Gambling 432 14.8.8 Dating Applications 433 14.8.9 Adult Entertainment 433 14.9 Terminals 434 14.9.1 Voice Terminals 435 14.9.2 Multimedia Terminals 436 14.9.3 Navigation Devices 436 14.9.4 Game Devices 437 14.9.5 Machine-to-Machine Devices 437 References 438 15 The Future 441 15.1 New Spectrum 441 15.2 Satellites 443 15.2.1 The Market for MSS Networks 443 15.2.2 Satellite Orbits 445 15.2.3 Examples of MSS Systems 447 15.2.4 Location in Satellite Systems 454 15.2.5 Restricted Coverage 456 15.2.6 Diversity 457 15.2.7 Satellite Paging 458 15.2.8 IMT-2000 Satellite Component 459 15.3 3G Upgrades 459 15.4 Downlink Bottleneck 461 15.4.1 TDD 461 15.4.2 HSDPA 462 15.4.3 WLAN Interworking 463 15.4.4 Variable Duplex Distance 466 15.4.5 Hierarchical Cell Structures 468 15.4.6 Comparing the Schemes 468 15.5 4G Vision 472 References 476 16 Specifications 479 16.1 Specification Process 480 16.2 Releases 482 16.3 3GPP Specifications 484 16.3.1 Series Numbering 484 16.3.2 Version Numbering 485 16.3.3 Backwards Compatibility 486 Reference 486 I n t r o d u c t i o n t o 3 G M o b i l e C o m m u n i c a t i o n s xii CONTENTS Appendix A: Cellular User Statistics 487 Appendix B: 3GPP Specifications 491 Appendix C: Useful Web Addresses 509 Appendix D: Nokia Communicator 513 Appendix E: Standardization Organizations and Industry Groups 515 About the Author 523 Index 525 I

立即下载

上传者： grasssu 时间： 2009-11-24

Location-cleaned全版本免越狱定位 包含13.4、13.5

1、运行会报毒，需关闭杀毒软件 2、需要其他版本驱动，可以下载后直接放在Drive中即可 3、非原创，侵权请知会 版本： 10.0、10.1、10.2、10.3 11.0、11.1、11.2、11.3、11.4 12.0、12.1、12.2、 13.0、13.2、13.2.3、13.3、13.4、13.4.1 13.5

立即下载

上传者： fj_enjoy 时间： 2020-09-24

location 10.3.rar

location 10.3.rar

立即下载

上传者： qq_20525235 时间： 2023-10-06

THE BOOST C++ LIBRARIES

THE BOOST C++ LIBRARIES是一份自己编译的chm格式文档，描述了如何使用boost类库，目录如下： Front page Chapter 1: Introduction 1.1 C++ and Boost 1.2 Development Process 1.3 Installation 1.4 Overview Chapter 2: Smart Pointers 2.1 General 2.2 RAII 2.3 Scoped Pointer 2.4 Scoped Array 2.5 Shared Pointer 2.6 Shared Array 2.7 Weak Pointer 2.8 Intrusive Pointer 2.9 Pointer Container 2.10 Exercises Chapter 3: Function Objects 3.1 General 3.2 Boost.Bind 3.3 Boost.Ref 3.4 Boost.Function 3.5 Boost.Lambda 3.6 Exercises Chapter 4: Event Handling 4.1 General 4.2 Signals 4.3 Connections 4.4 Exercises Chapter 5: String Handling 5.1 General 5.2 Locales 5.3 Boost.StringAlgorithms 5.4 Boost.Regex 5.5 Boost.Tokenizer 5.6 Boost.Format 5.7 Exercises Chapter 6: Multithreading 6.1 General 6.2 Thread Management 6.3 Synchronization 6.4 Thread Local Storage 6.5 Exercises Chapter 7: Asynchronous Input and Output 7.1 General 7.2 I/O Services and I/O Objects 7.3 Scalability and Multithreading 7.4 Network Programming 7.5 Developing Boost.Asio Extensions 7.6 Exercises Chapter 8: Interprocess Communication 8.1 General 8.2 Shared Memory 8.3 Managed Shared Memory 8.4 Synchronization 8.5 Exercises Chapter 9: Filesystem 9.1 General 9.2 Paths 9.3 Files and Directories 9.4 File Streams 9.5 Exercises Chapter 10: Date and Time 10.1 General 10.2 Calendar Dates 10.3 Location-independent Times 10.4 Location-dependent Times 10.5 Formatted Input and Output 10.6 Exercises Chapter 11: Serialization 11.1 General 11.2 Archive 11.3 Pointers and references 11.4 Serialization of class hierarchy objects 11.5 Wrapper functions for optimization 11.6 Exercises Chapter 12: Parser 12.1 General 12.2 Extended Backus-Naur Form 12.3 Grammar 12.4 Actions 12.5 Exercises Chapter 13: Containers 13.1 General 13.2 Boost.Array 13.3 Boost.Unordered 13.4 Boost.MultiIndex 13.5 Boost.Bimap 13.6 Exercises Chapter 14: Data Structures 14.1 General 14.2 Boost.Tuple 14.3 Boost.Any 14.4 Boost.Variant 14.5 Exercises Chapter 15: Error Handling 15.1 General 15.2 Boost.System 15.3 Boost.Exception Chapter 16: Cast Operators

立即下载

上传者： acejoy 时间： 2010-04-02

Location-cleaned14.4驱动

Location-cleaned14.4驱动，亲测可用。懂的都懂！

立即下载

上传者： mike3767 时间： 2021-02-05

drivers.zip

location-cleaned 8.0到13.4所有版本的驱动包。 包含8.0/8.1/8.2/8.3/8.4/9.0/9.1/9.2/9.3/10.0/10.1/10.2/10.3/11.0/11.1/11.2/11.3/11.4/11.4(15F79)/12.0(16A366)/12.1/12.2/12.4/13.3/13.4版本的驱动包

立即下载

上传者： a1669000102 时间： 2020-08-03

Location-cleaned。

Location-cleaned本体+8.0到13.4所有版本的驱动包。 包含8.0/8.1/8.2/8.3/8.4/9.0/9.1/9.2/9.3/10.0/10.1/10.2/10.3/11.0/11.1/11.2/11.3/11.4/11.4(15F79)/12.0(16A366)/12.1/12.2/12.4/13.3/13.4版本的驱动包

立即下载

上传者： a1669000102 时间： 2020-08-03

np难问题近似算法(绝版好书)

这本书在国内已经绝版。目录如下 Introduction Dorit S. Hochbaum 0.1 What can approximation algorithms do for you: an illustrative example 0.2 Fundamentals and concepts 0.3 Objectives and organization of this book 0.4 Acknowledgments I Approximation Algorithms for Scheduling Leslie A. Hall 1.1 Introduction 1.2 Sequencing with Release Dates to Minimize Lateness 1.2.1 Jacksons rule 1.2.2 A simple 3/2-approximation algorithm 1.2.3 A polynomial approximation scheme 1.2.4 Precedence constraints and preprocessing 1.3 Identical parallel machines: beyond list scheduling 1.3.1 P|rj,prec|Lmax:: list scheduling revisited 1.3.2 The LPT rule for P‖Cmax 1.3.3 The LPT rule for P|rj|Cmax 1.3.4 Other results for identical parallel machines 1.4 Unrelated parallel machines 1.4.1 A 2-approximation algorithm based on linear programming 1.4.2 An approximation algorithm for minimizing cost and makespan 1.4.3 A related result from network scheduling 1.5 Shop scheduling 1.5.1 A greedy 2-approximation algorithm for open shops 1.5.2 An algorithm with an absolute error bound 1.5.3 A 2 E -approximation algorithm for fixed job and flow shops 1.5.4 The general job shop: unit-time operations 1.6 Lower bounds on approximation for makespan scheduling 1.6.1 Identical parallel machines and precedence constraints 1.6.2 Unrelated parallel machines 1.6.3 Shop scheduling 1.7 Min-sum Objectives 1.7.1 Sequencing with release dates to minimize sum of completion times 1.7.2 Sequencing with precedence constraints 1.7.3 Unrelated parallel machines 1.8 Final remarks 2 Approximation Algorithms for Bin Packing: A Survey E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson 2.1 Introduction 2.2 Worst-case analysis 2.2.1 Next fit 2.2.2 First fit 2.2.3 Best fit, worst fit, and almost any fit algorithms 2.2.4 Bounded-space online algorithms 2.2.5 Arbitrary online algorithms 2.2.6 Semi-online algorithms 2.2.7 First fit decreasing and best fit decreasing 2.2.8 Other simple offline algorithms 2.2.9 Special-case optimality, approximation schemes, and asymptotically optimal algorithms 2.2.10 Other worst-case questions 2.3 Average-case analysis 2.3.1 Bounded-space online algorithms 2.3.2 Arbitrary online algorithms 2.3.3 Offiine algorithms 2.3.4 Other average-case questions 2.4 Conclusion Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems Dorit S. Hachbaum 3.1 Introduction 3.1.1 Definitions, formulations and applications 3.1.2 Lower bounds on approximations 3.1.3 Overview of chapter 3.2 The greedy algorithm for the set cover problem 3.3 The LP-algorithm for set cover 3.4 The feasible dual approach 3.5 Using other relaxations to derive dual feasible solutions 3.6 Approximating the multicoverproblem 3.7 The optimal dual approach for the vertex cover and independent set problems: preprocessing 3.7.1 The complexity of the LP-relaxation of vertex cover and independent set 3.7.2 Easily colorable graphs 3.7.3 A greedy algorithm for independent set in unweighted graphs 3.7.4 A local-ratio theorem and subgraph removal 3.7.5 Additional algorithms without preprocessing 3.7.6 Summary of approximations for vertex cover and independent set 3.8 Integer programming with two variables per inequality 3.8.1 The half integrality and the linear programming relaxation 3.8.2 Computing all approximate solution 3.8.3 The equivalence of IP2 to 2-SAT and 2-SAT to vertex cover 3.8.4 Properties of binary integer programs 3.8.5 Dual feasible solutions for IP2 3.9 The maximum coverage problem and the greedy 3.9.1 Tile greedy approach 3.9.2 Applications of the maxinmum coverage problem 4 The Primal-Dual Methud for Approximation Algorithms and Its Applicatiun to Network Design Problems Michel X. Goemans and David P. Williamson 4.1 Introduction 4.2 The classical primal-dual method 4.3 Thc primal-dual method Im approximation algorithms 4.4 A model of network design problems 4.4.1 0-I functions 4.5 Downwards monotone functions 4.5.1 The edge-covering problem 4.5.2 Lower capacitated partitioning problems 4.5.3 Location-design and location-routing problems 4.5.4 Proof of Theorems 4.5 and 4.6 4.6 0-1 proper functions 4.6.1 The generalized Sterner tree problem 4.6.2 The T-join problem 4.6.3 The minimum-weight perfect matching problem 4.6.4 Point-to-point connection problems 4.6.5 Exact partitioning problems 4.7 General proper functions 4.8 Extensions 4.8.1 Mininmm multicut in trees 4.8.2 The prize-collecting problems 4.8.3 Vertex connectivity problems 4.9 Conclusions 5 Cut Problems and Their Application to Divide-and-Conquer David B. Shmoys 5.1 Introduction 5.2 Minimum multicuts and maximum multicommodity flow 5.2.1 Multicuts, maximum multicommodity flow, and a weak duality theorem 5.2.2 Fractional multicuts, pipe systems, and a strong duality theorem 5.2.3 Solving the linear programs 5.2.4 Finding a good multicut 5.3 Sparsest cuts and maximum concurrent flow 5.3.1 The sparsest cut problem 5.3.2 Reducing the sparsest cut problem to the minimum multicut problem 5.3.3 Embeddings and the sparsest cut problem 5.3.4 Finding a good embedding 5.3.5 The maximum concurrent flow problem 5.4 Minimum feedback arc sets and related problems 5.4.1 An LP-based approximation algorithm 5.4.2 Analyzing the algorithm Feedback 5.4.3 Finding a good partition 5.5 Finding balanced cuts and other applications 5.5.1 Finding balanced cuts 5.5.2 Applications of balanced cut theorems 5.6 Conclusions Approximation Algorithms for Finding Highly Connected Suhgraphs Samir KhulJer 6.1 Introduction 6.1.1 Outline of chapter and techniques 6.2 Edge-connectivity problems 6.2.1 Weighted edge-connectivity 6.2.2 Unweighted edge-connectivity 6.3 Vertex-connectivity problems 6.3.1 Weighted vertex-connectivity 6.3.2 Unweighted vertex-connectivity 6.4 Strong-connectivity problems 6.4.1 Polynomial time approximation algorithms 6.4.2 Nearly linear-time implementation 6.5 Connectivity augmentation 6.5.1 increasing edge connectivity from I to 2 6.5.2 Increasing vertex connectivity from I to 2 6.5.3 Increasing edge-connectivity to 3. Algorithms for Finding Low Degree Structures Balaji Raghavachari 7.1 Introduction 7.2 Toughness and degree 7.3 Matchings and MDST 7.4 MDST within one of optimal 7.4.1 Witness sets 7.4.2 The △* 1 algorithm 7.4.3 Performance analysis 7.5 Local search techniques 7.5.1 MDST problem 7.5.2 Constrained forest problems 7.5.3 Two-connected subgraphs 7.6 Problems with edge weights - points in Euclidean spaces 7.7 Open problems 8 Approximation Algorithms for Geometric Problems Marshall Bern and David Eppstein 8.1 Introduction 8.1.1 Overview of topics 8.1.2 Special nature of geometric problems 8.2 Traveling salesman problem 8.2.1 Christofides algorithm 8.2.2 Heuristics 8.2.3 TSP with neighborhoods 8.3 Steiner tree problem 8.3.1 Steiner ratios 8.3.2 Better approximations 8.4 Minimum weight triangulation 8.4.1 Triangulation without Steiner points 8.4.2 Steiner triangulation 8.5 Clustering 8.5.1 Minmax k-clustering 8.5.2 k-minimum spanning tree 8.6 Separation problems 8.6.1 Polygon separation 8.6.2 Polyhedron separation 8.6.3 Point set separation 8.7 Odds and ends 8.7.1 Covering orthogonal polygons by rectangles 8.7.2 Packing squares with fixed comers 8.7.3 Largest congruent subsets 8.7.4 Polygon bisection 8.7.5 Graph embedding 8.7.6 Low-degree spanning trees 8.7.7 Shortest paths in space 8.7.8 Longest subgraph problems 8.8 Conclusions 9 Various Notions of Approximations: Good, Better, Best, and More Dorit S. Hochbaum 9.1 Introduction 9.1.1 Overview of chapter 9.2 Good: fixed constant approximations 9.2.1 The weighted undirected vertex feedback set problem 9.2.2 The shortest superstring problem 9.2.3 How maximization versus minimization affects approximations 9.3 Better: approximation schemes 9.3.1 A fully polynomial approximation scheme for the knapsack problem 9.3.2 The minimum makespan and the technique of dual approximations 9.3.3 Geometric packing and covering--the shifting technique 9.4 Best: unless NP = P 9.4.1 The k-center problem 9.4.2 A powerful approximation technique for bottleneck problems 9.4.3 Best possible parallel approximation algorithms 9.5 Better than best 9.5.1 A FPAS for bin packing 9.5.2 A 9/8-approximation algorithm for ~dge coloring of multigraphs and beyond 9.6 Wonderful: within one unit of optimum 10 Hardness of Approximations San jeer Arora and Carsten Lund 10.1 Introduction 10.2 How to prove inapproximability results 10.2.1 The canonical problems 10.2.2 Inapproximability results for the canonical problems 10.2.3 Gap preserving reductions 10.3 Inapproximability results for problems in class I 10.3.1 Max-SNP 10.4 Inapproximability results for problems in class II 10.4.1 SETCOVER 10.5 Inapproximability results lor problems in class 111 10.5.1 LABELCOVER maximization version ,. 10.5.2 LABELCOVER mtn version 10.5.3 Nearest lattice vector problem 10.6 Inapproximability results for problems in class IV 10.6.1 CLIQUE 10.6.2 COLORING 10.7 Inapproximability results at a glance 10.7.1 How to prove other hardness results: a case study 10.8 prohabilistically checkable proofs and inapproximability 10.8.1 The PCP theorem 10.8.2 Connection to inapproximability of MAX-3SAT 10.8.3 Where the gap comes from 10.9 Open problems 10.10 Chapter notes 11 Randomized Approximation Algorithms in Combinatorial Optimization Rajeev Motwani, Joseph Seffi Naor, and Prabhakar Raghavan 11.1 Introduction 11.2 Rounding linear programs 11.2.1 The integer multicommodity flow problem 11.2.2 Covering and packing problems 11.2.3 The maximum satisfiability problem 11.2.4 Related work 11.3 Semidefinite programming 11.3.1 The maximum cut problem 11.3.2 The graph coloring problem 11.4 Concluding remarks 11.4.1 Derandomizafion and parallelization 11.4.2 Computational experience 11.4.3 Open problems 12 The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration Mark Jerrum and Alistair Sinclair 12.1 Introduction 12.2 An illustrative example 12.3 Two techniques for bounding the mixing time 12.3.1 Canonical paths 12.3.2 Conductance 12.4 A more complex example: monomer-dimer systems 12.5 More applications 12.5.1 The permanent 12.5.2 Volume of convex bodies 12.5.3 Statistical physics 12.5.4 Matroid bases: an open problem 12.6 The Metropolis algorithm and simulated annealing Appendix 13 Online Computation Sandy Irani and Anna R. Karlin 13.1 Introduction 13.2 Three examples of competitive analysis 13.2.1 Paging 13.2.2 The k-server problem 13.2.3 Metrical task systems 13.3 Theoretical underpinnings: deterministic algorithms 13.3.1 Lower bounds 13.3.2 Design principles 13.3.3 Bounding competitiveness 13.4 Theoretical underpinnings: randomized algorithms 13.4.1 Example: paging 13.4.2 Lower bounds 13.4.3 The relationships between the adversaries 13.5 The k-server problem revisited 13.5.1 History. 13.5.2 Notation and properties of work functions. 13.5.3 The work function algorithm WFA 13.5.4 Proof of 2k - 1 -competitiveness 13.5.5 The duality lemma 13.5.6 The potential function 13.5.7 Quasi-convexity and the duality lemma 13.6 Online load balancing and virtual circuit routing 13.6.1 Load balancing on unrelated machines 13.6.2 Online virtual circuit routing 13.6.3 Recent results 13.7 Variants of competitive analysis 13.8 Conclusions and directions for future research Glossary of Problems Index

立即下载

上传者： dragonxin28 时间： 2010-12-22

delphixe10app实现当前位置定位

在delphixe10平台上开发，实现app端的实时位置定位查询。

立即下载

上传者： weixin_39984244 时间： 2018-12-21

MlSkin 4.3 Delphi 10.3

MLSkin is a skin component under Delphi, inherited based on Delphi standard components, and extends a lot of practical attribute functions for developers to call; in use, there is little difference between the standard VCL components, but the display style is very different, it can easily achieve the effect like QQ skin, and want to change the display The style you want to do is just to reload a picture; most of the components in it can be used alone, without the need to rely on the skin of the form, the display effect can be customized, very flexible; the current set of skin components provides more than 50 common components, more than 20 practical Demo, can be very convenient and quick implementation of you The effect you want. Website http://www.pngui.com/filedownload Feature: Support one touch skin, you can set the picture and color into the background of the form. The hue, saturation and brightness of the skin can be adjusted arbitrarily. The original picture resource management library can quickly and conveniently manage the pictures needed in the program. The unique image resource attribute supports the direct use of the detailed path of picture ID or local image file to call image resources. Easy to achieve the shadow of the form, the shape of the special form effect, simple to only need to set up two pictures. You can add any number of pictures, buttons and text on the form title bar. Memo, Edit, ListView and other components support transparent background, the border effect can be customized, add the commonly used search box and password input box. Redefined Toolbar, showing very beautiful style, and supporting horizontal and vertical display. Menu beautification, transparent effect, as long as you set up a picture, you can make your menu style different. You can display MainMenu on the title bar and display the location that you can customize. Almost all components can set their display styles individually, and most of the container components can set their Alpha values. It contains several components missing from standard VCL components: ColorButton, SwitchButton, and so on. It provides 20 practical Demo. By learning them, you can quickly make a cool program interface.

立即下载

上传者： emersontjf 时间： 2020-03-22

nginx搭建配置详细说明

1. Nginx简介 1.1. 什么是nginx 1.2. Nginx的优点 1.3. 哪里使用到nginx 1.4. Nginx和Apache的区别 2. 安装Nginx服务器 2.1. 在windows上安装 2.2. 在Linux上安装 2.2.1. 写在前面 2.2.2. 准备使用yum安装nginx的运行环境 2.2.3. 安装pcre 2.2.4. 安装zlib库 2.2.5. 安装nginx 2.2.6. 控制nginx 2.2.7. nginx安装服务 3. Nginx的配置文件详解 3.1. Nginx的主配置文件概述 3.1.1. 认识配置文件 3.1.2. nginx的配置文件结构 3.1.3. nginx的全局配置 3.2. events配置 3.3. http的配置 3.4. nginx重要指令之location 4. nginx中的rewrite 4.1. 什么是rewrite 4.2. rewrite的命令的作用域和优先级 4.3. if指令 4.3.1. if指令的语法 4.3.2. if指令中使用的逻辑运算符 4.3.3. If指令中可以使用的变量 4.3.4. if指令实例 4.4. rewrite指令 4.4.1. rewrite指令语法 4.4.2. flag标记 4.4.3. set指令 4.4.4. return指令 4.4.5. rewrite实例 5. nginx的虚拟主机 5.1. 什么是nginx的虚拟主机 5.2. 标准的虚拟主机配置 5.3. 规划虚拟主机的配置文件 6. 动静分离 7. nginx的反向代理 7.1. 什么是反向代理 7.2. 明确两个概念 7.3. 特点 7.4. 反向代理的配置 7.5. 可以将代理配置单独放在一个配置文件中 8. nginx的负载均衡(自学) 8.1. 什么是负载均衡 8.2. 负载均衡的优点 8.3. 负载均衡的分配策略 8.4. 负载均衡配置 9. 安装PHP 10. PHP-FPM 10.1. 什么是PHP-FPM 10.2. 为什么要是使用PHP-FPM 10.3. 安装并且启动PHP-FPM 10.3.1. 安装 10.3.2. fpm的配置 10.3.3. 启动和停止 10.3.4. 自启动php-fpm 10.3.5. 检查php-fpm是否启动 10.4. nginx使用php-fpm处理php

立即下载

上传者： csdn_wangchong 时间： 2018-03-17

华为EPON型号5680T下挂5620E的资料

这里是华为的EPON资料,OLT是5680T,下挂设备是5620E,可以进行网管,可以单机配置,也可以通过网管配置,而813e、815e只能在网管上看到，却不能在网管上配置，只能通过单机配置。

立即下载

上传者： zzfcnc 时间： 2010-01-30

百度大牛深度剖析Android10大框架

百度大牛深度剖析Android10大框架

立即下载

上传者： u013546588 时间： 2018-12-14

iOS_11.2 (15C5092b)_DeveloperDiskImage(11.2以下都可使用)

iOS 11.2 (15C5092b)模拟器镜像文件，iOS 11.2及以下都可以使用

立即下载

上传者： a44496913 时间： 2017-11-03

Artech House - SMS and MMS Interworking in Mobile Networks

Introduction xiii CHAPTER 1 Standard Procedures for SMS in GSM Networks 1 1.1 GSM Network Architecture and Principle of the SMS Procedure 1 1.2 Implementation of SMS Services 3 1.2.1 SMS-MO Implementation 3 1.2.2 The SMS-MT Implementation 6 1.2.3 Sending Commands to the SMSC 14 1.2.4 Addressing the Foreign Network HLRs for SMS-MT 15 1.2.5 Summary of the Network Equipment Model for SMS 16 1.3 MAP Dialogue Models at the Application Level 16 1.3.1 Request and CNF (Simple) Dialogue 17 1.3.2 Concatenated SMS Dialogue: More Message to Send 17 1.3.3 Update Location Dialogue 17 1.3.4 Send Routing Information for SM Dialogue 18 1.4 SCCP Addresses: The Tool for Flexible International Roaming 18 1.5 Mobility Procedures 19 1.5.1 Update Location Procedure 20 1.5.2 Making a Telephone Call to a Mobile 22 1.6 GPRS Procedures: The Gc Interface 23 1.7 SMS Billing Records and Methods 23 1.7.1 SMS-MO CDRs 25 1.7.2 SMS-MT CDRs 26 1.8 Load Test of an SMSC 26 1.8.1 SMS-MT Test Configuration 26 1.8.2 Results and Performance Model 26 Exercises 28 References 28 CHAPTER 2 SS7 Network and Protocol Layers 29 2.1 History 29 2.2 Efficient and Secure Worldwide Telecommunications 29 2.3 MTP Protocol (OSI Layers 1–3) 30 2.3.1 MTP Layer 1: Signaling Data Link Level 31 v 2.3.2 MTP Layer 2: Signaling Link Functions 31 2.3.3 MTP Layer 3: Signaling Network Functions 34 2.4 Signaling Connection Control Part 37 2.4.1 SCCP Message Format 38 2.4.2 SCCP Layer Architecture 38 2.4.3 SCCP Routing 39 2.5 Transaction Capability Application Part (TCAP) 42 2.5.1 Main Features of TCAP 43 2.5.2 TCAP Architecture 43 2.5.3 TCAP Operation Invocation Example 44 2.6 User-Level Application Parts: MAP, INAP, CAMEL 45 2.6.1 User Part Mapping onto TCAP: MAP Example 45 2.6.2 Routing Design 48 2.6.3 Service-Oriented Design: Application to an SS7-Based Fault-Tolerant System 50 2.7 SS7 and VoIP Interworking Overview SIGTRAN 51 2.7.1 SCTP 51 2.7.2 Interworking with SS7 52 2.7.3 M3UA Layer 52 2.7.4 M2UA Layer 52 2.7.5 SUA Layer 52 2.7.6 TUA Layer 52 2.8 Conclusions 52 2.8.1 Powerful, Efficient Network Architecture 52 2.8.2 Application to a Worldwide SMS Service Network 53 References 54 CHAPTER 3 Standard Procedures for SMS in IS-41 Networks 57 3.1 Introduction 57 3.1.1 IS-41 Networks 57 3.1.2 Inefficient Handover Chain Procedure 57 3.1.3 MIN and IMSI for IS-41 Networks 59 3.2 Implementation of SMS Services 61 3.2.1 SMS-MO Implementation 61 3.2.2 SMS-MT Implementation 63 3.3 IS-41 Procedure for SMS 63 3.3.1 Functional Description of IS-41 SMS Services 64 3.3.2 IS-41 SMS Protocol Description 68 3.3.3 Specification of the SMS Interworking Network IS-41 SMS Router 70 3.4 Interworking Between IS-41 and GSM 75 3.4.1 GSM Specifications of User Information 75 3.4.2 Mapping GSM to IS-637 76 3.4.3 Mapping GSM to IS-136-710 78 3.4.4 SMS Delivery from IS-41 SME to MAP SME 78 3.4.5 SMS Delivery from MAP SME to IS-41 SME 82 vi Contents 3.4.6 IS-41 Numbering for SMS Delivery 83 3.5 Addressing HLRs in TDMA and CDMA Networks for SMS Interworking: Updating Point Code–Based Addressing Information 83 References 84 CHAPTER 4 Implementation of Mobile Number Portability and GSM-to-IS-41 Conversion 85 4.1 Business Model 85 4.2 Basics of Roaming Agreement Implementation 85 4.3 Implementations of Number Portability 86 4.3.1 MNP Handled by Each Individual Operator (Level N) 87 4.3.2 MNP Handled by the Entry International SCCP Gateway (Level N – 1) 90 4.3.3 Unregulated Countries’ MNP Process Must Be Handled by the SMS Interworking Network 91 4.4 SMS Routing Strategies for an SMS Interworking Operator to a Regulated MNP Country 91 4.5 MNP for SMS in Countries That Have Both GSM and IS-41 Operators 92 4.5.1 SMS-MT GSM to an IS-41 Destination 92 4.5.2 SMS-MT from an IS-41 Network to a GSM Destination 95 4.6 Identification of the Destination Network 96 4.6.1 MMS Interconnection 96 4.6.2 Fixed-Line SMS Interconnection 96 4.6.3 MMS and Fixed-Line SMS Interconnection Business 97 References 99 CHAPTER 5 Barring Inbound SMS-MT 101 5.1 Barring Inbound SMS-MT: An Important Business Issue 101 5.1.1 Filtering Service Offered by IGPs at the SCCP Level 101 5.1.2 Selective E164 Translation Facility Barring of the SMS-MT at the GMSCs SCCP Level 102 5.1.3 HLR Barring 103 5.1.4 Origin Address Type Barring at the MSC Level 103 5.1.5 MAP Barring by the GMSC 103 5.2 Barring or Restricting the SMS-MO of One’s Own Subscribers 104 5.3 Intelligent Barring of SMS-MT 104 5.3.1 Origin Address-Based Barring 104 5.3.2 Filtering Based on Content of Incoming SMS-MT 105 CHAPTER 6 Virtual SMSC Implementation and Transit Agreements 109 6.1 Business Model 109 6.2 Principle of the Virtual SMSC: Architecture and Billing of SMS-MO 109 6.2.1 Architecture 109 6.2.2 Payment Issues 110 Contents vii 6.2.3 Billing Coherence: Dynamic Originating SMSC GT 111 6.2.4 Use of a Local Virtual SMSC GT in the SIM Card 111 6.3 Detailed Implementation of the Virtual SMSC 112 6.3.1 Half-SCCP Roaming for SMS-MO 112 6.3.2 Failure of Half-SCCP Roaming for SMS-MO 113 6.3.3 Solving This Failure Case 113 6.4 Implementation of Transit Agreements (SMS-MT) 114 6.4.1 Cases When a Virtual SMSC Has All Roaming Agreements of the Operator 114 6.4.2 Optimization of the Implementation of a Transit Agreement 118 6.4.3 Use of an International Point Code: The Solution in Difficult Setup Cases 118 6.5 Super-Routing Gateway and Multiple Virtual SMSCs in the Same Equipment 120 Reference 121 CHAPTER 7 Connecting Mobile Operators for SMS-MO 123 7.1 Business Need for an SMS Interworking Operator to Connect Multiple Mobile Operators 123 7.2 Principle of the Virtual HLR/MSC Approach 123 7.2.1 Relay Mode 123 7.2.2 Transparent Mode 125 7.2.3 Direct Interrogation of the HLR by the Client Operator 126 7.2.4 SMS Interworking Network and the Status Report 127 7.3 Configuration the SMSC or GMSC to Route to the Third Party 127 7.3.1 GT Address Translation in the GMSC 127 7.3.2 Doing the Address Translation in the SMSC 130 7.3.3 Use of a Private Conversion Unit 131 7.3.4 Intelligent SCCP Routing by Your IGP 133 7.4 Creating Third-Party SCCP Routing When a GT Translation Is Unavailable 134 7.4.1 Case in Which Connected Operator Acts as Its Own SCCP Gateway 134 7.4.2 Case in Which Connected Operator Uses an International SCCP Gateway Service: No Solution 135 7.4.3 Case in Which GT Translation Is Not Possible and the Operator Is Not Its Own SCCP Provider: Use a Conversion Unit 135 7.4.4 Transmission of Signaling Between a GSM and an IS-41 Network 136 7.5 Conclusion 136 Reference 136 CHAPTER 8 Connecting ASPs and ISPs with SMPP 137 8.1 Introduction 137 8.2 SMPP Sessions 137 viii Contents 8.3 SMPP Commands 138 8.4 Example of SMPP Sessions 138 8.5 Example of Message Operations 138 8.5.1 Session Management: Transceiver PDUs 138 8.5.2 Message Submission Operation 139 8.5.3 Other SMPP Operations 143 8.6 GSM IS-41 Interworking Through SMPP 143 Reference 144 CHAPTER 9 MMS Interworking 145 9.1 Introduction 145 9.2 Standard Model for MMS Sending and Receiving 145 9.2.1 MMS Relay/Server 145 9.2.2 MMS User Databases 145 9.2.3 MMS User Agent 146 9.2.4 MMS VAS Applications 146 9.3 Standard Protocols for MMS 147 9.3.1 MM1 Protocol over WAP 147 9.3.2 MM1 over M-IMAP 149 9.3.3 MM4 Protocol 150 9.3.4 MM7 Protocol 151 9.4 MMS Interworking Architectures Using a Third Party 151 9.5 Setting Up the MMS Profile in the Cell Phone 156 9.5.1 Data Access Profile 157 9.5.2 MMSC Profile 159 References 160 CHAPTER 10 Optimal Routing Algorithms for an SMS Interworking Network 161 10.1 Maximizing the Margin of an SMS Interworking Network 161 10.2 Enumerating All Loopless Paths with the Latin Multiplication Algorithms 161 10.3 Shortest Path: Djsktra Algorithm 165 10.4 Least Cost Path 165 10.5 Least Trouble Path 165 10.6 The Best Flow Problem—Not a Classical Graph Problem 165 10.6.1 Income Model for Customer Charges and Notations 166 10.6.2 Noncontinuous Price Function Paid to the Interworking Network for an Unsatisfied Demand 166 10.6.3 Continuous Concave Price Function 167 10.6.4 Network Model 167 10.6.5 Mathematical Model for Optimization 168 10.6.6 Algorithm to Find the Global Optimum 171 10.6.7 Centralized Network Traffic Regulation Principle 171 10.7 Example: Detailed Modeling of a Real SMS Interworking Network 172 10.7.1 Modeling a Simple SS7 Router or a Relay 172 Contents ix 10.7.2 Modeling Traffic to Subscribers of a Network Hosting an SS7 Router 173 10.7.3 Modeling a Virtual SS7 Router with Several IGPs and Transit Agreements 173 10.7.4 Connection of Hosting Partners 176 10.7.5 Path Valuations 176 References 176 CHAPTER 11 INAP and CAMEL Overview and Other Solutions for Prepaid SMS 177 11.1 Use of CAMEL for SMS Prepaid Services 178 11.1.1 SMS Payment from Prepaid Customers 178 11.1.2 Credit Reloading for Prepaid Customers 179 11.2 Useful Subset of CAMEL Services for Prepaid Customers 179 11.2.1 Example 1: Prepaid SMS 179 11.2.2 Example 2: Simple Prepaid Voice Call 179 11.2.3 Example 3: Voice Call Rerouted to an Announcement Machine 181 11.2.4 Details of Applicable CAMEL Services 182 11.2.5 Specificity of the CAMEL Services 183 11.3 Implementation: Multiple-Protocol Services-Oriented Platform: CAMEL Gateways 184 11.4 Example of Analyzer Traces of a CAMEL Transaction 185 11.5 Other Solutions for Prepaid SMS 187 11.5.1 Prepaid SMS with Service Nodes 187 11.5.2 Prepaid SMS with AoC-Enabled Networks 188 References 189 CHAPTER 12 USSD: A Still-Relevant Conversational Application Service 191 12.1 USSD Advantages over SMS 191 12.2 How Does Mobile-Initiated USSD Service Work? 191 12.3 Example of USSD Service 194 12.4 USSD Is Free: A Call-Back Application 195 CHAPTER 13 Location-Based Services 197 13.1 Location-Based Services: Examples and Revenue Possibilities 197 13.2 Mobile-Originated LBS 197 13.3 Methods 198 13.3.1 MSC Location Method 198 13.3.2 Cell ID Method 198 13.3.3 Extended Cell ID Method 200 13.3.4 Mobile Location Units and BSSAP-LE 200 13.4 Other Methods: Mobile Measured Power Level 201 13.5 3G UMTS Networks 202 13.6 Best Estimate of a Location Using Hyperbolic n-Triangulation 203 13.6.1 Algebraic Equation of a Hyperbola 203 x Contents 13.6.2 Finding the Best Localization Estimate 204 13.6.3 Exact Solution (True Optimum) 205 13.7 Main Results in the Theory of Resultants and Sturm’s Theorem 206 13.7.1 Purpose of the Theory of Resultants 206 13.7.2 Main Result for Two Algebraic Equations 206 13.7.3 Sturm’s Theorem 208 13.7.4 Bounds on the Value of Roots 210 13.7.5 Application: Recursive Algorithm to Find All the Real Roots 211 References 213 CHAPTER 14 SMS-MO Premium Number Services and Architectures 215 14.1 The Premium SMS-MO Number Business 215 14.1.1 Use of a GSM Modem: Small Throughput 215 14.1.2 Use of a Direct IP Connection to an SMSC: Negotiation and Setup Tasks 216 14.2 Virtual Roaming Subscriber Architecture 216 14.2.1 Case 1: Omnitel and Third-Party Operator 216 14.2.2 Case 2: Mobile Operator Has a Virtual MSC 217 14.3 SMS-MO with a Real SIM Card 218 14.4 Short Code: A Costly and Time-Consuming Setup 218 14.5 FSG Architecture 219 References 220 CHAPTER 15 Numbering Plan Creation and Maintenance Algorithms 221 15.1 Purpose of Computing Numbering Plans for an SMS Interworking Network 221 15.2 Entropy of a Numbering Plan as a Quality Indicator 222 15.2.1 Avoiding the Multiple Spanning of HLRs 222 15.2.2 Average Entropy of the Numbering Plan 222 15.2.3 Resulting Global Entropy 223 15.3 “Little Prince” Algorithm to Compute an HLR Numbering Plan 223 15.3.1 Numbering Plan After One Try 224 15.3.2 Numbering Plan After Two Tries 224 15.3.3 Numbering Plan After Three Tries 224 15.4 MSC Search Problem 224 15.4.1 Problem 1 225 15.4.2 Problem 2 225 15.5 Definitions and Properties 225 15.6 Problem 1: Average Number of Searches for a Known N 228 15.6.1 Case N = 2 MSCs 228 15.6.2 Case N = 3 MSCs 229 15.6.3 Asymptotic Bound of MN 230 15.7 Problem 2: Estimate of the Probability That the Number of MSCs N = j 231 References 232 Contents xi CHAPTER 16 Worked-Out Examples 233 16.1 Example 1 233 16.2 Example 2 250 16.3 Example 3 268 16.4 Example 4 268 16.5 Example 5 269 16.6 Example 6 270 16.7 Example 7: Connection of a GSM to a Third-Party SMS Network 280 16.8 Example 8: SMS Interworking Between CDMA Networks 294 Abbreviations and Acronyms 301 About the Authors 319 Index 321 xii Contents

立即下载

上传者： foolskindom 时间： 2009-10-10

The Art of Assembly Language Programming

You are visitor as of October 17, 1996.
The Art of Assembly Language Programming

Forward Why Would Anyone Learn This Stuff?
1 What's Wrong With Assembly Language
2 What's Right With Assembly Language?
3 Organization of This Text and Pedagogical Concerns
4 Obtaining Program Source Listings and Other Materials in This Text

Section One: Machine Organization

Art of Assembly Language: Chapter One
Chapter One - Data Representation
1.0 - Chapter Overview
1.1 - Numbering Systems
1.1.1 - A Review of the Decimal System
1.1.2 - The Binary Numbering System
1.1.3 - Binary Formats
1.2 - Data Organization
1.2.1 - Bits
1.2.2 - Nibbles
1.2.3 - Bytes
1.2.4 - Words
1.2.5 - Double Words
1.3 - The Hexadecimal Numbering System
1.4 - Arithmetic Operations on Binary and Hexadecimal Numbers
1.5 - Logical Operations on Bits
1.6 - Logical Operations on Binary Numbers and Bit Strings
1.7 - Signed and Unsigned Numbers
1.8 - Sign and Zero Extension
1.9 - Shifts and Rotates
1.10 - Bit Fields and Packed Data
1.11 - The ASCII Character Set

1.12 Summary
1.13 Laboratory Exercises
1.13.1 Installing the Software
1.13.2 Data Conversion Exercises
1.13.3 Logical Operations Exercises
1.13.4 Sign and Zero Extension Exercises
1.13.5 Packed Data Exercises
1.14 Questions
1.15 Programming Projects

Chapter Two - Boolean Algebra
2.0 - Chapter Overview
2.1 - Boolean Algebra
2.2 - Boolean Functions and Truth Tables
2.3 - Algebraic Manipulation of Boolean Expressions
2.4 - Canonical Forms
2.5 - Simplification of Boolean Functions
2.6 - What Does This Have To Do With Computers, Anyway?
2.6.1 - Correspondence Between Electronic Circuits and Boolean Functions
2.6.2 - Combinatorial Circuits
2.6.3 - Sequential and Clocked Logic
2.7 - Okay, What Does It Have To Do With Programming, Then?
2.8 - Generic Boolean Functions

2.9 Laboratory Exercises
2.9.1 Truth Tables and Logic Equations Exercises
2.9.2 Canonical Logic Equations Exercises
2.9.3 Optimization Exercises
2.9.4 Logic Evaluation Exercises
2.10 Programming Projects
2.11 Summary
2.12 Questions

Chapter Three - System Organization
3.0 - Chapter Overview
3.1 - The Basic System Components
3.1.1 - The System Bus
3.1.1.1 - The Data Bus
3.1.1.2 - The Address Bus
3.1.1.3 - The Control Bus
3.1.2 - The Memory Subsystem
3.1.3 - The I/O Subsystem
3.2 - System Timing
3.2.1 - The System Clock
3.2.2 - Memory Access and the System Clock
3.2.3 - Wait States
3.2.4 - Cache Memory
3.3 - The 886, 8286, 8486, and 8686 "Hypothetical" Processors
3.3.1 - CPU Registers
3.3.2 - The Arithmetic & Logical Unit
3.3.3 - The Bus Interface Unit
3.3.4 - The Control Unit and Instruction Sets
3.3.5 - The x86 Instruction Set
3.3.6 - Addressing Modes on the x86
3.3.7 - Encoding x86 Instructions
3.3.8 - Step-by-Step Instruction Execution
3.3.9 - The Differences Between the x86 Processors
3.3.10 - The 886 Processor
3.3.11 - The 8286 Processor
3.3.12 - The 8486 Processor
3.3.12.1 - The 8486 Pipeline
3.3.12.2 - Stalls in a Pipeline
3.3.12.3 - Cache, the Prefetch Queue, and the 8486
3.3.12.4 - Hazards on the 8486
3.3.13 - The 8686 Processor
3.4 - I/O (Input/Output)
3.5 - Interrupts and Polled I/O


3.6 Laboratory Exercises
3.6.1 The SIMx86 Program - Some Simple x86 Programs
3.6.2 Simple I/O-Mapped Input/Output Operations
3.6.3 Memory Mapped I/O
3.6.4 DMA Exercises
3.6.5 Interrupt Driven I/O Exercises
3.6.6 Machine Language Programming & Instruction Encoding Exercises
3.6.7 Self Modifying Code Exercises
3.7 Programming Projects
3.8 Summary
3.9 Questions

Chapter Four - Memory Layout and Access
4.0 - Chapter Overview
4.1 - The 80x86 CPUs:A Programmer's View
4.1.1 - 8086 General Purpose Registers
4.1.2 - 8086 Segment Registers
4.1.3 - 8086 Special Purpose Registers
4.1.4 - 80286 Registers
4.1.5 - 80386/80486 Registers
4.2 - 80x86 Physical Memory Organization
4.3 - Segments on the 80x86
4.4 - Normalized Addresses on the 80x86
4.5 - Segment Registers on the 80x86
4.6 - The 80x86 Addressing Modes
4.6.1 - 8086 Register Addressing Modes
4.6.2 - 8086 Memory Addressing Modes
4.6.2.1 - The Displacement Only Addressing Mode
4.6.2.2 - The Register Indirect Addressing Modes
4.6.2.3 - Indexed Addressing Modes
4.6.2.4 - Based Indexed Addressing Modes
4.6.2.5 - Based Indexed Plus Displacement Addressing Mode
4.6.2.6 - MASM Syntax for 8086 Memory Addressing Modes
4.6.2.7 - An Easy Way to Remember the 8086 Memory Addressing Modes
4.6.2.8 - Some Final Comments About 8086 Addressing Modes
4.6.3 - 80386 Register Addressing Modes
4.6.4 - 80386 Memory Addressing Modes
4.6.4.1 - Register Indirect Addressing Modes
4.6.4.2 - 80386 Indexed, Base/Indexed, and Base/Indexed/Disp Addressing Modes
4.6.4.3 - 80386 Scaled Indexed Addressing Modes
4.6.4.4 - Some Final Notes About the 80386 Memory Addressing Modes
4.7 - The 80x86 MOV Instruction
4.8 - Some Final Comments on the MOV Instructions

4.9 Laboratory Exercises
4.9.1 The UCR Standard Library for 80x86 Assembly Language Programmers
4.9.2 Editing Your Source Files
4.9.3 The SHELL.ASM File
4.9.4 Assembling Your Code with MASM
4.9.5 Debuggers and CodeView'
4.9.5.1 A Quick Look at CodeView
4.9.5.2 The Source Window
4.9.5.3 The Memory Window
4.9.5.4 The Register Window
4.9.5.5 The Command Window
4.9.5.6 The Output Menu Item
4.9.5.7 The CodeView Command Window
4.9.5.7.1 The Radix Command (N)
4.9.5.7.2 The Assemble Command
4.9.5.7.3 The Compare Memory Command
4.9.5.7.4 The Dump Memory Command
4.9.5.7.5 The Enter Command
4.9.5.7.6 The Fill Memory Command
4.9.5.7.7 The Move Memory Command
4.9.5.7.8 The Input Command
4.9.5.7.9 The Output Command
4.9.5.7.10 The Quit Command
4.9.5.7.11 The Register Command
4.9.5.7.12 The Unassemble Command
4.9.5.8 CodeView Function Keys
4.9.5.9 Some Comments on CodeView Addresses
4.9.5.10 A Wrap on CodeView
4.9.6 Laboratory Tasks
4.10 Programming Projects
4.11 Summary
4.12 Questions
Section Two: Basic Assembly Language

Chapter Five - Variables and Data Structures
5.0 - Chapter Overview
5.1 - Some Additional Instructions: LEA, LES, ADD, and MUL
5.2 - Declaring Variables in an Assembly Language Program
5.3 - Declaring and Accessing Scalar Variables
5.3.1 - Declaring and using BYTE Variables
5.3.2 - Declaring and using WORD Variables
5.3.3 - Declaring and using DWORD Variables
5.3.4 - Declaring and using FWORD, QWORD, and TBYTE Variables
5.3.5 - Declaring Floating Point Variables with REAL4, REAL8, and REAL10
5.4 - Creating Your Own Type Names with TYPEDEF
5.5 - Pointer Data Types
5.6 - Composite Data Types
5.6.1 - Arrays
5.6.1.1 - Declaring Arrays in Your Data Segment
5.6.1.2 - Accessing Elements of a Single Dimension Array
5.6.2 - Multidimensional Arrays
5.6.2.1 - Row Major Ordering
5.6.2.2 - Column Major Ordering
5.6.2.3 - Allocating Storage for Multidimensional Arrays
5.6.2.4 - Accessing Multidimensional Array Elements in Assembly Language
5.6.3 - Structures
5.6.4 - Arrays of Structures and Arrays/Structures as Structure Fields
5.6.5 - Pointers to Structures
5.7 - Sample Programs
5.7.1 - Simple Variable Declarations
5.7.2 - Using Pointer Variables
5.7.3 - Single Dimension Array Access
5.7.4 - Multidimensional Array Access
5.7.5 - Simple Structure Access
5.7.6 - Arrays of Structures
5.7.7 - Structures and Arrays as Fields of Another Structure
5.7.8 - Pointers to Structures and Arrays of Structure


5.8 Laboratory Exercises
5.9 Programming Projects
5.10 Summary
5.11 Questions

Chapter Six - The 80x86 Instruction Set
6.0 - Chapter Overview
6.1 - The Processor Status Register (Flags)
6.2 - Instruction Encodings
6.3 - Data Movement Instructions
6.3.1 - The MOV Instruction
6.3.2 - The XCHG Instruction
6.3.3 - The LDS, LES, LFS, LGS, and LSS Instructions
6.3.4 - The LEA Instruction
6.3.5 - The PUSH and POP Instructions
6.3.6 - The LAHF and SAHF Instructions
6.4 - Conversions
6.4.1 - The MOVZX, MOVSX, CBW, CWD, CWDE, and CDQ Instructions
6.4.2 - The BSWAP Instruction
6.4.3 - The XLAT Instruction
6.5 - Arithmetic Instructions
6.5.1 - The Addition Instructions: ADD, ADC, INC, XADD, AAA, and DAA
6.5.1.1 - The ADD and ADC Instructions
6.5.1.2 - The INC Instruction
6.5.1.3 - The XADD Instruction
6.5.1.4 - The AAA and DAA Instructions
6.5.2 - The Subtraction Instructions: SUB, SBB, DEC, AAS, and DAS
6.5.3 - The CMP Instruction
6.5.4 - The CMPXCHG, and CMPXCHG8B Instructions
6.5.5 - The NEG Instruction
6.5.6 - The Multiplication Instructions: MUL, IMUL, and AAM
6.5.7 - The Division Instructions: DIV, IDIV, and AAD
6.6 - Logical, Shift, Rotate and Bit Instructions
6.6.1 - The Logical Instructions: AND, OR, XOR, and NOT
6.6.2 - The Shift Instructions: SHL/SAL, SHR, SAR, SHLD, and SHRD
6.6.2.1 - SHL/SAL
6.6.2.2 - SAR
6.6.2.3 - SHR
6.6.2.4 - The SHLD and SHRD Instructions
6.6.3 - The Rotate Instructions: RCL, RCR, ROL, and ROR
6.6.3.1 - RCL
6.6.3.2 - RCR
6.6.3.3 - ROL
6.6.3.4 - ROR
6.6.4 - The Bit Operations
6.6.4.1 - TEST
6.6.4.2 - The Bit Test Instructions: BT, BTS, BTR, and BTC
6.6.4.3 - Bit Scanning: BSF and BSR
6.6.5 - The "Set on Condition" Instructions
6.7 - I/O Instructions
6.8 - String Instructions
6.9 - Program Flow Control Instructions
6.9.1 - Unconditional Jumps
6.9.2 - The CALL and RET Instructions
6.9.3 - The INT, INTO, BOUND, and IRET Instructions
6.9.4 - The Conditional Jump Instructions
6.9.5 - The JCXZ/JECXZ Instructions
6.9.6 - The LOOP Instruction
6.9.7 - The LOOPE/LOOPZ Instruction
6.9.8 - The LOOPNE/LOOPNZ Instruction
6.10 - Miscellaneous Instructions
6.11 - Sample Programs
6.11.1 - Simple Arithmetic I
6.11.2 - Simple Arithmetic II
6.11.3 - Logical Operations
6.11.4 - Shift and Rotate Operations
6.11.5 - Bit Operations and SETcc Instructions
6.11.6 - String Operations
6.11.7 - Conditional Jumps
6.11.8 - CALL and INT Instructions
6.11.9 - Conditional Jumps I
6.11.10 - Conditional Jump Instructions II


6.12 Laboratory Exercises
6.12.1 The IBM/L System
6.12.2 IBM/L Exercises
6.13 Programming Projects
6.14 Summary
6.15 Questions

Chapter Seven - The UCR Standard Library
7.0 - Chapter Overview
7.1 - An Introduction to the UCR Standard Library
7.1.1 - Memory Management Routines: MEMINIT, MALLOC, and FREE
7.1.2 - The Standard Input Routines: GETC, GETS, GETSM
7.1.3 - The Standard Output Routines: PUTC, PUTCR, PUTS, PUTH, PUTI, PRINT, and PRINTF
7.1.4 - Formatted Output Routines: Putisize, Putusize, Putlsize, and Putulsize
7.1.5 - Output Field Size Routines: Isize, Usize, and Lsize
7.1.6 - Conversion Routines: ATOx, and xTOA
7.1.7 - Routines that Test Characters for Set Membership
7.1.8 - Character Conversion Routines: ToUpper, ToLower
7.1.9 - Random Number Generation: Random, Randomize
7.1.10 - Constants, Macros, and other Miscellany
7.1.11 - Plus more!
7.2 - Sample Programs
7.2.1 - Stripped SHELL.ASM File
7.2.2 - Numeric I/O


7.3 Laboratory Exercises
7.3.1 Obtaining the UCR Standard Library
7.3.2 Unpacking the Standard Library
7.3.3 Using the Standard Library
7.3.4 The Standard Library Documentation Files
7.4 Programming Projects
7.5 Summary
7.6 Questions

Chapter Eight - MASM: Directives & Pseudo-Opcodes
8.0 - Chapter Overview
8.1 - Assembly Language Statements
8.2 - The Location Counter
8.3 - Symbols
8.4 - Literal Constants
8.4.1 - Integer Constants
8.4.2 - String Constants
8.4.3 - Real Constants
8.4.4 - Text Constants
8.5 - Declaring Manifest Constants Using Equates
8.6 - Processor Directives
8.7 - Procedures
8.8 - Segments
8.8.1 - Segment Names
8.8.2 - Segment Loading Order
8.8.3 - Segment Operands
8.8.3.1 - The ALIGN Type
8.8.3.2 - The COMBINE Type
8.8.4 - The CLASS Type
8.8.5 - The Read-only Operand
8.8.6 - The USE16, USE32, and FLAT Options
8.8.7 - Typical Segment Definitions
8.8.8 - Why You Would Want to Control the Loading Order
8.8.9 - Segment Prefixes
8.8.10 - Controlling Segments with the ASSUME Directive
8.8.11 - Combining Segments: The GROUP Directive
8.8.12 - Why Even Bother With Segments?
8.9 - The END Directive
8.10 - Variables
8.11 - Label Types
8.11.1 - How to Give a Symbol a Particular Type
8.11.2 - Label Values
8.11.3 - Type Conflicts
8.12 - Address Expressions
8.12.1 - Symbol Types and Addressing Modes
8.12.2 - Arithmetic and Logical Operators
8.12.3 - Coercion
8.12.4 - Type Operators
8.12.5 - Operator Precedence
8.13 - Conditional Assembly
8.13.1 - IF Directive
8.13.2 - IFE directive
8.13.3 - IFDEF and IFNDEF
8.13.4 - IFB, IFNB
8.13.5 - IFIDN, IFDIF, IFIDNI, and IFDIFI
8.14 - Macros
8.14.1 - Procedural Macros
8.14.2 - Macros vs. 80x86 Procedures
8.14.3 - The LOCAL Directive
8.14.4 - The EXITM Directive
8.14.5 - Macro Parameter Expansion and Macro Operators
8.14.6 - A Sample Macro to Implement For Loops
8.14.7 - Macro Functions
8.14.8 - Predefined Macros, Macro Functions, and Symbols
8.14.9 - Macros vs. Text Equates
8.14.10 - Macros: Good and Bad News
8.15 - Repeat Operations
8.16 - The FOR and FORC Macro Operations
8.17 - The WHILE Macro Operation
8.18 - Macro Parameters
8.19 - Controlling the Listing
8.19.1 - The ECHO and %OUT Directives
8.19.2 - The TITLE Directive
8.19.3 - The SUBTTL Directive
8.19.4 - The PAGE Directive
8.19.5 - The .LIST, .NOLIST, and .XLIST Directives
8.19.6 - Other Listing Directives
8.20 - Managing Large Programs
8.20.1 - The INCLUDE Directive
8.20.2 - The PUBLIC, EXTERN, and EXTRN Directives
8.20.3 - The EXTERNDEF Directive
8.21 - Make Files
8.22 - Sample Program
8.22.1 - EX8.MAK
8.22.2 - Matrix.A
8.22.3 - EX8.ASM
8.22.4 - GETI.ASM
8.22.5 - GetArray.ASM
8.22.6 - XProduct.ASM


8.23 Laboratory Exercises
8.23.1 Near vs. Far Procedures
8.23.2 Data Alignment Exercises
8.23.3 Equate Exercise
8.23.4 IFDEF Exercise
8.23.5 Make File Exercise
8.24 Programming Projects
8.25 Summary
8.26 Questions

Chapter Nine - Arithmetic and Logical Operations
9.0 - Chapter Overview
9.1 - Arithmetic Expressions
9.1.1 - Simple Assignments
9.1.2 - Simple Expressions
9.1.3 - Complex Expressions
9.1.4 - Commutative Operators
9.2 - Logical (Boolean) Expressions
9.3 - Multiprecision Operations
9.3.1 - Multiprecision Addition Operations
9.3.2 - Multiprecision Subtraction Operations
9.3.3 - Extended Precision Comparisons
9.3.4 - Extended Precision Multiplication
9.3.5 - Extended Precision Division
9.3.6 - Extended Precision NEG Operations
9.3.7 - Extended Precision AND Operations
9.3.8 - Extended Precision OR Operations
9.3.9 - Extended Precision XOR Operations
9.3.10 - Extended Precision NOT Operations
9.3.11 - Extended Precision Shift Operations
9.3.12 - Extended Precision Rotate Operations
9.4 - Operating on Different Sized Operands
9.5 - Machine and Arithmetic Idioms
9.5.1 - Multiplying Without MUL and IMUL
9.5.2 - Division Without DIV and IDIV
9.5.3 - Using AND to Compute Remainders
9.5.4 - Implementing Modulo-n Counters with AND
9.5.5 - Testing an Extended Precision Value for 0FFFF..FFh
9.5.6 - TEST Operations
9.5.7 - Testing Signs with the XOR Instruction
9.6 - Masking Operations
9.6.1 - Masking Operations with the AND Instruction
9.6.2 - Masking Operations with the OR Instruction
9.7 - Packing and Unpacking Data Types
9.8 - Tables
9.8.1 - Function Computation via Table Look Up
9.8.2 - Domain Conditioning
9.8.3 - Generating Tables
9.9 - Sample Programs
9.9.1 - Converting Arithmetic Expressions to Assembly Language
9.9.2 - Boolean Operations Example
9.9.3 - 64-bit Integer I/O
9.9.4 - Packing and Unpacking Date Data Types



9.10 Laboratory Exercises
9.10.1 Debugging Programs with CodeView
9.10.2 Debugging Strategies
9.10.2.1 Locating Infinite Loops
9.10.2.2 Incorrect Computations
9.10.2.3 Illegal Instructions/Infinite Loops Part II
9.10.3 Debug Exercise I: Using CodeView to Find Bugs in a Calculation
9.10.4 Software Delay Loop Exercises
9.11 Programming Projects
9.12 Summary
9.13 Questions

Chapter 10 - Control Structures
10.0 - Chapter Overview
10.1 - Introduction to Decisions
10.2 - IF..THEN..ELSE Sequences
10.3 - CASE Statements
10.4 - State Machines and Indirect Jumps
10.5 - Spaghetti Code
10.6 - Loops
10.6.1 - While Loops
10.6.2 - Repeat..Until Loops
10.6.3 - LOOP..ENDLOOP Loops
10.6.4 - FOR Loops
10.7 - Register Usage and Loops
10.8 - Performance Improvements
10.8.1 - Moving the Termination Condition to the End of a Loop
10.8.2 - Executing the Loop Backwards
10.8.3 - Loop Invariant Computations
10.8.4 - Unraveling Loops
10.8.5 - Induction Variables
10.8.6 - Other Performance Improvements
10.9 - Nested Statements
10.10 - Timing Delay Loops
10.11 - Sample Program



10.12 Laboratory Exercises
10.12.1 The Physics of Sound
10.12.2 The Fundamentals of Music
10.12.3 The Physics of Music
10.12.4 The 8253/8254 Timer Chip
10.12.5 Programming the Timer Chip to Produce Musical Tones
10.12.6 Putting it All Together
10.12.7 Amazing Grace Exercise
10.13 Programming Projects
10.14 Summary
10.15 Questions

Chapter Eleven - Procedures and Functions
11.0 - Chapter Overview
11.1 - Procedures
11.2 - Near and Far Procedures
11.2.1 - Forcing NEAR or FAR CALLs and Returns
11.2.2 - Nested Procedures
11.3 - Functions
11.4 - Saving the State of the Machine
11.5 - Parameters
11.5.1 - Pass by Value
11.5.2 - Pass by Reference
11.5.3 - Pass by Value-Returned
11.5.4 - Pass by Result
11.5.5 - Pass by Name
11.5.6 - Pass by Lazy-Evaluation
11.5.7 - Passing Parameters in Registers
11.5.8 - Passing Parameters in Global Variables
11.5.9 - Passing Parameters on the Stack
11.5.10 - Passing Parameters in the Code Stream
11.5.11 - Passing Parameters via a Parameter Block
11.6 - Function Results
11.6.1 - Returning Function Results in a Register
11.6.2 - Returning Function Results on the Stack
11.6.3 - Returning Function Results in Memory Locations
11.7 - Side Effects
11.8 - Local Variable Storage
11.9 - Recursion
11.10 - Sample Program

11.11 Laboratory Exercises
11.11.1 Ex11_1.cpp
11.11.2 Ex11_1.asm
11.11.3 EX11_1a.asm
11.12 Programming Projects
11.13 Summary
11.14 Questions

Section Three: Intermediate Level Assembly Language Programming

Chapter 12 - Procedures: Advanced Topics
12.0 - Chapter Overview
12.1 - Lexical Nesting, Static Links, and Displays
12.1.1 - Scope
12.1.2 - Unit Activation, Address Binding, and Variable Lifetime
12.1.3 - Static Links
12.1.4 - Accessing Non-Local Variables Using Static Links
12.1.5 - The Display
12.1.6 - The 80286 ENTER and LEAVE Instructions
12.2 - Passing Variables at Different Lex Levels as Parameters.
12.2.1 - Passing Parameters by Value in a Block Structured Language
12.2.2 - Passing Parameters by Reference, Result, and Value-Result in a Block Structured Language
12.2.3 - Passing Parameters by Name and Lazy-Evaluation in a Block Structured Language
12.3 - Passing Parameters as Parameters to Another Procedure
12.3.1 - Passing Reference Parameters to Other Procedures
12.3.2 - Passing Value-Result and Result Parameters as Parameters
12.3.3 - Passing Name Parameters to Other Procedures
12.3.4 - Passing Lazy Evaluation Parameters as Parameters
12.3.5 - Parameter Passing Summary
12.4 - Passing Procedures as Parameters
12.5 - Iterators
12.5.1 - Implementing Iterators Using In-Line Expansion
12.5.2 - Implementing Iterators with Resume Frames
12.6 - Sample Programs
12.6.1 - An Example of an Iterator
12.6.2 - Another Iterator Example


12.7 Laboratory Exercises
12.7.1 Iterator Exercise
12.7.2 The 80x86 Enter and Leave Instructions
12.7.3 Parameter Passing Exercises
12.8 Programming Projects
12.9 Summary
12.10 Questions

Chapter 13 - MS-DOS, PC-BIOS, and File I/O
13.0 - Chapter Overview
13.1 - The IBM PC BIOS
13.2 - An Introduction to the BIOS' Services
13.2.1 - INT 5- Print Screen
13.2.2 - INT 10h - Video Services
13.2.3 - INT 11h - Equipment Installed
13.2.4 - INT 12h - Memory Available
13.2.5 - INT 13h - Low Level Disk Services
13.2.6 - INT 14h - Serial I/O
13.2.6.1 - AH=0: Serial Port Initialization
13.2.6.2 - AH=1: Transmit a Character to the Serial Port
13.2.6.3 - AH=2: Receive a Character from the Serial Port
13.2.6.4 - AH=3: Serial Port Status
13.2.7 - INT 15h - Miscellaneous Services
13.2.8 - INT 16h - Keyboard Services
13.2.8.1 - AH=0: Read a Key From the Keyboard
13.2.8.2 - AH=1: See if a Key is Available at the Keyboard
13.2.8.3 - AH=2: Return Keyboard Shift Key Status
13.2.9 - INT 17h - Printer Services
13.2.9.1 - AH=0: Print a Character
13.2.9.2 - AH=1: Initialize Printer
13.2.9.3 - AH=2: Return Printer Status
13.2.10 - INT 18h - Run BASIC
13.2.11 - INT 19h - Reboot Computer
13.2.12 - INT 1Ah - Real Time Clock
13.2.12.1 - AH=0: Read the Real Time Clock
13.2.12.2 - AH=1: Setting the Real Time Clock
13.3 - An Introduction to MS-DOS'
13.3.1 - MS-DOS Calling Sequence
13.3.2 - MS-DOS Character Oriented Functions
13.3.3 - MS-DOS Drive Commands
13.3.4 - MS-DOS "Obsolete" Filing Calls
13.3.5 - MS-DOS Date and Time Functions
13.3.6 - MS-DOS Memory Management Functions
13.3.6.1 - Allocate Memory
13.3.6.2 - Deallocate Memory
13.3.6.3 - Modify Memory Allocation
13.3.6.4 - Advanced Memory Management Functions
13.3.7 - MS-DOS Process Control Functions
13.3.7.1 - Terminate Program Execution
13.3.7.2 - Terminate, but Stay Resident
13.3.7.3 - Execute a Program
13.3.8 - MS-DOS "New" Filing Calls
13.3.8.1 - Open File
13.3.8.2 - Create File
13.3.8.3 - Close File
13.3.8.4 - Read From a File
13.3.8.5 - Write to a File
13.3.8.6 - Seek (Move File Pointer)
13.3.8.7 - Set Disk Transfer Address (DTA)
13.3.8.8 - Find First File
13.3.8.9 - Find Next File
13.3.8.10 - Delete File
13.3.8.11 - Rename File
13.3.8.12 - Change/Get File Attributes
13.3.8.13 - Get/Set File Date and Time
13.3.8.14 - Other DOS Calls
13.3.9 - File I/O Examples
13.3.9.1 - Example #1: A Hex Dump Utility
13.3.9.2 - Example #2: Upper Case Conversion
13.3.10 - Blocked File I/O
13.3.11 - The Program Segment Prefix (PSP)
13.3.12 - Accessing Command Line Parameters
13.3.13 - ARGC and ARGV
13.4 - UCR Standard Library File I/O Routines
13.4.1 - Fopen
13.4.2 - Fcreate
13.4.3 - Fclose
13.4.4 - Fflush
13.4.5 - Fgetc
13.4.6 - Fread
13.4.7 - Fputc
13.4.8 - Fwrite
13.4.9 - Redirecting I/O Through the StdLib File I/O Routines
13.4.10 - A File I/O Example
13.5 - Sample Program

13.6 Laboratory Exercises
13.7 Programming Projects
13.8 Summary
13.9 Questions


Chapter 14 - Floating Point Arithmetic
14.0 - Chapter Overview
14.1 - The Mathematics of Floating Point Arithmetic
14.2 - IEEE Floating Point Formats
14.3 - The UCR Standard Library Floating Point Routines
14.3.1 - Load and Store Routines
14.3.2 - Integer/Floating Point Conversion
14.3.3 - Floating Point Arithmetic
14.3.4 - Float/Text Conversion and Printff
14.4 - The 80x87 Floating Point Coprocessors
14.4.1 - FPU Registers
14.4.1.1 - The FPU Data Registers
14.4.1.2 - The FPU Control Register
14.4.1.3 - The FPU Status Register
14.4.2 - FPU Data Types
14.4.3 - The FPU Instruction Set
14.4.4 - FPU Data Movement Instructions
14.4.4.1 - The FLD Instruction
14.4.4.2 - The FST and FSTP Instructions
14.4.4.3 - The FXCH Instruction
14.4.5 - Conversions
14.4.5.1 - The FILD Instruction
14.4.5.2 - The FIST and FISTP Instructions
14.4.5.3 - The FBLD and FBSTP Instructions
14.4.6 - Arithmetic Instructions
14.4.6.1 - The FADD and FADDP Instructions
14.4.6.2 - The FSUB, FSUBP, FSUBR, and FSUBRP Instructions
14.4.6.3 - The FMUL and FMULP Instructions
14.4.6.4 - The FDIV, FDIVP, FDIVR, and FDIVRP Instructions
14.4.6.5 - The FSQRT Instruction
14.4.6.6 - The FSCALE Instruction
14.4.6.7 - The FPREM and FPREM1 Instructions
14.4.6.8 - The FRNDINT Instruction
14.4.6.9 - The FXTRACT Instruction
14.4.6.10 - The FABS Instruction
14.4.6.11 - The FCHS Instruction
14.4.7 - Comparison Instructions
14.4.7.1 - The FCOM, FCOMP, and FCOMPP Instructions
14.4.7.2 - The FUCOM, FUCOMP, and FUCOMPP Instructions
14.4.7.3 - The FTST Instruction
14.4.7.4 - The FXAM Instruction
14.4.8 - Constant Instructions
14.4.9 - Transcendental Instructions
14.4.9.1 - The F2XM1 Instruction
14.4.9.2 - The FSIN, FCOS, and FSINCOS Instructions
14.4.9.3 - The FPTAN Instruction
14.4.9.4 - The FPATAN Instruction
14.4.9.5 - The FYL2X and FYL2XP1 Instructions
14.4.10 - Miscellaneous instructions
14.4.10.1 - The FINIT and FNINIT Instructions
14.4.10.2 - The FWAIT Instruction
14.4.10.3 - The FLDCW and FSTCW Instructions
14.4.10.4 - The FCLEX and FNCLEX Instructions
14.4.10.5 - The FLDENV, FSTENV, and FNSTENV Instructions
14.4.10.6 - The FSAVE, FNSAVE, and FRSTOR Instructions
14.4.10.7 - The FSTSW and FNSTSW Instructions
14.4.10.8 - The FINCSTP and FDECSTP Instructions
14.4.10.9 - The FNOP Instruction
14.4.10.10 - The FFREE Instruction
14.4.11 - Integer Operations
14.5 - Sample Program: Additional Trigonometric Functions

14.6 Laboratory Exercises
14.6.1 FPU vs StdLib Accuracy
14.7 Programming Projects
14.8 Summary
14.9 Questions

Chapter 15 - Strings and Character Sets
15.0 - Chapter Overview
15.1 - The 80x86 String Instructions
15.1.1 - How the String Instructions Operate
15.1.2 - The REP/REPE/REPZ and REPNZ/REPNE Prefixes
15.1.3 - The Direction Flag
15.1.4 - The MOVS Instruction
15.1.5 - The CMPS Instruction
15.1.6 - The SCAS Instruction
15.1.7 - The STOS Instruction
15.1.8 - The LODS Instruction
15.1.9 - Building Complex String Functions from LODS and STOS
15.1.10 - Prefixes and the String Instructions
15.2 - Character Strings
15.2.1 - Types of Strings
15.2.2 - String Assignment
15.2.3 - String Comparison
15.3 - Character String Functions
15.3.1 - Substr
15.3.2 - Index
15.3.3 - Repeat
15.3.4 - Insert
15.3.5 - Delete
15.3.6 - Concatenation
15.4 - String Functions in the UCR Standard Library
15.4.1 - StrBDel, StrBDelm
15.4.2 - Strcat, Strcatl, Strcatm, Strcatml
15.4.3 - Strchr
15.4.4 - Strcmp, Strcmpl, Stricmp, Stricmpl
15.4.5 - Strcpy, Strcpyl, Strdup, Strdupl
15.4.6 - Strdel, Strdelm
15.4.7 - Strins, Strinsl, Strinsm, Strinsml
15.4.8 - Strlen
15.4.9 - Strlwr, Strlwrm, Strupr, Struprm
15.4.10 - Strrev, Strrevm
15.4.11 - Strset, Strsetm
15.4.12 - Strspan, Strspanl, Strcspan, Strcspanl
15.4.13 - Strstr, Strstrl
15.4.14 - Strtrim, Strtrimm
15.4.15 - Other String Routines in the UCR Standard Library
15.5 - The Character Set Routines in the UCR Standard Library
15.6 - Using the String Instructions on Other Data Types
15.6.1 - Multi-precision Integer Strings
15.6.2 - Dealing with Whole Arrays and Records
15.7 - Sample Programs
15.7.1 - Find.asm
15.7.2 - StrDemo.asm
15.7.3 - Fcmp.asm



15.8 Laboratory Exercises
15.8.1 MOVS Performance Exercise #1
15.8.2 MOVS Performance Exercise #2
15.8.3 Memory Performance Exercise
15.8.4 The Performance of Length-Prefixed vs. Zero-Terminated Strings
15.9 Programming Projects
15.10 Summary
15.11 Questions

Chapter 16 - Pattern Matching
16.1 - An Introduction to Formal Language (Automata) Theory
16.1.1 - Machines vs. Languages
16.1.2 - Regular Languages
16.1.2.1 - Regular Expressions
16.1.2.2 - Nondeterministic Finite State Automata (NFAs)
16.1.2.3 - Converting Regular Expressions to NFAs
16.1.2.4 - Converting an NFA to Assembly Language
16.1.2.5 - Deterministic Finite State Automata (DFAs)
16.1.2.6 - Converting a DFA to Assembly Language
16.1.3 - Context Free Languages
16.1.4 - Eliminating Left Recursion and Left Factoring CFGs
16.1.5 - Converting REs to CFGs
16.1.6 - Converting CFGs to Assembly Language
16.1.7 - Some Final Comments on CFGs
16.1.8 - Beyond Context Free Languages
16.2 - The UCR Standard Library Pattern Matching Routines
16.3 - The Standard Library Pattern Matching Functions
16.3.1 - Spancset
16.3.2 - Brkcset
16.3.3 - Anycset
16.3.4 - Notanycset
16.3.5 - MatchStr
16.3.6 - MatchiStr
16.3.7 - MatchToStr
16.3.8 - MatchChar
16.3.9 - MatchToChar
16.3.10 - MatchChars
16.3.11 - MatchToPat
16.3.12 - EOS
16.3.13 - ARB
16.3.14 - ARBNUM
16.3.15 - Skip
16.3.16 - Pos
16.3.17 - RPos
16.3.18 - GotoPos
16.3.19 - RGotoPos
16.3.20 - SL_Match2
16.4 - Designing Your Own Pattern Matching Routines
16.5 - Extracting Substrings from Matched Patterns
16.6 - Semantic Rules and Actions
16.7 - Constructing Patterns for the MATCH Routine
16.8 - Some Sample Pattern Matching Applications
16.8.1 - Converting Written Numbers to Integers
16.8.2 - Processing Dates
16.8.3 - Evaluating Arithmetic Expressions
16.8.4 - A Tiny Assembler
16.8.5 - The "MADVENTURE" Game
16.9 - Laboratory Exercises
16.9.1 - Checking for Stack Overflow (Infinite Loops)
16.9.2 - Printing Diagnostic Messages from a Pattern



16.10 Programming Projects
16.11 Summary
16.12 Questions

Section Four: Advanced Assembly Language Programming

Chapter 17 - Interrupts, Traps, and Exceptions
17.1 - 80x86 Interrupt Structure and Interrupt Service Routines (ISRs)
17.2 - Traps
17.3 - Exceptions
17.3.1 - Divide Error Exception (INT 0)
17.3.2 - Single Step (Trace) Exception (INT 1)
17.3.3 - Breakpoint Exception (INT 3)
17.3.4 - Overflow Exception (INT 4/INTO)
17.3.5 - Bounds Exception (INT 5/BOUND)
17.3.6 - Invalid Opcode Exception (INT 6)
17.3.7 - Coprocessor Not Available (INT 7)
17.4 - Hardware Interrupts
17.4.1 - The 8259A Programmable Interrupt Controller (PIC)
17.4.2 - The Timer Interrupt (INT 8)
17.4.3 - The Keyboard Interrupt (INT 9)
17.4.4 - The Serial Port Interrupts (INT 0Bh and INT 0Ch)
17.4.5 - The Parallel Port Interrupts (INT 0Dh and INT 0Fh)
17.4.6 - The Diskette and Hard Drive Interrupts (INT 0Eh and INT 76h)
17.4.7 - The Real-Time Clock Interrupt (INT 70h)
17.4.8 - The FPU Interrupt (INT 75h)
17.4.9 - Nonmaskable Interrupts (INT 2)
17.4.10 - Other Interrupts
17.5 - Chaining Interrupt Service Routines
17.6 - Reentrancy Problems
17.7 - The Efficiency of an Interrupt Driven System
17.7.1 - Interrupt Driven I/O vs. Polling
17.7.2 - Interrupt Service Time
17.7.3 - Interrupt Latency
17.7.4 - Prioritized Interrupts
17.8 - Debugging ISRs



17.9 Summary

Chapter 18 - Resident Programs
18.1 - DOS Memory Usage and TSRs
18.2 - Active vs. Passive TSRs
18.3 - Reentrancy
18.3.1 - Reentrancy Problems with DOS
18.3.2 - Reentrancy Problems with BIOS
18.3.3 - Reentrancy Problems with Other Code
18.4 - The Multiplex Interrupt (INT 2Fh)
18.5 - Installing a TSR
18.6 - Removing a TSR
18.7 - Other DOS Related Issues
18.8 - A Keyboard Monitor TSR
18.9 - Semiresident Programs


18.10 Summary

Chapter 19 - Processes, Coroutines, and Concurrency
19.1 - DOS Processes
19.1.1 - Child Processes in DOS
19.1.1.1 - Load and Execute
19.1.1.2 - Load Program
19.1.1.3 - Loading Overlays
19.1.1.4 - Terminating a Process
19.1.1.5 - Obtaining the Child Process Return Code
19.1.2 - Exception Handling in DOS: The Break Handler
19.1.3 - Exception Handling in DOS: The Critical Error Handler
19.1.4 - Exception Handling in DOS: Traps
19.1.5 - Redirection of I/O for Child Processes
19.2 - Shared Memory
19.2.1 - Static Shared Memory
19.2.2 - Dynamic Shared Memory
19.3 - Coroutines
19.3.1 - AMAZE.ASM
19.3.2 - 32-bit Coroutines
19.4 - Multitasking
19.4.1 - Lightweight and HeavyWeight Processes
19.4.2 - The UCR Standard Library Processes Package
19.4.3 - Problems with Multitasking
19.4.4 - A Sample Program with Threads
19.5 - Synchronization
19.5.1 - Atomic Operations, Test & Set, and Busy-Waiting
19.5.2 - Semaphores
19.5.3 - The UCR Standard Library Semaphore Support
19.5.4 - Using Semaphores to Protect Critical Regions
19.5.5 - Using Semaphores for Barrier Synchronization
19.6 - Deadlock



19.7 Summary

Section Five: The PC's I/O Ports

Chapter 20 - The PC Keyboard
20.1 - Keyboard Basics
20.2 - The Keyboard Hardware Interface
20.3 - The Keyboard DOS Interface
20.4 - The Keyboard BIOS Interface
20.5 - The Keyboard Interrupt Service Routine
20.6 - Patching into the INT 9 Interrupt Service Routine
20.7 - Simulating Keystrokes
20.7.1 - Stuffing Characters in the Type Ahead Buffer
20.7.2 - Using the 80x86 Trace Flag to Simulate IN AL, 60H Instructions
20.7.3 - Using the 8042 Microcontroller to Simulate Keystrokes


20.8 Summary

Chapter 21 - The PC Parallel Ports
21.1 - Basic Parallel Port Information
21.2 - The Parallel Port Hardware
21.3 - Controlling a Printer Through the Parallel Port
21.3.1 - Printing via DOS
21.3.2 - Printing via BIOS
21.3.3 - An INT 17h Interrupt Service Routine
21.4 - Inter-Computer Communications on the Parallel Port



21.5 Summary

Chapter 22 - The PC Serial Ports
22.1 - The 8250 Serial Communications Chip
22.1.1 - The Data Register (Transmit/Receive Register)
22.1.2 - The Interrupt Enable Register (IER)
22.1.3 - The Baud Rate Divisor
22.1.4 - The Interrupt Identification Register (IIR)
22.1.5 - The Line Control Register
22.1.6 - The Modem Control Register
22.1.7 - The Line Status Register (LSR)
22.1.8 - The Modem Status Register (MSR)
22.1.9 - The Auxiliary Input Register
22.2 - The UCR Standard Library Serial Communications Support Routines
22.3 - Programming the 8250 (Examples from the Standard Library)

22.4 Summary

Chapter 23 - The PC Video Display
23.1 - Memory Mapped Video
23.2 - The Video Attribute Byte
23.3 - Programming the Text Display


23.4 Summary

Chapter 24 - The PC Game Adapter
24.1 - Typical Game Devices
24.2 - The Game Adapter Hardware
24.3 - Using BIOS' Game I/O Functions
24.4 - Writing Your Own Game I/O Routines
24.5 - The Standard Game Device Interface (SGDI)
24.5.1 - Application Programmer's Interface (API)
24.5.2 - Read4Sw
24.5.3 - Read4Pots:
24.5.4 - ReadPot
24.5.5 - Read4:
24.5.6 - CalibratePot
24.5.7 - TestPotCalibration
24.5.8 - ReadRaw
24.5.9 - ReadSwitch
24.5.10 - Read16Sw
24.5.11 - Remove
24.5.12 - TestPresence
24.5.13 - An SGDI Driver for the Standard Game Adapter Card
24.6 - An SGDI Driver for the CH Products' Flight Stick Pro'
24.7 - Patching Existing Games



24.8 Summary

Section Six: Optimization

25.1 - When to Optimize, When Not to Optimize
25.2 - How Do You Find the Slow Code in Your Programs?
25.3 - Is Optimization Necessary?
25.4 - The Three Types of Optimization
25.5 - Improving the Implementation of an Algorithm



25.6 Summary

Section Seven: Appendixes
Appendix A: ASCII/IBM Character Set
Appendix B: Annotated Bibliography
Appendix C: Keyboard Scan Codes
Appendix D: Instruction Set Reference
Section D1

Section D2

Section D3

Section D4

The Art of Assembly Language Programming - 30 SEP 1996

[Randall Hyde]

立即下载

上传者： ttlyfast 时间： 2007-12-20

HTML-DOM对象

********************************************* 4 浏览器对象 4 ********************************************* 4 1、Window 对象 4 1.1、集合 4 1.2、属性 4 1.3、方法 5 1.4、描述 6 2、History 对象 7 2.1、属性 7 2.2、方法 7 2.3、描述 8 3、Location 对象 8 3.1、属性 8 3.2、方法 9 4、Navigator 对象 9 4.1. Navigator 对象集合 9 4.2、Navigator 对象属性 9 4.3、Navigator 对象方法 10 4.4、Navigator 对象描述 10 ********************************************* 10 HTML DOM 对象 10 ********************************************* 10 1、Document 对象 10 1.1、集合 11 1.2、属性 11 1.3、方法 11 1.4、描述 12 2、Body 对象 12 2.1、属性 12 3、Frame 对象 13 3.1、属性 13 3.2、标准属性 13 4、Frameset 对象 14 4.1、属性 14 4.2、标准属性 14 5、IFrame 对象 14 5.1、属性 14 5.2、标准属性 15 6、Image 对象 15 6.1、属性 15 6.2、标准属性 16 6.3、事件句柄 16 7、Link 对象 17 7.1、属性 17 7.2、标准属性 17 8、Base 对象 17 9、Event 对象 18 9.1、事件句柄 18 9.2、鼠标 / 键盘属性 19 10、Meta 对象 19 10.1、属性 20 11、Style 对象 20 11.1、Style 对象的属性 20 11.2、Background 属性 20 11.3、Border 和 Margin 属性 21 11.4、Layout 属性 22 11.5、List 属性 23 11.6、Positioning 属性 24 11.7、Printing 属性 24 11.8、Table 属性 25 11.9、Text 属性 25 11.10、标准属性 26 12、Table 对象 26 12.1、Table 对象集合 26 12.2、Table 对象属性 26 12.3、标准属性 27 12.4、Table 对象方法 27 13、TableCell 对象 28 13.1、TableCell 对象属性 28 13.2、标准属性 29 14、TableRow 对象 29 14.1、TableRow 对象集合 29 14.2、TableRow 对象属性 29 14.3、TableRow 对象方法 30 ********************************************* 30 HTML FORM 对象 30 ********************************************* 30 1、Form 对象 30 1.1、Form 对象集合 30 1.2、Form 对象属性 30 1.3、标准属性 31 1.4、Form 对象方法 31 1.5、Form 对象事件句柄 31 2、Button 对象 31 2.1、Button 对象的属性 32 2.2、标准属性 32 2.3、Button 对象的方法 32 3、Checkbox 对象 33 3.1、Checkbox 对象的属性 33 3.2、标准属性 33 3.3、Checkbox 对象的方法 34 4、Radio 对象 34 4.1、Radio 对象属性 34 4.2、标准属性 35 4.3、Radio 对象方法 35 5、Text 对象 35 5.1、Text 对象属性 36 5.2、标准属性 36 5.3、Text 对象方法 36 6、Password 对象 37 6.1、Password 对象属性 37 6.2、Password 对象方法 38 7、Hidden 对象 38 7.1、Hidden 对象的属性 38 7.2、标准属性 39 8、Submit 对象 39 8.1、Submit 对象属性 39 8.2、Submit 对象方法 40 9、Reset 对象 40 9.1、Reset 对象属性 40 9.2、Reset 对象方法 41 10、Select 对象 41 10.1、Select 对象集合 41 10.1、Select 对象属性 41 10.2、Select 对象方法 42 10.3、Select 对象事件句柄 42 11、Option 对象 42 11.1、Option 对象的属性 42 12、FileUpload 对象 43 12.1、FileUpload 对象的属性 43 12.2、FileUpload 对象的方法 44 13、Textarea 对象 44 13.1、Textarea 对象属性 44 13.2、Textarea 对象方法 45 13.3、Textarea 对象事件句柄 45

立即下载

上传者： xylisong 时间： 2011-09-30

华为经典教材GPRS原理

第1章 GPRS概述 1 1.1 GPRS的产生 1 1.2 GPRS的发展 1 1.3 GPRS与HSCSD业务的比较 2 1.4 CSD与GPRS的比较 3 1.4.1 电路交换的通信方式 3 1.4.2 分组交换的通信方式 4 第2章 GPRS基本功能和业务 6 2.1 GPRS业务种类 6 第3章 GPRS基本体系结构和传输机制 8 3.1 GPRS接入接口和参考点 8 3.2 网络互通 8 3.3 逻辑体系结构 8 3.3.2 主要网络实体 10 3.3.3 主要网络接口 12 3.4 高层功能 14 3.4.1 网络接入控制功能 14 3.4.2 分组路由和转发功能 15 3.4.3 移动性管理功能 17 3.4.4 逻辑链路管理功能 17 3.4.5 无线资源管理功能 18 3.4.6 网络管理功能 18 3.5 功能分配 19 3.6 GPRS数据传输平面 20 3.7 GPRS信令平面 21 3.7.1 MS与SGSN间信令平面 21 3.7.2 SGSN与HLR间信令平面 22 3.7.3 SGSN与MSC/VLR间信令平面 22 3.7.4 SGSN与EIR间信令平面 23 3.7.5 SGSN与SMS-GMSC、SMS-IWMSC间信令平面 23 3.7.6 GPRS支持节点间信令平面 24 3.7.7 GGSN与HLR间信令平面 24 第4章 移动性管理 25 4.1 MM状态 25 4.1.1 IDLE状态 25 4.1.2 STANDBY状态 25 4.1.3 READY状态 26 4.2 MM状态功能 26 4.2.1 MM状态迁移 26 4.2.2 就绪定时器功能 27 4.2.3 周期性路由区更新定时器功能 28 4.2.4 用户可及定时器功能 28 4.3 SGSN与MSC/VLR的交互 29 4.3.1 SGSN-MSC/VLR关联的管理 29 4.3.2 组合RA/LA更新 29 4.3.3 CS寻呼协调及网络操作模式 30 4.4 MM规程 31 4.4.1 GPRS附着功能 31 4.4.2 GPRS分离规程 33 4.4.3 清除功能 36 4.5 安全性功能 36 4.5.1 用户鉴权 36 4.5.2 用户身份机密性 37 4.5.3 用户数据和GMM/SM信令机密性 37 4.5.4 用户身份检查 38 4.6 位置管理功能 38 4.6.1 小区更新规程 39 4.6.2 路由区更新规程 39 4.6.3 组合RA/LA更新规程 42 4.6.4 周期性路由区更新和位置区更新 43 4.7 用户数据管理功能 44 4.7.1 插入用户数据规程 44 4.7.2 删除用户数据规程 44 4.8 MS类标处理功能 45 第5章 无线资源管理功能 46 第6章 分组路由与传输功能 48 6.1 PDP状态和状态转换 48 6.2 会话管理规程 49 6.2.1 静态地址与动态地址 49 6.2.2 PDP上下文的激活规程 50 6.2.3 PDP上下文的修改 52 6.2.4 PDP上下文的去激活 53 6.3 业务流程举例 54 6.3.1 MS发起分组数据业务 54 6.3.2 网络发起分组数据业务 55 第7章 用户数据传输 57 7.1 传输模式 57 7.1.1 GTP传输模式 57 7.1.2 LLC传输模式 57 7.1.3 RLC传输模式 57 7.2 LLC功能 57 7.2.1 寻址 58 7.2.2 服务 58 7.2.3 功能 58 7.3 SNDCP功能 58 7.4 PPP功能 60 7.5 Gb接口 60 7.5.1 物理层 60 7.5.2 FR子层 60 7.5.3 NS子层 61 7.5.4 BSSGP层 61 7.6 Abis接口 62 7.6.1 结构A 63 7.6.2 结构B 64 7.6.3 结构C 64 第8章 信息存储 66 8.1 HLR 66 8.2 SGSN 67 8.3 GGSN 68 8.4 MS 69 8.5 MSC/VLR 70 第9章 编号 71 9.1 IMSI 71 9.2 P-TMSI 72 9.3 NSAPI/TLLI 72 9.3.1 NSAPI 72 9.3.2 临时逻辑链路标志（TLLI） 72 9.4 PDP地址和类型 73 9.5 TID 73 9.6 路由区识别 73 9.7 小区标识 74 9.8 GSN地址 74 9.9 接入点名字 74 第10章 运营方面的问题 75 10.1 计费信息 75 10.2 计费功能 75 10.2.1 分组型业务计费方式和电路型业务计费方式的区别 75 10.2.2 计费基本功能 76 10.2.3 话单类型 76 10.2.4 话单传送接口 77 10.3 网络服务质量（QoS） 77 10.3.1 优先级别 78 10.3.2 延时级别 78 10.3.3 可靠性级别 78 10.3.4 峰值吞吐量级别 78 10.3.5 平均吞吐量级别 79 10.4 消息过滤功能 80 10.5 兼容性问题 80 第11章 与GSM其它业务的交互 81 11.1 与点对点短消息业务关系 81 11.2 与电路交换业务的关系 81 11.3 与补充业务的关系 82 第12章 IP相关的基础知识 83 12.1 NAT 83 12.2 FIREWALL 83 12.3 GRE 83 12.4 DNS 84 12.5 RADIUS 84

立即下载

上传者： nocefly 时间： 2011-12-01

spring-boot-reference.pdf

I. Spring Boot Documentation 1. About the Documentation 2. Getting Help 3. First Steps 4. Working with Spring Boot 5. Learning about Spring Boot Features 6. Moving to Production 7. Advanced Topics II. Getting Started 8. Introducing Spring Boot 9. System Requirements 9.1. Servlet Containers 10. Installing Spring Boot 10.1. Installation Instructions for the Java Developer 10.1.1. Maven Installation 10.1.2. Gradle Installation 10.2. Installing the Spring Boot CLI 10.2.1. Manual Installation 10.2.2. Installation with SDKMAN! 10.2.3. OSX Homebrew Installation 10.2.4. MacPorts Installation 10.2.5. Command-line Completion 10.2.6. Quick-start Spring CLI Example 10.3. Upgrading from an Earlier Version of Spring Boot 11. Developing Your First Spring Boot Application 11.1. Creating the POM 11.2. Adding Classpath Dependencies 11.3. Writing the Code 11.3.1. The @RestController and @RequestMapping Annotations 11.3.2. The @EnableAutoConfiguration Annotation 11.3.3. The “main” Method 11.4. Running the Example 11.5. Creating an Executable Jar 12. What to Read Next III. Using Spring Boot 13. Build Systems 13.1. Dependency Management 13.2. Maven 13.2.1. Inheriting the Starter Parent 13.2.2. Using Spring Boot without the Parent POM 13.2.3. Using the Spring Boot Maven Plugin 13.3. Gradle 13.4. Ant 13.5. Starters 14. Structuring Your Code 14.1. Using the “default” Package 14.2. Locating the Main Application Class 15. Configuration Classes 15.1. Importing Additional Configuration Classes 15.2. Importing XML Configuration 16. Auto-configuration 16.1. Gradually Replacing Auto-configuration 16.2. Disabling Specific Auto-configuration Classes 17. Spring Beans and Dependency Injection 18. Using the @SpringBootApplication Annotation 19. Running Your Application 19.1. Running from an IDE 19.2. Running as a Packaged Application 19.3. Using the Maven Plugin 19.4. Using the Gradle Plugin 19.5. Hot Swapping 20. Developer Tools 20.1. Property Defaults 20.2. Automatic Restart 20.2.1. Logging changes in condition evaluation 20.2.2. Excluding Resources 20.2.3. Watching Additional Paths 20.2.4. Disabling Restart 20.2.5. Using a Trigger File 20.2.6. Customizing the Restart Classloader 20.2.7. Known Limitations 20.3. LiveReload 20.4. Global Settings 20.5. Remote Applications 20.5.1. Running the Remote Client Application 20.5.2. Remote Update 21. Packaging Your Application for Production 22. What to Read Next IV. Spring Boot features 23. SpringApplication 23.1. Startup Failure 23.2. Customizing the Banner 23.3. Customizing SpringApplication 23.4. Fluent Builder API 23.5. Application Events and Listeners 23.6. Web Environment 23.7. Accessing Application Arguments 23.8. Using the ApplicationRunner or CommandLineRunner 23.9. Application Exit 23.10. Admin Features 24. Externalized Configuration 24.1. Configuring Random Values 24.2. Accessing Command Line Properties 24.3. Application Property Files 24.4. Profile-specific Properties 24.5. Placeholders in Properties 24.6. Using YAML Instead of Properties 24.6.1. Loading YAML 24.6.2. Exposing YAML as Properties in the Spring Environment 24.6.3. Multi-profile YAML Documents 24.6.4. YAML Shortcomings 24.7. Type-safe Configuration Properties 24.7.1. Third-party Configuration 24.7.2. Relaxed Binding 24.7.3. Merging Complex Types 24.7.4. Properties Conversion Converting durations 24.7.5. @ConfigurationProperties Validation 24.7.6. @ConfigurationProperties vs. @Value 25. Profiles 25.1. Adding Active Profiles 25.2. Programmatically Setting Profiles 25.3. Profile-specific Configuration Files 26. Logging 26.1. Log Format 26.2. Console Output 26.2.1. Color-coded Output 26.3. File Output 26.4. Log Levels 26.5. Custom Log Configuration 26.6. Logback Extensions 26.6.1. Profile-specific Configuration 26.6.2. Environment Properties 27. Developing Web Applications 27.1. The “Spring Web MVC Framework” 27.1.1. Spring MVC Auto-configuration 27.1.2. HttpMessageConverters 27.1.3. Custom JSON Serializers and Deserializers 27.1.4. MessageCodesResolver 27.1.5. Static Content 27.1.6. Welcome Page 27.1.7. Custom Favicon 27.1.8. Path Matching and Content Negotiation 27.1.9. ConfigurableWebBindingInitializer 27.1.10. Template Engines 27.1.11. Error Handling Custom Error Pages Mapping Error Pages outside of Spring MVC 27.1.12. Spring HATEOAS 27.1.13. CORS Support 27.2. The “Spring WebFlux Framework” 27.2.1. Spring WebFlux Auto-configuration 27.2.2. HTTP Codecs with HttpMessageReaders and HttpMessageWriters 27.2.3. Static Content 27.2.4. Template Engines 27.2.5. Error Handling Custom Error Pages 27.2.6. Web Filters 27.3. JAX-RS and Jersey 27.4. Embedded Servlet Container Support 27.4.1. Servlets, Filters, and listeners Registering Servlets, Filters, and Listeners as Spring Beans 27.4.2. Servlet Context Initialization Scanning for Servlets, Filters, and listeners 27.4.3. The ServletWebServerApplicationContext 27.4.4. Customizing Embedded Servlet Containers Programmatic Customization Customizing ConfigurableServletWebServerFactory Directly 27.4.5. JSP Limitations 28. Security 28.1. MVC Security 28.2. WebFlux Security 28.3. OAuth2 28.3.1. Client 28.3.2. Server 28.4. Actuator Security 28.4.1. Cross Site Request Forgery Protection 29. Working with SQL Databases 29.1. Configure a DataSource 29.1.1. Embedded Database Support 29.1.2. Connection to a Production Database 29.1.3. Connection to a JNDI DataSource 29.2. Using JdbcTemplate 29.3. JPA and “Spring Data” 29.3.1. Entity Classes 29.3.2. Spring Data JPA Repositories 29.3.3. Creating and Dropping JPA Databases 29.3.4. Open EntityManager in View 29.4. Using H2’s Web Console 29.4.1. Changing the H2 Console’s Path 29.5. Using jOOQ 29.5.1. Code Generation 29.5.2. Using DSLContext 29.5.3. jOOQ SQL Dialect 29.5.4. Customizing jOOQ 30. Working with NoSQL Technologies 30.1. Redis 30.1.1. Connecting to Redis 30.2. MongoDB 30.2.1. Connecting to a MongoDB Database 30.2.2. MongoTemplate 30.2.3. Spring Data MongoDB Repositories 30.2.4. Embedded Mongo 30.3. Neo4j 30.3.1. Connecting to a Neo4j Database 30.3.2. Using the Embedded Mode 30.3.3. Neo4jSession 30.3.4. Spring Data Neo4j Repositories 30.3.5. Repository Example 30.4. Gemfire 30.5. Solr 30.5.1. Connecting to Solr 30.5.2. Spring Data Solr Repositories 30.6. Elasticsearch 30.6.1. Connecting to Elasticsearch by Using Jest 30.6.2. Connecting to Elasticsearch by Using Spring Data 30.6.3. Spring Data Elasticsearch Repositories 30.7. Cassandra 30.7.1. Connecting to Cassandra 30.7.2. Spring Data Cassandra Repositories 30.8. Couchbase 30.8.1. Connecting to Couchbase 30.8.2. Spring Data Couchbase Repositories 30.9. LDAP 30.9.1. Connecting to an LDAP Server 30.9.2. Spring Data LDAP Repositories 30.9.3. Embedded In-memory LDAP Server 30.10. InfluxDB 30.10.1. Connecting to InfluxDB 31. Caching 31.1. Supported Cache Providers 31.1.1. Generic 31.1.2. JCache (JSR-107) 31.1.3. EhCache 2.x 31.1.4. Hazelcast 31.1.5. Infinispan 31.1.6. Couchbase 31.1.7. Redis 31.1.8. Caffeine 31.1.9. Simple 31.1.10. None 32. Messaging 32.1. JMS 32.1.1. ActiveMQ Support 32.1.2. Artemis Support 32.1.3. Using a JNDI ConnectionFactory 32.1.4. Sending a Message 32.1.5. Receiving a Message 32.2. AMQP 32.2.1. RabbitMQ support 32.2.2. Sending a Message 32.2.3. Receiving a Message 32.3. Apache Kafka Support 32.3.1. Sending a Message 32.3.2. Receiving a Message 32.3.3. Additional Kafka Properties 33. Calling REST Services with RestTemplate 33.1. RestTemplate Customization 34. Calling REST Services with WebClient 34.1. WebClient Customization 35. Validation 36. Sending Email 37. Distributed Transactions with JTA 37.1. Using an Atomikos Transaction Manager 37.2. Using a Bitronix Transaction Manager 37.3. Using a Narayana Transaction Manager 37.4. Using a Java EE Managed Transaction Manager 37.5. Mixing XA and Non-XA JMS Connections 37.6. Supporting an Alternative Embedded Transaction Manager 38. Hazelcast 39. Quartz Scheduler 40. Spring Integration 41. Spring Session 42. Monitoring and Management over JMX 43. Testing 43.1. Test Scope Dependencies 43.2. Testing Spring Applications 43.3. Testing Spring Boot Applications 43.3.1. Detecting Web Application Type 43.3.2. Detecting Test Configuration 43.3.3. Excluding Test Configuration 43.3.4. Testing with a running server 43.3.5. Using JMX 43.3.6. Mocking and Spying Beans 43.3.7. Auto-configured Tests 43.3.8. Auto-configured JSON Tests 43.3.9. Auto-configured Spring MVC Tests 43.3.10. Auto-configured Spring WebFlux Tests 43.3.11. Auto-configured Data JPA Tests 43.3.12. Auto-configured JDBC Tests 43.3.13. Auto-configured jOOQ Tests 43.3.14. Auto-configured Data MongoDB Tests 43.3.15. Auto-configured Data Neo4j Tests 43.3.16. Auto-configured Data Redis Tests 43.3.17. Auto-configured Data LDAP Tests 43.3.18. Auto-configured REST Clients 43.3.19. Auto-configured Spring REST Docs Tests Auto-configured Spring REST Docs Tests with Mock MVC Auto-configured Spring REST Docs Tests with REST Assured 43.3.20. User Configuration and Slicing 43.3.21. Using Spock to Test Spring Boot Applications 43.4. Test Utilities 43.4.1. ConfigFileApplicationContextInitializer 43.4.2. TestPropertyValues 43.4.3. OutputCapture 43.4.4. TestRestTemplate 44. WebSockets 45. Web Services 46. Creating Your Own Auto-configuration 46.1. Understanding Auto-configured Beans 46.2. Locating Auto-configuration Candidates 46.3. Condition Annotations 46.3.1. Class Conditions 46.3.2. Bean Conditions 46.3.3. Property Conditions 46.3.4. Resource Conditions 46.3.5. Web Application Conditions 46.3.6. SpEL Expression Conditions 46.4. Testing your Auto-configuration 46.4.1. Simulating a Web Context 46.4.2. Overriding the Classpath 46.5. Creating Your Own Starter 46.5.1. Naming 46.5.2. autoconfigure Module 46.5.3. Starter Module 47. Kotlin support 47.1. Requirements 47.2. Null-safety 47.3. Kotlin API 47.3.1. runApplication 47.3.2. Extensions 47.4. Dependency management 47.5. @ConfigurationProperties 47.6. Testing 47.7. Resources 47.7.1. Further reading 47.7.2. Examples 48. What to Read Next V. Spring Boot Actuator: Production-ready features 49. Enabling Production-ready Features 50. Endpoints 50.1. Enabling Endpoints 50.2. Exposing Endpoints 50.3. Securing HTTP Endpoints 50.4. Configuring Endpoints 50.5. Hypermedia for Actuator Web Endpoints 50.6. Actuator Web Endpoint Paths 50.7. CORS Support 50.8. Implementing Custom Endpoints 50.8.1. Receiving Input Input type conversion 50.8.2. Custom Web Endpoints Web Endpoint Request Predicates Path HTTP method Consumes Produces Web Endpoint Response Status Web Endpoint Range Requests Web Endpoint Security 50.8.3. Servlet endpoints 50.8.4. Controller endpoints 50.9. Health Information 50.9.1. Auto-configured HealthIndicators 50.9.2. Writing Custom HealthIndicators 50.9.3. Reactive Health Indicators 50.9.4. Auto-configured ReactiveHealthIndicators 50.10. Application Information 50.10.1. Auto-configured InfoContributors 50.10.2. Custom Application Information 50.10.3. Git Commit Information 50.10.4. Build Information 50.10.5. Writing Custom InfoContributors 51. Monitoring and Management over HTTP 51.1. Customizing the Management Endpoint Paths 51.2. Customizing the Management Server Port 51.3. Configuring Management-specific SSL 51.4. Customizing the Management Server Address 51.5. Disabling HTTP Endpoints 52. Monitoring and Management over JMX 52.1. Customizing MBean Names 52.2. Disabling JMX Endpoints 52.3. Using Jolokia for JMX over HTTP 52.3.1. Customizing Jolokia 52.3.2. Disabling Jolokia 53. Loggers 53.1. Configure a Logger 54. Metrics 54.1. Getting started 54.2. Supported monitoring systems 54.2.1. Atlas 54.2.2. Datadog 54.2.3. Ganglia 54.2.4. Graphite 54.2.5. Influx 54.2.6. JMX 54.2.7. New Relic 54.2.8. Prometheus 54.2.9. SignalFx 54.2.10. Simple 54.2.11. StatsD 54.2.12. Wavefront 54.3. Supported Metrics 54.3.1. Spring MVC Metrics 54.3.2. Spring WebFlux Metrics 54.3.3. RestTemplate Metrics 54.3.4. Cache Metrics 54.3.5. DataSource Metrics 54.3.6. RabbitMQ Metrics 54.4. Registering custom metrics 54.5. Customizing individual metrics 54.5.1. Per-meter properties 54.6. Metrics endpoint 55. Auditing 56. HTTP Tracing 56.1. Custom HTTP tracing 57. Process Monitoring 57.1. Extending Configuration 57.2. Programmatically 58. Cloud Foundry Support 58.1. Disabling Extended Cloud Foundry Actuator Support 58.2. Cloud Foundry Self-signed Certificates 58.3. Custom context path 59. What to Read Next VI. Deploying Spring Boot Applications 60. Deploying to the Cloud 60.1. Cloud Foundry 60.1.1. Binding to Services 60.2. Heroku 60.3. OpenShift 60.4. Amazon Web Services (AWS) 60.4.1. AWS Elastic Beanstalk Using the Tomcat Platform Using the Java SE Platform 60.4.2. Summary 60.5. Boxfuse and Amazon Web Services 60.6. Google Cloud 61. Installing Spring Boot Applications 61.1. Supported Operating Systems 61.2. Unix/Linux Services 61.2.1. Installation as an init.d Service (System V) Securing an init.d Service 61.2.2. Installation as a systemd Service 61.2.3. Customizing the Startup Script Customizing the Start Script when It Is Written Customizing a Script When It Runs 61.3. Microsoft Windows Services 62. What to Read Next VII. Spring Boot CLI 63. Installing the CLI 64. Using the CLI 64.1. Running Applications with the CLI 64.1.1. Deduced “grab” Dependencies 64.1.2. Deduced “grab” Coordinates 64.1.3. Default Import Statements 64.1.4. Automatic Main Method 64.1.5. Custom Dependency Management 64.2. Applications with Multiple Source Files 64.3. Packaging Your Application 64.4. Initialize a New Project 64.5. Using the Embedded Shell 64.6. Adding Extensions to the CLI 65. Developing Applications with the Groovy Beans DSL 66. Configuring the CLI with settings.xml 67. What to Read Next VIII. Build tool plugins 68. Spring Boot Maven Plugin 68.1. Including the Plugin 68.2. Packaging Executable Jar and War Files 69. Spring Boot Gradle Plugin 70. Spring Boot AntLib Module 70.1. Spring Boot Ant Tasks 70.1.1. spring-boot:exejar 70.1.2. Examples 70.2. spring-boot:findmainclass 70.2.1. Examples 71. Supporting Other Build Systems 71.1. Repackaging Archives 71.2. Nested Libraries 71.3. Finding a Main Class 71.4. Example Repackage Implementation 72. What to Read Next IX. ‘How-to’ guides 73. Spring Boot Application 73.1. Create Your Own FailureAnalyzer 73.2. Troubleshoot Auto-configuration 73.3. Customize the Environment or ApplicationContext Before It Starts 73.4. Build an ApplicationContext Hierarchy (Adding a Parent or Root Context) 73.5. Create a Non-web Application 74. Properties and Configuration 74.1. Automatically Expand Properties at Build Time 74.1.1. Automatic Property Expansion Using Maven 74.1.2. Automatic Property Expansion Using Gradle 74.2. Externalize the Configuration of SpringApplication 74.3. Change the Location of External Properties of an Application 74.4. Use ‘Short’ Command Line Arguments 74.5. Use YAML for External Properties 74.6. Set the Active Spring Profiles 74.7. Change Configuration Depending on the Environment 74.8. Discover Built-in Options for External Properties 75. Embedded Web Servers 75.1. Use Another Web Server 75.2. Disabling the Web Server 75.3. Configure Jetty 75.4. Add a Servlet, Filter, or Listener to an Application 75.4.1. Add a Servlet, Filter, or Listener by Using a Spring Bean Disable Registration of a Servlet or Filter 75.4.2. Add Servlets, Filters, and Listeners by Using Classpath Scanning 75.5. Change the HTTP Port 75.6. Use a Random Unassigned HTTP Port 75.7. Discover the HTTP Port at Runtime 75.8. Configure SSL 75.9. Configure HTTP/2 75.9.1. HTTP/2 with Undertow 75.9.2. HTTP/2 with Jetty 75.9.3. HTTP/2 with Tomcat 75.10. Configure Access Logging 75.11. Running Behind a Front-end Proxy Server 75.11.1. Customize Tomcat’s Proxy Configuration 75.12. Configure Tomcat 75.13. Enable Multiple Connectors with Tomcat 75.14. Use Tomcat’s LegacyCookieProcessor 75.15. Configure Undertow 75.16. Enable Multiple Listeners with Undertow 75.17. Create WebSocket Endpoints Using @ServerEndpoint 75.18. Enable HTTP Response Compression 76. Spring MVC 76.1. Write a JSON REST Service 76.2. Write an XML REST Service 76.3. Customize the Jackson ObjectMapper 76.4. Customize the @ResponseBody Rendering 76.5. Handling Multipart File Uploads 76.6. Switch Off the Spring MVC DispatcherServlet 76.7. Switch off the Default MVC Configuration 76.8. Customize ViewResolvers 77. HTTP Clients 77.1. Configure RestTemplate to Use a Proxy 78. Logging 78.1. Configure Logback for Logging 78.1.1. Configure Logback for File-only Output 78.2. Configure Log4j for Logging 78.2.1. Use YAML or JSON to Configure Log4j 2 79. Data Access 79.1. Configure a Custom DataSource 79.2. Configure Two DataSources 79.3. Use Spring Data Repositories 79.4. Separate @Entity Definitions from Spring Configuration 79.5. Configure JPA Properties 79.6. Configure Hibernate Naming Strategy 79.7. Use a Custom EntityManagerFactory 79.8. Use Two EntityManagers 79.9. Use a Traditional persistence.xml File 79.10. Use Spring Data JPA and Mongo Repositories 79.11. Expose Spring Data Repositories as REST Endpoint 79.12. Configure a Component that is Used by JPA 79.13. Configure jOOQ with Two DataSources 80. Database Initialization 80.1. Initialize a Database Using JPA 80.2. Initialize a Database Using Hibernate 80.3. Initialize a Database 80.4. Initialize a Spring Batch Database 80.5. Use a Higher-level Database Migration Tool 80.5.1. Execute Flyway Database Migrations on Startup 80.5.2. Execute Liquibase Database Migrations on Startup 81. Messaging 81.1. Disable Transacted JMS Session 82. Batch Applications 82.1. Execute Spring Batch Jobs on Startup 83. Actuator 83.1. Change the HTTP Port or Address of the Actuator Endpoints 83.2. Customize the ‘whitelabel’ Error Page 84. Security 84.1. Switch off the Spring Boot Security Configuration 84.2. Change the UserDetailsService and Add User Accounts 84.3. Enable HTTPS When Running behind a Proxy Server 85. Hot Swapping 85.1. Reload Static Content 85.2. Reload Templates without Restarting the Container 85.2.1. Thymeleaf Templates 85.2.2. FreeMarker Templates 85.2.3. Groovy Templates 85.3. Fast Application Restarts 85.4. Reload Java Classes without Restarting the Container 86. Build 86.1. Generate Build Information 86.2. Generate Git Information 86.3. Customize Dependency Versions 86.4. Create an Executable JAR with Maven 86.5. Use a Spring Boot Application as a Dependency 86.6. Extract Specific Libraries When an Executable Jar Runs 86.7. Create a Non-executable JAR with Exclusions 86.8. Remote Debug a Spring Boot Application Started with Maven 86.9. Build an Executable Archive from Ant without Using spring-boot-antlib 87. Traditional Deployment 87.1. Create a Deployable War File 87.2. Convert an Existing Application to Spring Boot 87.3. Deploying a WAR to WebLogic 87.4. Use Jedis Instead of Lettuce X. Appendices A. Common application properties B. Configuration Metadata B.1. Metadata Format B.1.1. Group Attributes B.1.2. Property Attributes B.1.3. Hint Attributes B.1.4. Repeated Metadata Items B.2. Providing Manual Hints B.2.1. Value Hint B.2.2. Value Providers Any Class Reference Handle As Logger Name Spring Bean Reference Spring Profile Name B.3. Generating Your Own Metadata by Using the Annotation Processor B.3.1. Nested Properties B.3.2. Adding Additional Metadata C. Auto-configuration classes C.1. From the “spring-boot-autoconfigure” module C.2. From the “spring-boot-actuator-autoconfigure” module D. Test auto-configuration annotations E. The Executable Jar Format E.1. Nested JARs E.1.1. The Executable Jar File Structure E.1.2. The Executable War File Structure E.2. Spring Boot’s “JarFile” Class E.2.1. Compatibility with the Standard Java “JarFile” E.3. Launching Executable Jars E.3.1. Launcher Manifest E.3.2. Exploded Archives E.4. PropertiesLauncher Features E.5. Executable Jar Restrictions E.6. Alternative Single Jar Solutions F. Dependency versions

立即下载

上传者： v_v_an_ 时间： 2018-05-18