Abstract: A SOI wafer is disclosed. The SOI wafer may be characterized by surface roughness of a top silicon layer of the SOI wafer is less than 4 ?, thickness uniformity of the top silicon layer is within ±1%, and a total number of particles on a surface of the top silicon layer of the SOI wafer, measured with setting of 37 nm of SPx detection threshold, is less than 100.

Abstract: Embodiments of the present disclosure provide a method and apparatus for processing a multi-language text. According to embodiments of the present disclosure, the multi-language text including contents in a plurality of languages may be encoded with a Unicode. The method further comprises splitting the multi-language text into a plurality of parts based on the Unicode of the multi-language text, contents of the plurality of parts having different languages. In addition, the multi-language text may also be processed based on the plurality of parts.

Abstract: A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, and injecting, into the document search query, a user access vector. The user access vector specifies, for the requesting user, access control lists that are associated with the requesting user. The method further includes identifying, in a document repository, documents that match the document search query with the injected user access vector. A matching document requires a match of terms in the search query with terms in the matching document, and a match of at least one access control list specified in the matching document and at least one of the access control lists specified in the user access vector.

Abstract: Ideogram character analysis includes partitioning an original ideogram character into strokes and mapping each stroke to a corresponding stroke identifier (id) to create an original stroke id sequence that includes stroke identifiers. A candidate ideogram character that has a candidate stroke id sequence within a threshold distance to the original stroke id sequence is selected. One or more embodiments may create a new phrase by replacing the original ideogram character with the candidate ideogram character in a search phrase. One or more embodiments perform a search using the search phrase and the new phrase to obtain a result and present the result. One or more embodiments may replace an original ideogram character in a character recognized document with the candidate ideogram character and store the character recognized document.

Abstract: Ideogram character analysis includes partitioning an original ideogram character into strokes, and mapping each stroke to a corresponding stroke identifier (id) to create an original stroke id sequence that includes stroke identifiers. A candidate ideogram character that has a candidate stroke id sequence within a threshold distance to the original stroke id sequence is selected. One or more embodiments may create a new phrase by replacing the original ideogram character with the candidate ideogram character in a search phrase. One or more embodiments perform a search using the search phrase and the new phrase to obtain a result, and present the result. One or more embodiments may replace an original ideogram character in a character recognized document with the candidate ideogram character and store the character recognized document.

Abstract: In general, in one aspect, the invention relates to a method for servicing requests. The method includes receiving, from a client system, a request comprising a query, where the query includes a first plurality of terms. The method further includes generating, using a thesaurus library, a related query including a second plurality of terms, where at least one term in the second plurality of terms is present in the first plurality of terms. The method further includes issuing the query to a content repository to obtain a first result, issuing the related query to the content repository to obtain a second result, processing the first result and the second result to generate a final result, and providing the final result to the client system.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for managing a document index. The method comprises determining an independently updatable field in a plurality of documents, the independently updatable field comprising at least one item. The method further comprises creating an index for an item in the independently updatable field, the index containing an identifier of a document comprising the item, the document being included in the plurality of documents. Furthermore, the method further comprises storing the identifier of the document in blocks such that the index is updatable without modifying the identifier of the document.

Abstract: Techniques for searching a character string involve: determining a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string; and generating a third set of documents based on the first and second sets of documents, in the third set of documents: i) a document being included in the first and second sets of documents, and ii) a distance between the first and second tokens in the document being equal to a distance between the first and second tokens in the character string.

Abstract: Embodiments of the present disclosure provide a method and apparatus for processing a multi-language text. According to embodiments of the present disclosure, the multi-language text including contents in a plurality of languages may be encoded with a Unicode. The method further comprises splitting the multi-language text into a plurality of parts based on the Unicode of the multi-language text, contents of the plurality of parts having different languages. In addition, the multi-language text may also be processed based on the plurality of parts.

