293 results about "X-Coordinate" patented technology

The present invention takes advantage of a quadratic-only ambiguity for x-coordinates in elliptic curve algebra as a means for encrypting plaintext directly onto elliptic curves. The encrypting of plaintext directly onto elliptic curves is referred to herein as "direct embedding". When performing direct embedding, actual plaintext is embedded as a "+" or "-" x-coordinate. The sender specifies using an extra bit whether + or - is used so that the receiver can decrypt appropriately. In operation their are two public initial x-coordinates such that two points P1+ and P1- lie respectively on two curves E+ and E-. A parcel of text xtext is selected that is no more than q bits in length. The curve (E+ or E-) that contains xtext is determined. A random number r is chosen and used to generate a coordinate xq using the public key of a receiving party. An elliptic add operation is used with the coordinate xq and the parcel of text to generated a message coordinate xm. A clue xc is generated using the random number and the point P from the appropriate curve E±. The sign that holds for xtext is determined and called g. The message coordinate xm, the clue xc, and the sign g are sent as a triple to the receiving party. The receiving party uses the clue xc and its private key to generate coordinate xq. Using the sign g and coordinate xq, the text can be recovered.

A wheelchair having a speed and direction control touchpad. The touchpad comprises two separated semi-conductive film layers, one measuring an X coordinate and one measuring a Y coordinate. When pressure is applied to the layers bringing them into contact with each other, an X, Y coordinate location is produced and the wheelchair is moved in a direction and speed analagous to the location of the pressure applied to the touchpad. A change in location of the pressure will result in a corresponding change in direction and speed. The touchpad also has a neutral or no movement activation point.

Some embodiments implement a linear switching application that provides functionality for switching between different windows based on an x-axis ordering of the windows instead of the z-axis or other ordering of prior art. The linear switching application identifies an array of currently open windows and sorts the array based on the leftmost x-coordinate position of the windows in the array. Optionally, the linear switching application modifies the GUI to display window identifiers based on the leftmost x-coordinate position of each window to orient the user to the x-coordinate position of each of the windows on-screen. The application determines an index in the current x-sorted array for the window that is currently frontmost and changes the frontmost window based on the current frontmost window and a directional input provided by the user.

Voting of coordinates of each pixel in a photographic image onto a Hough space corresponding to annuluses is performed, the Hough space being defined by a coordinate system having an X coordinate axis for a circle center point, a Y coordinate axis for a circle center point, and an r coordinate axis for a radial direction. A vote value of each voting position having coordinates (X, Y, r) on the Hough space is acquired as a first integrated vote value from a calculation of a number of votes given to each voting position. A position represented by (X, Y) coordinate values of a voting position associated with the largest first integrated vote value is detected as the position of the center point of the circular pattern.

An illuminating device includes a light source (101) and an optical element including a light receiving surface (203), first and second light exit surfaces (205, 207). When the center of a light emitting surface (201) is designated as P1, a point at the edge of the light emitting surface is designated as P2 and an axis which passes through P1 and is perpendicular to the light emitting surface is designated as an optical axis, the optical element has a hollow around the optical axis with respect to the edge. In a cross section of the optical element, when a point on the first exit surface at which angle of view from P1 with respect to the optical axis is 15 degrees is designated as P3, an intersection of a ray which has been emitted at P2 and travels in parallel to the optical axis and the first light exit surface is designated as P4, and an axis connecting P1 and P2 is designated as x axis, the first light exit surface is formed in such a way that x coordinate of a point which is the most distant from the optical axis on the first light exit surface is 1.5 times or more than x coordinate of P2, that in 80% or more of an area in which x coordinate of a point is equal to or greater than x coordinate of P3, an angle of incidence of light emitted at P1 is equal to or greater than the critical angle and that in 80% or more of an area in which x coordinate of a point is equal to or smaller than x coordinate of P4, an angle of incidence of light emitted at P2 is smaller than the critical angle.

