Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing user management associated with blockchain-based services. One of the methods includes receiving: at a service platform, receiving a first request to authorize a first member to access information related to a first order; invoking a smart contract executing on a blockchain to request that the first member be added to a list of authorized members who are authorized to access the information related to the first order, in which the smart contract is configured to maintain a data structure that stores information about the authorized members; receiving a confirmation from the smart contract that the first member has been added to the list of authorized members; and sending a confirmation to the administrator that the first member has been added to the list of authorized members.

Abstract: Disclosed herein are system, method, and computer program product embodiments for displaying object pages containing data displayed in tables in a client application. The client application may provide a user experience framework via which an administrator may pre-configure the behavior of object pages that display data related to the application in table form. A table may be configured to display using lazy loading, tab navigation, or a preview version to list report based on the nature and expected size of the table. When preview version to list report is chosen, a preview version of a table may be provided to a user to allow the user to interact with the data without displaying the entirety of the dataset.

Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.

Abstract: An information processing apparatus includes a processor. The processor is configured to display an area in association with a setting of a print attribute. The processor is configured to display each page in the area for the print attribute which is set for the page. The pages form a document that is to be printed.

Abstract: A system for updating a target schema of a graph model and methods for making and using same. A schema change job can be run to update the target schema. Loaded source data in the graph model can be updated based on the updated target schema. The schema can be changed at vertex type level, edge type level and attribute level for a pre-defined target schema after source data has been loaded. The loaded source data can be updated to be consistent with the updated target schema without a need of being reloaded. The schema change job can be defined declaratively. The target schema can be versioned and stored to maintain a history of target schema update. Advantageously, schema update can be easy to implement. The time-consuming and expensive reloading process can be avoided. Target schema updating can have high flexibility and high performance.

Abstract: A method can include obtaining user interaction data by monitoring a set of user interactions between a user and one or more data elements of a data table. The method can further include determining a set of data element scores based, at least in part, on the user interaction data. The method can further include generating a customized data visualization based, at least in part, on the set of data element scores and the data elements of the data table.

Abstract: A method includes acquiring position information of a user. The method further includes receiving an input operation designating a position range that enables configuring a game parameter in map data usable in a game. The method further includes advancing a game such that, when the acquired position information is in the position range based on the game parameter.

Abstract: A Multi-Threaded Indexed (“MTI”) file system may use a first set of threads, processes, or executable instances to index desired file attributes in a database while simultaneously but independently executing file operations with a second set of threads, processes, or executable instances. In response to receiving a file operation, the second set of threads, processes, or executable instance may query the database to directly identify files that are indirectly implicated by the file operation with a wildcard, regular expression, and/or other expression that indirectly identifies the files based on different file attributes, paths, name expressions, or combinations thereof. The second set of threads, processes, or executable instances are therefore able to identify the files implicated by the file operation based solely on the indexed file attributes already entered in the database without the need to load and scan the metadata of files in directories targeted by the file operation.

Abstract: Methodology to reduce the running time of any string sorting algorithm is described. In one methodology, a prefix of each string from the input unsorted string array is converted to an integer and placed in an array. The array of integers is sorted using the given sorting algorithm. In subsequent methodology, the characters of the string prefix are placed in a record structure and stored in an array of character records. The array of character records is sorted using the given sorting algorithm. The input unsorted array of strings is then sorted using either the sorted array of integers or character records as a reference. Both methodologies showed performance improvements when running in sequential mode only. Therefore, parallel data sort methodology (PDS) was introduced allowing sorting algorithms to sort data in parallel, and its implementation made the two methodologies execute much faster in parallel mode.

Abstract: Systems and methods for smart dialogue communication are provided. A method may include receiving, from a responder terminal device, a dialogue request configured to request a smart dialogue communication, wherein the dialogue request is associated with an incoming call request that is initiated by a requester via a requester terminal device and satisfies a smart dialogue condition determined by the responder terminal device; performing the smart dialogue communication with the requester terminal device associated with the requester; recording voice information associated with the smart dialogue communication; converting the voice information into the text information; and transmitting the text information to the responder terminal device.

