56 results about "Determinism" patented technology

A method and apparatus for representing complex data schemas and generating type validated output documents in a markup language. The methods apply to transforming document type definitions into extensible markup language coded information that can readily accommodate logical constraints imposed by recursion or repetition within the DTD structure. Furthermore, non-determinism arising from repetition or recursion in a data schema is resolved by traversal path coding using a matrix representation of the data schema.

A flexible blockchain smart-contract deployment design supporting both selective on-chain deployment and remote deployment with verified determinism and other valuable blockchain properties.

The disclosed embodiments relate to implementation of a trading system, which may also be referred to as a trading system architecture, having improved performance which further assures transactional determinism under increasing processing transaction loads while providing improved trading opportunities, fault tolerance, low latency processing, high volume capacity, risk mitigation and market protections with minimal impact, as well as improved and equitable access to information and opportunities.

Methods and systems described herein perform a secure transaction. A display presents images that are difficult for malware to recognize but a person can recognize. In at least one embodiment, a person communicates transaction information using visual images received from the service provider system. In at least one embodiment, a universal identifier is represented by images recognizable by a person, but difficult for malware to recognize.In some embodiments, methods and systems are provided for determining whether to grant access, by generating and displaying visual images on a screen that the user can recognize. In an embodiment, a person presses one's finger(s) on the screen to select images as a method for authenticating and protecting communication from malware.In at least one embodiment, quantum randomness helps unpredictably vary the image location, generate noise in the image, or change the shape or texture of the image.

The disclosed embodiments relate to implementation of a trading system, which may also be referred to as a trading system architecture, having improved performance which further assures transactional determinism under increasing processing transaction loads while providing improved trading opportunities, fault tolerance, low latency processing, high volume capacity, risk mitigation and market protections with minimal impact, as well as improved and equitable access to information and opportunities.

The present application relates to techniques for handling the execution of a computer software program comprising a plurality of distinct program components. In particular, the application describes techniques relating to the interaction between distinct components of a computer program and seeks to allow program components to execute with a high degree of determinism. An execution environment is described which is operable such that the execution of one or more components of a computer program is carried out in a plurality of sequential frames of execution, wherein the execution environment is further operable to: i) allow communication between one said component and another said component in different frames of execution; andii) to prevent communication between one said component and another said component in the same frame of execution. A debugger which utilizes the execution environment is also described.

In an embodiment, a secure module is provided that provides access keys to an unsecured system. In an embodiment, the secure module may generate passcodes and supply the passcodes to the unsecured system. In an embodiment, the access keys are sent to the unsecured system after the receiving the passcode from the unsecured system. In an embodiment, after authenticating the passcode, the secure module does not store the passcode in its memory. In an embodiment, the unsecured module requires the access key to execute a set of instructions or another entity. In an embodiment, the unsecured system does not store access keys. In an embodiment, the unsecured system erases the access key once the unsecured system no longer requires the access key. In an embodiment, the unsecured system receives a new passcode to replace the stored passcode after using the stored passcode. In an embodiments, a registration code is generated using non-determinism. In an embodiments, a key is generated using non-determinism. Each of these embodiments may be used separately.

A system and method for detecting and / or preventing execution problems caused by user-supplied code modules that are called by steps of a test executive sequence. The test executive sequence may include a plurality of test executive steps. At least a subset of the steps may be configured to call user-supplied code modules. The test executive sequence may be executed on a host computer under control of a test executive engine. For each step that calls a user-supplied code module, the test executive engine may perform certain actions to detect and / or prevent execution problems caused by the user-supplied code module. For example, the test executive engine may be operable to automatically detect stack corruption caused by the user-supplied code module, may be operable to utilize stack safety buffers to avoid stack corruption problems caused by the user-supplied code module, and / or may include features for aiding a user in determining whether the user-supplied code module contains an uninitialized local variable.

The disclosed embodiments relate to implementation of a trading system, which may also be referred to as a trading system architecture, having improved performance which further assures transactional determinism under increasing processing transaction loads while providing improved trading opportunities, fault tolerance, low latency processing, high volume capacity, risk mitigation and market protections with minimal impact, as well as improved and equitable access to information and opportunities.

A system and method for detecting and / or preventing execution problems caused by user-supplied code modules that are called by steps of a test executive sequence. The test executive sequence may include a plurality of test executive steps. At least a subset of the steps may be configured to call user-supplied code modules. The test executive sequence may be executed on a host computer under control of a test executive engine. For each step that calls a user-supplied code module, the test executive engine may perform certain actions to detect and / or prevent execution problems caused by the user-supplied code module. For example, the test executive engine may be operable to automatically detect stack corruption caused by the user-supplied code module, may be operable to utilize stack safety buffers to avoid stack corruption problems caused by the user-supplied code module, and / or may include features for aiding a user in determining whether the user-supplied code module contains an uninitialized local variable.

