60results about How to "Minimizing function" patented technology

The present disclosure relates to an inhaler component for producing a steam/air mixture or/and condensation aerosol in an intermittent and inhalation- or pull-synchronous manner, the inhaler component including: a housing; a chamber arranged in the housing; an air inlet opening for the supply of air from the surroundings to the chamber; an electrical heating element for evaporating a portion of a liquid material; and a wick having a capillary structure, which wick forms a composite structure with the heating element and automatically supplies the heating element with fresh liquid material after evaporation.

A system and method for real time dispatching of vehicles taking into account multiple point to point transport requests and conditions including desired ride conditions, traffic, and infrastructure. Analysis of these factors is using suitable algorithms in order to determine optimal routes.

Methods and systems for finding optimal or near optimal solutions for generic optimization problems by an approach to minimizing functions over high-dimensional domains that mathematically model the optimization problems. Embodiments of the disclosed invention receive a mathematical description of a system, in symbolic form, that includes decision variables of various types, including real-number-valued, integer-valued, and Boolean-valued decision variables, and that may also include a variety of constraints on the values of the decision variables, including inequality and equality constraints. The objective function and constraints are incorporated into a global objective function. The global objective function is transformed into a system of differential equations in terms of continuous variables and parameters, so that polynomial-time methods for solving differential equations can be applied to calculate near-optimal solutions for the global objective function. Embodiments of the present invention also provide for distribution and decomposition of global-gradient-descent- field-based optimization methods, by following multiple trajectories, and local-gradient- descent-field-based optimization methods, by using multiple agents, in order to allow for parallel computation and increased computational efficiency. Various embodiments of the present invention further include approaches for relatively continuous adjustment of solutions to optimization problems in time, to respond to various events, changes in priorities, and changes in forecasts, without needing to continuously recalculate optimization solutions de novo. While many embodiments of the present invention are specifically directed to various classes of optimization problems, other embodiments of the present invention provide a more general approach for constructing complex hierarchical computational processes and for optimally or near optimally controlling general computational processes.

Phase-based TOF systems operate with reduced depth error due to motion blur, and/or spatial blur, and/or pixel offset by intelligently determining how best to combine pixel values, and how best to compensate for individual pixel offsets. Such determination(s) may be carried out on a per pixel basis, dynamically, in real-time during TOF operation, or on archived TOF data. Offsets for individual pixels may be dynamically calculated and subtracted from the values acquired by those pixels Individual pixel offsets may be calculated for example by combining data acquired by the same pixel at two acquisitions, 180° out of phase with respect to each other. Calculated offsets may be averaged, or on a per pixel basis, and if target object motion is detected, one or more offset calculations can be discarded rather than averaged to reduce motion blur. Offsets acquired a priori during a TOF system calibration procedure may be used.

The method comprises the following steps:

• • during the first pass, a memorization of the M best coding modes and their coding parameters per image macroblock,
  • during the second pass, a calculation, according to the new quantization step determined by the regulating algorithm according to the parameters memorized, among the M coding modes memorized, of the coding mode minimising the bitrate-distortion criterion, to select it,
  • a coding according to the selected coding mode.

The applications relate to the compression of data.

A system and method is disclosed for operating an internal combustion engine disposed in a hybrid vehicle, in which engine operation is selected to provide secondary vehicular functions, such as cabin heating, cabin cooling, and exhaust aftertreatment of exhaust components.

A system is employed for modifying a hierarchical description of a design to reveal the data flow of the design. The modified design provides a more favorable input for block placement. In one embodiment, the modifications includes any one of or a combination of moving hard macros to a higher level of the hierarchical description of the design, flattening modules that are bigger than a threshold, and/or flattening star blocks. Up to three clustering strategies are employed as part of the flattening process, including name-based clustering, external connection based clustering and gate clustering.

Disclosed is means capable of solving trouble in managing data formats and procedures and capable of carrying out advanced preprocessing more intuitively. A data aggregate to be inputted to a mining engine is converted into hierarchical unit trees, and node conditions of the hierarchical unit trees are changed, whereby the data aggregate and a data structure are subjected to dynamic conversion/edition processing. Thus, a system is constructed, in which preprocessing for data mining is unitarily managed/semi-automated.

The present invention relates to a method for optimizing a real cellular, wireless communication network that combines mobility load balancing (MLB) with coverage and capacity optimization (CCO) in a joint and coordinated optimization. An optimal set of physical base station parameters is determined by performing an iterative direct search. The iterative direct search comprises a partitioning strategy to jointly determine an optimal partition of the served area and an associated optimal load of each of the plurality of base stations for a current set of physical base station parameters for each direct search iteration; said partitioning strategy using an updated value of the received power of the pilot or reference signal for each the plurality of user locations associated with the current set of physical base station parameters for each direct search iteration.

