Abstract: The present invention extends to methods, systems, and computing system program products for iteratively calculating a skewness for streamed data. Embodiments of the invention include iteratively calculating one or more components of skewness in an adjusted computation window based on the one or more components of the skewness calculated for a previous computation window and then calculating the skewness based on the iteratively calculated components. Iteratively calculating skewness avoids visiting all data elements in the computation window and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system power consumption.

Abstract: A computer system extracts contender values as positively associated with a pre-defined value from a compilation of one or more electronically stored semi-structured document(s) and/or one or more electronically stored unstructured document(s). The computer system performs a multi-dimensional analysis to narrow the universe of contender values from all words on a page of the compilation to the contender value(s) with the highest likelihood of being associated with the pre-defined value. The system's platform allows every user of the system to customize the system according to the user's needs. Various aspects can enable users to mine document stores for information that can be charted, graphed, studied, and compared to help make better decisions.

Abstract: The concept of a bi-directional search and match system or simply a match engine system is presented along with the detailed method and an algorithm for execution of the same. In this construct, a relational database, supported by appropriate software modules for other functions receives search queries from users and 5 converts them into numerical codes that are automatically and continuously matched against the search criteria provided by other users. The match engine continues with the match process at a pre-set time interval and automatically alerts the concerned users every time a match is found or as requested by the user. A user is enabled to initiate a range of follow-up actions 10 when at least one matching criteria is met.

Abstract: In one embodiment of the present invention, one or more computer processors create update commands that describe a state change of a resource and include the update commands in a change event for the resource in a change log. Embodiments of the present invention can obviate the need for an indexer to retrieve all triples of a changed resource via HTTP GET requests, and obviate the need for the indexer to replace all triples of a prior version of a changed resource with newly obtained triples.

Abstract: A method includes generating a migration image file for a software migration based on configuration parameters associated with a first node of an industrial process control and automation system. The method also includes, after a new software version is installed at the first node, restoring information associated with the first node using the migration image file. The method further includes adapting a portion of the migration image file based on configuration parameters associated with a second node of the control and automation system. In addition, the method includes, after the new software version is installed at the second node, restoring information associated with the second node using the adapted migration image file.

Abstract: The present invention extends to methods, systems, and computing system program products for incrementally calculating correlation for Big Data or streamed data. Embodiments of the invention include incrementally calculating one or more components of a correlation for two modified computation subsets based on one or more components calculated for two previous computation subsets and then calculating the correlation based on the incrementally calculated components. Incrementally calculating the components of a correlation avoids visiting all pairs of data elements in the two modified computation subsets and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying a set of digital content that are responsive to a search query; detecting an electronic tag within the set of digital content; automatically converting the electronic tag to a frame element; generating and transmitting to an user device a composite page that: is hosted at a different domain than at least some digital content; includes different digital content from the set of digital content; and initially hides presentation of the frame element in the composite page; receiving a request for additional content generated by the frame element that identifies one of the various digital content sources; embedding observation code into the additional content; and determining that the additional content was visually perceptible on a display of the user device based on an electronic message received from the intersection observer code executing at the user device.

Abstract: A method and system for recommending content includes a user device having a memory storing a taxonomy table having content cluster identifiers therein. The user device receives an external recommendations list for the content cluster at the user device. The recommendations list has a plurality of content identifiers each having one content cluster identifier. A viewer tracking module generates a viewed content history for content relative to the content clusters identifiers that correspond to viewed content at the user device. A recommendation module generates an internal recommendations list by comparing the external recommendations list to the viewed content history at the user device. The internal recommendation list also presents recommendations capturing the distinct user tastes in a family viewing device. A display displays the internal recommendations list, with section headers of different granularity describing the nature of the recommended content at cluster, sub-genre and genre levels.

Abstract: A method includes displaying a first graphical user interface (GUI) via a first native application installed on a mobile computing device. The first GUI is configured to accept a search query, including one or more search terms, and transmit the search query to a search engine. The method includes receiving search results including a post execution view of a second native application for display on the touchscreen. The post execution view is a second GUI providing access to a function associated with the second native application. The method includes, at the search engine, identifying, based on the search terms of the search query, the second native application in an index that stores information and code related to native applications. The method includes executing code associated with the second native application to generate a post execution view. The method includes transmitting the post execution view to the mobile computing device.

Abstract: Techniques of operating a GRC processing platform involve terminating retrieval activity in a data source when the data source indicates that there is no data to be obtained that satisfies a specified logical condition. Along these lines, a user of the GRC processing platform provides instructions to retrieve data from an external data source. As part of the data retrieval, the GRC processing platform accesses data from the external source and transforms the data from a first format (e.g., XML) to a second format (e.g., XML) appropriate for an application that runs on the GRC processing platform. After the transformation, the GRC processing platform receives an indication that the transformed data satisfies a logical condition indicating that the data being retrieved is not desired for the application. In this case, the GRC processing platform terminates the data retrieval.

