A method and system are provided for classifying semi-structured documents. According to one embodiment, the method includes accessing a number of documents, and identifying in each of the documents pairs of character segments. The method also includes generating a map of unique identified segment pairs across all documents in the several documents. The method further includes generating for each of the several documents a respective feature vector based on one or more unique pair of segments in the map that are also identified in the document, and clustering the plurality of documents into a plurality of clusters, using the feature vectors.

Embodiments of the invention may be used to improve enforcement and compliance with publishing rules in an automated and provable manner. Prior to publication, documents may be processed using publishing rules (workflows) based on conceptual analysis of document content. Additionally, embodiments of the invention include a content creation system configured to provide prompt feedback on content coverage. Such a system enables the creator of information to better understand what approval requirements apply to content they create and intend to publish, as the content is being created.

A computer-implemented method for generating by a query engine a graph of operators for a SPARQL query over an RDF graph. The method includes obtaining a graph of operators executable by the query engine, the graph comprising a plurality of basic operators, at least two of said operators being of a first type each configured to find RDF triples of the RDF graph that match a respective basic graph pattern. The method further comprises identifying a group of operators among the at least two basic operators of the graph which are of the first type. The respective basic graph patterns of the group of operators have same subject and/or predicate and/or object and the identified group of operators is replaced in the graph by an equivalent operator configured to find RDF triples of the RDF graph that match the respective basic graph patterns of the group of operators.

Some described embodiments relate to techniques for editing markup elements of a markup language document to emphasize a portion of the visible content elements of the markup language document. The techniques may be implemented in any suitable manner, including via scripting language code (e.g., JavaScript) that is incorporated into the markup language document but is not preconfigured with information regarding the markup language document or any other markup language document. The scripting language code may perform the editing automatically, and based on an automatic analysis of markup elements of the markup language document. Some embodiments may include determining the portion of the markup language document to be emphasized by identifying content of interest to a user, including by determining a set of related content through analyzing a structure of markup elements of the markup language document and/or layout of visible content elements of the markup language document.

The present invention is in the technical field of computer-assisted document preparation. A computer software-based mark-up language is disclosed. The computer software-based mark-up language may be written within the existing native code yet not executed by the native code compiler. The computer software-based mark-up language disclosed allows for computer-assisted patent application preparation.

A graphics processing system comprises a memory that stores graphics data. The graphics data stored in the memory is accessible using virtual memory addresses that map to physical memory addresses in the memory. The graphics processing system further comprises page merging circuitry configured to use metadata provided for a set of graphics data to determine whether any pages of the set of graphics data are similar to each other. The pages of the set of graphics data that are determined as being similar to each other are merged by mapping the virtual memory addresses for those pages to the same physical memory address in the memory. The page merging process can provide a way to reduce the number of physical memory addresses needed to store the pages of the set of graphics data in the memory.

The present invention provides a data searching method of database, apparatus and computer program for the same. The data searching apparatus of a database includes: a storage unit configured to store graph data; and a controller configured to store physical location information in which vertex and edge information included in the graph data is stored in the storage unit, and perform a search for the vertex and the edge based on the physical location information. Thereby, it is possible to efficiently search the data by improving a search speed of a graph, minimize the update of the information even when a storage location of the data is changed, and facilitate query by the graph data regardless of types of the database and a storage structure, and efficiently use a storage space.

A model synchronization map table is built that facilitates autonomous computer self-navigation between elements of business objects of a business object model and corresponding elements of at least one extensible markup language (XML) schema of an XML schema definition-based (XSD-based) model. XSD-based model is programmatically generated by transformation of the elements of the business objects of the business object model into corresponding elements of XML schema of the XSD-based model. The business object model and XSD-based model are displayed in a dual-view editor. The dual-view editor enables users to toggle between and independently edit the business object model and XSD-based model. In response to independent edits made to one XSD-based model and business object model, the elements of the business object model are automatically synchronized with corresponding elements of the XSD-based model using the model synchronization map table.

A model synchronization map table is built that facilitates autonomous computer self-navigation between elements of business objects of a business object model and corresponding elements of at least one extensible markup language (XML) schema of an XML schema definition-based (XSD-based) model. XSD-based model is programmatically generated by transformation of the elements of the business objects of the business object model into corresponding elements of XML schema of the XSD-based model. The business object model and XSD-based model are displayed in a dual-view editor. The dual-view editor enables users to toggle between and independently edit the business object model and XSD-based model. In response to independent edits made to one XSD-based model and business object model, the elements of the business object model are automatically synchronized with corresponding elements of the XSD-based model using the model synchronization map table.

Embodiments of the invention generally provide a computer system, method implemented on a computer, and computer readable medium storing instructions for defining an extension taxonomy. The computer system comprises a processor and a memory storing instructions, the instructions being executable to configure the processor to provide a selection module operable to designate a selected portion of a source document, wherein the source document comprises a set of locations and a location map for identifying each location in the set of locations; wherein each location is configured to receive text-based content and wherein the selected portion comprises at least one location in the set of locations. The processor is also configured to provide: an extension module operable to associate a taxonomy element with a location in the selected portion; a connection module operable to define a location link between the identified taxonomy element and the location in the selected portion; and, a storage module operable to store the taxonomy element and the location link in a repository.