5001results about How to "Reduce computing time" patented technology

An Ultra-Tightly Coupled GPS-inertial navigation system for use in a moving agile platform includes a range residual extractor that uses best curve fitting of a third order polynomial for estimating range residual. The curve-fitted residual is used to update an error Kalman filter. The error Kalman filter includes correction for navigation solution, and IMU and GPS parameters. The navigation solution together with GPS parameter corrections are used in a Tracking Predictor to generate high-sampling-rate carrier and code replicas. The curve-fitting error covariance indicates signal to noise ratio for the tracked GPS signal and may be used for early indication of interference or jamming.

The invention provides a system for providing traffic or related information including: a database storing historical traffic data being operable to receive substantially real time traffic data and associated data; means for integrating historical, real time and associated traffic data with respect to traveller profiles to produce customized forecasted traffic information with respect to those traveller profiles; and means for sending the customized forecasted traffic information to an intended recipient wherein the customized forecasted traffic information includes predicted travel delays for travel routes described in the traveller profiles.

A method of signing digital streams so that a receiver of the stream can authenticate and consume the stream at the same rate which the stream is being sent to the receiver. More specifically, this invention involves computing and verifying a single digital signature on at least a portion of the stream. The properties of this single signature will propagate to the rest of the stream through ancillary information embedded in the rest of the stream.

A method and apparatus for animating a synthetic body part. The 3D-animation system and method use a database of basic postures. In a first step, for each frame, a linear combination of the basic postures from a database of basic postures is obtained by minimizing the Euclidean distance between the displacement of critical points. The displacement information is supplied externally, and typically can be obtained by observing the displacement of physical markers placed on a moving physical body part in the real world. For instance, the synthetic body part may be an expression of a human face and the displacement data are obtained by observing physical markers placed on the face of an actor. The linear combination of the postures in the database of postures is then used to construct the desired posture. Postures are constructed for each time frame and are then displayed consecutively to provide animation. A computer readable storage medium containing a program element to direct a processor of a computer to implement the animation process is also provided.

The invention discloses an autonomous location and navigation method and an autonomous location and navigation system of a robot. The method comprises the following steps: acquiring the RGB image of the robot in the current position; carrying out characteristic point matching on the RGB image of the current position and an indoor three-dimensional point cloud map, and determining the current position of the robot in the indoor 3D point cloud map; carrying out characteristic point matching on a pre-stored RGB image of a destination and the indoor three-dimensional point cloud map, and determining the position of the destination in the indoor 3D point cloud map; and searching an optimal path from the current position to the destination position in the indoor 3D point cloud map, and driving the robot to run according to the optimal path. The method and the system have the advantages of completion of autonomous location and navigation through using a visual sensor, simple device structure, low cost, simplicity in operation, and high path planning real-time property, and can be used in the fields of unmanned driving and indoor location and navigation.

The invention provides a method for inland river bridge zone shipborne sailing active collision prevention. The method comprises the steps of collecting hydrological information, meteorological information and ship information of nearby ships and the ship, automatically updating river map information on line, and performing data storage; forecasting tracks of the ship and other ships according to obtained track information of the ship and other ships by combination with the real-time hydrological information and the meteorological information, and obtaining track information of every ship; calculating the nearest meeting distance and the nearest meeting time of the ship and a target object according to the obtained track information; and giving collision accident pre-warning and active collision prevention suggestions according to the nearest meeting distance and the nearest meeting time of the ship and the target object. According to the method, by predicating ship sailing situations, the shortcoming that an existing ship assistance navigation device cannot accurately obtain the position of the target object, and the nearest meeting distance and the reaching of the nearest meeting distance cannot be pre-judged more accurately is overcome.

A data processing system-implemented method or data processing system readable medium can be used to model operating parameter(s) for a vendor. Detailed analysis of the impact of prices or other variables, on the demand of each item, is performed. These allow us to prune large numbers of prices or other variables which have little or no impact on a given item. After determining which prices and other variables are significantly related to an item, a more in-depth examination of that small list of variables may be performed. This in-depth examination will result in a set of final weighing factors, quantifying the effect of each on the item. The weighing factors for all other variables can be assigned a value of zero. By limiting the number of non-zero weighing factors, the time needed to generate all the weighing factors for a matrix (or matrices) is reduced.