Abstract: This invention discloses a novel system and method for determining the geneology of versions of a document by inspection of content extracted from the document. In one embodiment that is compatible with Microsoft™ Word ™, the invention extracts the RSID values from each version of a document and then applies logical rules to the extracted set of RSID values to determine which versions are ancestors of the other versions.

Abstract: Several embodiments include a data cache system that implements a data cache and processes content requests for data items that may be in the data cache. The data cache system can receive a content request for at least one data item. The data cache system can update a karma score associated an originator entity of the data item. The originator entity can be a user account that uploaded the data item. When wiping the data cache for more storage space, the data cache system can determine whether to discard the data items based on a cache priority that is computed based, at least partially, on the karma score.

Abstract: A method for clustering content is disclosed. The method reduces the likelihood that unrelated content is included in a cluster, allows users to more discover content and content is automatically curated. A collection of posts is associated with a common tag. A seed post is identified from the collection of posts. The collection of posts is grouped into a first cluster of posts based on the seed post and a first attribute. The collection of posts is grouped into a second cluster of posts based on the seed post and a second attribute. A preferred view is determined from at least one or more of: the first cluster and the second cluster. The preferred view is provided for display. Unrelated content includes topically unrelated posts, posts by users unrelated to a seed user, posts by users unrelated to the seed post in an activity graph.

Abstract: Search results can include, not only responsive content, typically in the form of documents, but can also include information regarding responsive entities, including tasks relevant to those entities, and can include identifications of individuals from whom additional information can be obtained, or who are otherwise relevant to the search. An association between entities and documents referencing those entities is identified and maintained. Documents responsive to a user's search query are identified utilizing existing algorithmic mechanisms and such identified responsive documents are referenced to determine whether they are associated with one or more entities. Additionally, a people/query mapping is maintained associating individual people with specific queries. User actions directed to one or more people in response to a query are utilized as a feedback loop.

Abstract: Computer-implemented methods and systems for classifying documents and freight-truck-transaction documents are described. A method may comprise receiving document data corresponding to a document, at a document classification device, wherein the document data comprises text data. The method may further comprise detecting, at the document classification device, an existence of, or an absence of, one or more predetermined text fields in the document based upon, at least in part, the document data. The method may additionally comprise assigning, at the document classification device, a value to the one or more predetermined text fields based upon, at least in part, the existence of, or the absence of, the one or more predetermined text fields in the document. The method may also comprise determining, at the document classification device, a score for the document based upon, at least in part, values assigned to the one or more predetermined text fields.

Abstract: A building management system (BMS) includes building equipment configured to provide raw data samples of one or more data points in the BMS. The BMS further includes a data collector configured to collect raw data samples from the building equipment and generate one or more raw data timeseries comprising a plurality of the raw data samples. The BMS also includes a timeseries processing engine. The timeseries processing engine is configured to identify one or more timeseries processing workflows that apply to the raw data timeseries, each of the workflows comprising a predefined sequence of timeseries processing operation. The timeseries processing engine is further configured to process the raw data timeseries using the identified timeseries processing workflows to generate one or more derived data timeseries. The BMS further includes a timeseries storage interface configured to store the raw data timeseries and the derived data timeseries in a timeseries database.

Abstract: Embodiments disclosed herein provide systems and methods for performing garbage collection in virtual environments. In a particular embodiment, a method provides performing a garbage collection process to identify at least a portion of a secondary storage volume located within a primary storage volume. The method further provides triggering a data block release process on at least a portion of the primary storage volume corresponding to the at least a portion of the secondary storage volume.

Abstract: Disclosed herein is an automated approach for summarizing media content using descriptive information associated with the media content. For example and without limitation, the descriptive information may comprise a title associated with the media content. One or more segments of the media content may be identified to form a media content summary based on each segment's respective similarity to the descriptive information, which respective similarity may be determined using a media content and auxiliary data feature spaces. A shared dictionary of canonical patterns generated using the media content and auxiliary data feature spaces may be used in determining a media content segment's similarity to the descriptive information.

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs. Such a method improves the design of a choropleth map.

Abstract: The present invention provides at least a method includes: extracting a plurality of partial communities from a plurality of users, based on the relationships of companion messages; computing a first degree of similarity for showing the similarity of the companion partial communities, based on the relationship of a user belonging to one partial community with a user belonging to the other partial community, from among the plurality of communities; computing a second degree of similarity for showing the similarity of companion partial communities, based on words within the messages sent by users belonging to both partial communities and under the condition that the first similarity be higher than a predetermined first threshold value; and creating an integrated community by integrating the companion partial communities under the condition that the second similarity be higher than a predetermined second threshold value.