Abstract: A method for operating a replication control module is provided. The method comprises determining that a handover takes place by which a data session exchanged via a cellular network between a serving application instance and a user equipment is transferred from the serving application instance to a target application instance selected from a plurality of application instances located in a cloud environment. The method further includes determining a location of the target application instance in the cloud environment; determining target replica locations of replica of a session state data individually on a per session basis for said data session taking into account the location of the target application instance; and transmitting location information to a data handling module allowing the data handling module to distribute the replica to the determined locations of the target replica locations.

Abstract: Embodiments of the present systems and methods may provide a data access approval process that supports complex and fine-grained policies and can be applied to different data items at scale, which provides improvement over current technologies. For example, in an embodiment, a computer-implemented method for controlling access to data by computer systems may comprise generating an intermediate representation by integrating a combination of data access policies, data attributes including attributes per data subject, and the data itself to form the intermediate representation, receiving a request for access to the data, rewriting the request for access to the data to incorporate the intermediate representation so as to provide access only to data allowed by the policies integrated into the intermediate representation, and executing the rewritten request and providing only data allowed by the policies integrated into the intermediate representation.

Abstract: An information processing device is configured to store pieces of identification information for identifying a same object, in a case where devices in which the object is to be stored is specified from among information processing devices including the information processing device by calculation using each of the pieces of identification information. The pieces of identification information satisfy that combinations of the devices are the same, the information processing device is included as one of the devices, and primary devices serving as read sources of the object among the devices are different from one another. When one piece of identification information is specified to use the information processing device as the primary device from among the pieces of identification information, and a task arranged by control of a management device is executed to read the object, the primary device is specified based on the one piece of identification information.

Abstract: A system for creating a sync group in a distributed system may include an offline electronic device having a short range communication transmitter and a storage service, and a computer-readable storage medium comprising one or more programming instructions. The system may receive a request from an application to create a sync group, and verify that the application has read access to the storage service. In response to verifying that the application has read access to the storage service, the system may create the sync group by receiving an indication of one or more objects stored in the storage service that are to be shared, identifying one or more members of the sync group, and assigning one or more permissions to the one or more members that are identified. The system may synchronize access to the objects among the electronic device and one or more member electronic devices.

Abstract: A deep sequence model with prototypes may be steered. A prototype overview is displayed, the prototype overview including a plurality of prototype sequences learned by a model through backpropagation, each of the prototype sequences including a series of events, where for each of the prototype sequences, statistical information is presented with respect to use of the prototype sequence by the model. Input is received adjusting one or more of the prototype sequences to fine-tune the model. The model is updated using the plurality of prototype sequences, as adjusted, to create an updated model. The model, as updated, is displayed in the prototype overview.

Abstract: Snapshots of a first logical storage unit (LSU) (R1) on a first storage system (A1) may be taken while replication is inactive between A1 and a second storage system (A2), such that these outstanding snapshots are not replicated to a second replica LSU (R2) on A2. Upon replication becoming active, the outstanding snapshots may be replicated to R2 without disrupting or impairing the remote replication of write operations between R1 and R2 as part of standard remote replication. A process on A1 executing the replication of the outstanding snapshots from R1 to R2 may be a separate process than one or more processes on A1 executing standard remote replication including the replication of write operations from R1 to R2. The process may be given low priority on A1 so as to not impair performance of other operations, including standard remote replication and replicating outstanding write operations on A1.

Abstract: An information processing apparatus includes a conversation presentation unit that present conversation contents in a conversation, which is performed by plural persons, in time series, a reception unit that receives a request, an urging presentation unit that presents urging of a response to the request, and a shifting unit that shifts a screen so as to be capable of presenting a conversation content before or after the request is made, in a case where the response is made.