The hash functions using elliptic curve cryptography are hash functions that are produced using both an elliptic curve and a twist of the elliptic curve. Hash points are assigned values that either correspond to points on the elliptic curve or to points on the twist, depending upon whether the scalar value of the corresponding message block produces a quadratic residue or a quadratic non-residue when substituted as the x-value into the elliptic curve equation. The corresponding hash point x-coordinates are concatenated to form the hash bit string. The hash points may be doubled, and the hash functions may be applied to multimedia data by applying a media compression method to the message data before computing the hash points.

Given a set of elliptic curve points defined over a field F(p) and represented in projective coordinate, a method is presented which allows the embedding of data bits in both the X-coordinate and the Z-coordinate of the elliptic curve point when represented in projective coordinate. This makes the number of points that satisfy an elliptic curve equation and which can be used in the corresponding cryptosystem proportional to p² rather than p. This can be used to either increase security by making the bit positions where data bits are embedded known only to the sender and receiver. Alternatively, it can be used to increase the number of data bits that can be encrypted per single elliptic curve point encryption. In another alternative, it can also be used to reduce p. Also, it can be used as a countermeasure by randomizing the bit positions where data bits are embedded. A similar formulation can be developed for elliptic curves over fields F(2^m), as well as special elliptic curves such as Montgomery curves.

A detector for determining a position of at least one object, in particular for 3D-sensing concepts, is disclosed. The detector comprises a longitudinal optical sensor (110) for determining a longitudinal position of an object by a light beam traveling from the object to the detector and a transversal optical detector (112) which may be designed as an imaging device or a position sensitive detector. The longitudinal sensor (110) has at least two PN structures or PIN structures (138, 140). Each of the PN structures or PIN structures is located between two electrode layers (144), thereby forming photodiodes (146) having a longitudinal sensor region (148) each. Longitudinal sensor signals from the photodiodes (146) are, given the same total power of illumination, are dependent on a beam cross-section of the light beam in the longitudinal sensor regions (148). As an alternative, instead of the transversal optical detector (112) the photodiodes (146) of the longitudinal optical sensor (110) may be adapted to operate as one-dimensional position sensitive detectors each, for determining a transversal x-coordinate and a transversal y-coordinate, respectively.

The invention relates to a comprehensive determination method for a coefficient of the roughness of a rock mass structure surface. The comprehensive determination method is suitable for the comprehensive determination on the coefficient of the roughness of the multiple forms of rock mass structure surface. Topography data of the integral rock mass structure surface can be obtained at a time through a three-dimensional laser scanner or a rock mass structure surface topography instrument and accordingly the condition that the measurement result of one line segment cannot represent the roughness of the integral rock mass structure surface previously is changed and the measurement result is objective and real. A typical curve is straightened in the space, an X coordinate and a Y coordinate of every point are changed, a Z coordinate of every point remains unchanged, the representation is performed on the roughness of the three-dimensional rock mass structure surface by a two-dimensional method, the comprehensive analysis is performed by four calculation methods, and accordingly a finally determined coefficient value of the roughness of the rock mass structure surface is accurate. The comprehensive determination method is comprehensive in consideration, simple in calculation and accurate in result.

The method of performing elliptic polynomial cryptography with elliptic polynomial hopping allows for the encryption of messages through elliptic polynomial cryptography, i.e., using elliptic polynomials with multi x-coordinates, and particularly with the utilization of elliptic polynomial hopping based upon both the elliptic polynomial and its twist, regardless of whether the elliptic polynomial and its twist are isomorphic with respect to one another. Each plaintext block is encrypted by a different elliptic polynomial, and the elliptic polynomials used are selected by an initial secret key and a random number generator. The method is particularly useful for symmetric encryption systems, and provides a block cipher fundamentally based upon a computationally hard problem.

A digital signature generation apparatus includes memory to store finite field F_q and section D(u_x(s, t), u_y(s, t), s, t) as secret key, section being one of surfaces of three-dimensional manifold A(x, y, s, t) which is expressed by x-coordinate, y-coordinate, parameter s, and parameter t and is defined on finite field Fq, x-coordinate and y-coordinate of section being expressed by functions of parameter s and parameter t, calculates hash value of message m, generates hash value polynomial by embedding hash value in 1-variable polynomial h(t) defined on finite field F_q, and generates digital signature D_s(U_x(t), U_y(t), t) which is curve on section, the x-coordinate and y-coordinate of curve being expressed by functions of parameter t, by substituting hash value polynomial in parameter s of section.

