4570 results about "Object function" patented technology

A Digital Design Method which may be automated is for obtaining timing closure in the design of large, complex, high-performance digital integrated circuits. The methodincludes the use of a tuner on random logic macros that adjusts transistor sizes in a continuous domain. To accommodate this tuning, logic gates are mapped to parameterized cells for the tuning and then back to fixed gates after the tuning. Tuning is constrained in such a way as to minimize “binning errors” when the design is mapped back to fixed cells. Further, the critical sections of the circuit are marked in order to make the optimization more effective and to fit within the problem-size constraints of the tuner. A specially formulated objective function is employed during the tuning to promote faster global timing convergence, despite possibly incorrect initial timing budgets. The specially formulated objective function targets all paths that are failing timing, with appropriate weighting, rather than just targeting the most critical path. Finally, the addition of multiple threshold voltage gates allows for increased performance while limiting leakage power.

A computer-implemented method to generate a placement for a plurality of instances for an integrated circuit (IC) by utilizing a novel weighted-average (WA) wirelength model, which outperforms a well-known log-sum-exp wirelength model, to approximate the total wirelength. The placement is determined by performing an optimization process on an objective function which includes a wirelength function approximated by the WA wirelength model. The method can be extended to generate a placement for a plurality of instances for a three-dimensional (3D) integrated circuit (IC) which considers the sizes of through-silicon vias (TSVs) and the physical positions for TSV insertion. With the physical positions of TSVs determined during placement, 3D routing can easily be accomplished with better routed wirelength, TSV counts, and total silicon area.

A signal processing system and method for breaking a time series into piece-wise discrete trends and determining whether new data represents the continuation of a trend. The method identifies and utilizes at least one set of trend determination parameters, which have favorable trend fit characteristics relative to other possible sets of parameters. In a semi-automated embodiment, the error and trend length characteristics are cross-plotted for multiple sets of possible parameters, and one or more of the parameter sets is selected from the graph. In an automated embodiment, an objective function is formulated from the characteristics, and an optimization technique is applied to identify one or more good parameter sets.

An automatic pricing method and apparatus for use in electronic commerce environments is described. Automatic pricing uses live price testing to estimate and measure demand for specific products—taking into account where appropriate, a vendor selected segmentation scheme. The results of live price testing are compared using a vendor selected goal function, e.g. profit maximization, to select a new price. A goal function that balances short term gains versus long term gains based on customer lifetime value is described. The live price testing approach used is designed to minimize losses due to price testing through statistical methods. Additionally, methods for distributing price testing across time so as to avoid problems caused by too many ongoing tests as well as side effects from testing are described. The selected price is a win for both purchasers and vendors as the automatic price will approximate the efficiency of a reverse auction without the inconvenience of the auction format while being goal maximizing for the vendor. For example, a vendor that normally sets prices of items for sale to customers can use embodiments of the invention to great effect.

The invention discloses an MIMO system and an application method thereof for adaptive antenna selection. The MIMO system comprises a transmitter, a receiver and a wireless channel; the process of the antenna selection which is realized in the MIMO system adopts an iterative feedback structure; a subset is selected quickly from a large amount of antenna sets by using the characteristic of 60 GHz channel without accurate channel estimation, so that a subchannel corresponding to an antenna subarray is optimal in the sense of a defined target function; and high speed data transmission is performed by using the selected optimal antenna subarray. The invention provides the rapid and efficient application method for the MIMO system along with low cost, and solves the technical problems of high complexity and low efficiency of the traditional antenna selection method in the large-scale the MIMO system. An experiment proves that: the adopted method can obtain good performance only through several iterations and low computational complexity; and the system can better support the application of the large-scale the antenna array.

A system generates optimal global set points for an environmental management system. The system comprises a system model for modeling components of a thermal plant, an objective function for modeling a parameter of the thermal plant, and an optimization engine for optimizing the parameter modeled by the objective function. The system model is coupled to an input data collector for receiving building data and weather data corresponding to a particular site. The system model includes models for thermal plant system components that may be implemented using classical models or artificial intelligence models. Classical models are those models that are implemented using linear programming, unconstrained non-linear programming, or constrained non-linear programming methodologies. The artificial intelligence models are those models that may be implemented using a fuzzy expert control system with crisp and fuzzy rules, genetic algorithms for optimization, or neural networks.

A method and system of providing comparative cost information for health insurance plans. Claims files are generated for the reference population of real historical patients for each the plans. Information is presented to users on the distribution of out-of-pocket costs for health care that users are likely to incur in the coming year, based on the parameters of health plans, information on the user and his/her household, and the actual health care use and costs for a reference population comparable to the users. Information is presented to users on optimal contributions to their flexible spending account for health care in the coming year and solving a dynamic numerical model based on users' objective function; solutions are based on the parameters of health plans, information on the user and his/her household, and the actual health care use and costs for a reference population comparable to the user.

A method for optimizing quantitative return-on-investment performance in an online advertising campaign. The advertising campaign has a finite campaign period and a finite spending budget within a system that includes a bidding facility for bidding on a plurality of advertising slots. The method seeks to optimize performance of the campaign according to an objective function that includes a marginal return on investment variable, which variable is maintained throughout a series of iterations. Techniques are disclosed for capturing campaign parameters and constraints from advertisers, and mathematical techniques are used in determining a selected advertising slot upon which to bid at each iteration. A tracking system provides a history of winning bids and forecast of inventory. After bidding, the value of the marginal return on investment variable is changed based on the results of the bidding. The next bidding operations are based on the value of the marginal return on investment variable.

