102 results about "Direct computation" patented technology

The present invention relates to lithographic apparatuses and processes, and more particularly to tools for optimizing illumination sources and masks for use in lithographic apparatuses and processes. According to certain aspects, the present invention significantly speeds up the convergence of the optimization by allowing direct computation of gradient of the cost function. According to other aspects, the present invention allows for simultaneous optimization of both source and mask, thereby significantly speeding the overall convergence. According to still further aspects, the present invention allows for free-form optimization, without the constraints required by conventional optimization techniques.

Apriori algorithms are popular data mining techniques for extracting association rules from a body of data. The computational complexity of these algorithms is reduced by representing itemset information at cells of a hypercube. The cells encode associations between the items of each transaction. Direct computation of a cell as a lexicographic combination of items accelerates the computation of itemsets, and thereby improves the computational runtime complexity of the apriori algorithm that discovers association rules. Even faster computation is achieved by a user selected cardinality that limits the maximum size of the itemsets.

A remote sensing image near-lossless compression hardware realization method based on improved JPEG-LS algorithm comprises the steps (1) directly calculating to obtain a pixel reconstruction value by the pixel actual value of an input image and accomplishing the calculation in a single clock period by using a formula Rx=int[Ix / (2Near+1)]*(2Near+1), in the formula, the Rx and the Ix are respectively the pixel reconstruction value and actual value, the int is rounding operation, and the Near is a compression ratio control factor; (2) calculating a context environmental variable Q according to the obtained pixel reconstruction value, if Q is equal to 0, performing run coding, otherwise, going to a step (3) of performing conventional coding; (3) calculating the predictive value of the current pixel by the pixel reconstruction value according to the geometric position relation between the current pixel and the adjacent pixel; (4) calculating the residual value between the predictive value and actual value of the current pixel; and (5) performing Golomb coding after quantising the obtained residual value, and synchronously updating the parameter variable corresponding to the context environmental variable Q using the quantisation result.

The invention relates to a multi-beam synthesis method and device based on delay parameter real-time calculation and assembly line. The device utilizes the separation of parameters requiring real-time calculation and parameters not requiring real-time calculation in delay calculation, the parameters related to the sequence number of beams and the separation of unrelated parameters to design the real-time delay calculation unit which only performs simple switching to adapt to different types of probes. The calculation unit adopts assembly line design, the delay parameters of M-numbered beams are calculated in the calculation unit in the assembly line mode and then the echo data storage units in the same path are read to realize delay of each beam. Therefore, the consumption of resources inFPGA is greatly reduced. The device of the invention uses direct calculation to obtain high delay precision. In order to solve the problem that too many hardware resources are occupied, the device ofthe invention adopts the assembly line design to ensure that M-numbered beams commonly use the delay parameter calculation unit, thus largely reducing the consumption of hardware resources.

The invention provides a monocular infrared video three-dimensional reconstruction method based on a visual odometer. Firstly, a thermal infrared imager is calibrated; then, a direct method and sparse method visual odometer model is constructed; then, frames are managed, a key frame is generated from a continuous infrared image sequence to be processed, and the key frame is marginalized; point management is conducted on the pixel on the key frame; finally, sliding window optimization is conducted on the key frame, a photometric error of the direct method and sparse method visual odometer model is minimized, the reverse depths of thermal infrared imager pose, internal references and spatial points are solved in an iterative algorithm by a gauss-newton method, and finally, three-dimensional point cloud of a scene is obtained. According to the monocular infrared video three-dimensional reconstruction method based on the visual odometer, the direct method is applied to photometric error minimization, traditional feature point detection and matching are skipped, through direction operation on a grey value of the pixel, all variables which the photometric error to be optimized depend on is calculated directly, and therefore three-dimensional reconstruction of a night vision scene is achieved, the real-time capability of the three-dimensional reconstruction is ensured, and the spaciousness of the scene is enhanced.

