30 results about "Cost criterion" patented technology

A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.

Symbol timing recovery employs a blind cost criterion from the Bussgang class of functions, and its stochastic gradient, to generate a timing phase error used to adjust sampling of received symbols. For one implementation, the estimate is derived in accordance with the Constant Modulus (CM) criterion and its gradient via the CM algorithm (CMA), and the estimate is calculated from a sequence of samples. This estimate is then used to adjust the period and phase of the sample sequence toward the period and phase of the transmitted symbols, driving the timing phase error to zero. The values used may be either i) samples themselves, ii) processed (e.g., interpolated) samples, or iii) equalized and processed samples. In addition, timing phase error estimates for other cost criteria, including the least mean squares algorithm, may be generated. These timing phase error estimates are selected either alone or in combination for deriving the timing phase error used to adjust the period and phase of the sample sequence.

A single-axis receiver processing, for example, complex vestigial sideband modulated signals with an equalizer with forward and feedback filters. Forward and feedback filters have parameters that are initialized and adapted to steady state operation. Adaptive equalization employs linear predictive filtering and error term generation based on various cost criteria. Adaptive equalization includes recursive update of parameters for forward and feedback filtering as operation changes between linear and decision-feedback equalization of either single or multi-channel signals. An adaptive, linear predictive filter generates real-valued parameters that are employed to set the parameters of the feedback filter. In an initialization mode, filter parameters are set via a linear prediction filter to approximate the inverse of the channel's impulse/frequency response and a constant modulus error term for adaptation of the filter parameters. In an acquisition mode, equalization is as linear equalization with a constant modulus error term, and possibly other error terms in combination, for adaptation of the filter parameters. In a tracking mode, equalization is as decision feedback equalization with decision-directed error terms for adaptation of the filter parameters. For some equalizer configurations, feedback filtering is applied to real-valued decisions corresponding to complex-valued received data, and includes real-part extraction of the error term employed for recursive update of filtering parameters. Where a training sequence is available to the receiver, initial parameters for forward filtering are estimated by correlation of the received signal with the training sequence.

A method controls the elevators in an elevator group when destination floor call input is used and the traffic within the elevator group is to be optimized. According to the concept of the method, based on traffic intensity, a cost function is optimized by changing the number of cost criteria from one to several and back and weighting the criteria in different ways in the aforesaid cost function.

A method and apparatus for simulating a modification to or expansion of a communications network and for determining whether the simulated modified or expanded network meets cost criteria. First logic forecasts an increase in network traffic. Second logic simulates a modification to or expansion of the network based on the forecasted increase in network traffic and/or based on performance improvement criteria and/or based on coverage expansion criteria. Third logic determines whether the simulated modified or expanded network meets cost criteria.

A method of anomaly detection applicable to telecommunications or retail fraud or software vulnerabilities uses inductive logic programming to develop anomaly characterization rules from relevant background knowledge and a training data set, which includes positive anomaly samples of data covered by rules. Data samples include 1 or 0 indicating association or otherwise with anomalies. An anomaly is detected by a rule having condition set which the anomaly fu,lfils. Rules are developed by addition of conditions and unification of variables, and are filtered to remove duplicates, equivalents, symmetric rules and unnecessary conditions. Overfitting of noisy data is avoided by an encoding cost criterion. Termination of rule construction involves criteria of rule length, absence of negative examples, rule significance and accuracy, and absence of recent refinement. Iteration of rule construction involves selecting rules with unterminated construction, selecting rule refinements associated with high accuracies, and iterating a rule refinement, filtering and evaluation procedure to identify any refined rule usable to test data. Rule development may use first order logic or Higher Order logic.

A method for processing digital map data for route determination is provided that includes dividing a region into a plurality of zones, and for the zones, automatically determining at least one cost value for at least one direction of travel of the zone based on the digital map data of the zone and a predetermined cost criterion. A method for determining a route between two points is provided that includes dividing a region into a plurality of zones, for the zones, automatically determining at least one cost value for at least one direction of travel of the zone based on the digital map data of the zone and a predetermined cost criterion, and automatically determining at least one sequence of zones connecting the two points, where each zone of the sequence may be adjacent to another zone of the sequence, such that the sum of the cost values of the zones of the sequence may be optimized.

The invention concerns a method for the computer-aided design of an aeronautic system forming all or part of an aircraft, using a criterion of maintenance time cost over a given period of use. The cost is computed as the weighted sum (250) of a first component (220) representing the mean flight time lost during this period, of a second component (230) representing the mean unscheduled maintenance time for this system during said period, and a third component representing the scheduled maintenance time for this system throughout said period. The configuration corresponding to the lowest time cost is then selected (260).

