Abstract: User profiles of remote desktops are managed in a crash-consistent manner. When a user logs into a remote desktop, metadata of the user profile is loaded from persistent storage while registry settings and files of the user profile are loaded asynchronously with respect to the login. During the remote desktop session, snapshots of the remote desktop image in persistent storage are generated periodically, and a change log that indicates changes to the user profile is created therefrom. The user profile stored in persistent storage is updated lazily using the change log at opportunistic times after snapshot generation. When the user logs out of the remote desktop, the user profile stored in the persistent storage is updated with any additional changes to the user profile by extracting the changes from the copy-on-write cache associated with the most recent snapshot.

Abstract: The described technology is generally directed towards managing data retention policy for stream data stored in a streaming storage system. When a request to truncate a data stream from a certain position (e.g., from a request-specified stream cut) is received, an evaluation is made to determine whether the requested position is within a data retention period as specified by data retention policy. If any data prior to the stream cut position (corresponding to a stream cut time) is within the data retention period, the truncation request is blocked. Otherwise truncation from the stream cut point is allowed to proceed/is performed. Also described is handling automated (e.g., sized based) stream truncation requests with respect to data retention.

Abstract: A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating suggested search queries. One method includes receiving, during a search session, a request for a suggested search query; in response to receiving the request for the suggested search query, identifying an entity that is associated with an item of media content; generating a suggested search query based on the identified entity; and providing data that causes the generated suggested search query to be presented in a user interface.

Abstract: A method, computer system, and a computer program product for online posting annotation is provided. The present invention may include identifying a topic in an online posting. The present invention may include determining that a comment to the online posting relates to the online posting. The present invention may include adding at least one detail from the comment to the online posting. The present invention may include tagging the at least one added detail with at least one piece of metadata. The present invention may include validating a viewing access based on the at least one piece of metadata and displaying an amended online posting.

Abstract: A computer measures for each column in many rows, a respective frequency of statements that filter the column in a workload of database statements, a respective count of distinct values used for filtration on the column in each statement individually, a respective frequency of each of the counts of distinct values used for filtration on the column across all of the database statements, and a respective value range of the column for each of many storage zones. A respective efficiency is measured for each of many distinct interleaved sorts. Each interleaved sort uses a respective distinct subset of the columns. Each interleaved sort is based on portions of each of the values for each row in a sampled subset of rows in each column of the subset of the columns of the interleaved sort. Efficiency measurement is based on frequencies of statements, value ranges of columns for each storage zone, and frequencies of counts of distinct values.

Abstract: The disclosed systems and methods can comprise executing a modeling sequence comprising a first model and a second model, obtaining a first result from the first model being used as an input for the second model to obtain a second result, hashing data representative of a first configuration and a second configuration to create a first hash and a second hash, respectively, storing the first result in a first location and the second result in a second location, receiving one or more configuration changes to the second model thereby creating a third configuration associated with the second model, hashing data representative of the third configuration to create a third hash, receiving a request to rerun the modeling sequence, determining that the first configuration is associated with the first model, and providing the first result to the second model without rerunning the first model.

Abstract: The disclosed embodiments relate to a system/apparatus for reducing a data size of a database/data structure stored in a memory of a data transaction processing system, which stores a plurality of data records, each of the plurality of data records being characterized by a record data size and storing data indicative of a position (of one or more portfolios) in one or more financial instruments, such as interest rate swaps, futures contracts, etc. The system/apparatus may be referred to as an architecture which enables post-trade processing of portfolio/position databases/data structures, or subsets thereof, to reduce the data size thereof for storage, communication and/or processing and may further reduce other aspects or characteristics such as gross notional value, total risk, etc.

Abstract: A method and apparatus perform a first hash operation on a first key wherein the first hash operation is biased to map the first key and associated value to a set of frequently-accessed buckets in a hash table. An entry for the first key and associated value is stored in the set of frequently-accessed buckets. A second hash operation is performed on a second key wherein the second hash operation is biased to map the second key and associated value to a set of less frequently-accessed buckets in the hash table. An entry for the second key and associated value is stored in the set of less frequently-accessed buckets. The method and apparatus perform a hash table look up of the requested key in the set of frequently-accessed buckets, if the requested key is not found, then a hash table lookup is performed in the set of less frequently-accessed buckets.

Abstract: Techniques of reproduction of graph data during query time are disclosed herein. One example technique includes receiving, at a query processor, a query having a set of predicates to be evaluated on data in a graph. Upon receiving the query, the example technique includes evaluating the set of predicates based on data in the first or second partition of the graph and recording a sequence of query states of the first or second partition whose data is used to evaluate each of the set of predicates. Subsequently, the example technique includes constructing a set of snapshots of the data in the first or second partition based on the recorded query states and reevaluating the set of predicates on the constructed set of snapshots of the data in the first or second partition to troubleshoot the detected query error when the set of predicates were previously evaluated.