Abstract: Storing data volumes in virtual and physical address spaces such that the data units are contiguous in virtual address space but fragmented in physical address space. The mapping between virtual and physical address space is managed by a storage controller that is configured to implement deletes reversibly with a so-called soft delete, the soft delete being reversible up to a later permanent or hard delete. A soft delete triggers a compaction in which the data units of the to-be-deleted volume are gathered together in physical address space. During the time between compaction and hard delete (or restore), the soft deleted volume is thus stored in a space efficient manner. Moreover, the subsequent hard delete can be performed more quickly than if the soft deleted volume were still fragmented across physical address space freeing up space quicker.

Abstract: A system and method for multimedia contact center interactions via an audiovisual asynchronous messaging channel is provided. In an embodiment, an organization might operate a website comprising information and for providing an entry point of communication with a contact center. A communications channel may be integrated directly with the organization's website, which includes an editable audiovisual interface. A user may interact with the editable interface through a variety of means, including sketching on a webpage and recording to create a video form of audiovisual asynchronous query over the web page. The interaction is analyzed and routed to an agent for handling. The agent may then be connected to the user through the asynchronous channel.

Abstract: A per user system include for a virtual desktop includes a server connected to multiple users, wherein each server hosts multiple application sessions accessible by the users. An indexer hosted on the server can be configured to analyze a file on the server to identify a user that owns the file without input from the application sessions and to save the file to a virtual hard disk (VHD) of the identified user. The VHD can be temporarily saved on the server. A communications device can be connected to the indexer, where the communication device can send the VHD of the identified user from the server to a storage device. A processor can be on a second server, where the processor can retrieve the VHD of the identified user from the storage device and temporarily save the VHD of the identified user on the second server.

Abstract: A system for clustering data comprises a database for storing a plurality of data items, a clustering unit comprising components operable to receive and cluster the plurality of data items, and output clustered data items. A method of clustering data comprises receiving a plurality of data items from a database; computing distances between each pair of data items in the plurality of data items; until a stopping criterion is reached, identifying key elements, merging data items not identified as key elements with the nearest key elements, updating the computed distances; once the stopping criterion is reached, outputting cluster identities of the plurality of data items.

Abstract: There has been desired a technique for creating a table on a database without formulating an SQL statement. A control system includes a development support device and a controller. The development support device includes a development tool configured to accept, as setting information, a setting that designates collection target variables from among variables included in a control program, and a setting that designates an identification name, on a database, of each collection target variable. The controller includes a generation module-configured to output an SQL statement for creating a table on the database, based on a data type and an identification name on the database, the identification name being specified in the setting information.

Abstract: Mechanisms are provided for performing a data replication operation to replicate data from a first data processing system to a second data processing system. The mechanisms store a compression ratio history in association with data to be replicated. The compression ratio history stores one or more compression ratios for one or more previously executed data replication operations. The mechanisms determine whether a data compression operation should be applied to the data for a current data replication operation based on the compression ratio(s) in the compression ratio history. In response to determining that data compression should be applied to the data, the data compression operation is performed and the compressed data is replicated to the second data processing system. In response to determining that data compression should not be applied, the data is replicated without compression.

Abstract: Systems, methods, and computer-readable media are disclosed herein that generate a ternary tree data structure that includes multiple categories (e.g., terminologies) using dynamic array modifications that facilitate sharing of one or more nodes across categories. A plurality of different categories may be added and stored within a single ternary tree data structure such that each categories may be separately queried using the single ternary data structure.

Abstract: A correlation display system, correlation display method, and correlation display program capable of outputting the relationship between a plurality of persons in a manner visibly recognizable by a user are provided. A correlation display system 1 includes: a communication data acquisition unit 10 that acquires communication data transmitted and received between a plurality of terminals and thereby associated with each of a plurality of persons; an analysis unit 12 that analyzes content of the communication data acquired by the communication data acquisition unit 10; an evaluation unit 16 that evaluates the relationship between the content of the communication data and a predetermined event by using an analysis result of the analysis unit 12; and a display unit 18 that displays the relationship between a plurality of persons related to the event on the basis of an evaluation result of the evaluation unit 16.

