Abstract: The invention provides a device and a method for classification of static and dynamic black-and-white images K pixels by L pixels based on using AI maps calculated for each image of a training set of images. Each AI map is a K by L matrix where each cell of the matrix contains a number equal to the distance from the pixel corresponding to this cell to the pixel's nearest black pixel in the image. In case of recognition of a moving person, an image is composed of N frames (considered as a single image) of a video recorded while the person makes 2 steps and the video recording rate (the number of frames recorded per second) is proportional to the speed of the person.

Abstract: The invention provides a device and a method for classification of static and dynamic black-and-white images K pixel by L pixels based on using AI maps calculated for each image of a training set of images. Each AI map is a K by L matrix where each cell of the matrix contains a number equal to the distance from the pixel corresponding to this cell to the pixel's nearest black pixel in the image. In case of recognition of a moving person, an image is composed of N frames (considered as a single image) of a video recorded while the person makes 2 steps and the video recording rate (the number of frames recorded per second) is proportional to the speed of the person.

Abstract: The invention provides, among other things: methods, systems, machine readable programs and associated graphical user interfaces for identifying a financial instrument and a time interval associated therewith. The financial instrument has a first set of data associated therewith, which includes a plurality of values. The values may include a first value associated with a high value for the financial instrument during the time interval and a second value associated with a low value for the financial instrument during the time interval. The values may further include a third value associated with an opening value for the financial instrument during the time interval and a fourth value associated with a closing value for the financial instrument during the time interval. The time interval is then analyzed to determine if it includes a spike or other anomaly based upon the first set of data.

Abstract: A method for analyzing financial data generated in an exchange in communication with a client/server network. The method includes the steps of receiving a first set of data related to a financial instrument on the exchange, the first set of data being within a time interval and including: a high value for the financial instrument during the time interval; a low value for the financial instrument during the time interval; an opening value for the financial instrument during the time interval; and a closing value for the financial instrument during the time interval. The method also detects a spike in the time interval using a confidence value based upon the first set of data and displays a graph of a set of transactions of the financial instrument, the graph being scaled to prevent the spike from substantially affecting visual information relating to the set of transactions.

Abstract: The invention provides a device and a method for frequent verifications of the identity of a user performed during a long session of client-server communication by secure exchange of keys between the client and the server. The device is a computer mouse with embedded camera and embedded microphone. The camera is used to make pictures of a user's palm; the microphone is used to register a sound of user's pulse. The method has zero privacy leakage because the user is represented at the server by an array of random numbers, which have nothing to do with his biometric data. The security of the system is difficult to break because the exchange keys are different on each request/response.

Abstract: The invention provides a method for frequent verifications of the identity of a user performed during a long session of client-server communication by secure exchange of keys between the client and the server. A user is represented at the server by a set of random numbers that have nothing to do with his biometric data. The server initiates authentication requests by sending encoded randomly generated permutation to the client. On each request, the client creates a dynamic response key built by using the decoded permutation and biometric data of the user so that this biometric data cannot be retrieved from the key. The key also includes the correlation coefficient between the sound of the user's breathing and the distance between the most outer sides of the wings of his nose and the correlation coefficient between the area of the user's pupil and the brightness of his computer screen.

Abstract: The invention provides: methods, languages, and systems for parallel algorithmic trading of financial instruments. Each instrument of interest is included in a parallel list, in a reference list, or in both lists. Market data messages are decoded by parallel threads and converted into data series. The number of the threads is preferably equal to the number of the messages in a set of messages. A trader/market regulator selects or creates a trading/overseeing algorithm consisting of expressions based on data series extracted from the messages and on predefined functions. Some of the expressions have outputs representing buy/sell/cancel orders or have outputs aimed for overseeing trading activity. The algorithm is executed by parallel threads. The number of the threads is preferably equal to the number of the instruments in the parallel list.

Abstract: The invention provides a device and a method for frequent verifications of the identity of a user performed during a long session of client-server communication by secure exchange of keys between the client and the server. The device is a computer mouse with embedded camera and embedded microphone. The camera is used to make pictures of a user's palm; the microphone is used to register a sound of user's pulse. The method has zero privacy leakage because the user is represented at the server by an array of random numbers, which have nothing to do with his biometric data. The security of the system is difficult to break because the exchange keys are different on each request/response.

Abstract: The invention provides a method for frequent verifications of the identity of a user performed during a long session of client-server communication by secure exchange of keys between the client and the server. A user is represented at the server by a set of random numbers that have nothing to do with his biometric data. The server initiates authentication requests by sending encoded randomly generated permutation to the client. On each request, the client creates a dynamic response key built by using the decoded permutation and biometric data of the user so that this biometric data cannot be retrieved from the key. The key also includes the correlation coefficient between the sound of the user's breathing and the distance between the most outer sides of the wings of his nose and the correlation coefficient between the area of the user's pupil and the brightness of his computer screen.

Abstract: The invention provides constructions of an energy analyzer with entrance angles slightly greater than ?/2. The analyzer is capable of collecting electrons in 2? azimuth directions, has a high energy resolution, and a large entrance solid angle. The analyzer is compatible with transmission electron microscopy and other surface analysis techniques.

Abstract: The invention provides a method for detection of a moving object when signal-to-noise ratio is low. A field of view is presented as a regularly updated frame of data points. A state of the object is defined by an “azimuth-speed” pair (i.e., a hypothesis). On each update, a detection system performs two steps. At the first step, the brightness of data points of a new frame is replaced by the average brightness of points surrounding this point. At the second step, the brightness of data points of this frame is being accumulated separately for each hypothesis. On each update, one of hypotheses produces the accumulated frame with the brightest point. This hypothesis is considered the best; its frame is displayed on a screen. The object is detected when the best hypothesis stabilizes in a sequence of updates and the movement of the brightest point becomes consistent with this hypothesis.