Provided is an iterative method of estimating the pose of a moving PTZ camera. The first step is to use an image registration method on a reference image and a current image to calculate a matrix that estimates the motion of sets of points corresponding to the same object in both images. Information about the absolute camera pose, embedded in the matrix obtained in the first step, is used to simultaneously recalculate both the starting positions in the reference image and the motion estimate. The recalculated starting positions and motion estimate are used to determine the pose of the camera in the current image. The current image is taken as a new reference image, a new current image is selected and the process is repeated in order to determine the pose of the camera in the new current image. The entire process is repeated until the camera stops moving.

A method and system for drawing directed graphs including receiving data coordinates associated with nodes for graphing, performing a constrained stress minimization, and outputting results of the constrained stress minimization and displaying the results on a visual medium. The described method may take the form of instructions residing on a computer readable medium. The described method and system may be utilized for drawing directed graphs in a very wide range of applications ranging from gene networks, to flowcharts, to display of relational characteristics of breakfast cereal and so on.

A method for segmenting an object in a digital image includes computing, for each point v_i in the image, weights w_ijk of a curvature clique v_iv_iv_k for each successive pair of edges e_ij, e_ik incident on point v_i, decomposing each curvature clique into pairwise edge weights to form a new set of edges by adding, for all points v_j, v_k, an edge e_ij with weight w_ij, an edge e_ik with weight w_ik, and an edge e_jk with weight w_jk, where weight w_ij equals weight w_ik equals ½ w_ijk, and weight w_jk equals −½ w_ijk, computing an indicator function of the points of the image indicative of whether each point belongs to an object of interest by minimizing a functional of the indicator function, and segmenting the object of interest from the image based on the value of the indicator function x at each image point.

A control input (DUT) for controlling a heater (13) which heats an active element (10) of an exhaust gas sensor (8) includes at least one of another component depending on the difference between temperature data of the active element (10) and a target temperature, a component depending on the target temperature, and a component depending on the temperature data of the active element (10). The control input is determined by an optimum control algorithm. A component depending on the temperature of an exhaust gas and the component depending on the target temperature are determined based on a predictive control algorithm. The temperature of the active element (10) of the exhaust gas sensor (8) is thus controlled stably at a desired temperature.

A method for animating soft body characters has a preparation phase followed by an animation phase. In the preparation phase, the skin deformation of the character model is determined for a set of basis poses. The skin deformation from posing is compactly represented in terms of the set of basis poses. In the animation phase, the set of basis poses and the skin mode response are used to create a final posed character. A desired character pose is projected onto the basis set to determine a set of basis weights. The basis weights are applied to the set of skin responses to create a skin pose response, and the skin pose responses is projected onto the basis set to create the posed character model.

A multiple input multiple output (MIMO) communication system and communication method of configuring a codebook are provided. A channel may be formed between a transmitter and a receiver, and a cross-polarization discrimination value (XPD) may be detected. The XPD may vary based on a location of the transmitter and the receiver, a mobility thereof, or a peripheral environment, among other factors. The codebook may be configured based on the XPD.

This invention relates to a method and device for calibrating the offset of an imaging system. The core idea of the invention is to place a reference object in the measurement chamber of the imaging system, measure the signals associated with the reference object at different points of time, calculate the merit function based on changes of the parameters representing the electromagnetic property of the reference object, and derive an optimal set of offset data that minimizes the value of the merit function for compensating the offset of the system in subsequent image reconstructions. In one embodiment, the invention uses a reference object comprising a non-conductive envelope and a cavity which can be filled with a conductive fluid and emptied, and in this way reduces the imaging interference caused by the reference object during monitoring.

A netlist for an integrated circuit design is constrained by virtual or “soft” pins to control or stabilize the placement of logic such as an architectural logic path. One soft pin is inserted at a fixed location proximate an input net of the path and is interconnected with the input net, and another is inserted at a fixed location proximate the output net and is interconnected with the output net. Cell placement is then optimized while maintaining the virtual pins at their fixed locations. More than two virtual pins may be inserted to bound a cluster of logic. The virtual pins may lie along the input/output nets. Pseudo-net weights are assigned to pseudo-nets formed between a cell and the virtual pins, and the pseudo-net weight can be increased for each placement iteration.