Abstract: The technology described herein is generally directed towards relating inconsistent identifiers of the same entertainment data entity (such as a movie) to one another. A global identification service, given an entertainment data entity identifier, returns identifier information and related data according to other naming conventions. Canonicalization rules and standards provide a consistent identifier for variously named/identified entertainment entities. A canonicalized identifier (or another identifier) may be part of a URN-based naming convention that identifies the entertainment data entity, as well as the organization that owns the entity and an authority within the organization that is responsible for that entertainment data entity.

Abstract: A system and method include storing a table of time series data in a database of a data platform, the table of time series data representing a set of time series blocks. Each time series block of the set of time series blocks has a time series of equally-incremented time intervals and a run length. Each time interval of the time series is associated with one or more values. The run length has a starting position with at least one starting value and an ending position with at least one ending value. The starting position and the at least one starting value is stored for each time series block in a column store of the database. Then, a compressed index is generated in the column store of the database for each time series block, the compressed index comprising the starting position and the at least one starting value.

Abstract: Techniques for processing data include: receiving a hierarchical structure of metadata (MD) pages for a logical device; and performing processing to copy data of the logical device from a source system to a target system. The first processing includes: determining a sequence of the MD pages in accordance with a depth first traversal of the hierarchical structure; defining a cache management policy in accordance with the sequence that indicates when to load the MD pages into a cache and when to remove the MD pages from the cache; loading MD pages into, and removing MD pages from, the cache in accordance with the cache management policy; and copying data pages stored at logical addresses of the logical device in an order in which the logical addresses are accessed using MD pages stored in the cache at various points in time in accordance with the cache management policy.

Abstract: A data table partitioning management method and apparatus are disclosed. The method includes: determining a type and a join key of each data table in a table group, where the type of the data table includes a one-dimensional table, a multidimensional table, or a fact table; and performing one-dimensional partitioning on row replica space of each data table in the table group, and performing one-dimensional or multidimensional partitioning on column replica space of the data table according to the type of the data table and based on the join key of the data table. Different partitioning management methods are applied to data tables of different types and different dimensions, so that data processing mechanisms of OLTP and OLAP are efficiently implemented in a system, and resource consumption is reduced.

Abstract: Systems, methods, and non-transitory computer readable media are provided for managing pipelines of operations on data. A system may access data and provide a set of functions for the data. The system may receive a user's selection of one or more functions from the set of functions. The system may generate a pipeline of operations for the data based on the user's selection. The pipeline of operations may include the function(s) selected by the user.

Abstract: A data manager may include a data opaque interface configured to provide, to an arbitrarily selected page-oriented access method, interface access to page data storage that includes latch-free access to the page data storage. In another aspect, a swap operation may be initiated, of a portion of a first page in cache layer storage to a location in secondary storage, based on initiating a prepending of a partial swap delta record to a page state associated with the first page, the partial swap delta record including a main memory address indicating a storage location of a flush delta record that indicates a location in secondary storage of a missing part of the first page. In another aspect, a page manager may initiate a flush operation of a first page in cache layer storage to a location in secondary storage, based on atomic operations with flush delta records.

Abstract: Disclosed herein are systems and methods for generating tokens using SMPC compute engines. In one aspect, a method may hash, by a node, a data input with a salt value. The method may split, by the node, the hashed data input into a plurality of secret shares, wherein each respective secret share of the plurality of secret shares is assigned to a respective SMPC compute engine of a plurality of SMPC compute engines. The respective SMPC compute engines may be configured to collectively hash the respective secret share with a secret salt value, unknown to the plurality of SMPC compute engines. The respective SMPC compute engine may further receive a plurality of hashed secret shares from remaining SMPC compute engines of the plurality of SMPC compute engines, and generate a token, wherein the token is a combination of the hashed respective secret share and the plurality of hashed secret shares.

Abstract: This disclosure describes documenting modifications to configuration file that can affect (e.g., change) behavior of a component of a service provided by a database management system. The service can collect metadata associated with a request to modify a configuration file affecting the behavior of the component of the service. The service can modify the configuration file in response to the request. The modification can change the behavior of the component of the service. The service can generate data representing documentation of the modification to the configuration file and the metadata. The data can represent the documentation being configured for storage by the database management system. Related apparatuses, systems, methods, techniques and articles are also described.

