71 results about "Document tree" patented technology

A system and methods for simultaneous editing of a document by two or more users are disclosed. The document is divided into a number of sections. Each section is stored in a separate data container, which is part of a document tree. A master copy of the document tree is accessible to a server which transmits all or part of the document tree to two or more clients, each of which is operated by a user. The clients can independently lock different sections, allowing the users to simultaneously edit different sections. When a user completes editing a section, the modified section is stored on the master server and broadcast to other users. The document tree is headed by an independently lockable and editable parent container which is used to store summary information and other information, such as default formatting and other document wide information.

The present invention relates to an information processing apparatus and method adapted to automatically convert contents edited by a user into a description language that is independent of platforms. Personal computers 3-1 through 3-N (hereafter generically referred to as a personal computer 3) execute authoring software 21-1 through 21-N respectively, convert the contents edited by the user into a markup language document, and transmit it to a server 1 via the Internet 2. The server 1 stores the markup language document 12 supplied from the personal computer 3 into a HDD 10 and executes a markup language processing processor 11 to develop the markup language document 12 into a markup language document tree structure 13, which is stored in the HDD 10. The present invention is applicable to a contents editing/distributing system for distributing contents.

A system and method is provided for efficiently adapting information content for an electronic device. A normalizer includes a template normalizer for matching and applying a document tree to a template tree, and applying changes to the document tree. If the template normalizer does not find an appropriate template match, an automatic normalizer is utilized. The automatic normalizer utilizes weighting heuristics and pattern recognition with formatting rules to partition content into folders. The automatic normalizer can also utilize embedded normalization markup in the information content to assist in normalizing the information content. Information content can be represented by document object tree. A document object tree is created by storing information relating to the information content into arrays. The stored information describes a document object tree structure and tree dependencies as a mutable object.

The HTML/XML tree synchronization module synchronizes a document with a view or multiple views, after a change has been made to the document. First, the tree synchronization module receives a document change from an application program. An update processor converts the tree data of the document to a character string, and receives document change information from one or more application program interfaces. The update processor utilizes the document change information to update the document tree data character string. The document change information is then sent to one or more application program interfaces to determine the scope and content of the document views. A log generator receives the view change information, and creates record logs for each changed document view. These logs are played by a log player to each view, and each view data tree is updated with the view changes contained in the change logs. The tree synchronization module sends the subsequent view changes to the application program to update the display views.

A method, system and apparatus for processing interactive content off-line in a dynamic system having transient addressability. A method for processing off-line interactive content in a dynamic system with variable addressability can include serving content for caching in a client device; generating a pathway navigation map (PNM) for the served content; and, annotating the served content with endpoint directives for modifying hyperlink behavior referenced by the directives in the cached content. In a preferred aspect of the invention, the generating step can include forming a document tree having a plurality of nodes; assigning each node of the tree to a document in the content accessible through a hyperlink referenced by a parent node; and, disposing within each node a set of hyperlink references to child pages in the content and a reference to a pathway to a root node of the document tree.

The invention discloses a method for binding Java and XML data, which comprises the following steps of: 1) designing an XML document; 2) creating a Java class corresponding to an element according to the structure of the XML document; 3) setting a corresponding relationship between the XML element and the Java class; 4) realizing a disorganization algorithm, adopting a recursive algorithm to transverse an XML document tree, and creating a Java object corresponding to the structure of the XML document; 5) realizing a grouping algorithm, adopting the recursive algorithm to transverse a Java object tree, and creating an XML document corresponding to the whole Java object tree; and 6) realizing a disorganization class and a grouping class. The method realizes bidirectional data mapping binding between the Java object and the XML document, simplifies development work by using the XML, realizes an automation process from resolving the XML document to creating the Java object, and can write the modified Java object back to the XML document and conveniently adapt to the change of the structure of the XML document by modifying few Java codes.

The invention belongs to the database technical field and particularly provides a novel XML file compression algorithm, which comprises the following steps: a. dividing an XML file into 64k document fragments; b. calculating differences among document fragments; and c. compressing the differences among document fragments. The decompression algorithm comprises the sequentially opposite steps to the compression algorithm. The XML file compression algorithm is an efficient XML file compression algorithm based on file difference calculation. By dividing an XML document tree, XDrill excavates redundant information inside a document and among documents, thereby achieving a good compression effect. Compared with the traditional XML compression algorithm, XDrill has the advantages of lower intensity of document operation and more flexible use.

The embodiment of the invention discloses a method for accurately extracting webpage content. The method particularly comprises the following steps: webpage content corresponding to a URL (uniform resource locator) is obtained, and source codes of the webpage content is analyzed into a DOM (document object model) structure tree; a screening expression input by a user is read; a syntactic analyzer uploads a grammar table, and the screening expression is analyzed into an expression tree composed of multiple words; the multiple words are analyzed to obtain a screening condition set as per semantic analysis; the screening condition set is composed of multiple screening condition objects; and each screening condition object is composed of a tag extracting method and multiple tag screening methods. The embodiment of the invention further discloses a system for accurately extracting webpage content. With adoption of the method and the system, the screening expression is recombined into an optimized expression tree through grammatical analysis and forms a set of multiple screening condition objects through semantic analysis, so that acquisition positioning and quick screening of DOM document tree nodes can be realized. With adoption of the method and the system, improvement of development efficiency and reduction of maintenance cost are facilitated.