Dynamical methods for obtaining the global optimal solution of general optimization problems having closed form or black box objective functions, including the steps of first finding, in a deterministic manner, one local optimal solution starting from an initial point, and then finding another local optimal solution starting from the previously found one until all the local optimal solutions starting from any initial point are found, and then finding from said points the global optimal solution.

An irradiation dose calculating unit can solve a problem of a conventional irradiation dose calculating unit in that since irradiation doses from portals are empirically determined, it is likely that optimum irradiation doses are not established for a target and a critical organ. A prescription data input section is used for a physician to input prescription data designating doses to a target and a critical organ. First and second object function calculating sections each calculate predefined indices, and obtain a first object function representing the level of satisfaction for the critical organ and a second object function representing the level of satisfaction for the target and critical organ. The irradiation doses from the portals are calculated based on these object functions such that the prescription data are satisfied.

One embodiment of the present invention provides a system that optimizes synchronization between monitored signals in a computer system. During operation, the system receives a number of monitored signals. The system then forms a number of signal pairs by grouping each signal with every other signal. Next, the system optimizes synchronization between the signals by iteratively perturbing the timing of each signal in an attempt to increase the value of an objective function which reflects the overall synchronization between all the signals.

The invention provides a vehicle autonomous parking path programming method used for multiple parking scenes. The method is used for automatically parking a vehicle in a parking space through an autonomous parking system when the autonomous parking system detects the available parking space. The method includes the steps that target parking space information is detected, and a parking scene is determined; the initial state and target state of the to-be-parked vehicle are determined; a vehicle kinematics differential equation is established; state variables and control variables of the vehicle are segmented, equidistance sampling is performed on each segment according to certain time step, and to-be-optimized variables are obtained; an equality constraint, boundary constraints and inequality constraints of the to-be-optimized variables are formed; motion range constraints of the to-be-parked vehicle are formed according to the motion range limit in the parking process of the vehicle; an optimization objective is determined, and an objective function is established; and by means of a nonlinear programming solver, an optimal solution of a parking path is obtained. The vehicle autonomous parking path programming method is suitable for the multiple parking scenes, the design is reasonable, abundant information can be provided so as to control autonomous parking of the vehicle, and the security coefficient is high.

A synchronous quick calibration method of a plurality of video cameras in a three-dimensional scanning system, which includes: (1) setting a regular truncated rectangular pyramid calibration object, setting eight calibration balls at the vertexes of the truncated rectangular pyramid, and respectively setting two reference calibration balls at the upper and lower planes; (2) using the video cameras to pick-up the calibration object, adopting the two-threshold segmentation method to respectively obtain the corresponding circles of the upper and lower planes, extracting centers of the circles, obtaining three groups of corresponding relationships between circle center points in the image and the centres of calibration ball in the space, solving the homography matrix to obtain the internal parameter matrix and external parameter matrix and obtaining the distortion coefficient, taking the solved video camera parameter as the initial values, and then using a non-linear optimization method to obtain the optimum solution of a single video camera parameter; (3) obtaining in sequence the external parameter matrix between a plurality of video cameras and a certain video camera in the space, using the polar curve geometric constraint relationship of the binocular stereo vision to establish an optimizing object function, and then adopting a non-linear optimization method to solve to get the optimum solution of the external parameter matrix between two video cameras.

A method and system connects a first terminal via multiple networks to a second terminal. An environment description is acquired and parsed by a description parser into cost parameters using a set of rules. An objective function evaluates the cost parameters to determine an optimal path to connect the first terminal to the second terminal through the multiple networks using a switch. The selection of the optimal path can be done periodically during a particular application session.

Systems and methods in accordance with various embodiments of the present invention provide for a system and method for simultaneous price optimization and asset allocation to maximize manufacturing profits. In one embodiment, a set of price points for the item and a set of expected demand values for each price point are determined. A supply-side constraint which models inventory, replenishment, and capacities associated with replenishment and a joining constraint, which requires that the set of expected demand values be equal to a planned supply of the item, are determined. A demand-side constraint is determined. Further, an objective function to maximize profits is determined, based on the set of price points, the set of expected demand values, and subject to the supply-side, joining, and demand-side constraints. Based on the objective function, an optimal price profile for the item is provided.

A topology optimization method. Characteristics of a structure to be designed are differentiated to calculate equivalent static loads. A relative fraction of material is adopted as a design variable. It is determined whether or not an element exists based on an objective function and constraints. Design topology is derived through a linear static analysis that processes the equivalent static loads as multiple loading conditions. Topology of the structure to be designed is compared with the design topology, and thereby the progress of optimization is determined. The topology optimization processes are terminated when a difference of the compared result is less than a setup value, and are returned to an initial step when the difference is greater than the setup value, and the equivalent static loads are calculated using the design topology as a new structure to be designed.

The present invention provides a system, method and apparatus for allocating resources with a linear programming model comprising an objective function and a set of constraints describing feasible allocations of the resources. The method ranks constraints based on a numerical measure derived from criteria selected from at least a first and second group and selects one or more of the top-ranked constraints. A new problem is determined from the model's objective function, the previously selected constraints, and the newly selected constraints, and a tentative resource allocation is determined based on the new problem. Whenever the tentative resource allocation violates a model constraint not in the current problem, one or more of the top-ranked such violated constraints are selected, and the new problem determination and tentative resource allocation steps are repeated. The resources are allocated according to the tentative resource allocation when it does not violate any model constraints.