One embodiment of the present invention provides a system that verifies whether a trace can be produced by a generator. A generator is defined as a finite state machine with a set of input and output signals. A trace is defined as a sequence of assignments of non-parametric input and output signals of the generator. The generator may contain parametric inputs to model non-determinism. The trace does not contain assignments of the parametric inputs. During operation, the system builds a data structure to determine if there exists a sequence of parametric input assignments that can match the non-parametric inputs and outputs of the generator with the ones specified in the trace.

One embodiment of the present invention provides a system that verifies whether a trace can be produced by a generator. A generator is defined as a finite state machine with a set of input and output signals. A trace is defined as a sequence of assignments of non-parametric input and output signals of the generator. The generator may contain parametric inputs to model non-determinism. The trace does not contain assignments of the parametric inputs. During operation, the system builds a data structure to determine if there exists a sequence of parametric input assignments that can match the non-parametric inputs and outputs of the generator with the ones specified in the trace.

A multiprocessor computer system which provides fault tolerance includes a number of processing sets. At least one of the processing sets is operable asynchronously of a second processing set. A monitor is connected to receive I / O operations output from the processing sets for identifying faulty operation of those units. The monitor is also operable to synchronise operation of the processing sets by signalling the processing sets on receipt of outputs from those units indicative of a plurality of them being at an equivalent stage of processing. The monitor provides for buffering of I / O operations output from the processing sets and for selective forwarding of those I / O operations to an external I / O bus. The processing set may be formed from a single processor or from multiple processors.

A program with complete conditions for a usable mask yields a unitary mask, each try. One mask pattern is used throughout an image, but may be "tiled". Preferably the program, for given mask position, expresses favorability of several candidate pass numbers as a "neighborhood constraint" in the form of a weight; distills the weights into one weight for each pass number; based on that, chooses a number for the position; and iterates for all positions. Many preferences are very useful, e.g. automatically balancing randomness vs. determinism, and several generalized relative notations. Another invention facet uses an input text file of mask constraints; a program reads constraints from the file, applies them, forms a mask and stores / uses it. Another reprocesses a mask for best image quality, fixing its own imperfections of first-round mask forming.

Deterministic type packet-switching transmission networks are networks in which the different flows of information follow virtual paths defined in advance for which any change requires a reprogramming of the interconnection nodes. The advantage of determinism is that it makes it easier to estimate the maximum delay time that the packets may undergo during their journey in the network. However, it remains to be verified that the network is appropriately sized for the transmission of the different information flows, with the constraints of maximum delay times and of regularity imposed by the connected items of equipment. A method is proposed here for the sizing of the network. In this method, the verification of compliance with these constraints is based on the determining of the jitter components added by the different interconnection nodes of the network, at their different output ports. This determination is done incrementally, in descending along the virtual paths travelled through by the different information flows.

An abnormality detection apparatus for a periodic driving system includes a detection unit; a data obtaining unit for time series data from the detected sound; a determinism derivation unit configured to derive a plurality of values representing determinism providing an indicator of whether the time series data is deterministic or stochastic or a plurality of intermediate variations in a calculation process of the values representing determinism at a predetermined interval from the time series data; a probability distribution calculation unit. The abnormality detection apparatus further includes a determination unit configured to determine existence or non-existence of abnormality in the periodic driving system based on the probability distribution of the values representing determinism or the intermediate variations.

A system and method for automatically improving performance of a first graphical program that performs one or more repetitive operations, e.g., in a loop. The first graphical program may be programmatically analyzed and may be programmatically modified based on the analysis. Programmatically modifying the first graphical program may include programmatically modifying the one or more repetitive operations or the loop performed by the first graphical program, where the modification results in improved performance. In one embodiment, the performance of the first graphical program may be improved by increasing deterministic behavior. For example, deterministic behavior may be especially important for a real-time or time critical application. In one embodiment, determinism may be increased by removing functionality from the first graphical program which causes time latency problems. In one embodiment, one or more additional graphical programs may be programmatically generated to perform the functionality previously performed by the first graphical program, where the one or more additional graphical programs execute simultaneously with the first graphical program.

