Abstract: An online system identifies target audience for distributing content items based on historical activity of users. The online system receives information describing events representing actions of users performed on the online system or on an external system and stores the information as action logs. The online system receives targeting criteria specified as expressions, for example, expressions specifying aggregate values determined over a plurality of actions of a user. The online system retrieves events from the action logs and determines partial results based on expressions representing the targeting criteria. If the partial results for a user indicate that the user satisfies the targeting criteria, the online system selects the user for targeting the corresponding content item. The online system may process events in batches.

Abstract: Disclosed is a fluid collection device wherein multiple, individual samples of fluid can be collected simultaneously. The device includes a chamber and an adapter which substantially and simultaneously distributes the blood to individual chambers with chamber specific additives. Also included is a system for using the blood collection device, preferably within a diagnostic testing laboratory.

Abstract: A router residing in a network comprises at least one ingress port, at least one egress port, and a processor programmed to compare at least two label switch paths, determine potential conflicts between the at least two label switch paths based on the ingress ports and egress ports utilized by the label switch paths, and determine a selected identifier to be assigned relative to each label switch path. The processor is configured to assign a common identifier if no conflict exists. A storage medium is operatively coupled to the processor for storing the selected identifiers related to the label switch paths. The processor may be configured to determine that a conflict exists between two label switch paths if they utilize the same ingress port on the router and different egress ports on the router.

Abstract: A system and computer-implemented method for suggesting social groups is provided. Direct contacts connected to a user of a social networking service are identified. Secondary contacts are further identified, where each of the secondary contacts is connected to at least one of the direct contacts. A set of direct contacts is determined from the direct contacts based on connections between the direct contacts and the secondary contacts. The set of direct contacts is provided as a suggested social group.

Abstract: A system and method for allocating physical memory in a distributed, shared memory system and for maintaining interaction with the memory using a reservation protocol is disclosed. In various embodiments, a processor node may broadcast a memory request message to a first subset of nodes connected to it via a communication network. If none of these nodes is able to satisfy the request, the processor node may broadcast the request message to additional subsets of nodes until a positive response is received. The reservation protocol may include a four-way handshake between the requesting processor node and a memory node that can fulfill the request. The method may include creation of a reservation structure on the requesting processor and on one or more responding memory nodes. The reservation protocol may facilitate the use of a proximity-based search methodology for memory allocation in a system having an unreliable underlying transport layer.

Abstract: Aspects of the invention pertain to transmitting packet data across a computer network. The packets may be sent via one or more distinct routes from a source to a destination. Each route may employ multiple routers disposed along the network. Non-colliding routes are determined by transmitting pairs of probe packets along the routes. A first probe packet has a maximal length, and a second probe packet has a minimal length. Depending on the order of arrival of the probe packets, the system determines whether two transport layer ports at the destination device collide. If there is a collision, then the system searches for a set of non-colliding ports. Once the non-colliding ports are determined, application data may be sent as packets along the different routes to those ports.

Abstract: The present invention provides network interface monitoring and management that may be employed with link aggregation technologies. Multiple network interfaces may be aggregated into a single bond and data may be transferred to and from a backbone network via this aggregated bond. A link aggregation monitor employs a heartbeat generator, sniffer and data store to keep track of health and availability of network interfaces. The heartbeat generator sends heartbeats to the network interfaces, which pass the heartbeats around in a token ring configuration. If a network interface fails or otherwise goes offline, detection of this condition causes the monitor and heartbeat generator to prepare new or modified heartbeats so that data may be efficiently and accurately routed around the token ring and health of all remaining alive interfaces can be monitored properly. If a network interface re-enters or is added to the aggregate bond, new/modified heartbeats are then employed.

Abstract: A system and method for updating timestamps in log data is provided. The log data is accessed to obtain timestamps corresponding to communication between a client device and a server. The timestamps include a first client timestamp corresponding to a time that the client device sends a request to the server, a first server timestamp corresponding a time the that the server receives the request from the client device, a second server timestamp corresponding to a time that the server sends a response to the request to the client device, and a second client stamp corresponding to a time that the client device receives the response from the server. A clock skew between the client device and the server and a network delay are calculated. At least one of the timestamps is updated based on the calculated clock skew and the network delay.

Abstract: A router residing in a network comprises at least one ingress port, at least one egress port, and a processor programmed to compare at least two label switch paths, determine potential conflicts between the at least two label switch paths based on the ingress ports and egress ports utilized by the label switch paths, and determine a selected identifier to be assigned relative to each label switch path. The processor is configured to assign a common identifier if no conflict exists. A storage medium is operatively coupled to the processor for storing the selected identifiers related to the label switch paths. The processor may be configured to determine that a conflict exists between two label switch paths if they utilize the same ingress port on the router and different egress ports on the router.

Abstract: Systems and methods for managing system resources on distributed servers are discussed. The servers may determine, using control circuitry, a system resource metric of the server. The system resource metric may be compared with a pre-determined threshold value. Based on the comparison of the system resource metric with a pre-determined threshold value, the server may determine whether to initiate maintenance on the server. If it is determined that maintenance should be initiated, the server may enter a not-in-service mode and the server may initiate maintenance. Once maintenance is complete, the server may exit the not-in-service mode.