Abstract: A database protection system (DPS) is augmented to enable efficient handling of security-violating database client connections. To this end, when the DPS determines to suspend a suspect database client connection several actions are taken. The DPS drops the request and sends a database protocol-specific message to the database server; upon receiving an acknowledgment, the DPS closes the associated transport layer connection mechanism The DPS then initiates an interaction with the client, preferably an exchange of periodic messages (e.g., keep-alive messages) configured to maintain the client in a suspended state. While in this state, the client does not detect any problem with the application or the connection and thus does not try to reconnect to the database server. The DPS then performs an additional assessment/investigation of the violation even as the connection remains open, but suspended. Further action is then taken depending on the results of this evaluation.

Abstract: A system includes reception of a query input by a user into a user interface, determination, in response to reception of the query, of a plurality of query results, each of the query results associated with a respective object instance of one of a plurality of object types, where the plurality of object types comprise a master data object type and a report object type, and presentation of the plurality of query results to the user, the plurality of query results comprising a first indicator of a first query result associated with an instance of the report object type and a second indicator a second query result associated with an instance of the master data object type, where the first indicator is selectable by the user to cause execution of the instance of the report object type to create a report and presentation of the report to the user, and where the second indicator is selectable by the user to cause retrieval and presentation of the instance of the master data object type to the user.

Abstract: Data processing systems and methods, according to various embodiments, are adapted for mapping various questions regarding a data breach from a master questionnaire to a plurality of territory-specific data breach disclosure questionnaires. The answers to the questions in the master questionnaire are used to populate the territory-specific data breach disclosure questionnaires and determine whether disclosure is required in territory. The system can automatically notify the appropriate regulatory bodies for each territory where it is determined that data breach disclosure is required.

Abstract: A global and local row count limit associated with a limit query are received by a stop operator of a first execution node among a set of execution nodes that are assigned to process the limit query. Local distributed row count data is generated based on a local row count corresponding to a number of rows output by the first execution node in processing the query. Based on determining the local row count satisfies the local limit, the first execution node buffers rows produced in processing the query. The local distributed row count data is updated based on remote distributed row count data received from a second execution node. A stopping condition is detected based on determining the global limit is satisfied based on updated local distributed row count data and query processing by the first execution node based on detecting the stopping condition.

Abstract: This disclosure provides devices and methods for estimating blood pressure using intelligent oscillometric blood pressure measurement techniques, where some implementations of the devices include multiple biometric sensors and/or can obtain sensor data from a connected device. In some implementations, the devices automatically determine an identity of a user. In some implementations, the devices automatically provide instructions to users to take blood pressure measurements. In some implementations, the devices applied intelligent inflation techniques to improve user comfort and speed up measurements.

Abstract: A method and apparatus for updating group member data are provided. The method includes: sending a group member data update request carrying a terminal timestamp to a server; receiving group member data change information issued by the server, wherein the group member data change information includes group member change data between the current timestamp and the terminal timestamp, and the current timestamp is greater than the terminal timestamp; and updating group member data of the terminal based on the group member data change information.

Abstract: Techniques and solutions are described for performing analytics on, or generating displays based on, data retrieved from a plurality of data sources, where the data sources can use one or both of different execution formats or different data schemas. For selected data, one or more analytic queries are generated. Analytic query results are provided in a standardized schema. A blend query is executed against data from the plurality of data sources, including the analytic query results in the standardized schema. Disclosed technologies can facilitate the use of data maintained in different formats or maintained in data sources that have different execution formats or protocols without requiring data replication among the data sources. The disclosed technologies can also provide a platform to which new data sources can easily be added, and can facilitate the use of multiple data sources by non-technical users.

Abstract: Embodiments of the present invention are directed to a computer-implemented method for generating a configurable conversational agent. A non-limiting example of the computer-implemented method includes providing available conversational agents to a user's computing device. The user uses a graphical user interface to choose desired characteristics of a conversational agent. The conversational agent generating service receives the chosen characteristics to generate a customized conversational agent and integrate the conversational agent into the user's system.