The invention relates to a scene switching code rate control method which comprises the following steps: judging whether the current coded image occurs the scene switching or not; and calculating quantization parameters which are applicable to a scene switching frame and using the quantization parameters for encoding if the scene switching occurs. The method can be conveniently integrated in a variety of prior video encoding standards. Compared with a variety of prior methods, the differences are as follows: the method does not change a GOP structure for encoding, does not re-distribute code rate, and directly calculates the quantization parameters for the scene switching frame.

The invention discloses a high-precision harmonic parameter estimation method based on a composite iterative algorithm. The method comprises the steps as follows: firstly, a harmonic amplitude value is directly calculated by utilizing a three-peak interpolation algorithm, and meanwhile, a harmonic phase is calculated to serve as an initial phase value for composite iteration, then the initial phase value is transmitted to a phase difference correction algorithm to obtain a frequency deviation value by utilizing the phase difference correction algorithm, and the phase difference correction algorithm is combined with a spectral leakage cancellation algorithm so as to obtain a phase value for the first-time iterative computation; circulating iteration is performed between the phase difference correction algorithm and the spectral leakage cancellation algorithm repeatedly until a phase iteration result meeting the error limit requirement is obtained. According to the invention, with the adoption of the three-peak interpolation algorithm, the estimation precision of the harmonic amplitude value is improved, and the phase obtained by utilizing the three-peak interpolation algorithm serves as an initial value, and the phase difference correction algorithm and the spectral leakage cancellation algorithm are combined to construct the composite iterative algorithm, so that the estimation precision of a harmonic phase and frequency is greatly improved.

Systems and methods for calculating a modification of a geometrical shape by applying an inverse modification function to an array representing the shape. An array representing the geometrical shape is defined on a multi-dimensional space. A modification function is used to modify the geometrical shape. A user or a programmed computer can select the modification function. The computer applies an inverse of the modification function to the array. The computer deduces a change in the geometrical shape from the modified array. An advantage of the system and method is the ability to compute shape changes in certain situations where a direct computation is cumbersome or otherwise inconvenient.

Methods and systems for displaying a network structure using force-directed layout are provided. The network includes a plurality of nodes, each node including an associated slack parameter having a value. The method including selecting a central time-directed axis, positioning each network node along the axis using the associated slack parameter value of the network node to determine a distance from the central time-directed axis, and applying force-directed computations to sets of concurrent nodes.

A system for contextual and risk-based multi-factor authentication having a multi-dimensional time series data server configured to monitor and record a network's traffic data and to serve the traffic data to other modules and a directed computation graph module configured to receive network traffic data from the multi-dimensional time series data server, determine a network traffic baseline from the network traffic data, and determine a verification score needed before granting access based at least in part by the network traffic baseline. A plurality of verification methods build up a user's verification score to required level to gain access.

This invention relates to signal process arithmetic coding field and relates to image or video coding method, which is characterized by the following: designing new small possibility quantity scheme and the coding range and uses the displacement and adding technique to reduce the possibility of the complexity.

The general problem of pattern change discovery between high-dimensional data sets is addressed by considering the notion of the principal angles between the subspaces is introduced to measure the subspace difference between two high-dimensional data sets. Current methods either mainly focus on magnitude change detection of low-dimensional data sets or are under supervised frameworks. Principal angles bear a property to isolate subspace change from the magnitude change. To address the challenge of directly computing the principal angles, matrix factorization is used to serve as a statistical framework and develop the principle of the dominant subspace mapping to transfer the principal angle based detection to a matrix factorization problem. Matrix factorization can be naturally embedded into the likelihood ratio test based on the linear models. The method may be unsupervised and addresses the statistical significance of the pattern changes between high-dimensional data sets.

