Abstract: An electronic document is parsed against a plurality of phrases. Each of the plurality of phrases indicates a text effect. It is determined that the electronic document includes a phrase at least similar to a first phrase of the plurality of phrases. A first contributor of the electronic document that is associated with the phrase is determined. A first text effect indicated by the phrase is determined. A mapping is created between the first contributor and the first text effect indicated by the phrase. The mapping is supplied for presenting of the electronic document.

Abstract: A plurality of segments in an e-mail collection by parsing content of e-mails is generated. Corresponding segment signature for each segment is created and a signature index is populated using the generated segment signatures. After receiving a query e-mail, a plurality of query segments in the query e-mail is generated using content of the query e-mail and corresponding query segment signature for each query segment is generated. A query root segment is identified and corresponding query root segment signature is generated. A set of root segment signatures of the signature index is identified and the query root segment signature is compared with each root segment signature from the signature index. A subset of the signature index is identified, using a match between the root segment signature and the query root segment signature. An e-mail thread hierarchy is built using the identified subset of the signature index.

Abstract: A method for efficiently fetching map tiles for digital maps includes receiving, at a client device such as a mapping user interface device, a request to display a digital map and identifying a plurality of map tiles for the request, each map tile representing a portion of the digital map. The user interface device generates a single map content request including multiple identifiers corresponding to the plurality of map tiles. The user interface device then sends the map content request to a map content server as a single request requesting multiple map tiles. In response to the map content request, the map content server retrieves the plurality of map tiles from a content database and sends the plurality of map tiles to the client device. The client device can then display the digital map based on the plurality of map tiles.

Abstract: A system and method of reconciling reference data of a business transaction may include parsing the document to identify at least one set of a subject, predicate, and object data contained within the document in response to receiving a document associated with a business transaction. A determination of at least one predicate of interest from the set(s) of a subject, predicate, and object data may be made. A transaction data set in an RDF triple data format for each set of subject, predicate, and object data inclusive of the at least one predicate of interest may be generated. A determination of reference data of a transaction data set may be made. The reference data may be compared with master data representative of potential identities to which the reference data of the business transaction refers so that a determination of a correct identity of the reference data may be made.

Abstract: A system and method identifies a video file in response to a video based search query. A video imaging device in a mobile device captures a video file, and sends the video file to a search engine. A database associated with the search engine stores pre-indexed metadata of pre-indexed frames of video. A video analyzer separates the received video file into individual frames, analyzes the individual frames received from the mobile device by converting the individual frames into metadata, and compares the metadata to the pre-indexed metadata of the pre-indexed frames stored in the database. The video analyzer then sends a message containing information about the identified pre-existing video back to the mobile device based on the comparison of metadata. The metadata of the file and/or the metadata in the database may include one or more of pixel information, histogram information, image recognition information and audio information for each individual frame.

Abstract: In one exemplary embodiment, a computer-implemented method includes receiving a portable digital format (PDF) file. A text element file is generated. The text element file includes a text element of the PDF file and a coordinate location of the text element. A document type of the PDF file is determined. A property file is selected according to the document type of the PDF. The property file includes at least one property. The property includes a definition of a data element to be extracted from the PDF file. The property includes a definition of a data element value, as well. The property includes a rule for locating the data element value relative to the data element. The data element and the data element value are extracted from the text element file according to the property.

Abstract: There are provided an input unit which inputs an object with scan information attached thereto into an image of a subject acquired on the basis of the scan information, and an insertion unit which inserts report information to the object when preparation of an image interpretation report of a study based on the image is completed.

Abstract: A method of processing a query in a distributed database implemented across a set of nodes includes receiving a query. The query is divided into split characterization queries. The split characterization queries are distributed to worker nodes. Each worker node stores a partition of the distributed database with encoded textual objects and pre-defined indices characterizing encoded textual object fragments. The split characterization queries are executed at the worker nodes to obtain preliminary information about query results. Executing the split characterization queries includes matching query fragments associated with the split characterization queries with encoded textual object fragments of the pre-defined indices to produce fragment matches representative of the size of the query results. For each split characterization query the preliminary information about query results includes a fragment count, a database partition identification, and a database host name.