The invention discloses a plug-in software designing method based on a document tree and a message pump. The method comprises the following steps of: splitting software into a plurality of plug-ins according to functions, wherein each plug-in corresponds to one or more functional modules and is divided into a model layer, a view layer and a control layer; and extracting data and documents in the model layers of all the plug-ins to form a management document with a tree structure. By the method, communication between the modules is quickened and simplified, and extensibility and maintainability of a system are improved. On the aspect of view management of the plug-ins, views are uniformly managed by adopting a framework container; and by the method, as long as the document data of a new plug-in are derived from the same base class, the document can be connected to the document tree, so that extension of the software functions is facilitated.

The invention discloses an XML (Extensible Markup Language) document structure based on an extended adjacent matrix and a semantic similarity calculation method, belonging to the technical field of data excavation. The method concretely comprises the following steps of: encoding an XML document tree; as for two encoded documents, generating a schema document node list and a data source document node list firstly and then generating a schema extended adjacent matrix and a data source extended adjacent matrix (P1, P2); and calculating the similarity of XML documents through cos (P1, P2). In the method, different contributions of nodes with different levels to the documents are fully considered, and the highest time complexity of the method is O (n2) under the condition that the amount of the XML document node is n and is prior to that of an edit distance algorithm.

A phishing webpage detection method comprises a first step of performing webpage style feature extraction: extracting document tree structures and CSS texts of a suspicious webpage (Ps) and a webpage visible part of a target webpage (Pi); a second step of webpage style characteristic screening: screening elements in Tree (Ps) and Tree (Pi), analyzing the CSS texts of the suspicious webpage (Ps) and the target webpage (Pi), obtaining corresponding rule object sets, and screening all rule objects; a third step of performing webpage similarity calculation: respectively calculating webpage style complexity C(Ps) and C(Pi) and webpage style matching degree M(Ps, Pi) of the suspicious webpage (Ps) and the target webpage (Pi); and a fourth step of performing result judgment: judging whether the Ps is a phishing webpage according to calculation results obtained in the third step and domain names of the suspicious webpage (Ps) and the target webpage (Pi).

The invention discloses a document analysis method and a device, computer equipment and a storage medium. The method can comprise the steps of segmenting a to-be-processed document in a preset formatinto text nodes; aiming at the preset type of text nodes, respectively carrying out the following processing: obtaining chapter mode information of the text nodes; determining the hierarchy of the text node according to the chapter mode information; and adding the text nodes into the constructed document tree according to the hierarchy. By applying the method provided by the invention, hierarchical analysis and the like of the document can be realized.

The invention discloses a query workload estimation-based extensible markup language (XML) fragmentation method, which comprises the following steps of: (1) coding each node in an XML tree by adopting an interval code Zhang coding rule; (2) generating a related XPath query step for each node, and adding the XPath query steps into an XPath queue; (3) recursively estimating the query workload of each node from the root node of the XML document tree by adopting a depth priority traversing sequence; (4) dividing the XML document tree into sub trees, the query workload of which is W0, according tothe query workload estimation result; and (5) sequencing the separated XML fragments according to the query workload estimation values, and distributing the XML fragments to the processing nodes in a'double-square' mode. By the method, the query workload estimation is performed only by using an XML document structure, query of a user does not need to be known, and the query workload estimation values are used as XML storage measurement, so that better query load balance and extensibility support are achieved.

A computer readable storage medium includes executable instructions to convert a destination document into a destination document tree hierarchy. The destination document tree hierarchy is flattened into a destination document hash table comprising a set of destination document keys and a set of destination document values. A source document is converted into a source document tree hierarchy. The source document tree hierarchy is flattened into a source document hash table comprising a set of source document key-value pairs. A source document key-value pair comprising a key and a value is identified, where the key is not in the set of destination document keys. The source document key-value is added to a changelist. A destination document key is identified, where the destination document key is not a key in a key-value pair in the set of source document key-value pairs. The destination document key is added to the changelist.

A method and apparatus for browsing content-based documents are provided. The method includes analyzing documents to generate a document tree on the basis of content-based components, and presenting the documents on the basis of the generated document tree to be adaptive to a browsing environment. Thus, the method can be applied to a browsing environment having various platforms and display devices without having to reproduce the web documents.

The invention discloses an extensible markup language (XML) document tree example query method, and belongs to the field of fuzzy query. The method comprises the following steps of: 1) converting XML documents in a database and XML documents to be queried into document trees respectively; 2) selecting XML document trees, the node number of which is in a set range, in the XML document tree database according to the XML document trees to be queried to obtain a data set to be calculated; 3) calculating the similarity between the XML document trees to be queried and the XML document trees in the data set to obtain a candidate query result set; 4) calculating the edit distance between the XML document trees to be queried and the XML document trees in the candidate query result set; and 5) ordering the XML document trees in the candidate query result set according to the edit distance calculated in the 4) to obtain query results. Compared with the prior art, the method greatly improves the query efficiency, and tolerates errors of target data and input to a certain degree at the same time.

The invention discloses a compression method for extensive makeup language (XML) data node coding. The compression method for the XML data node coding comprises the following steps: generating XML data into an XML document tree; encoding each node in the XML document tree; and compressing and storing the node coding. The compression method for the XML data node coding is a compression method without any damages and has the advantages of being simple and easy to use. The coding and the coding compression rules are simple, so that comprehension is easy and programming is convenient to achieve. Decompression is rapid and an encoding operation is benefited. When the coding is compressed, the structure information of the coding is still kept, so that decompression is not needed and the special structural relationship can be judged by comparing bit strings directly. By adopting sectional compression, the integers of the coding can not affect each other. When a decompression operation is conducted, the bit strings do not need to be decompressed all. The decompression can be conducted in order as needed by section, so that the performance of the coding operation is improved.