Abstract: Systems and methods described herein provide a vacuum priming system for close-coupled pumps. The vacuum priming system is mounted separately from a centrifugal pump and powered by an electric motor. An auxiliary vacuum pump pulls prime (e.g., water or another liquid) through a solenoid valve that is in turn connected to a connecting tube. At one end of the connecting tube is a screen and prime sensor. The screen filters particulates to protect the vacuum pump, and the prime sensor may detect when the centrifugal pump is primed. The vacuum priming system includes a self-contained control panel with an auto operation mode to only pull power during priming, reducing power consumption over the lifetime of the pump system and improving efficiency.

Abstract: Systems and methods thermal management of a directed energy weapon are provided. The system may include a controller module executable by a processor to determine a planned energy emission from a light-emitting diode (LED) of the directed energy weapon. The controller module may generate a cooling instruction to influence a temperature of the LED with a cooling fluid in response to the planned energy emission. The controller module may cause the cooling fluid to be applied to the LED in accordance with the cooling instruction prior to a start of the planned energy emission of the LED.

Abstract: An apparatus and method of controlling the position of a variable vane in a compressor and a kit for adding such apparatus to the compressor are disclosed. The vane is coupled to a unison ring, a cam is secured to a torque tube, a cam follower is secured to the unison ring. The cam follower is secured such that a wall of the cam follower is in contact with the cam. Rotation of the torque tube causes movement of the cam, and movement of the cam moves the cam follower, thereby moving the unison ring and the variable vane coupled thereto.

Abstract: An apparatus and method of controlling the position of a variable vane in a compressor and a kit for adding such apparatus to the compressor are disclosed. The vane is coupled to a unison ring, a cam is secured to a torque tube, a cam follower is secured to the unison ring. The cam follower is secured such that a wall of the cam follower is in contact with the cam. Rotation of the torque tube causes movement of the cam, and movement of the cam moves the cam follower, thereby moving the unison ring and the variable vane coupled thereto.

Abstract: Systems and methods thermal management of a directed energy weapon are provided. The system may include a controller module executable by a processor to determine a planned energy emission from a light-emitting diode (LED) of the directed energy weapon. The controller module may generate a cooling instruction to influence a temperature of the LED with a cooling fluid in response to the planned energy emission. The controller module may cause the cooling fluid to be applied to the LED in accordance with the cooling instruction prior to a start of the planned energy emission of the LED.

Abstract: Automated healthcare information exchange. The healthcare information may comprise one or more dose orders corresponding to dose medications to be administered to a patient. The healthcare information may be received (e.g., from an EMR system such as a hospital information system (HIS) or the like) in the form of a healthcare information data stream. The information may then be standardized in to a standardized intermediate form. For instance, data may be parsed from the data stream and used to populate a staging table. In turn, data from the staging table may be transformed into an input format specific to a given dose fulfillment client to which the dose order is provided for fulfillment of the dose. Additionally, exception processing. logistical processing, and management functionality may be applied to the dose orders.

Abstract: In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.

Abstract: A system and a method are disclosed for communicating between two programming languages on a client device. Commands in a high-level language are encoded as character string containing a series of numbers separated by delimiters, with each component of the command encoded as a different number. The encoded character strings are passed to compiled code that runs natively on the client device, and the native code decodes the character strings into corresponding native commands and executes the native commands. This communication protocol allows applications written in high-level code to perform functions that are typically set aside for native code, such as communicating with web servers and modifying files saved in memory. High-level code may also be transferred to client devices without being subjected to the restrictions that some operating systems place on the transfer for application binaries, which allows application developers to automatically send application updates to users.

Abstract: Techniques for sharing routing information over a network include determining whether the scale of a flooding domain exceeds a threshold. If so, then a router announcement message is sent over a particular link. The message indicates the local router is a flooding domain border router (FDBR). Summary routing information is determined with less than a certain level of detail used in the flooding domain for routers connected to the local router through links different from the particular link. The summary routing information is sent over the particular link in a link state message that includes type data that indicates summary routing information that crosses a FDBR. These techniques allow automatic favorable scaling of domains of shared routing information as the size of a mobile ad hoc network grows.

Abstract: A system and a method are disclosed for communicating between two programming languages on a client device. Commands in a high-level language are encoded as character string containing a series of numbers separated by delimiters, with each component of the command encoded as a different number. The encoded character strings are passed to compiled code that runs natively on the client device, and the native code decodes the character strings into corresponding native commands and executes the native commands. This communication protocol allows applications written in high-level code to perform functions that are typically set aside for native code, such as communicating with web servers and modifying files saved in memory. High-level code may also be transferred to client devices without being subjected to the restrictions that some operating systems place on the transfer for application binaries, which allows application developers to automatically send application updates to users.

Abstract: Systems and methods presented herein may involve documenting clinical trials through use of a mobile communications device, such as a camera phone. Using the mobile communications device, the participant may record video of themselves administering a health intervention that is the subject of the clinical trial and/or report serious adverse events that occur. The video clips may be sent to a documentation server for documentation. The documentation server may also route serious adverse event notifications to a plurality of locations, such as the doctor's office, the study center, and/or the pharmaceutical company that developed the health intervention being tested.

Abstract: In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.

Abstract: In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.

Abstract: In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.

Abstract: In one embodiment, a method includes sending an adjacency discovery message 1 from a local router over a direct link to a first neighbor router. An adjacency discovery message is not forwarded and includes a repair address. The repair address indicates the local router but is not advertised as reachable over the direct link. An outbound routing update message is sent to a different second neighbor router. The outbound routing update message is forwarded and includes reachability data that indicates the repair address is reachable. A payload of an inbound tunneled packet received at the local router and directed to the repair address is forwarded based on a destination indicated in the payload.

Abstract: Techniques for detecting loops in routes that cross route information boundaries include receiving a control message at a first edge node on one side of the boundary that is connected to a different second edge node on another side of the boundary. The control message indicates a particular network address of a particular node that is reachable from the first edge node. Distinguisher data is determined that indicates if a node in the first collection can reach the first edge node without leaving the first collection. An advertising message is sent from the first edge node to the second edge node that includes route data that indicates the particular network address and the distinguisher data. Based on the distinguisher data, a testing edge node in the first collection can determine whether there is a loop comprising both an internal path and an external path to the first edge node.

Abstract: A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.

Abstract: In one embodiment, information is signaled between aggregating routers indicating the components of aggregated addresses. This information is used to dynamically leak, or deaggregate, specific parts of the aggregated address space to reduce sub-optimal routing and possibly prevent routing black holes from occurring in a network.

Abstract: In one embodiment, a method includes receiving a first link state initiation (HELLO) message from a first neighboring router. The HELLO message requests that a recipient node send a unique identifier for itself in a link state routing protocol. In response to receiving the first HELLO message, a first response message is sent that includes a first identifier from an identifier pool. The identifier pool contains for a local node a plurality of network identifiers that are unique among all nodes in the network that uses the link state routing protocol. A second HELLO message is received from a different second neighboring router. In response to receiving the second HELLO message, a second response message is sent that includes a different second identifier from the identifier pool.

Abstract: In one embodiment, a method includes receiving authenticated site data that includes site ID data and address data. The site ID data indicates a unique site ID for each site among multiple sites for a first network that uses an internal routing protocol. Multiple edge sites of those sites are separate from each other and connected to a second network that is under separate administrative control of at least one different party. The address data indicates network addresses associated with each site of the plurality of sites. An external routing protocol message is discounted based on the authenticated site data.