172 16 0 0

; Ready to switch to protected mode moveax, Cr0oreax, 1movcr0, eax; Really enter the protection mode Jmpdword selectorcode32:0; The execution of this sentence will be loaded into CS SelectorCode32; and jump to the code32selector:0 place.This period of time in an operating system implementationGood book, thank you, author.These two days have been tangled in;JMP DWORD selectorcode32:

Tags: jsp2014-05-16 11:29 2972 People read comments (0) favorite reports Classification:JSP(1) Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.How the JSP disables cachingUsing server-side control Ajax page Caching:Response.setheader ("Pragma", "No-cache");Response.AddHeader ("Cache-control", "must-revalidate");Response.AddHeader ("Cache-control"

Very often when we create some view dynamically, we need to determine the layout of the other view by obtaining their width and height, but OnCreate () gets the width and height of the view to get 0.view.getwidth () and View.getheight () is the root cause of 0 because the control hasn't finished drawing yet, you have to wait for the system to finish drawing the view before you can get it. This situation occ

4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total submissions: 20020 accepted: 5977 Case Time Limit: 5000MS Description The SUM problem can be formulated as Follows:given four lists A, B, C, D of an integer values, compute how many Quadruplet (A, B, C, D) ∈a x B x C x D are such that A + B + c + d = 0. In the following, w

Any high-level language needs a programming environment of its own, which is like writing, needing paper and pens, writing on a computer, and having word processing software, such as office with various names. Pen and paper and office software, is the hardware or software to write things, in short, those words can only be written on that top, in order to finally become an article. So programming is also, what kind of program to have something, to write the program to the top, in order to form th

, and names of any identifiers. Key Words Description Abstract Abstract methods, modifiers for abstract classes Assert Whether the assertion condition satisfies Boolean Boolean Data types Break Jump out of a loop or label code snippet Byte 8-bit Signed data types Case A condition for a switch statement Catch Match the try with catch exception inf

Document directory Input Output Sample Timus 1209. 1, 10,100,100 0... requires that the value at the specified position of a specific sequence be given. 1209. 1, 10,100,100 0... time limit: 1.0 second Memory limit: 16 mblet's consider an infinite sequence of digits constructed of ascending powers of 10 written one after another. Here is the beginning of the

One, code.-(void) viewdidload{ [Super Viewdidload]; Do any additional setup after loading the view. NSLog (@ "--float-%@-", [self stringdisposewithfloat:9.000899990000]); } #pragma-mark-functions//floating-point number to process and remove excess 0-(NSString *) Stringdisposewithfloat: (float) floatvalue{nsstring *str = [ NSString stringwithformat:@ "%f", Floatvalue]; Long len = str.length; for (int i =

The children who want to learn the compilation probably wondered: The maximum addressing of 8086cpu is 1 MB = fffffh = FFFF: 000f. Why is the input of FFFF: FFFF in debug valid and has data displayed ??? This is the 8086cpu address bypass problem: Ffff0 + fff0 = 10 ffe0 In this way, the first 1 of 1 will overflow, so the actual address should be 0ffe0 Dosbox: It is confirmed that the address FFFF: fff0 is 0000: ffe0, so why does it generate address redirection? 8086 there are only 20 address li

each group is exactly the same, but if the two disks in a group are broken, the entire raid 10 is broken, but this rarely happens, therefore, data security is still high. Raid 01: Raid 01 is now made of RAID 0 at the underlying layer, and then combines RAID 0 into RAID 1. Therefore, there are at least four hard disks, but if it is an 8-speed disk or 16 disks, d

A friend asked me on QQ that the pfile and spfile of his database were gone. I asked him whether the database was 10 Gb or 11 GB. He said 11 GB, so I asked him to use this syntax to create spfile: SQL> Create spfile from memory; This is a new feature of Oracle 11g. In my new features of Oracle 11g, we will introduce the following: New Features of Oracle 11g-instructions for managing spfile Http://blog.csdn.net/tianlesoftware/article/details/8225247 After a friend uses this method, the follow

trigger: Author Site gzip compression usage comparison: Site location: First (use): Site location: First (stop using) Site snapshots: The next day (use): Site location: The next day (stop using) Domain Location: 16-bit (use): Domain location: 10 (stop using) Domain Snapshot: 1 days (use): Domain snapshot: Next day (stop using) Site gzip compression usage process: At present, the main webmaster are aware of gzip compression brought

direction of the histogram statistics, to obtain a 9-dimensional eigenvector, Each adjacent 4 units constitute a block, the feature vectors in a block are combined to obtain a 36-dimensional eigenvector, the sample image is scanned with blocks, the scanning step is a unit. Finally, the characteristics of the human body are obtained by concatenating the features of all blocks together. For example, for 64*128 images, each 2*2 unit (16*

Today in the program appeared a bugger, debugging for a long time, finally found that the original is the problem.An experiment was done:Alert (parseint ("01")), when this value is 01==== "07 o'clock is normal, but in" 08 "," 09 "will return 0(This behavior occurs in the IE kernel browser, such as the 360 browser will appear this error) (Google, Firefox is not affected)。Access to information on the causes of this phenomenon:Explanation of the Great Go

% 256f % 2577% 2572% 2564% 2520% 2566% 2572% 256f % 256d % 2520% 254b % 2553% 255f % 2541% 256d % 2564% maid % 2500With the conversion code:[Code]Error_reporting (E_ERROR );Set_time_limit (0 );Print_r ('========================================================== ==========================================================Kesioncms command line Conversion Program------ By conqu3r========================================================== ==================

There are unlimited number of currency notes of 1, 5, 10, 20, and 50 denominations. How many methods can be used to generate RMB 100? Stupid method: Brute Force enumeration ~ 1 # include 2 # include 3 using namespace STD;45 const int Len = 5;6 int ans = 0;7 int M [Len] = {50, 20, 10, 5, 1 };8 inttotal [Len] = {2, 5, 10, 20,100 };9 int N [Len];10 int sum = 100;1112 Void getnum (int m [], int N [])13 {// Method 1: similar to n-digit K-enumeration, phone number word14 While (true)15 {

"Fortune Bar Resource Network Sharing" course is very complete, is also very 0 basis, suitable for any student, there is a need to download to see!Course Catalogue:1th Chapter Adobe Photoshop CS6Lesson 1 Adobe Photoshop CS6 Basics 52:24Lesson 2 Creating and editing a selection (top) 46:57Lesson 3 Creating and editing a selection (bottom) 48:59Lesson 4 mastering Layers and group layers (top) 48:01Lesson 5 mastering Layers and layer groups (bottom) 57:3

= 666;int64 Longvalue = 2147483648; Single Floatvalue = 3.14f;double Doublevalue = 999.99;decimal Decimalvalue = 86400.35627m;In JavaScript there is only one numeric type, the number type, which includes integers and floating-point numbers.There are 3 special representations of the number types of javascript: Inifiity: Infinity of Positive -inifity: Negative Infinity NaN: Non-numeric (not a number) The following JS code defines 5 variables, representing each of the 5 cases

Dividend = Integer. parseInt (args [0]) parameter problem, integer. parseint Parameter Let's start with a piece of code: 1 package yichang; 2 3 public class MyExceptionTest {4 5 public static void main (String [] args) {6 int dividend = 0; 7 int divisor; 8 int result = 0; 9 try {10 dividend = Integer. parseInt (args [0

4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 20015 Accepted: 5974 Case Time Limit: 5000MS DescriptionThe SUM problem can formulated as Follows:given four lists A, B, C, D of an integer values, compute how many quadruplet ( A, B, C, D) ∈a x B x C x D is such that A + B + c + d = 0. In the fo