Abstract: There is described herein a diffuser assembly comprising a leaf spring, diffuser and at least one actuator. The leaf spring is arranged as a rectangular frame having a width, x, and height, y. The diffuser is suspended by the frame such as within the frame. The at least one actuator arranged to move, such as translate, the diffuser. The assembly is arranged such that the leaf spring provides in-plane (x-y plane) stiffness, kx and ky, less than the out-of-plane (z-direction) stiffness, kz.

Abstract: A computer-implemented method provides a requested medical data record to a receiving entity. The method includes receiving a set of medical data records and receiving or initiating a joint data index and, for each medical data record of the set, applying a plurality of hash functions to a patient identifier corresponding to the medical data record to determine a hash vector, the patient identifier corresponding to the medical data record identifying the patient being subject of the medical data record, and updating the joint data index based on the hash vector. Furthermore, it includes providing the joint data index to the receiving entity and receiving a request for a record, corresponding to a request patient identifier and being based on the joint data index, from the receiving entity. The method includes providing the requested medical data record to the receiving entity via a secure communication channel.

Abstract: There is described herein a diffuser assembly comprising a leaf spring, diffuser and at least one actuator. The leaf spring is arranged as a rectangular frame having a width, x, and height, y. The diffuser is suspended by the frame such as within the frame. The at least one actuator arranged to move, such as translate, the diffuser. The assembly is arranged such that the leaf spring provides in-plane (x-y plane) stiffness, kx and ky, less than the out-of-plane (z-direction) stiffness, kz.

Abstract: The present invention describes a method capable of interpreting user-defined queries, translating them into a model of automata for data flow processing, planning the distribution of the computing between the nodes of a distributed system, identifying computations with high potential of memory consumption and, when identified, allocating appropriate data structures for each computation, allocating the amount of memory required to meet the specified error margin, distributing the computation between the active nodes of a distributed system, and synchronizing the partial results at each defined moment and releasing the final result.

Abstract: A computerized method includes broadcasting, from a node, a request to a plurality of neighboring nodes, the request triggering the plurality of neighboring nodes to contend for access to a medium to transmit information; receiving, in the node, a priority value from each of the plurality of neighboring nodes; determining if the node is a winning node from among the neighboring nodes based on the received priority values and a priority value of the node; granting access to the medium to the node if it is the winning node; and performing an action in the physical world in response to data transmitted from the node if it is the winning node. The node and each of the plurality of neighboring nodes includes at least one sensor. The priority values of the node and of the plurality of neighboring nodes are assigned based on readings of the at least one sensors.