The invention provides an electricity usage behavior analysis method based on an FCM clustering algorithm, comprising steps of (1) copying electricity usage data from a relation database into a distributed file system HDFS to determine the clustering number c and a stopping field Epsilon, (2) determining an initial clustering center according to the clustering result of the last time, and transmitting the data to data nodes participating distributed calculation, (3) performing pre-processing on the electricity usage data and producing a key value pair <user, profile>, (4) dividing all the key value pairs <user, profile> into a plurality of data subsets and transmitting the data subsets to a Map function for calculation, (5) transmitting the Map function calculation result to an Reduce node, wherein the Reduce task combines the middle key values produced by the Map according clustering numbers and then performs calculation to obtain a new clustering center, and (6) repeating the steps (2)-(5) until a membership grade matrix satisfies the conditions of the stopping field, finishing the algorithm and outputting the clustering result. The electricity usage behavior analysis method performs direction calculation based on the file massive history electricity usage data and obtains the electricity usage behavior characteristics.

Techniques for non-linear modeling of a physical system are provided using direct optimization of look-up table values. A non-linear system with memory is modeled by obtaining physical data for the non-linear system by applying a set of input samples x(n) to the non-linear system and measuring an output y(n) of the non-linear system; directly computing parameters Φ of a memory model for the non-linear system from the physical data, wherein the memory model comprises one or more look-up tables having linear interpolation and wherein the parameters Φ produce a substantially minimum mean square error; and providing the parameters Φ for storage as entries in the one or more look-up tables. The mean square error can be determined, for example, using one or more of a least squares algorithm, a least mean square algorithm and a recursive least squares algorithm. The look-up tables are optionally used in a processor instruction to implement digital pre-distortion.

The invention discloses a precoding method based on incomplete channel information in a space correlation multiple inputs, single output (MISO) system, and relates to the technical field of self-adaptation resource distribution in wireless communications. The precoding method comprises the following steps: building a MISO system and a channel model, confirming an effective signal to noise ratio of the system, confirming a condition correlation matrix and precoding beam forming matrix, confirming power distribution and a minimized system average bit rate in precoding, and confirming a bit error rate of the system. The precoding method can achieve closed power distribution and can avoid iterative computations of existing best practices. A power distribution expression is simple and can be calculated directly. Practical feedback errors are considered, and practicability is achieved. The method is low in complexity, low in cost, short in time delay and prone to being achieved.

A system for automated cyber physical threat campaign analysis and attribution, comprising a multi-dimensional time series and graph hybrid data server, an automated planning service module, and a directed computation graph module. A dataset is gathered from a monitored network and aggregated into a cyber-physical systems graph. Cyberattack simulations on the monitored network are made using exogenously collected data as input. Metrics are generated based on the cyber-physical systems graph and results from the cyberattack simulations, and the generated metrics are used to develop a threat profile.

Methods of mapping the shading dictionary parameters provided by a postscript language interpreter into device space coordinates and performing shading in the device space is disclosed. For radial shading, the shading transformation matrix representing the coordinate conversion from the shading space to device space is embedded within the shading mechanism parameters to directly compute the shading colour for a particular device space pixel, avoiding device coordinate transformations to the shading space. For triangle meshes based shading, the vertexes of the defined triangles are converted to device domain prior to performing interpolation for determining device pixel shading colour. For patch based shading, comprising of patches bounded by four Bezier curves, the Bezier curves are converted to the device domain to directly compute the corresponding shading parameter variables for a particular device pixel.

The embodiment of the invention discloses an early warning processing method and device based on a dynamic threshold, equipment and a storage medium. According to the embodiment of the invention, theearly warning threshold value of the index data in the next index period is calculated and obtained according to the historical data of the index data in the plurality of historical year-on-year indexperiods, so that the problem that the dynamic threshold value determined by using a sliding window cannot refer to the same-period change of the plurality of historical periods in the prior art can be avoided. Furthermore, according to the embodiment of the invention, the early warning threshold value in the next index period is directly calculated; the index data newly generated in the next index period is directly pre-warned according to the calculated pre-warning threshold, so that the pre-warning processing method based on the dynamic threshold provided by the embodiment of the inventionis stronger in real-time performance, higher in efficiency and suitable for real-time effective detection and pre-warning of the index data under a large-scale instance cluster.