Abstract: A biological sample containment system and method are provided that include a container for storing the biological sample and an indicator affixed to the container for displaying at least one measured characteristics of the container or sample, wherein measurement of the characteristic is commenced by activation of the indicator. In yet another embodiment of the invention, a biological sample containment system and method are provided that include a container for collecting a biological sample and a label affixed to the container, wherein information relating to the biological sample or container is situated on the label and at least a portion of said information is situated on a face of the label that is affixed to the container.

Abstract: A system is configured to identify a particular channel that provides content, where the particular channel includes content items; determine a respective first score, for each of the content items, that reflects a measure of quality of the content item; determine a topic distribution, for each of the content items, that indicates a topic conveyed by the content item; assign a second score, to the particular channel, that reflects a measure of quality of the particular channel; determine a particular term for which the particular channel is authoritative based on the first scores, the topic distributions, and the second score; and store information identifying the particular channel as authoritative for the particular term. A new content item, associated with the particular channel and relating to the particular term, may be promoted in search results for a search query relating to the particular term.

Abstract: A method includes, receiving a plurality of data flows. A respective data flow includes a respective source address and a respective destination address. The method further includes generating, without regard to priorities associated with the plurality of data flows, an ordering of the plurality of data flows; and iteratively modifying, without regard to the priorities, the ordering of the plurality of data flows by applying a randomization algorithm to the plurality of data flows, until a cost associated with path assignments for the ordering of the plurality of data flows satisfies a predetermined condition. A respective path assignment for a respective data flow specifies a respective path from a respective source address to a respective destination address. The method also includes executing the data flows based on the path assignments for the ordering of the plurality of data flows having the cost that satisfies the predetermined condition.

Abstract: A router residing in a network comprises at least one ingress port, at least one egress port, and a processor programmed to compare at least two label switch paths, determine potential conflicts between the at least two label switch paths based on the ingress ports and egress ports utilized by the label switch paths, and determine a selected identifier to be assigned relative to each label switch path. The processor is configured to assign a common identifier if no conflict exists. A storage medium is operatively coupled to the processor for storing the selected identifiers related to the label switch paths. The processor may be configured to determine that a conflict exists between two label switch paths if they utilize the same ingress port on the router and different egress ports on the router.

Abstract: A system and method are provided for providing information on at least one container for storing a biological sample, including: a holder configured to hold at least one biological sample container and a receiver configured to receive information relating to at least one of the container or the biological sample as well as data relating to at least one instruction for printing the information. The system and method further include a printer configured to print the information in accordance with the at least one instruction. In one embodiment, the printer is configured to print the information directly on the container. In another embodiment, the system and method further include an applicator configured to apply a label on the container and the printer is configured to print the information on the label.

Abstract: A system and method to assign paths for data flows through a wide area network. A plurality of data flows is received, wherein a respective data flow in the plurality of data flows includes a respective source address and a respective destination address. An ordering of the plurality of data flows is generated. The ordering of the plurality of data flows are iteratively modified until a cost associated with path assignments for the ordering of the plurality of data flows satisfies a predetermined condition, wherein a respective path assignment for a respective data flow specifies a respective path from a respective source address to a respective destination address. The data flows are executed based on the path assignments for the ordering of the plurality of data flows having the cost that satisfies the predetermined condition.

Abstract: A method for memory protection in a multiprocessor system, involving receiving a request at a first carrier to perform a memory operation at a memory address, wherein the first carrier receives the request from a processor, determining by the first carrier whether the processor is permitted to access memory at the memory address using a carrier identification (ID) of a second carrier, wherein the second carrier is associated with a memory controller used to access the memory, and sending the request to the second carrier, if the processor is permitted to access the memory.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for user-space resource management are described. In one aspect, a method includes receiving in a user memory space kernel resource information from a kernel executing in a kernel memory space, the kernel resource information identifying one or more kernel items in the kernel memory space that depend on kernel resources. The method further includes evaluating one or more resource management policies for one or more of the kernel items. The resource management polices are stored in the user memory space. The method further includes selecting a kernel item to be modified based on the evaluation in order to release some or all of the kernel resources, and communicating a request for modification of the selected kernel item to the kernel.

Abstract: In general, this disclosure describes techniques for providing dynamic active participants in a real-time visual communication session between two or more participants. When there are more participants in the real-time visual communication session than computing devices connected to the communication session can support visual data from, a subset of the participants are chosen to be active participants. Visual data of the active participants are displayed by one or more of the computing devices. The active participants are chosen based on participation properties. Active participants may become passive and passive participants may become active based on the participation properties. The quality of visual data associated with active participants (e.g., compression rate, output display size, etc.) may be iteratively reduced as one or more of the passive participants become active.

Abstract: Disclosed are apparatus and methods for reporting garbage collection operations. A virtual machine that is executable on a computing device can receive a request to be informed prior to execution of garbage collection software on the computing device via a prior up-call. The virtual machine can receive a request to be informed upon completion of execution of the garbage collection software on the computing device via a post up-call. Prior to the execution of the garbage collection software, the virtual machine can initiate execution of the prior up-call to indicate the garbage collection software is to be executed. After the garbage collection software has completed execution, the virtual machine can initiate execution of the post up-call to indicate the garbage collection software has completed execution.