Abstract: The invention provides a method for obtaining the object-plane field without a pure theoretical estimation or a direct experimental measurement of a point spread function (PSF) of an imaging system. Instead, at least two image-plane fields have to be recorded. It is essential that the resolutions of the system producing the images have to be quite different from each other. Although both PSFs of the system are unknown, the recording conditions have to be chosen so that the second PSF could be expressed via the first PSF. Two integral equations—(1) a convolution of the object-plane field with the first PSF and (2) a convolution of the object-plane field with the second PSF (expressed via the first PSF)—can be reduced to one functional equation in the Fourier space. The reverse Fourier transform of the solution of this equation is the object-plane field.

Abstract: The invention provides a method for obtaining the object-plane field without a pure theoretical estimation or a direct experimental measurement of a point spread function (PSF) of an imaging system. Instead, at least two image-plane fields have to be recorded. It is essential that the resolutions of the system producing the images have to be quite different from each other. Although both PSFs of the system are unknown, the recording conditions have to be chosen so that the second PSF could be expressed via the first PSF. Two integral equations—(1) a convolution of the object-plane field with the first PSF and (2) a convolution of the object-plane field with the second PSF (expressed via the first PSF)—can be reduced to one functional equation in the Fourier space. The reverse Fourier transform of the solution of this equation is the object-plane field.

Abstract: The invention provides a method for detection of a moving object when signal-to-noise ratio is low. A field of view is presented as a regularly updated frame of data points. A state of the object is defined by an “azimuth—speed” pair (i.e., a hypothesis). On each update, a detection system performs two steps. At the first step, the brightness of data points of a new frame is replaced by the average brightness of points surrounding this point. At the second step, the brightness of data points of this frame is being accumulated separately for each hypothesis. On each update, one of hypotheses produces the accumulated frame with the brightest point. This hypothesis is considered the best; its frame is displayed on a screen. The object is detected when the best hypothesis stabilizes in a sequence of updates and the movement of the brightest point becomes consistent with this hypothesis.

Abstract: The invention provides: methods, languages, and systems for parallel algorithmic trading of financial instruments. Each instrument of interest is included in a parallel list, in a reference list, or in both lists. Market data messages are decoded by parallel threads and converted into data series. The number of the threads is preferably equal to the number of the messages in a set of messages. A trader/market regulator selects or creates a trading/overseeing algorithm consisting of expressions based on data series extracted from the messages and on predefined functions. Some of the expressions have outputs representing buy/sell/cancel orders or have outputs aimed for overseeing trading activity. The algorithm is executed by parallel threads. The number of the threads is preferably equal to the number of the instruments in the parallel list.

Abstract: Sampling and transforming (“twisting”) of biometric data are performed at client based on information known at client only. Twisting includes shuffling the arrays of biometric data and may include changing of values in these arrays. Twisted biometric data are submitted to server. Amount of information contained in twisted data is enough to verify and/or identify the client using proposed correlation procedure, however, is not enough to restore the client's real biometrical data in case of interception of submitted data and in case of compromising security of server. As a result the privacy of the client is guaranteed in the highest degree.

Abstract: A method of secure biometric authentication is disclosed that shuffles arrays of biometric data in a sequence determined by user's secret input. The user is authenticated by comparing arrays of biometric data shuffled on the client side with the arrays of biometric data stored on the server side and shuffled in the very same sequence. Additional layer of security is provided by second shuffling in accordance with a number generated on the server and transmitted to the client after encoding with the user's public key/string retained on the server during enrollment. Real biometric data and sequences of shuffling are neither stored not transmitted anywhere; therefore, the privacy of the user is guaranteed. Security of the data transmitted to the server is not relevant because an attacker does not know the user's private key which is repeatedly recreated on the client from the real biometric data of the user.

Abstract: The invention provides, among other things: methods, systems, machine readable programs and associated graphical user interfaces for identifying a financial instrument and a time interval associated therewith. The financial instrument has a first set of data associated therewith, which includes a plurality of values. The values may include a first value associated with a high value for the financial instrument during the time interval and a second value associated with a low value for the financial instrument during the time interval. The values may further include a third value associated with an opening value for the financial instrument during the time interval and a fourth value associated with a closing value for the financial instrument during the time interval. The time interval is then analyzed to determine if it includes a spike or other anomaly based upon the first set of data.

Abstract: A method of secure biometric authentication is disclosed that shuffles the arrays of biometric data in the sequence determined by user's secret input. The shuffled biometric is used to authenticate the user by comparison against the biometric stored at server and shuffled in the very same sequence. Additional layer of security is provided by second shuffling in accordance with a number generated on the server and transmitted to the client after encoding with the user's public key/string. Real biometric and sequences of shuffling are neither stored not transmitted anywhere; therefore, the privacy of the user is guarantied. Security of the data transmitted to the server is not relevant because an attacker does not know the user's private key which is repeatedly recreated on the client from the real biometric of the user.

Abstract: Sampling and transforming (“twisting”) of biometric data are performed at client based on information known at client only. Twisting includes shuffling the arrays of biometric data and may include changing of values in these arrays. Twisted biometric data are submitted to server. Amount of information contained in twisted data is enough to verify and/or identify the client using proposed correlation procedure, however, is not enough to restore the client's real biometrical data in case of interception of submitted data and in case of compromising security of server. As a result the privacy of the client is guaranteed in the highest degree.