Abstract: Methods, systems, and devices are provided for detecting spam filtering. According to one aspect, the system can inject, by a server, into a client email campaign a plurality of emails for transmission to a plurality of seed email addresses separate from a plurality of non-injected emails of the client email campaign for transmission to a plurality of target email addresses. The system can detect whether the one or more injected emails were categorized as spam or not spam by each of the plurality of seed email addresses and generate a first input to an analysis module. The system can monitor a plurality of sensing signals from the non-injected emails and generate a second input to the analysis module. The analysis module can predict based on the first input and second input whether the non-injected emails are categorized as spam by the target email addresses.

Abstract: Systems and methods for natural language question answering are described. For example, methods may include determining a set of candidate database queries, including respective sequences of tokens of a database syntax, based on a string; determining a first score for a first candidate database query from the set of candidate database queries, wherein the first score is based on a match between one or more words of the string and a token of the respective sequence of tokens of the first candidate database query; determining a second score for the first candidate database query, wherein the second score is based on natural language syntax data determined for words of the string; selecting, based on the first score and the second score, the first candidate database query from the set of candidate database queries; and invoking a search of the database using the first candidate database query to obtain search results.

Abstract: Systems, computer program products, and methods are described herein for multi-release and parallel development of a database. The present invention is configured to determine a first version of a database release, wherein the first version is based on a first script; receive an incremental script associated with the first version of the database release; implement a database modeling tool to generate a second script, thereby creating a second version of the database release based on at least the first script and the incremental script; automatically generate an incremental database package based on at least the second version of the database release; and deploy the incremental database package, wherein deploying further comprises creating a second version of the database release based on the second script, wherein the second script is a baseline script for the second version of the database release.

Abstract: A method is provided for a file-based filesystem. The method includes mounting storage devices, periodically ranking the mounted storage devices, exporting a directory in a native filesystem as a share, receiving a first request to make a directory in the share, and, in response to the first request, making the directory in the store by storing information about the directory in a database without making the directory in the native filesystem. The method includes receiving a second request to write a file in the share and, in response to the second request, writing the file in the share by selecting a highest-ranking mounted storage device, storing information about the file in the database, and writing the file with a unique identifier as its file name in a root directory of the selected storage.

Abstract: A cognitive system improves the accuracy of a natural language statement by analyzing relationships between entities in a knowledge graph for the statement. A natural language processing engine extracts entities and relationships in the statement, and a yes/no pipeline gauges the accuracy of the statement. If a statement is deemed inaccurate, the knowledge graph is used to identify a predominant relationship between certain entities, and a candidate phrase representing the predominant relationship is generated and presented to the user as a suggested replacement for a target phrase in the statement representing the relationship. The yes/no pipeline computes an accuracy score for the statement, and the statement is deemed inaccurate when the score is below a programmable threshold. The assertiveness of the system can be tuned by requiring the accuracy score of a proposed modified statement to be greater than the score of the original statement plus some tuning factor.

Abstract: An example method involves receiving a playlist defining a sequence of media content items including first and second content items; retrieving first data representing the content items, and using the retrieved first data to play out the content items in accordance with the sequence; making a first determination of whether the playlist defines a placeholder between the first and second content items; responsive to the first determination being that the playlist defines a placeholder, making a second determination of whether a condition has been satisfied, wherein the condition corresponds to a content category type; and responsive to the second determination being that the condition has been satisfied, (i) retrieving second data representing a media content item of the content category type, and (ii) using the retrieved second data to play out the content item in between playing out the first and second content items.

Abstract: Techniques related to code dictionary generation based on non-blocking operations are disclosed. In some embodiments, a column of tokens includes a first token and a second token that are stored in separate rows. The column of tokens is correlated with a set of row identifiers including a first row identifier and a second row identifier that is different from the first row identifier. Correlating the column of tokens with the set of row identifiers involves: storing a correlation between the first token and the first row identifier, storing a correlation between the second token and the second row identifier if the first token and the second token have different values, and storing a correlation between the second token and the first row identifier if the first token and the second token have identical values. After correlating the column of tokens with the set of row identifiers, duplicate correlations are removed.

