Abstract: Various embodiments manage dynamic memory allocation data. In one embodiment, a set of memory allocation metadata is extracted from a memory heap space. Process dependent information and process independent information is identified from the set of memory allocation metadata based on the set of memory allocation metadata being extracted. The process dependent information and the process independent information at least identify a set of virtual memory addresses available in the memory heap space and a set of virtual memory addresses allocated to a process associated with the memory heap space. A set of allocation data associated with the memory heap space is stored in a persistent storage based on the process dependent information and the process independent information having been identified. The set of allocation data includes the process independent allocation information and a starting address associated with the memory heap space.

Abstract: A request arrival rate is obtained at a given computing node in a computing network comprising a plurality of distributed computing nodes. A topology of the computing network is determined at the given computing node so as to identify neighboring computing nodes with respect to the given computing node. A probability is computed at the given computing node based on the obtained request arrival rate and the detected network topology. The computed probability is used to select a decision from a set of decision candidates in response to a request received at the given computing node in a given time slot. The selected decision is a decision with a top average reward attributed thereto across the given computing node and the neighboring computing nodes determined based on information shared by the neighboring computing node with the given computing node.

Abstract: Various embodiments manage dynamic memory allocation data. In one embodiment, a set of memory allocation metadata is extracted from a memory heap space. Process dependent information and process independent information is identified from the set of memory allocation metadata based on the set of memory allocation metadata being extracted. The process dependent information and the process independent information at least identify a set of virtual memory addresses available in the memory heap space and a set of virtual memory addresses allocated to a process associated with the memory heap space. A set of allocation data associated with the memory heap space is stored in a persistent storage based on the process dependent information and the process independent information having been identified. The set of allocation data includes the process independent allocation information and a starting address associated with the memory heap space.

Abstract: The present disclosure generally relates to the field of fire alarms. The teachings thereof may be embodied in a strobe notification appliance having: a boost circuit connected to an input voltage; an energy storage circuit charged by the boost circuit; a drive circuit generating a drive current; an LED circuit with at least one LED element; a first sampling circuit collecting an overall voltage drop of all the LED elements; and a control circuit configured to adjust the drive circuit to supply a working current during an alarming stage and supply a detection current during a detection stage. The detection current is lower than the working current and thereby light energy produced by the LED elements during the detection stage is lower than alarming light energy produced during the alarming stage. During the detection stage, the control circuit determines whether the LED circuit works normally based on the collected overall voltage drop.

Abstract: In a starch concentration measurement, a liquid sample is conducted from a liquid sample such as pulp suspension or filtrate of a paper, board or tissue process. An iodine solution is added to the sample, and a light absorbance or transmittance of the sample is measured at a target wavelength. The measured absorbance or transmittance of the sample is then converted into the starch concentration of the sample.

Abstract: A modified creping adhesive formulation is described that includes at least one creping adhesive, and modifier, wherein the modifier is or includes an emulsion of polypropylene glycol, at least one quaternary ammonium compound, and at least one non-ionic surfactant. The present invention is directed to the modifier itself as well. Methods of creping using the formulation are also described.

Abstract: A blimp includes a circular disk-shaped envelope filled with a lighter-than-air gas. A gondola is affixed to an underside of the envelope and is disposed at a region directly below a center point of the circle defined by the intersection of the envelope and the horizontal plane. The gondola includes: a horizontally-disposed elongated circuit board that functions as a structural member of the gondola; and a vertical member extending upwardly from the circuit board and having a top that is attached to the underside of the envelope. A thrusting mechanism is affixed to the gondola and is configured to generate thrust. An electronics suite is disposed on and electrically coupled to the circuit board and includes a blimp processor configured to generate control signals that control the thrusting mechanism. A battery is affixed to the gondola and provides power to the electronics suit and the thrusting mechanism.

Abstract: System and method for facilitating user identification of a product. The system includes: a receiver unit configured to receive a signal; a memory module in communication with the receiver unit, the memory module having stored thereon product data that is stored in association with a transmittable product identity, wherein the receiver unit is further configured to (i) convert the received signal into its corresponding transmittable product identity and (ii) retrieve the product data from the memory module based on a comparison between the stored transmittable product identity and the converted transmittable product identity; and an output unit configured to output the retrieved product data to a user for facilitating user identification of the product.