Abstract: The present disclosure involves systems, software, and computer implemented methods for creating an extension field across system tenants in a customer landscape. One example method includes receiving a request to add an extension field to an entity used in a customer landscape. Entity-using system tenants that use the entity are determined. Event-pairing information is provided to each entity-using system tenant to enable receiving of extension field events. Field attribute values for a set of field attributes for the extension field are received. A field creation event is generated that instructs a system tenant receiving the field creation event to create a local field that has a target state of the extension field in that system tenant. The field creation event is sent to each entity-using system tenant.

Abstract: A solution arranged to build or train a machine learning model (ML model) that can be uploaded to a server arranged to deploy the ML model to communicating devices. The ML model builder can build the ML model and a ML production pipeline. The ML production pipeline can train the ML model, convert the ML model to a web browser compatible format, and upload the converted ML model to the server. The ML model can receive as input a sequence of prior activities on one communicating device in the communicating devices, analyze the sequence of prior activities on the communicating device, predict a next activity on the communicating device based on the analysis of the sequence of prior activities, preemptively search a computer network based on the predicted next activity to find a computer asset, and preload the found computer asset to a storage in the communicating device.

Abstract: System and methods are provided for sharding at the content level and routing content requests. Each point of presence (PoP) can initially identify the PoP that should serve content by using hashing. A PoP can encode a domain name with the identified PoP in metadata and redirect the client computing device. A client computing device transmits a DNS query for the encoded domain name. A DNS server receives the encoded domain name and decrypts and decodes the domain name label. The DNS server uses the decrypted and decoded metadata to make a further routing decision. The DNS server sends, to the client computing device, a DNS reply with the Internet Protocol (IP) address of the selected PoP. The client computing device requests content from the PoP identified by the provided IP address.

Abstract: Provided are an electronic device and an operating method thereof. The electronic device includes a communicator, a display, and a processor configured to receive search result data based on a search keyword from a first server through the communicator, request, from a second server through the communicator, additional information indicating whether each web page included in the search result data is an advertising page, and control the display to display the search result data, based on the additional information corresponding to the each web page and received from the second server, wherein the additional information is generated by the second server by using a training model trained using an artificial intelligence (AI) algorithm, based on whether the web page includes an advertisement pattern. Also provided are an AI system using a machine learning algorithm such as deep learning and applications thereof.

Abstract: A quantum file management system is disclosed. A quantum file manager receives, from a requestor, a request to access a quantum file that comprises a plurality of qubits. The quantum file manager determines, for each respective qubit of the plurality of qubits, a qubit identifier of the respective qubit. The quantum file manager sends, to the requestor in response to the request, information that includes the qubit identifier for each respective qubit of the plurality of qubits.

Abstract: Systems, methods, and non-transitory computer readable media are provided for customizing pipelines for integrating data. A file to be ingested into a data analysis platform may be determined. The file type of the file may be detected. The file may be transformed based on the file type. The transformation may include applying a set of operations to the file. The set of operations may correspond to a pipeline of operations associated with the file type.

Abstract: Aspects of the present disclosure provide systems, methods, apparatus, and computer-readable storage media for extracting taxonomies based on hierarchical clustering on graphs related to a corpus of documents and using said taxonomies for classifying and labeling documents. The hierarchical clustering of graphs include the adaptive pruning of nodes at each hierarchy based on betweenness centrality of nodes to form clusters that have modularity score exceeding a minimum modularity threshold.

Abstract: A service monitoring system (SMS) transforms machine data from a monitored information technology (IT) environment into meaningful key performance indicators (KPIs) that each represents some measure of a service implemented by the environment on an ongoing basis. An overall health score for the service is determined from the KPIs and a prediction is made for a future health score. Data regarding a particular KPI and other KPIs is transformed to predicted future values for the particular KPI over a prediction window. Additionally, predicted future KPI scores may be used to determine a KPI impact score reflecting some measure of the degree to which the KPI, its related components, or processing related thereto, can influence the actual future health score. The KPI impact scores condition or direct the future operation of one or more SMS processes.

Abstract: Systems, computer-implemented methods, and non-transitory computer readable media are provided for sharing medical data. The disclosed systems may be configured to create a first workgroup having a first knowledgebase. This first knowledgebase may be federated with a common knowledgebase, and with a second knowledgebase of a second workgroup. At least one of the first knowledgebase, common knowledgebase, and second knowledgebase may be configured to store data items comprising associations, signs, and evidence. The signs may comprise measurements and contexts, and the associations may describe the relationships between the measurements and contexts. The evidence may support these associations. The disclosed systems may be configured to receive a request from a user in the first workgroup, retrieve matching data items, and optionally then output to the user at least some of the retrieved matching data items. The request may comprise at least one of a first association and a first measurement.

Abstract: A key-value storage device includes a non-volatile memory and a controller. The key-value storage device is configured to communicate with a host and includes a controller and a non-volatile memory. The controller is configured to receive, from the host, a first command including a key, a first chunk among multiple chunks included in a value corresponding to the key, and a first chunk index corresponding to the first chunk. The controller is configured to store mapping information of the first chunk in a mapping table based on the key and the first chunk index. The non-volatile memory is configured to store the key and the first chunk based on the mapping information.