The present invention provides an S-shaped acceleration and deceleration control method for changing speed and position of an object on line. The method comprises the acceleration phase speed planning, the deceleration phase speed planning, the constant speed phase speed planning, the real speed reduction point predication, the maximum speed processing, the surplus distance compensation, the online object speed changing algorithm and the online object position changing algorithm. An acceleration and deceleration discretization speed planning method is employed and the user input parameters are combined to calculate the operation time of a seven-phase speed planning phase. It is determined whether the maximum acceleration and the maximum speed can reach the criterion or not, the integration problem of a sampling period Ts according to the acceleration/deceleration acceleration, the acceleration/deceleration speed and the final position L after discretization is considered, and the real reachable acceleration/deceleration acceleration, the acceleration/deceleration speed and the feed rate are corrected. The S-shaped acceleration and deceleration control method for changing speed and position of the object on line greatly simplifies an original calculation formula and saves lots of operation time of a computer, and the surplus distance employs a one-time compensation method in the speed reduction process.

The disclosed terrain model is a generative, probabilistic approach to modeling terrain that exploits the 3D spatial structure inherent in outdoor domains and an array of noisy but abundant sensor data to simultaneously estimate ground height, vegetation height and classify obstacles and other areas of interest, even in dense non-penetrable vegetation. Joint inference of ground height, class height and class identity over the whole model results in more accurate estimation of each quantity. Vertical spatial constraints are imposed on voxels within a column via a hidden semi-Markov model. Horizontal spatial constraints are enforced on neighboring columns of voxels via two interacting Markov random fields and a latent variable. Because of the rules governing abstracts, this abstract should not be used to construe the claims.

A method for decimating seismic traces in an acquisition of 3D data, recording, for each trace, the corresponding source-receiver couple coordinates (S_a1, R_a1), positioning on a decimation grid (D), divided into cells, the source-receiver couple that corresponds to each trace, regrouping all source-receiver couples into iso-path trace collections, where each collection regroups the traces whose seismic paths are identical or similar, organizing the traces in each iso-path collection, and selecting the first trace in each iso-path collection.

The invention provides a method and a device for avoiding an obstacle of an unmanned aerial vehicle. The method comprises the following steps of: detecting and judging whether the obstacle or an emergent threat exists in the forwarding direction of the unmanned aerial vehicle in real time; if the obstacle or the emergent threat exists, establishing an obstacle region at which the obstacle or the emergent threat is located, and establishing a collision avoidance behavior region according to an obstacle side closest to the unmanned aerial vehicle in the obstacle region; if the unmanned aerial vehicle enters the collision avoidance behavior region, calculating an obstacle avoidance velocity vector according to the closest obstacle side, wherein the obstacle avoidance velocity vector comprises obstacle avoidance velocity and obstacle avoidance direction of the unmanned aerial vehicle; calculating forwarding step of the unmanned aerial vehicle according to the obstacle avoidance velocity vector obtained through calculation; if not any obstacle or emergent threat is detected, calculating a target guide velocity vector according to target position, and calculating forwarding step of the target guide velocity vector; judging whether to achieve the target, if the target is not achieved, detecting and calculating again; or ending.

The invention discloses an authoritative author and high-quality paper recommending system and recommending method. According to each preset theme, the recommending system calculates an author authoritative value and a paper quality paper through a plurality of factors including an author level, a citation rate, publish date and a publish periodical or a meeting level of a paper, and hereby recommends an authoritative author and a high-quality paper with the specified theme, so as to avoid authors with low authoritative values or papers with low quality values in an author or paper recommending list, and to reduce system calculation burden and improve system response time. The system and the method, on the basis of properties of academic papers, introduce relates algorithms after taking various factors affecting the author authoritative value and the paper high-quality value into comprehensive consideration, so as to improve accuracy of recommended results, which not only recommends high-quality papers to users but also remarkably shortens calculation time, and the system and the method are good in a real-time updating effect; furthermore, the system can enhance diversity of recommended results in the paper recommending list, and overcome a shortcoming of an existing system which is narrow in user view.

A digital signature is applied to digital data in real-time. The digital signature serves as a mark of authenticity assuring a recipient that the digital data did in fact originate from an indicated source. The digital signature may be applied to any digital data, including video signals, audio signals, electronic commerce information, data pertaining to land vehicles, marine vessels, aircraft, or any other data that can be transmitted and received in digital form.

Some embodiments provide a controller for managing several managed switching elements that forward data in a network. The controller includes an interface for receiving input logical control plane data in terms of input events data. The controller includes an input scheduler for (1) categorizing the input events data into different groups based on certain criteria and (2) scheduling supplying of the input event data into a converter based on the groups so that the converter processes a group of input events data together. The controller includes the converter for converting the input logical control plane data to output logical forwarding plane data. The controller includes a network information base (NIB) data structure module for storing the output logical forwarding plane data. The logical forwarding plane data is for subsequent translation into physical control plane data.

