Abstract: A system and method are disclosed for managing playlists of digital content. Digital content preference data is received from a plurality of users. The preference data is then processed to generate a group preference playlist, which contains references to digital content that is mutually preferred by each of the users. The group preference playlist is then initiated to play the mutually-preferred digital content.

Abstract: A computer system or method identifies components. A component fingerprint storage is configured to memorize known fingerprints of known components. The term “component” used herein is defined to be a specific version of pre-existing executable software, or a reusable pre-existing self-contained software code building block which is not a complete stand-alone finished product ready for use and which is binary or source code. A fingerprint is generated for a normalized unknown component and fingerprints are generated for all normalized components included in the unknown component. It is determined whether any of the fingerprints generated for the normalized unknown component and for the normalized components included in the unknown component match any of the known fingerprints of known components.

Abstract: A technique for parallelizing model checking using breadth-first search in order to detect deadlocks and safety property violations is disclosed. The technique is based on Parallel Structured Duplicate Detection (PSDD) and preserves a model checker's ability to perform partial order reduction with parallel breadth-first search. PSDD also uses much less memory and is able to achieve better parallel speedup and verify models more quickly. Also, PSDD used herein is able to make use of external memory, such as hard disks, to reduce the memory requirements of verification.

Abstract: The techniques discussed herein efficiently perform data-parallel computations on collections of data by implementing a differential dataflow model that performs computations on differences in the collections of data. The techniques discussed herein describe defined operators for use in a data-parallel program that performs the computations on the determined differences between the collections of data by creating a lattice and indexing the differences in the collection of data according to the lattice.

Abstract: A method for uploading a music library to a music provider service is provided. The method initiates with identifying a music library for uploading, the music library including at least one music file, the music file including audio data and associated metadata fields. A mapping between the metadata fields of the music file and metadata fields of a destination file corresponding to the music file is then defined. The destination file is created at the music service provider by copying the audio data to the destination file and by copying contents of the metadata fields of the music file to the metadata fields of the destination file according to the mapping.

Abstract: A method, apparatus and article of manufacture for creating visualizations of documents are described. In one embodiment, the method comprises receiving an electronic visual, audio, or audiovisual content; generating a display for authoring a multimedia representation of the received electronic content; receiving user input, if any, through the generated display; and generating a multimedia representation of the received electronic content utilizing received user input.

Abstract: A system includes one or more remote check deposit locations, and one or more treasury receipt servers to receive check information captured from the one or more remote check deposit locations, and to receive transaction data from an originating depository financial institution (ODFI), the transaction data including an amount of funds available from clearing the captured check information.

Abstract: Embodiments of the present invention provide a business intelligence engine, comprising: a processor; and at least one computer program residing on the processor; wherein the computer program is stored on a non-transitory computer readable medium having computer executable program code embodied thereon, the computer executable program code configured to: receive data from a entity; translate the data into a staging database; extract the data from the staging database; execute and manipulate the data from the staging database and transmit the data to a transaction database or a business intelligence database; and cause a reporting services to extract data from the transactional database or the business intelligence database.

Abstract: A data storage system may contain a changeable database that includes: advisory information that includes the content of multiple advisory statements; query information that includes the content of multiple user queries; and flow logic information indicating a sequence for the delivery of the advisory statements and the user queries based on answers to the user queries. A user interface may deliver the user queries and the advisory statements to a user and receive answers in response to the user queries from the user. An information delivery engine that is separate from the changeable database may cause the user interface to deliver the user queries and the advisory statements to the user in a sequence based on the user's answers to the user queries and the flow logic information. This in system may be adopted to troubleshooting equipment, such as an optical network terminal.

Abstract: A query is received from a user computer system within a website, a call is transmitted from the host computer system to the data provider computer system corresponding to the query, including the call number for the query, a plurality of representations for the query are received from the data provider computer system at the host computer system and transmitted from the host computer system over the network to the user computer system. The call number is calculated based on a rank of the representations in a first historical data set. An access control module periodically resets the call number to higher number, whereafter a determination is made to maintain the call number at the higher or to reduce the call number.

