Abstract: Embodiments are directed to computing, by an apparatus comprising a processing device, an identifier (ID) for an element in a page using an algorithm responsive to encountering the element a first time, causing, by the apparatus, the ID to be stored in a storage device, encountering, by the apparatus, the element a second time, determining, by the apparatus, that the element is encountered the second time, and responsive to determining that the element is encountered the second time, representing, by the apparatus, the element by the ID at the time of the second encounter by retrieving the ID from the storage device.

Abstract: A method of validating results of a host search engine (50), the method including the steps of scanning all data objects deliverable via a web interface with a scanning engine (25) and executing a matching engine (35) to generate a report set containing content missed by the host search engine (50).

Abstract: A system and method are disclosed for improving a statistical message classifier. A message may be tested with a machine classifier, wherein the machine classifier is capable of making a classification on the message. In the event the message is classifiable by the machine classifier, the statistical message classifier is updated according to the reliable classification made by the machine classifier. The message may also be tested with a first classifier. In the event that the message is not classifiable by the first classifier, it is tested with a second classifier, wherein the second classifier is capable of making a second classification. In the event that the message is classifiable by the second classifier, the statistical message classifier is updated according to the second classification.

Abstract: A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of ?m/n? rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.

Abstract: The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems, including a method for presenting information. A first graph is presented that represents plural groups, each representing an aggregated set of data points grouped based on a first set of common attributes. User input selecting a particular group is received. The aggregated set of data points is analyzed to determine whether the number of aggregated set of data points exceeds a threshold. In response to determining that the number exceeds the threshold, the aggregated set of data points is re-grouped. A second set of common attributes associated with the re-grouped set of data points is identified. The data points are aggregated based on the second set of common attributes. A second graph is provided for presentation, the updated graph representing plural groups, each group representing an aggregated subset of data points from the aggregated set of data points.

Abstract: Performing a search over a trace of program execution. A method includes receiving a search expression including one or more search criteria. The search expression is targeted at one or more trace data streams storing a trace of program execution. Based on the one or more search criteria, a plurality of families of code entity invocations are identified. Each family identifies a plurality of code entity invocations that are related to each other, and that are identified based in on one or more trace data streams. A ranking among the plurality of families of code entity invocations is identified, and based at least on the ranking a set of code entity invocations determined to meet the one or more search criteria is returned. The set of code entity invocations is ordered by a relevance determined based at least on the ranking among the plurality of families.

Abstract: Techniques for enabling a search engine to automatically classify the content type of Web documents. In an exemplary embodiment, Web documents may be classified as adult or non-adult, based on whether a document contains adult content. In an aspect, Web documents are mined offline to determine the presence of “adult hubs” to which adult documents are connected. The presence of such adult hubs is a strong indicator that linking Web documents may themselves contain adult content. Computational techniques for quantifying the connection between a candidate document and adult hubs are disclosed. The techniques may be utilized in an Internet search engine platform designed to accept user search queries and deliver highly relevant results.

Abstract: Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.

Abstract: Systems, device and techniques are disclosed for providing at least one dynamic current result to a second device, such as a mobile phone, where the at least one dynamic current result is related to content that is active on a first device such as a television. The dynamic current result may be generated based on a search query.

Abstract: Disclosed is a method and system for online directory management in which a succession of values is aggregated as human behavior data from client devices visiting a website. A new value is automatically transmitted in response to a correlation signaling that the new value signifies a true mutation.

Abstract: A content collection system receives a natural language input and identifies a type of content to be collected based on the natural language input. Items of content from multiple different digital media types are collected from a plurality of different sources and organized in an order.

Abstract: Embodiments relate to retrieving a document from a plurality of document groups in which mutually related documents are each included. An aspect includes acquiring a retrieval condition that includes a plurality of conditions and at least one logical operator that connects the plurality of conditions. Another aspect includes identifying, with respect to each condition of the plurality of conditions, a document group including a document satisfying the condition from among the plurality of document groups. Another aspect includes identifying a document that satisfies at least one condition. Another aspect includes determining a document that is a retrieval result by making a selection to omit or retain that depends on the at least one logical operator. Another aspect includes generating information showing the document that is the retrieval result based on the retrieval condition.