A method for optimal placement of cells on a surface of an integrated circuit, comprising the steps of comparing a placement of cells to predetermined cost criteria and moving cells to alternate locations on the surface if necessary to satisfy the cost criteria. The cost criteria include a timing criterion based upon interconnect delay, where interconnect delay is modeled as a RC tree expressed as a function of pin-to-pin distance. The method accounts for driver to sink interconnect delay at the placement level, a novel aspect resulting from use of the RC tree model, which maximally utilizes available net information to produce an optimal timing estimate. Preferred versions utilize a RC tree interconnect delay model that is consistent with timing models used at design levels above placement, such as synthesis, and below placement, such as routing. Additionally, preferred versions can utilize either a constructive placement or iterative improvement placement method.

A method for integrating a new navigation service is implemented in an avionics onboard system comprising a DAL+ core computer and a DAL− peripheral computer for managing the application. The method of integration determines an optimal functional and physical distribution of the elementary functions FU(i) of the new service within the onboard avionics system over the set of possible distributions which minimizes a global cost criterion CG, dependent on several parameters, including at least the additional development cost of the elementary functions integrated within the digital DAL+ core computer, and carries out the integration of the new service.

Data volumes for a customer can be placed on various storage tiers, including different hardware types or storage systems, that are determined to be appropriate for the anticipated usage of those data volumes. The actual usage can be monitored to determine one or more types of workload for the data volume, and a determination made as to whether all, or portions, of the data volume could obtain a significant performance improvement by being migrated to a different storage tier. In some instances the chunks or partitions of a volume can be concurrently distributed across multiple different storage tiers in order to satisfy various performance and/or cost criteria. Once workload information is available for a customer, that information can be used to determine the storage tiers for initial placement of subsequent data volumes.

The invention discloses a video coding method and a video coding device. The video coding method is characterized in that the following steps can be carried out sequentially by aiming at coding units CU having different depth values of a determined current largest coding unit LCU in a video frame: residual coefficient matrixes of brightness Y components, chroma U components, and chroma V components of transformation units TU to be processed can be acquired respectively, and the number of the non-zero residual coefficients of the brightness Y components, chroma U components, and chroma V components can be determined; when the TU to be processed is determined to be capable of satisfying the condition that the CBF values of any two components of the brightness Y components, chroma U components, and chroma V components of the TU to be processed are zero, the recursive traversal of the TU can be stopped. The optimal CU division structure can be determined based on the rate-distortion cost criteria, and the coding of the LCU can be carried out according to the optimal CU division structure, and therefore the times of the recursive traversal can be reduced, the time required by the coding can be saved, and the coding complexity can be reduced.

The invention relates to a rotary cultivator cutter shaft size multi-criterion design optimization method. According to the rotary cultivator cutter shaft size design, a bearing stress criterion function and a cost criterion function must be taken into consideration simultaneously; when the rotary cultivator cutter shaft size design is established, various restrictive conditions must be met, the minimum value corresponding to each criterion function is solved separately at first, then a multi-target ideal point non-linear planning problem is defined and a rotary cultivator cutter shaft optimal size parameter is finally calculated by a numerical optimization algorithm. The most important characteristic of the method is that the bearing stress criterion and the cost criterion of the rotary cultivator cutter shaft serve as considered targets, the two targets are correlated with a multi-target ideal point method, and the operation is simple and easy to understand; furthermore, the obtained result can meet the requirement of safe operation of the rotary cultivator cutter shaft and also can guarantee the economic property of the rotary cultivator cutter shaft to a great degree.

A method for arithmetic coding of symbols in a stream is described. The method comprises the following steps:

• • coding a current symbol with a current probability model, and
  • updating the current probability model according to the coding of the current symbol.
  • selecting the current probability model in a set of at least two probability models according to a coding cost criterion, and
  • coding an identifier of the selected probability model.

The invention relates to a method for encoding a digital image, said image (Im) being divided into a plurality of blocks of pixels (C) processed in a defined order, said method comprising the following steps, implemented for a current block, of processing (E1) the current block intended to provide a set of description elements of the processed block; selecting (E2) a subset of at least two description elements to predict in the provided set; ordering (E4) the description elements of the subset into an ordered sequence; encoding elements of the sequence. According to the invention, the step ofencoding the elements of the sequence includes browsing the elements of the sequence and includes, for a current element, the following sub-steps: selecting a combination of the values of the description elements of the sequence from a plurality of combinations as a function of a predetermined cost criterion and, from the second element, values of description elements previously processed in the sequence; predicting the current element of the sequence from the value thereof in the selected combination; encoding an indicator representing a difference between the actual value of the current element and its predicted value.