Abstract: A system and method for supporting tuple record interlinking in one or more tuple space/coordinated namespace (CNS) extended memory storage systems. A system-wide CNS provides for efficient storing and communicating of data generated by local processes running at the nodes, and coordinated to generate a union/intersection of multiple CNS where tuple records are interlinked in multiple CNS hashtables, and/or share tuple data between two sets of processes that are part of different CNSs. Local node processes further generate multi-key tuples where two or more tuple records are interlinked within the same CNS hash table, thereby permitting a look up of the tuple data by either tuple name/keys. A CNS controller further provides a tuple iterator for a key-value storage in a CNS system that adds more links between tuples enables creation of iterator structures such as linked list or trees etc. of “different” tuples in a tuple database.

Abstract: An Indoor location mapping and wayfinding system for mapping waypoints on an interactive mapping system that can function both indoors and outdoors based on user selections and location. It can include a shopping system that allows users to pre-select items for purchase, maps the items on an indoor map of the store, and provides a route to the user for the collection of the selected items.

Abstract: The disclosed technology relates to a system configured to receive operations data from a content management system, wherein the operations data comprises a log of operations, execute the log of operations, and update, based on execution of the log of operations, a remote tree representing a server state for content items stored on the content management system.

Abstract: A data migration method and system is provided. The system includes a central control node, a first shard storage space associated with a first agent node, a second shard storage space associated with a second agent node, and a data backup subsystem. The data backup subsystem stores chunks of the first shard storage space and chunks of the second shard storage space. The central control node sends a data migration command to the first agent node. The first agent node obtains a to-be-migrated first chunk by using the data backup subsystem. The first agent node sends the to-be-migrated first chunk to the second agent node. The second agent node imports the to-be-migrated first chunk into the second shard storage space.

Abstract: Synchronous content sharing of media assets via an object data model propagated through a star network or a mesh network. Each user device updates a local object data model including information on the status of the media asset delivery, to achieve synchronization with the source data. Updates to the local object data model may be the result of direct connection between a user device and an application server via a network, or the result of indirect connections through peers in mesh networks, where the local object data model is shared through hops between peers in the mesh network if the direct connection is unavailable.

Abstract: Techniques for making preliminary authorization determinations based on partial contextual information are disclosed. In one or more embodiments, an API receives an authorization request and partial contextual information associated with the authorization request. The API submits the partial contextual information to an authorization service, without submitting complete contextual information associated with the authorization request. The API receives, from the authorization service, a preliminary authorization response based on the partial contextual information. The preliminary authorization includes one of (a) denial of the authorization request and (b) non-denial of the authorization request.

Abstract: Techniques for dynamically extracting electronic health records are described. Some embodiments provide an Operational Intelligence Platform (“OIP”) that is configured to dynamically extract electronic health record data from a source customer database that represents health records in a hierarchical format, and store the extracted data in a clinical data engine that represents the health records in a manner that logically preserves the hierarchical format while providing a relational access model to the health records. The OIP may extract health-record data in substantially real-time by performing on-the-fly capture and processing of data updates to the source customer database. Such real-time extraction may be performed in cooperation with large scale, batch extraction of records from the source customer database.

Abstract: Systems, methods, and computer program products of distributing sorted sets to multiple nodes of a distributed in-memory database system are described. The distributed in-memory database system is a database system based on key-value pairs. The system receives data records including user data and scores for sorting. The system maps the user data to keys in the key-value pairs. The system maps the scores to the values in the key-value pairs. The system then distributes the mapped key-value pairs to the nodes. The distributed in-memory database system is indexed on the values.

Abstract: A computer program product provides efficient multiple aggregation distinct processing. The computer program product including a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to convert a query with multiple aggregation distincts into a two-stage group-by process using a nest operator. The two-stage group-by process including further program instructions to cause the processor to: perform a first stage group-by process including the nest operator taking a single input row, and concatenating a grouping key with a measure value for each aggregation distinct that forms multiple inputs to a single group-by table, and perform a second stage group-by process including the nest operator bringing together entries for each original group.

