Abstract: A mapping is constructed between a node of a cultural hierarchy and a node of an organizational hierarchy. The cultural hierarchy is a data structure representing an arrangement of characteristics of different social levels relative to one another in a culture. The organizational hierarchy is a data structure representing an arrangement of characteristics of different roles of people relative to one another in a group. A set of cultural attributes is constructed to represent a persona of a human user according to mapping. Using a cultural attribute, an adjustment rule is selected from a library. A machine output is modified according to the adjustment rule. The machine output is in response to a dialog between a data processing system and human user in a machine-human interaction. The adjusted output is transformed and presented as a response to the human user in the machine-human interaction.

Abstract: A system, computer-readable storage medium storing at least one program, and a computer-implemented method for re-ranking ranked search results is presented. Ranked search results satisfying a search query are obtained, where the ranked search results include a first search result corresponding to a first document associated with a first entity and a second search result corresponding to a second document associated with a second entity, and where the first search result is ranked higher than the second search result. The first document and the second document are determined to satisfy a similarity criterion. The second entity is determined to satisfy a predefined authorship differential with respect to the first entity. Responsive to determining that the second entity satisfies the predefined authorship differential with respect to the first entity, the second search result and the first search result in the ranked search results are swapped to produce re-ranked search results.

Abstract: A method for guided keyword-based exploration of data stored in a database includes providing, with a processing device, valid query templates for the data, wherein the provided valid query templates include static parts and dynamic parts; selecting those of the provided valid query templates that match a user-provided keyword; generating valid queries from the selected valid query templates using the data; and querying the data using a user-selected valid query selected from the generated valid queries.

Abstract: A system may read source data corresponding to a source variable and apply a transformation to the source variable to generate an output variable. The transformation may include logic, and the output variable may be configured for ingestion into a big data storage format. The system may record lineage data of the output variable that comprises the transformation and/or the source variable. The system may also receive a request to generate a requested output variable. The requested output variable may be generated from a second transformation that is the same as the first transformation. The system may thus match the first transformation to the second transformation using the lineage data. In response to matching the first transformation to the second transformation, the system may deny the request. The original output variable may be returned in response to the matching the first transformation to the second transformation.

Abstract: Storing an incoming data stream using successive files that are consecutively populated. The appropriate file to populate a given data stream portion into is determined by mapping the data stream offset to a file, and potentially also an address within that file. The successive files may be the same size, so that the file can be identified based on the data stream address (or offset) without the use of an index. Furthermore, the files may be easily named by having that size be some multiple of a binary power of bytes. That way, the files themselves can be automatically and named and identified by using the more significant bit or bits of the data stream offset to uniquely identify the file and establish ordering of the files. Replication may occur from a primary to a secondary store by transmitting the offset, and the actual data to be stored.

Abstract: An automated transformation system uses a tenant-aware interface module to transform one or more single-tenant systems to a multi-tenant SaaS System. The interface module gleans tenant IDs by querying a third party source (not the non-tenant-aware application), and uses those tenant IDs to translate non-tenant-aware data repository commands from known tenants into tenant-aware data repository commands. A specialized data collection module can then execute the tenant-aware data repository commands via a database connector.

Abstract: A system for hosting a website, including a mobile device having an operating system and a supervisory component installed thereon; a webserver application running on the mobile device under control of the supervisory component; a control panel application running on the mobile device, the control application configured to set parameters of the webserver application. The webserver application is in a sleep mode and wakes up in response to a command from the supervisory component. The webserver component generates a website using documents and files of other applications that are stored on the mobile device. The supervisory component wakes the webserver application in response to an HTTP request received from a network port when the mobile device is connected to a mobile network. The webserver application is given permission to access the documents and files of the other applications through the control panel.

Abstract: The present invention provides a hierarchical computing network with multiple tiers of computing nodes. Also disclosed is a method of organizing, ranking and grading a large number of computing nodes that are owned, maintained and used by a large number of different participants in geographically dispersed areas in an effort to provide computation, control, measurement and data services to a large number of users. One of the embodiments of the present disclosure provides a decentralized, distributed, cost-effective, environmental friendly, secure, reliable and scalable online file management system for a large amount of data from a large number of users and organizations.