The disclosed embodiments relate to implementation of a trading system, which may also be referred to as a trading system architecture, having improved performance which further assures transactional determinism under increasing processing transaction loads while providing improved trading opportunities, fault tolerance, low latency processing, high volume capacity, risk mitigation and market protections with minimal impact, as well as improved and equitable access to information and opportunities.

A data transaction processing system including multiple transaction processors also includes an active transaction receiver that sequences all incoming messages from various sources to facilitate transactional determinism, as well as a results arbiter to efficiently decide which transaction processor result to choose as the correct output. The data transaction processing system minimizes overall latency by optimizing which transaction processors and results arbiters are responsive to specific client computer input requests or messages.

A data transaction processing system including multiple transaction processors also includes an active transaction receiver that sequences all incoming messages from various sources to facilitate transactional determinism, as well as a results arbiter to efficiently decide which transaction processor result to choose as the correct output. The data transaction processing system minimizes overall latency by optimizing which transaction processors and results arbiters are responsive to specific client computer input requests or messages.

A method of staggering lanes in a peripheral component interconnect express (PCI-Express) port is described herein. The method includes initiating the port to enter or exit an electrical idle state. The method also includes forwarding a token to a predetermined lane of the port. Additionally, the method includes turning the predetermined lane ON or OFF by indication to an analog circuit interface. The method also includes forwarding the token to a neighboring lane when a staggering interval timer elapses.

A method for routing virtual links in a frame switching network including a plurality of source terminals and / or destination of the frames, frame switches being connected together through physical connections, each virtual link being defined, for a point-to-point type, by a path through the network between a source terminal and a destination terminal and, for a multipoint type, by a plurality of paths through the network between a source terminal and a plurality of destination terminals. The method carries out routing of the links while observing a segregation constraint with regard to triplets of consecutive switches belonging to the oriented loops, so as to allow verification of determinism of the network.

In an embodiment, a secure module is provided that provides access keys to an unsecured system. In an embodiment, the secure module may generate passcodes and supply the passcodes to the unsecured system. In an embodiment, the access keys are sent to the unsecured system after the receiving the passcode from the unsecured system. In an embodiment, after authenticating the passcode, the secure module does not store the passcode in its memory. In an embodiment, the unsecured module requires the access key to execute a set of instructions or another entity. In an embodiment, the unsecured system does not store access keys. In an embodiment, the unsecured system erases the access key once the unsecured system no longer requires the access key. In an embodiment, the unsecured system receives a new passcode to replace the stored passcode after using the stored passcode. In an embodiments, a registration code is generated using non-determinism. In an embodiments, a key is generated using non-determinism. Each of these embodiments may be used separately.

A discussion of improving integrated device deterministic response to test vectors. For example, limiting the transmission delay for an integrated device's response within known bounds by synchronizing an initialization training sequence to a reset deassertion. Specifically, the proposal facilitates response determinism from the DUT by synchronizing training sequences and subsequently synchronizing flit transmission to reset assertion as sampled by reference clock.

The disclosed embodiments relate to implementation of a trading system, which may also be referred to as a trading system architecture, having improved performance which further assures transactional determinism under increasing processing transaction loads while providing improved trading opportunities, fault tolerance, low latency processing, high volume capacity, risk mitigation and market protections with minimal impact, as well as improved and equitable access to information and opportunities.

Biological data, such as human heart rate data, is acquired and processed in a non-linear manner to facilitate an assessment of the physiological state of the subject, and / or to assist in predicting incipient disorders or instability. Determinism, laminarity and recurrence measures are derived for a rolling sample of a time series of said data. The recurrence measure can be the Euclidean threshold (εthresh) at a given recurrence rate. A representation, such a colour coded matrix or multi-dimensional vector, is formed from a combination of the derived determinism, laminarity and recurrence measures. The representation can then be analysed to detect indicators of physiological instability, such as arrhythmia, or to discriminate between arrhythmias. The analysis may be performed visually, or in an automated manner in real time, such as in an ambulatory or implanted device, or post hoc by a bedside monitor.

Deterministic type packet-switching transmission networks are networks in which the different flows of information follow virtual paths defined in advance for which any change requires a reprogramming of the interconnection nodes. The advantage of determinism is that it makes it easier to estimate the maximum delay time that the packets may undergo during their journey in the network. However, it remains to be verified that the network is appropriately sized for the transmission of the different information flows, with the constraints of maximum delay times and of regularity imposed by the connected items of equipment. A method is proposed here for the sizing of the network. In this method, the verification of compliance with these constraints is based on the determining of the jitter components added by the different interconnection nodes of the network, at their different output ports. This determination is done incrementally, in descending along the virtual paths travelled through by the different information flows.