Abstract: A method, system, and computer program product for information retrieval and sentiment assessment. The method parses a sentiment-aware query to isolate one or more lexical terms to be included in a lexical retrieval of documents containing the lexical terms. The parsing of the query includes parsing the query to isolate portions of the query to be included in the configuration of a sentiment analysis of the retrieved documents. The documents retrieved based on the lexical terms are processed so as to generate a sentiment assessment, and the sentiment found in the retrieved documents might be correlated to terms that are not present in the lexical terms. The sentiment assessment is presented as a “positive” or “negative” indication, or as a sentiment assessment score. The sentiment portion of the query can specify an area of interest, and/or can specify a user-selected classifier model that is used to process the retrieved documents.

Abstract: There is provided an information processing device including a plurality of specifying devices used to respectively specify a plurality of types of parameter values representing music features; a music extraction portion that extracts, from a first database in which a plurality of pieces of music and the parameter values are associated with each other, pieces of music that match the parameter values specified using the specifying devices; and a list generation portion that generates a list of the pieces of music extracted by the music extraction portion.

Abstract: A plurality of servers are each coupled to a different one of a plurality of databases that are synchronized with each other. A search request specifying a search range is sent from a search-requesting device to the servers. Each server calculates a search subrange from the search range specified in the search request received from the search-requesting device, performs a data search operation only within the calculated search subrange of the database coupled thereto, and sends a search result back to the search-requesting device.

Abstract: Some embodiments provide a method that parses an unstructured document that includes a number of primitive elements. The method stores the primitive elements in a random order in a first storage. The method stores references to the primitive elements in a second storage in an order based on locations of the primitive elements in the unstructured document. The method receives instructions to perform a document reconstruction operation. The method performs the received instructions without storing any new references to the primitive elements.

Abstract: Electronic data file and content capturing systems and methods enable enhanced accessibility and reduced complexity for clients managing large volumes of digital data files. According to one aspect, a system and method provided for validation and tracking of content collection tasks. According to another aspect, systems and methods are disclosed for error management through integrated interfaces that are capable of interacting with and correcting the results of content collection tasks.

Abstract: Embodiments of the present invention include an acoustic processing device and a method for traversing a Hidden Markov Model (HMM). The acoustic processing device can include a senone scoring unit (SSU), a memory device, a HMM module, and an interface module. The SSU is configured to receive feature vectors from an external computing device and to calculate senones. The memory device is configured to store the senone scores and HMM information, where the HMM information includes HMM IDs and HMM state scores. The HMM module is configured to traverse the HMM based on the senone scores and the HMM information. Further, the interface module is configured to transfer one or more HMM scoring requests from the external computing device to the HMM module and to transfer the HMM state scores to the external computing device.

Abstract: Method and system for visualizing content referenced in an electronic document are provided. Example system includes an access module, a reference detector, and a float window loader. The access module can open electronic documents. An electronic document may include descriptive textual content and one or more illustrative objects. The reference detector detects that a cursor is positioned over text in the descriptive content that refers to an illustrative object. In response, the float window loader presents the illustrative object in a float window.

Abstract: A content screening method, apparatus and system are provided for a content screening component to verify the trust relationship and the categorization standard used by a categorization component. A method includes the following steps: the content screening component receives a categorized content; and when determining that a first categorization component that categorizes the content is trustworthy according to the information of the categorization component carried in the categorized content, the content screening component screens the content by the content category carried in the categorized content. Another method includes the following step: when determining that the categorization component that categorizes the content uses the same categorization standard as the content screening component according to the information of the categorization component carried in the categorized content, the content screening component screens the content by the content category carried in the categorized content.

Abstract: A numeric range search device includes: interval index storage means for storing, for numeric ranges to be searched, an interval index that is made up of records each including at least an interval filter and reference information and in which the records are organized in units of records whose interval filters are at least partially common, the interval filter being data indicating a correspondence relationship between an input numeric value or numeric range and subintervals obtained by dividing a range including all of the numeric ranges by a predetermined boundary value, and the reference information being information for referring to a numeric range to be searched; interval query generation means for generating an interval query which is data indicating a correspondence relationship between the input numeric value or numeric range and the subintervals; and candidate selection means for selecting, from the records, a record for which an AND of an interval filter included in the record and the interval quer