Abstract: A method of searching an image file includes: utilizing a login module to log in a user account; utilizing an input module to store an image file at a predetermined location; utilizing an information capturing module to capture at least one image information of the image file stored at the predetermined location; utilizing an index building module to build at least one index tag corresponding to the image file according to the at least one image information captured by the information capturing module; utilizing a searching module to receive at least one searching condition so as to search the at least one index tag according to the at least one searching condition; and utilizing a display module to display a searching result corresponding to the image file when the at least one index tag matches with the at least one searching condition.

Abstract: Various embodiments of systems and methods for decentralized image management are described herein. The method includes generating, distributing, and retrieving images on peer-to-peer network. Request for generating an image is received. One or more components/layers of a to-be-generated image is identified. A layer is stored as a file. Files corresponding to the layers are packaged as an image file representing the image. The packaged image file and/or files of respective layers are distributed across the network, e.g., across a plurality of available nodes upon receiving a distribution command/request. When a request for retrieving the image is received, the nodes storing the one or more layers of the image are identified. The layers are retrieved from the identified one or more nodes. Using the retrieved one or more layers, the image is recreated/generated.

Abstract: An object-based data storage system includes a memory and a processor for executing machine executable instructions configured for implementing logical containers for data objects each having a global identifier. The containers are configured for storing metadata including a first parameterization value descriptive of a number of storage nodes and a second parameterization value descriptive of a classification of the data objects. The machine executable instructions are further configured for implementing a first object storage ring for addressing storage locations across the multiple storage nodes using a surjective function.

Abstract: A data protection method and associated apparatus are provided. The data protection method may include: running a data protection application on a host server system, the data protection application being configured to protect a data set stored in a tenant server system, wherein the host server system and the tenant server system are administered by different entities; receiving a plurality of versions of the data set from the tenant server system; and issuing at least one version request to get at least one specific version of the data set from the tenant server system, wherein the at least one specific version and the plurality of versions of the data set form a sequential version order of the data set.

Abstract: A data curation system that includes various methods to enable efficient reuse of human and machine effort. To reuse effort, various facilities are presented that model, save, and allow the querying of provenance and state information of a curation workflow and allow for incremental, stateful transitions of the data and the metadata.

Abstract: Systems, apparatuses, and methods for enabling a user to collect, assemble, manipulate, and utilize data corresponding to one or more specific markets about specialty properties, such as assisted living, long-term care facilities, and the like. Several factors will affect a specific market. Collecting this data and assigning relative values to the data leads to an ever-changing set of indices that is continuously updated through a machine-learning algorithm by which index data may be gleaned at any given moment in time for any specific region. These factors may exhibit variable importance across various regions and demographics. By identifying and determining the impact of these variable importance factors, future costs or future demand may be gleaned to allow a specialty property manager to more insightfully plan for acquisition and expansion based on gleaned statistics from actual data in the ebb and flow of specialty property use.

Abstract: A processor tracks a frequency of access requests of a first index corresponding to a first data page of a plurality of data pages stored in a database. The processor determines the first index corresponding to the first data page having a frequency of access requests that exceeds a configurable target, and the processor retains, with preference, the first data page that corresponds to the first index, within the cache memory.

Abstract: In one aspect, the present disclosure implements a method that determines whether a submitted image satisfies a geographic constraint which includes defining a rule that establishes a geographic restriction on the submitted image, accessing a geo-code associated with the submitted image, determining whether the geo-code indicates that the submitted image was taken at a location that violates the geographic restriction defined in the rule, and if a determination is made that the submitted image was taken at a location that violates the geographic restriction defined in the rule, eliminating the submitted image from being considered a valid entry in the contest.

Abstract: Example techniques of auditing an ERP system are described. In an example implementation, a method includes defining a set of criteria to monitor the ERP system, the set of criteria comprises an audit table within the application to provide parameters corresponding to multiple tables within the database of the ERP system, and receiving, application parameters generated by the application corresponding to a table from amongst the multiple tables. The application parameters are indicative of usage statistics of the table captured by the application. Thereafter, table parameters corresponding to the table are received. The table parameters are indicative of usage statistics of the table in the database. The method further includes comparing the application parameters and the table parameters to determine a mismatch and initiating a corrective action in response to the mismatch. The corrective action comprises retrieving data corresponding to the table parameters from a backup in the database.