Abstract: Transmitting or storing subsegments is disclosed. A data stream or a data block is received and broken into a plurality of segments. For at least one segment, the segment is broken into a plurality of subsegments. A previously stored or transmitted segment similar to the at least one segment is identified. A fingerprint is computed for at least one subsegment. And, using the fingerprint for the at least one subsegment, determining whether the at least one subsegment is identical to a subsegment of the previously stored or transmitted segment without directly comparing the content of the at least one subsegment with the content of the subsegment of the previously stored or transmitted segment.

Abstract: A method, apparatus, and non-transitory computer readable storage medium for validating content is provided. Data is parsed into at least a first group of data and a second group of data according to a plurality of types of content present in the data. The data is ingested into an associative memory. The associative memory forms a plurality of associations among the data. The associative memory is configured to be queried based on at least one relationship selected from a group consisting of direct relationships and indirect relationships among the data. The associative memory comprises a content-addressable structure, the content-addressable structure comprising a memory organization in which the data is configured to be accessed by the content as opposed to being configured to be accessed by addresses for the data. The first group of data and the second group of data are communicated in a graphical representation.

Abstract: A method and device for displaying messages including receiving messages, querying and acquiring a user message memory database corresponding to a sender user number according to the sender user number carried in the messages; combining the received messages according to a preset time strategy and the acquired user message memory database; and displaying the combined message. The amount of new messages displayed in a message receiving interface list can be increased, user's chat experience can be improved, and display screen utilization rate can be improved.

Abstract: Aggregate scoring is used to help classify digital content such as content uploaded to multi-user websites (e.g., social networking websites). In one embodiment, specific categories are used that relate to a social implication of content. For example, text, images, audio or other data formats can provide communication perceived to fall into categories such as violent, abusive, rights management, pornographic or other types of communication. The categories are used to provide a raw score to items in various groupings of a site's content. Where items are related to other items such as by organizational, social, legal, data-driven, design methods, or by other principles or definitions, the related items' raw scores are aggregated to achieve a score for a particular grouping of items that reflects, at least in part, scores from two or more of the related items.

Abstract: The present invention relates to a method for reducing the object code size of an application that requires run-time dispatching of object oriented methods. The method comprises scanning an object file corresponding to the application for references to object oriented methods in a dispatch table that performs run-time object oriented method binding. The highest inheritance level associated with an object oriented method is found. All references to object oriented methods above the highest inheritance level are designated as unused. All references to object oriented methods below the highest inheritance level are designate as used. All references to object oriented methods that are designated as unused are deleted from the dispatch table.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, parsing the structure query to identify a first query constraint and one or more second query constraints, identifying a inverse constraint associated with the first query constraint, and generating a query command based on the structured query, where the query command includes the inverse constraint and the one or more second query constraints.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: A system and method for using semantic understanding in storing and searching data and other information. A linearized tuple-based version of a conceptual graph can be created from a user input. A plurality of conceptual graphs, or portions thereof, can be compared to determine matches. An associative database can be created and/or searched using a hierarchy of conceptual graphs in tuple format, so that the data storage and searching of such database is optimized. The associative database can be used to integrate data from multiple different sources; form part of an Internet or other search engine; or used in other implementations. Also disclosed herein is a system and method for use of semantic understanding in searching and providing of content is described herein.

Abstract: Computer searchable annotated formatted documents are produced by correlating documents stored as a photographic or scanned graphic representations of an actual document (evidence, report, court order, etc.) with textual version of the same documents. A produced document will provide additional details in a computer data structure that supports citation annotation as well as other types of analysis of a document. The computer data structure also supports generation of citation reports and corpus reports. A computer method of creating searchable annotated formatted documents including citation and corpus reports by correlating and correcting text files with photographic or scanned graphic of the original documents. Data structures for correlating and correcting text files with graphic images. Generation of citation reports, concordance reports, and corpus reports. Data structures for citation reports, concordance reports, and corpus reports generation.

Abstract: A document recognition system and method, where images are represented as a collection of primitive features whose spatial relations are represented as a graph. Useful subsets of all the possible subgraphs representing different portions of images are represented over a corpus of many images. The data structure is a lattice of subgraphs, and algorithms are provided means to build and use the graph lattice efficiently and effectively.