Abstract: A method for submatch extraction may include receiving an input string, receiving a regular expression. The method may further include converting the regular expression with capturing groups into ordered binary decision diagrams (OBDDs) to extract submatches.

Abstract: Systems and methods are disclosed for providing at least one document suggestion from a computer system using at least one information source, the method comprising storing in the information source a plurality of associations, each of which includes a numeric coefficient that corresponds to at least one action of a user and at least one document; receiving a triggering action related to the at least one action of the user; comparing the numeric coefficients stored in the information source with a suggestion threshold based on the triggering action; and for each numeric coefficient that exceeds the suggestion threshold, identifying the corresponding at least one document as a suggested document.

Abstract: A method which on determination of an entity replacement request is configured to identify an optimized entity as a replacement based on a predefined set of metadata, wherein the metadata comprises a profile associated with the entity, wherein the profile of the entity is further based on a graph, such as a graphical representation of social links, associated with the entity; and provide the optimized entity as a replacement for the entity to be replaced. Other embodiments are also disclosed.

Abstract: An approach is presented for generating a log parser. Regular expressions are received and stored in a crowd-sourced data repository. An instruction is received to create a log parser based on a sample log. The sample log is received. Matches are identified between strings of characters included in the received sample log and regular expressions included in the stored regular expressions. Each match indicates a stored regular expression is capable of parsing a string included in the sample log. Based on the identified matches, the log parser is generated so as to include the regular expressions that match the strings included in the sample log.

Abstract: The field of the invention relates to systems and methods for operation of a matching service, and more particularly to systems and methods that enable online compatibility matching and ranking. In a preferred embodiment, the system includes a matching system server coupled to a public network and accessible to one or more users. The matching system server includes a database that stores match profile data associated with the one more users, wherein the match profile data includes self-identified preferences. The matching server system is configured to correlate a first user's match profile data with one or more of the plurality of users' match profile data to identify a set of potential matches for the first user based on a relaxed set of self-identified preferences and calculate a compatibility value for each match in the set of potential matches.

Abstract: Disclosed herein is a conditioning system for nutritional substances. The conditioning system obtains information regarding the nutritional substance to be conditioned, the desired conditioning, and the desired properties, including nutritional content, of the conditioned nutritional substance, and dynamically controls the conditioning in response to this information optimize the organoleptic properties of the conditioned nutritional substance, while minimizing any detrimental changes to the nutritional content.

Abstract: A method for managing log messages in a system includes identifying a log message having a data value, filtering a first data value from a historical log record for a first interval, predicting whether any particular system events should occur when the first data value is filtered from a received log record and identifying the corresponding system events, initiating a second interval while filtering the first data value from a received log record, determining whether any non-predicted system events have occurred, and removing the filter for the first data value responsive to determining that a non-predicted system event has occurred.

Abstract: System and methods are disclosed for employing a matrix that maps known terms to tag values based on pre-existing tag value assignments in order to automatically assign tags to item descriptions. In particular, the matrix maps terms to tags as a function of pre-existing associations between the terms and the tags in one or more external data sources. A term generation component receives a description comprising a plurality of terms and filters the description to identify a subset of the plurality of terms. A tag assignment component then identifies one or more tags associated with the subset of the plurality of terms in the data matrix and assigns the one or more tags to the description.

Abstract: An approach is provided for providing intelligent processing of contextual information. An context platform determines at least one feature based, at least in part, on one or more contextual parameters The context platform further processes one or more contextual records to determine whether the at least one feature is a feature anchor based, at least in part, on whether the at least feature is represented above at least one threshold level. The context platform also processes the one or more contextual records to determine at least one profile for the at least one feature anchor.

Abstract: A computer program product comprising a computer readable storage medium containing computer code that, when executed by a computer, implements a method for transforming a finite state automaton (FSA) of a regular expression, wherein the method includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.

Abstract: A computer-implemented method for transforming a finite state automaton (FSA) of a regular expression includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.