The invention discloses a time and space significance visual attention method based on entropy, which comprises the following steps that: (1) a dynamic significance figure and a static significance figure in short video are extracted; (2) the static significance figure and the dynamic significance figure are connected to generate a final significance figure; (3) all winners win; (4) return inhibition: the pixel values of the most significant area in the final significance figure are set to be zero to obtain a novel final significance figure; and (5) attention selection. When calculating dynamic significance, the method directly calculates the dynamic significance among all frames and only calculates the static significance figure of a current frame, thereby well solving the problems of the prior art, saving the calculation time and well detecting the dynamic significance part; and in addition, the invention also applies a multi-scale method to calculate the dynamic significance so as to better calculate the dynamic significance of objects with different sizes in the video and obtain good visual effect.

The invention is an event processing system and method for network integrated management platform, this system adopts the flexible rule engine structure, not the mode for interpreting the execution rule, but process the rule in the pre-compiling mode, just at the time of creating the rule, compile it into the memory structure suitable for direct logic decision and put it in the system rule buffer memory, during the processing of events, directly calculate the value of logic expression, so as to save the time expensed for analyzing the text rule contents each time.

The present invention discloses a downward continuation recursive cosine transform method of a plane geomagnetic anomaly field, and belongs to the field of geomagnetic field data processing. The concrete steps are as follows: preprocessing measurement data of the plane geomagnetic anomaly field; gridding the measurement data of the plane geomagnetic anomaly field; calculating the cosine transformspectrum of the plane geomagnetic anomaly field by means of the recursive cosine transform; setting a small amount epsilon according to the precision requirement of downward continuation, and selecting the value of the damping factor alpha; directly calculating the spectrum of the continuation plane geomagnetic anomaly field through the compensation factors of the cosine transform spectrum on theobservation side and the downward continuation of the plane geomagnetic anomaly field; and carrying out one-dimensional recursive inverse cosine transform in row and in column on the spectrum to obtain a continuation value. According to the method disclosed by the present invention, large-distance downward continuation of the geomagnetic anomaly field can be stably carried out only through one-step spectral transformation and inverse transformation, so that the calculation amount of the downward continuation algorithm is reduced, the recursive algorithm has a small amount of calculation, and the precision of large-distance downward continuation of one-step spectral compensation of the plane geomagnetic anomaly field is improved.

A query language system is provided that includes a query component that specifies operations for one or more items in a data set. An aggregator component identifies one or more keys associated with the data set, the keys are supplied to one or more aggregators that perform direct computations from the keys in order to determine at least one aggregated value for the data set.

The invention relates to a system (100) for propagating a model mesh based on a first mean model mesh and on a second mean model mesh, the system comprising: a registration unit (110) for computing a registration transformation for registering the first model mesh with the first mean model mesh; a forward transformation unit (120) for transforming the model mesh into a registered model mesh using the registration transformation; a computation unit (130) for computing a propagation field for propagating the registered model mesh, the propagation field comprising vectors of displacements of vertices of the second mean model mesh relative to respective vertices of the first mean model mesh; a propagation unit (140) for transforming the registered model mesh into the propagated registered model mesh based on applying the vertex displacement vectors comprised in the propagation field to respective vertices of the registered model mesh; and an inverse transformation unit (150) for transforming the propagated registered model mesh into the propagated model mesh using the inverse of the registration transformation, thereby propagating the model mesh. Using the propagation field comprising vectors of displacements of vertices of the second mean model mesh relative to respective vertices of the first mean model mesh improves modeling motion of anatomical shapes. Advantageously, the propagation field of vertex displacement vectors is straightforward to compute and to apply.