Methods and apparatuses are presented for generating and updating heat maps for terrestrial wireless transceivers located in an area or venue. According to some embodiments, a method may include obtaining, by a mobile device, first signal data for a terrestrial transceiver and generating, by the mobile device, a transceiver heat map using the first signal data. The method may further include displaying, by the mobile device, a request to gather additional signal data for the terrestrial transceiver and obtaining, by the mobile device, second signal data for the terrestrial transceiver. The method may further include generating, by the mobile device, an updated transceiver heat map using the second signal data and displaying, by the mobile device, the updated transceiver heat map.

The invention discloses a depth learning target detection method based on pre-segmentation and regression, mainly to solve the problems that the existing target detection method is poor in small target detection precision and long in detection time. The method comprises steps: 1) a quadtree segmentation algorithm is used to extract a region of interest in a to-be-detected image; 2) a basic convolution layer and an auxiliary convolution layer are used to carry out feature extraction on the region of interest, and feature graphs of multiple scales are obtained; 3) the position information of a default border is calculated on the feature graphs of multiple scales, a convolution filter is used for detection on the feature graphs of multiple scales, and multiple predicted borders and multiple category scores are obtained; and 4) non-maximum suppression is used for the multiple predicted borders and the multiple category scores, and the final target border position and the category information are obtained. A small target in the image can be quickly and accurately detected, and the method can be used for target real-time detection in unmanned aerial vehicle aerial photographing.

Disclosed are methods for simulating pressures and saturations of oil, gas, and water in an oil reservoir with production and injection wells, which include (1) using of new approximating linear algebraic (finite difference) equations that more accurately represent actual pressures by basing the equations on new functional forms: ln(r) or 1/r, (2) solve the set equations using by defining a coarse grid array and a fine grid array nested in the fine grid array, and solving the coarse grid array and using the resulting solution to fix points in the fine grid array before it is solved, and (3) defining and solving a dynamic grid array based upon constant saturation contours.

A method for detecting a SQL injection attack comprises a training phase and a detection phase. In the training phase, a plurality of SQL queries is transformed into a respective plurality of SQL token domain queries which are processed using a n-gram analysis to provide a threshold and an averaging vector. In the detection phase, each newly arrived SQL query is transformed into a new SQL token domain query, and the n-gram analysis is applied together with the averaging vector and the threshold to each new SQL token domain query to determine if the new SQL query is normal or abnormal. The detection may be online or offline.

Methods and apparatus for reducing the search space processed by mask matching methods. The search space is reduced by grouping the candidate bit patterns into groups and subgroups that have internal bit agreement between the members. By only applying the mask matching methods to a select number of groups selected by their bit agreement with the target bit pattern, the computation time and memory requirement of the mask matching method is reduced.

The invention relates to a track planning method of a redundant space mechanical arm for on-track catching. The catching operation of the space mechanical arm is divided into a rough catching stage and a fine catching stage, so that problems are simplified. By aiming at outstanding problems of different stages, different planning algorithms are adopted. In the rough catching stage, a track searching algorithm based on configuration space is adopted, and the algorithm is based on the test in the configuration space; and in the fine catching stage, a pseudo-inverse algorithm based on kinematics is adopted, and the final precise catching is guaranteed by compensating the relative movement of a target.

An initial image is subjected to a plurality of segmentations into uniform components by using various criteria to identify and isolate several series of objects constituted by segmented thumbnail images associated with geometrical descriptors for boxes that cover said objects, the results of the segmentation methods are fused, numerical values are used to characterize each object thumbnail image that results from fusion, and each of the thumbnail images is compared with indexed thumbnail images in an indexed database containing a set of textual descriptions for everyday elementary objects. The list of textual descriptions of everyday elementary objects matching the object thumbnail images that result from the segmentation and fusion operations is provided together with pertinence levels.

The invention discloses a shortest path planning method for dynamic origins, and belongs to the technical field of dynamic path guidance in an intelligent traffic system. The shortest path planning method is used for optimizing vehicle traveling routes. The shortest path planning method always takes a current vehicle position as a starting point and predicts road condition information such as traffic flow of relevant road sections and road intersections, and the like for many times according to vehicle running time to calculate a shortest path according to a path planning algorithm in a no-request mode at regular time, thereby acquiring a shortest time path in accordance with the real-time conditions of a road network better and directly displaying the shortest time path on the screen of a vehicle navigation system; and meanwhile, by the method, the update operation amount is less so as to shorten calculation time.