Abstract: A method, computer product, and computer system of reducing an amount of data representing a genetic sequence of an organism, comprising: a computer dividing a reference genome and a sequence of the organism into parts and assigning the parts to one of a plurality of computer processing elements. Within each computer processing element, comparing nucleotides of the genetic sequence of the organism to nucleotides from a part of the reference genome, to find differences where nucleotides of the genetic sequence of the organism which are different from the nucleotides of the reference genome; and storing the surprisal data in a repository. Combining the parts of the surprisal data from the repository to form a complete set of surprisal data representing the differences between the genetic sequence of the organism and the reference genome; and storing the complete set of surprisal data in the repository.

Abstract: A method and apparatus for determining relationships between objects in a meta-model semantic network is described. A contextual network graph comprising nodes and edges representing semantic objects and semantic relationships is generated from a meta-model of business objects from the meta-model semantic network. The contextual network graph is used to generate a unique identifier for each node and associated edge. The unique identifiers are used to compute information of cost and energy between the nodes. The information is stored in a meta-model semantic network database.

Abstract: A system, method, and computer program product are provided for determining whether code is unwanted based on the decompilation thereof. In use, code is identified and the code is decompiled. In addition, it is determined whether the code is unwanted, based on the decompiled code.

Abstract: The field of the invention relates to systems and methods for processing unstructured data, and more particularly to systems and methods for indexing and presenting numerical data sets. In one embodiment, a computer-implemented method for processing unstructured data includes the steps of retrieving one or more raw data sets from a data network; extracting relevant information from each set of raw data; populating a structured table using the extracted information; and refining the structured table for further processing or publishing.

Abstract: Natural language processing (NLP) approaches may be utilized to map two strings. The strings may come from sources utilizing different naming conventions. One example may be a data aggregator that collects used car transaction information. Another example may be a comprehensive database listing all possible manufacturer-defined vehicle options. A NLP system may operate to determine whether a source string is present in a target string and outputting a match containing the source string and the target string if the source string is present in the target string or computing a similarity factor if the source string is not present in the target string. The similarity factor representing a measure of similarity between two strings may be computed based on a plurality of parameters, including a Levenshtein edit distance parameter. The computed similarity can be used to find pricing information, including trade-in, sale, and list prices, across disparate naming conventions.

Abstract: A method of determining when an event occurred in an industrial plant, the event being defined by a number of variables simultaneously meeting their respective event-specific conditions, each of the number of variables having a plurality of data entries, each data entry comprising a value of the each of the number of variables and a time at which the value was obtained from the industrial plant, the method comprising a user creating an event definition on a client machine by defining the respective event-specific conditions for the number of variables; an executable application module in the server tagging with a user-assigned event label those of the plurality of data entries in which the number of variables simultaneously met their respective event-specific conditions; and the executable application module further creating an event occurrence list containing times corresponding to those of the plurality of data entries that have been tagged.

Abstract: A system and method for determining a newsworthiness score for a news story, including the steps of receiving data describing a news story from a client, comparing the data describing the news story to a set of pre-determined factors, locating the factors that are present on the set of pre-determined factors in the data, adding pre-calculated values to a running total, the newsworthiness score, for each factor found in the data.

Abstract: A method, medium, and apparatus are disclosed for indexing multimedia content by a computer. The method comprises segmenting the multimedia content into a plurality of segments. For each segment, the method identifies one or more features present in the segment, wherein the features are of respective media types. The method then identifies, for each identified feature in each segment, one or more respective keywords associated the identified feature. Then, the method determines, for each identified keyword associated with an identified feature in a given segment, a respective relevance of the keyword to the given segment. The respective relevance is dependent on a weight associated with the respective media type of the identified feature.

Abstract: An integrated system of song personalization facilitates the customization of user song lyrics and the association of multimedia content with the lyrics to generate a personalized song. The system allows users to create personalized songs from song templates for different occasions, and the system further allows users to select multimedia content to be associated with specific sections of the song templates.

Abstract: A pre-audit system, apparatus, and method is provided to perform a pre-audit of form data. Form data is received from a supplier prior to the form data being delivered to one or more purchasers. The form data is compared with rules or conditions set by the one or more purchasers. A response message is transmitted to the supplier, where the response message includes one or more results and one or more descriptions related to the one or more results.

