Abstract: An example computing platform is configured to receive a request from a first user account of a first P2P payment service that a cross-service transaction be initiated with another user account of another P2P payment service. Based on the request, the computing platform generates a transaction identifier for the transaction and sends the identifier to the first P2P payment service's platform. Thereafter, the computing platform receives, from a second P2P payment service's platform, the transaction identifier and an identifier of a second user account of the second P2P payment service and responsively determines that the cross-service transaction comprises a transfer of funds between a first financial account associated with the first user account and a second financial account associated with the second user account. The computing platform then selects and causes a given payment rail platform to transfer funds between the first and second financial accounts.

Abstract: A first P2P payment service notifies a cross-service transaction platform of a request for a cross-service transaction between a first user account of the first P2P payment service and a second user account of a second P2P payment service. The first P2P payment service receives a transaction identifier for the cross-service transaction and causes the first user's client device to present the transaction identifier in a manner that enables the first user's client device to share the transaction identifier with the second user's client device. The second user's client device sends the transaction identifier to the second P2P payment service as part of a request to participate in the cross-service transaction. The second P2P payment service provides the cross-service transaction platform with the transaction identifier, and the cross-service transaction platform causes an appropriate payment rail provider to settle the cross-service transaction.

Abstract: Techniques for facilitating and accelerating log data processing by splitting data streams are disclosed herein. The front-end clusters generate large amount of log data in real time and transfer the log data to an aggregating cluster. The aggregating cluster is designed to aggregate incoming log data streams from different front-end servers and clusters. The aggregating cluster further splits the log data into a plurality of data streams so that the data streams are sent to a receiving application in parallel. In one embodiment, the log data are randomly split to ensure the log data are evenly distributed in the split data streams. In another embodiment, the application that receives the split data streams determines how to split the log data.

Abstract: Systems and methods of providing notifications are described herein. A user account for which a request to provide content is received is identified. Responsive to identifying the user account and the content requested, one or more notifications to be provided along with the requested content is identified. Each of the notifications has a corresponding notification type identifier that indicates a type of notification. A priority level for each of the notifications is determined responsive to a global prioritization policy and the corresponding notification type identifier. The priority level for each of the notifications can be determined by identifying the notification type identifier for each notification, identifying a priority level that matches the notification type identifier and assigning the notification the identified priority level.

Abstract: Disclosed is a method and system for dynamically persisting log data from member computers in a network. The log data is transmitted as a plurality of shards to a router of router-writer pairs which transmits the shards to writers of the router-writer pairs that persist the shards into a storage unit. A shard contains a distinct subset of the log data. The shards are transmitted to the writers based on a writer assignment map that identifies a writer assigned to persist each of the shards. The assignment of the shards to a writer is performed based on assignment criteria that include at least one of (i) number of writers, (ii) a load of the writers, (iii) number of shards, (iv) size of a particular shard, or (v) estimated load capacity of writers.

Abstract: Techniques for facilitating and accelerating log data processing by splitting data streams are disclosed herein. The front-end clusters generate large amount of log data in real time and transfer the log data to an aggregating cluster. The aggregating cluster is designed to aggregate incoming log data streams from different front-end servers and clusters. The aggregating cluster further splits the log data into a plurality of data streams so that the data streams are sent to a receiving application in parallel. In one embodiment, the log data are randomly split to ensure the log data are evenly distributed in the split data streams. In another embodiment, the application that receives the split data streams determines how to split the log data.

Abstract: Disclosed is a method and system for dynamically persisting log data from member computers in a network. The log data is transmitted as a plurality of shards to a router of router-writer pairs which transmits the shards to writers of the router-writer pairs that persist the shards into a storage unit. A shard contains a distinct subset of the log data. The shards are transmitted to the writers based on a writer assignment map that identifies a writer assigned to persist each of the shards. The assignment of the shards to a writer is performed based on assignment criteria that include at least one of (i) number of writers, (ii) a load of the writers, (iii) number of shards, (iv) size of a particular shard, or (v) estimated load capacity of writers.

Abstract: A filament post used in plasma-enhanced chemical vapor deposition has an outer shell and an inner post. An electrical potential is applied only to the inner post to ensure that there is no impact on the plasma density and the carbon film properties. The inner post and the outer shell are electrically insulated by ceramic insulators, such that no electrical potential is applied to outer shell. The stress generated in the carbon film is directly related to the electrical potential of the surface to which the film is deposited. The carbon film deposited on the outer shell of the post is not highly stressed, which significantly reduces film delamination from the filament post surfaces.

Abstract: A filament post used in plasma-enhanced chemical vapor deposition has an outer shell and an inner post. An electrical potential is applied only to the inner post to ensure that there is no impact on the plasma density and the carbon film properties. The inner post and the outer shell are electrically insulated by ceramic insulators, such that no electrical potential is applied to outer shell. The stress generated in the carbon film is directly related to the electrical potential of the surface to which the film is deposited. The carbon film deposited on the outer shell of the post is not highly stressed, which significantly reduces film delamination from the filament post surfaces.

Abstract: The improved carbon beam deposition chamber described herein substantially reduces the accumulation of carbon film on the outer surfaces of the chamber aperture plates, thereby substantially increasing the number of disks which can be processed before system cleaning or hardware replacement is required, thereby to substantially reduce disk failure for coated disks and substantially increase carbon gun productivity.

Abstract: A method for detecting memory leakage of a linked list in a running program, includes saving current size of the linked list as a new maximum size of the linked list when a new element is added to the linked list that causes the current size of the linked list to exceed a former maximum size of the linked list, determining whether a first pre-determined period of time has elapsed from when the liked list was created, and determining whether the new maximum size of the linked list exceeds the former maximum size of the linked list during a second pre-determined period of time.

Abstract: A method for detecting memory leakage of a linked list in a running program, includes saving current size of the linked list as a new maximum size of the linked list when a new element is added to the linked list that causes the current size of the linked list to exceed a former maximum size of the linked list, determining whether a first pre-determined period of time has elapsed from when the liked list was created, and determining whether the new maximum size of the linked list exceeds the former maximum size of the linked list during a second pre-determined period of time.