Abstract: The present disclosure relates generally to techniques for limiting and tracking queries in a data sharing environment such as a data cleanroom. A shared tokening may provide owner account control over sharing to client accounts within the data sharing environment.

Abstract: A system allows the identification and protection of sensitive data in a multiple ways, which can be combined for different workflows, data situations or use cases. The system scans datasets to identify sensitive data or identifying datasets, and to enable the anonymisation of sensitive or identifying datasets by processing that data to produce a safe copy. Furthermore, the system prevents access to a raw dataset. The system enables privacy preserving aggregate queries and computations. The system uses differentially private algorithms to reduce or prevent the risk of identification or disclosure of sensitive information. The system scales to big data and is implemented in a way that supports parallel execution on a distributed compute cluster.

Abstract: A system allows the identification and protection of sensitive data in a multiple ways, which can be combined for different workflows, data situations or use cases. The system scans datasets to identify sensitive data or identifying datasets, and to enable the anonymisation of sensitive or identifying datasets by processing that data to produce a safe copy. Furthermore, the system prevents access to a raw dataset. The system enables privacy preserving aggregate queries and computations. The system uses differentially private algorithms to reduce or prevent the risk of identification or disclosure of sensitive information. The system scales to big data and is implemented in a way that supports parallel execution on a distributed compute cluster.

Abstract: A non-transitory computer readable medium includes instructions that, when executed by one or more processors, cause the one or more processors to receive, from a requesting account, a selection of one or more data sets that are indicated as sharable and requestor information. The instructions, when executed, also cause the one or more processors to generate a sharing request for the one or more data sets, validate the sharing request based on restrictions for the one or more data sets, apply requestor-specific restrictions to a subset of the one or more data sets to generate a modified subset of the one or more data sets, and send the modified subset of the one or more data sets to the requesting account.

Abstract: The present systems and methods allow for rapid processing of large volumes of events. A producer node in a cluster determines a sharding key for a received event from an event stream. The producer node uses a sharding map to correlate the sharding key for the event with a producer channel, and provides the event to a producer event buffer associated with the producer channel. The producer event buffer transmits the event to a corresponding consumer event buffer associated with a consumer channel on a consumer node. The event processing leverages a paired relationship between producer channels on the producer node and consumer channels on the consumer node, so as to generate enhanced throughput. The event processing also supports dynamic rebalancing of the system in response to adding or removing producer or consumer nodes, or adding or removing producer or consumer channels to or from producer or consumer nodes.

Abstract: A system allows the identification and protection of sensitive data in a multiple ways, which can be combined for different workflows, data situations or use cases. The system scans datasets to identify sensitive data or identifying datasets, and to enable the anonymisation of sensitive or identifying datasets by processing that data to produce a safe copy. Furthermore, the system prevents access to a raw dataset. The system enables privacy preserving aggregate queries and computations. The system uses differentially private algorithms to reduce or prevent the risk of identification or disclosure of sensitive information. The system scales to big data and is implemented in a way that supports parallel execution on a distributed compute cluster.

Abstract: The present systems and methods allow for rapid processing of large volumes of events. A producer node in a cluster determines a sharding key for a received event from an event stream. The producer node uses a sharding map to correlate the sharding key for the event with a producer channel, and provides the event to a producer event buffer associated with the producer channel. The producer event buffer transmits the event to a corresponding consumer event buffer associated with a consumer channel on a consumer node. The event processing leverages a paired relationship between producer channels on the producer node and consumer channels on the consumer node, so as to generate enhanced throughput. The event processing also supports dynamic rebalancing of the system in response to adding or removing producer or consumer nodes, or adding or removing producer or consumer channels to or from producer or consumer nodes.

Abstract: The present systems and methods allow for rapid processing of large volumes of events. A producer node in a cluster determines a sharding key for a received event from an event stream. The producer node uses a sharding map to correlate the sharding key for the event with a producer channel, and provides the event to a producer event buffer associated with the producer channel. The producer event buffer transmits the event to a corresponding consumer event buffer associated with a consumer channel on a consumer node. The event processing leverages a paired relationship between producer channels on the producer node and consumer channels on the consumer node, so as to generate enhanced throughput. The event processing also supports dynamic rebalancing of the system in response to adding or removing producer or consumer nodes, or adding or removing producer or consumer channels to or from producer or consumer nodes.

Abstract: The present systems and methods allow for rapid processing of large volumes of events. A producer node in a cluster determines a sharding key for a received event from an event stream. The producer node uses a sharding map to correlate the sharding key for the event with a producer channel, and provides the event to a producer event buffer associated with the producer channel. The producer event buffer transmits the event to a corresponding consumer event buffer associated with a consumer channel on a consumer node. The event processing leverages a paired relationship between producer channels on the producer node and consumer channels on the consumer node, so as to generate enhanced throughput. The event processing also supports dynamic rebalancing of the system in response to adding or removing producer or consumer nodes, or adding or removing producer or consumer channels to or from producer or consumer nodes.

Abstract: Methods of storing data records produced from monitoring interactions between external agents and a system are described. The method defines specific interactions that occur between the external agents and the system as events of interest. A chain of interactions occurring during respective interaction sessions between a respective external agent and the system are monitored and events of interest occurring in the chain are determined. Data records from the monitored chain are produced, the respective data record including data identifying determined events of interest and data associated therewith. A profile identity, representative of the external agent, is assigned to each data record produced during an interaction session. Data records of individual events of interest are stored in a way ordered according to the type of event of interest and data records of events of interest occurring during an interaction session are stored in a way ordered according to assigned profile identity.