Abstract: Embodiments of a mobile state object for storing and transporting job metadata on a cluster computing system may use a database as an envelope for the metadata. A state object may include a database that stores the job metadata and wrapper methods. A small database engine may be employed. Since the entire database exists within a single file, complex, extensible applications may be created on the same base state object, and the state object can be sent across the network with the state intact, along with history of the object. An SQLite technology database engine, or alternatively other single file relational database engine technologies, may be used as the database engine. To support the database engine, compute nodes on the cluster may be configured with a runtime library for the database engine via which applications or other entities may access the state file database.

Abstract: An approach for selecting points of archived history data for viewing. The approach may relate to a user interface workflow of selecting points. Site controllers may be configured using control entity definitions, history extensions, point group naming and template features of a supervisor. The supervisor may provide for selection of groups or categories of sites and controllers within selected sites using selection boxes. This may permit a user to quickly refine site selection by, for example, filtering by group, site category, and a refined site list box. Once a site, the controllers and desired point groups and other appropriate items have been selected, the user may proceed to view historical data for the selected sites and controller points.

Abstract: Systems and methods are provided for seamlessly switching media playback between a media broadcast, such as a radio broadcast, and media from a local media library. When an electronic device determines that an upcoming media item in a media broadcast is not of interest to a user, the electronic device can switch playback from the media stream to a media item from the electronic device local library. The selected local media item can be related to a previously broadcast media item to ensure continuity in the user's listening or viewing experience. The electronic device can switch away from the local media item and return to the media stream when the media stream again broadcasts media items or segments of interest to the user.

Abstract: A media bundle and one or more media bundle overlays allow modifying content that is to be played by a playback framework of an electronic device with multimedia content objects contained in the media bundle overlays without modifying the media bundle. A runtime data structure dynamically incorporates the multimedia content contained in the media bundle with multimedia content contained in the media bundle overlays. Manifest objects in the media bundle and some media bundle overlays describe multimedia content contained in the media bundle and the corresponding media bundle overlays. Multimedia content contained in the multimedia bundle overlays may supplement or replace multimedia content contained in the media bundle.

Abstract: Disclosed herein are systems and methods for controlling access to content, and/or regions thereof, as well as controlling access to annotations to the content, or regions thereof. An audience can be specified for a region of content and one or more associated annotations. In response to a request for a content region, a content region definition, an audience definition for the content region, and at least one annotation for the content region and audience can be obtained, and the content region and the at least one annotation can be transmitted in response to the request if it is determined that the request is from a member of the audience, so that the content region and annotation can be experienced at an audience member's device.

Abstract: A vehicle identification number (VIN) decoder (VDC) implementing a unique VIN decoding method may, for a given VIN, shorten the VIN and form a stem and a leaf therefrom. Utilizing the stem, the VDC may operate to find matching leaf values, if any, from a set of look up tables. Depending upon a match outcome, one or more trim identification code (TIC) values can be assigned to the VIN and a candidate list can be constructed utilizing the assigned TIC value(s). The candidate list, which can be optimized, may contain one or more candidate trims for the VIN. For each candidate trim, a confidence score and match probability can be generated. The VDC may provide decoded information containing trim data associated with at least one of the one or more candidate trims for the VIN to a client device over a network connection.

Abstract: Techniques for hierarchy visualization for organizations are described. An apparatus may comprise an information retrieval component and a profile construction component. The information retrieval component may be generally operative to retrieve information regarding a plurality of individuals from a plurality of data repositories. The profile construction component may be generally operative to create a plurality of profiles from the retrieved information, wherein each profile combines information regarding an individual from the plurality of data repositories. Other embodiments are described and claimed.

Abstract: Provided is a method for processing input data in a storage system and in communication with a repository. Views are generated that comprise a tree of nodes selected from a subset of nodes in a hierarchical representation of a schema. The views are saved to the repository. At least one of the views are used to create a job comprising a sequence of data transformation steps to transform the input data described by input schemas to the output data described by output schemas.