Abstract: A computer implemented system and method in a client-server environment, is provided for document research, aggregation, and compilation. The system and method includes a server having a search module configured to generate a search interface displayable to a client communicably coupled to the server, and responsive to instructions received via the search interface, to search and sort selections of interest within a plurality of source documents. A customized report module is configured to generate a custom report interface displayable to the client, and responsive to user selection instructions received via the custom report interface, to extract and aggregate the selections of interest into a customized report. Format modules are configured to respectively enable source documents in mutually distinct formats such as the PDF, PPT, and XLS formats, to be searched, sorted, and aggregated by the search module and customized report module.

Abstract: There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method for an index. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method for the index in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.

Abstract: A method and an apparatus for filtering a uniform resource locator (URL). According to the method, a first category corresponding to a URL connection request can be found in a pre-stored category information table; when the first category conforms to a predetermined URL passing through policy, the URL connection request is allowed to pass through; the URL connection request is forwarded to a corresponding server; a second category corresponding to a URL is determined according to web page content returned by the server; if the second category conforms to the predetermined URL passing through policy, the web page content is sent to a client; if the second category does not conform to the predetermined URL passing through policy, the web page content is blocked. A category to which a URL belongs can be determined in real time, and implementing a function of accurate category filtration.

Abstract: A memory buffer with a set of one or more structures is created by a process of a first software program. The first memory buffer comprises a predetermined amount of memory. It is determined that a structure of the set of one or more structures has been or will be consumed by a second software program that supports the first software program. The consumption of the structure of the set of one or more structures indicates that memory associated with the structure of the set of one or more structures is being reclaimed. In response to the determination that the structure of the set of one or more structures has been or will be consumed, data is written from a first location to a second location. The first location is in memory allocated to the first software program and the second location is indicated for data storage.

Abstract: A memory buffer with a set of one or more structures is created by a process of a first software program. The first memory buffer comprises a predetermined amount of memory. It is determined that a structure of the set of one or more structures has been or will be consumed by a second software program that supports the first software program. The consumption of the structure of the set of one or more structures indicates that memory associated with the structure of the set of one or more structures is being reclaimed. In response to the determination that the structure of the set of one or more structures has been or will be consumed, data is written from a first location to a second location. The first location is in memory allocated to the first software program and the second location is indicated for data storage.

Abstract: Given a set of data for which a conservation law is an appropriate characterization, “hold” and/or “fail” tableaux are provided for the underlying conservation law, thereby providing a conservation dependency whereby portions of the data for which the law approximately holds or fails can be discovered and summarized in a semantically meaningful way.

Abstract: An embodiment of a method for secure escrow and recovery of media device content keys includes generating, with a first processor of a media device, an escrow key for encrypting a plurality of content keys, the content keys for encrypting instances of media content. The first processor of the media device encrypts the escrow key with a public key of a key clearinghouse. The escrow key, encrypted with the public key of the key clearinghouse, is stored in a storage location outside of the first processor of the media device.

Abstract: The invention is directed to methods for determining clonotypes and clonotype profiles in assays for analyzing immune repertoires by high throughput nucleic acid sequencing of somatically recombined immune molecules. In one aspect, the invention comprises generating a clonotype profile from an individual by generating sequence reads from a sample of recombined immune molecules; forming from the sequence reads a sequence tree representing candidate clonotypes each having a frequency; coalescing with a highest frequency candidate clonotype any lesser frequency candidate clonotypes whenever such lesser frequency is below a predetermined value and whenever a sequence difference therebetween is below a predetermined value to form a clonotype. After such coalescence, the candidate clonotypes is removed from the sequence tree and the process is repeated.

Abstract: Methods and apparatus for collection, validation, analysis, and automated error correction of data regarding user interaction with content. In one embodiment, statistical methods are used to arrive at expected values for the collected data. The data is compared to the expected value and must meet one or more acceptance criteria (e.g., be within a prescribed range) to be considered valid. The prescribed range is determined by the network operator, or a computer program adapted to generate this value. The invention enables a network operator to assess a large volume of data without requiring significant amounts of manual monitoring and/or error correction. The ability to collect, validate and analyze data across multiple platforms is also provided. Still further, an automated system capable of learning evaluation and error correction patterns is disclosed.

