Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

149results about How to "Increase computational cost" patented technology

Method and driver for determining drive values for driving a lighting device

The present invention relates to a method for determining drive values for driving a lighting device at a desired brightness and color. The method comprising the steps of determining a first luminous flux weight ratio based on the desired color and a first drive current for driving each of the differently colored LEDs, determining a first luminous flux for each of the differently colored LEDs based on the desired brightness and the first luminous flux weight ratio, comparing, for each of the differently colored LEDs, the first luminous flux with a nominal luminous flux for a plurality of different drive currents, selecting, for each of the differently colored LEDs, a preferred drive current that at least can produce the first luminous flux, determining a second luminous flux weight ratio based on the desired color and the selected drive currents for each of the differently colored LEDs, determining a second luminous flux for each of the differently colored LEDs based on the desired brightness and the second luminous flux weight ratio, and determining a duty cycle for each of the differently colored LEDs at the selected drive currents, wherein the selected currents at the determined duty cycles produces the second luminous flux for each of the differently colored LEDs. The present invention provides for the possibility to limit the number of necessary computational steps for determining preferred drive currents. Furthermore, an increase in number of current level and/or differently colored LEDs would only slightly increase the computational cost.
Owner:SIGNIFY HLDG BV

Sensor Fusion System and Method for Estimating Position, Speed and Orientation of a Vehicle, in Particular an Aircraft

This invention relates to a system for estimating the position, speed and orientation of a vehicle (10), comprising means for determining the components of two noncollinear constant unit vectors b, b according to vehicle body axes; means for determining the components of said noncollinear constant unit vectors {right arrow over (g)}t, {right arrow over (e)}t according to Earth's axes; means for determining the three components of angular velocity b of the vehicle in body axes; means for correcting said angular velocity b with a correction uω and obtaining a corrected angular velocity {circumflex over (ω)}b=b+uω; a control module (14) implementing a control law to calculate said correction uω, where said control law is:
uω=σ(b×ĝb+<?img id="custom-character-00007" he="3.13mm" wi="1.78mm" file="US20070213889A1-20070913-P00901.TIF" alt="custom character" img-content="character" img-format="tif" ?>b×êb)  [1]
where σ is a positive scalar,
such that upon using said corrected angular velocity {circumflex over (ω)}b=b+uω as input to a module for integrating the kinematic equations, the latter are stable in the ISS sense and the error in the estimation of the direction cosine matrix {circumflex over (B)} and of the Euler angles {circumflex over (Φ)} is bounded.
Owner:INST NACIONAL DE TECNICA AEROESPACIAL

Robot whole-situation path planning method facing uncertain environment of mixed terrain and region

The invention discloses a robot whole-situation path planning method facing an uncertain obstacle environment of mixed terrain and region, aiming to enabling the robot to finish a task by the lowest risk degree under a mixed terrain environment. The robot whole-situation path planning method comprises the following steps of: (1) detecting and constructing a robot working environment model comprising a movement starting point, a target point, static obstacle position and shape, a possible covering region of an uncertain obstacle, and covering terrain type and region; (2) adopting a weighting passable length of a terrain passable degree as a path evaluation performance index I; (3) adopting a path containing degree for describing an uncertain obstacle covering region covering degree as a path evaluation performance index II; (4) constructing a path feasible region according to a penetration degree between static obstacles to realize efficient path feasibility judgment and repairing; (5) extracting an advantage path public segment for automatically generating a feasible path; and (6) aiming at two performance indexes of the steps (3) and (4), adopting a multi-target cultural algorithm to realize path evolution and optimization.
Owner:CHINA UNIV OF MINING & TECH

Query optimization method based on join index in data warehouse

The invention relates to a query optimization method based on a join index in a data warehouse. The method comprises the following steps: creating a fact table foreign key join index based on a dimension table surrogate key; creating a join index update strategy; when a predicate condition exists on a dimension table, making a predicate judgment after direct access to dimension table record through the join index, and performing calculation through a dynamic bitmap join index by reference to a bitmap join index to generate a join bitmap index; when the selection rate on the dimension table is very low, further compressing a dimension table bitmap in order to raise the cache level of dimension table bitmap calculation; and calculating simple memory address access by only using an array-bitmap data structure with a reference bitmap join index calculation method based on co-processor memory calculation. Through adoption of the query optimization method, the calculation performance of the bitmap index can be effectively increased. Moreover, the query optimization method can be combined with high-performance co-processors such as GPU and Intel Xeon Phi TM to accelerate the index calculation performance, and can be widely applied to the field of data warehouses.
Owner:RENMIN UNIVERSITY OF CHINA