Abstract: Identifying significant media granulars may comprise partitioning a media document into one or more media granulars. A score may be assigned to each of the one or more media granulars. The one or more media granulars may be monitored to detect one or more user actions on the one or more media granular. The score associated with a respective one of the media granulars may be updated based on a number of user actions detected on the respective one of the media granulars. A media granular may be identified as being significant based on the score meeting a threshold.

Abstract: The present invention allows a user to subscribe to multiple concurrent channels of syndicated content published over the internet. The user receives notification of the content which is new since the previous time that the user accessed a channel. The user can select the frequency of checking for new content and the user can specify how far back in time to check. In addition, the user can specify a maximum number of changes to be presented.

Abstract: Various embodiments for transforming a logical data object for storage in a storage device operable with at least one storage protocol are provided. In one such embodiment, the logical data object into one or more segments are divided with each segment characterized by respective start and end offsets. One or more obtained variable size data chunks are processed corresponding to the logical data object to obtain processed data chunks, wherein at least one of the processed data chunks comprises transformed data resulting from the processing. Each of the variable size data chunks is associated with a respective segment of the logical data object. The processed data chunks are sequentially accommodated in accordance with an order of chunks received while keeping the association with the respective segments.

Abstract: A phrase identification system and method are provided. The method comprises: identifying one or more phrase candidates in the electronic document; selecting one of the phrase candidates; numerically representing features of the selected phrase candidates to obtain a numeric feature representation associated with that phrase candidate; and inputting the numeric feature representation into a machine learning classifier, the machine learning classifier being configured to determine, based on each numeric feature representation, whether the phrase candidate associated with that numeric feature representation is a phrase.

Abstract: Techniques are provided for storing files in a parallel computing system based on a user-specified parser function. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a parser from the distributed application for processing the plurality of files prior to storage; and storing one or more of the plurality of files in one or more storage nodes of the parallel computing system based on the processing by the parser. The plurality of files comprise one or more of a plurality of complete files and a plurality of sub-files. The parser can optionally store only those files that satisfy one or more semantic requirements of the parser. The parser can also extract metadata from one or more of the files and the extracted metadata can be stored with one or more of the plurality of files and used for searching for files.

Abstract: Exemplary methods, apparatuses, and systems parse data with a plurality of pattern matching rules. Pattern matching rules are applied in an ordered sequence and a first rule is applied to the data before a second rule is applied to the data. In response to determining the second rule matches the data the second rule is determined to match the data and the sequence is reordered to apply the second rule prior to the first rule.

Abstract: Exemplary methods, apparatuses, and systems receive data as input to be parsed. The data is parsed using a plurality of pattern matching rules, the plurality of pattern matching rules organized according to a hierarchy including a parent rule and one or more child rules of the parent rule. Parsing includes applying the parent rule to the unstructured data, determining the parent rule is unable to find a pattern match in the unstructured data, and bypassing the application of each child rule to the unstructured data in response to the determination that the parent rule is unable to find a pattern match.

Abstract: There is described a system for adding content to a data container, the data container comprising one or more segments arranged in a sequence, each segment containing payload data and wherein at least one of the one or more segments is compressed. The system comprises parsing through at least a portion of the data container so as to determine at least one of a beginning and an end of the sequence of segments; and adding content to the data container at the at least one of the beginning and the end of the sequence of segments, while the at least one of the segments remains compressed.

Abstract: Techniques and devices for facilitating migration of files between a source system and a target system are provided. A system for facilitating migration of files between a source system and a target system includes an extraction component and an injection component. The extraction component includes at least one extraction handler and a profile engine operative to parse a profile specification, execute the at least one extraction handler, and provide a batch specification. The injection component includes a batch handler for obtaining pulled data from a source system, and a batch engine is operative to parse a batch specification and to create at least one file structure in the target system based on extracted structure information in the batch specification. Methods and GUIs for facilitating migration of files are also described.

Abstract: A method for DRM file conversion is provided in an embodiment of the present disclosure, including: parsing a multipurpose Internet mail extensions (MIME) parameter in a rights type system of a DRM file to obtain file types and rights formats to which the DRM file can be converted; and converting, according to the file types and rights formats to which the DRM file can be converted, the DRM file into a file type and a rights format in the file types and rights formats to which the DRM file can be converted, where the file type and rights format is supported by a DRM system that receives the DRM file. A device for DRM file conversion is provided in another embodiment of the present disclosure.

