Abstract: From social media content using a processor and a memory, a class model is constructed that is representative of a type and a level of toxicity associated with the content. A first social media message is analyzed, using a processor and a memory, to compute a first toxicity score associated with the first social media message and assign the first social media message to a first class of the class model. A second social media message is analyzed, using a processor and a memory, to compute a second toxicity score associated with the second social media message and assign the second social media message to a second class of the class model. Based on the first toxicity score, the first class, the second toxicity score, and the second class, a toxicity trend is forecasted. In response to the toxicity trend being forecasted to increase, a remedial measure is applied to reduce the toxicity trend.

Abstract: A method including parsing a query into a tree of operations, generating a query matrix and a transcript matrix, determining a cross-correlation of the query matrix and the transcript matrix, applying a softness map to the cross-correlation to determine one or more matches for each of the literals, and combining the one or more matches utilizing the tree of operations to generate an output, each of the operators corresponding to a combination operation for the matches.

Abstract: A method, computer program product, and computing system for performing an entropy analysis on each of a plurality of candidate data chunks associated with a potential candidate to generate a plurality of candidate data chunk entropies; performing an entropy analysis on each of a plurality of target data chunks associated with a potential target to generate a plurality of target data chunk entropies; identifying a candidate data chunk entropy limit, chosen from the plurality of candidate data chunk entropies, and a target data chunk entropy limit, chosen from the plurality of candidate data chunk entropies; and comparing a specific candidate data chunk associated with the candidate data chunk entropy limit to a specific target data chunk associated with the target data chunk entropy limit to determine if the specific candidate data chunk and the specific target data chunk are identical.

Abstract: A system, method, and computer-readable medium for performing a product query operation, comprising: receiving user input from a user; identifying keywords contained within the user input; comparing keywords to vector representations of words and also to a document vector representation of product specifications in a backend product repository, each vector representation of a word being associated with a particular query type; identifying component details based upon the comparing; and, providing a list of products corresponding to the component details to the user in real time.

Abstract: Systems and methods for concept based searching or recommendation are disclosed. More particularly, embodiments of a concept based approach to the search and analysis of data, including the creation, update or use of concept networks in searching and analyzing data are disclosed, including embodiments of the usage of such concept networks in artificial intelligence systems that are capable of utilizing concepts expressed by users to return or evaluate associated destinations.

Abstract: The blockchain generation apparatus 1 includes: a parameter calculator 122 that identifies a parameter type to be used for linkage of the new block, based on block approval method data 114, and calculates a value for the identified parameter type based on transaction datasets which are related to an identifier of a generating party; a block generation condition checker 125 that determines whether the generating party is qualified to generate the new blockchain data, based on the value calculated by the parameter calculator 122; and a blockchain generator 126 that tries to generate the new blockchain by referring to the shared data when the block generation condition checker 125 determines that the generating party is qualified. An identifier of the blend pattern included in the block approval method data 114 specifies a combination of the plurality of parameter types that conflict with each other.

Abstract: A method, article of manufacture, and apparatus for providing a write leases in a distributed file system is discussed. A lease break is received for a file at a client from a metadata server (“MDS”), wherein the client has a write lease for the file. A write buffer is flushed on the client to an object store, wherein the write buffer comprises data objects comprising the file. A metadata request is transmitted from the client to the MDS in connection with flushing the write buffer. A lease extension is received for the write lease from the MDS.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to create a consumer within a converged system, defining the consumer within a hierarchy of consumers, where the consumer represents a function in an organization, setting a storage capacity attribute for the consumer, and conditionally defining a data volume for the consumer, based at least in part on the storage capacity attribute.

Abstract: Real-time synchronization of data between disparate cloud data sources; local database receives data from various sources then supplies data to various destinations. A steady state database synchronization software module monitors local database for changes to data, reconciles any local change with changes to the same data in remote database, forwards reconciled data to a destination database, and monitors messages announcing that data in remote database has changed. Finally, the failsafe database synchronization software module polls the remote database periodically for changes, compares changes made to remote data and local data, outstanding changes are applied to local and remote databases as determined.

Abstract: In one embodiment, a method for providing alternate keys in a keyed index includes creating a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record includes at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair, and creating one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record. The database adheres to virtual storage access method (VSAM) in some approaches. In other approaches, a number of alternate key records created is equal to a number of first sub keys in the first data record.

Abstract: Methods and systems for performing database transactions include executing a first transaction request in a preplay mode that locks the requested data with a prefetch-lock and reads one or more requested data items from storage into a main memory buffer; locking the requested data items with a read/write lock after said data items are read into the main memory buffer; and performing the requested transaction on the data items in the main memory buffer using a processor.