Variable resolution model based image segmentation

InactiveUS20090202150A1Effectively controlling smoothness of the computed model surface representedIncrease computational costImage enhancementImage analysisCoarse meshData set
The invention relates to system (100) for segmenting an image dataset based on a deformable model for modeling an object in the image dataset, utilizing a coarse mesh for adapting to the image dataset and a fine mesh for extracting detailed information from the image dataset, the system comprising an initialization unit (110) for initializing the coarse mesh in an image dataset space, a construction unit (120) for constructing the fine mesh in the image dataset space based on the initialized coarse mesh, a computation unit (130) for computing an internal force field on the coarse mesh and an external force field on the coarse mesh, wherein the external force is computed based on the constructed fine mesh and the scalar field of intensities, and an adaptation unit (140) for adapting the coarse mesh to the object in the image dataset, using the computed internal force field and the computed external force field, thereby segmenting the image dataset. Since only the coarse mesh is adapted to the image dataset, keeping the modeled object surface smooth does not require a smoothing of the surface over large neighboring areas, and therefore the adaptation of the coarse mesh is much faster than the adaptation of the fine mesh. Advantageously, the proposed technique can be easily integrated into existing frameworks of model-based image segmentation.
Owner:KONINKLIJKE PHILIPS ELECTRONICS NV

Method and driver for determining drive values for driving a lighting device

The present invention relates to a method for determining drive values for driving a lighting device at a desired brightness and color. The method comprising the steps of determining a first luminous flux weight ratio based on the desired color and a first drive current for driving each of the differently colored LEDs, determining a first luminous flux for each of the differently colored LEDs based on the desired brightness and the first luminous flux weight ratio, comparing, for each of the differently colored LEDs, the first luminous flux with a nominal luminous flux for a plurality of different drive currents, selecting, for each of the differently colored LEDs, a preferred drive current that at least can produce the first luminous flux, determining a second luminous flux weight ratio based on the desired color and the selected drive currents for each of the differently colored LEDs, determining a second luminous flux for each of the differently colored LEDs based on the desired brightness and the second luminous flux weight ratio, and determining a duty cycle for each of the differently colored LEDs at the selected drive currents, wherein the selected currents at the determined duty cycles produces the second luminous flux for each of the differently colored LEDs. The present invention provides for the possibility to limit the number of necessary computational steps for determining preferred drive currents. Furthermore, an increase in number of current level and / or differently colored LEDs would only slightly increase the computational cost.
Owner:SIGNIFY HLDG BV

Wind farm multi-model draught fan optimized arrangement method based on genetic algorithm

InactiveCN103793566ACoding is intuitiveIntuitive and accurate position relationshipSpecial data processing applicationsAlgorithmSquare mesh
The invention relates to a wind farm multi-model draught fan optimized arrangement method based on a genetic algorithm. The method includes the following steps that (1) a wind farm region is divided into square meshes which are the same in size according to the diameter of a draught fan, and an integer matrix which is the same in line and row is generated randomly to be used as the initial solution of the algorithm; (2) the individual fitness value of a current generation is calculated; (3) parent individuals participating in crossover are selected through even random selection operators, and then filial generation individuals are generated by the adoption of improved crossover and mutation operators; (4) repairing operators are introduced to the individuals in a population; (5) a Tabu operator is introduced to an optimal solution of the current generation of the population, the optimal solution is used as the initial solution of a Tabu algorithm, and the neighborhood solution of the optimal solution is searched for; (6) whether the biggest number of iterations is reached or not is judged, if yes, the multi-model draught fan optimized arrangement is completed, and if not, the step (2) is executed again. Compared with the prior art, the wind farm multi-model draught fan optimized arrangement method based on the genetic algorithm has the advantages of being visual in coding mode, good in performance index, high in local search capacity, high in expansibility, high in practicability and the like.
Owner:TONGJI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products