Abstract: Systems and apparatuses are provided for analytical data processing. A system includes a processor and a non-transitory computer readable medium, comprising machine readable instructions executable by the processor. The instructions include a query compiler to identify a call to a user defined function and an output expression defining an output field for the user defined function within a query and generate an output table object for the user defined function. The generated output table object contains the defined output field. The instructions further include a processing engine to execute the user defined function and populate the output field in rows into the output table object with the output of the user defined function.

Abstract: Systems, methods and computer-readable media are provided for facilitating patient health care by providing discovery, validation, and quality assurance of nomenclatural linkages between pairs of terms or combinations of terms in databases extant on multiple different health information systems that do not share a set of unified codesets, nomenclatures, or ontologies, or that may in part rely upon unstructured free-text narrative content instead of codes or standardized tags. Embodiments discover semantic structures existing naturally in documents and records, including relationships of synonymy and polysemy between terms arising from disparate processes, and maintained by different information systems. In some embodiments, this process is facilitated by applying Latent Semantic Analysis in concert with decision-tree induction and similarity metrics.

Abstract: A method comprises receiving a plurality of emails. Each of the plurality of emails comprises message information and header information. The header information comprises subject information and one or more email addresses. The method further comprises generating filtered email data comprising email addresses by at least filtering message information and subject information from each of the plurality of emails. The method further comprises correlating sender information and recipient information in the filtered email data, the correlation based at least in part on the one or more email addresses. The method further comprises storing in memory one or more email addresses from the filtered email data.

Abstract: In one embodiment, a method comprises creating and storing an ontology for a data store in response to receiving first user input defining the ontology, wherein the ontology comprises a plurality of data object types and a plurality of object property types; creating one or more parser definitions in response to receiving second user input defining the parser definitions, wherein each of the parser definitions specifies one or more sub-definitions of how to transform first input data into modified input data that is compatible with one of the object property types; and storing each of the one or more parser definitions in association with one of the plurality of object property types.

Abstract: Proposed is a data visualizing apparatus for visualizing data as effectual information using a correlation between forensic data collected from various sources. The proposed data visualizing apparatus may visualize, as effectual information, single-source single-data, single-source multi-data, and multi-source multi-data.

Abstract: The present invention provides a non-reductive normalisation based data indexing and search system and method. In one embodiment, a computer-implemented method for indexing raw digital data in a searchable format includes translating raw digital data in a first data format to a second data format using a set of extensible parsers, forming non-reductive normalised data entities from the digital data in the second format using a set of extensible entity builders, indexing each of the non-reductive normalised data entities in one or more indexes using a set of extensible indexers, and searching the one or more indexes containing the non-reductive normalised data entities for digital data based on a search query for the digital data.

Abstract: Methods, program products, and systems for automatically searching data in multiple data fields are described. A user can view data retrieved from a database and formatted based on a layout. While viewing the data, the user can perform a search using one or more search terms. A system can automatically examine the database and identify on which tables and on which data fields of the tables to perform the search. The system can identify searchable tables and data fields by analyzing the database schema as well as characteristics of the tables and data fields.

Abstract: A system and a method are disclosed for adding linked content to text messages. Messages are analyzed to determine the context and meaning of a conversation between users, and linked content relevant to the conversation is selected and associated with certain words or phrases in the messages. This process for enhancing text messages beneficially provides users with additional information related to the meaning of their conversation, and also provides advertisers with a valuable new way of delivering highly relevant advertisements to a precise group of users.

Abstract: A method for one pass submatch extraction may include receiving an input string, receiving a regular expression with capturing groups, and converting the regular expression with capturing groups into a finite automaton M to extract submatches. The finite automaton M may be evaluated to determine whether the regular expression belongs to a set of regular expressions for which submatch extraction is implemented by using one pass by determining whether an automaton M?=rev(close(M)) is deterministic. The input string may be matched to the regular expression if the regular expression belongs to the set of regular expressions for which submatch extraction is implemented by using one pass.

Abstract: A method to allocate memory, in response to application requests, for a compact data structure having location data and a trailer section is provided. The trailer section of the compact data structure is checked to determine an offset for listings and indices representing the location data. Upon determining the offset, the listings and indices are loaded into memory and responses to the application requests are generated by utilizing the listings and indices stored in the memory.