Abstract: Methods, systems, and subsystems for identifying and accessing multimedia content are provided. One external library access module includes instructions, stored on computer readable media, that, when executed by a processor, perform steps for: accessing personal profile settings stored in computer readable media, the profile settings including personal settings relating to filtering content; accessing an external search engine used to identify content on a network, the engine having an adjustable content filter; and selecting a setting of the filter based on the personal settings. In another embodiment, a method for identifying and accessing multimedia content from a network includes: filtering content described in a first compilation of data in strict adherence to personal settings relating to filtering content; and using an external filter to filter content accessible from the network through an external search engine.

Abstract: Systems and methods are provided for data comparisons in a compression algorithm to optimize the compression of data. An exemplary method includes receiving input data. The method further includes generating a hash table address for the input data. The method further includes obtaining a pointer associated with the hash table address. The method further includes reading a data library with the pointer to obtain an associated piece of historical data. The method further includes comparing the historical data to the input data to determine a match.

Abstract: Example systems and methods of managing product genealogy data across distributed systems are described. In one implementation, a method identifies a material associated with a product that is part of a product batch. Usage information associated with the material is accessed, and a handling unit associated with the product batch is identified. Delivery information associated with the product batch is also accessed. A genealogy is generated for the product batch based on the material, the usage information, the handling unit, and the delivery information.

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: Various embodiments for providing a narrative summary for fantasy games are described. Embodiments may include a summary engine executing on a logic device. The summary engine may select a beat writer and a story type. The summary writer may select new content from one or more databases of fantasy league data. The beat writer may affect what story type is selected. The summary engine may construct a master template according to the story type that has empty slots. The summary engine may fill the empty slots of the master template with data from the new content to generate a narrative summary, and publish the narrative template with the slots filled. Other embodiments are described and claimed.

Abstract: In one embodiment, the method includes profiling a data file comprising one or more fields of data. The one or more fields of data contain an item of data; that is, a character, or group of characters that are related. Further, the method includes generating one or more profiling attributes based on profiling the data file. In an example, the one or more profiling attributes refer to profiling information relating to pattern, structure, content and format of data. Further, the method includes selecting at least one of the generated one or more profiling attributes and generating a validation rule based on the selected at least one profiling attribute.

Abstract: A computer-implemented method for providing access to media content in multiple locations includes: storing media content in a system that has a memory and another storage; generating an object that represents the media content, the object including media content metadata and a media content reference configured to identify each of a memory location and a storage location; and making the object available to an application, the media content reference providing access to the stored media content at the memory location or at the storage location.

Abstract: A content item is requested by a user via the user's computing device. In response, data, such as a set of facts, related to the requested content item is identified and served with the requested content item for presentation with the content item at the user's computer device. The related data can comprise facts related to the content item, and the related data can be presented as a graphic, such as part of a multi-dimensional graph, in connection with the presentation of the content. The related data can be retrieved from a facts database using search criteria formed using tags obtained for the requested content item.

Abstract: A data processing apparatus includes a comparison unit configured to perform an element comparison process performing a comparison of a first data element at a first index in the first vector with a second data element at a second index in the second vector. A hazard vector generation unit is configured to populate a hazard vector at an index determined by the first index with a value determined by the second index. The comparison unit performs the element comparison process by iteratively comparing data elements of the first vector with each element of a subset of the second vector. It then determines the subset of the second vector as those data elements at indices in the second vector which are less than a current index of the first vector and which are greater than previously determined values of the second index for which the match condition was true.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for verifying a message based on application of a hashing algorithm. In one aspect, a method includes identifying a file and a key value and processing the file using multiple nonlinear functions to generate an output hash value, where the operations performed by the nonlinear functions are modified based on the key value. The file can then be verified based on the output hash value.

Abstract: In a hierarchical profile, each node represents at least one feature of behavioral data collected about an entity profiled, with the topmost node selected as the “statistically most informative” feature of the data. A profile can cover numerous domains and be predictively very powerful in each domain. A number of observations can be “aggregated” together into a single datapoint. In use, the structure of the profile is compared against current information associated with the entity to produce a recommendation or prediction. If the profile represents at least some data aggregation, then new observations are folded into the profile based on statistical weights of the aggregations. Because of the way the profile is created and updated, its hierarchical structure maps the collected observations. Therefore, as new observations are incorporated, if the new observations change the profile's structure significantly, then it can be hypothesized that something “interesting” has happened to the entity.