The invention discloses a receiver and a method to process navigation signals from one or more GNSS constellation, wherein an observation model and a measurement model allow a direct calculation of the carrier phase ambiguities. More specifically, in a triple frequency implementation, the receiver calculates in turn the extrawidelane, widelane and narrowlane ambiguities. The code and carrier phase biases can also be directly calculated. Thanks to the invention a quicker acquisition and tracking of a precise position, which will also be less noisy than a prior art solution, especially in some embodiments of the invention using a RAIM and / or a gap-bridging function. Also, code smoothing using the Doppler and low latency clock synchronization allow to decrease the noise levels of the precise point navigation solutions.

Embodiments described herein provide techniques for computing an approximation of a function. These embodiments provide an iterative method that avoids the computation of the normal matrix and / or the coefficients, as is typical in the prior art. (See diagram 600, for example.) The iterative method works on the functions directly. At each iteration, the approximating function is computed directly. (See diagram 200.) Since there is no need to compute the normal matrix or the coefficients of the basis functions, this approach avoids the overhead associated with them, and therefore, increases the speed of computation and reduces resource requirements. For example, various embodiments are suitable for implementation on hardware devices such as on an FPGA or an ASIC.

The invention belongs to the technical field of information processing, and discloses an efficient erasure code lightweight automatic decoding method in a finite field, and an intelligent terminal module. The method comprises the steps: forming a check matrix according to each element generation rule; generating a unit matrix, and forming a new matrix by the matrix and the check matrix according to an up-down sequence; selecting the ith failure position, and determining a first non-zero element at the lower half part of the ith column of the new matrix; updating the row where other non-zero elements are located; setting the NZj row in the matrix as an all-zero element; when the matrix elements of the lower half part become all-zero elements, ending matrix transformation, wherein thecorresponding columns of the corresponding failure elements can be recovered if participating in the transformation process; and calculating the failure code elements in sequence. The failure code elements can be obtained through direct calculation, the thought is concise, code implementation of software and hardware is facilitated, matrix inversion operation on a finite field is eliminated, thecalculation workload required by decoding is greatly reduced, and the operation efficiency is improved.

Method and system for evaluating derivatives in screen space using perspective corrected barycentric coordinates. A preferred embodiment provides a method for computing the LOD at individual pixels directly without relying on approximations. In this embodiment, screen coordinates of a pixel and derivatives of the texture coordinates at the vertices of the triangle enclosing the pixel are determined. Derivatives of texture coordinates at the pixel with respect to screen space are evaluated by interpolation of the derivatives of the texture coordinates at the vertices using barycentric coordinates of the pixel. Then, using the derivatives of the texture coordinates and without relying on neighboring pixels' texture coordinates, the LOD at the pixel is computed, such that the LOD as computed is unbiased in any particular direction. Significantly, such direct computation allows exact LOD values to be easily computed and eliminates the artifacts that are inherent in prior art implementations. This embodiment also enables a higher level of parallel processing by eliminating the prerequisite of computing texture coordinates before computing LOD, thereby enhancing system performance. Another embodiment provides a method for computing derivatives of a function with respect to screen space, where the function can be interpolated in eye space by perspective corrected barycentric coordinates for a point in screen space. The method of this embodiment can be used to evaluate any n-order derivative where n is a positive integer.

The invention discloses a velocity field quick correction method and device based on a hydrodynamics continuity equation, and the device comprises a continuity equation discrete form module, a velocity field divergence calculation module, a derivation operator decomposition module, and a velocity field reconstruction module. The method achieves the direct calculation of a corrected velocity field through the eigenvalue decomposition of a one-dimensional derivation operator, and the obtained velocity field meets the continuity equation completely in a discrete form. The method achieves the most conservative correction of an original velocity field. The method and device can greatly improve the calculation efficiency, and reduce the consumption of a memory. The method is enabled to be higher in applicability.