Abstract: A computer-implemented system and method for generating document training sets is provided. Unclassified documents are provided to two or more classifiers. A classification code assigned to each unclassified document is received. A determination is made as to whether a disagreement exists between classification codes assigned to a common unclassified document via different classifiers. The common unclassified document with a disagreement in classification codes are provided for further review. Results of the further review include one of a new classification code and confirmation of one of the assigned classification codes. The unclassified documents for which a disagreement exists are grouped as a training set.

Abstract: Embodiments described herein generally relate to a bulk keyword management application. The bulk keyword management application allows a user to associate a plurality of keywords with a plurality of media items at once. The plurality of keywords may be searchably associated with the plurality of media items. Associating keywords to media items in bulk effectively organizes a gallery of media items in a time efficient manner, making the gallery easy to navigate through a search means.

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

Abstract: Systems and methods are provided for providing search results. An expert search thread associated with a search term is received. A first query from a first user based on the search term is received, and a set of results to the first query is provided, where the set of results includes the expert search thread. A credibility score is determined for the expert search thread. A second query is received from a second user based on the search term. A placement of the expert search thread in a set of results for the second query is determined based on the credibility score for the expert search thread, and the set of results for the second query is provided to the second user.

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

Abstract: Methods and devices for interacting with information using a computing device. A plurality of nodes in a database may be created and stored on a non-transitory computer readable medium and accessible by a processor. Each node may have at least one data element and be linked to at least one other of the plurality of nodes such that the link reflects a relationship between the data elements referenced by the linked nodes. A plurality of information areas may be displayed, each displaying information stored in one of the data elements and positioned relative to the plurality of information areas based on the relationship. The plurality of information areas may be positioned such that a final portion of information displayed in a first information area in a sequence is aligned with an initial portion of information displayed in a subsequent information area in the sequence.

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

Abstract: A method and a system for determining the state of a device in an aircraft, this state being specified by a current version of the device as implemented in the aircraft. The method according to the invention comprises: transmitting a request to a database and receiving in response a list of updates previously performed on the device, each update specifying an earlier version and a later version; and from a directed graph, such that each edge corresponds to an update of a set of updates associated with devices of the type of the device of interest, determining a sub-graph corresponding to the list.

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

Abstract: A method and a system for managing data of a database in a MES system enables improved horizontal scalability of the client-server applications. The manufacturing execution system manages and controls the planning and execution of a production process of a product. Resources and clients generate and request data related to the production process. A relational database system includes a write database and a read database. A central service bus links the resources to the write database. A logical worker entity handles commands from the resources and clients queued in the central service bus, thereby interpreting the actions related to the write database, collecting the data required to complete the actions, and launching the execution of the command. A logical reader entity captures all data requests from the resources and clients, launching the requests for data from the read database and sending the data back to the requesting resource or client.

Abstract: A method for accessing and automatically correlating data from a plurality of external data sources that includes: A) defining at least two sets of data by querying a plurality of existing external data sources using user application software, a central computer and user defined search statements; B) generating a computer program code which provides access to the external data sources; C) loading the sets of data in a memory of the central computer using the computer program code to gain access to the external data sources; D) storing references which specify links to each of the sets of data provided by the external data sources in a data storage of the central computer; and E) automatically correlating data from the sets of data by using the referenced sets of data using at least one rule of correlation included in the user application software.

Abstract: A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete.

Abstract: The computational cost for a mapping process performed in analyzing genome/exome/transcriptome is reduced by sorting all cyclic permutations or suffixes of all read sequences to allow a search to be performed on the basis of any base sequence as a key. Also performed is computing and storing, for each base position in a genome sequence, the minimum length for uniqueness (MLU) at which a partial sequence starting from the base position becomes unique in the genome. In analysis of variations, a target region is scanned to inspect the number of matching read sequences that contain a partial sequence with a length of MLU and thus estimate the position of a variation, and then, the read sequences are collected at a position where the possibility of a variation having occurred is high to perform comparison analysis of the sequences.

Abstract: An interface provides decision support in complex problem environments. An interface engine selectively communicates with a database to display (e.g., in tree form) proposed decisions and various corresponding outcomes resulting from cause-effect relationships of selected decisions. Structured data objects store state information (e.g., current/projected/target) of multi-faceted, inter-connected entities. Object metadata can include entity attributes and/or entity relationship details. The interface allows traversing the tree to explore the cause-effect relationships and/or validate various solution paths. The tree (including the proposed decisions, outcomes, and solution paths) may be initially generated up front, based upon particular problem scenario characteristics. Limited subsequent interaction between the interface engine and the underlying backend data store may enhance speed/performance/user experience.

Abstract: The present invention is a method and system for using predetermined preferences/characteristics to ascertain personal compatibility between network or chat room participants based upon profile information. When the system determines that these preferences are favorable for interpersonal compatibility, the system will automatically notify or page the participants so as to facilitate their introduction. Further functionality, aside from the compatibility based upon profile information, includes e-mail and other electronic notification of personal compatibility as well as geographic compatibility.

Abstract: A knowledge sharing system includes a social network service (SNS) providing server that stores relationship information between a first user and a second user. The knowledge sharing system includes a knowledge sharing service providing server including a query data management unit that stores query data when the query data is transmitted from a first terminal of the first user and stores a query sharing request in association with the query data when the query sharing request is transmitted from a second terminal of the second user, and in the storing of the query sharing request, the query data management unit matches the query sharing request with the query data; and a query data providing unit that provides the query data matched with the query sharing request to a third terminal of a third user, where the third user is connected with the second user in the SNS platform.

Abstract: Finding connected components in a graph is a well-known problem in a wide variety of application areas such as social network analysis, data mining, image processing, and etc. We present an efficient and scalable approach to find all the connected components in a given graph. We compare our approach with the state-of-the-art on a real-world graph. We also demonstrate the viability of our approach on a massive graph with ˜6B nodes and ˜92B edges on an 80-node Hadoop cluster. To the best of our knowledge, this is the largest graph publicly used in such an experiment.

Abstract: A system that enables development and execution of predictive models comprises a centralized data management system, a data extraction tool a model validation tool and a model execution tool. In embodiments, a data management system includes a data management server that can be accessed via a web browser that stores data in the form of a flat file. An extraction tool extracts data. A model validation tool validates a model by scoring an analytical environment data set and a production environment data set. A model execution tool allows a user to select when and how often a model is scored.

Abstract: Techniques for detecting data skew while performing a distributed join operation on tables in a cluster of nodes managed by database management system (cDBMS), is disclosed. In an embodiment, heavy hitter values in a join column of a table are determined during the runtime of a distributed join operation of the table with another table. The cDBMS keeps in a datastore a count for each unique value read from the join column of the table. The datastore may be a hash table with the unique values serving as keys and may additionally include a heap or a sorted array for an efficient count based traversal. When a count for a particular value in the datastore exceeds a threshold, then the particular value is identified as a heavy hitter value.

Abstract: A deduplication method using data association information includes extracting information about a target file and at least one reference file associated with the target file as association information before duplication determination is performed. The at least one reference file is identified by the association information as a comparison target set for comparison when the duplication determination of the target file is performed. The duplication determination is performed with the target file with respect to the at least one reference file in the selected comparison target set.