Abstract: Aspects of this disclosure relate to protecting email data. For example, email protection rules can instruct an email server to route an email to an email protection module. The one or more email rules can identify a group of one or more email addresses. The email protection module can receive an email from the email server that has an email address of the group as an intended receipt. The email protection module can route the email to secondary storage and store the email in secondary storage to create a secondary copy of the email. The secondary copy can be stored inline to persistent memory of secondary storage, according to certain embodiments. Access to the backup copy of the email stored to the persistent memory can be controlled, for example, based on whether a user had permission to access to the email when the email was sent.

Abstract: Provided is a database system wherein a first node, in accordance with a data transmission request from a second node, transmits, to the second node, specific identification information indicating a transaction log at a predetermined time point, and a transaction log and identification information from after the predetermined time point, and transmits the requested data to the second node from the predetermined time point onwards, and the second node transmits a transmission request for data to the first node in accordance with a search request, and when data received from the first node has been loaded into a memory, the second node executes, on the loaded data, a command relating to a transaction log that is newer than the transaction log indicated by the specific identification information, responds to the search request on the basis of data on which the command has been executed, and deletes the data on which the command has been executed, in accordance with a predetermined condition.

Abstract: Provided is a database system, wherein a first node holds a transaction log of a database together with identification information enabling identification of a sequence of commands, transmits specific identification information indicating a transaction log at a predetermined time point, and the transaction log and identification information from after the predetermined time point, to a second node, and transmits data in the database to the second node from the predetermined time point onwards, and when the data received from the first node has been loaded into a memory, the second node executes a command relating to a transaction log which is newer than the transaction log indicated by the specific identification information, on the loaded data.

Abstract: A system for conflict resolution in a multi-user design package includes a host computer having a memory and a processor, wherein the host computer is configured to operate a multi-user CAx environment, and is configured to receive edit commands from a plurality of local computers. A conflict resolution module is configured to be executed by the host computer, and the conflict resolution module is configured to prevent implementation of conflicting edit commands received from the plurality of local computers in the multi-user CAx environment.

Abstract: Systems and methods for allowing separate parties to identify each other through the use of matching computer-coordinated identifiers are discussed. In some cases, the methods include using a processor of a computer system to identify a first computer device configured to provide a first perceptible identifier, using the processor to identify a second computer device that is configured to provide a second perceptible identifier, and using the processor to send the first perceptible identifier to the first computer device and the second perceptible identifier to the second computer device, wherein the first and second perceptible identifiers correspond with each other to provide a two-sided, computer-coordinated verification. In some cases, the described methods include modifying the first and second identifiers as the first and second computer devices come into proximity with each other. Other implementations are discussed.

Abstract: A window operator can be processed according to a variety of techniques that introduce parallelism. Window function sub-results can be calculated separately on different nodes. Overall superior performance can result. Skewness in input data can be accounted for by controlling a degree of parallelism at nodes.

Abstract: Embodiments of the present invention disclose a data processing apparatus and method that relate to the field of communications network technologies and are used to solve a problem of how to reduce power consumption of a UE. In embodiments of the present invention, an acquiring module acquires a first maximum downlink delay tolerance (MDDT) sent by a core network entity, and provides the first MDDT to a determining module, where the first MDDT indicates a maximum delay tolerance value corresponding to processing, by the apparatus, downlink data of all services on the apparatus; the determining module determines time information of a first MDDT timer by using the first MDDT; and a changing module changes a UE status according to the time information of the first MDDT timer determined by the determining module or changes a UE status according to time information of a first IST.

Abstract: Structured data sets including one or more attributes are identified, each structured data set associated with, for example, a particular user. Values corresponding the at least one of the one or more attributes in each structured data set are identified. A condition established by a content provider, for instance, an advertiser, is compared to the identified values to determine if the condition is satisfied. When the condition is satisfied, one or more content items are identified to the users associated with the structured data sets containing identified values satisfying the condition.