Abstract: A distributed data management method performed by a distributed data management apparatus for holding a plurality of indexes which specify storage positions of data to be distributed in a network system, the method includes steps of: in a case where any one of the held indexes is deleted, adding an identifier of the deleted index to a first invalid list held by the distributed data management apparatus; and in a case where it is determined that an index requested from an information processing apparatus is not held, transmitting the first invalid list to the information processing apparatus.

Abstract: In accordance with embodiments of the present disclosure, each third party system of multiple third party systems can store files including datasets associated with one or more campaigns. A computing system can be in communication with the third party systems and including a first database and a second database. The computing system can be configured to receive the selection of the one or more third-party systems, store metadata associated with the at least one campaign in the first database, calculate at least one discrepant data value between the one or more third party systems, based on the datasets associated with the at least one campaign from each of the one or more third party systems.

Abstract: An in-memory database system stores the entirety of a database that is being operated on by a database system within main memory. The database includes a table that comprises a plurality of rows including a particular row. The database table comprises a first version of the particular row having a first valid time, and a second version having a second valid time. Index(es) are associated with the database table. Each index references the plurality of rows, including referencing the first and second versions of the particular row. A transaction acting on the first version of the particular row is executed. The first version of the particular row is visible to the transaction based on the first valid time and the second version of the particular row being not visible to the transaction based on the second valid time.

Abstract: Method, system, and programs for providing enhanced search term suggestions. A set of incomplete search terms indicating a sequence of search terms entered may be received. It may be detected that the sequence contains a descending phase followed by an ascending phase. In response to the detection, a pair of misinput term and corresponding corrected term may be identified in the set of incomplete search terms. A probability with respect to the misinput term is a misinput of the corresponding corrected term may be determined based on a historical context. Using such a probability, an incomplete search term containing the misinput term may be corrected. One or more proposed search terms may be determined based on the corrected incomplete search term for suggestion to the user.

Abstract: In some aspects, a method, computer program product, and system are provided for query optimization. In some implementations, there may be provided a method including detecting a select query as a candidate for optimization, the select query including an order by, an offset value, and a limit value; determining, in response to the detecting, a modified offset value as the difference between the offset value and a size of a smaller dataset; and performing the select query to form a result set, the select query executed based on at least the modified offset value. Related systems, methods, and articles of manufacture are also described.

Abstract: A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

Abstract: A system for cardinality estimation for database query planning is provided. In some implementations, the system performs operations comprising selecting a subset of data from a set of data on which a database query is to be executed, the set of data including a first quantity of tuples and the subset of data including a second quantity of tuples. The operations can further comprise determining, based on evaluating one or more predicates on the subset, a third quantity of tuples in the subset which satisfy the one or more predicates. The operations can further comprise determining, based on the first quantity, the second quantity, and the third quantity, a range within the subset that comprises estimated cardinalities of the one or more predicates within a predetermined error threshold range. Related systems, methods, and articles of manufacture are also described.

Abstract: A system for cardinality estimation for database query planning is provided. In some implementations, the system performs operations comprising determining, based on a first bounds and a second bounds for a combination of query predicates, whether a solution for the combination of the query predicates exists which includes both the first and second bounds. When the solution is determined to exist, the operations can further comprise determining at least one selectivity estimate for the combination of the query predicates. A query plan for execution of a database query comprising the query predicates can be generated based on the at least one selectivity estimate, and the database query can be executed through execution of the query plan. Related systems, methods, and articles of manufacture are also described.

Abstract: A system and method decouple a knowledge management system from the consumer of the system. The system and method receives assertions from the consumer and utilizes a librarian to dynamically map these onto the proper data management components, either a researcher, a consultant or a historian. The librarian may rely on an arbiter to ensure that the proper data is received and returned.