Abstract: Data stored on a data asset may be migrated to another data asset while maintaining compliance to applicable regulations. A data asset may experience a failure. Based on the type of data stored by that data asset and the applicable regulations, requirements, and/or restrictions that relate to a transfer of that type data from that data asset, a target data asset may be determined. The data stored on the data asset may then be transferred to the target data asset. The disclosed systems may use data models and/or data maps in determining the requirements for a data transfer and selecting target data assets.

Abstract: The disclosed technology relates to a system configured to receive, from a content management system, an initial portion of a log of operations for a target namespace, build a subtree for the target namespace based on the initial portion of the log of operations, and mount the subtree for the target namespace at a mount location of a remote tree representing a server state for content items stored on the content management system.

Abstract: Presenting a marking element in a social networking interaction where the marking element includes a question specifier and an answer specifier, creating a knowledge element in response to a user activating the marking element on the social networking interaction or a portion thereof, and presenting a knowledge element indicator in the social networking interaction.

Abstract: A computer-implemented method for network management is disclosed and includes broadcasting, from a first sensored wireless transceiver, an availability to accept data from other sensored wireless transceivers; receiving, from one or more other sensored wireless transceivers, requests to subscribe to provide sensor data to the first sensored wireless transceiver; subsequently receiving data that indicates sensor values from the one of more other sensored wireless transceivers; aggregating the data that indicates sensor values; and transmitting the aggregated data to a central service through the Internet.

Abstract: An apparatus and techniques for constructing and utilizing a “dynamic dictionary” that is not a compiled dictionary, and therefore does not need to be recompiled in order to be updated. The dynamic dictionary includes respective data structures that represent (i) a management automaton that includes a plurality of management nodes, and (ii) a runtime automaton that is derived from the management automaton and includes a plurality of runtime nodes. The runtime automaton may be used to search input data, such as communication traffic over a network, for keywords of interest, while the management automaton manages the addition of keywords to the dynamic dictionary. Typically, at least two (e.g., exactly two) such dynamic dictionaries are used in combination with a static dictionary.

Abstract: Evidence-based computer knowledge acquisition, expression verification, and problem solving methods and systems are disclosed. Embodiments are described that include methods for automatically evaluating natural language expressions by processing an argument of an analysis of a natural language expression. Also included is the processing of one or more items of evidence associated with the argument, and determining a quality score for the argument and the one or more items of evidence. The arguments may be based on one or more criterion associated with the natural language expression.

Abstract: Systems for restarting a virtual machine in a disaster recovery scenario where a network configuration differs between the failed system and the recovery system. A method commences upon identifying a disaster recovery plan for restarting a virtual machine from a first system on a second system (e.g., a recovery system). A configuration for providing network access at the second system through an adapter present in the second system is stored at a location accessible to the second system. Restarting the virtual machine at the second system upon detection of a failure event at the first system.

Abstract: A system is provided for enabling in-application support for topological changes to local files during remote synchronization. The techniques disclosed herein solve the problems of existing systems by mitigating conflict states and loss of edits being made to a file during synchronization. In addition, the techniques disclosed herein enable a user to interact directly with a productivity application to rename and/or move a file. The techniques disclosed herein provide an improved user experience and more efficient methods for interacting with files in that a user does not have to exit a productivity application and interact with an operating system interface to rename and/or move a file. A productivity application can operate in a server mode or a client mode depending on a validity of a requested destination location for a file.

Abstract: The invention relates to database abstraction and data linkage. According to an embodiment of the present invention, the invention takes a variety of attributes (e.g., names, IP address, device identifiers, addresses, phone numbers, account numbers, etc.) and returns the online activity, demographic data, account data and/or other activity, events and data associated with that attribute. The tool may then iterate over each attribute and return a network of connections having multiple degrees of association. The innovative tool may be linked to known bad actor data, and perform automated searches on this data to proactively alert potentially fraudulent activity. The tool may also be developed to add attributes and apply machine learning to the associations to more intelligently describe the returned network. Further, the tool may be developed to describe larger networks having multiple degrees of connections.