Abstract: A method includes receiving at least a portion of a task. The method also includes parsing the task as the task is being received to identify a keyword in the task. In addition, the method includes, in response to identifying the keyword, applying the keyword to one or more parameters of the task while the task is being received to produce a modified task. The method could further include parsing a second task that is received subsequent to the received task, identifying a second keyword in the second task, and associating the second task with the received task in response to identifying the second keyword. Associating the second task with the received task could include determining a hierarchy between the second task and the received task based on the second keyword or determining that the second task is a subtask of the received task based on the second keyword.

Abstract: Updating images in an image database includes determining an updated image that is among a plurality of images in the image database, extracting a plurality of image features of the updated image and storing a plurality of image feature values that correspond to the plurality of image features, and associating the plurality of image features of the updated image with a search engine, including adding an array comprising the plurality of image feature values to an index of the search engine.

Abstract: In accordance with an embodiment, data may be automatically extracted from semi-structured web sites. Unsupervised learning may be used to analyze web sites and discover their structure. One method utilizes a set of heterogeneous “experts,” each expert being capable of identifying certain types of generic structure. Each expert represents its discoveries as “hints.” Based on these hints, the system may cluster the pages and text segments and identify semi-structured data that can be extracted. To identify a good clustering, a probabilistic model of the hint-generation process may be used.

Abstract: Methods and apparatus of automatically creating composite configuration items in a configuration management database are provided. A plurality of configuration items and a corresponding plurality of configuration item relationships are provided to the configuration management database. One or more composite configuration items are created from one or more of the plurality of configuration items in accordance with one or more types of the plurality of configuration items.

Abstract: Computer-implemented systems and methods are disclosed for constructing a parser that parses complex data. In some embodiments, a method is provided for receiving a parser definition as an input to a parser generator and generating a parser at least in part from the parser definition. In some embodiments, the generated parser comprises two or more handlers forming a processing pipeline. In some embodiments, the parser receives as input a first string into the processing pipeline. In some embodiments, the parser generates a second string by a first handler and inputs the second string regeneratively into the parsing pipeline, if the first string matches an expression specified for the first handler in the parser definition.

Abstract: A data storage system includes a partitioning module to partition data across multiple dimensions simultaneously. The partitioning may be based on a sizing parameter for each dimension. The partitioning module stores a cluster including the partitioned event data and metadata including attributes identifying the cluster.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a first document, the first document being associated with a user, executing a plurality of parsers, each parser of the plurality of parsers processing the first document to provide one or more first data values, merging the one or more first data values provided from the plurality of parsers to populate a data record having one or more data fields, the data record being specific to the user, and storing the data record in computer-readable memory.

Abstract: Aspects are disclosed for editing a textual input. In an aspect, a series of strings and an edit command are received such that the strings are parsed based on the edit command. A candidate modification of the strings is inferred from a correlation between the edit command and a parsing of the strings, and the candidate modification is then implemented. In another aspect, a textual input comprising a series of strings is displayed and an edit command is received. The edit command is associated with a portion of the strings, and the portion is then edited based on the edit command. In yet another aspect, a series of strings and an edit command are received, and a candidate modification of the series of strings is inferred based on a combination of a trigger portion and an edit portion of the edit command. The candidate modification is then disseminated.

Abstract: A data acquisition system can receive a plurality of files from a plurality of sources and can automate selection of a suitable application for accessing each file and determination of a suitable pattern template for recognizing and extracting data from a respective file. The data acquisition system can store the extracted data in a customized data structure that can be specified for each source and/or each type of data. The data acquisition system further can provide one or more user interfaces that can enable a user to upload, create or define a pattern template for a file and/or document.

Abstract: In some NLP systems, queries are compared to different data sources stored in a corpus to provide an answer to the query. However, the best data sources for answering the query may not currently be contained within the corpus or the data sources in the corpus may contain stale data that provides an inaccurate answer. When receiving a query, the NLP system may evaluate the query to identify a data source that is likely to contain an answer to the query. If the data source is not currently contained within the corpus, the NLP system may ingest the data source. If the data source is already within the corpus, however, the NLP may determine a time-sensitivity value associated with at least some portion of the query. This value may then be used to determine whether the data source should be re-ingested—e.g., the information contained in the corpus is stale.

Abstract: The focus of the present invention is the modular analysis of Big Data encompassing parallelization, chunking, and distributed analysis applications.