Abstract: A vibration protection and condition monitoring system with true digital signal processing based design, with very limited analog based general signal conditioning and integrated specific sensor conditioning and sensor power supply options. In addition to the support for common Eddy Current Probe Systems (employing an external Driver), the device also supports direct connection of the Eddy Current Probe to the module, due to an built-in driver and linearization functionality. The system is a distributed system where the vibration protection and at least a part of the condition monitoring is in an intrinsically safe (IS) distributed unit located on or at the rotating machinery, even in hazardous areas.

Abstract: The present invention relates to a method of storing data records produced from monitoring interactions between external agents and a system. The method comprises defining specific interactions that can occur between the external agents and the system as potential events of interest. A chain of interactions occurring during respective interaction sessions between a respective external agent and the system are monitored and potential events of interest occurring in the said chain are determined. Data records from the monitored chain of interactions are produced, the respective data record including data identifying determined potential events of interest and data associated therewith. A profile identity, representative of the external agent, is assigned to each data record produced during a said interaction session.

Abstract: A vibration protection and condition monitoring system with true digital signal processing based design, with very limited analog based general signal conditioning and integrated specific sensor conditioning and sensor power supply options. In addition to the support for common Eddy Current Probe Systems (employing an external Driver), the device also supports direct connection of the Eddy Current Probe to the module, due to an built-in driver and linearization functionality. The system is a distributed system where the vibration protection and at least a part of the condition monitoring is in an intrinsically safe (IS) distributed unit located on or at the rotating machinery, even in hazardous areas.

Abstract: A parallel or computing system and method make use of a plurality of adapters each affording a specific type of processing algorithm. At each point in an application, an adapter is identified, to parallelize that portion of the application. The process involves associating an appropriate adapter with the application portion, parsing the application portion to define tasks that may be distributed over the available computers. Combined with the parallelized program is a software server that is designed to cooperate with the adapters to control and supervise distributed processing functions. Such functions include mapping, load balancing, and error detection and correction. Also included are functions that cause the results of the computing to be coordinated in real-time and returned appropriately, according to the application.

Abstract: An approach is described for developing software that executes rules, such as business rules. A group of rule templates defines a rule structure for rules that may be executed by a rules engine. Separate ruleflow templates define tasks that entail the execution of rules. Each of the ruleflow templates associates a task with the group of rule templates. Because the ruleflow templates define the association between the tasks and the group of rule templates, during execution of the tasks a rules engine executes rules defined by the group of templates. User interfaces are automatically generated based on the group of rule templates. A user may interact with the user interfaces to edit the rules defined by the group of templates. After editing the rules, executing the tasks associated with the group of templates will cause execution of the modified rules.

Abstract: A parallel or computing system and method make use of a plurality of adapters each affording a specific type of processing algorithm. At each point in an application, an adapter is identified, to parallelize that portion of the application. The process involves associating an appropriate adapter with the application portion, parsing the application portion to define tasks that may be distributed over the available computers. Combined with the parallelized program is a software server that is designed to cooperate with the adapters to control and supervise distributed processing functions. Such functions include mapping, load balancing, and error detection and correction. Also included are functions that cause the results of the computing to be coordinated in real-time and returned appropriately, according to the application.

Abstract: A novel approach for generating and updating rules allows non-technical users to create and modify rules. A rules generation system includes a rules engineer interface, user interfaces and a rules generator. The rules engineer interface is an interface through which a rules engineer, such as rules engineer, may generate templates. Templates contain data that define rule “templates” that in turn specify a rule structure, rule elements that may be chosen by a user, and rule elements that may not be chosen by user. Templates may also define a set of choices, for example values, that user may choose for those rule elements. Templates may also be used to generate user interfaces. The user interfaces guide a user to create or edit rules.

Abstract: An approach is described for developing software that executes rules, such as business rules. A group of rule templates defines a rule structure for rules that may be executed by a rules engine. Separate ruleflow templates define tasks that entail the execution of rules. Each of the ruleflow templates associates a task with the group of rule templates. Because the ruleflow templates define the association between the tasks and the group of rule templates, during execution of the tasks a rules engine executes rules defined by the group of templates. User interfaces are automatically generated based on the group of rule templates. A user may interact with the user interfaces to edit the rules defined by the group of templates. After editing the rules, executing the tasks associated with the group of templates will cause execution of the modified rules.

Abstract: A parallel or computing system and method make use of a plurality of adapters each affording a specific type of processing algorithm. At each point in an application, an adapter is identified, to parallelize that portion of the application. The process involves associating an appropriate adapter with the application portion, parsing the application portion to define tasks that may be distributed over the available computers. Combined with the parallelized program is a software server that is designed to cooperate with the adapters to control and supervise distributed processing functions. Such functions include mapping, load balancing, and error detection and correction. Also included are functions that cause the results of the computing to be coordinated in real-time and returned appropriately, according to the application.

Abstract: A method and apparatus for automatically planing a flitch. The method of the invention comprises measuring the distance between the top and bottom surfaces of the flitch at a plurality of longitudinally spaced locations, calculating a planing operation of the flitch based upon the plurality of distance measurements; and then planing the flitch according to the calculation. In a preferred embodiment, the measurements are taken by a bank of photodetectors in combination with a computer (microprocessor). The calculation is done by the microprocessor.