Abstract: Implementing a fair share of resources among one or more scheduling peers. Resource allocations are received for a plurality of scheduling peers. For each scheduling peer, a usage percentage difference is determined between their respective usage percentage and configured share ratio. For a first competing peer that is served more than a second competing peer, resource allocation is adjusted such that resources from the first competing peer are allocated to the second competing peer based, at least in part, on a time decay factor function that gives less weight to the usage percentage difference as an age of the usage percentage difference increases.

Abstract: A method to share remote DMA (RDMA) pointers to a key-value store among a plurality of clients. The method allocates a shared memory and accesses the key-value store with a key from a client and receives an information from the key-value store. The method further generates a RDMA pointer from the information, maps the key to a location in the shared memory, and generates a RDMA pointer record at the location. The method further stores the RDMA pointer and the key in the RDMA pointer record and shares the RDMA pointer record among the plurality of clients.

Abstract: An embodiment of the invention includes a method for executing commands in a distributed computing environment. The method receives a plurality of distributed commands from one or more devices. The method determines a global command execution order for executing the received plurality of distributed commands. The method dispatches the received plurality of distributed commands to a plurality of servers hosting a plurality of corresponding shards in the distributed computing environment, where a given distributed command corresponds to one or more of a given shard if the given distributed command pertains to a state hosted by the one or more given shard. The method executes, by the one or more given shard, the given distributed command, where the execution is deterministic, and where a result of deterministic execution of the given distributed command is unanimous among the one or more given shard.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A notification appliance in a fire fighting system may include at least one LED, a drive circuit, and a control circuit. The control circuit may be configured to output at least one flash control signal to the drive circuit in response to a candela setting, the flash control signal indicating a pulse waveform characteristic and a current amplitude of a drive current that is output by the drive circuit and can flow through the at least one LED. The candela setting may be selected from a plurality of optional candela settings, and the pulse waveform characteristic and the current amplitude indicated may be selected such that each light emission of the at least one LED can substantially minimize electric energy required for the candela setting.

Abstract: Distributed game commands in massive multiplayer online games. A game engine receives commands and determines the order of their execution based on a global order policy using sequencers. The sequencers dispatch the commands to appropriate game engine instances on shards hosting game states. Engine instances execute the commands according to the global order established by the sequencers.

Abstract: A formulation useful as a creping adhesive formulation or Yankee dryer coating composition is described. Methods of creping using the formulation are also described.

Abstract: Embodiments relate to methods, systems and computer program products for cache management in a Remote Direct Memory Access (RDMA) data store. Aspects include receiving a request from a remote computer to access a data item stored in the RDMA data store and creating a lease including a local expiration time for the data item. Aspects further include creating a remote pointer to the data item, wherein the remote pointer includes a remote expiration time and transmitting the remote pointer to the remote computer, wherein the lease is an agreement that that the remote computer can perform RDMA reads on the data item until the remote expiration time.

Abstract: Embodiments relate to methods, systems and computer program products for cache management in a Remote Direct Memory Access (RDMA) data store. Aspects include receiving a request from a remote computer to access a data item stored in the RDMA data store and creating a lease including a local expiration time for the data item. Aspects further include creating a remote pointer to the data item, wherein the remote pointer includes a remote expiration time and transmitting the remote pointer to the remote computer, wherein the lease is an agreement that that the remote computer can perform RDMA reads on the data item until the remote expiration time.

Abstract: There is provided a method, a system and a computer program product for improving performance and fairness in sharing a cluster of dynamically available computing resources among multiple jobs. The system collects at least one parameter associated with availability of a plurality of computing resources. The system calculates, based on the collected parameter, an effective processing time each computing resource can provide to each job. The system allocates, based on the calculated effective processing time, the computing resources to the multiple jobs, whereby the multiple jobs are completed at a same time or an approximate time.

Abstract: Various embodiments manage dynamic memory allocation data. In one embodiment, a set of memory allocation metadata is extracted from a memory heap space. Process dependent information and process independent information is identified from the set of memory allocation metadata based on the set of memory allocation metadata being extracted. The process dependent information and the process independent information at least identify a set of virtual memory addresses available in the memory heap space and a set of virtual memory addresses allocated to a process associated with the memory heap space. A set of allocation data associated with the memory heap space is stored in a persistent storage based on the process dependent information and the process independent information having been identified. The set of allocation data includes the process independent allocation information and a starting address associated with the memory heap space.