Based on researching on the characteristic of the source code of dynamic Web Page,a method which guides the exploiter to encrypt the source code is designed in the process of exploitation. The content displayed to the client is saved as the corresponding character string variable after compiled and they are encrypted. Then the dynamic Web Page is built the static file automatically.
5. to cut the words containing no less than 5 syllables and tag their parts of speech; to select 3 and 4-character strings and adjacent character strings (bi-grams) which conform to grammatical combinational rules such as "N+N" , "N+V" , "V+V" and so on, then repeat step 3 and 4 on the selected character strings.
s:This paper put forward a kind of improved genetic algorithm which combines the complex shape method with genetic algorithm and retains the good points of the original algorithm but overcomes some of their weak points suck as the operation of binary character strings, slow convergence speed and low probability for attaining the overall situational optimal solution etc.
Then,agent can use this pattern to match other text string in the rest of the file. The intera ctive praesssinphifies the Complexity of dynamic text search,and makes the interaction between people and Computers more friendly.
Precise locating of character string is realized by exploiting horizontal projection and character arragements of binary images in horizontal and vertical directions respectively.
The hashing function is defined in terms of a trie, which is basically a binary tree where a character string is associated implicitly with each node.
Based on this cut-off criterion, a fast algorithm has been developed to find the nearest neighbors of a given character string in a dictionary.
It is demonstrated here that by introduction of three new operators, namely,position, fraction, andconcatenation, expressions of typical programming languages can be executed with a unified method starting from the character string.
Using a semiring interpretation, the weight of a morphological analysis result represents the possible linguistic interpretations of an input word, while the resulting character string itself represents the lemma of the input.