Abstract: Metadata for a plurality of database storage regions within memory are merged, where the metadata for each storage region comprises an interval including first and second interval values indicating a value range for values within that storage region. The first and second interval values are examined to identify overlapping storage regions and produce a sum of overlapped storage regions. The sum of overlapped storage regions is compared to a threshold and the metadata of the overlapped storage regions are merged based on the comparison.

Abstract: An information processing device reduces a time of processing for adding an attribute name performed in each node. The device memorizes its own segment. This segment is at least one segment among each segment made by dividing a range of a key into a plurality of segments, so as to make the segments neighbor with each other. The key is generated about at least two attribute names using an attribute name and an attribute value based on a specified order relation and is of size-comparable form. The device judges whether a key generated from an attribute name and an attribute value is included in its own segment or not.

Abstract: For a network that includes several managed edge switching elements and several managed non-edge switching elements that are for implementing a logical switching element, some embodiments provide a method of distributing packet processing across the several managed non-edge switching elements. The method receives a packet for processing through the logical switching element. Based on a determination that the packet needs to be processed by a managed non-edge switching element, the method determines a particular managed non-edge switching element of the several managed non-edge switching elements to forward the packet. The method forwards the packet to the particular managed non-edge switching element for the particular managed non-edge switching element to process the packet.

Abstract: Methods, systems, and computer-readable media to analyze a CEP query are disclosed. A particular analysis module is configured to receive data associated with an event flow generated by execution of a CEP query. The data is received from a first analysis module (e.g., in a stack of analysis modules) or from the event flow via a software communication interface. The analysis module is also configured to execute an analysis operation on the data to generate a result. The analysis module can output the result to a second analysis module (e.g., in the stack of analysis modules) or to a user interface via the software communication interface.

Abstract: Techniques to search for data elements in a distributed computing environment are described. An apparatus may comprise a processor and a memory unit communicatively coupled to the processor. The memory unit may store a correlation module that when executed by the processor is operative to determine a target rank position at a target percentile rank within a total data set. The correlation module may determine a target data item at the target rank position for the total data set using candidate data items at candidate rank positions for each of multiple sorted data subsets of the total data set, and correlation values associated with each of the candidate data items. Other embodiments are described and claimed.

Abstract: A method of determining and optimizing the location of a new insurance agency is disclosed to increase market penetration of underrepresented markets. The method comprises the use of a scoring algorithm to rank various geographic regions or related zip codes. The scoring algorithm may be implemented by a location modeling system based on variables selected by a user.

Abstract: Systems and methods are presented for data quality monitoring. Data quality monitors may be created and configured to identify objects with specified data quality issues and/or property values. Objects identified by a data quality monitor can be presented to users for confirmation and resolution. Properties used by the data quality monitor to match objects may also be displayed to users.

Abstract: In a hierarchical switching architecture that includes at least one lower level managed switching element that connects to several higher level managed switching elements, some embodiments provide a method of identifying a higher level managed switching element to which the lower level managed switching element forwards a packet for further processing. The method computes a value based on a set of attributes of the packet. The method identifies a record from a hierarchy traversal table based on the computed value. The record specifies (1) a first higher level managed switching element as a primary higher level managed switching element and (2) a second higher level managed switching element as a secondary higher level managed switching element. The primary and secondary higher level managed switching elements are for forwarding the packet for further processing. The method forwards the packet to one of the higher level managed switching elements.

Abstract: A method, computer program product, and system for running an executable during a debug session is described. A method may comprise running, via a computing device, a daemon during a debug session, the debug session facilitated, at least in part, by a dynamic tracing tool. The method may further comprise receiving, via the daemon, one or more commands from the dynamic tracing tool. The method may additionally comprise in response to receiving the one or more commands from the dynamic tracing tool, initiating an executable.

Abstract: A method and system for capturing, organizing, storing, and analyzing manufacturing process information, with storage and performance characteristics suitable for use in resource-constrained embedded devices. Process information is organized into extensible Channels, each of which captures information stored as extensible Events, each of which may include Metric, Category Value, Annotation, and System Fields. Shared Boundaries between Channels make it easier to organize, store, interrelate, analyze, and explore information. Channel Boundary Relationships (e.g., Coupling, Fragmenting, Projecting, and Aggregating) create shared Boundaries; and can create, or be combined to create, sets of Channels that share Boundaries (referred to as a Slice Set).