Abstract: Embodiments of the invention provide systems and methods for managing and processing large amounts of complex and high-velocity data by capturing and extracting high-value data from low value data using big data and related technologies. Illustrative database systems described herein may collect and process data while extracting or generating high-value data. The high-value data may be handled by databases providing functions such as multi-temporality, provenance, flashback, and registered queries. In some examples, computing models and system may be implemented to combine knowledge and process management aspects with the near real-time data processing frameworks in a data-driven situation aware computing system.

Abstract: A search engine system, including a slash-tag server. The server can be configured to receive a query including at least one key word from a user, generate an alternative search query, based on the at least one key word in the search query received from the user. The alternative search query may include at least one slashtag associated with the at least one key word for use in searching unaltered internet documents. Also, it may launch a search query using the alternative search query. Further, a web server could be configured to retrieve content from one or more nodes of at least one database cluster, based on the launched search query, generate a first search result, based on the alternative search query, and cause display of the first search result in a web browser.

Abstract: A method for allocating non-conflicting inode numbers between files generated at a first location and files generated at another location is provided. The method includes providing an inode number allocation rule table indicating availability for assignment a plurality of inode number allocation rules associated with the first location and the another location, generating a fileset at the first location by assigning an available inode number allocation rule to the fileset, registering, in the inode number allocation rule table, information associated with the fileset, and generating a file at the first location by determining the fileset within which to generate the file; and allocating an inode number for the file based on the available inode number allocation rule assigned to the fileset.

Abstract: A data processing method includes receiving a stream of digital data with a plurality of objects and, in response to receiving an object, tokenizing the object to create a tokenized object, and storing the tokenized object in a token database. The method further includes comparing the tokenized object to a plurality of other tokenized objects stored in the token database, computing a pattern associated with the tokenized object, storing the pattern in a pattern database, and managing a size of the pattern database by identifying, a subset of patterns that are eligible for deletion from the pattern database based on an age of each pattern, ranking each pattern of the subset based on a quality and a popularity metric, identifying, based on the ranking and from the subset, a second pattern and deleting the second pattern from the pattern database to produce an updated database.

Abstract: A computer system for sharing objects comprises multiple front-end nodes and a back-end node for providing a namespace shared by the front-end nodes. A first front-end node that is any one of the front-end nodes manages local-lock counts for each of objects managed by the first front-end node. The local-lock count is the number of locks taken by operations to the objects including the directory and sub-objects thereof. Every time receiving a request for processing a target object from a client, the front-end node requests the back-end node to lock a parent directory of the target object if the parent directory has not been locked by the back-end node. The front-end node sends a response of the received request to the client regardless of whether or not the parent directory has been unlocked by the back-end node. If the local-lock count of the parent directory is zero, the first front-end node requests the back-end node to unlock the parent directory.

Abstract: When a system configuration is deployed, the recipe used, the results of the deployment, and/or the results of any qualification tests performed may be anchored to a distributed ledger. Periodically, the system configuration may be audited by verifying the recipe against the anchored version. The results of such audits may also be anchored to the distributed ledger. Thus, what is anchored to the distributed ledger represents a cryptographically verifiable history of the configuration of the system. Consequently, the system configuration at any time can be proven by comparing historical configuration information maintained by the owner of the system to the distributed ledger.

Abstract: Systems and methods are provided for determining the usability of data from agricultural operations and displaying results. In some embodiments, data is first gathered during two agricultural operations, and bitmaps are rendered of the data gathered at the two agricultural operations. The usability of the bitmap values is determined and used to generate a display map screen where, at locations determined to have usable bitmap values, the first and second data are displayed in adjacent windows.

Abstract: A system and computer implemented method for estimating difficulty of a document includes retrieving a subject document from a storage, setting difficulty of each keyword included in the subject document to locality of the keyword in the subject document as an initial value, estimating, by a processor, difficulty of each subject document by a statistical processing of the difficulties of keywords included in the subject document, and updating the difficulty of each keyword based on the difficulty of each subject document depending on a significance value of the keyword in the subject document.

Abstract: A computer system may include a processor configured to search storage locations for candidate Application Programming Interface (API) files that are to be published on an Internet of Things (IoT) platform configured to interact with IoT devices for different device manufacturers. The processor may generate a list of candidate APIs based on searching the storage locations; generate a list of published platform APIs published on the IoT platform; compare the list of candidate APIs with the list of published platform APIs; generate an API create list based on the comparing; generate an API update list based on the comparing; create one or more candidate APIs from the generated API create list on a testing system; and update one or more candidate APIs from the generated API update list on the testing system.