Abstract: Aspects relate to improving search results based on a search history. Searches performed by a user are monitored to collect search data. The search data is categorized according to search terms, search sites, and result satisfactions to form the search history. A search request that includes one or more search terms related to at least one of the search terms in the search history is received. The search request is modified to increase a predicted satisfaction level of the user with results of the received search request. The modifying is based on contents of the received search request and the search history. A search is performed based on the modified search request.

Abstract: A system and method for generating and executing rules in a virtual computing system includes creating, by a rules computing system of the virtual computing system, a rule based upon one or more search queries entered into a search interface of the virtual computing system. The system and method also include executing, by the rules computing system, the rule periodically for identifying violations of the rule, and issuing, by the rules computing system, an alert for the violations of the rule on the search interface.

Abstract: Managing a streaming environment of an operator graph by performing corrective actions based on a threshold of changes in state being reached. An operator graph includes states of information stored within a memory of a first processing element configured to process a set of tuples. The memory of the first processing element is monitored. A change in the information from a first state to a second state is identified, based on the monitoring. The change from the first state to the second state is recorded. A determination is made if the change from the first state to the second state has caused a threshold of changes between the states of the information to be reached. A corrective action is performed that modifies a configuration of the operator graph in response to the threshold of changes between the states of the information being reached.

Abstract: One embodiment provides a method, including: receiving a natural language query; selecting a disambiguation state model representing conversational dialogue history, wherein the disambiguation state model comprises a plurality of nodes representing an entity, and a plurality of edges representing a path between two of the plurality of nodes, each of the plurality of edges including an assigned weight; traversing, the disambiguation state model using the natural language query to select a path to one of the plurality of nodes and providing the user the entity associated with the one of the plurality of nodes and iteratively selecting paths and nodes based upon input received from the user until a final node of the disambiguation state model is reached; providing a response to the natural language query based upon the entity of the final node; and updating the disambiguation state model based upon the traversed paths and nodes.

Abstract: The present disclosure relates to processing support requests, or support queries, in a software application including automated and human interaction-based support systems. An example method generally includes receiving a support request from a client device. A query processor parses the support request to identify one or more characteristics of the support request and identifies a support system to process the support request based at least in part on the identified one or more characteristics of the support request. The query processor instantiates a support session with the identified support system to process the support request.

Abstract: A method and system for performing searching based on a top-to-bottom feature space analysis may be disclosed. Such a method may include training a mapping model, calculating a signature and centroid of a data block, and generating a list of search results corresponding to data blocks based on the similarity or distance of the centroids of each of said data blocks to the query vector. Data may be subject to data cleaning, which may include, for example, noise removal and transformation to a unifying format, in order to ensure that a centroid is accurately generated. Search results may be based on a predetermined topic or subtopic, or may be based on a keyword or similarity query from the user, as may be desired.

Abstract: Systems and methods for identifying a subject of an ambiguous name in a communication are disclosed. In embodiments, a computer-implemented method, includes: receiving historic communication data of a first person from a first remote computing device; receiving historic communication data of a second person from a second remote computing device; generating a knowledge database includes contact data for both the first person and the second person mapped to third party data, including informal and formal names of one or more third parties referenced in the historic communication data of the first person and the historic communication data of the second person; receiving a query regarding an ambiguous name referenced in a new communication between the first person and the second person; and determining a match between the ambiguous name and an informal name or a formal name in the knowledge database.

Abstract: A system and method for optimizing aggregation and analysis of data across multiple data sources of multiple enterprises is provided. Data extraction rules are generated by invoking an automatic rule generation rule. Automatic rule generation rule is invoked if a predefined set of rules is not applicable for extracting data. Further, data adaptation rules is generated if data extracted by applying data extraction rules and a predefined set of rules does not correspond to a predetermined output. The data adaptation rules is encapsulated in a feedback loop for transmitting to the data acquisition unit. Data optimization rules s generated based on data extraction rules and data adaptation rules. One or more metrics is generated based on data optimization rules. The metrics specify characteristics relevant to one or more enterprises.

Abstract: Methods, systems, and computer-readable storage media for providing a table in a database system, the table including a column having a column data type set to an abstract data type, receiving a first data record to be added to the table, the first data record including a first data value to be included in the column, determining a first data type corresponding to a data type of the first data value, changing the column data type from the abstract data type to the first data type, receiving a second data record to be added to the table, the second data record including a second data value to be including in the column, determining a second data type corresponding to the data type of the second data value, and selectively changing the column data type to the second data type.