Abstract: The present disclosure provides methods for performing a computation with an aggregate function using a database query, wherein the database query joins a plurality of database tables and includes a distinct aggregation function, which, when executed against one or more databases aggregates only values of database records corresponding to distinct keys by which the tables are joined, regardless of the cardinality of the joined tables. Related devices and systems are also provided.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: Techniques for query optimization for group-by extensions and distinct aggregate functions are provided. A query has an extended group-by clause with an extended group-by operator and a first set of group-by columns. The query has one or more distinct aggregate functions and one or more non-distinct aggregate functions. An initial subquery is constructed that generates a partially aggregated initial temporary (PAIT) table when executed. The initial subquery includes a GROUP BY clause with a second set of group-by columns that includes the first set of group-by columns of the extended group-by clause of the query and one or more columns specified by the one or more distinct aggregate functions. One or more subqueries are computed that compute groupings indicated by the extended group-by operator based on the PAIT table generated by the initial subquery.

Abstract: A computer system can compress or decompress a type-length-value (TLV) component in a message. During operation, the computer can select a compression table associated with a network interface used to send and/or to receive the message, and can search the compression table for an entry that includes a prefix of a value from type-length-value (TLV) component being compressed or decompressed. If compressing the message, the computer may generate a compressed block that corresponds to a compressed version of the TLV component, such that the compressed block includes the compression encoding in place of the prefix in the TLV component's value. The computer can also generate a compressed message that includes the compressed block in place of the TLV component, without a compression table.

Abstract: An information processing apparatus stores, in association with configuration information of an image processing apparatus, specification information used to determine settings information that is used for an operation of the image processing apparatus and is to be shared between the information processing apparatus and the image processing apparatus, obtains the configuration information of the image processing apparatus receives, in a case where specification information corresponding to the configuration information that the obtaining unit obtained is not stored in the storage unit, the specification information corresponding to the obtained configuration information from an external storage device, and transmits to the image processing apparatus settings information to be shared with the image processing apparatus, which is determined based on the specification information received from the external storage device among the settings information stored by the storage unit.

Abstract: A method and system for determining a service description most closely matching a service name provided by a user. It is determined that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions. A ranked service name is generated and includes at least one alternative service name and a respective rank of each alternative service name. The respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user. It is ascertained that a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or matches the next highest ranked alternative service name in the service name list. The ascertained service description is communicated to the user.

Abstract: A method and system for determining a service description most closely matching a service name provided by a user. It is determined that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions. A ranked service name is generated and includes at least one alternative service name and a respective rank of each alternative service name. The respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user. It is ascertained that a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or matches the next highest ranked alternative service name in the service name list. The ascertained service description is communicated to the user.

Abstract: Disclosed in some examples are predictive storage techniques for use in a distributed data system. The predictive storage techniques may be used to manage locally stored elements of a shared data collection, such as the storage of files on nodes of the distributed data system that are limited in local storage space. The predictive storage techniques may achieve a balance between consumption of local resources and timely access of important elements in the shared data collection. For example, the predictive storage techniques may be used for keeping or pre-caching certain items of a collection that are determined as likely to be used in local storage for convenient access, and allowing access the remaining items on request over a network.

Abstract: A disclosed method includes preventing a first mobile device from connecting to configured networks having connectivity information stored in a configured networks list stored in memory of the first mobile device, establishing a peer-to-peer connection with a second mobile device, performing a data transfer from the first mobile device to the second mobile device over the peer-to-peer connection while continuing to prevent the first mobile device from connecting to the configured networks, and enabling the first mobile device to connect to the configured networks after completion of the data transfer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving from a plurality of publisher clients a plurality of messages, assigning each of the messages to one of a plurality of distinct channels wherein each channel comprises an ordered plurality of messages, storing messages of each of the channels in one or more respective buffers according to the order, each buffer having a respective time-to-live, retrieving messages for one or more of the channels from respective buffers having time-to-lives that have not expired and according to the order, and sending the retrieved messages to a plurality of subscriber clients.

