A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

A method and system are directed to protecting hardware IP, particularly of ASIC designs. Programmability is introduced into an ASIC design to increase the difficulty of formulating ASIC designs as Boolean Satisfiability (SAT) problems. Fine-grain redaction of security-critical information from a design is employed by removing high-entropy logic blocks and subsequently inserting programmable components in place of the redacted portion to hide the actual design intent.

An information processing apparatus according to an aspect of the present invention includes an information processing circuit configured to generate a finite state machine based on a predetermined matching condition with respect to sequence data of an event that is input to the information processing apparatus; to process the sequence data so as to substantially remove data that does not match the matching condition from the sequence data; and to output the processed sequence data.

A logic circuit for biometric authentication based on learning parity with noise. The logic circuit includes a sensor. The sensor is configured to acquire a biometric signal. The logic circuit is configured to generate a response signal from the biometric signal by implementing a finite state machine (FSM).

A vehicle can traverse an environment along a first region and detect an obstacle impeding progress of the vehicle. The vehicle can determine a second region that is adjacent to the first region and associated with a direction of travel opposite the first region. The vehicle can use a state machine to determine an action (e.g., an oncoming action) to utilize the second region to overtake the obstacle. By comparing a cost to a cost threshold and/or to a cost associated with another action (e.g., a “stay in lane” action), the vehicle, using the state machine, can determine a target trajectory that traverses through the second region and can traverse the environment based on the target trajectory to avoid, for example, the obstacle in the environment while maintaining a safe distance from the obstacle and/or other entities in the environment.

A runtime environment for execution of an event driven control program for a distributed control system including one or multiple computing resources, wherein the control program includes at least two function blocks. The runtime environment includes for each computing resource an event executor which is configured for execution of sets of events and respective associated data on the respective computing resource. And wherein the runtime environment includes for each function block a memory resource, which memory resource is configured to: store a set of events and associated data for each function block if the data is produced by the function block; and/or store a reference to a set of events and associated data for each function block if the data is consumed by the function block.

An example system includes a processor to receive a valid instance of a finite regular expression format. The processor is to generate a state machine corresponding to the finite regular expression format. The processor is to recursively compute a number of matched strings for each state and transition in the generated state machine. The processor is to recursively rank the valid instance of the finite regular expression format using the generated state machine with the computed numbers of matched strings. The processor is to output a number rank for the valid instance of the finite regular expression format.

A computer-implemented method and distributed system for maintaining consistency of client applications on a plurality of server nodes may comprise providing a first and second versions of a distributed coordination engine (DConE). The first version of the DConE may receive proposals, reach agreements thereon and generate a first ordering of agreements that specifies an order in which the client applications are to execute the agreed-upon proposals and correspondingly update their respective states. A ChangeVersion proposal may then be processed by the first version of the DConE, whereupon the first version of the DConE may stop reaching any further agreements. A second version of the DConE may then take over reaching agreements on the proposals and generate a second ordering of agreements, beginning with the agreed-upon ChangeVersion proposal. Any agreed-upon proposal, received from the first version of the DConE after the agreed-upon ChangeVersion proposal, may be sent back to the second version of the DConE to enable the second version of the DConE to reach agreement thereon.

Methods, systems and computer program products are provided for asynchronous processing of transaction log requests in a database transaction log service. A scalable log service may continuously process log requests. Log request processing may be paused and resumed without reducing log service processing capabilities. Log service threads executing a request that pauses may proceed to process other tasks in the same request or tasks for other new or partially processed requests. Any of multiple log service threads may resume processing of a paused request. Requests may be paused by preserving an execution state and deferring the request from a work queue to a deferral queue. Resumed requests may shift from a deferral queue to a work queue following a wait point.

A deployment manager includes storage for storing a state repository including a state transitions associated with event descriptions generated by a computing device and a computing device manager. The computing device manager obtains a new event description associated with the computing device, and a workload performed by the computing device; in response to obtaining the new event description: matches the new event description to a state transition of the state transitions; and manages the workload based on a predicted next state associated with the state transition.