Abstract: The store merge apparatus is provided with a processor and a storage storing a plurality of entries that include a plurality of blocks and entry merge state information that represents, for each group into which the plurality of entries are divided, the state of merge in the plurality of entries, the plurality of entries and the entry merge state information being stored in correlation with each other. The processor executes a merge process for storing data in an entry on the basis of a store command to a storage apparatus and updates the entry merge state information associated with a group that includes entries to be merged. The processor preferentially selects, on the basis of the entry merge state information, a group that includes a merge-completed entry in which the data is stored in all blocks, preferentially selects a merge-completed entry from the selected group.

Abstract: The present disclosure relates to a method in a distributed and non hierarchical node comprising a set of data items for determining a synchronization state between said node and one or more distributed and non hierarchical nodes communicatively coupled to form a cluster, wherein the set of data items are locally replicated at each node. The method comprises generating a snapshot comprising information relating to the set of data items at a snapshot time Ts, said information identifying changes to the data items where each change comprises a time stamp, where only changes to the data items with a time stamp<To, where Ts>To, are included in the snapshot, although changes to the data items up to the time Ts have been received and stored in the nodes, receiving corresponding generated snapshots from all other nodes in the cluster, and determining a synchronization state based on a comparison between the generated and received snapshots.

Abstract: Methods and systems for managing for migrating feedback data from one digital asset to another digital asset are disclosed. Typically, the one digital asset is available for distribution from a network-based media distribution system, but then subsequently is removed from distribution for any of a number of reasons. However, since the one digital asset has been in use at the network-based media distribution system, it has accumulated feedback data. Hence, if the another digital asset serves (e.g., due to equivalency) to replace the one digital asset, then the accumulated feedback data from the one digital asset can be transferred to the another digital asset. As a result, the another digital asset can benefit from the feedback data that was previously associated with the one digital assert.

Abstract: A determination is made, by a first device, that data in a first database is modified. The first database is associated with the first device. A notification is generated by the first device. The notification includes information associated with the data modification in the first database. The notification is transmitted by the first device to at least one second device. At least one second database is associated with the at least one second device.

Abstract: A method, system and computer-usable medium are disclosed for improved point-in-time copying of data within an asynchronous data mirroring environment comprising: receiving a request to initiate an asynchronous data mirroring operation associated with a first point-in-time copying process; processing a first set of establish data to generate a point-in-time establish reservation, the first set of establish data associated with the first point-in-time copying process establish; using the point-in-time establish reservation to generate a second set of establish data if the second point-in-time copying process can be performed; using the second set of establish data to initiate a second point-in-time copying process; and, tracking establish operations in progress between the first point-in-time copying process and the second point-in-time copying process.

Abstract: A method, computer system, and a computer program product for processing a set of data objects of one or more users stored in a computer system is provided. The present invention may include providing data object properties and user properties of the set of data objects. The present invention may include determining a combined property of the data object properties and user properties. The present invention may include determining time dependent properties and at least two metrics, wherein a first metric indicates the deletability of a cluster and a second metric indicates the quality of the cluster, and wherein the first metric is determined using time dependent properties of the cluster. The present invention may include inputting the set of combined properties to a clustering algorithm and using the clustering algorithm to cluster the data objects to identify a best deletable cluster to determine if a data object is deletable.

Abstract: The present disclosure discloses a method and system for detecting overlapping communities based on similarity between nodes in a social network. The method comprises steps of: receiving a social network to be detected; calculating a level of similarity between nodes in the social network to be detected; detecting overlapping communities in the social network based on the level of similarity between nodes; and, outputting a structure of the detected overlapping communities. In the method for detecting overlapping communities based on similarity between nodes in a social network of the present disclosure, a method for calculating similarity between network structure information and node attribute information is fused in the social network environment, and a method for discovering overlapping communities by fusing the similarity between nodes is proposed on this basis to obtain a high-quality community cohered in terms of both network structure and node preference.