Abstract: The disclosed embodiments relate to a system that uses colocation hints to facilitate storing data blocks in a distributed data storage system, which includes a plurality of data centers. During operation, the system receives a write request from a client to write a data block to the distributed data storage system, wherein the write request includes a colocation hint that identifies a colocation group associated with the data block. In response to the write request, the system uses the colocation hint to identify one or more data centers associated with the colocation group. Next, the system writes copies of the data block to the one or more identified data centers. In this way, the system situates copies of data blocks associated with the colocation group in the same data centers when possible.

Abstract: Systems, methods, and other embodiments associated with a unit of work for incremental data processing are described. In one embodiment, a method includes selecting a unit of work key for a program that processes records in a source table. The unit of work key is selected such that modifications to a record having a certain unit of work key value will not affect the program's processing of records having a different unit of work key value. The selected unit of work key is associated with the program. When a record in the source table is created, modified, or deleted, a unit of work key value is identified for the record and a selected set of records having the identified unit of work key value is provided to the program. Thus, records in the data source that do not have the identified unit of work key values are not provided to the program.

Abstract: Methods, systems, and devices are described for managing wireless communications. In one method, a mobile device may determine to transition to a relay status. The relay status may indicate a capability of the mobile device to function as a relay device between at least one other mobile device and a base station. A peer discovery signal that indicates the relay status may then be transmitted. In another method, a mobile device may broadcast an out-of-coverage status indicator in a first peer discovery signal. A second peer discovery signal may be received from at least one other mobile device. The second peer discovery signal may indicate a capability of the at least one other mobile device to function as a relay device.

Abstract: Techniques are disclosed for implementing repository redundancy in a system which incrementally updates remote clients with events that occurred in a cloud-enabled platform. In one embodiment, a method comprises comparing a local timestamp of an event with a remote timestamp of the event. The event is to be stored in a queue in a repository cluster to be read by a remote client. The method further comprises updating the local timestamp of the event if the comparing indicates that the remote timestamp is more recent than the local timestamp. Among other advantages, embodiments disclosed herein ensure that no event in an action log is missed or skipped by any of remote clients in a distributed action log framework system during a switchover from an active but failed server to a backup server, and require zero or minimal down time during the switchover, thereby providing robustness and serviceability to such system.

Abstract: Provided are techniques for data movement. An activity is created that overrides existing security, that is associated with a user, that defines one or more source tables in a relational database and one or more target tables that are available to the user for the activity, and that provides security credentials of an author of the activity for use by the user, wherein the one or more target tables represent data in one or more target files in a file system. The activity is executed using the security credentials of the author to move data in a source table of the one or more source tables to a target file of the one or more target files, wherein a target table of the one or more target tables is defined over the target file. Access is provided to the user to the moved data using the target table.

Abstract: Provided are techniques for data movement. An activity is created that overrides existing security, that is associated with a user, that defines one or more source tables in a relational database and one or more target tables that are available to the user for the activity, and that provides security credentials of an author of the activity for use by the user, wherein the one or more target tables represent data in one or more target files in a file system. The activity is executed using the security credentials of the author to move data in a source table of the one or more source tables to a target file of the one or more target files, wherein a target table of the one or more target tables is defined over the target file. Access is provided to the user to the moved data using the target table.

Abstract: A method and system for selectively replicating data from a primary database associated with a primary server to a secondary database associated with a secondary server. The secondary server determines that a replication task using a first update command has modified the primary database. The secondary server determines a primary table in the primary database has been updated. The secondary server generates a secondary federated table that is coupled to the primary table. The secondary server obtains a second update command based on the first update command from the primary database and applies the second update command to a secondary table in the secondary database using the secondary federated table.

Abstract: A computer-implemented system and method for performing distinct operations on multiple tables of shared memory of parallel computing environments are disclosed. A distinct operation is executed on each table of a plurality of tables, each distinct operation eliminating duplicate data from each table, the executing creating a hierarchy of table pairs and distinct results, the distinct results comprising a reduced row set for each table. Duplicates on each reduced row set are detected to complete the distinct operation on the plurality of tables.