Abstract: Embodiments of the present disclosure provide a method and apparatus for processing a multi-language text. According to embodiments of the present disclosure, the multi-language text including contents in a plurality of languages may be encoded with a Unicode. The method further comprises splitting the multi-language text into a plurality of parts based on the Unicode of the multi-language text, contents of the plurality of parts having different languages. In addition, the multi-language text may also be processed based on the plurality of parts.

Abstract: The present disclosure provides method and apparatus of information processing. The method comprises: in response to a request of a first user for first information, searching a database to obtain second information; determining a first relevance between a second user associated with the second information and the first user; determining a second relevance between the second information and the first information based on the first relevance; and presenting the second information to the first user based at least in part on the second relevance.

Abstract: A method for managing a document search index. The method includes obtaining indexing terms for documents in a document repository to generate search index fragments, storing the search index fragments in a document search index, and constructing a hierarchical structure from a first set of stored search index fragments. The selected first set of search index fragments is arranged by size, in the hierarchical structure. The method further includes selecting, based on a minimal size, a second set of stored search index fragments from the hierarchical structure, merging the second set of stored search index fragments to obtain a larger search index fragment, storing the larger search index fragment in the document search index, and serving at least one search request using the larger search index fragment.

Abstract: A method for document search in a structured document repository. The method includes obtaining a document search query from a client, obtaining location constraints for documents to be identified in a structured document repository based on the document search query, identifying, in a document search index associated with the structured document repository, a document that matches the search query and the location constraints, and providing information associated with the identified document to the client.

Abstract: A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, identifying, in a document repository, by the document management service, a document that matches the search query, and obtaining a permission level by the document management service, from an access control cache, based on a combination of the requesting user and an access control list required by the document. The access control cache is located on the document management service, and the access control cache is populated using content in an access control repository located on a repository server, separate from the document management service. The method further includes making a determination that the permission level is sufficient and based on the determination, returning the document to the requesting user, as a search result.

Abstract: Embodiments of the present disclosure generally relate to a method and device for creating an index. For example, the embodiments of the present disclosure propose a method for creating an index, comprising: dividing a document into a plurality of regions; determining the number of times that a token appears in the plurality of regions, the token including at least one character in the document; assigning respective weights to the plurality of regions; and creating an inverted document linked list directed to the token based on the number of times that the token appears in the plurality of regions and respective weights of the plurality of regions. In addition, the embodiments of the present disclosure propose a corresponding device and computer program product for creating an index.

Abstract: Techniques for searching a character string involve: determining a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string; and generating a third set of documents based on the first and second sets of documents, in the third set of documents: i) a document being included in the first and second sets of documents, and ii) a distance between the first and second tokens in the document being equal to a distance between the first and second tokens in the character string.

Abstract: A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, and injecting, into the document search query, a user access vector. The user access vector specifies, for the requesting user, access control lists that are associated with the requesting user. The method further includes identifying, in a document repository, documents that match the document search query with the injected user access vector. A matching document requires a match of terms in the search query with terms in the matching document, and a match of at least one access control list specified in the matching document and at least one of the access control lists specified in the user access vector.

Abstract: A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, and injecting, into the document search query, a user access vector. The user access vector specifies, for the requesting user, access control lists that are associated with the requesting user. The method further includes identifying, in a document repository, documents that match the document search query with the injected user access vector. A matching document requires a match of terms in the search query with terms in the matching document, and a match of at least one access control list specified in the matching document and at least one of the access control lists specified in the user access vector.

Abstract: Techniques for searching a character string involve: determining a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string; and generating a third set of documents based on the first and second sets of documents, in the third set of documents: i) a document being included in the first and second sets of documents, and ii) a distance between the first and second tokens in the document being equal to a distance between the first and second tokens in the character string.

Abstract: A method for document similarity analysis. The method includes obtaining a document to be archived, obtaining indexing terms for the document to be archived, and identifying document categories similar to the document to be archived, based on indexing terms and corresponding term frequencies. The method further includes making a determination that a weakly similar document category exists and based on the determination: generating a new document category and registering the document in the new document category, and registering the document in the weakly similar document category.