Abstract: A computer-implemented method according to one embodiment includes identifying at a pre-allocation module a size of object data to be stored within a storage node, identifying at the pre-allocation module file system parameters associated with the storage node, calculating at the pre-allocation module pre-allocated details needed for storing the object data within the storage node, utilizing the size of the object data and the file system parameters associated with the storage node, and sending the object data and the pre-allocated details from the pre-allocation module to the storage node.

Abstract: The present disclosure provides a method and apparatus for parsing a query based on artificial intelligence, and a storage medium, wherein the method comprises: regarding any application domain, obtaining a knowledge library corresponding to the application domain; determining a training query serving as a training language material according to the knowledge library; obtaining a deep query parsing model by training according to the training language material; using the deep query parsing model to parse the user's query to obtain a parsing result. The solution of the present disclosure may be applied to improve the accuracy of the parsing result.

Abstract: A method, system or computer usable program product for utilizing a dialectical model for providing an answer to a user query including applying NLP to the query to generate a first set of NLP structures; generating a contrary set of NLP structures contrary to the user query; evaluating the first set of NLP structures to identify a first set of evidence; evaluating the contrary set of NLP structures to identify a second set of evidence; evaluating a first set of hypotheses from the first set of NLP structures and a contrary set of hypotheses from the contrary set of NLP structures to determine a set of answers to the user query; summarizing the set of answers including indicating derivation thereof; and providing the summarized set of answers to the user.

Abstract: The present disclosure discloses an artificial intelligence based method and apparatus for determining regional information. A specific embodiment of the method comprises: acquiring to-be-determined information, and extracting a keyword set of the to-be-determined information; inputting the keyword set of the to-be-determined information into a pre-trained topic classification model for classifying, to obtain a topic class of the to-be-determined information, wherein the topic classification model is used for representing a corresponding relation between the keyword set of the information and the topic class of the information; selecting, from a pre-stored place name set, a place name corresponding to the topic class of the to-be-determined information as a target place name set; matching, in the to-be-determined information, the target place name set; and determining, based on a matching result, whether the to-be-determined information belongs to the regional information.

Abstract: Data is received from a computing system describing particular content of a digital work. The data is processed to identify a particular concept represented in the particular content. A search of a corpus is initiated to identify a set of other digital works in the corpus including content related to the particular concept. Similarity scores are determined representing a degree of similarity between the particular content of the digital work and the respective content of each of the set of digital works related to the particular concept. A data provenance system determines that a particular one of the other digital works is a source of the particular content of the digital work based on the similarity scores. Result data is generated and sent to the computing system to indicate that the particular other digital work is a source of the particular concept.

Abstract: A sheet music search and discovery system is disclosed that uses specific mathematical rules to analyze and characterize sheet music and provides functionality for users to identify sheet music based on those characterizations. The system stores sheet music data and metadata characterizing each composition, provides a graphical user interface that provides functionality for users to search the sheet music data for compositions, and generates search results based at least in part on the metadata characterizing each composition. In one embodiment, metadata describing structured sheet music data is generated using a global vector space that includes semantic representations of elements extracted from a large corpus. In another embodiment, metadata describing unstructured sheet music data is generated using machine learning-based pattern recognition.

Abstract: Systems and methods are described herein for automatically changing the priority of a media asset using a continuous listening device. The system may receive an audio clip of a conversation a user, and then determine whether that conversation relates to any of the programs recorded or scheduled to be recorded on a storage device associated with the user. In response to determining that the media asset does relate to one of the programs recorded or scheduled to be recorded on the storage device, a user profile may be consulted to determine past instances of the user discussing the media asset, and, if a measure of the total number of instances the user discussed the media asset meets a threshold measure, the priority of the media asset may be updated.

Abstract: Aspects of the technology described herein use acoustic features of a music track to capture information for a recommendation system. The recommendation can work without analyzing label data (e.g., genre, artist) or usage data for a track. For each audio track, a descriptor is generated that can be used to compare the track to other tracks. The comparisons between track descriptors result in a similarity measure that can be used to make a recommendation. In this process, the audio descriptors are used directly to form a track-to-track similarity measure between tracks. By measuring the similarity between a track that a user is known to like and an unknown track, a decision can be made whether to recommend the unknown track to the user.