Abstract: Technologies are described for performing replication within a database environment. For example, replication of database data can be performed using data manipulation language (DML) statements and logical logs. A database node can execute a DML statement, create a logical log comprising the DML statement, and insert the logical log into a logical log queue. The logical log can be sent to one or more other database nodes for execution of the DML statement stored within the logical log. Logical logs can be grouped for sending to other nodes. Logical logs can be executed on a first node and one or more other nodes within the same transaction boundary. Execution of DML statements can be decoupled from sending, receiving, grouping, and/or processing of logical logs.

Abstract: A computer-implemented method is provided for managing and sharing picture files. In one embodiment of the present invention, the method comprises providing a server platform and providing a datastore on the server platform for maintaining full resolution copies of the files shared between a plurality of sharing clients. A synchronization engine is provided on the server platform and is configured to send real-time updates to a plurality of sharing clients when at least one of the sharing clients updates or changes one of said files. A web interface may also be provided that allows a user to access files in the datastore through the use of a web browser.

Abstract: Scalable architectures, systems, and services are provided herein for creating manifest-based snapshots in distributed computing environments. In some embodiments, responsive to receiving a request to create a snapshot of a data object, a master node identifies multiple slave nodes on which a data object is stored in the cloud-computing platform and creates a snapshot manifest representing the snapshot of the data object. The snapshot manifest comprises a file including a listing of multiple file names in the snapshot manifest and reference information for locating the multiple files in the distributed database system. The snapshot can be created without disrupting I/O operations, e.g., in an online mode by various region servers as directed by the master node. Additionally, a log roll approach to creating the snapshot is also disclosed in which log files are marked. The replaying of log entries can reduce the probability of causal consistency in the snapshot.

Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. The system may split a data partition into two new partitions, and may split the replica group that stored the original partitions into two new replica groups, each storing one of the new partitions. To split the replica group, the master replica may propagate membership changes to the other members of the replica group for adding members to the original replica group and for splitting the expanded replica group into two new replica groups. Subsequent to the split, replicas may attempt to become the master for the original replica group or for a new replica group. If an attempt to become master replica for the original replica group succeeds, the split may fail.

Abstract: Replicating data in a distributed database having a plurality of nodes is disclosed. Replicating includes receiving a semantic command at a local version of the database at a node, interpreting the semantic command, and applying the semantic command to the local version of the database.

Abstract: A control system that includes several controllers for managing several switching elements. A first controller receives a request to modify a data tuple stored in a network information base (NIB) storage of the first controller that stores data for managing a set of switching elements. The first controller determines whether the received request to modify should be processed by the first controller. When the received request should be modified by the first controller, the first controller modifies the set of data in the NIB storage. The first controller updates a request list that is propagated between the controllers to disseminate requests to modify different data tuples that are stored in the NIB storages of the different controllers.

Abstract: In one embodiment, network devices such as IP phones may be upgraded with a set of files. A master network device in the set of network devices is identified. The master network device retrieves or receives one or more files in the set of files. The master network device then distributes the file(s) to one or more network devices in the set of network devices, thereby enabling the file(s) to be distributed in a hierarchical manner to remaining network devices in the set of network devices.

Abstract: A system that implements a data storage service may store data on behalf of clients in multiple replicas on respective computing nodes. The system may employ an external service to select a master replica for a replica group. The master replica may service consistent read operations and/or write operations that are directed to the replica group (or to a data partition stored by the replica group). The master replica may employ a quorum based mechanism for performing replicated write operations, and a local lease mechanism for determining the replica authorized to perform consistent reads, even when the external service is unavailable. The master replica may propagate local leases to replica group members as replicated writes. If another replica assumes mastership for the replica group, it may not begin servicing consistent read operations that are directed to the replica group until the lease period for a current local lease expires.