Abstract: According to some embodiments, a data source is accessed from which data will be retrieved via a plurality of processing threads. The data source may have, for example, a plurality of records with each record being associated with a plurality of identifiers. Each of the plurality of identifiers may be dynamically evaluated as a potential range identifier, and the evaluation may be based at least in part on a number of distinct values present within each identifier. One of the potential range identifiers may be selected as a selected range identifier, and the plurality of records may be divided into ranges defined using the selected range identifier.

Abstract: The compositions and methods provided herein allow for identification of causative genetic biomarkers for a disease condition or drug response.

Abstract: A method, computer product, and computer system of minimizing surprisal data comprising: at a source, reading and identifying characteristics of a genetic sequence of an organism; receiving an input of rank of at least two identified characteristics of the genetic sequence of the organism; generating a hierarchy of ranked, identified characteristics based on the rank of the at least two identified characteristics of the genetic sequence of the organism; comparing the hierarchy of ranked, identified characteristics to a repository of reference genomes; and if at least one reference genome from the repository matches the hierarchy of ranked, identified characteristics, comparing nucleotides of the genetic sequence of the organism to nucleotides from the at least one matched reference genome, to obtain differences and create surprisal data.

Abstract: A system and method for converting static/still medical images of a particular patient into dynamic and interactive images interacting with medical tools including medical devices by coupling a model of tissue dynamics and tool characteristics to the patient specific imagery for simulating a medical procedure in an accurate and dynamic manner.

Abstract: A provisioning system for processing data structures to determine if location capabilities indicated in records are correct for each of the different ranges indicated in each of the records, transferring the data structure to a location determination system if each of the location capabilities are correct, and generating an error response if each of the location capabilities are not correct.

Abstract: A method, computer product and computer system of transmitting a compressed genome of an organism: a computer at a source reading an uncompressed sequence and a reference genome from a repository; the computer comparing nucleotides of the genetic sequence of the organism to nucleotides from a reference genome, to find differences where nucleotides of the genetic sequence of the organism which are different from the nucleotides of the reference genome; the computer using the differences to create surprisal data, the surprisal data comprising a starting location of the differences within the reference genome, and the nucleotides from the genetic sequence of the organism which are different from the nucleotides of the reference genome; and the computer transmitting, to a destination, a compressed genome comprising: surprisal data and an indication of the reference genome, discarding sequences of nucleotides that are the same in the sequence of the organism and reference genome.

Abstract: The present invention relates to methods of optimization of a protein coding sequences for expression in a given host cell. The methods apply genetic algorithms to optimise single codon fitness and/or codon pair fitness sequences coding for a predetermined amino acid sequence. In the algorithm generation of new sequence variants and subsequent selection of fitter variants is reiterated until the variant coding sequences reach a minimum value for single codon fitness and/or codon pair fitness. The invention also relates to a computer comprising a processor and memory, the processor being arranged to read from and write into the memory, the memory comprising data and instructions arranged to provide the processor with the capacity to perform the genetic algorithms for optimization of single codon fitness and/or codon pair fitness.

Abstract: According to one embodiment, an apparatus stores a plurality of datapoints. A datapoint comprises a first value and a second value that depends upon the value of the first value. The apparatus associates the datapoint with a group from a plurality of groups. The group is associated with an identifying range and the datapoint is associated with the group based at least in part upon the first value of the datapoint and the identifying range of the group. The apparatus calculates a median of the second values of the datapoints associated with the group and a performance value by performing a regression based at least in part upon the identifying range and the calculated median of the group. The apparatus determines that the performance value exceeds a baseline value and in response, presents, on a display, an illustration depicting the identifying range and the associated median of the group.

Abstract: This patent application relates to granular and workload driven database index defragmentation techniques. These techniques allow for defragmenting individual index ranges, performing benefit analysis to estimate the impact of defragmenting indexes or index ranges, and leveraging such benefit analysis to provide automated workload-driven recommendations of index(es) or index range(s) to defragment.