The invention discloses a robot 3D vision hand-eye calibration method. The method comprises the steps that S1, a posture, relative to robot base coordinates, of a robot flange and a posture, relativeto a 3D sensor coordinate system, of a calibration plate are obtained; S2, a rotation matrix, relative to a robot base coordinate system, of the 3D sensor coordinate system is calculated; S3, multiplecoordinate data of workpiece grasping points in the 3D sensor coordinate system and corresponding multiple coordinate data in the base coordinate system of a robot base are obtained; S4, transformational relations of X coordinate axes, Y coordinate axes and Z coordinate axes of the 3D sensor coordinate system and the robot base coordinate system are calculated. Compared with traditional hand-eyecalibration that only one transformational matrix is used for describing transform from the 3D sensor coordinate system to the robot base coordinate, by means of the robot 3D vision hand-eye calibration method, the transformational relations of positions and postures from a 3D sensor to the robot base coordinates are obtained respectively, compared with the prior art, the method is more flexible,the precision requirements in actual engineering application can be better met, and the hand-eye calibration precision is improved.

Latitudes and longitudes of first and second points on a measured map image are recorded together with an image file. First, a beginning of position information data of the map image is shown. Subsequently, it is shown that information of the first point is started. Subsequently, an X coordinate of the first point on the map image is shown. Subsequently, a Y coordinate of the first point on the map image is shown. Subsequently, the latitude of the first point is shown. Subsequently, the longitude of the first point is shown. Subsequently, it is shown that information of the second point is started. Subsequently, an X coordinate of the second point on the map image is shown. Subsequently, a Y coordinate of the second point on the map image is shown. Subsequently, the latitude of the second point is shown. Subsequently, the longitude of the second point is shown.

A sensing method for a touch panel is disclosed. The touch panel includes a plurality of sensing lines and a plurality of driving lines. The sensing method includes generating an electromagnetic signal or a capacitive signal; forming a plurality of first loops through the plurality of sensing lines to sense X coordinate of the electromagnetic signal on the touch panel and forming a plurality of second loops through the plurality of driving lines to sense Y coordinate of the electromagnetic signal on the touch panel when the electromagnetic signal is generated; sensing X coordinate of the capacitive signal through the plurality of sensing lines and sensing Y coordinate of the capacitive signal through the plurality of driving lines when the capacitive signal is generated.

The cryptographic hash functions using of elliptic polynomial polynomials are based on the elliptic polynomial discrete logarithm problem, which is well known as a computationally hard problem. The hash functions are based on the elliptic polynomial equation in their generation, where different elliptic polynomials are used for different blocks of the same plain text. Particularly, the hash functions use an elliptic polynomial with more than one independent x-coordinate. More specifically, a set of elliptic polynomial points are used that satisfy an elliptic polynomial equation with more than one independent x-coordinate which is defined over a finite field F.

A video processing method includes calculating mean values with respect to x coordinate value and y coordinate value of vertices that define a corresponding area, which is obtained when a designated area in spherical coordinates is projected on an xy coordinate plane that represents a captured image, and superimposing a mask image R on the captured image in such a way as to bring a point G having an x coordinate value and a y coordinate value identical to the calculated mean values with respect to the x coordinate value and the y coordinate value into coincidence with a point defined by a midpoint in the height direction and a midpoint in the width direction of the mask image.

To provide a content delivery system which enables a ciphertext to be reduced in size when using the ElGamal cipher. A content delivery device performs elliptic curve encryption on a content key, generates an encrypted content key that includes an x coordinate of an elliptic curve point obtained by the elliptic curve encryption, and outputs the encrypted content key. A content reception device receives the encrypted content key, and calculates a y coordinate of the elliptic curve point using the x coordinate included in the encrypted content key. The content reception device then performs elliptic curve decryption using the elliptic curve point and other information included in the encrypted content key, to generate a decrypted content key.